text
stringlengths 1
22.8M
|
|---|
```javascript
const fs = require('fs');
const path = require('path');
const glob = require('glob');
const matter = require('gray-matter');
module.exports = function getDocsFromDir(dir) {
// docs/
const baseDir = path.join(__dirname, '../docs/');
const docsDir = path.join(baseDir, dir);
function getMarkdownOrder(filepath) {
return (matter(fs.readFileSync(filepath, 'utf-8')).data || {}).order || 100;
}
function isDocHide(filepath) {
return (matter(fs.readFileSync(filepath, 'utf-8')).data || {}).hide || false;
}
const docs = glob.sync('*.md', {
cwd: docsDir,
// ignore: 'README.md',
});
const result = docs
.map((doc) => path.join(docsDir, doc))
.filter((doc) => !isDocHide(doc))
.sort((a, b) => {
const orderA = getMarkdownOrder(a);
const orderB = getMarkdownOrder(b);
return orderA - orderB;
})
.map((filepath) => {
// /Users/xxx/site/docs/guide/basic/router.md => guide/basic/router
const id = path.relative(baseDir, filepath).replace(/\.md/, '');
return id;
});
return result;
};
```
|
Bugsy is a 1991 American biographical crime drama film directed by Barry Levinson and written by James Toback. The film stars Warren Beatty, Annette Bening, Harvey Keitel, Ben Kingsley, Elliott Gould, Bebe Neuwirth, and Joe Mantegna. It is based on the life of American mobster Bugsy Siegel and his relationship with wife and starlet Virginia Hill.
Bugsy was given a limited release by TriStar Pictures on December 13, 1991, followed by a theatrical wide release on December 20, 1991. It received generally positive reviews from critics and was a minor box office hit, grossing $49.1 million on a $30 million budget. It received ten nominations at the 64th Academy Awards (including for Best Picture and Best Director) and won two: Best Art Direction and Best Costume Design. It won the Golden Globe Award for Best Motion Picture - Drama.
Plot
In 1941, gangster Benjamin "Bugsy" Siegel, who had partnered in crime since childhood with Meyer Lansky and Charlie Luciano, goes to Los Angeles and instantly falls in love with Virginia Hill, a tough-talking Hollywood starlet. The two meet for the first time when Bugsy visits actor George Raft on the set of Manpower. He buys a house in Beverly Hills, planning to stay there while his wife and two daughters remain in Scarsdale, New York.
Bugsy is in California to wrestle control of betting parlors away from weak Los Angeles crime family boss Jack Dragna. Ascending local Jewish gangster Mickey Cohen robs Dragna's operation one day. He is confronted by Bugsy, who decides he should be in business with the guy who committed the robbery, not the guy who got robbed. Cohen is put in charge of the betting casinos; Dragna is forced to confess to a raging Bugsy that he stole $14,000 and is told he now answers to Cohen.
After arguments about Virginia's trysts with drummer Gene Krupa and various bullfighters and Bugsy's reluctance to get a divorce, Virginia makes a romantic move on Bugsy. On a trip to Nevada to make a maintenance call to a rough gambling joint, Bugsy is struck with the inspiration for a luxury hotel and casino in the desert of Nevada, which happens to be in the only state where gambling is legal. He obtains $1 million in funding from Lansky and other New York City mobsters, on the motion of going big, doing it legit in Nevada. Virginia wants no part of it until Bugsy offers her a share, puts her in charge of accounting and begins constructing the Flamingo Las Vegas Hotel Casino in Las Vegas; however, the budget soon soars out of control to $6 million due to his extravagance. Bugsy tries everything to ensure it gets completed, even selling his share of the casino.
Bugsy is visited in Los Angeles by former associate Harry Greenberg, who has betrayed his old associates to save himself and run out of money from a combination of his gambling habits and being extorted by prosecutors who want his testimony. Though he is Harry's trusted friend, Bugsy has no choice but to kill him. He is arrested for the murder, but the only witness is a cab driver who dropped Harry off in front of Bugsy's house. The driver is paid to leave town.
Lansky waits for Bugsy outside the jail and gives a satchel of money to his friend, though warns that he will no longer be able to protect Bugsy. The Flamingo's opening night is a total failure in a rainstorm, and $2 million of the budget is unaccounted for. Bugsy discovers that Virginia stole the money, which he then lets her keep. He then urges Lansky never to sell his share of the casino because he will live to thank him someday.
Later that night, Bugsy is shot and killed in his home. Virginia is told the news in Las Vegas and knows her own days could be numbered.
The end title cards state that one week after Bugsy's death, Virginia returned all of the missing money to Lansky and later committed suicide in Austria, and by 1991, the $6 million invested in Bugsy's Las Vegas dream had generated revenues of $100 billion.
Cast
Warren Beatty as Ben "Bugsy" Siegel
Annette Bening as Virginia Hill
Harvey Keitel as Mickey Cohen
Ben Kingsley as Meyer Lansky
Elliott Gould as Harry Greenberg
Joe Mantegna as George Raft
Bebe Neuwirth as Countess Dorothy di Frasso
Bill Graham as Charlie Luciano
Lewis Van Bergen as Joe Adonis
Wendy Phillips as Esta Siegel, Bugsy's first wife
Richard C. Sarafian as Jack Dragna
Carmine Caridi as Frank Costello
Andy Romano as Del Webb, general contractor for The Flamingo
Wendie Malick as Inez Malick
Stefanie Mason as Millicent Siegel, Bugsy's elder daughter
Kimberly McCullough as Barbara Siegel, Bugsy's younger daughter
Don Calfa as Louie Dragna, Jack Dragna's nephew and cohort
Ray McKinnon as David Hinton, architectural designer of the Flamingo
Joe Baker as Lawrence Tibbett, a famed opera singer whose house Bugsy buys
Ksenia Prohaska as Marlene Dietrich, George Raft's co-star in Manpower
Gian-Carlo Scandiuzzi as Count di Frasso, an Italian aristocrat and personal friend of Benito Mussolini
Joseph Roman and James Toback as Moe Sedway and Gus Greenbaum, the mobsters who take control of The Flamingo after Bugsy's murder
Other cast members in smaller roles include Robert Glaudini as Dominic Manzella, Jack Dragna's hatchet man; Eric Christmas as Ronald the butler, Robert Beltran as Alejandro, Don Carrara as Vito Genovese, Bryan Smith as Chick Hill, Virginia's brother; Traci Lind as Natalie St. Clair, and Debrah Farentino and Wendie Malick as two of Bugsy's one-night stands.
Production
Beatty's desire to make and star in a film about Bugsy Siegel can be traced all the way back to the late 1970s and early 1980s. After completing Reds, Beatty had several projects that he wanted to do but his two dream projects were to produce, star, and possibly direct the life story of Howard Hughes and the life story of Bugsy. Beatty stated that of all the characters he played in films, such as Clyde Barrow in Bonnie and Clyde and John Reed in Reds, he felt that he was the right actor to play both Bugsy and Hughes.
Beatty was fascinated by Siegel, who he thought was a strange emblem of America (an American gangster who was the son of Jewish immigrants who became fascinated with Hollywood and who also envisioned a desert city in which legal gambling is allowed). Several filmmakers attempted to make a film based on Bugsy's life, most famously French director Jean-Luc Godard, who wrote a script entitled The Story and envisioned Robert De Niro as Siegel and Diane Keaton as Virginia Hill.
In the late 1970s, Beatty met screenwriter James Toback, with whom he became fast friends when Beatty was preparing Heaven Can Wait. Years later, when Beatty was in pre-production on Ishtar, he asked Toback to write a script on Bugsy.
During the course of six years and in between two films that he was involved in, Toback wrote a 400-page document of Bugsy's life. However, under some strange circumstances, Toback lost the entire document. Under pressure from Warner Bros., who Beatty learned also had a Bugsy Siegel script ready to be produced, Beatty pursued Toback to write a script based on his lost document. Toback handed his new script to Beatty. Beatty approved it and went to several studios in hopes of obtaining financing and distribution for the film. Beatty presented Toback's script to Warner Bros. and claimed that it was much better than the one that Warner Bros. was interested in producing. Warner Bros. passed on the project, and Beatty eventually got the backing of TriStar Pictures.
Initially, Toback was under the impression that he would be the director. For a while, Beatty could not find a director (he did not know or chose not to know of Toback's desire to direct the film). Beatty feared that he would be stuck in the position of having to direct the film himself. He said, "I'm in just about every scene of the picture, and I didn't want to have to do all that other work." However, Beatty announced to Toback that Barry Levinson was on board to direct Bugsy. At first, Toback was disappointed, but he quickly learned that Levinson was the right person for the job. Despite the length of the script (which would have run three and a half to four hours), Beatty, Levinson, and Toback condensed it to a two-and-a-half to three-hour script. The trio worked very closely together during the production of the film.
During casting, Beatty wanted Annette Bening to play the role of Virginia Hill. Before Bugsy, Bening was a candidate to play Tess Trueheart in Beatty's Dick Tracy. After seeing her audition, Beatty phoned Levinson and told him, "She's terrific. I love her. I'm going to marry her". Levinson thought Beatty was just excited at her audition and did not think that Beatty actually meant what he had said. Both Beatty and Bening stated that their relationship started after completing the film. Later that summer, Bening became pregnant with her and Beatty's first child, which resulted in a tabloid/media frenzy at the time. The child was born January 8, 1992, and the couple married on March 12.
Originally, Beatty played Bugsy with a heavy New York City accent (which can be heard in the trailer). However, both Levinson and Toback thought that the accent was not right, so Beatty dropped the accent (which he thought was "charming") and used his normal voice.
Principal photography began in January 1991, and filming wrapped in May 1991. Portions of the film were shot in the Coachella Valley, California.
Release
Bugsy had a limited release on December 13, 1991, and was released nationwide on December 20, 1991. A director's cut was released on DVD, containing an additional 13 minutes not seen in the theatrical version.
Reception
On Rotten Tomatoes the film has a rating of 84% based on 61 reviews. The site's critical consensus reads, "Stylishly scattered, Bugsy offers cinematic homage to the infamous underworld legend, chiefly through a magnetic performance from Warren Beatty in the title role." Metacritic gave the film a score of 80 based on 27 reviews, indicating "generally favorable reviews". Film critic Roger Ebert gave the film four of four stars, saying "Bugsy moves with a lightness that belies its strength. It is a movie that vibrates with optimism and passion, with the exuberance of the con-man on his game."
Accolades
The film is recognized by American Film Institute in these lists:
2003: AFI's 100 Years...100 Heroes & Villains:
Bugsy Siegel – Nominated Villain
2005: AFI's 100 Years...100 Movie Quotes:
Virginia Hill: "Why don't you go outside and jerk yourself a soda?" – Nominated
2008: AFI's 10 Top 10:
Nominated Gangster Film
See also
List of films set in Las Vegas
References
External links
1991 films
1991 crime drama films
1990s biographical drama films
American crime drama films
American biographical drama films
1990s English-language films
Biographical films about gangsters
Cultural depictions of Bugsy Siegel
Cultural depictions of Lucky Luciano
Cultural depictions of Meyer Lansky
Cultural depictions of Joe Adonis
Cultural depictions of Frank Costello
Films about gambling
Films about the American Mafia
Films about Jewish-American organized crime
Films directed by Barry Levinson
Best Drama Picture Golden Globe winners
Films scored by Ennio Morricone
Films set in casinos
Films set in the Las Vegas Valley
Films set in Los Angeles
Films set in the 1940s
Films shot in California
Films that won the Best Costume Design Academy Award
Films whose art director won the Best Art Direction Academy Award
TriStar Pictures films
Films produced by Warren Beatty
American films based on actual events
Mafia films
American gangster films
1990s American films
|
```c
#include <stdlib.h>
#include <oqs/sig_falcon.h>
#if defined(OQS_ENABLE_SIG_falcon_1024)
OQS_SIG *OQS_SIG_falcon_1024_new(void) {
OQS_SIG *sig = malloc(sizeof(OQS_SIG));
if (sig == NULL) {
return NULL;
}
sig->method_name = OQS_SIG_alg_falcon_1024;
sig->alg_version = "20211101 with PQClean patches";
sig->claimed_nist_level = 5;
sig->euf_cma = true;
sig->length_public_key = OQS_SIG_falcon_1024_length_public_key;
sig->length_secret_key = OQS_SIG_falcon_1024_length_secret_key;
sig->length_signature = OQS_SIG_falcon_1024_length_signature;
sig->keypair = OQS_SIG_falcon_1024_keypair;
sig->sign = OQS_SIG_falcon_1024_sign;
sig->verify = OQS_SIG_falcon_1024_verify;
return sig;
}
extern int PQCLEAN_FALCON1024_CLEAN_crypto_sign_keypair(uint8_t *pk, uint8_t *sk);
extern int PQCLEAN_FALCON1024_CLEAN_crypto_sign_signature(uint8_t *sig, size_t *siglen, const uint8_t *m, size_t mlen, const uint8_t *sk);
extern int PQCLEAN_FALCON1024_CLEAN_crypto_sign_verify(const uint8_t *sig, size_t siglen, const uint8_t *m, size_t mlen, const uint8_t *pk);
#if defined(OQS_ENABLE_SIG_falcon_1024_avx2)
extern int PQCLEAN_FALCON1024_AVX2_crypto_sign_keypair(uint8_t *pk, uint8_t *sk);
extern int PQCLEAN_FALCON1024_AVX2_crypto_sign_signature(uint8_t *sig, size_t *siglen, const uint8_t *m, size_t mlen, const uint8_t *sk);
extern int PQCLEAN_FALCON1024_AVX2_crypto_sign_verify(const uint8_t *sig, size_t siglen, const uint8_t *m, size_t mlen, const uint8_t *pk);
#endif
#if defined(OQS_ENABLE_SIG_falcon_1024_aarch64)
extern int PQCLEAN_FALCON1024_AARCH64_crypto_sign_keypair(uint8_t *pk, uint8_t *sk);
extern int PQCLEAN_FALCON1024_AARCH64_crypto_sign_signature(uint8_t *sig, size_t *siglen, const uint8_t *m, size_t mlen, const uint8_t *sk);
extern int PQCLEAN_FALCON1024_AARCH64_crypto_sign_verify(const uint8_t *sig, size_t siglen, const uint8_t *m, size_t mlen, const uint8_t *pk);
#endif
OQS_API OQS_STATUS OQS_SIG_falcon_1024_keypair(uint8_t *public_key, uint8_t *secret_key) {
#if defined(OQS_ENABLE_SIG_falcon_1024_avx2)
#if defined(OQS_DIST_BUILD)
if (OQS_CPU_has_extension(OQS_CPU_EXT_AVX2)) {
#endif /* OQS_DIST_BUILD */
return (OQS_STATUS) PQCLEAN_FALCON1024_AVX2_crypto_sign_keypair(public_key, secret_key);
#if defined(OQS_DIST_BUILD)
} else {
return (OQS_STATUS) PQCLEAN_FALCON1024_CLEAN_crypto_sign_keypair(public_key, secret_key);
}
#endif /* OQS_DIST_BUILD */
#elif defined(OQS_ENABLE_SIG_falcon_1024_aarch64)
#if defined(OQS_DIST_BUILD)
if (OQS_CPU_has_extension(OQS_CPU_EXT_ARM_NEON)) {
#endif /* OQS_DIST_BUILD */
return (OQS_STATUS) PQCLEAN_FALCON1024_AARCH64_crypto_sign_keypair(public_key, secret_key);
#if defined(OQS_DIST_BUILD)
} else {
return (OQS_STATUS) PQCLEAN_FALCON1024_CLEAN_crypto_sign_keypair(public_key, secret_key);
}
#endif /* OQS_DIST_BUILD */
#else
return (OQS_STATUS) PQCLEAN_FALCON1024_CLEAN_crypto_sign_keypair(public_key, secret_key);
#endif
}
OQS_API OQS_STATUS OQS_SIG_falcon_1024_sign(uint8_t *signature, size_t *signature_len, const uint8_t *message, size_t message_len, const uint8_t *secret_key) {
#if defined(OQS_ENABLE_SIG_falcon_1024_avx2)
#if defined(OQS_DIST_BUILD)
if (OQS_CPU_has_extension(OQS_CPU_EXT_AVX2)) {
#endif /* OQS_DIST_BUILD */
return (OQS_STATUS) PQCLEAN_FALCON1024_AVX2_crypto_sign_signature(signature, signature_len, message, message_len, secret_key);
#if defined(OQS_DIST_BUILD)
} else {
return (OQS_STATUS) PQCLEAN_FALCON1024_CLEAN_crypto_sign_signature(signature, signature_len, message, message_len, secret_key);
}
#endif /* OQS_DIST_BUILD */
#elif defined(OQS_ENABLE_SIG_falcon_1024_aarch64)
#if defined(OQS_DIST_BUILD)
if (OQS_CPU_has_extension(OQS_CPU_EXT_ARM_NEON)) {
#endif /* OQS_DIST_BUILD */
return (OQS_STATUS) PQCLEAN_FALCON1024_AARCH64_crypto_sign_signature(signature, signature_len, message, message_len, secret_key);
#if defined(OQS_DIST_BUILD)
} else {
return (OQS_STATUS) PQCLEAN_FALCON1024_CLEAN_crypto_sign_signature(signature, signature_len, message, message_len, secret_key);
}
#endif /* OQS_DIST_BUILD */
#else
return (OQS_STATUS) PQCLEAN_FALCON1024_CLEAN_crypto_sign_signature(signature, signature_len, message, message_len, secret_key);
#endif
}
OQS_API OQS_STATUS OQS_SIG_falcon_1024_verify(const uint8_t *message, size_t message_len, const uint8_t *signature, size_t signature_len, const uint8_t *public_key) {
#if defined(OQS_ENABLE_SIG_falcon_1024_avx2)
#if defined(OQS_DIST_BUILD)
if (OQS_CPU_has_extension(OQS_CPU_EXT_AVX2)) {
#endif /* OQS_DIST_BUILD */
return (OQS_STATUS) PQCLEAN_FALCON1024_AVX2_crypto_sign_verify(signature, signature_len, message, message_len, public_key);
#if defined(OQS_DIST_BUILD)
} else {
return (OQS_STATUS) PQCLEAN_FALCON1024_CLEAN_crypto_sign_verify(signature, signature_len, message, message_len, public_key);
}
#endif /* OQS_DIST_BUILD */
#elif defined(OQS_ENABLE_SIG_falcon_1024_aarch64)
#if defined(OQS_DIST_BUILD)
if (OQS_CPU_has_extension(OQS_CPU_EXT_ARM_NEON)) {
#endif /* OQS_DIST_BUILD */
return (OQS_STATUS) PQCLEAN_FALCON1024_AARCH64_crypto_sign_verify(signature, signature_len, message, message_len, public_key);
#if defined(OQS_DIST_BUILD)
} else {
return (OQS_STATUS) PQCLEAN_FALCON1024_CLEAN_crypto_sign_verify(signature, signature_len, message, message_len, public_key);
}
#endif /* OQS_DIST_BUILD */
#else
return (OQS_STATUS) PQCLEAN_FALCON1024_CLEAN_crypto_sign_verify(signature, signature_len, message, message_len, public_key);
#endif
}
#endif
```
|
```python
{
"targets": [
{
"target_name": "test_constructor",
"sources": [
"../common.c",
"../entry_point.c",
"test_constructor.c"
]
}
]
}
```
|
Prince Xun of the Second Rank, or simply Prince Xun, was the title of a princely peerage used in China during the Manchu-led Qing dynasty (1644–1912). As the Prince Xun peerage was not awarded "iron-cap" status, this meant that each successive bearer of the title would normally start off with a title downgraded by one rank vis-à-vis that held by his predecessor. However, the title would generally not be downgraded to any lower than a feng'en fuguo gong except under special circumstances.
The first bearer of the title was Yongzhang (永璋; 1735–1760), the Qianlong Emperor's third son. Yongzhang was posthumously honoured with the title "Prince Xun of the Second Rank" by his father in 1760. The title was passed down over six generations and held by six persons.
Members of the Prince Xun peerage
Yongzhang (永璋; 1735–1760), the Qianlong Emperor's third son, posthumously honoured with the title "Prince Xun of the Second Rank"
Mianyi (綿懿; 1771–1809), Yongxing's second son and Yongzhang's adopted son, inherited the Prince Xun peerage as a beile in 1787, demoted to second class zhenguo jiangjun in 1804, promoted to beizi in 1805, posthumously restored as a beile
Yixu (奕緒; 1791–1809), Mianyi's eldest son, held the title of a zhenguo jiangjun from 1799 to 1809, promoted to beizi in 1809
Zaiqian (載遷; 1849–1899), Yixu's second son, held the title of a feng'en zhenguo gong from 1858 to 1899
Pukui (溥葵; 1873–1926), Zaiqian's eldest son, held the title of a third class zhenguo jiangjun from 1898 to 1899, promoted to feng'en fuguo gong in 1899
Puquan (溥荃; 1878–?), Zaiqian's second son, held the title of a first class fuguo jiangjun from 1903
Yugui (毓桂; 1906–?), Puquan's eldest son
Yusen (毓槮; 1913–?), Puquan's second son and Pukui's adopted son, held the title of a feng'en fuguo gong from 1926
Yijing (奕經; 1791–1853), Mianyi's second son, held the title of a second class zhenguo jiangjun from 1816 to 1843, stripped of his title in 1843
Yiji (奕紀; 1797–1863), Mianyi's third son, initially a second class fuguo jiangjun, promoted to second class zhenguo jiangjun in 1832, stripped of his title in 1840
Zaixiao (載䥵; 1821–1872), Yiji's son
Pugu (溥顧; 1844–1902), Zaixiao's son
Yubin (毓邠; 1870–?), Pugu's son
Zaijian (載鏗; 1826–1871), Yiji's son
Pudui (溥㟋; 1848–1903), Zaijian's son
Yuping (毓平; 1881–?), Pudui's son
Hengyin (恆蔭; 1909–?), Yuping's son
Family tree
See also
Prince Cheng (成)
Royal and noble ranks of the Qing dynasty
References
Qing dynasty princely peerages
|
Rose Point is a very small peninsula located in the town of Wareham, Massachusetts, United States. It is formed by the splitting of the Sippican River into the Weweantic River. In 2005, sewer lines were extended to Rose Point and nearby Briarwood Beach to reduce pollution from reaching the rivers.
Geography
Rose Point begins just east of Interstate 195, as a relatively wide swath of land from southwest to northeast and then gradually narrows toward its south easternmost point at the junction of the two rivers. The physical landscape is gently sloping, with elevation ranging from sea level along the river shore to approximately 45 ft/13.7 m along the upper portion of Barlow Avenue. Despite very sandy soil, the point is heavily wooded. Vegetation consists primarily of white pine, pitch pine, cedar, and scrub oak with a few maples and other coniferous and deciduous trees sprinkled throughout.
Climate
The climate is Humid Continental: Warm Summers, typical of the south coast of Massachusetts. The rivers and nearby Buzzards Bay often provide refreshing breezes on otherwise uncomfortably hot and humid summer days, especially along the southwestern side of the Point. Winters are also moderated to a slight degree by the surrounding water bodies.
References
Wareham, Massachusetts
Peninsulas of Massachusetts
Landforms of Plymouth County, Massachusetts
|
Giesbergeria voronezhensis is a Gram-negative, spiral-shaped and motile bacterium from the genus of Giesbergeria which has been isolated from activated sludge from Voronezh in Russia.
References
Comamonadaceae
Bacteria described in 2006
|
```objective-c
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: google/protobuf/unittest_no_field_presence.proto
#ifndef your_sha256_hashproto__INCLUDED
#define your_sha256_hashproto__INCLUDED
#include <string>
#include <google/protobuf/stubs/common.h>
#if GOOGLE_PROTOBUF_VERSION < 3001000
#error This file was generated by a newer version of protoc which is
#error incompatible with your Protocol Buffer headers. Please update
#error your headers.
#endif
#if 3001000 < GOOGLE_PROTOBUF_MIN_PROTOC_VERSION
#error This file was generated by an older version of protoc which is
#error incompatible with your Protocol Buffer headers. Please
#error regenerate this file with a newer version of protoc.
#endif
#include <google/protobuf/arena.h>
#include <google/protobuf/arenastring.h>
#include <google/protobuf/generated_message_util.h>
#include <google/protobuf/metadata.h>
#include <google/protobuf/message.h>
#include <google/protobuf/repeated_field.h>
#include <google/protobuf/extension_set.h>
#include <google/protobuf/generated_enum_reflection.h>
#include <google/protobuf/unknown_field_set.h>
#include <google/protobuf/unittest.pb.h>
// @@protoc_insertion_point(includes)
namespace proto2_nofieldpresence_unittest {
// Internal implementation detail -- do not call these.
void your_sha256_hashsence_2eproto();
void your_sha256_hash5fpresence_2eproto();
void your_sha256_hashpresence_2eproto();
void your_sha256_hash5fpresence_2eproto();
class ForeignMessage;
class TestAllTypes;
class TestAllTypes_NestedMessage;
class TestProto2Required;
enum TestAllTypes_NestedEnum {
TestAllTypes_NestedEnum_FOO = 0,
TestAllTypes_NestedEnum_BAR = 1,
TestAllTypes_NestedEnum_BAZ = 2,
your_sha256_hash_DO_NOT_USE_ = ::google::protobuf::kint32min,
your_sha256_hash_DO_NOT_USE_ = ::google::protobuf::kint32max
};
bool TestAllTypes_NestedEnum_IsValid(int value);
const TestAllTypes_NestedEnum TestAllTypes_NestedEnum_NestedEnum_MIN = TestAllTypes_NestedEnum_FOO;
const TestAllTypes_NestedEnum TestAllTypes_NestedEnum_NestedEnum_MAX = TestAllTypes_NestedEnum_BAZ;
const int TestAllTypes_NestedEnum_NestedEnum_ARRAYSIZE = TestAllTypes_NestedEnum_NestedEnum_MAX + 1;
const ::google::protobuf::EnumDescriptor* TestAllTypes_NestedEnum_descriptor();
inline const ::std::string& TestAllTypes_NestedEnum_Name(TestAllTypes_NestedEnum value) {
return ::google::protobuf::internal::NameOfEnum(
TestAllTypes_NestedEnum_descriptor(), value);
}
inline bool TestAllTypes_NestedEnum_Parse(
const ::std::string& name, TestAllTypes_NestedEnum* value) {
return ::google::protobuf::internal::ParseNamedEnum<TestAllTypes_NestedEnum>(
TestAllTypes_NestedEnum_descriptor(), name, value);
}
enum ForeignEnum {
FOREIGN_FOO = 0,
FOREIGN_BAR = 1,
FOREIGN_BAZ = 2,
ForeignEnum_INT_MIN_SENTINEL_DO_NOT_USE_ = ::google::protobuf::kint32min,
ForeignEnum_INT_MAX_SENTINEL_DO_NOT_USE_ = ::google::protobuf::kint32max
};
bool ForeignEnum_IsValid(int value);
const ForeignEnum ForeignEnum_MIN = FOREIGN_FOO;
const ForeignEnum ForeignEnum_MAX = FOREIGN_BAZ;
const int ForeignEnum_ARRAYSIZE = ForeignEnum_MAX + 1;
const ::google::protobuf::EnumDescriptor* ForeignEnum_descriptor();
inline const ::std::string& ForeignEnum_Name(ForeignEnum value) {
return ::google::protobuf::internal::NameOfEnum(
ForeignEnum_descriptor(), value);
}
inline bool ForeignEnum_Parse(
const ::std::string& name, ForeignEnum* value) {
return ::google::protobuf::internal::ParseNamedEnum<ForeignEnum>(
ForeignEnum_descriptor(), name, value);
}
// ===================================================================
class TestAllTypes_NestedMessage : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage) */ {
public:
TestAllTypes_NestedMessage();
virtual ~TestAllTypes_NestedMessage();
TestAllTypes_NestedMessage(const TestAllTypes_NestedMessage& from);
inline TestAllTypes_NestedMessage& operator=(const TestAllTypes_NestedMessage& from) {
CopyFrom(from);
return *this;
}
static const ::google::protobuf::Descriptor* descriptor();
static const TestAllTypes_NestedMessage& default_instance();
static const TestAllTypes_NestedMessage* internal_default_instance();
void Swap(TestAllTypes_NestedMessage* other);
// implements Message ----------------------------------------------
inline TestAllTypes_NestedMessage* New() const { return New(NULL); }
TestAllTypes_NestedMessage* New(::google::protobuf::Arena* arena) const;
void CopyFrom(const ::google::protobuf::Message& from);
void MergeFrom(const ::google::protobuf::Message& from);
void CopyFrom(const TestAllTypes_NestedMessage& from);
void MergeFrom(const TestAllTypes_NestedMessage& from);
void Clear();
bool IsInitialized() const;
size_t ByteSizeLong() const;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input);
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* output) const;
::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const {
return InternalSerializeWithCachedSizesToArray(false, output);
}
int GetCachedSize() const { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const;
void InternalSwap(TestAllTypes_NestedMessage* other);
void UnsafeMergeFrom(const TestAllTypes_NestedMessage& from);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return _internal_metadata_.arena();
}
inline void* MaybeArenaPtr() const {
return _internal_metadata_.raw_arena_ptr();
}
public:
::google::protobuf::Metadata GetMetadata() const;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// optional int32 bb = 1;
void clear_bb();
static const int kBbFieldNumber = 1;
::google::protobuf::int32 bb() const;
void set_bb(::google::protobuf::int32 value);
// @@protoc_insertion_point(class_scope:proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage)
private:
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::int32 bb_;
mutable int _cached_size_;
friend void your_sha256_hash5fpresence_2eproto_impl();
friend void your_sha256_hashsence_2eproto_impl();
friend void your_sha256_hashpresence_2eproto();
friend void your_sha256_hash5fpresence_2eproto();
void InitAsDefaultInstance();
};
extern ::google::protobuf::internal::ExplicitlyConstructed<TestAllTypes_NestedMessage> TestAllTypes_NestedMessage_default_instance_;
// your_sha256_hash---
class TestAllTypes : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:proto2_nofieldpresence_unittest.TestAllTypes) */ {
public:
TestAllTypes();
virtual ~TestAllTypes();
TestAllTypes(const TestAllTypes& from);
inline TestAllTypes& operator=(const TestAllTypes& from) {
CopyFrom(from);
return *this;
}
static const ::google::protobuf::Descriptor* descriptor();
static const TestAllTypes& default_instance();
enum OneofFieldCase {
kOneofUint32 = 111,
kOneofNestedMessage = 112,
kOneofString = 113,
kOneofEnum = 114,
ONEOF_FIELD_NOT_SET = 0,
};
static const TestAllTypes* internal_default_instance();
void Swap(TestAllTypes* other);
// implements Message ----------------------------------------------
inline TestAllTypes* New() const { return New(NULL); }
TestAllTypes* New(::google::protobuf::Arena* arena) const;
void CopyFrom(const ::google::protobuf::Message& from);
void MergeFrom(const ::google::protobuf::Message& from);
void CopyFrom(const TestAllTypes& from);
void MergeFrom(const TestAllTypes& from);
void Clear();
bool IsInitialized() const;
size_t ByteSizeLong() const;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input);
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* output) const;
::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const {
return InternalSerializeWithCachedSizesToArray(false, output);
}
int GetCachedSize() const { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const;
void InternalSwap(TestAllTypes* other);
void UnsafeMergeFrom(const TestAllTypes& from);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return _internal_metadata_.arena();
}
inline void* MaybeArenaPtr() const {
return _internal_metadata_.raw_arena_ptr();
}
public:
::google::protobuf::Metadata GetMetadata() const;
// nested types ----------------------------------------------------
typedef TestAllTypes_NestedMessage NestedMessage;
typedef TestAllTypes_NestedEnum NestedEnum;
static const NestedEnum FOO =
TestAllTypes_NestedEnum_FOO;
static const NestedEnum BAR =
TestAllTypes_NestedEnum_BAR;
static const NestedEnum BAZ =
TestAllTypes_NestedEnum_BAZ;
static inline bool NestedEnum_IsValid(int value) {
return TestAllTypes_NestedEnum_IsValid(value);
}
static const NestedEnum NestedEnum_MIN =
TestAllTypes_NestedEnum_NestedEnum_MIN;
static const NestedEnum NestedEnum_MAX =
TestAllTypes_NestedEnum_NestedEnum_MAX;
static const int NestedEnum_ARRAYSIZE =
TestAllTypes_NestedEnum_NestedEnum_ARRAYSIZE;
static inline const ::google::protobuf::EnumDescriptor*
NestedEnum_descriptor() {
return TestAllTypes_NestedEnum_descriptor();
}
static inline const ::std::string& NestedEnum_Name(NestedEnum value) {
return TestAllTypes_NestedEnum_Name(value);
}
static inline bool NestedEnum_Parse(const ::std::string& name,
NestedEnum* value) {
return TestAllTypes_NestedEnum_Parse(name, value);
}
// accessors -------------------------------------------------------
// optional int32 optional_int32 = 1;
void clear_optional_int32();
static const int kOptionalInt32FieldNumber = 1;
::google::protobuf::int32 optional_int32() const;
void set_optional_int32(::google::protobuf::int32 value);
// optional int64 optional_int64 = 2;
void clear_optional_int64();
static const int kOptionalInt64FieldNumber = 2;
::google::protobuf::int64 optional_int64() const;
void set_optional_int64(::google::protobuf::int64 value);
// optional uint32 optional_uint32 = 3;
void clear_optional_uint32();
static const int kOptionalUint32FieldNumber = 3;
::google::protobuf::uint32 optional_uint32() const;
void set_optional_uint32(::google::protobuf::uint32 value);
// optional uint64 optional_uint64 = 4;
void clear_optional_uint64();
static const int kOptionalUint64FieldNumber = 4;
::google::protobuf::uint64 optional_uint64() const;
void set_optional_uint64(::google::protobuf::uint64 value);
// optional sint32 optional_sint32 = 5;
void clear_optional_sint32();
static const int kOptionalSint32FieldNumber = 5;
::google::protobuf::int32 optional_sint32() const;
void set_optional_sint32(::google::protobuf::int32 value);
// optional sint64 optional_sint64 = 6;
void clear_optional_sint64();
static const int kOptionalSint64FieldNumber = 6;
::google::protobuf::int64 optional_sint64() const;
void set_optional_sint64(::google::protobuf::int64 value);
// optional fixed32 optional_fixed32 = 7;
void clear_optional_fixed32();
static const int kOptionalFixed32FieldNumber = 7;
::google::protobuf::uint32 optional_fixed32() const;
void set_optional_fixed32(::google::protobuf::uint32 value);
// optional fixed64 optional_fixed64 = 8;
void clear_optional_fixed64();
static const int kOptionalFixed64FieldNumber = 8;
::google::protobuf::uint64 optional_fixed64() const;
void set_optional_fixed64(::google::protobuf::uint64 value);
// optional sfixed32 optional_sfixed32 = 9;
void clear_optional_sfixed32();
static const int kOptionalSfixed32FieldNumber = 9;
::google::protobuf::int32 optional_sfixed32() const;
void set_optional_sfixed32(::google::protobuf::int32 value);
// optional sfixed64 optional_sfixed64 = 10;
void clear_optional_sfixed64();
static const int kOptionalSfixed64FieldNumber = 10;
::google::protobuf::int64 optional_sfixed64() const;
void set_optional_sfixed64(::google::protobuf::int64 value);
// optional float optional_float = 11;
void clear_optional_float();
static const int kOptionalFloatFieldNumber = 11;
float optional_float() const;
void set_optional_float(float value);
// optional double optional_double = 12;
void clear_optional_double();
static const int kOptionalDoubleFieldNumber = 12;
double optional_double() const;
void set_optional_double(double value);
// optional bool optional_bool = 13;
void clear_optional_bool();
static const int kOptionalBoolFieldNumber = 13;
bool optional_bool() const;
void set_optional_bool(bool value);
// optional string optional_string = 14;
void clear_optional_string();
static const int kOptionalStringFieldNumber = 14;
const ::std::string& optional_string() const;
void set_optional_string(const ::std::string& value);
void set_optional_string(const char* value);
void set_optional_string(const char* value, size_t size);
::std::string* mutable_optional_string();
::std::string* release_optional_string();
void set_allocated_optional_string(::std::string* optional_string);
// optional bytes optional_bytes = 15;
void clear_optional_bytes();
static const int kOptionalBytesFieldNumber = 15;
const ::std::string& optional_bytes() const;
void set_optional_bytes(const ::std::string& value);
void set_optional_bytes(const char* value);
void set_optional_bytes(const void* value, size_t size);
::std::string* mutable_optional_bytes();
::std::string* release_optional_bytes();
void set_allocated_optional_bytes(::std::string* optional_bytes);
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage optional_nested_message = 18;
bool has_optional_nested_message() const;
void clear_optional_nested_message();
static const int kOptionalNestedMessageFieldNumber = 18;
const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& optional_nested_message() const;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* mutable_optional_nested_message();
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* release_optional_nested_message();
void set_allocated_optional_nested_message(::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* optional_nested_message);
// optional .proto2_nofieldpresence_unittest.ForeignMessage optional_foreign_message = 19;
bool has_optional_foreign_message() const;
void clear_optional_foreign_message();
static const int kOptionalForeignMessageFieldNumber = 19;
const ::proto2_nofieldpresence_unittest::ForeignMessage& optional_foreign_message() const;
::proto2_nofieldpresence_unittest::ForeignMessage* mutable_optional_foreign_message();
::proto2_nofieldpresence_unittest::ForeignMessage* release_optional_foreign_message();
void set_allocated_optional_foreign_message(::proto2_nofieldpresence_unittest::ForeignMessage* optional_foreign_message);
// optional .protobuf_unittest.TestAllTypes optional_proto2_message = 20;
bool has_optional_proto2_message() const;
void clear_optional_proto2_message();
static const int kOptionalProto2MessageFieldNumber = 20;
const ::protobuf_unittest::TestAllTypes& optional_proto2_message() const;
::protobuf_unittest::TestAllTypes* mutable_optional_proto2_message();
::protobuf_unittest::TestAllTypes* release_optional_proto2_message();
void set_allocated_optional_proto2_message(::protobuf_unittest::TestAllTypes* optional_proto2_message);
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedEnum optional_nested_enum = 21;
void clear_optional_nested_enum();
static const int kOptionalNestedEnumFieldNumber = 21;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum optional_nested_enum() const;
void set_optional_nested_enum(::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum value);
// optional .proto2_nofieldpresence_unittest.ForeignEnum optional_foreign_enum = 22;
void clear_optional_foreign_enum();
static const int kOptionalForeignEnumFieldNumber = 22;
::proto2_nofieldpresence_unittest::ForeignEnum optional_foreign_enum() const;
void set_optional_foreign_enum(::proto2_nofieldpresence_unittest::ForeignEnum value);
// optional string optional_string_piece = 24 [ctype = STRING_PIECE];
void clear_optional_string_piece();
static const int kOptionalStringPieceFieldNumber = 24;
private:
// Hidden due to unknown ctype option.
const ::std::string& optional_string_piece() const;
void set_optional_string_piece(const ::std::string& value);
void set_optional_string_piece(const char* value);
void set_optional_string_piece(const char* value, size_t size);
::std::string* mutable_optional_string_piece();
::std::string* release_optional_string_piece();
void set_allocated_optional_string_piece(::std::string* optional_string_piece);
public:
// optional string optional_cord = 25 [ctype = CORD];
void clear_optional_cord();
static const int kOptionalCordFieldNumber = 25;
private:
// Hidden due to unknown ctype option.
const ::std::string& optional_cord() const;
void set_optional_cord(const ::std::string& value);
void set_optional_cord(const char* value);
void set_optional_cord(const char* value, size_t size);
::std::string* mutable_optional_cord();
::std::string* release_optional_cord();
void set_allocated_optional_cord(::std::string* optional_cord);
public:
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage optional_lazy_message = 30 [lazy = true];
bool has_optional_lazy_message() const;
void clear_optional_lazy_message();
static const int kOptionalLazyMessageFieldNumber = 30;
const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& optional_lazy_message() const;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* mutable_optional_lazy_message();
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* release_optional_lazy_message();
void set_allocated_optional_lazy_message(::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* optional_lazy_message);
// repeated int32 repeated_int32 = 31;
int repeated_int32_size() const;
void clear_repeated_int32();
static const int kRepeatedInt32FieldNumber = 31;
::google::protobuf::int32 repeated_int32(int index) const;
void set_repeated_int32(int index, ::google::protobuf::int32 value);
void add_repeated_int32(::google::protobuf::int32 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
repeated_int32() const;
::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
mutable_repeated_int32();
// repeated int64 repeated_int64 = 32;
int repeated_int64_size() const;
void clear_repeated_int64();
static const int kRepeatedInt64FieldNumber = 32;
::google::protobuf::int64 repeated_int64(int index) const;
void set_repeated_int64(int index, ::google::protobuf::int64 value);
void add_repeated_int64(::google::protobuf::int64 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::int64 >&
repeated_int64() const;
::google::protobuf::RepeatedField< ::google::protobuf::int64 >*
mutable_repeated_int64();
// repeated uint32 repeated_uint32 = 33;
int repeated_uint32_size() const;
void clear_repeated_uint32();
static const int kRepeatedUint32FieldNumber = 33;
::google::protobuf::uint32 repeated_uint32(int index) const;
void set_repeated_uint32(int index, ::google::protobuf::uint32 value);
void add_repeated_uint32(::google::protobuf::uint32 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::uint32 >&
repeated_uint32() const;
::google::protobuf::RepeatedField< ::google::protobuf::uint32 >*
mutable_repeated_uint32();
// repeated uint64 repeated_uint64 = 34;
int repeated_uint64_size() const;
void clear_repeated_uint64();
static const int kRepeatedUint64FieldNumber = 34;
::google::protobuf::uint64 repeated_uint64(int index) const;
void set_repeated_uint64(int index, ::google::protobuf::uint64 value);
void add_repeated_uint64(::google::protobuf::uint64 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::uint64 >&
repeated_uint64() const;
::google::protobuf::RepeatedField< ::google::protobuf::uint64 >*
mutable_repeated_uint64();
// repeated sint32 repeated_sint32 = 35;
int repeated_sint32_size() const;
void clear_repeated_sint32();
static const int kRepeatedSint32FieldNumber = 35;
::google::protobuf::int32 repeated_sint32(int index) const;
void set_repeated_sint32(int index, ::google::protobuf::int32 value);
void add_repeated_sint32(::google::protobuf::int32 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
repeated_sint32() const;
::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
mutable_repeated_sint32();
// repeated sint64 repeated_sint64 = 36;
int repeated_sint64_size() const;
void clear_repeated_sint64();
static const int kRepeatedSint64FieldNumber = 36;
::google::protobuf::int64 repeated_sint64(int index) const;
void set_repeated_sint64(int index, ::google::protobuf::int64 value);
void add_repeated_sint64(::google::protobuf::int64 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::int64 >&
repeated_sint64() const;
::google::protobuf::RepeatedField< ::google::protobuf::int64 >*
mutable_repeated_sint64();
// repeated fixed32 repeated_fixed32 = 37;
int repeated_fixed32_size() const;
void clear_repeated_fixed32();
static const int kRepeatedFixed32FieldNumber = 37;
::google::protobuf::uint32 repeated_fixed32(int index) const;
void set_repeated_fixed32(int index, ::google::protobuf::uint32 value);
void add_repeated_fixed32(::google::protobuf::uint32 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::uint32 >&
repeated_fixed32() const;
::google::protobuf::RepeatedField< ::google::protobuf::uint32 >*
mutable_repeated_fixed32();
// repeated fixed64 repeated_fixed64 = 38;
int repeated_fixed64_size() const;
void clear_repeated_fixed64();
static const int kRepeatedFixed64FieldNumber = 38;
::google::protobuf::uint64 repeated_fixed64(int index) const;
void set_repeated_fixed64(int index, ::google::protobuf::uint64 value);
void add_repeated_fixed64(::google::protobuf::uint64 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::uint64 >&
repeated_fixed64() const;
::google::protobuf::RepeatedField< ::google::protobuf::uint64 >*
mutable_repeated_fixed64();
// repeated sfixed32 repeated_sfixed32 = 39;
int repeated_sfixed32_size() const;
void clear_repeated_sfixed32();
static const int kRepeatedSfixed32FieldNumber = 39;
::google::protobuf::int32 repeated_sfixed32(int index) const;
void set_repeated_sfixed32(int index, ::google::protobuf::int32 value);
void add_repeated_sfixed32(::google::protobuf::int32 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
repeated_sfixed32() const;
::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
mutable_repeated_sfixed32();
// repeated sfixed64 repeated_sfixed64 = 40;
int repeated_sfixed64_size() const;
void clear_repeated_sfixed64();
static const int kRepeatedSfixed64FieldNumber = 40;
::google::protobuf::int64 repeated_sfixed64(int index) const;
void set_repeated_sfixed64(int index, ::google::protobuf::int64 value);
void add_repeated_sfixed64(::google::protobuf::int64 value);
const ::google::protobuf::RepeatedField< ::google::protobuf::int64 >&
repeated_sfixed64() const;
::google::protobuf::RepeatedField< ::google::protobuf::int64 >*
mutable_repeated_sfixed64();
// repeated float repeated_float = 41;
int repeated_float_size() const;
void clear_repeated_float();
static const int kRepeatedFloatFieldNumber = 41;
float repeated_float(int index) const;
void set_repeated_float(int index, float value);
void add_repeated_float(float value);
const ::google::protobuf::RepeatedField< float >&
repeated_float() const;
::google::protobuf::RepeatedField< float >*
mutable_repeated_float();
// repeated double repeated_double = 42;
int repeated_double_size() const;
void clear_repeated_double();
static const int kRepeatedDoubleFieldNumber = 42;
double repeated_double(int index) const;
void set_repeated_double(int index, double value);
void add_repeated_double(double value);
const ::google::protobuf::RepeatedField< double >&
repeated_double() const;
::google::protobuf::RepeatedField< double >*
mutable_repeated_double();
// repeated bool repeated_bool = 43;
int repeated_bool_size() const;
void clear_repeated_bool();
static const int kRepeatedBoolFieldNumber = 43;
bool repeated_bool(int index) const;
void set_repeated_bool(int index, bool value);
void add_repeated_bool(bool value);
const ::google::protobuf::RepeatedField< bool >&
repeated_bool() const;
::google::protobuf::RepeatedField< bool >*
mutable_repeated_bool();
// repeated string repeated_string = 44;
int repeated_string_size() const;
void clear_repeated_string();
static const int kRepeatedStringFieldNumber = 44;
const ::std::string& repeated_string(int index) const;
::std::string* mutable_repeated_string(int index);
void set_repeated_string(int index, const ::std::string& value);
void set_repeated_string(int index, const char* value);
void set_repeated_string(int index, const char* value, size_t size);
::std::string* add_repeated_string();
void add_repeated_string(const ::std::string& value);
void add_repeated_string(const char* value);
void add_repeated_string(const char* value, size_t size);
const ::google::protobuf::RepeatedPtrField< ::std::string>& repeated_string() const;
::google::protobuf::RepeatedPtrField< ::std::string>* mutable_repeated_string();
// repeated bytes repeated_bytes = 45;
int repeated_bytes_size() const;
void clear_repeated_bytes();
static const int kRepeatedBytesFieldNumber = 45;
const ::std::string& repeated_bytes(int index) const;
::std::string* mutable_repeated_bytes(int index);
void set_repeated_bytes(int index, const ::std::string& value);
void set_repeated_bytes(int index, const char* value);
void set_repeated_bytes(int index, const void* value, size_t size);
::std::string* add_repeated_bytes();
void add_repeated_bytes(const ::std::string& value);
void add_repeated_bytes(const char* value);
void add_repeated_bytes(const void* value, size_t size);
const ::google::protobuf::RepeatedPtrField< ::std::string>& repeated_bytes() const;
::google::protobuf::RepeatedPtrField< ::std::string>* mutable_repeated_bytes();
// repeated .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage repeated_nested_message = 48;
int repeated_nested_message_size() const;
void clear_repeated_nested_message();
static const int kRepeatedNestedMessageFieldNumber = 48;
const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& repeated_nested_message(int index) const;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* mutable_repeated_nested_message(int index);
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* add_repeated_nested_message();
::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage >*
mutable_repeated_nested_message();
const ::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage >&
repeated_nested_message() const;
// repeated .proto2_nofieldpresence_unittest.ForeignMessage repeated_foreign_message = 49;
int repeated_foreign_message_size() const;
void clear_repeated_foreign_message();
static const int kRepeatedForeignMessageFieldNumber = 49;
const ::proto2_nofieldpresence_unittest::ForeignMessage& repeated_foreign_message(int index) const;
::proto2_nofieldpresence_unittest::ForeignMessage* mutable_repeated_foreign_message(int index);
::proto2_nofieldpresence_unittest::ForeignMessage* add_repeated_foreign_message();
::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::ForeignMessage >*
mutable_repeated_foreign_message();
const ::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::ForeignMessage >&
repeated_foreign_message() const;
// repeated .protobuf_unittest.TestAllTypes repeated_proto2_message = 50;
int repeated_proto2_message_size() const;
void clear_repeated_proto2_message();
static const int kRepeatedProto2MessageFieldNumber = 50;
const ::protobuf_unittest::TestAllTypes& repeated_proto2_message(int index) const;
::protobuf_unittest::TestAllTypes* mutable_repeated_proto2_message(int index);
::protobuf_unittest::TestAllTypes* add_repeated_proto2_message();
::google::protobuf::RepeatedPtrField< ::protobuf_unittest::TestAllTypes >*
mutable_repeated_proto2_message();
const ::google::protobuf::RepeatedPtrField< ::protobuf_unittest::TestAllTypes >&
repeated_proto2_message() const;
// repeated .proto2_nofieldpresence_unittest.TestAllTypes.NestedEnum repeated_nested_enum = 51;
int repeated_nested_enum_size() const;
void clear_repeated_nested_enum();
static const int kRepeatedNestedEnumFieldNumber = 51;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum repeated_nested_enum(int index) const;
void set_repeated_nested_enum(int index, ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum value);
void add_repeated_nested_enum(::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum value);
const ::google::protobuf::RepeatedField<int>& repeated_nested_enum() const;
::google::protobuf::RepeatedField<int>* mutable_repeated_nested_enum();
// repeated .proto2_nofieldpresence_unittest.ForeignEnum repeated_foreign_enum = 52;
int repeated_foreign_enum_size() const;
void clear_repeated_foreign_enum();
static const int kRepeatedForeignEnumFieldNumber = 52;
::proto2_nofieldpresence_unittest::ForeignEnum repeated_foreign_enum(int index) const;
void set_repeated_foreign_enum(int index, ::proto2_nofieldpresence_unittest::ForeignEnum value);
void add_repeated_foreign_enum(::proto2_nofieldpresence_unittest::ForeignEnum value);
const ::google::protobuf::RepeatedField<int>& repeated_foreign_enum() const;
::google::protobuf::RepeatedField<int>* mutable_repeated_foreign_enum();
// repeated string repeated_string_piece = 54 [ctype = STRING_PIECE];
int repeated_string_piece_size() const;
void clear_repeated_string_piece();
static const int kRepeatedStringPieceFieldNumber = 54;
private:
// Hidden due to unknown ctype option.
const ::std::string& repeated_string_piece(int index) const;
::std::string* mutable_repeated_string_piece(int index);
void set_repeated_string_piece(int index, const ::std::string& value);
void set_repeated_string_piece(int index, const char* value);
void set_repeated_string_piece(int index, const char* value, size_t size);
::std::string* add_repeated_string_piece();
void add_repeated_string_piece(const ::std::string& value);
void add_repeated_string_piece(const char* value);
void add_repeated_string_piece(const char* value, size_t size);
const ::google::protobuf::RepeatedPtrField< ::std::string>& repeated_string_piece() const;
::google::protobuf::RepeatedPtrField< ::std::string>* mutable_repeated_string_piece();
public:
// repeated string repeated_cord = 55 [ctype = CORD];
int repeated_cord_size() const;
void clear_repeated_cord();
static const int kRepeatedCordFieldNumber = 55;
private:
// Hidden due to unknown ctype option.
const ::std::string& repeated_cord(int index) const;
::std::string* mutable_repeated_cord(int index);
void set_repeated_cord(int index, const ::std::string& value);
void set_repeated_cord(int index, const char* value);
void set_repeated_cord(int index, const char* value, size_t size);
::std::string* add_repeated_cord();
void add_repeated_cord(const ::std::string& value);
void add_repeated_cord(const char* value);
void add_repeated_cord(const char* value, size_t size);
const ::google::protobuf::RepeatedPtrField< ::std::string>& repeated_cord() const;
::google::protobuf::RepeatedPtrField< ::std::string>* mutable_repeated_cord();
public:
// repeated .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage repeated_lazy_message = 57 [lazy = true];
int repeated_lazy_message_size() const;
void clear_repeated_lazy_message();
static const int kRepeatedLazyMessageFieldNumber = 57;
const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& repeated_lazy_message(int index) const;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* mutable_repeated_lazy_message(int index);
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* add_repeated_lazy_message();
::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage >*
mutable_repeated_lazy_message();
const ::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage >&
repeated_lazy_message() const;
// optional uint32 oneof_uint32 = 111;
private:
bool has_oneof_uint32() const;
public:
void clear_oneof_uint32();
static const int kOneofUint32FieldNumber = 111;
::google::protobuf::uint32 oneof_uint32() const;
void set_oneof_uint32(::google::protobuf::uint32 value);
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage oneof_nested_message = 112;
bool has_oneof_nested_message() const;
void clear_oneof_nested_message();
static const int kOneofNestedMessageFieldNumber = 112;
const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& oneof_nested_message() const;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* mutable_oneof_nested_message();
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* release_oneof_nested_message();
void set_allocated_oneof_nested_message(::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* oneof_nested_message);
// optional string oneof_string = 113;
private:
bool has_oneof_string() const;
public:
void clear_oneof_string();
static const int kOneofStringFieldNumber = 113;
const ::std::string& oneof_string() const;
void set_oneof_string(const ::std::string& value);
void set_oneof_string(const char* value);
void set_oneof_string(const char* value, size_t size);
::std::string* mutable_oneof_string();
::std::string* release_oneof_string();
void set_allocated_oneof_string(::std::string* oneof_string);
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedEnum oneof_enum = 114;
private:
bool has_oneof_enum() const;
public:
void clear_oneof_enum();
static const int kOneofEnumFieldNumber = 114;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum oneof_enum() const;
void set_oneof_enum(::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum value);
OneofFieldCase oneof_field_case() const;
// @@protoc_insertion_point(class_scope:proto2_nofieldpresence_unittest.TestAllTypes)
private:
inline void set_has_oneof_uint32();
inline void set_has_oneof_nested_message();
inline void set_has_oneof_string();
inline void set_has_oneof_enum();
inline bool has_oneof_field() const;
void clear_oneof_field();
inline void clear_has_oneof_field();
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::RepeatedField< ::google::protobuf::int32 > repeated_int32_;
mutable int _repeated_int32_cached_byte_size_;
::google::protobuf::RepeatedField< ::google::protobuf::int64 > repeated_int64_;
mutable int _repeated_int64_cached_byte_size_;
::google::protobuf::RepeatedField< ::google::protobuf::uint32 > repeated_uint32_;
mutable int _repeated_uint32_cached_byte_size_;
::google::protobuf::RepeatedField< ::google::protobuf::uint64 > repeated_uint64_;
mutable int _repeated_uint64_cached_byte_size_;
::google::protobuf::RepeatedField< ::google::protobuf::int32 > repeated_sint32_;
mutable int _repeated_sint32_cached_byte_size_;
::google::protobuf::RepeatedField< ::google::protobuf::int64 > repeated_sint64_;
mutable int _repeated_sint64_cached_byte_size_;
::google::protobuf::RepeatedField< ::google::protobuf::uint32 > repeated_fixed32_;
mutable int _repeated_fixed32_cached_byte_size_;
::google::protobuf::RepeatedField< ::google::protobuf::uint64 > repeated_fixed64_;
mutable int _repeated_fixed64_cached_byte_size_;
::google::protobuf::RepeatedField< ::google::protobuf::int32 > repeated_sfixed32_;
mutable int _repeated_sfixed32_cached_byte_size_;
::google::protobuf::RepeatedField< ::google::protobuf::int64 > repeated_sfixed64_;
mutable int _repeated_sfixed64_cached_byte_size_;
::google::protobuf::RepeatedField< float > repeated_float_;
mutable int _repeated_float_cached_byte_size_;
::google::protobuf::RepeatedField< double > repeated_double_;
mutable int _repeated_double_cached_byte_size_;
::google::protobuf::RepeatedField< bool > repeated_bool_;
mutable int _repeated_bool_cached_byte_size_;
::google::protobuf::RepeatedPtrField< ::std::string> repeated_string_;
::google::protobuf::RepeatedPtrField< ::std::string> repeated_bytes_;
::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage > repeated_nested_message_;
::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::ForeignMessage > repeated_foreign_message_;
::google::protobuf::RepeatedPtrField< ::protobuf_unittest::TestAllTypes > repeated_proto2_message_;
::google::protobuf::RepeatedField<int> repeated_nested_enum_;
mutable int _repeated_nested_enum_cached_byte_size_;
::google::protobuf::RepeatedField<int> repeated_foreign_enum_;
mutable int _repeated_foreign_enum_cached_byte_size_;
::google::protobuf::RepeatedPtrField< ::std::string> repeated_string_piece_;
::google::protobuf::RepeatedPtrField< ::std::string> repeated_cord_;
::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage > repeated_lazy_message_;
::google::protobuf::internal::ArenaStringPtr optional_string_;
::google::protobuf::internal::ArenaStringPtr optional_bytes_;
::google::protobuf::internal::ArenaStringPtr optional_string_piece_;
::google::protobuf::internal::ArenaStringPtr optional_cord_;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* optional_nested_message_;
::proto2_nofieldpresence_unittest::ForeignMessage* optional_foreign_message_;
::protobuf_unittest::TestAllTypes* optional_proto2_message_;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* optional_lazy_message_;
::google::protobuf::int64 optional_int64_;
::google::protobuf::int32 optional_int32_;
::google::protobuf::uint32 optional_uint32_;
::google::protobuf::uint64 optional_uint64_;
::google::protobuf::int64 optional_sint64_;
::google::protobuf::int32 optional_sint32_;
::google::protobuf::uint32 optional_fixed32_;
::google::protobuf::uint64 optional_fixed64_;
::google::protobuf::int64 optional_sfixed64_;
::google::protobuf::int32 optional_sfixed32_;
float optional_float_;
double optional_double_;
bool optional_bool_;
int optional_nested_enum_;
int optional_foreign_enum_;
union OneofFieldUnion {
OneofFieldUnion() {}
::google::protobuf::uint32 oneof_uint32_;
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* oneof_nested_message_;
::google::protobuf::internal::ArenaStringPtr oneof_string_;
int oneof_enum_;
} oneof_field_;
mutable int _cached_size_;
::google::protobuf::uint32 _oneof_case_[1];
friend void your_sha256_hash5fpresence_2eproto_impl();
friend void your_sha256_hashsence_2eproto_impl();
friend void your_sha256_hashpresence_2eproto();
friend void your_sha256_hash5fpresence_2eproto();
void InitAsDefaultInstance();
};
extern ::google::protobuf::internal::ExplicitlyConstructed<TestAllTypes> TestAllTypes_default_instance_;
// your_sha256_hash---
class TestProto2Required : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:proto2_nofieldpresence_unittest.TestProto2Required) */ {
public:
TestProto2Required();
virtual ~TestProto2Required();
TestProto2Required(const TestProto2Required& from);
inline TestProto2Required& operator=(const TestProto2Required& from) {
CopyFrom(from);
return *this;
}
static const ::google::protobuf::Descriptor* descriptor();
static const TestProto2Required& default_instance();
static const TestProto2Required* internal_default_instance();
void Swap(TestProto2Required* other);
// implements Message ----------------------------------------------
inline TestProto2Required* New() const { return New(NULL); }
TestProto2Required* New(::google::protobuf::Arena* arena) const;
void CopyFrom(const ::google::protobuf::Message& from);
void MergeFrom(const ::google::protobuf::Message& from);
void CopyFrom(const TestProto2Required& from);
void MergeFrom(const TestProto2Required& from);
void Clear();
bool IsInitialized() const;
size_t ByteSizeLong() const;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input);
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* output) const;
::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const {
return InternalSerializeWithCachedSizesToArray(false, output);
}
int GetCachedSize() const { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const;
void InternalSwap(TestProto2Required* other);
void UnsafeMergeFrom(const TestProto2Required& from);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return _internal_metadata_.arena();
}
inline void* MaybeArenaPtr() const {
return _internal_metadata_.raw_arena_ptr();
}
public:
::google::protobuf::Metadata GetMetadata() const;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// optional .protobuf_unittest.TestRequired proto2 = 1;
bool has_proto2() const;
void clear_proto2();
static const int kProto2FieldNumber = 1;
const ::protobuf_unittest::TestRequired& proto2() const;
::protobuf_unittest::TestRequired* mutable_proto2();
::protobuf_unittest::TestRequired* release_proto2();
void set_allocated_proto2(::protobuf_unittest::TestRequired* proto2);
// @@protoc_insertion_point(class_scope:proto2_nofieldpresence_unittest.TestProto2Required)
private:
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::protobuf_unittest::TestRequired* proto2_;
mutable int _cached_size_;
friend void your_sha256_hash5fpresence_2eproto_impl();
friend void your_sha256_hashsence_2eproto_impl();
friend void your_sha256_hashpresence_2eproto();
friend void your_sha256_hash5fpresence_2eproto();
void InitAsDefaultInstance();
};
extern ::google::protobuf::internal::ExplicitlyConstructed<TestProto2Required> TestProto2Required_default_instance_;
// your_sha256_hash---
class ForeignMessage : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:proto2_nofieldpresence_unittest.ForeignMessage) */ {
public:
ForeignMessage();
virtual ~ForeignMessage();
ForeignMessage(const ForeignMessage& from);
inline ForeignMessage& operator=(const ForeignMessage& from) {
CopyFrom(from);
return *this;
}
static const ::google::protobuf::Descriptor* descriptor();
static const ForeignMessage& default_instance();
static const ForeignMessage* internal_default_instance();
void Swap(ForeignMessage* other);
// implements Message ----------------------------------------------
inline ForeignMessage* New() const { return New(NULL); }
ForeignMessage* New(::google::protobuf::Arena* arena) const;
void CopyFrom(const ::google::protobuf::Message& from);
void MergeFrom(const ::google::protobuf::Message& from);
void CopyFrom(const ForeignMessage& from);
void MergeFrom(const ForeignMessage& from);
void Clear();
bool IsInitialized() const;
size_t ByteSizeLong() const;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input);
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* output) const;
::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const {
return InternalSerializeWithCachedSizesToArray(false, output);
}
int GetCachedSize() const { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const;
void InternalSwap(ForeignMessage* other);
void UnsafeMergeFrom(const ForeignMessage& from);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return _internal_metadata_.arena();
}
inline void* MaybeArenaPtr() const {
return _internal_metadata_.raw_arena_ptr();
}
public:
::google::protobuf::Metadata GetMetadata() const;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// optional int32 c = 1;
void clear_c();
static const int kCFieldNumber = 1;
::google::protobuf::int32 c() const;
void set_c(::google::protobuf::int32 value);
// @@protoc_insertion_point(class_scope:proto2_nofieldpresence_unittest.ForeignMessage)
private:
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::int32 c_;
mutable int _cached_size_;
friend void your_sha256_hash5fpresence_2eproto_impl();
friend void your_sha256_hashsence_2eproto_impl();
friend void your_sha256_hashpresence_2eproto();
friend void your_sha256_hash5fpresence_2eproto();
void InitAsDefaultInstance();
};
extern ::google::protobuf::internal::ExplicitlyConstructed<ForeignMessage> ForeignMessage_default_instance_;
// ===================================================================
// ===================================================================
#if !PROTOBUF_INLINE_NOT_IN_HEADERS
// TestAllTypes_NestedMessage
// optional int32 bb = 1;
inline void TestAllTypes_NestedMessage::clear_bb() {
bb_ = 0;
}
inline ::google::protobuf::int32 TestAllTypes_NestedMessage::bb() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage.bb)
return bb_;
}
inline void TestAllTypes_NestedMessage::set_bb(::google::protobuf::int32 value) {
bb_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage.bb)
}
inline const TestAllTypes_NestedMessage* TestAllTypes_NestedMessage::internal_default_instance() {
return &TestAllTypes_NestedMessage_default_instance_.get();
}
// your_sha256_hash---
// TestAllTypes
// optional int32 optional_int32 = 1;
inline void TestAllTypes::clear_optional_int32() {
optional_int32_ = 0;
}
inline ::google::protobuf::int32 TestAllTypes::optional_int32() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_int32)
return optional_int32_;
}
inline void TestAllTypes::set_optional_int32(::google::protobuf::int32 value) {
optional_int32_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_int32)
}
// optional int64 optional_int64 = 2;
inline void TestAllTypes::clear_optional_int64() {
optional_int64_ = GOOGLE_LONGLONG(0);
}
inline ::google::protobuf::int64 TestAllTypes::optional_int64() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_int64)
return optional_int64_;
}
inline void TestAllTypes::set_optional_int64(::google::protobuf::int64 value) {
optional_int64_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_int64)
}
// optional uint32 optional_uint32 = 3;
inline void TestAllTypes::clear_optional_uint32() {
optional_uint32_ = 0u;
}
inline ::google::protobuf::uint32 TestAllTypes::optional_uint32() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_uint32)
return optional_uint32_;
}
inline void TestAllTypes::set_optional_uint32(::google::protobuf::uint32 value) {
optional_uint32_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_uint32)
}
// optional uint64 optional_uint64 = 4;
inline void TestAllTypes::clear_optional_uint64() {
optional_uint64_ = GOOGLE_ULONGLONG(0);
}
inline ::google::protobuf::uint64 TestAllTypes::optional_uint64() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_uint64)
return optional_uint64_;
}
inline void TestAllTypes::set_optional_uint64(::google::protobuf::uint64 value) {
optional_uint64_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_uint64)
}
// optional sint32 optional_sint32 = 5;
inline void TestAllTypes::clear_optional_sint32() {
optional_sint32_ = 0;
}
inline ::google::protobuf::int32 TestAllTypes::optional_sint32() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_sint32)
return optional_sint32_;
}
inline void TestAllTypes::set_optional_sint32(::google::protobuf::int32 value) {
optional_sint32_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_sint32)
}
// optional sint64 optional_sint64 = 6;
inline void TestAllTypes::clear_optional_sint64() {
optional_sint64_ = GOOGLE_LONGLONG(0);
}
inline ::google::protobuf::int64 TestAllTypes::optional_sint64() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_sint64)
return optional_sint64_;
}
inline void TestAllTypes::set_optional_sint64(::google::protobuf::int64 value) {
optional_sint64_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_sint64)
}
// optional fixed32 optional_fixed32 = 7;
inline void TestAllTypes::clear_optional_fixed32() {
optional_fixed32_ = 0u;
}
inline ::google::protobuf::uint32 TestAllTypes::optional_fixed32() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_fixed32)
return optional_fixed32_;
}
inline void TestAllTypes::set_optional_fixed32(::google::protobuf::uint32 value) {
optional_fixed32_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_fixed32)
}
// optional fixed64 optional_fixed64 = 8;
inline void TestAllTypes::clear_optional_fixed64() {
optional_fixed64_ = GOOGLE_ULONGLONG(0);
}
inline ::google::protobuf::uint64 TestAllTypes::optional_fixed64() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_fixed64)
return optional_fixed64_;
}
inline void TestAllTypes::set_optional_fixed64(::google::protobuf::uint64 value) {
optional_fixed64_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_fixed64)
}
// optional sfixed32 optional_sfixed32 = 9;
inline void TestAllTypes::clear_optional_sfixed32() {
optional_sfixed32_ = 0;
}
inline ::google::protobuf::int32 TestAllTypes::optional_sfixed32() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_sfixed32)
return optional_sfixed32_;
}
inline void TestAllTypes::set_optional_sfixed32(::google::protobuf::int32 value) {
optional_sfixed32_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_sfixed32)
}
// optional sfixed64 optional_sfixed64 = 10;
inline void TestAllTypes::clear_optional_sfixed64() {
optional_sfixed64_ = GOOGLE_LONGLONG(0);
}
inline ::google::protobuf::int64 TestAllTypes::optional_sfixed64() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_sfixed64)
return optional_sfixed64_;
}
inline void TestAllTypes::set_optional_sfixed64(::google::protobuf::int64 value) {
optional_sfixed64_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_sfixed64)
}
// optional float optional_float = 11;
inline void TestAllTypes::clear_optional_float() {
optional_float_ = 0;
}
inline float TestAllTypes::optional_float() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_float)
return optional_float_;
}
inline void TestAllTypes::set_optional_float(float value) {
optional_float_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_float)
}
// optional double optional_double = 12;
inline void TestAllTypes::clear_optional_double() {
optional_double_ = 0;
}
inline double TestAllTypes::optional_double() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_double)
return optional_double_;
}
inline void TestAllTypes::set_optional_double(double value) {
optional_double_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_double)
}
// optional bool optional_bool = 13;
inline void TestAllTypes::clear_optional_bool() {
optional_bool_ = false;
}
inline bool TestAllTypes::optional_bool() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_bool)
return optional_bool_;
}
inline void TestAllTypes::set_optional_bool(bool value) {
optional_bool_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_bool)
}
// optional string optional_string = 14;
inline void TestAllTypes::clear_optional_string() {
optional_string_.ClearToEmptyNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline const ::std::string& TestAllTypes::optional_string() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_string)
return optional_string_.GetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline void TestAllTypes::set_optional_string(const ::std::string& value) {
optional_string_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_string)
}
inline void TestAllTypes::set_optional_string(const char* value) {
optional_string_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:proto2_nofieldpresence_unittest.TestAllTypes.optional_string)
}
inline void TestAllTypes::set_optional_string(const char* value, size_t size) {
optional_string_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:proto2_nofieldpresence_unittest.TestAllTypes.optional_string)
}
inline ::std::string* TestAllTypes::mutable_optional_string() {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.optional_string)
return optional_string_.MutableNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline ::std::string* TestAllTypes::release_optional_string() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.optional_string)
return optional_string_.ReleaseNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline void TestAllTypes::set_allocated_optional_string(::std::string* optional_string) {
if (optional_string != NULL) {
} else {
}
optional_string_.SetAllocatedNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), optional_string);
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.optional_string)
}
// optional bytes optional_bytes = 15;
inline void TestAllTypes::clear_optional_bytes() {
optional_bytes_.ClearToEmptyNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline const ::std::string& TestAllTypes::optional_bytes() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_bytes)
return optional_bytes_.GetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline void TestAllTypes::set_optional_bytes(const ::std::string& value) {
optional_bytes_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_bytes)
}
inline void TestAllTypes::set_optional_bytes(const char* value) {
optional_bytes_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:proto2_nofieldpresence_unittest.TestAllTypes.optional_bytes)
}
inline void TestAllTypes::set_optional_bytes(const void* value, size_t size) {
optional_bytes_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:proto2_nofieldpresence_unittest.TestAllTypes.optional_bytes)
}
inline ::std::string* TestAllTypes::mutable_optional_bytes() {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.optional_bytes)
return optional_bytes_.MutableNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline ::std::string* TestAllTypes::release_optional_bytes() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.optional_bytes)
return optional_bytes_.ReleaseNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline void TestAllTypes::set_allocated_optional_bytes(::std::string* optional_bytes) {
if (optional_bytes != NULL) {
} else {
}
optional_bytes_.SetAllocatedNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), optional_bytes);
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.optional_bytes)
}
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage optional_nested_message = 18;
inline bool TestAllTypes::has_optional_nested_message() const {
return this != internal_default_instance() && optional_nested_message_ != NULL;
}
inline void TestAllTypes::clear_optional_nested_message() {
if (GetArenaNoVirtual() == NULL && optional_nested_message_ != NULL) delete optional_nested_message_;
optional_nested_message_ = NULL;
}
inline const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& TestAllTypes::optional_nested_message() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_nested_message)
return optional_nested_message_ != NULL ? *optional_nested_message_
: *::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage::internal_default_instance();
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::mutable_optional_nested_message() {
if (optional_nested_message_ == NULL) {
optional_nested_message_ = new ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage;
}
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.optional_nested_message)
return optional_nested_message_;
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::release_optional_nested_message() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.optional_nested_message)
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* temp = optional_nested_message_;
optional_nested_message_ = NULL;
return temp;
}
inline void TestAllTypes::set_allocated_optional_nested_message(::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* optional_nested_message) {
delete optional_nested_message_;
optional_nested_message_ = optional_nested_message;
if (optional_nested_message) {
} else {
}
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.optional_nested_message)
}
// optional .proto2_nofieldpresence_unittest.ForeignMessage optional_foreign_message = 19;
inline bool TestAllTypes::has_optional_foreign_message() const {
return this != internal_default_instance() && optional_foreign_message_ != NULL;
}
inline void TestAllTypes::clear_optional_foreign_message() {
if (GetArenaNoVirtual() == NULL && optional_foreign_message_ != NULL) delete optional_foreign_message_;
optional_foreign_message_ = NULL;
}
inline const ::proto2_nofieldpresence_unittest::ForeignMessage& TestAllTypes::optional_foreign_message() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_foreign_message)
return optional_foreign_message_ != NULL ? *optional_foreign_message_
: *::proto2_nofieldpresence_unittest::ForeignMessage::internal_default_instance();
}
inline ::proto2_nofieldpresence_unittest::ForeignMessage* TestAllTypes::mutable_optional_foreign_message() {
if (optional_foreign_message_ == NULL) {
optional_foreign_message_ = new ::proto2_nofieldpresence_unittest::ForeignMessage;
}
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.optional_foreign_message)
return optional_foreign_message_;
}
inline ::proto2_nofieldpresence_unittest::ForeignMessage* TestAllTypes::release_optional_foreign_message() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.optional_foreign_message)
::proto2_nofieldpresence_unittest::ForeignMessage* temp = optional_foreign_message_;
optional_foreign_message_ = NULL;
return temp;
}
inline void TestAllTypes::set_allocated_optional_foreign_message(::proto2_nofieldpresence_unittest::ForeignMessage* optional_foreign_message) {
delete optional_foreign_message_;
optional_foreign_message_ = optional_foreign_message;
if (optional_foreign_message) {
} else {
}
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.optional_foreign_message)
}
// optional .protobuf_unittest.TestAllTypes optional_proto2_message = 20;
inline bool TestAllTypes::has_optional_proto2_message() const {
return this != internal_default_instance() && optional_proto2_message_ != NULL;
}
inline void TestAllTypes::clear_optional_proto2_message() {
if (GetArenaNoVirtual() == NULL && optional_proto2_message_ != NULL) delete optional_proto2_message_;
optional_proto2_message_ = NULL;
}
inline const ::protobuf_unittest::TestAllTypes& TestAllTypes::optional_proto2_message() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_proto2_message)
return optional_proto2_message_ != NULL ? *optional_proto2_message_
: *::protobuf_unittest::TestAllTypes::internal_default_instance();
}
inline ::protobuf_unittest::TestAllTypes* TestAllTypes::mutable_optional_proto2_message() {
if (optional_proto2_message_ == NULL) {
optional_proto2_message_ = new ::protobuf_unittest::TestAllTypes;
}
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.optional_proto2_message)
return optional_proto2_message_;
}
inline ::protobuf_unittest::TestAllTypes* TestAllTypes::release_optional_proto2_message() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.optional_proto2_message)
::protobuf_unittest::TestAllTypes* temp = optional_proto2_message_;
optional_proto2_message_ = NULL;
return temp;
}
inline void TestAllTypes::set_allocated_optional_proto2_message(::protobuf_unittest::TestAllTypes* optional_proto2_message) {
delete optional_proto2_message_;
if (optional_proto2_message != NULL && optional_proto2_message->GetArena() != NULL) {
::protobuf_unittest::TestAllTypes* new_optional_proto2_message = new ::protobuf_unittest::TestAllTypes;
new_optional_proto2_message->CopyFrom(*optional_proto2_message);
optional_proto2_message = new_optional_proto2_message;
}
optional_proto2_message_ = optional_proto2_message;
if (optional_proto2_message) {
} else {
}
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.optional_proto2_message)
}
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedEnum optional_nested_enum = 21;
inline void TestAllTypes::clear_optional_nested_enum() {
optional_nested_enum_ = 0;
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum TestAllTypes::optional_nested_enum() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_nested_enum)
return static_cast< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum >(optional_nested_enum_);
}
inline void TestAllTypes::set_optional_nested_enum(::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum value) {
optional_nested_enum_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_nested_enum)
}
// optional .proto2_nofieldpresence_unittest.ForeignEnum optional_foreign_enum = 22;
inline void TestAllTypes::clear_optional_foreign_enum() {
optional_foreign_enum_ = 0;
}
inline ::proto2_nofieldpresence_unittest::ForeignEnum TestAllTypes::optional_foreign_enum() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_foreign_enum)
return static_cast< ::proto2_nofieldpresence_unittest::ForeignEnum >(optional_foreign_enum_);
}
inline void TestAllTypes::set_optional_foreign_enum(::proto2_nofieldpresence_unittest::ForeignEnum value) {
optional_foreign_enum_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_foreign_enum)
}
// optional string optional_string_piece = 24 [ctype = STRING_PIECE];
inline void TestAllTypes::clear_optional_string_piece() {
optional_string_piece_.ClearToEmptyNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline const ::std::string& TestAllTypes::optional_string_piece() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_string_piece)
return optional_string_piece_.GetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline void TestAllTypes::set_optional_string_piece(const ::std::string& value) {
optional_string_piece_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_string_piece)
}
inline void TestAllTypes::set_optional_string_piece(const char* value) {
optional_string_piece_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:proto2_nofieldpresence_unittest.TestAllTypes.optional_string_piece)
}
inline void TestAllTypes::set_optional_string_piece(const char* value, size_t size) {
optional_string_piece_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:proto2_nofieldpresence_unittest.TestAllTypes.optional_string_piece)
}
inline ::std::string* TestAllTypes::mutable_optional_string_piece() {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.optional_string_piece)
return optional_string_piece_.MutableNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline ::std::string* TestAllTypes::release_optional_string_piece() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.optional_string_piece)
return optional_string_piece_.ReleaseNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline void TestAllTypes::set_allocated_optional_string_piece(::std::string* optional_string_piece) {
if (optional_string_piece != NULL) {
} else {
}
optional_string_piece_.SetAllocatedNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), optional_string_piece);
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.optional_string_piece)
}
// optional string optional_cord = 25 [ctype = CORD];
inline void TestAllTypes::clear_optional_cord() {
optional_cord_.ClearToEmptyNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline const ::std::string& TestAllTypes::optional_cord() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_cord)
return optional_cord_.GetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline void TestAllTypes::set_optional_cord(const ::std::string& value) {
optional_cord_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.optional_cord)
}
inline void TestAllTypes::set_optional_cord(const char* value) {
optional_cord_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:proto2_nofieldpresence_unittest.TestAllTypes.optional_cord)
}
inline void TestAllTypes::set_optional_cord(const char* value, size_t size) {
optional_cord_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:proto2_nofieldpresence_unittest.TestAllTypes.optional_cord)
}
inline ::std::string* TestAllTypes::mutable_optional_cord() {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.optional_cord)
return optional_cord_.MutableNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline ::std::string* TestAllTypes::release_optional_cord() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.optional_cord)
return optional_cord_.ReleaseNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline void TestAllTypes::set_allocated_optional_cord(::std::string* optional_cord) {
if (optional_cord != NULL) {
} else {
}
optional_cord_.SetAllocatedNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), optional_cord);
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.optional_cord)
}
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage optional_lazy_message = 30 [lazy = true];
inline bool TestAllTypes::has_optional_lazy_message() const {
return this != internal_default_instance() && optional_lazy_message_ != NULL;
}
inline void TestAllTypes::clear_optional_lazy_message() {
if (GetArenaNoVirtual() == NULL && optional_lazy_message_ != NULL) delete optional_lazy_message_;
optional_lazy_message_ = NULL;
}
inline const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& TestAllTypes::optional_lazy_message() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.optional_lazy_message)
return optional_lazy_message_ != NULL ? *optional_lazy_message_
: *::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage::internal_default_instance();
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::mutable_optional_lazy_message() {
if (optional_lazy_message_ == NULL) {
optional_lazy_message_ = new ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage;
}
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.optional_lazy_message)
return optional_lazy_message_;
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::release_optional_lazy_message() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.optional_lazy_message)
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* temp = optional_lazy_message_;
optional_lazy_message_ = NULL;
return temp;
}
inline void TestAllTypes::set_allocated_optional_lazy_message(::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* optional_lazy_message) {
delete optional_lazy_message_;
optional_lazy_message_ = optional_lazy_message;
if (optional_lazy_message) {
} else {
}
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.optional_lazy_message)
}
// repeated int32 repeated_int32 = 31;
inline int TestAllTypes::repeated_int32_size() const {
return repeated_int32_.size();
}
inline void TestAllTypes::clear_repeated_int32() {
repeated_int32_.Clear();
}
inline ::google::protobuf::int32 TestAllTypes::repeated_int32(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int32)
return repeated_int32_.Get(index);
}
inline void TestAllTypes::set_repeated_int32(int index, ::google::protobuf::int32 value) {
repeated_int32_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int32)
}
inline void TestAllTypes::add_repeated_int32(::google::protobuf::int32 value) {
repeated_int32_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int32)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
TestAllTypes::repeated_int32() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int32)
return repeated_int32_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
TestAllTypes::mutable_repeated_int32() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int32)
return &repeated_int32_;
}
// repeated int64 repeated_int64 = 32;
inline int TestAllTypes::repeated_int64_size() const {
return repeated_int64_.size();
}
inline void TestAllTypes::clear_repeated_int64() {
repeated_int64_.Clear();
}
inline ::google::protobuf::int64 TestAllTypes::repeated_int64(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int64)
return repeated_int64_.Get(index);
}
inline void TestAllTypes::set_repeated_int64(int index, ::google::protobuf::int64 value) {
repeated_int64_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int64)
}
inline void TestAllTypes::add_repeated_int64(::google::protobuf::int64 value) {
repeated_int64_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int64)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::int64 >&
TestAllTypes::repeated_int64() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int64)
return repeated_int64_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::int64 >*
TestAllTypes::mutable_repeated_int64() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_int64)
return &repeated_int64_;
}
// repeated uint32 repeated_uint32 = 33;
inline int TestAllTypes::repeated_uint32_size() const {
return repeated_uint32_.size();
}
inline void TestAllTypes::clear_repeated_uint32() {
repeated_uint32_.Clear();
}
inline ::google::protobuf::uint32 TestAllTypes::repeated_uint32(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint32)
return repeated_uint32_.Get(index);
}
inline void TestAllTypes::set_repeated_uint32(int index, ::google::protobuf::uint32 value) {
repeated_uint32_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint32)
}
inline void TestAllTypes::add_repeated_uint32(::google::protobuf::uint32 value) {
repeated_uint32_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint32)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::uint32 >&
TestAllTypes::repeated_uint32() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint32)
return repeated_uint32_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::uint32 >*
TestAllTypes::mutable_repeated_uint32() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint32)
return &repeated_uint32_;
}
// repeated uint64 repeated_uint64 = 34;
inline int TestAllTypes::repeated_uint64_size() const {
return repeated_uint64_.size();
}
inline void TestAllTypes::clear_repeated_uint64() {
repeated_uint64_.Clear();
}
inline ::google::protobuf::uint64 TestAllTypes::repeated_uint64(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint64)
return repeated_uint64_.Get(index);
}
inline void TestAllTypes::set_repeated_uint64(int index, ::google::protobuf::uint64 value) {
repeated_uint64_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint64)
}
inline void TestAllTypes::add_repeated_uint64(::google::protobuf::uint64 value) {
repeated_uint64_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint64)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::uint64 >&
TestAllTypes::repeated_uint64() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint64)
return repeated_uint64_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::uint64 >*
TestAllTypes::mutable_repeated_uint64() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_uint64)
return &repeated_uint64_;
}
// repeated sint32 repeated_sint32 = 35;
inline int TestAllTypes::repeated_sint32_size() const {
return repeated_sint32_.size();
}
inline void TestAllTypes::clear_repeated_sint32() {
repeated_sint32_.Clear();
}
inline ::google::protobuf::int32 TestAllTypes::repeated_sint32(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint32)
return repeated_sint32_.Get(index);
}
inline void TestAllTypes::set_repeated_sint32(int index, ::google::protobuf::int32 value) {
repeated_sint32_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint32)
}
inline void TestAllTypes::add_repeated_sint32(::google::protobuf::int32 value) {
repeated_sint32_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint32)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
TestAllTypes::repeated_sint32() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint32)
return repeated_sint32_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
TestAllTypes::mutable_repeated_sint32() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint32)
return &repeated_sint32_;
}
// repeated sint64 repeated_sint64 = 36;
inline int TestAllTypes::repeated_sint64_size() const {
return repeated_sint64_.size();
}
inline void TestAllTypes::clear_repeated_sint64() {
repeated_sint64_.Clear();
}
inline ::google::protobuf::int64 TestAllTypes::repeated_sint64(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint64)
return repeated_sint64_.Get(index);
}
inline void TestAllTypes::set_repeated_sint64(int index, ::google::protobuf::int64 value) {
repeated_sint64_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint64)
}
inline void TestAllTypes::add_repeated_sint64(::google::protobuf::int64 value) {
repeated_sint64_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint64)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::int64 >&
TestAllTypes::repeated_sint64() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint64)
return repeated_sint64_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::int64 >*
TestAllTypes::mutable_repeated_sint64() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sint64)
return &repeated_sint64_;
}
// repeated fixed32 repeated_fixed32 = 37;
inline int TestAllTypes::repeated_fixed32_size() const {
return repeated_fixed32_.size();
}
inline void TestAllTypes::clear_repeated_fixed32() {
repeated_fixed32_.Clear();
}
inline ::google::protobuf::uint32 TestAllTypes::repeated_fixed32(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed32)
return repeated_fixed32_.Get(index);
}
inline void TestAllTypes::set_repeated_fixed32(int index, ::google::protobuf::uint32 value) {
repeated_fixed32_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed32)
}
inline void TestAllTypes::add_repeated_fixed32(::google::protobuf::uint32 value) {
repeated_fixed32_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed32)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::uint32 >&
TestAllTypes::repeated_fixed32() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed32)
return repeated_fixed32_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::uint32 >*
TestAllTypes::mutable_repeated_fixed32() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed32)
return &repeated_fixed32_;
}
// repeated fixed64 repeated_fixed64 = 38;
inline int TestAllTypes::repeated_fixed64_size() const {
return repeated_fixed64_.size();
}
inline void TestAllTypes::clear_repeated_fixed64() {
repeated_fixed64_.Clear();
}
inline ::google::protobuf::uint64 TestAllTypes::repeated_fixed64(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed64)
return repeated_fixed64_.Get(index);
}
inline void TestAllTypes::set_repeated_fixed64(int index, ::google::protobuf::uint64 value) {
repeated_fixed64_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed64)
}
inline void TestAllTypes::add_repeated_fixed64(::google::protobuf::uint64 value) {
repeated_fixed64_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed64)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::uint64 >&
TestAllTypes::repeated_fixed64() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed64)
return repeated_fixed64_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::uint64 >*
TestAllTypes::mutable_repeated_fixed64() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_fixed64)
return &repeated_fixed64_;
}
// repeated sfixed32 repeated_sfixed32 = 39;
inline int TestAllTypes::repeated_sfixed32_size() const {
return repeated_sfixed32_.size();
}
inline void TestAllTypes::clear_repeated_sfixed32() {
repeated_sfixed32_.Clear();
}
inline ::google::protobuf::int32 TestAllTypes::repeated_sfixed32(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed32)
return repeated_sfixed32_.Get(index);
}
inline void TestAllTypes::set_repeated_sfixed32(int index, ::google::protobuf::int32 value) {
repeated_sfixed32_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed32)
}
inline void TestAllTypes::add_repeated_sfixed32(::google::protobuf::int32 value) {
repeated_sfixed32_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed32)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
TestAllTypes::repeated_sfixed32() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed32)
return repeated_sfixed32_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
TestAllTypes::mutable_repeated_sfixed32() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed32)
return &repeated_sfixed32_;
}
// repeated sfixed64 repeated_sfixed64 = 40;
inline int TestAllTypes::repeated_sfixed64_size() const {
return repeated_sfixed64_.size();
}
inline void TestAllTypes::clear_repeated_sfixed64() {
repeated_sfixed64_.Clear();
}
inline ::google::protobuf::int64 TestAllTypes::repeated_sfixed64(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed64)
return repeated_sfixed64_.Get(index);
}
inline void TestAllTypes::set_repeated_sfixed64(int index, ::google::protobuf::int64 value) {
repeated_sfixed64_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed64)
}
inline void TestAllTypes::add_repeated_sfixed64(::google::protobuf::int64 value) {
repeated_sfixed64_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed64)
}
inline const ::google::protobuf::RepeatedField< ::google::protobuf::int64 >&
TestAllTypes::repeated_sfixed64() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed64)
return repeated_sfixed64_;
}
inline ::google::protobuf::RepeatedField< ::google::protobuf::int64 >*
TestAllTypes::mutable_repeated_sfixed64() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_sfixed64)
return &repeated_sfixed64_;
}
// repeated float repeated_float = 41;
inline int TestAllTypes::repeated_float_size() const {
return repeated_float_.size();
}
inline void TestAllTypes::clear_repeated_float() {
repeated_float_.Clear();
}
inline float TestAllTypes::repeated_float(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_float)
return repeated_float_.Get(index);
}
inline void TestAllTypes::set_repeated_float(int index, float value) {
repeated_float_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_float)
}
inline void TestAllTypes::add_repeated_float(float value) {
repeated_float_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_float)
}
inline const ::google::protobuf::RepeatedField< float >&
TestAllTypes::repeated_float() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_float)
return repeated_float_;
}
inline ::google::protobuf::RepeatedField< float >*
TestAllTypes::mutable_repeated_float() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_float)
return &repeated_float_;
}
// repeated double repeated_double = 42;
inline int TestAllTypes::repeated_double_size() const {
return repeated_double_.size();
}
inline void TestAllTypes::clear_repeated_double() {
repeated_double_.Clear();
}
inline double TestAllTypes::repeated_double(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_double)
return repeated_double_.Get(index);
}
inline void TestAllTypes::set_repeated_double(int index, double value) {
repeated_double_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_double)
}
inline void TestAllTypes::add_repeated_double(double value) {
repeated_double_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_double)
}
inline const ::google::protobuf::RepeatedField< double >&
TestAllTypes::repeated_double() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_double)
return repeated_double_;
}
inline ::google::protobuf::RepeatedField< double >*
TestAllTypes::mutable_repeated_double() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_double)
return &repeated_double_;
}
// repeated bool repeated_bool = 43;
inline int TestAllTypes::repeated_bool_size() const {
return repeated_bool_.size();
}
inline void TestAllTypes::clear_repeated_bool() {
repeated_bool_.Clear();
}
inline bool TestAllTypes::repeated_bool(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bool)
return repeated_bool_.Get(index);
}
inline void TestAllTypes::set_repeated_bool(int index, bool value) {
repeated_bool_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bool)
}
inline void TestAllTypes::add_repeated_bool(bool value) {
repeated_bool_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bool)
}
inline const ::google::protobuf::RepeatedField< bool >&
TestAllTypes::repeated_bool() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bool)
return repeated_bool_;
}
inline ::google::protobuf::RepeatedField< bool >*
TestAllTypes::mutable_repeated_bool() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bool)
return &repeated_bool_;
}
// repeated string repeated_string = 44;
inline int TestAllTypes::repeated_string_size() const {
return repeated_string_.size();
}
inline void TestAllTypes::clear_repeated_string() {
repeated_string_.Clear();
}
inline const ::std::string& TestAllTypes::repeated_string(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
return repeated_string_.Get(index);
}
inline ::std::string* TestAllTypes::mutable_repeated_string(int index) {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
return repeated_string_.Mutable(index);
}
inline void TestAllTypes::set_repeated_string(int index, const ::std::string& value) {
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
repeated_string_.Mutable(index)->assign(value);
}
inline void TestAllTypes::set_repeated_string(int index, const char* value) {
repeated_string_.Mutable(index)->assign(value);
// @@protoc_insertion_point(field_set_char:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
}
inline void TestAllTypes::set_repeated_string(int index, const char* value, size_t size) {
repeated_string_.Mutable(index)->assign(
reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_set_pointer:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
}
inline ::std::string* TestAllTypes::add_repeated_string() {
// @@protoc_insertion_point(field_add_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
return repeated_string_.Add();
}
inline void TestAllTypes::add_repeated_string(const ::std::string& value) {
repeated_string_.Add()->assign(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
}
inline void TestAllTypes::add_repeated_string(const char* value) {
repeated_string_.Add()->assign(value);
// @@protoc_insertion_point(field_add_char:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
}
inline void TestAllTypes::add_repeated_string(const char* value, size_t size) {
repeated_string_.Add()->assign(reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_add_pointer:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
}
inline const ::google::protobuf::RepeatedPtrField< ::std::string>&
TestAllTypes::repeated_string() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
return repeated_string_;
}
inline ::google::protobuf::RepeatedPtrField< ::std::string>*
TestAllTypes::mutable_repeated_string() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string)
return &repeated_string_;
}
// repeated bytes repeated_bytes = 45;
inline int TestAllTypes::repeated_bytes_size() const {
return repeated_bytes_.size();
}
inline void TestAllTypes::clear_repeated_bytes() {
repeated_bytes_.Clear();
}
inline const ::std::string& TestAllTypes::repeated_bytes(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
return repeated_bytes_.Get(index);
}
inline ::std::string* TestAllTypes::mutable_repeated_bytes(int index) {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
return repeated_bytes_.Mutable(index);
}
inline void TestAllTypes::set_repeated_bytes(int index, const ::std::string& value) {
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
repeated_bytes_.Mutable(index)->assign(value);
}
inline void TestAllTypes::set_repeated_bytes(int index, const char* value) {
repeated_bytes_.Mutable(index)->assign(value);
// @@protoc_insertion_point(field_set_char:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
}
inline void TestAllTypes::set_repeated_bytes(int index, const void* value, size_t size) {
repeated_bytes_.Mutable(index)->assign(
reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_set_pointer:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
}
inline ::std::string* TestAllTypes::add_repeated_bytes() {
// @@protoc_insertion_point(field_add_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
return repeated_bytes_.Add();
}
inline void TestAllTypes::add_repeated_bytes(const ::std::string& value) {
repeated_bytes_.Add()->assign(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
}
inline void TestAllTypes::add_repeated_bytes(const char* value) {
repeated_bytes_.Add()->assign(value);
// @@protoc_insertion_point(field_add_char:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
}
inline void TestAllTypes::add_repeated_bytes(const void* value, size_t size) {
repeated_bytes_.Add()->assign(reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_add_pointer:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
}
inline const ::google::protobuf::RepeatedPtrField< ::std::string>&
TestAllTypes::repeated_bytes() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
return repeated_bytes_;
}
inline ::google::protobuf::RepeatedPtrField< ::std::string>*
TestAllTypes::mutable_repeated_bytes() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_bytes)
return &repeated_bytes_;
}
// repeated .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage repeated_nested_message = 48;
inline int TestAllTypes::repeated_nested_message_size() const {
return repeated_nested_message_.size();
}
inline void TestAllTypes::clear_repeated_nested_message() {
repeated_nested_message_.Clear();
}
inline const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& TestAllTypes::repeated_nested_message(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_message)
return repeated_nested_message_.Get(index);
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::mutable_repeated_nested_message(int index) {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_message)
return repeated_nested_message_.Mutable(index);
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::add_repeated_nested_message() {
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_message)
return repeated_nested_message_.Add();
}
inline ::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage >*
TestAllTypes::mutable_repeated_nested_message() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_message)
return &repeated_nested_message_;
}
inline const ::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage >&
TestAllTypes::repeated_nested_message() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_message)
return repeated_nested_message_;
}
// repeated .proto2_nofieldpresence_unittest.ForeignMessage repeated_foreign_message = 49;
inline int TestAllTypes::repeated_foreign_message_size() const {
return repeated_foreign_message_.size();
}
inline void TestAllTypes::clear_repeated_foreign_message() {
repeated_foreign_message_.Clear();
}
inline const ::proto2_nofieldpresence_unittest::ForeignMessage& TestAllTypes::repeated_foreign_message(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_message)
return repeated_foreign_message_.Get(index);
}
inline ::proto2_nofieldpresence_unittest::ForeignMessage* TestAllTypes::mutable_repeated_foreign_message(int index) {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_message)
return repeated_foreign_message_.Mutable(index);
}
inline ::proto2_nofieldpresence_unittest::ForeignMessage* TestAllTypes::add_repeated_foreign_message() {
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_message)
return repeated_foreign_message_.Add();
}
inline ::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::ForeignMessage >*
TestAllTypes::mutable_repeated_foreign_message() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_message)
return &repeated_foreign_message_;
}
inline const ::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::ForeignMessage >&
TestAllTypes::repeated_foreign_message() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_message)
return repeated_foreign_message_;
}
// repeated .protobuf_unittest.TestAllTypes repeated_proto2_message = 50;
inline int TestAllTypes::repeated_proto2_message_size() const {
return repeated_proto2_message_.size();
}
inline void TestAllTypes::clear_repeated_proto2_message() {
repeated_proto2_message_.Clear();
}
inline const ::protobuf_unittest::TestAllTypes& TestAllTypes::repeated_proto2_message(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_proto2_message)
return repeated_proto2_message_.Get(index);
}
inline ::protobuf_unittest::TestAllTypes* TestAllTypes::mutable_repeated_proto2_message(int index) {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_proto2_message)
return repeated_proto2_message_.Mutable(index);
}
inline ::protobuf_unittest::TestAllTypes* TestAllTypes::add_repeated_proto2_message() {
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_proto2_message)
return repeated_proto2_message_.Add();
}
inline ::google::protobuf::RepeatedPtrField< ::protobuf_unittest::TestAllTypes >*
TestAllTypes::mutable_repeated_proto2_message() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_proto2_message)
return &repeated_proto2_message_;
}
inline const ::google::protobuf::RepeatedPtrField< ::protobuf_unittest::TestAllTypes >&
TestAllTypes::repeated_proto2_message() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_proto2_message)
return repeated_proto2_message_;
}
// repeated .proto2_nofieldpresence_unittest.TestAllTypes.NestedEnum repeated_nested_enum = 51;
inline int TestAllTypes::repeated_nested_enum_size() const {
return repeated_nested_enum_.size();
}
inline void TestAllTypes::clear_repeated_nested_enum() {
repeated_nested_enum_.Clear();
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum TestAllTypes::repeated_nested_enum(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_enum)
return static_cast< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum >(repeated_nested_enum_.Get(index));
}
inline void TestAllTypes::set_repeated_nested_enum(int index, ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum value) {
repeated_nested_enum_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_enum)
}
inline void TestAllTypes::add_repeated_nested_enum(::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum value) {
repeated_nested_enum_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_enum)
}
inline const ::google::protobuf::RepeatedField<int>&
TestAllTypes::repeated_nested_enum() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_enum)
return repeated_nested_enum_;
}
inline ::google::protobuf::RepeatedField<int>*
TestAllTypes::mutable_repeated_nested_enum() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_nested_enum)
return &repeated_nested_enum_;
}
// repeated .proto2_nofieldpresence_unittest.ForeignEnum repeated_foreign_enum = 52;
inline int TestAllTypes::repeated_foreign_enum_size() const {
return repeated_foreign_enum_.size();
}
inline void TestAllTypes::clear_repeated_foreign_enum() {
repeated_foreign_enum_.Clear();
}
inline ::proto2_nofieldpresence_unittest::ForeignEnum TestAllTypes::repeated_foreign_enum(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_enum)
return static_cast< ::proto2_nofieldpresence_unittest::ForeignEnum >(repeated_foreign_enum_.Get(index));
}
inline void TestAllTypes::set_repeated_foreign_enum(int index, ::proto2_nofieldpresence_unittest::ForeignEnum value) {
repeated_foreign_enum_.Set(index, value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_enum)
}
inline void TestAllTypes::add_repeated_foreign_enum(::proto2_nofieldpresence_unittest::ForeignEnum value) {
repeated_foreign_enum_.Add(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_enum)
}
inline const ::google::protobuf::RepeatedField<int>&
TestAllTypes::repeated_foreign_enum() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_enum)
return repeated_foreign_enum_;
}
inline ::google::protobuf::RepeatedField<int>*
TestAllTypes::mutable_repeated_foreign_enum() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_foreign_enum)
return &repeated_foreign_enum_;
}
// repeated string repeated_string_piece = 54 [ctype = STRING_PIECE];
inline int TestAllTypes::repeated_string_piece_size() const {
return repeated_string_piece_.size();
}
inline void TestAllTypes::clear_repeated_string_piece() {
repeated_string_piece_.Clear();
}
inline const ::std::string& TestAllTypes::repeated_string_piece(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
return repeated_string_piece_.Get(index);
}
inline ::std::string* TestAllTypes::mutable_repeated_string_piece(int index) {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
return repeated_string_piece_.Mutable(index);
}
inline void TestAllTypes::set_repeated_string_piece(int index, const ::std::string& value) {
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
repeated_string_piece_.Mutable(index)->assign(value);
}
inline void TestAllTypes::set_repeated_string_piece(int index, const char* value) {
repeated_string_piece_.Mutable(index)->assign(value);
// @@protoc_insertion_point(field_set_char:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
}
inline void TestAllTypes::set_repeated_string_piece(int index, const char* value, size_t size) {
repeated_string_piece_.Mutable(index)->assign(
reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_set_pointer:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
}
inline ::std::string* TestAllTypes::add_repeated_string_piece() {
// @@protoc_insertion_point(field_add_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
return repeated_string_piece_.Add();
}
inline void TestAllTypes::add_repeated_string_piece(const ::std::string& value) {
repeated_string_piece_.Add()->assign(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
}
inline void TestAllTypes::add_repeated_string_piece(const char* value) {
repeated_string_piece_.Add()->assign(value);
// @@protoc_insertion_point(field_add_char:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
}
inline void TestAllTypes::add_repeated_string_piece(const char* value, size_t size) {
repeated_string_piece_.Add()->assign(reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_add_pointer:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
}
inline const ::google::protobuf::RepeatedPtrField< ::std::string>&
TestAllTypes::repeated_string_piece() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
return repeated_string_piece_;
}
inline ::google::protobuf::RepeatedPtrField< ::std::string>*
TestAllTypes::mutable_repeated_string_piece() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_string_piece)
return &repeated_string_piece_;
}
// repeated string repeated_cord = 55 [ctype = CORD];
inline int TestAllTypes::repeated_cord_size() const {
return repeated_cord_.size();
}
inline void TestAllTypes::clear_repeated_cord() {
repeated_cord_.Clear();
}
inline const ::std::string& TestAllTypes::repeated_cord(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
return repeated_cord_.Get(index);
}
inline ::std::string* TestAllTypes::mutable_repeated_cord(int index) {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
return repeated_cord_.Mutable(index);
}
inline void TestAllTypes::set_repeated_cord(int index, const ::std::string& value) {
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
repeated_cord_.Mutable(index)->assign(value);
}
inline void TestAllTypes::set_repeated_cord(int index, const char* value) {
repeated_cord_.Mutable(index)->assign(value);
// @@protoc_insertion_point(field_set_char:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
}
inline void TestAllTypes::set_repeated_cord(int index, const char* value, size_t size) {
repeated_cord_.Mutable(index)->assign(
reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_set_pointer:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
}
inline ::std::string* TestAllTypes::add_repeated_cord() {
// @@protoc_insertion_point(field_add_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
return repeated_cord_.Add();
}
inline void TestAllTypes::add_repeated_cord(const ::std::string& value) {
repeated_cord_.Add()->assign(value);
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
}
inline void TestAllTypes::add_repeated_cord(const char* value) {
repeated_cord_.Add()->assign(value);
// @@protoc_insertion_point(field_add_char:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
}
inline void TestAllTypes::add_repeated_cord(const char* value, size_t size) {
repeated_cord_.Add()->assign(reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_add_pointer:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
}
inline const ::google::protobuf::RepeatedPtrField< ::std::string>&
TestAllTypes::repeated_cord() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
return repeated_cord_;
}
inline ::google::protobuf::RepeatedPtrField< ::std::string>*
TestAllTypes::mutable_repeated_cord() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_cord)
return &repeated_cord_;
}
// repeated .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage repeated_lazy_message = 57 [lazy = true];
inline int TestAllTypes::repeated_lazy_message_size() const {
return repeated_lazy_message_.size();
}
inline void TestAllTypes::clear_repeated_lazy_message() {
repeated_lazy_message_.Clear();
}
inline const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& TestAllTypes::repeated_lazy_message(int index) const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.repeated_lazy_message)
return repeated_lazy_message_.Get(index);
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::mutable_repeated_lazy_message(int index) {
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.repeated_lazy_message)
return repeated_lazy_message_.Mutable(index);
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::add_repeated_lazy_message() {
// @@protoc_insertion_point(field_add:proto2_nofieldpresence_unittest.TestAllTypes.repeated_lazy_message)
return repeated_lazy_message_.Add();
}
inline ::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage >*
TestAllTypes::mutable_repeated_lazy_message() {
// @@protoc_insertion_point(field_mutable_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_lazy_message)
return &repeated_lazy_message_;
}
inline const ::google::protobuf::RepeatedPtrField< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage >&
TestAllTypes::repeated_lazy_message() const {
// @@protoc_insertion_point(field_list:proto2_nofieldpresence_unittest.TestAllTypes.repeated_lazy_message)
return repeated_lazy_message_;
}
// optional uint32 oneof_uint32 = 111;
inline bool TestAllTypes::has_oneof_uint32() const {
return oneof_field_case() == kOneofUint32;
}
inline void TestAllTypes::set_has_oneof_uint32() {
_oneof_case_[0] = kOneofUint32;
}
inline void TestAllTypes::clear_oneof_uint32() {
if (has_oneof_uint32()) {
oneof_field_.oneof_uint32_ = 0u;
clear_has_oneof_field();
}
}
inline ::google::protobuf::uint32 TestAllTypes::oneof_uint32() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.oneof_uint32)
if (has_oneof_uint32()) {
return oneof_field_.oneof_uint32_;
}
return 0u;
}
inline void TestAllTypes::set_oneof_uint32(::google::protobuf::uint32 value) {
if (!has_oneof_uint32()) {
clear_oneof_field();
set_has_oneof_uint32();
}
oneof_field_.oneof_uint32_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.oneof_uint32)
}
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedMessage oneof_nested_message = 112;
inline bool TestAllTypes::has_oneof_nested_message() const {
return oneof_field_case() == kOneofNestedMessage;
}
inline void TestAllTypes::set_has_oneof_nested_message() {
_oneof_case_[0] = kOneofNestedMessage;
}
inline void TestAllTypes::clear_oneof_nested_message() {
if (has_oneof_nested_message()) {
delete oneof_field_.oneof_nested_message_;
clear_has_oneof_field();
}
}
inline const ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage& TestAllTypes::oneof_nested_message() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.oneof_nested_message)
return has_oneof_nested_message()
? *oneof_field_.oneof_nested_message_
: ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage::default_instance();
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::mutable_oneof_nested_message() {
if (!has_oneof_nested_message()) {
clear_oneof_field();
set_has_oneof_nested_message();
oneof_field_.oneof_nested_message_ = new ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage;
}
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.oneof_nested_message)
return oneof_field_.oneof_nested_message_;
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* TestAllTypes::release_oneof_nested_message() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.oneof_nested_message)
if (has_oneof_nested_message()) {
clear_has_oneof_field();
::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* temp = oneof_field_.oneof_nested_message_;
oneof_field_.oneof_nested_message_ = NULL;
return temp;
} else {
return NULL;
}
}
inline void TestAllTypes::set_allocated_oneof_nested_message(::proto2_nofieldpresence_unittest::TestAllTypes_NestedMessage* oneof_nested_message) {
clear_oneof_field();
if (oneof_nested_message) {
set_has_oneof_nested_message();
oneof_field_.oneof_nested_message_ = oneof_nested_message;
}
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.oneof_nested_message)
}
// optional string oneof_string = 113;
inline bool TestAllTypes::has_oneof_string() const {
return oneof_field_case() == kOneofString;
}
inline void TestAllTypes::set_has_oneof_string() {
_oneof_case_[0] = kOneofString;
}
inline void TestAllTypes::clear_oneof_string() {
if (has_oneof_string()) {
oneof_field_.oneof_string_.DestroyNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
clear_has_oneof_field();
}
}
inline const ::std::string& TestAllTypes::oneof_string() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.oneof_string)
if (has_oneof_string()) {
return oneof_field_.oneof_string_.GetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
return *&::google::protobuf::internal::GetEmptyStringAlreadyInited();
}
inline void TestAllTypes::set_oneof_string(const ::std::string& value) {
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.oneof_string)
if (!has_oneof_string()) {
clear_oneof_field();
set_has_oneof_string();
oneof_field_.oneof_string_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
oneof_field_.oneof_string_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), value);
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.oneof_string)
}
inline void TestAllTypes::set_oneof_string(const char* value) {
if (!has_oneof_string()) {
clear_oneof_field();
set_has_oneof_string();
oneof_field_.oneof_string_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
oneof_field_.oneof_string_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(),
::std::string(value));
// @@protoc_insertion_point(field_set_char:proto2_nofieldpresence_unittest.TestAllTypes.oneof_string)
}
inline void TestAllTypes::set_oneof_string(const char* value, size_t size) {
if (!has_oneof_string()) {
clear_oneof_field();
set_has_oneof_string();
oneof_field_.oneof_string_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
oneof_field_.oneof_string_.SetNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), ::std::string(
reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:proto2_nofieldpresence_unittest.TestAllTypes.oneof_string)
}
inline ::std::string* TestAllTypes::mutable_oneof_string() {
if (!has_oneof_string()) {
clear_oneof_field();
set_has_oneof_string();
oneof_field_.oneof_string_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestAllTypes.oneof_string)
return oneof_field_.oneof_string_.MutableNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
inline ::std::string* TestAllTypes::release_oneof_string() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestAllTypes.oneof_string)
if (has_oneof_string()) {
clear_has_oneof_field();
return oneof_field_.oneof_string_.ReleaseNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
} else {
return NULL;
}
}
inline void TestAllTypes::set_allocated_oneof_string(::std::string* oneof_string) {
if (!has_oneof_string()) {
oneof_field_.oneof_string_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
}
clear_oneof_field();
if (oneof_string != NULL) {
set_has_oneof_string();
oneof_field_.oneof_string_.SetAllocatedNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited(),
oneof_string);
}
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestAllTypes.oneof_string)
}
// optional .proto2_nofieldpresence_unittest.TestAllTypes.NestedEnum oneof_enum = 114;
inline bool TestAllTypes::has_oneof_enum() const {
return oneof_field_case() == kOneofEnum;
}
inline void TestAllTypes::set_has_oneof_enum() {
_oneof_case_[0] = kOneofEnum;
}
inline void TestAllTypes::clear_oneof_enum() {
if (has_oneof_enum()) {
oneof_field_.oneof_enum_ = 0;
clear_has_oneof_field();
}
}
inline ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum TestAllTypes::oneof_enum() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestAllTypes.oneof_enum)
if (has_oneof_enum()) {
return static_cast< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum >(oneof_field_.oneof_enum_);
}
return static_cast< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum >(0);
}
inline void TestAllTypes::set_oneof_enum(::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum value) {
if (!has_oneof_enum()) {
clear_oneof_field();
set_has_oneof_enum();
}
oneof_field_.oneof_enum_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.TestAllTypes.oneof_enum)
}
inline bool TestAllTypes::has_oneof_field() const {
return oneof_field_case() != ONEOF_FIELD_NOT_SET;
}
inline void TestAllTypes::clear_has_oneof_field() {
_oneof_case_[0] = ONEOF_FIELD_NOT_SET;
}
inline TestAllTypes::OneofFieldCase TestAllTypes::oneof_field_case() const {
return TestAllTypes::OneofFieldCase(_oneof_case_[0]);
}
inline const TestAllTypes* TestAllTypes::internal_default_instance() {
return &TestAllTypes_default_instance_.get();
}
// your_sha256_hash---
// TestProto2Required
// optional .protobuf_unittest.TestRequired proto2 = 1;
inline bool TestProto2Required::has_proto2() const {
return this != internal_default_instance() && proto2_ != NULL;
}
inline void TestProto2Required::clear_proto2() {
if (GetArenaNoVirtual() == NULL && proto2_ != NULL) delete proto2_;
proto2_ = NULL;
}
inline const ::protobuf_unittest::TestRequired& TestProto2Required::proto2() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.TestProto2Required.proto2)
return proto2_ != NULL ? *proto2_
: *::protobuf_unittest::TestRequired::internal_default_instance();
}
inline ::protobuf_unittest::TestRequired* TestProto2Required::mutable_proto2() {
if (proto2_ == NULL) {
proto2_ = new ::protobuf_unittest::TestRequired;
}
// @@protoc_insertion_point(field_mutable:proto2_nofieldpresence_unittest.TestProto2Required.proto2)
return proto2_;
}
inline ::protobuf_unittest::TestRequired* TestProto2Required::release_proto2() {
// @@protoc_insertion_point(field_release:proto2_nofieldpresence_unittest.TestProto2Required.proto2)
::protobuf_unittest::TestRequired* temp = proto2_;
proto2_ = NULL;
return temp;
}
inline void TestProto2Required::set_allocated_proto2(::protobuf_unittest::TestRequired* proto2) {
delete proto2_;
if (proto2 != NULL && proto2->GetArena() != NULL) {
::protobuf_unittest::TestRequired* new_proto2 = new ::protobuf_unittest::TestRequired;
new_proto2->CopyFrom(*proto2);
proto2 = new_proto2;
}
proto2_ = proto2;
if (proto2) {
} else {
}
// @@protoc_insertion_point(field_set_allocated:proto2_nofieldpresence_unittest.TestProto2Required.proto2)
}
inline const TestProto2Required* TestProto2Required::internal_default_instance() {
return &TestProto2Required_default_instance_.get();
}
// your_sha256_hash---
// ForeignMessage
// optional int32 c = 1;
inline void ForeignMessage::clear_c() {
c_ = 0;
}
inline ::google::protobuf::int32 ForeignMessage::c() const {
// @@protoc_insertion_point(field_get:proto2_nofieldpresence_unittest.ForeignMessage.c)
return c_;
}
inline void ForeignMessage::set_c(::google::protobuf::int32 value) {
c_ = value;
// @@protoc_insertion_point(field_set:proto2_nofieldpresence_unittest.ForeignMessage.c)
}
inline const ForeignMessage* ForeignMessage::internal_default_instance() {
return &ForeignMessage_default_instance_.get();
}
#endif // !PROTOBUF_INLINE_NOT_IN_HEADERS
// your_sha256_hash---
// your_sha256_hash---
// your_sha256_hash---
// @@protoc_insertion_point(namespace_scope)
} // namespace proto2_nofieldpresence_unittest
#ifndef SWIG
namespace google {
namespace protobuf {
template <> struct is_proto_enum< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum> : ::google::protobuf::internal::true_type {};
template <>
inline const EnumDescriptor* GetEnumDescriptor< ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum>() {
return ::proto2_nofieldpresence_unittest::TestAllTypes_NestedEnum_descriptor();
}
template <> struct is_proto_enum< ::proto2_nofieldpresence_unittest::ForeignEnum> : ::google::protobuf::internal::true_type {};
template <>
inline const EnumDescriptor* GetEnumDescriptor< ::proto2_nofieldpresence_unittest::ForeignEnum>() {
return ::proto2_nofieldpresence_unittest::ForeignEnum_descriptor();
}
} // namespace protobuf
} // namespace google
#endif // SWIG
// @@protoc_insertion_point(global_scope)
#endif // your_sha256_hashproto__INCLUDED
```
|
Wilton is an unincorporated community in southern Granville County, North Carolina, United States. It lies north of Grissom and is the former home of Wilton High School.
National Register of Historic Places
Brassfield Baptist Church
Bobbitt-Rogers House and Tobacco Manufactory District
James W. Freeman House
Harris-Currin House
John Peace Jr. House
References
Unincorporated communities in Granville County, North Carolina
Unincorporated communities in North Carolina
|
The 1999–2000 Honduran Segunda División was the 33rd season of the Honduran Segunda División. Under the management of Juan Ramos, Deportes Savio won the tournament after defeating Palestino F.C. in the final series and obtained promotion to the 2000–01 Honduran Liga Nacional.
Final
References
Segunda
1999
|
```javascript
"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
const config_plugins_1 = require("expo/config-plugins");
const withAndroidEdgeToEdgeTheme_1 = require("./withAndroidEdgeToEdgeTheme");
const withAndroidGradleEdgeToEdgeProperty_1 = require("./withAndroidGradleEdgeToEdgeProperty");
const withAndroidRootViewBackgroundColor_1 = require("./withAndroidRootViewBackgroundColor");
const withAndroidUserInterfaceStyle_1 = require("./withAndroidUserInterfaceStyle");
const withIosRootViewBackgroundColor_1 = require("./withIosRootViewBackgroundColor");
const withIosUserInterfaceStyle_1 = require("./withIosUserInterfaceStyle");
const pkg = require('expo-system-ui/package.json');
const withSystemUI = (config) => {
return (0, config_plugins_1.withPlugins)(config, [
withAndroidRootViewBackgroundColor_1.withAndroidRootViewBackgroundColor,
withIosRootViewBackgroundColor_1.withIosRootViewBackgroundColor,
withAndroidUserInterfaceStyle_1.withAndroidUserInterfaceStyle,
withIosUserInterfaceStyle_1.withIosUserInterfaceStyle,
withAndroidEdgeToEdgeTheme_1.withAndroidEdgeToEdgeTheme,
withAndroidGradleEdgeToEdgeProperty_1.withAndroidGradleEdgeToEdgeProperty,
]);
};
exports.default = (0, config_plugins_1.createRunOncePlugin)(withSystemUI, pkg.name, pkg.version);
```
|
```jsx
import React, { useContext, useEffect, useState } from 'react';
import clsx from 'clsx';
import CollapsibleSection from './Components/CollapsibleSection';
import NodeCypherLink from './Components/NodeCypherLink';
import MappedNodeProps from './Components/MappedNodeProps';
import NodePlayCypherLink from './Components/NodePlayCypherLink';
import { Table } from 'react-bootstrap';
import styles from './NodeData.module.css';
import { AppContext } from '../../../AppContext';
const AZKeyVaultNodeData = () => {
const [visible, setVisible] = useState(false);
const [objectid, setObjectid] = useState(null);
const [label, setLabel] = useState(null);
const [domain, setDomain] = useState(null);
const [nodeProps, setNodeProps] = useState({});
const context = useContext(AppContext);
useEffect(() => {
emitter.on('nodeClicked', nodeClickEvent);
return () => {
emitter.removeListener('nodeClicked', nodeClickEvent);
};
}, []);
const nodeClickEvent = (type, id, blocksinheritance, domain) => {
if (type === 'AZKeyVault') {
setVisible(true);
setObjectid(id);
setDomain(domain);
let session = driver.session();
session
.run(
`MATCH (n:AZKeyVault {objectid: $objectid}) RETURN n AS node`,
{
objectid: id,
}
)
.then((r) => {
let props = r.records[0].get('node').properties;
setNodeProps(props);
setLabel(props.name || props.azname || objectid);
session.close();
});
} else {
setObjectid(null);
setVisible(false);
}
};
const displayMap = {
objectid: 'Object ID',
enablerbacauthorization: 'Enable RBAC Authorization',
tenantid: 'Tenant ID',
};
return objectid === null ? (
<div></div>
) : (
<div
className={clsx(
!visible && 'displaynone',
context.darkMode ? styles.dark : styles.light
)}
>
<div className={clsx(styles.dl)}>
<h5>{label || objectid}</h5>
<MappedNodeProps
displayMap={displayMap}
properties={nodeProps}
label={label}
/>
<hr></hr>
<CollapsibleSection header='VAULT READERS'>
<div className={styles.itemlist}>
<Table>
<thead></thead>
<tbody className='searchable'>
<NodeCypherLink
property='Key Readers'
target={objectid}
baseQuery={
'MATCH p = (n)-[r:AZGetKeys|AZMemberOf*1..2]->(g:AZKeyVault {objectid: $objectid})'
}
end={label}
/>
<NodeCypherLink
property='Certificate Readers'
target={objectid}
baseQuery={
'MATCH p = (n)-[r:AZGetCertificates|AZMemberOf*1..2]->(g:AZKeyVault {objectid: $objectid})'
}
end={label}
distinct
/>
<NodeCypherLink
property='Secret Readers'
target={objectid}
baseQuery={
'MATCH p = (n)-[r:AZGetSecrets|AZMemberOf*1..2]->(g:AZKeyVault {objectid: $objectid})'
}
end={label}
distinct
/>
<NodeCypherLink
property='All Readers'
target={objectid}
baseQuery={
'MATCH p = (n)-[r:AZGetKeys|AZGetCertificates|AZGetSecrets|AZMemberOf*1..2]->(g:AZKeyVault {objectid: $objectid})'
}
end={label}
distinct
/>
</tbody>
</Table>
</div>
</CollapsibleSection>
<hr></hr>
<CollapsibleSection header='INBOUND OBJECT CONTROL'>
<div className={styles.itemlist}>
<Table>
<thead></thead>
<tbody className='searchable'>
<NodeCypherLink
property='Explicit Object Controllers'
target={objectid}
baseQuery={
'MATCH p = (n)-[r:AZOwns|AZUserAccessAdministrator|AZContributor|AZKeyVaultKVContributor]->(g:AZKeyVault {objectid: $objectid})'
}
end={label}
distinct
/>
<NodeCypherLink
property='Unrolled Object Controllers'
target={objectid}
baseQuery={
'MATCH p = (n)-[r:AZMemberOf]->(g1)-[r1:AZOwns|AZUserAccessAdministrator|AZContributor|AZKeyVaultKVContributor]->(g2:AZKeyVault {objectid: $objectid}) WITH LENGTH(p) as pathLength, p, n WHERE NONE (x in NODES(p)[1..(pathLength-1)] WHERE x.objectid = g2.objectid) AND NOT n.objectid = g2.objectid'
}
end={label}
distinct
/>
<NodePlayCypherLink
property='Transitive Object Controllers'
target={objectid}
baseQuery={
'MATCH (n) WHERE NOT n.objectid=$objectid WITH n MATCH p = shortestPath((n)-[r*1..]->(g:AZKeyVault {objectid: $objectid}))'
}
end={label}
distinct
/>
</tbody>
</Table>
</div>
</CollapsibleSection>
{/* <Notes objectid={objectid} type='AZKeyVault' />
<NodeGallery
objectid={objectid}
type='AZKeyVault'
visible={visible}
/> */}
</div>
</div>
);
};
AZKeyVaultNodeData.propTypes = {};
export default AZKeyVaultNodeData;
```
|
```shell
#! /bin/bash
cd ~/apartment-finder
sudo apt-get update
sudo apt-get install python3-pip -y
sudo apt-get install -y make build-essential libssl-dev zlib1g-dev libbz2-dev \
libreadline-dev libsqlite3-dev wget curl llvm libncurses5-dev zip git-core sqlite -y
sudo pip3 install -r requirements.txt
sudo service scraper stop || true
sudo cp deployment/scraper.conf /etc/init/scraper.conf
sudo service scraper start
```
|
The Newz was a half-hour syndicated sketch comedy television series that aired in 1994 and 1995. It starred Tommy Blaze, Mystro Clark, Deborah Magdalena, Dan O'Connor, Stan Quash, Brad Sherwood, Nancy Sullivan, Shawn Alex Thompson, and Lou Thornton. In addition to the main cast, regular guest stars included Melissa Savage, Mark Fenlon, Justin Cambridge, and Tim Watters as Bill Clinton. The series was produced from Universal Studios in Orlando, Florida.
The show was notable for being the first ever nightly scripted sketch comedy show, and was conceived and created by Executive Producer James McNamara. Rather than weekly as are most sketch comedies; the show aired five nights a week, plus a repeat episode on Saturdays. The writers were: Wayne Page (Producer / Head Writer), Jeff McCarthy, Jon Ezrine, Michael Price, David Litt, Andrew Ornstein, Micheal Globerman, JoJo Liblier, Terry Ward, Shang Forbes and Michael Wilson.
Recurring segments included:
Tommy Blaze and the Newz, in which Blaze would deliver what was basically a monologue on recent news events. In this piece, Tommy would be seated in a chair modeled after Captain Kirk's command chair from the original Enterprise. Behind him was a wall of televisions. Tagline, "I'm not finished yet!"
Ask Abby and Andy, a relationship advice segment in which Abby (Sullivan) would give caring, insightful advice in response to the mailed-in problems, after which Andy (Blaze) would give his outrageous (and usually sexist) point of view on the subject.
Short humorous films by Thompson.
Quash as someone who was extremely disgruntled because of his job; e.g., as "Bag Boy" who hates bagging groceries, conceived and written by Wayne Page & Jeff McCarthy as a vehicle for Quash. "Elf Boy" who hated working for Santa Claus, or as "Caddie Boy" who was sick and tired of putting up with bad golfers.
Malcolm X in various situations where he would deliver some of his famed speeches. The title of the sketch was always a play on his name (and self-titled biography), for example "Malcolm FedEx", after the company.
Tom Slack, segments starring Sherwood as a narcoleptic in high-stress jobs such as Airline Pilot, Heart Surgeon and Zeppelin Pilot on the Hindenburg. conceived and written by Wayne Page & Jeff McCarthy.
References
External links
1990s American satirical television series
1990s American sketch comedy television series
1994 American television series debuts
1995 American television series endings
First-run syndicated television programs in the United States
Television series by Sony Pictures Television
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.carbondata.core.scan.expression;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import org.apache.carbondata.common.logging.LogServiceFactory;
import org.apache.carbondata.core.constants.CarbonCommonConstants;
import org.apache.carbondata.core.metadata.datatype.DataType;
import org.apache.carbondata.core.scan.expression.conditional.GreaterThanEqualToExpression;
import org.apache.carbondata.core.scan.expression.conditional.GreaterThanExpression;
import org.apache.carbondata.core.scan.expression.conditional.LessThanEqualToExpression;
import org.apache.carbondata.core.scan.expression.conditional.LessThanExpression;
import org.apache.carbondata.core.scan.expression.logical.AndExpression;
import org.apache.carbondata.core.scan.expression.logical.OrExpression;
import org.apache.carbondata.core.scan.expression.logical.RangeExpression;
import org.apache.carbondata.core.scan.expression.logical.TrueExpression;
import org.apache.carbondata.core.scan.filter.intf.ExpressionType;
import static org.apache.carbondata.core.scan.filter.intf.ExpressionType.FALSE;
import static org.apache.carbondata.core.scan.filter.intf.ExpressionType.GREATERTHAN;
import static org.apache.carbondata.core.scan.filter.intf.ExpressionType.GREATERTHAN_EQUALTO;
import static org.apache.carbondata.core.scan.filter.intf.ExpressionType.LESSTHAN;
import static org.apache.carbondata.core.scan.filter.intf.ExpressionType.LESSTHAN_EQUALTO;
import org.apache.log4j.Logger;
public class RangeExpressionEvaluator {
private static final Logger LOG =
LogServiceFactory.getLogService(RangeExpressionEvaluator.class.getName());
private Expression expr;
private Expression srcNode;
private Expression tarNode;
private Expression tarParentNode;
public RangeExpressionEvaluator(Expression expr) {
this.expr = expr;
}
public Expression getExpr() {
return expr;
}
public void setExpr(Expression expr) {
this.expr = expr;
}
private Expression getSrcNode() {
return srcNode;
}
private void setTarNode(Expression expr) {
this.tarNode = expr;
}
private void setTarParentNode(Expression expr) {
this.tarParentNode = expr;
}
/**
* This method evaluates is any greater than or less than expression can be transformed
* into a single RANGE filter.
*/
public void rangeExpressionEvaluatorMapBased() {
// The algorithm :
// Get all the nodes of the Expression Tree and fill it into a MAP.
// The Map structure will be currentNode, ColumnName, LessThanOrGreaterThan, Value, ParentNode
// Group the rows in MAP according to the columns and then evaluate if it can be transformed
// into a RANGE or not.
//
// AND AND
// | |
// / \ / \
// / \ / \
// Less Greater => TRUE Range
// / \ / \ / \
// / \ / \ / \
// a 10 a 5 Less greater
// /\ /\
// / \ / \
// a 10 a 5
//
Map<String, List<FilterModificationNode>> filterExpressionMap;
filterExpressionMap = convertFilterTreeToMap();
replaceWithRangeExpression(filterExpressionMap);
filterExpressionMap.clear();
}
public void replaceWithRangeExpression(
Map<String, List<FilterModificationNode>> filterExpressionMap) {
List<FilterModificationNode> deleteExp = new ArrayList<>();
Iterator<Map.Entry<String, List<FilterModificationNode>>> iterator =
filterExpressionMap.entrySet().iterator();
Map.Entry<String, List<FilterModificationNode>> nextEntry = null;
while (iterator.hasNext()) {
nextEntry = iterator.next();
List<FilterModificationNode> filterExp = nextEntry.getValue();
if (filterExp.size() > 1) {
// There are multiple Expression for the same column traverse and check if they can
// form a range.
FilterModificationNode startMin = null;
FilterModificationNode endMax = null;
for (FilterModificationNode exp : filterExp) {
if ((exp.getExpType() == GREATERTHAN) || (exp.getExpType() == GREATERTHAN_EQUALTO)) {
if ((null == endMax) || ((checkLiteralValue(exp.getCurrentExp(),
endMax.getCurrentExp())))) {
if (null == startMin) {
startMin = exp;
} else {
// There is already some value in startMin so check which one is greater.
LiteralExpression srcLiteral = getChildLiteralExpression(startMin.getCurrentExp());
LiteralExpression tarLiteral = getChildLiteralExpression(exp.getCurrentExp());
ExpressionResult srcExpResult = srcLiteral.evaluate(null);
ExpressionResult tarExpResult = tarLiteral.evaluate(null);
if (srcExpResult.compareTo(tarExpResult) < 0) {
// Before replacing the startMin add the current StartMin into deleteExp List
// as they will be replaced with TRUE expression after RANGE formation.
deleteExp.add(startMin);
startMin = exp;
}
}
}
}
if ((exp.getExpType() == LESSTHAN) || (exp.getExpType() == LESSTHAN_EQUALTO)) {
if ((null == startMin) || ((checkLiteralValue(exp.getCurrentExp(),
startMin.getCurrentExp())))) {
if (null == endMax) {
endMax = exp;
} else {
// There is already some value in endMax so check which one is less.
LiteralExpression srcLiteral = getChildLiteralExpression(endMax.getCurrentExp());
LiteralExpression tarLiteral = getChildLiteralExpression(exp.getCurrentExp());
ExpressionResult srcExpResult = srcLiteral.evaluate(null);
ExpressionResult tarExpResult = tarLiteral.evaluate(null);
if (srcExpResult.compareTo(tarExpResult) > 0) {
// Before replacing the endMax add the current endMax into deleteExp List
// as they will be replaced with TRUE expression after RANGE formation.
deleteExp.add(endMax);
endMax = exp;
}
}
}
}
}
if ((null != startMin) && (null != endMax)) {
LOG.info(
"GreaterThan and LessThan Filter Expression changed to Range Expression for column "
+ nextEntry.getKey());
// the node can be converted to RANGE.
Expression n1 = startMin.getCurrentExp();
Expression n2 = endMax.getCurrentExp();
RangeExpression rangeTree = new RangeExpression(n1, n2);
Expression srcParentNode = startMin.getParentExp();
Expression tarParentNode = endMax.getParentExp();
srcParentNode.findAndSetChild(startMin.getCurrentExp(), rangeTree);
tarParentNode.findAndSetChild(endMax.getCurrentExp(), new TrueExpression(null));
if (deleteExp.size() > 0) {
// There are some expression to Delete as they are Redundant after Range Formation.
for (FilterModificationNode trueExp : deleteExp) {
trueExp.getParentExp()
.findAndSetChild(trueExp.getCurrentExp(), new TrueExpression(null));
}
}
}
}
}
}
private Map<String, List<FilterModificationNode>> convertFilterTreeToMap() {
// Traverse the Filter Tree and add the nodes in filterExpressionMap.
// Only those nodes will be added which has got LessThan, LessThanEqualTo
// GreaterThan, GreaterThanEqualTo Expression Only.
Map<String, List<FilterModificationNode>> filterExpressionMap =
new HashMap<>(CarbonCommonConstants.DEFAULT_COLLECTION_SIZE);
// Traverse the Tree.
fillExpressionMap(filterExpressionMap, null, null);
return filterExpressionMap;
}
private void evaluateOrExpression(Expression currentNode, Expression orExpChild) {
Map<String, List<FilterModificationNode>> filterExpressionMapNew =
new HashMap<>(CarbonCommonConstants.DEFAULT_COLLECTION_SIZE);
fillExpressionMap(filterExpressionMapNew, orExpChild, currentNode);
replaceWithRangeExpression(filterExpressionMapNew);
filterExpressionMapNew.clear();
}
private void fillExpressionMap(Map<String, List<FilterModificationNode>> filterExpressionMap,
Expression currentNode, Expression parentNode) {
if (null == currentNode) {
currentNode = this.getExpr();
parentNode = currentNode;
}
// if the parentNode is a ANDExpression and the current node is LessThan, GreaterThan
// then add the node into filterExpressionMap.
if ((parentNode instanceof AndExpression) && (isLessThanGreaterThanExp(currentNode)
&& eligibleForRangeExpConversion(currentNode))) {
addFilterExpressionMap(filterExpressionMap, currentNode, parentNode);
}
// In case of Or Exp we have to evaluate both the subtrees of expression separately
// else it will combine the results of both the subtrees into one expression
// which wont give us correct result
if (currentNode instanceof OrExpression) {
Expression leftChild = ((OrExpression) currentNode).left;
Expression rightChild = ((OrExpression) currentNode).right;
if (null != leftChild) {
evaluateOrExpression(currentNode, leftChild);
}
if (null != rightChild) {
evaluateOrExpression(currentNode, rightChild);
}
} else {
for (Expression exp : currentNode.getChildren()) {
if (null != exp) {
fillExpressionMap(filterExpressionMap, exp, currentNode);
}
}
}
}
private void addFilterExpressionMap(Map<String, List<FilterModificationNode>> filterExpressionMap,
Expression currentNode, Expression parentNode) {
String colName = getColumnName(currentNode);
ExpressionType expType = getExpressionType(currentNode);
FilterModificationNode filterExpression =
new FilterModificationNode(currentNode, parentNode, expType);
if (null == filterExpressionMap.get(colName)) {
filterExpressionMap.put(colName, new ArrayList<FilterModificationNode>());
}
filterExpressionMap.get(colName).add(filterExpression);
}
/**
* This method checks if the Expression is among LessThan, LessThanEqualTo,
* GreaterThan or GreaterThanEqualTo
*
* @param expr
* @return
*/
private boolean isLessThanGreaterThanExp(Expression expr) {
return (expr instanceof LessThanEqualToExpression) || (expr instanceof LessThanExpression)
|| (expr instanceof GreaterThanEqualToExpression)
|| (expr instanceof GreaterThanExpression);
}
/**
* This method verifies if the Expression is qualified for Range Expression conversion.
*
* @param expChild
* @return
*/
private boolean eligibleForRangeExpConversion(Expression expChild) {
for (Expression exp : expChild.getChildren()) {
if (exp instanceof ColumnExpression) {
return ((ColumnExpression) exp).isDimension() &&
!(((ColumnExpression) exp).getDimension().getDataType().isComplexType());
}
}
return false;
}
/**
* This method returns the Column name from the ColumnExpression ExpressionType.
*
* @param andNode
* @return
*/
private String getColumnName(Expression andNode) {
// returns the Column Name from Column Expression.
for (Expression exp : andNode.getChildren()) {
if (exp instanceof ColumnExpression) {
return ((ColumnExpression) exp).getColumnName();
}
}
return null;
}
/**
* This method returns the Value from the Literal ExpressionType.
*
* @param exp
* @return
*/
private Object getLiteralValue(Expression exp) {
for (Expression expr : exp.getChildren()) {
if (expr instanceof LiteralExpression) {
return (((LiteralExpression) expr).getLiteralExpValue());
}
}
return null;
}
/**
* This method returns the DataType of the Literal Expression.
*
* @param exp
* @return
*/
private DataType getLiteralDataType(Expression exp) {
for (Expression expr : exp.getChildren()) {
if (expr instanceof LiteralExpression) {
return (((LiteralExpression) expr).getLiteralExpDataType());
}
}
return null;
}
/**
* This method returns the DataType of the Literal Expression.
*
* @param exp
* @return
*/
private LiteralExpression getChildLiteralExpression(Expression exp) {
for (Expression expr : exp.getChildren()) {
if (expr instanceof LiteralExpression) {
return ((LiteralExpression) expr);
}
}
return null;
}
/**
* This method returns the ExpressionType based on the Expression.
*
* @param exp
* @return
*/
private ExpressionType getExpressionType(Expression exp) {
// return the expressionType. Note among the children of the
// andNode one should be columnExpression others should be
// LessThan, LessThanEqualTo, GreaterThan, GreaterThanEqualTo.
//
if (exp instanceof LessThanExpression) {
return LESSTHAN;
} else if (exp instanceof LessThanEqualToExpression) {
return LESSTHAN_EQUALTO;
} else if (exp instanceof GreaterThanExpression) {
return GREATERTHAN;
} else if (exp instanceof GreaterThanEqualToExpression) {
return GREATERTHAN_EQUALTO;
} else {
return FALSE;
}
}
/**
* This method checks if the Source Expression matches with Target Expression.
*
* @param src
* @param tar
* @return
*/
private boolean matchExpType(ExpressionType src, ExpressionType tar) {
return (((src == LESSTHAN) || (src == LESSTHAN_EQUALTO)) && ((tar == GREATERTHAN) || (tar
== GREATERTHAN_EQUALTO))) || (((src == GREATERTHAN) || (src == GREATERTHAN_EQUALTO)) && (
(tar == LESSTHAN) || (tar == LESSTHAN_EQUALTO)));
}
/**
* This Method Traverses the Expression Tree to find the corresponding node of the Range
* Expression. If one node of Range Expression is LessThan then a corresponding GreaterThan
* will be chosen or vice versa.
*
* @param currentNode
* @param parentNode
* @return
*/
private Expression traverseTree(Expression currentNode, Expression parentNode) {
Expression result = null;
if (null == parentNode) {
currentNode = this.getExpr();
parentNode = currentNode;
}
if (!this.getSrcNode().equals(currentNode) && isLessThanGreaterThanExp(currentNode)) {
String srcColumnName = getColumnName(this.getSrcNode());
String tarColumnName = getColumnName(currentNode);
ExpressionType srcExpType = getExpressionType(this.getSrcNode());
ExpressionType tarExpType = getExpressionType(currentNode);
if ((null != srcColumnName) && (null != tarColumnName) && (srcColumnName
.equals(tarColumnName)) && (srcExpType != ExpressionType.FALSE) && (tarExpType
!= ExpressionType.FALSE) && ((matchExpType(srcExpType, tarExpType)) && checkLiteralValue(
this.getSrcNode(), currentNode))) {
this.setTarNode(currentNode);
this.setTarParentNode(parentNode);
return parentNode;
}
}
for (Expression exp : currentNode.getChildren()) {
if (null != exp && !(exp instanceof RangeExpression)) {
result = traverseTree(exp, currentNode);
if (null != result) {
return result;
}
}
}
return null;
}
/**
* This method will check if the literal values attached to GreaterThan of GreaterThanEqualTo
* is less or equal to LessThan and LessThanEqualTo literal.
*
* @param src
* @param tar
* @return
*/
private boolean checkLiteralValue(Expression src, Expression tar) {
ExpressionType srcExpressionType = getExpressionType(src);
ExpressionType tarExpressionType = getExpressionType(tar);
LiteralExpression srcLiteral = getChildLiteralExpression(src);
LiteralExpression tarLiteral = getChildLiteralExpression(tar);
ExpressionResult srcExpResult = srcLiteral.evaluate(null);
ExpressionResult tarExpResult = tarLiteral.evaluate(null);
switch (srcExpressionType) {
case LESSTHAN:
case LESSTHAN_EQUALTO:
switch (tarExpressionType) {
case GREATERTHAN:
if (srcExpResult.compareTo(tarExpResult) > 0) {
return true;
}
break;
case GREATERTHAN_EQUALTO:
if (srcExpResult.compareTo(tarExpResult) >= 0) {
return true;
}
break;
}
break;
case GREATERTHAN:
case GREATERTHAN_EQUALTO:
switch (tarExpressionType) {
case LESSTHAN:
if (srcExpResult.compareTo(tarExpResult) < 0) {
return true;
}
break;
case LESSTHAN_EQUALTO:
if (srcExpResult.compareTo(tarExpResult) <= 0) {
return true;
}
break;
}
break;
}
return false;
}
}
```
|
Chop Shop Records is a record label under partnership with Republic Records, headquartered in South Pasadena, California. The label was founded by Alexandra Patsavas, who also founded Chop Shop Music Supervision, which works with soundtracks on TV shows including Roswell, Boston Public, Grey's Anatomy, Gossip Girl, The O.C., and Chuck, as well as the Twilight series. John Rubeli, a former Atlantic Records vice president, is label manager.
The label works with indie rock bands that are often unsigned or signed with small labels.
Current artists
The Republic Tigers
Scars on 45
Mackintosh Braun
Milo Greene
Anya Marina
Former artists
Marina
The Little Ones
Odessa
Soundtracks of the Twilight series
Alexandra Patsavas is the music supervisor and soundtrack producer for the films in the Twilight series: Twilight, New Moon, Eclipse, Breaking Dawn – Part 1 and Breaking Dawn - Part 2. All five soundtracks were released on Chop Shop.
References
External links
American record labels
Record labels based in California
Republic Records
Companies based in Los Angeles County, California
|
Amy Yang, also known as Yang Hee-Young (, born 28 July 1989) is a South Korean professional golfer, currently playing on the United States-based LPGA Tour and on the Ladies European Tour (LET).
Amateur career
Yang began playing golf at age 10 in South Korea and moved to the Gold Coast of Australia with her family at age 15 to pursue golf more seriously.
In 2005, she won the Queensland Amateur Championship, the youngest winner ever of that championship. In 2006, while still an amateur she won the ANZ Ladies Masters on the Ladies European Tour (LET), making her the youngest winner ever on the LET at age (a record later broken by 14-year-old amateur Atthaya Thitikul in July 2017).
Professional career
After her win in at the ANZ Ladies Masters, the LET offered Yang a special three-year membership exemption beginning in 2006 as a 17-year-old, providing she traveled with her parents until she turned 18. She recorded four top-20 finishes in 2007 while still attended high school.
Yang attended LPGA Tour qualifying school in the fall of 2007 and obtained conditional status on the LPGA Tour as well for 2008.
In June 2008, Yang claimed her second LET win with a four-shot win at the Ladies German Open. Upon winning, Yang announced that she was donating her entire prize of $61,260 to victims of a recent earthquake in China.
That December, she returned to the LPGA Qualifying School, this time earning full playing status for 2009 by finishing second in the five-round event.
On 20 October 2013, Yang won her first LPGA Tour event at the LPGA KEB-HanaBank Championship. She birdied the first sudden-death playoff hole to defeat Hee-Kyung Seo.
On 1 March 2015, Yang won her second LPGA Tour championship at the Honda LPGA Thailand.
Personal life
Yang lives with her father, Joon Mo (James), mother, Sun Hee (Sunny), and younger brother, Steven. In the fall of 2007 the family moved from Australia to Orlando, Florida.
Professional wins (8)
LPGA Tour wins (4)
LPGA Tour playoff record (1–1)
Ladies European Tour (3)
2006 (1) ANZ Ladies Masters (as an amateur)
2008 (2) Ladies German Open, Scandinavian TPC hosted by Annika
KLPGA Tour (2)
2011 (1) KB Star Championship
2013 (1) LPGA KEB-HanaBank Championship (co-sanctioned by LPGA Tour)
Results in LPGA majors
Results not in chronological order.
^ The Evian Championship was added as a major in 2013.
LA = Low amateur
CUT = missed the half-way cut
NT = no tournament
"T" = tied
Summary
Most consecutive cuts made – 15 (2014 Evian – 2017 Evian)
Longest streak of top-10s – 3 (twice)
LPGA Tour career summary
Official as of June 1, 2023
* Includes matchplay and other tournaments without a cut.
World ranking
Position in Women's World Golf Rankings at the end of each calendar year.
^ as of 19 June 2023
Team appearances
Professional
International Crown (representing South Korea): 2016
References
External links
Seoul Sisters Profile
Amy Yang Pictures
South Korean female golfers
Ladies European Tour golfers
LPGA Tour golfers
Olympic golfers for South Korea
Golfers at the 2016 Summer Olympics
Sportspeople from Gyeonggi Province
Golfers from Orlando, Florida
1989 births
Living people
People from Goyang
|
Miedwie (, ) is a lake in the Pomeranian Lakeland region of West Pomeranian Voivodship, in northwestern Poland.
Geography
The lake is in surface area. It is 16.2 km long and 3.2 km wide. Its maximum depth is 43.8 m.
The lake has a 150m long pier.
Miedwie lake and its surrounding area is a Natura 2000 EU Special Protection Area.
See also
Rów Kunowski
Special Protection Areas in Poland
References
Lakes of West Pomeranian Voivodeship
Natura 2000 in Poland
Parks in West Pomeranian Voivodeship
Lakes of Poland
Pyrzyce County
Stargard County
|
```makefile
obj/local/x86/objs/drizzleDumper/drizzleDumper.o: drizzleDumper.c \
drizzleDumper.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/stdlib.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/cdefs.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/cdefs_elf.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/android/api-level.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/string.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/malloc.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/alloca.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/strings.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/types.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/stdint.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/_types.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/machine/_types.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/posix_types.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/stddef.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/compiler.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/posix_types.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/posix_types_32.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/types.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/types.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/machine/kernel.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/sysmacros.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/memory.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/stdio.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/dirent.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/fcntl.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/fcntl.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/fcntl.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/fcntl.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/unistd.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/select.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/time.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/time.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/signal.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/limits.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/limits.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/limits.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/machine/internal_types.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/machine/limits.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/syslimits.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/page.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/page_32.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/signal.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/signal.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/sigcontext.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/siginfo.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/siginfo.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/sysconf.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/capability.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/pathconf.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/errno.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/errno.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/errno.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/errno.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/errno-base.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/ptrace.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/ptrace.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/ptrace.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/ptrace-abi.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/wait.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/resource.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/resource.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/resource.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/resource.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/wait.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/user.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/user.h \
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/user_32.h
drizzleDumper.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/stdlib.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/cdefs.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/cdefs_elf.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/android/api-level.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/string.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/malloc.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/alloca.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/strings.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/types.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/stdint.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/_types.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/machine/_types.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/posix_types.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/stddef.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/compiler.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/posix_types.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/posix_types_32.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/types.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/types.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/machine/kernel.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/sysmacros.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/memory.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/stdio.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/dirent.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/fcntl.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/fcntl.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/fcntl.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/fcntl.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/unistd.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/select.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/time.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/time.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/signal.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/limits.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/limits.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/limits.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/machine/internal_types.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/machine/limits.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/syslimits.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/page.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/page_32.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/signal.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/signal.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/sigcontext.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/siginfo.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/siginfo.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/sysconf.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/capability.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/pathconf.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/errno.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/errno.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/errno.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/errno.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/errno-base.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/ptrace.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/ptrace.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/ptrace.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/ptrace-abi.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/wait.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/sys/resource.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/resource.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/resource.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm-generic/resource.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/wait.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/linux/user.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/user.h:
/Users/drizzle/Library/Android/android-ndk-r9/platforms/android-9/arch-x86/usr/include/asm/user_32.h:
```
|
Abayev or Abaev is a surname. Notable people with the surname include:
Akhsarbek Abaev (1923–1982), Ossetian Red Army Sergeant and Hero of the Soviet Union
Dauren Abaev (born 1979), Kazakh politician and diplomat
Eli Abaev (born 1998), American-Israeli basketball player for Hapoel Be'er Sheva in the Israeli Basketball Premier League
Genrikh Abaev (1932–2014), Belarusian professor
Ilya Abayev (born 1981), Russian footballer
Vasily Abaev (1900–2001), Ossetian Soviet linguist
|
This is a list of 646 species in Clivina, a genus of ground beetles in the family Carabidae.
Clivina species
Subgenus Antroforceps Barr, 1967
Clivina alabama Bousquet, 2012
Clivina bolivari (Barr, 1967)
Clivina sasajii Ball, 2001
Subgenus Clivina Latreille, 1802
Clivina acutimentum Balkenohl, 2021
Clivina acutipalpis Putzeys, 1877
Clivina addita Darlington, 1934
Clivina adstricta Putzeys, 1867
Clivina aequalis Blackburn, 1890
Clivina agona Putzeys, 1867
Clivina agumbea Balkenohl, 2021
Clivina alleni Baehr, 2015
Clivina alternans Darlington, 1971
Clivina amazonica Putzeys, 1861
Clivina ambigua Baehr, 2015
Clivina ampandrandavae Basilewsky, 1973
Clivina angulicollis Baehr, 2015
Clivina angustipes Putzeys, 1868
Clivina antennaria Putzeys, 1867
Clivina anthracina Klug, 1862
Clivina antoni Balkenohl, 2018
Clivina apexopaca Balkenohl, 2021
Clivina apexplana Balkenohl, 2021
Clivina argenteicola Baehr, 2015
Clivina armata Putzeys, 1846
Clivina arnhemensis Baehr, 2015
Clivina arunachalensis Saha & Biswas, 1985
Clivina asymmetrica Baehr, 2015
Clivina athertonensis Baehr, 2015
Clivina atrata Putzeys, 1861
Clivina atridorsis Sloane, 1905
Clivina australasiae Boheman, 1858
Clivina australica Sloane, 1896
Clivina bacillaria Bates, 1889
Clivina balli Baehr, 2015
Clivina baloghi Baehr, 2015
Clivina bankae Baehr, 2017
Clivina banksi Sloane, 1907
Clivina basalis Chaudoir, 1843
Clivina bataviae Baehr, 2015
Clivina batesi Putzeys, 1867
Clivina bengalensis Putzeys, 1846
Clivina bicolor Putzeys, 1867
Clivina bicolorata Baehr, 2015
Clivina bicornuta Baehr, 2008
Clivina bidentata Putzeys, 1846
Clivina bifoveata Putzeys, 1861
Clivina bifoveifrons Baehr, 2015
Clivina biguttata Putzeys, 1867
Clivina bilyi Baehr, 2015
Clivina bingbong Baehr, 2015
Clivina biplagiata Putzeys, 1866
Clivina birdumensis Baehr, 2015
Clivina biroi Kult, 1951
Clivina bitincta Sloane, 1905
Clivina bituberculata Putzeys, 1867
Clivina blackburni Sloane, 1896
Clivina boliviensis Putzeys, 1846
Clivina boops Blackburn, 1890
Clivina bouchardi Baehr, 2015
Clivina bovillae Blackburn, 1890
Clivina bowenensis Baehr, 2008
Clivina brandti Darlington, 1962
Clivina breviceps Baehr, 2015
Clivina brevicollis Putzeys, 1867
Clivina brevicornis Darlington, 1962
Clivina brevior Putzeys, 1867
Clivina brevipennis Baehr, 2015
Clivina brevisterna Sloane, 1916
Clivina breviuscula Putzeys, 1867
Clivina brittoni Baehr, 2015
Clivina brooksi Baehr, 2015
Clivina brunnea Putzeys, 1846
Clivina brunnicolor Sloane, 1916
Clivina brunnipennis Putzeys, 1846
Clivina bulirschi Baehr, 2015
Clivina bullata Andrewes, 1927
Clivina bunburyana Baehr, 2015
Clivina burmeisteri Putzeys, 1867
Clivina cairnsensis Baehr, 2015
Clivina carbinensis Baehr, 2015
Clivina carbonaria Putzeys, 1867
Clivina carinifera Baehr, 2015
Clivina carnabyi Baehr, 2017
Clivina carpentaria Sloane, 1896
Clivina castanea Westwood, 1837
Clivina cava Putzeys, 1866
Clivina choatei Bousquet & Skelley, 2012
Clivina clarencea Baehr, 2015
Clivina clivinoides (Schmidt-Goebel, 1846)
Clivina cobourgiana Baehr, 2017
Clivina cochlearia Baehr, 2015
Clivina collaris (Herbst, 1784)
Clivina columbica Putzeys, 1846
Clivina communis Baehr, 2015
Clivina confinis Baehr, 2015
Clivina conicollis Baehr, 2017
Clivina consanguinea Baehr, 2015
Clivina consimilis Baehr, 2015
Clivina convexior Baehr, 2015
Clivina cooindae Baehr, 2017
Clivina cooperensis Baehr, 2015
Clivina coriacea Baehr, 2015
Clivina coronata Putzeys, 1873
Clivina corrugata Baehr, 2015
Clivina coryzoides Baehr, 1989
Clivina crassidentata Baehr, 2008
Clivina crassipennis Baehr, 2017
Clivina crawfordensis Baehr, 2015
Clivina crenulata Balkenohl, 2021
Clivina cribricollis Putzeys, 1861
Clivina cribrifrons Sloane, 1905
Clivina cribrosa Putzeys, 1868
Clivina cruciata Putzeys, 1867
Clivina cruralis Putzeys, 1867
Clivina csikii Kult, 1951
Clivina cubae Darlington, 1934
Clivina cuttacutta Baehr, 2015
Clivina cylindracea Baehr, 2008
Clivina cylindriformis Sloane, 1896
Clivina cylindripennis Sloane, 1905
Clivina dampieri Sloane, 1916
Clivina darlingtoni Baehr, 2008
Clivina darlingtoniana Baehr, 2015
Clivina darwinensis Baehr, 2015
Clivina darwini Sloane, 1916
Clivina dealata Darlington, 1962
Clivina debilis Blackburn, 1890
Clivina defaverii Baehr, 2008
Clivina deleta Darlington, 1962
Clivina delkeskampi Kult, 1959
Clivina demarzi Baehr, 1988
Clivina densepunctata Baehr, 2015
Clivina densesulcata Baehr, 2008
Clivina denticollis Sloane, 1896
Clivina dentifemorata Putzeys, 1846
Clivina deplanata Putzeys, 1867
Clivina depressa Kult, 1951
Clivina depressicollis Baehr, 1989
Clivina desperata Baehr, 2008
Clivina difformis Putzeys, 1868
Clivina diluta Darlington, 1953
Clivina dilutipes Putzeys, 1868
Clivina dimidiata Putzeys, 1866
Clivina dingo Sloane, 1905
Clivina discrepans Baehr, 2015
Clivina dissimilis Putzeys, 1846
Clivina distigma Putzeys, 1867
Clivina doddi Sloane, 1905
Clivina dolens Putzeys, 1873
Clivina dostali Baehr, 2015
Clivina douglasensis Baehr, 2015
Clivina drumonti Balkenohl, 2021
Clivina drysdalea Baehr, 2015
Clivina dubia Baehr, 2017
Clivina duboisi Burgeon, 1935
Clivina edithae Baehr, 2015
Clivina edungalbae Baehr, 2015
Clivina elegans Putzeys, 1861
Clivina elliott Baehr, 2015
Clivina elongata Chaudoir, 1843
Clivina elongatula Nietner, 1856
Clivina emarginata Putzeys, 1868
Clivina eremicola Blackburn, 1894
Clivina erugata Darlington, 1962
Clivina erugatella Darlington, 1962
Clivina erythropus Putzeys, 1846
Clivina euphratica Putzeys, 1867
Clivina excavatifrons Baehr, 2015
Clivina exilis Sloane, 1916
Clivina extensicollis Putzeys, 1846
Clivina ferruginea Putzeys, 1868
Clivina fessa Darlington, 1962
Clivina finitima Baehr, 2015
Clivina flava Putzeys, 1868
Clivina fluviatilis Baehr, 2015
Clivina fontisaliceae Baehr, 2008
Clivina fortis Sloane, 1896
Clivina fossifrons Putzeys, 1867
Clivina fossor (Linnaeus, 1758)
Clivina fossulata Baehr, 2015
Clivina foveiceps Putzeys, 1846
Clivina foveifrons Baehr, 2017
Clivina foveiventris Baehr, 2015
Clivina frenchi Sloane, 1896
Clivina froggatti Sloane, 1896
Clivina frontalis Baehr, 2015
Clivina fuscicornis Putzeys, 1846
Clivina fuscipes Putzeys, 1846
Clivina gamma Andrewes, 1929
Clivina gemina Baehr, 2017
Clivina gentilis Baehr, 2015
Clivina germanni Balkenohl, 2021
Clivina gerstmeieri Baehr, 1989
Clivina gilesi Baehr, 2008
Clivina glabrata Baehr, 2015
Clivina glabriceps Baehr, 2015
Clivina glabripennis Baehr, 2017
Clivina goldingi Baehr, 2017
Clivina goniostoma Putzeys, 1867
Clivina gracilipes Sloane, 1896
Clivina grahami Baehr, 2015
Clivina grandiceps Sloane, 1896
Clivina grata Darlington, 1953
Clivina gressitti Darlington, 1962
Clivina grossi Baehr, 2008
Clivina gubarae Baehr, 2015
Clivina guineensis Kult, 1951
Clivina gunlomensis Baehr, 2015
Clivina hackeri Sloane, 1907
Clivina haeckeli Baehr, 2015
Clivina hanichi Baehr, 2008
Clivina hartleyi Baehr, 2015
Clivina hasenpuschi Baehr, 2015
Clivina heathlandica Baehr, 2015
Clivina helferi Putzeys, 1867
Clivina helmsi Blackburn, 1892
Clivina helmutbergeri Baehr, 2015
Clivina hennigi Baehr, 2015
Clivina heridgei Baehr, 2008
Clivina heros Baehr, 2017
Clivina heterogena Putzeys, 1866
Clivina hilaris Putzeys, 1861
Clivina hogani Balkenohl, 2021
Clivina hogenhoutae Baehr, 2015
Clivina horaki Baehr, 2017
Clivina horneri Baehr, 2017
Clivina houstoni Baehr, 2008
Clivina hovorkai Baehr, 2015
Clivina howdenorum Baehr, 2015
Clivina impressefrons LeConte, 1844
Clivina impressiceps Baehr, 2015
Clivina impuncticollis Baehr, 2015
Clivina inaequalifrons Baehr, 1989
Clivina inaequalis Putzeys, 1867
Clivina incerta Baehr, 2008
Clivina incurvicollis Baehr, 2017
Clivina inermis Baehr, 2015
Clivina infans Baehr, 2017
Clivina inopaca Darlington, 1962
Clivina inopinata Baehr, 2017
Clivina inops Baehr, 2008
Clivina integra Andrewes, 1929
Clivina interioris Baehr, 2008
Clivina interposita Baehr, 2017
Clivina intersecta Baehr, 1989
Clivina isogona Putzeys, 1868
Clivina jabiruensis Baehr, 2015
Clivina jakli Baehr, 2015
Clivina janae Kult, 1959
Clivina janetae Baehr, 2015
Clivina javanica Putzeys, 1846
Clivina jodasi Kult, 1959
Clivina kakaduana Baehr, 2015
Clivina kalumburu Baehr, 2015
Clivina kapuri Kult, 1951
Clivina karikali Jedlicka, 1964
Clivina kaszabi Kult, 1951
Clivina kershawi Sloane, 1916
Clivina kimberleyana Baehr, 2015
Clivina komareki Kult, 1951
Clivina kubor Darlington, 1971
Clivina kulti Darlington, 1962
Clivina kununurrae Baehr, 2015
Clivina laeta Putzeys, 1867
Clivina laetipes Putzeys, 1867
Clivina laevicollis Baehr, 2015
Clivina laevigata Baehr, 2017
Clivina lamondi Baehr, 2015
Clivina langeri Baehr, 2015
Clivina languida Baehr, 2015
Clivina larrimah Baehr, 2015
Clivina lata Putzeys, 1867
Clivina latesulcata Baehr, 2015
Clivina laticeps Putzeys, 1846
Clivina latimanus Putzeys, 1846
Clivina latiuscula Putzeys, 1867
Clivina leai Sloane, 1896
Clivina lebasii Putzeys, 1846
Clivina lepida Putzeys, 1866
Clivina leptosoma Andrewes, 1938
Clivina lewisi Andrewes, 1927
Clivina limbipennis Jacquelin du Val, 1857
Clivina lincolnensis Baehr, 2008
Clivina lobata Bonelli, 1813
Clivina lobifera Baehr, 2015
Clivina lobipes Sloane, 1896
Clivina longipennis Putzeys, 1861
Clivina longissima Baehr, 2015
Clivina longithorax Baehr, 2008
Clivina lucernicola Baehr, 2015
Clivina lucida Putzeys, 1867
Clivina lutea Baehr, 2015
Clivina macleayi Sloane, 1896
Clivina macularis Putzeys, 1867
Clivina madiganensis Baehr, 2015
Clivina magnicollis Baehr, 2008
Clivina mahoni Baehr, 2017
Clivina major Sloane, 1917
Clivina mareebae Baehr, 2015
Clivina marginata (Putzeys, 1868)
Clivina marginicollis Putzeys, 1867
Clivina marlgu Baehr, 2015
Clivina mastersi Sloane, 1896
Clivina matarankae Baehr, 2015
Clivina matthewsi Baehr, 2015
Clivina mcquillani Baehr, 2015
Clivina media Putzeys, 1846
Clivina megalops Baehr, 2015
Clivina mekongensis Lesne, 1896
Clivina micans Baehr, 2017
Clivina mickoleiti Baehr, 2015
Clivina microps Baehr, 2015
Clivina minilyae Baehr, 2015
Clivina minuta Baehr, 2015
Clivina minutissima Baehr, 2015
Clivina mirrei Kult, 1959
Clivina misella Sloane, 1905
Clivina mjoebergi Baehr, 2008
Clivina mocquerysi Alluaud, 1935
Clivina moerens Putzeys, 1873
Clivina molucca Balkenohl, 2021
Clivina monilicornis Sloane, 1896
Clivina monteithi Baehr, 2015
Clivina monticola Andrewes, 1931
Clivina montisbelli Baehr, 2017
Clivina montisferrei Baehr, 2015
Clivina moreheadensis Baehr, 2015
Clivina moretona Baehr, 2017
Clivina morosa Baehr, 2008
Clivina muirellae Baehr, 2015
Clivina multispinosa Baehr, 2015
Clivina murgenellae Baehr, 2015
Clivina mustela Andrewes, 1923
Clivina myops Bousquet, 1997
Clivina nadineae Baehr, 2015
Clivina nana Sloane, 1896
Clivina napieria Baehr, 2015
Clivina netolitzkyi Kult, 1951
Clivina newcastleana Baehr, 2017
Clivina nicholsona Baehr, 2015
Clivina nigra Sloane, 1905
Clivina nigrosuturata Baehr, 2015
Clivina nitescens Baehr, 2017
Clivina nitidula Putzeys, 1867
Clivina normanbyensis Baehr, 2017
Clivina normandi Kult, 1959
Clivina normantona Baehr, 2015
Clivina nourlangie Baehr, 2015
Clivina nyctosyloides Putzeys, 1868
Clivina obliquata Putzeys, 1867
Clivina obliquicollis Sloane, 1905
Clivina oblita Putzeys, 1867
Clivina oblonga (Putzeys, 1873)
Clivina obscuripennis Putzeys, 1867
Clivina obscuripes Blackburn, 1890
Clivina obsoleta Sloane, 1896
Clivina occulta Sloane, 1896
Clivina odontomera Putzeys, 1868
Clivina okutanii Habu, 1958
Clivina olliffi Sloane, 1896
Clivina oodnadattae Blackburn, 1894
Clivina orbitalis Baehr, 2008
Clivina oregona Fall, 1922
Clivina ovalior Baehr, 2017
Clivina ovalipennis Sloane, 1905
Clivina pachysoma Baehr, 2017
Clivina pallida Say, 1823
Clivina pallidiceps Sloane, 1905
Clivina pampicola Putzeys, 1867
Clivina pandana Andrewes, 1938
Clivina paradebilis Baehr, 2008
Clivina parallela Lesne, 1896
Clivina parolliffi Baehr, 2015
Clivina parryensis Baehr, 2015
Clivina parryi Putzeys, 1861
Clivina parvidens Putzeys, 1867
Clivina parvula Putzeys, 1867
Clivina paucidentata Baehr, 2015
Clivina pectonada Sloane, 1905
Clivina pectoralis Putzeys, 1868
Clivina peninsulae Baehr, 2015
Clivina pentecostensis Baehr, 2015
Clivina perlonga Baehr, 2015
Clivina pernigra Baehr, 2015
Clivina perthensis Baehr, 1989
Clivina pfisteri Andrewes, 1930
Clivina picina Andrewes, 1936
Clivina pilbarae Baehr, 2015
Clivina pileolata Bates, 1892
Clivina planiceps Putzeys, 1861
Clivina planicollis LeConte, 1857
Clivina planifrons Sloane, 1907
Clivina planulata Putzeys, 1867
Clivina platensis Putzeys, 1867
Clivina platynota Baehr, 2017
Clivina pluridentata Putzeys, 1877
Clivina plurisetofaria Balkenohl, 2021
Clivina pravei Lutshnik, 1927
Clivina procera Putzeys, 1866
Clivina profundestriolata Baehr, 2017
Clivina pronotalis Baehr, 2015
Clivina protibialis Baehr, 2008
Clivina punctaticeps Putzeys, 1868
Clivina puncticeps Darlington, 1962
Clivina punctifrons Putzeys, 1867
Clivina punctigera LeConte, 1857
Clivina punctiventris Putzeys, 1867
Clivina punctulata LeConte, 1852
Clivina putzeysi Csiki, 1927
Clivina quadrata Putzeys, 1867
Clivina quadraticollis Baehr, 2015
Clivina quadratifrons Sloane, 1896
Clivina quadricornuta Baehr, 2015
Clivina quadristriata Baehr, 2008
Clivina queenslandica Sloane, 1896
Clivina quinquesetosa Baehr, 2015
Clivina rectipennis Baehr, 2017
Clivina recurvidens Putzeys, 1867
Clivina regularis Sloane, 1896
Clivina reticulata Baehr, 2015
Clivina riverinae Sloane, 1896
Clivina robusta Sloane, 1905
Clivina rokebyensis Baehr, 2015
Clivina roperensis Baehr, 2015
Clivina rubicunda LeConte, 1857
Clivina rubripes Putzeys, 1868
Clivina rubropicea Baehr, 2015
Clivina rufipennis Baehr, 2008
Clivina rufonigra Baehr, 1989
Clivina rufula Darlington, 1962
Clivina rugicollis Baehr, 2015
Clivina rugosepunctata Baehr, 2015
Clivina rugosifrons Baehr, 2017
Clivina rugosofemoralis Balkenohl, 1999
Clivina ryaceki Baehr, 2017
Clivina sabulosa W.S.MacLeay, 1825
Clivina sagittifera Baehr, 2015
Clivina sansapor Darlington, 1962
Clivina saundersi Andrewes, 1926
Clivina scabra Baehr, 2015
Clivina schaubergeri Kult, 1951
Clivina schillhammeri Balkenohl, 2021
Clivina sculpticeps Darlington, 1953
Clivina sectifrons Bates, 1892
Clivina sellata Putzeys, 1866
Clivina semicava Baehr, 2015
Clivina semirubra Baehr, 2017
Clivina shortlandica Emden, 1937
Clivina siamica Putzeys, 1867
Clivina sicula Baudi di Selve, 1864
Clivina simillima Baehr, 2015
Clivina simulans Sloane, 1896
Clivina sinuicola Baehr, 2017
Clivina sloanei Csiki, 1927
Clivina sodalis Baehr, 2015
Clivina soror Baehr, 2008
Clivina sororcula Baehr, 2015
Clivina spadix Andrewes, 1929
Clivina spatulata Baehr, 2015
Clivina spatulifera Andrewes, 1929
Clivina spinipes Putzeys, 1867
Clivina stefaniana G.Müller, 1942
Clivina sternalis Baehr, 2015
Clivina storeyi Baehr, 2015
Clivina stricta Putzeys, 1861
Clivina stygica Putzeys, 1867
Clivina subdepressa Kult, 1951
Clivina subfoveiceps Kult, 1959
Clivina subfusa Darlington, 1962
Clivina subrufipes Baehr, 2017
Clivina sulcaticeps Sloane, 1923
Clivina sulcicollis Sloane, 1896
Clivina suturalis Putzeys, 1861
Clivina svenssoni Basilewsky, 1946
Clivina synnotensis Baehr, 2015
Clivina synoikos Baehr, 2015
Clivina syriaca J.Sahlberg, 1908
Clivina szekessyi Kult, 1951
Clivina szitoi Baehr, 2008
Clivina talpa Andrewes, 1927
Clivina tanami Baehr, 2015
Clivina taurina Putzeys, 1867
Clivina tenuis Baehr, 2015
Clivina territorialis Baehr, 2008
Clivina thenmala Balkenohl, 2021
Clivina thoracica Baehr, 2017
Clivina toledanoi Baehr, 2015
Clivina toombae Baehr, 2015
Clivina torrida Putzeys, 1867
Clivina toxopei Darlington, 1962
Clivina tozeria Baehr, 2015
Clivina trachys Andrewes, 1930
Clivina transgrediens Baehr, 2015
Clivina transversa Putzeys, 1867
Clivina transversicollis Putzeys, 1867
Clivina trapezicollis Baehr, 2015
Clivina tribulationis Baehr, 2015
Clivina tridentata Putzeys, 1867
Clivina tripuncta Darlington, 1962
Clivina triseriata Baehr, 2017
Clivina tristis Putzeys, 1846
Clivina truncata Putzeys, 1877
Clivina tuberculata Putzeys, 1846
Clivina tuberculifrons Blackburn, 1890
Clivina ubirr Baehr, 2015
Clivina ulrichi Baehr, 2015
Clivina uluru Baehr, 2015
Clivina uncinata Baehr, 2017
Clivina uptoni Baehr, 2015
Clivina vagans Putzeys, 1866
Clivina validior Baehr, 2015
Clivina variabilis Baehr, 2015
Clivina variseta Baehr, 2017
Clivina ventripunctata Baehr, 2015
Clivina vicina Baehr, 2008
Clivina victoriae Baehr, 2017
Clivina vigil Darlington, 1962
Clivina vittata Sloane, 1896
Clivina vixsulcata Baehr, 2017
Clivina vulgivaga Boheman, 1858
Clivina wachteli Baehr, 2015
Clivina wallacei Putzeys, 1867
Clivina weanyanae Baehr, 2015
Clivina weipae Baehr, 2015
Clivina weiri Baehr, 2015
Clivina werrisensis Baehr, 2015
Clivina westralis Baehr, 2015
Clivina westwoodi Putzeys, 1867
Clivina wildi Blackburn, 1890
Clivina wiluna Darlington, 1953
Clivina windjanae Baehr, 2017
Clivina wurargae Baehr, 2008
Clivina yanoi Kult, 1951
Clivina ypsilon Dejean, 1830
Clivina zborowskii Baehr, 2015
Subgenus Cliviniella Kult, 1959
Clivina albertiana Burgeon, 1935
Clivina camerunensis Kult, 1959
Clivina ghesquierei Kult, 1959
Clivina veselyi Kult, 1959
Subgenus Dacca Putzeys, 1861
Clivina boreri Balkenohl, 2020
Clivina forcipata (Putzeys, 1861)
Clivina ursulae Balkenohl, 2020
Subgenus Eoclivina Kult, 1959
Clivina attenuata (Herbst, 1806)
Clivina bhamoensis Bates, 1892
Clivina burgeoni Kult, 1959
Clivina dumolinii Putzeys, 1846
Clivina machadoi Basilewsky, 1955
Clivina sagittaria Bates, 1892
Clivina striata Putzeys, 1846
Clivina sulcigera Putzeys, 1867
Subgenus Leucocara Bousquet, 2009
Clivina acuducta Haldeman, 1843
Clivina allaeri Kult, 1959
Clivina alluaudi Kult, 1947
Clivina americana Dejean, 1831
Clivina angolana Kult, 1959
Clivina antoinei Kult, 1959
Clivina aucta Erichson, 1843
Clivina baenningeri Kult, 1951
Clivina balfourbrownei Kult, 1951
Clivina bartolozzii Magrini & Bulirsch, 2021
Clivina basilewskyi Kult, 1959
Clivina birmanica Kult, 1951
Clivina caffra Putzeys, 1861
Clivina californica Van Dyke, 1925
Clivina capensis Kult, 1959
Clivina cardiothorax Baehr, 2008
Clivina championi Kult, 1951
Clivina clypealis Baehr, 2008
Clivina collarti Burgeon, 1935
Clivina consobrina Putzeys, 1867
Clivina coomani Kult, 1951
Clivina damarina Péringuey, 1896
Clivina decellei Basilewsky, 1968
Clivina dewaillyi Kult, 1959
Clivina donabaueri Dostal, 2012
Clivina erythropyga Putzeys, 1867
Clivina esulcata Baehr, 2008
Clivina femoralis Putzeys, 1846
Clivina fratercula Baehr, 2008
Clivina girardi Kult, 1959
Clivina heinemanni Kult, 1959
Clivina hoberlandti Kult, 1951
Clivina insignis Kult, 1959
Clivina interstitialis Kolbe, 1883
Clivina jeanneli Kult, 1959
Clivina katangana Kult, 1959
Clivina kawa Basilewsky, 1948
Clivina kirschenhoferi Dostal, 2012
Clivina kochi Schatzmayr, 1936
Clivina lacustris Putzeys, 1867
Clivina laevifrons Chaudoir, 1842
Clivina latior Baehr, 2008
Clivina lebisi Kult, 1959
Clivina legorskyi Dostal, 2012
Clivina madagascariensis Putzeys, 1846
Clivina makolskii Kult, 1959
Clivina martii Kult, 1959
Clivina martinbaehri Dostal & Bulirsch, 2016
Clivina maxima Kult, 1959
Clivina montei Kult, 1959
Clivina mordax Putzeys, 1861
Clivina morio Dejean, 1831
Clivina muelleri Kult, 1959
Clivina ngayensis Burgeon, 1935
Clivina niponensis Bates, 1873
Clivina obenbergeri Kult, 1951
Clivina opacidermis Baehr, 1989
Clivina orientalis Kult, 1959
Clivina pacholatkoi Dostal & Bulirsch, 2016
Clivina palmeni Kult, 1959
Clivina perplexa Péringuey, 1896
Clivina pfefferi Kult, 1951
Clivina rufa LeConte, 1857
Clivina rugiceps Klug, 1832
Clivina sacra Putzeys, 1875
Clivina saigonica Kult, 1951
Clivina sakalava Dostal, 2016
Clivina schatzmayri Kult, 1959
Clivina schuhi Dostal, 2016
Clivina semicarinata Putzeys, 1877
Clivina simplicifrons Fairmaire, 1901
Clivina sobrina Dejean, 1831
Clivina straneoi Kult, 1959
Clivina subterranea Decou; Nitzu & Juberthie, 1994
Clivina sudanensis Kult, 1959
Clivina tanganyikana Kult, 1959
Clivina tranquebarica Bonelli, 1813
Clivina tutancamon Schatzmayr, 1936
Clivina vosahloi Kult, 1959
Clivina yorkiana Baehr, 2008
Clivina zebi Kult, 1951
Subgenus Paraclivina Kult, 1947
Clivina bipustulata (Fabricius, 1798)
Clivina convexa LeConte, 1844
Clivina fasciata Putzeys, 1846
Clivina fassatii Kult, 1947
Clivina ferrea LeConte, 1857
Clivina floridae Csiki, 1927
Clivina marginipennis Putzeys, 1846
Clivina postica LeConte, 1846
Clivina stigmula Putzeys, 1846
Clivina striatopunctata Dejean, 1831
Clivina sulcipennis Putzeys, 1867
Subgenus Physoclivina Kult, 1959
Clivina bulirschi Dostal, 2015
Clivina donabaueriana Dostal, 2015
Clivina dostaliana Balkenohl, 2018
Clivina physopleura Burgeon, 1935
References
Clivina
|
```html
{{/* Hugo Blox: Hero */}}
{{/* Documentation: path_to_url */}}
{{/* Initialise */}}
{{ $page := .wcPage }}
{{ $block := .wcBlock }}
{{ $bg := $block.design.background }}
{{ if $block.content.image.filename }}
<div class="row">
<div class="col-12 col-md-6 text-center text-md-left">
{{ end }}
{{ with $block.content.title }}
<h1 class="hero-title">{{ . | markdownify }}</h1>
{{ end }}
{{ with $block.content.text }}
<div class="hero-lead">{{ . | $page.RenderString | emojify }}</div>
{{ end }}
{{/* Call-to-action link */}}
{{ if $block.content.cta.url }}
{{ $pack := or $block.content.cta.icon_pack "fas" }}
{{ $pack_prefix := $pack }}
{{ if in (slice "fab" "fas" "far" "fal") $pack }}
{{ $pack_prefix = "fa" }}
{{ end }}
{{ $link := $block.content.cta.url }}
{{ $scheme := (urls.Parse $link).Scheme }}
{{ $target := "" }}
{{ if not $scheme }}
{{ $link = $link | relLangURL }}
{{ else if in (slice "http" "https") $scheme }}
{{ $target = "target=\"_blank\" rel=\"noopener\"" }}
{{ end }}
<p class="cta-btns">
<a href="{{ $link | safeURL }}" {{ $target | safeHTMLAttr }} class="btn {{if $bg.text_color_light}}btn-light{{else}}btn-primary{{end}} btn-lg mb-md-1">{{ if $block.content.cta.icon }}<i class="{{ $pack }} {{ $pack_prefix }}-{{ $block.content.cta.icon }} pr-1" aria-hidden="true"></i>{{end}}{{ $block.content.cta.label | markdownify | emojify | safeHTML }}</a>
{{/* Alternative Call-to-action link */}}
{{ if $block.content.cta_alt.url }}
{{ $link := $block.content.cta_alt.url }}
{{ $scheme := (urls.Parse $link).Scheme }}
{{ $target := "" }}
{{ if not $scheme }}
{{ $link = $link | relLangURL }}
{{ else if in (slice "http" "https") $scheme }}
{{ $target = "target=\"_blank\" rel=\"noopener\"" }}
{{ end }}
<a href="{{ $link | safeURL }}" {{ $target | safeHTMLAttr }} class="hero-cta-alt btn-lg pl-md-4">{{ $block.content.cta_alt.label | markdownify | emojify | safeHTML }} <i class="fas fa-angle-right"></i></a>
{{ end }}
</p>
{{ end }}
{{/* Call-to-action note */}}
{{ with $block.content.cta_note }}
<p class="hero-note text-muted mb-3 mb-md-1">
{{ .label | markdownify | emojify | safeHTML }}
</p>
{{ end }}
{{/* Hero image */}}
{{ if $block.content.image.filename }}
</div>
<div class="col-12 mx-auto col-md-6 {{if $block.content.design.flip}}order-md-first{{end}} hero-media">
{{- $image := resources.Get (path.Join "media" $block.content.image.filename) -}}
{{ if $image }}
{{ $isSVG := eq $image.MediaType.SubType "svg" }}
{{ if $isSVG -}}
<img src="{{ $image.RelPermalink }}" alt="{{ $block.Title }}">
{{- else }}
{{ $legacy_img := $image.Resize "400x" }}
{{ $img_src := "" }}
{{ $img_src_set := slice }}
{{ $widths := slice 1200 800 400 }}
{{ range $widths }}
{{ $src_link := ($image.Resize (printf "%dx" .)).RelPermalink }}
{{ if eq $img_src "" }}
{{ $img_src = $src_link }}
{{ end }}
{{ $img_src_set = $img_src_set | append (printf "%s %dw" $src_link .) }}
{{ end }}
{{ $img_src_set = delimit $img_src_set "," }}
<img src="{{ $legacy_img.RelPermalink }}" srcset="{{ $img_src_set }}" width="{{ $image.Width }}" height="{{ $image.Height }}" alt="{{ $block.Title }}">
{{ end }}
{{ end }}
</div>
</div>
{{ end }}
```
|
The Residential Palace Darmstadt (German: Residenzschloss Darmstadt, often also called Stadtschloss) is the former residence and administrative seat of the landgraves of Hesse-Darmstadt and from 1806 to 1919 of the Grand Dukes of Hesse-Darmstadt. It is located in the centre of the city of Darmstadt. The palace consists of an older Renaissance part and an 18th century Baroque part.
, the castle is the seat of the Technische Universität Darmstadt and the German-Polish Institute.
History
Middle Ages
The origins of the castle lie in the Katzenelnbogen time. In the middle of the 13th century the counts of Katzenelnbogen built a moated castle in Darmstadt. In 1330 Darmstadt received town rights, one year later the castle is mentioned for the first time in a document. From 1386, the moated castle lost importance and became a widow's residence and secondary residence. In the following two centuries, the counts of Katzenelnbogen extended and rebuilt the castle again and again. Until the middle of the 15th century the castle was transformed into a representative castle and Darmstadt became Katzenelnbogen's second residence. What remains of the moated castle are the form of the central church courtyard and the outer walls of the manor house. When the last count von Katzenelnbogen died in 1479, Darmstadt fell to Henry III, Landgrave of Upper Hesse. When Philip I took over the government offices in 1518, the castle was destroyed for the first time in an attack by Franz von Sickingen. The castle was rebuilt in the following years, but with essentially the same defensive structures. During the Schmalkaldic War in 1546 it was destroyed again by imperial troops.
Renaissance era
Landgrave George I considerably extended the castle from 1567 to a Renaissance complex and secured it with moats and bastions. The half-timbered floors of the former palace and the hall are rebuilt from stone. The buildings received new roofs. Christoph Müller and Jakob Wustmann developed the old moated castle into a residential palace. After 1589 the office, the stables and the arsenal were built, which no longer exist today. From 1594, the landgrave had orphans educated in the castle. From 1595 to 1597 the Kaisersaal (Emperor's room) and the church were built. The tympanum corridor (), which connects the manor with the church, was also built.
The Wallhäuschen, a gate building in the north of the castle, was built in 1627 by Jakob Müller. The bell building was built from 1663 to 1671 according to plans by the architect Johann Wilhelm Pfannmüller. The bells were delivered by Piter Hemony. Darmstadt was attacked by the French in 1693 and the castle burned down.
Baroque era
Landgrave Ernst Ludwig commissioned the French architect Louis Remy de la Fosse to plan a new baroque palace with four large wings in 1715, after the palace's chancellery had burned down. This was to completely replace the old palace. Due to lack of money, however, only two wings were completed by 1726. These were to remain the last major structural changes to the castle. When Hessen-Darmstadt joined the Confederation of the Rhine in 1806, the castle became the seat of the Grand Dukes of Darmstadt. At the beginning of the 19th century, the upper floors of the new castle were furnished and fitted with window glazing. In 1842, the university and state library and the grand ducal collection with natural history cabinet moved in. Since the 18th century the castle has been less and less inhabited by the grand dukes and other members of the ruling family who settled in more comfortable premises, most of which were destroyed in World War II. These included the and on , the and to the south, the to the north, and the near the family's burial grounds in to the east. Meanwhile, more and more institutions were admitted in the vacant old residential palace and some of the rooms were reserved for state guests.
20th century
In 1893, under Ernst Ludwig, Grand Duke of Hesse and by Rhine, structural measures were again being taken. Thus the extension with a tea pavilion was built on the Herrenbau. In 1924, the castle museum moved into the old area of the castle.
After the World War I, the castle passed into the possession of the People's State of Hesse. On the night of the fire in Darmstadt from 11 to 12 September 1944, the castle burned down to the outer walls. Reconstruction began in 1946 and was not completed until the early 1970s. An overall repair was carried out in 2008, which is planned to last for a longer period of time. The bell construction was completed in 2016. The outer appearance was almost completely restored. , the castle is the seat of the Technische Universität Darmstadt and the .
Construction
The castle is divided into three areas: the outer fortification including , the Renaissance castle and the Baroque castle (De-la-Fosse-Bau).
The north is occupied by a park that belongs to the old fortification. In its place was once the deep moat that completely surrounded the castle.
The centerpiece of the Residential Palace Darmstadt is the old Renaissance palace. It still has the almost triangular shape of the old core castle and consists of the castle wings Herrenbau, Weißer Saalbau, Kaisersaalbau, Kirchenbau and the church courtyard. In the southeast is the bell building.
The Baroque part of the castle (De-la-Fosse-Bau or ) consists of a three-storey southern and west wing on an angular floor plan. From the town, a fortified gate leads directly through the baroque castle into the southern courtyard.
The usable area is , owner is the Technische Universität Darmstadt.
Buildings
Wallhaus (wall building)
Brückenhaus (bridge building)
Herrenbau, German-Polish Institute (manor)
Weißer Saalbau, Schlosskeller, Department of History and Social Sciences (white hall)
Kaisersaalbau (emperor's hall)
Kirchenbau, Orgelsaal, Schlossmuseum (church building, organ hall, palace museum)
Glockenbau with Glockenspiel, Schlossmuseum (bell building with carillon, palace museum)
Prinz-Christian-Bau (Prince Christian building)
De-la-Fosse-Bau, Library Department of History and Social Sciences, Executive Board of TU Darmstadt (Baroque castle)
Courtyards
Kirchenhof (church yard)
Glockenhof (bell yard)
Parforcehof
Corridors
Paukergang
Bridges
Wallbrücke (wall bridge, north entrance)
Marktbrücke (south main entrance)
Parforce-Brücke (west entrance)
Outer fortifications
(castle moat)
Source:
Location
The castle is located in the centre of Darmstadt. Nearby are the (market square) and (town hall) in the South. The Hessisches Landesmuseum Darmstadt by Alfred Messel, the neoclassical former court theatre (House of History) by Georg Moller, the square are situated in the North. The square and street are located in the West.
Gallery
Schlossmuseum
The palace museum shows objects belonging to the former landgraves and Grand Dukes of Hesse-Darmstadt. Opened in 1924, the museum is located in the bell and church building of the residential palace.
Schlosskeller
The is an event location and a club in the basement of the castle. Since 1966, the club has been run by students.
Music festival Schlossgrabenfest
Since 1999 the , the largest music festival in Hesse and one of the largest open-air events in Germany, has taken place every year on the last weekend of May around the Residential Palace Darmstadt and Friedens- und Karolinenplatz in Darmstadt. The musical spectrum ranges from rock, pop, electro, reggae and hip-hop to soul and jazz.
Royal Ghost Story
According to several witnesses, including Frederica of Mecklenburg-Strelitz, Duchess of Cumberland and later Queen of Hanover, the ghost of the old Duchess of Darmstadt was seen in one of the rooms of the palace.
See also
List of castles in Hesse
References
Further reading
Renaissance architecture in Germany
Baroque architecture in Hesse
Baroque palaces in Germany
Residential buildings completed in 1726
Technische Universität Darmstadt
Buildings and structures in Darmstadt
Royal residences in Hesse
Castles in Hesse
Palaces in Hesse
Buildings and structures in Germany destroyed during World War II
|
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# ==============================================================================
"""`Exporter` class represents different flavors of model export."""
from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
import abc
import os
from tensorflow.python.estimator import gc
from tensorflow.python.framework import errors_impl
from tensorflow.python.platform import gfile
from tensorflow.python.platform import tf_logging
class Exporter(object):
"""A class representing a type of model export."""
@abc.abstractproperty
def name(self):
"""Directory name.
A directory name under the export base directory where exports of
this type are written. Should not be `None` nor empty.
"""
pass
@abc.abstractmethod
def export(self, estimator, export_path, checkpoint_path, eval_result,
is_the_final_export):
"""Exports the given `Estimator` to a specific format.
Args:
estimator: the `Estimator` to export.
export_path: A string containing a directory where to write the export.
checkpoint_path: The checkpoint path to export.
eval_result: The output of `Estimator.evaluate` on this checkpoint.
is_the_final_export: This boolean is True when this is an export in the
end of training. It is False for the intermediate exports during
the training.
When passing `Exporter` to `tf.estimator.train_and_evaluate`
`is_the_final_export` is always False if `TrainSpec.max_steps` is
`None`.
Returns:
The string path to the exported directory or `None` if export is skipped.
"""
pass
class _SavedModelExporter(Exporter):
"""This class exports the serving graph and checkpoints.
This class provides a basic exporting functionality and serves as a
foundation for specialized `Exporter`s.
"""
def __init__(self,
name,
serving_input_receiver_fn,
assets_extra=None,
as_text=False):
"""Create an `Exporter` to use with `tf.estimator.EvalSpec`.
Args:
name: unique name of this `Exporter` that is going to be used in the
export path.
serving_input_receiver_fn: a function that takes no arguments and returns
a `ServingInputReceiver`.
assets_extra: An optional dict specifying how to populate the assets.extra
directory within the exported SavedModel. Each key should give the
destination path (including the filename) relative to the assets.extra
directory. The corresponding value gives the full path of the source
file to be copied. For example, the simple case of copying a single
file without renaming it is specified as
`{'my_asset_file.txt': '/path/to/my_asset_file.txt'}`.
as_text: whether to write the SavedModel proto in text format. Defaults to
`False`.
Raises:
ValueError: if any arguments is invalid.
"""
self._name = name
self._serving_input_receiver_fn = serving_input_receiver_fn
self._assets_extra = assets_extra
self._as_text = as_text
@property
def name(self):
return self._name
def export(self, estimator, export_path, checkpoint_path, eval_result,
is_the_final_export):
del is_the_final_export
export_result = estimator.export_savedmodel(
export_path,
self._serving_input_receiver_fn,
assets_extra=self._assets_extra,
as_text=self._as_text,
checkpoint_path=checkpoint_path)
return export_result
class FinalExporter(Exporter):
"""This class exports the serving graph and checkpoints in the end.
This class performs a single export in the end of training.
"""
def __init__(self,
name,
serving_input_receiver_fn,
assets_extra=None,
as_text=False):
"""Create an `Exporter` to use with `tf.estimator.EvalSpec`.
Args:
name: unique name of this `Exporter` that is going to be used in the
export path.
serving_input_receiver_fn: a function that takes no arguments and returns
a `ServingInputReceiver`.
assets_extra: An optional dict specifying how to populate the assets.extra
directory within the exported SavedModel. Each key should give the
destination path (including the filename) relative to the assets.extra
directory. The corresponding value gives the full path of the source
file to be copied. For example, the simple case of copying a single
file without renaming it is specified as
`{'my_asset_file.txt': '/path/to/my_asset_file.txt'}`.
as_text: whether to write the SavedModel proto in text format. Defaults to
`False`.
Raises:
ValueError: if any arguments is invalid.
"""
self._saved_model_exporter = _SavedModelExporter(name,
serving_input_receiver_fn,
assets_extra, as_text)
@property
def name(self):
return self._saved_model_exporter.name
def export(self, estimator, export_path, checkpoint_path, eval_result,
is_the_final_export):
if not is_the_final_export:
return None
tf_logging.info('Performing the final export in the end of training.')
return self._saved_model_exporter.export(estimator, export_path,
checkpoint_path, eval_result,
is_the_final_export)
class LatestExporter(Exporter):
"""This class regularly exports the serving graph and checkpoints.
In addition to exporting, this class also garbage collects stale exports.
"""
def __init__(self,
name,
serving_input_receiver_fn,
assets_extra=None,
as_text=False,
exports_to_keep=5):
"""Create an `Exporter` to use with `tf.estimator.EvalSpec`.
Args:
name: unique name of this `Exporter` that is going to be used in the
export path.
serving_input_receiver_fn: a function that takes no arguments and returns
a `ServingInputReceiver`.
assets_extra: An optional dict specifying how to populate the assets.extra
directory within the exported SavedModel. Each key should give the
destination path (including the filename) relative to the assets.extra
directory. The corresponding value gives the full path of the source
file to be copied. For example, the simple case of copying a single
file without renaming it is specified as
`{'my_asset_file.txt': '/path/to/my_asset_file.txt'}`.
as_text: whether to write the SavedModel proto in text format. Defaults to
`False`.
exports_to_keep: Number of exports to keep. Older exports will be
garbage-collected. Defaults to 5. Set to `None` to disable garbage
collection.
Raises:
ValueError: if any arguments is invalid.
"""
self._saved_model_exporter = _SavedModelExporter(name,
serving_input_receiver_fn,
assets_extra, as_text)
self._exports_to_keep = exports_to_keep
if exports_to_keep is not None and exports_to_keep <= 0:
raise ValueError(
'`exports_to_keep`, if provided, must be positive number')
@property
def name(self):
return self._saved_model_exporter.name
def export(self, estimator, export_path, checkpoint_path, eval_result,
is_the_final_export):
export_result = self._saved_model_exporter.export(
estimator, export_path, checkpoint_path, eval_result,
is_the_final_export)
self._garbage_collect_exports(export_path)
return export_result
def _garbage_collect_exports(self, export_dir_base):
"""Deletes older exports, retaining only a given number of the most recent.
Export subdirectories are assumed to be named with monotonically increasing
integers; the most recent are taken to be those with the largest values.
Args:
export_dir_base: the base directory under which each export is in a
versioned subdirectory.
"""
if self._exports_to_keep is None:
return
def _export_version_parser(path):
# create a simple parser that pulls the export_version from the directory.
filename = os.path.basename(path.path)
if not (len(filename) == 10 and filename.isdigit()):
return None
return path._replace(export_version=int(filename))
# pylint: disable=protected-access
keep_filter = gc._largest_export_versions(self._exports_to_keep)
delete_filter = gc._negation(keep_filter)
for p in delete_filter(
gc._get_paths(export_dir_base, parser=_export_version_parser)):
try:
gfile.DeleteRecursively(p.path)
except errors_impl.NotFoundError as e:
tf_logging.warn('Can not delete %s recursively: %s', p.path, e)
# pylint: enable=protected-access
```
|
```python
from diagrams import Cluster, Diagram
from diagrams.aws.compute import ECS, EKS, Lambda
from diagrams.aws.database import Redshift
from diagrams.aws.integration import SQS
from diagrams.aws.storage import S3
with Diagram("Event Processing", show=False):
source = EKS("k8s source")
with Cluster("Event Flows"):
with Cluster("Event Workers"):
workers = [ECS("worker1"),
ECS("worker2"),
ECS("worker3")]
queue = SQS("event queue")
with Cluster("Processing"):
handlers = [Lambda("proc1"),
Lambda("proc2"),
Lambda("proc3")]
store = S3("events store")
dw = Redshift("analytics")
source >> workers >> queue >> handlers
handlers >> store
handlers >> dw
```
|
In probability theory and statistics, subindependence is a weak form of independence.
Two random variables X and Y are said to be subindependent if the characteristic function of their sum is equal to the product of their marginal characteristic functions. Symbolically:
This is a weakening of the concept of independence of random variables, i.e. if two random variables are independent then they are subindependent, but not conversely. If two random variables are subindependent, and if their covariance exists, then they are uncorrelated.
Subindependence has some peculiar properties: for example, there exist random variables X and Y that are subindependent, but X and αY are not subindependent when α ≠ 1 and therefore X and Y are not independent.
One instance of subindependence is when a random variable X is Cauchy with location 0 and scale s and another random variable Y=X, the antithesis of independence. Then X+Y is also Cauchy but with scale 2s. The characteristic function of either X or Y in t is then exp(-s·|t|), and the characteristic function of X+Y is exp(-2s·|t|)=exp(-s·|t|)2.
Notes
References
Further reading
Independence (probability theory)
|
1965 in the Philippines details events of note that happened in the Philippines in 1965.
Incumbents
President:
Diosdado Macapagal (Liberal) (until December 30)
Ferdinand Marcos (Nacionalista Party) (starting December 30)
Vice President:
Emmanuel Pelaez (Liberal) (until December 30)
Fernando Lopez (Nacionalista Party) (starting December 30)
Chief Justice: César Bengzon
Congress: 5th (until December 17)
Events
June
June 19 – The provinces of Eastern Samar, Northern Samar and Western Samar are created after approval of Republic Act 4221.
September
September 28 – Taal Volcano erupts killing hundreds.
November
November 9 – Ferdinand Marcos is elected president during the presidential elections.
December
December 30 – Ferdinand Marcos takes his oath of office.
Holidays
As per Act No. 2711 section 29, issued on March 10, 1917, any legal holiday of fixed date falls on Sunday, the next succeeding day shall be observed as legal holiday. Sundays are also considered legal religious holidays. Bonifacio Day was added through Philippine Legislature Act No. 2946. It was signed by then-Governor General Francis Burton Harrison in 1921. On October 28, 1931, the Act No. 3827 was approved declaring the last Sunday of August as National Heroes Day. As per Republic Act No. 3022, April 9th is proclaimed as Bataan Day. Independence Day was changed from July 4 (Philippine Republic Day) to June 12 (Philippine Independence Day) on August 4, 1964.
January 1 – New Year's Day
February 22 – Legal Holiday
April 9 – Bataan Day
April 15 – Maundy Thursday
April 16 – Good Friday
May 1 – Labor Day
June 12 – Independence Day
July 4 – Philippine Republic Day
August 13 – Legal Holiday
August 29 – National Heroes Day
November 22 – Thanksgiving Day
November 30 – Bonifacio Day
December 25 – Christmas Day
December 30 – Rizal Day
Births
February 20 – Nilo Divina, lawyer
February 22 – Wilfredo Alicdan, artist
February 25 – Maricel Soriano, actress
May 6 – Honey Lacuna, politician
May 11 – Monsour del Rosario, Olympic athlete and actor
June 10 – Joey Santiago, guitarist and composer.
June 21 – Marlon Maro, football player and coach
November 2:
Arnold Clavio, journalist and radio anchor
Susan Yap, politician
November 10 – Arthur C. Yap, politician.
December 27 – Luchi Cruz-Valdes, broadcast journalist
Deaths
February 9 – Joaquín Miguel Elizalde, Filipino diplomat and businessman (b.1896)
March 22 – Daniel Z. Romualdez, Filipino politician (b. 1907)
May 14 – Francisco Alonso Liongson, Filipino writer and lawyer (b. 1896)
May 16 – Pablo Angeles y David, Filipino magistrate and statesman. (b. 1889)
September 20 – Cipriano Primicias, Sr., Filipino politician (b. 1901)
References
|
Webstock is a web technology conference held in Wellington, New Zealand featuring a range of high-profile speakers covering a variety of web-related topics such as accessibility, usability, ethnographic design and development practices.
Webstock began in 2005 and was created by a small non-profit group (consisting of Mike Brown, Natasha Lampard (formerly Hall), Debbie Sidelinger and Ben Lampard).
Webstock 2006
Speakers at the first four-day Webstock in 2006 included Dori Smith, Roger Hudson, Russ Weakley, Rachel McAlpine, Douglas Bowman, Heather Hesketh, Russell Brown (PublicAddress), Tony Chor (Microsoft), Darren Fittler, Kelly Goto, Ben Goodger (Firefox / Google), Rowan Simpson (Trade Me), Donna Maurer, Joel Spolsky, Kathy Sierra, Andreas Girardet (creator of Yoper) and Steve Champeon.
Webstock 2008
The second Webstock ran from 10–15 February 2008, with speakers including Shawn Henry (W3C), Simon Willison (Django), Scott Berkun, Amy Hoy, Peter Morville, Nat Torkington, Dan Cederholm, Kelly Goto, Michael Lopp, Cal Henderson, Jill Whalen, Russell Brown, Jason Santa Maria, Rachel McAlpine, Sam Morgan (Trade Me), Tom Coates (Yahoo!), Liz Danzico, Damian Conway (Perl), Luke Wroblewski and Kathy Sierra.
Webstock 2009
The third Webstock ran from 16–20 February 2009, featuring: Jane McGonigal, Nat Torkington, Derek Powazek, Meg Pickard (Guardian Unlimited, Matt Jones and Matt Biddulph of Dopplr, Fiona Romeo, David Recordon (key contributor to OpenID and then Open Platforms Tech Lead for Six Apart), Cameron Adams, Pamela Fox, Adrian Holovaty, Heather Champ (Flickr), Michael Lopp. Ze Frank, Russell Brown, Derek Featherstone, Annalee Newitz, Joshua Porter, Toby Segaran, Jasmina Tesanovic, Russ Weakley, Ben Goodger, Tom Coates (Yahoo!), Bruce Sterling, and Damian Conway.
Webstock 2010
The fourth Webstock ran from 15–19 February 2010, featuring: Jeff Atwood, Shelley Bernstein, Daniel Burka, Ben Cerveny, Sebastian Chan, Mike Davidson, Regine DeBatty, Esther Derby, Brian Fling, Thomas Fuchs, Adam Greenfield, Lachlan Hardy, Lisa Herrod, Bek Hodgson, Amy Hoy, Mark Pesce, John Resig, Eric Ries, Rives (poet), Kevin Rose, Toby Segaran, Chris Shiflett, Scott Thomas and Jeffrey Veen.
Webstock 2011
The fifth Webstock ran from 14–18 February 2011.
Day 1 (Thursday 17 February)
Speakers:
Frank Chimero - The Digital Campfire
Michael Koziarski - That's all well and good, but how does it help me?
Christine Perfetti - Adventurous Usability Techniques: Novel Approaches for the Seasoned Pro
David Recordon - HTML5 at Facebook
Mark Pilgrim - The Future of the Web: where are we going and why am I in this handbasket?
Jason Webley - Portrait of an Artist as an Independent Musician
Nicole Sullivan - CSS Tools for Massive Websites
Jason Santa Maria - On Web Typography
Steve Souders - Web Performance Optimisation: The Gift that Keeps on Giving
Kristina Halvorson - Content/Communication
John Gruber - The Gap Theory of UI Design
Doug Bowman - Delivering Delight
Amanda Palmer talks new music paradigm, blogging, Twitter and life
Day 2 (Friday 18 February)
Speakers:
Marco Arment - Contrary to popular beliefs
David McCandless - Information is Beautiful
Glenda Sims - Practical Accessibility Testing
Josh Clark - Buttons Are a Hack: The New Rules of Designing for Touch
Jason Cohen - A Geek Sifts Through the Bullshit
Peter Sunde - The Pirate Bay of Penzance
Michael Lopp - An Engineering Mindset
Tom Coates - Everything the Network Touches
Scott McCloud - Comics: A Medium in Transition
Merlin Mann - Mime The Gap
Webstock 2012
The sixth Webstock ran from 13–17 February 2012 and was attended by over 800 delegates.
Day 1 (Thursday 16 February)
Speakers:
Kathy Sierra - MBU: Building the Minimum Badass User
Jeremy Keith - Of Time and the Network
danah boyd - Culture of Fear + Attention Economy = ?!?!
Dana Chisnell - Deconstructing Delight: Pleasure, Flow, and Meaning
Estelle Weyl - Mobile: Don't Break the Web
Erin Kissane - Little Big Systems
Ethan Marcotte - The Responsive Web Designer
Nick Mihailovski - Acting on data
Jennifer Brook - Within Reach: Publishing for the iPad
Matt Haughey - Lessons from a 40-year-old
Lauren Beukes - Kinking Reality
Amy Hoy - Change the game
Matthew Inman - How to get a buttcrapload of people to read what you write
Day 2 (Friday 17 February)
Speakers:
Jared Spool - The Anatomy of a Design Decision
Gabriella Coleman - In Lulz We Trust
Scott Hanselman - It’s not what you read, it’s what you ignore
Wilson Miner - When we build
Raffi Krikorian - 3 things that turn out to matter (listed as "Pressure, defense, and responses")
Rob Malda - Slashdot — the rise and fall
Jessica Hische - Typography through song: an historical and epistemological journey
Adam Lisagor - Lonely Pan Flute
Michael B Johnson Making Movies is Harder than it Looks: Building Tools for Telling Stories
Jenn Lim and Tony Hsieh - Delivering Happiness
Derek Handley - Doing Good and Well
Webstock 2015
Webstock 2016
Webstock 2017
Webstock 2017 ran from 13 to 17 February 2017, with masterclasses on the first two days and the conference proper on the last two days. Scheduled speakers were Lindsay Aitchison; Genevieve Bell; Jonathon Colman; Anil Dash; Katie Dill; Janine Gianfredi; Kim Goodwin; Jeff Gothelf; Cal Henderson; Lara Hogan; Indy Johar; Sacha Judd; Tim Kadlec; Darius Kazemi; Patricia Moore; Ashley Nelson-Hornstein; Stefan Sagmeister; Jared Spool; Lisa Welchman; and Marcin Wichary.
Webstock Mini
In between the major conferences, the group runs one day and evening events regularly throughout the year, featuring both New Zealand and International speakers.
References
External links
Webstock
Web-related conferences
|
```rust
fn main() {
println!("Hello, world!");
}
```
|
Pratylenchus hexincisus is a plant pathogenic nematode infecting sunflowers.
References
hexincisus
Plant pathogenic nematodes
Sunflower diseases
|
```java
package com.ctrip.xpipe.redis.console.healthcheck.fulllink.model;
import com.ctrip.xpipe.redis.core.protocal.MASTER_STATE;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.concurrent.ConcurrentHashMap;
public class KeeperStateModel {
private String host;
private int port;
private MASTER_STATE role;
private String state;
private String masterHost;
private int masterPort;
private long masterReplOffset;
private long replBacklogSize;
private List<KeeperSlaveModel> slaves;
private Long replId;
private Map<String, Throwable> errs = new ConcurrentHashMap<>();
public KeeperStateModel() {
}
public String getHost() {
return host;
}
public KeeperStateModel setHost(String host) {
this.host = host;
return this;
}
public int getPort() {
return port;
}
public KeeperStateModel setPort(int port) {
this.port = port;
return this;
}
public MASTER_STATE getRole() {
return role;
}
public KeeperStateModel setRole(MASTER_STATE role) {
this.role = role;
return this;
}
public String getState() {
return state;
}
public KeeperStateModel setState(String state) {
this.state = state;
return this;
}
public String getMasterHost() {
return masterHost;
}
public KeeperStateModel setMasterHost(String masterHost) {
this.masterHost = masterHost;
return this;
}
public int getMasterPort() {
return masterPort;
}
public KeeperStateModel setMasterPort(int masterPort) {
this.masterPort = masterPort;
return this;
}
public long getMasterReplOffset() {
return masterReplOffset;
}
public KeeperStateModel setMasterReplOffset(long masterReplOffset) {
this.masterReplOffset = masterReplOffset;
return this;
}
public long getReplBacklogSize() {
return replBacklogSize;
}
public KeeperStateModel setReplBacklogSize(long replBacklogSize) {
this.replBacklogSize = replBacklogSize;
return this;
}
public List<KeeperSlaveModel> getSlaves() {
return slaves;
}
public void setSlaves(List<KeeperSlaveModel> slaves) {
this.slaves = slaves;
}
public KeeperStateModel setSlavesMap(List<Map<String, String>> slaves) {
this.slaves = new ArrayList<>();
for (Map<String, String> slave : slaves) {
this.slaves.add(new KeeperSlaveModel(slave));
}
return this;
}
public Long getReplId() {
return replId;
}
public KeeperStateModel setReplId(Long replId) {
this.replId = replId;
return this;
}
public Map<String, Throwable> getErrs() {
return errs;
}
public void setErrs(Map<String, Throwable> errs) {
this.errs = errs;
}
public synchronized void addErr(String msg, Throwable err) {
errs.put(msg, err);
}
}
```
|
```go
//go:build solaris
// +build solaris
package fsnotify
import (
"errors"
)
// Watcher watches a set of paths, delivering events on a channel.
//
// A watcher should not be copied (e.g. pass it by pointer, rather than by
// value).
//
// # Linux notes
//
// When a file is removed a Remove event won't be emitted until all file
// descriptors are closed, and deletes will always emit a Chmod. For example:
//
// fp := os.Open("file")
// os.Remove("file") // Triggers Chmod
// fp.Close() // Triggers Remove
//
// This is the event that inotify sends, so not much can be changed about this.
//
// The fs.inotify.max_user_watches sysctl variable specifies the upper limit
// for the number of watches per user, and fs.inotify.max_user_instances
// specifies the maximum number of inotify instances per user. Every Watcher you
// create is an "instance", and every path you add is a "watch".
//
// These are also exposed in /proc as /proc/sys/fs/inotify/max_user_watches and
// /proc/sys/fs/inotify/max_user_instances
//
// To increase them you can use sysctl or write the value to the /proc file:
//
// # Default values on Linux 5.18
// sysctl fs.inotify.max_user_watches=124983
// sysctl fs.inotify.max_user_instances=128
//
// To make the changes persist on reboot edit /etc/sysctl.conf or
// /usr/lib/sysctl.d/50-default.conf (details differ per Linux distro; check
// your distro's documentation):
//
// fs.inotify.max_user_watches=124983
// fs.inotify.max_user_instances=128
//
// Reaching the limit will result in a "no space left on device" or "too many open
// files" error.
//
// # kqueue notes (macOS, BSD)
//
// kqueue requires opening a file descriptor for every file that's being watched;
// so if you're watching a directory with five files then that's six file
// descriptors. You will run in to your system's "max open files" limit faster on
// these platforms.
//
// The sysctl variables kern.maxfiles and kern.maxfilesperproc can be used to
// control the maximum number of open files, as well as /etc/login.conf on BSD
// systems.
//
// # macOS notes
//
// Spotlight indexing on macOS can result in multiple events (see [#15]). A
// temporary workaround is to add your folder(s) to the "Spotlight Privacy
// Settings" until we have a native FSEvents implementation (see [#11]).
//
// [#11]: path_to_url
// [#15]: path_to_url
type Watcher struct {
// Events sends the filesystem change events.
//
// fsnotify can send the following events; a "path" here can refer to a
// file, directory, symbolic link, or special file like a FIFO.
//
// fsnotify.Create A new path was created; this may be followed by one
// or more Write events if data also gets written to a
// file.
//
// fsnotify.Remove A path was removed.
//
// fsnotify.Rename A path was renamed. A rename is always sent with the
// old path as Event.Name, and a Create event will be
// sent with the new name. Renames are only sent for
// paths that are currently watched; e.g. moving an
// unmonitored file into a monitored directory will
// show up as just a Create. Similarly, renaming a file
// to outside a monitored directory will show up as
// only a Rename.
//
// fsnotify.Write A file or named pipe was written to. A Truncate will
// also trigger a Write. A single "write action"
// initiated by the user may show up as one or multiple
// writes, depending on when the system syncs things to
// disk. For example when compiling a large Go program
// you may get hundreds of Write events, so you
// probably want to wait until you've stopped receiving
// them (see the dedup example in cmd/fsnotify).
//
// fsnotify.Chmod Attributes were changed. On Linux this is also sent
// when a file is removed (or more accurately, when a
// link to an inode is removed). On kqueue it's sent
// and on kqueue when a file is truncated. On Windows
// it's never sent.
Events chan Event
// Errors sends any errors.
Errors chan error
}
// NewWatcher creates a new Watcher.
func NewWatcher() (*Watcher, error) {
return nil, errors.New("FEN based watcher not yet supported for fsnotify\n")
}
// Close removes all watches and closes the events channel.
func (w *Watcher) Close() error {
return nil
}
// Add starts monitoring the path for changes.
//
// A path can only be watched once; attempting to watch it more than once will
// return an error. Paths that do not yet exist on the filesystem cannot be
// added. A watch will be automatically removed if the path is deleted.
//
// A path will remain watched if it gets renamed to somewhere else on the same
// filesystem, but the monitor will get removed if the path gets deleted and
// re-created, or if it's moved to a different filesystem.
//
// Notifications on network filesystems (NFS, SMB, FUSE, etc.) or special
// filesystems (/proc, /sys, etc.) generally don't work.
//
// # Watching directories
//
// All files in a directory are monitored, including new files that are created
// after the watcher is started. Subdirectories are not watched (i.e. it's
// non-recursive).
//
// # Watching files
//
// Watching individual files (rather than directories) is generally not
// recommended as many tools update files atomically. Instead of "just" writing
// to the file a temporary file will be written to first, and if successful the
// temporary file is moved to to destination removing the original, or some
// variant thereof. The watcher on the original file is now lost, as it no
// longer exists.
//
// Instead, watch the parent directory and use Event.Name to filter out files
// you're not interested in. There is an example of this in [cmd/fsnotify/file.go].
func (w *Watcher) Add(name string) error {
return nil
}
// Remove stops monitoring the path for changes.
//
// Directories are always removed non-recursively. For example, if you added
// /tmp/dir and /tmp/dir/subdir then you will need to remove both.
//
// Removing a path that has not yet been added returns [ErrNonExistentWatch].
func (w *Watcher) Remove(name string) error {
return nil
}
```
|
```yaml
---
enhancements:
- |
Supports Podman newer versions (4.8+) using SQLite instead of BoltDB for the containers database backend.
Setting ``podman_db_path`` to the path with the ``db.sql`` file (e.g. ``/var/lib/containers/storage/db.sql``) will make the Datadog Agent use the SQLite format.
**Note**: If ``podman_db_path`` is not set (default), the Datadog Agent attempts to use the default file ``libpod/bolt_state.db`` and ``db.sql`` from ``/var/lib/containers/storage``.
```
|
```php
<?php
/**
* The template for displaying all single posts and attachments
*
* @package WordPress
* @subpackage Twenty_Fifteen
* @since Twenty Fifteen 1.0
*/
get_header(); ?>
<div id="primary" class="content-area">
<main id="main" class="site-main" role="main">
<?php
// Start the loop.
while ( have_posts() ) : the_post();
/*
* Include the post format-specific template for the content. If you want to
* use this in a child theme, then include a file called called content-___.php
* (where ___ is the post format) and that will be used instead.
*/
get_template_part( 'content', get_post_format() );
// If comments are open or we have at least one comment, load up the comment template.
if ( comments_open() || get_comments_number() ) :
comments_template();
endif;
// Previous/next post navigation.
the_post_navigation( array(
'next_text' => '<span class="meta-nav" aria-hidden="true">' . __( 'Next', 'twentyfifteen' ) . '</span> ' .
'<span class="screen-reader-text">' . __( 'Next post:', 'twentyfifteen' ) . '</span> ' .
'<span class="post-title">%title</span>',
'prev_text' => '<span class="meta-nav" aria-hidden="true">' . __( 'Previous', 'twentyfifteen' ) . '</span> ' .
'<span class="screen-reader-text">' . __( 'Previous post:', 'twentyfifteen' ) . '</span> ' .
'<span class="post-title">%title</span>',
) );
// End the loop.
endwhile;
?>
</main><!-- .site-main -->
</div><!-- .content-area -->
<?php get_footer(); ?>
```
|
```javascript
var joinpath = require("path").join;
var async = require("async");
var callOnce = require("helper/callOnce");
var isOwner = require("./isOwner");
var getAllViews = require("./getAllViews");
var localPath = require("helper/localPath");
var fs = require("fs-extra");
const { template } = require("lodash");
var generatePackage = require("./package").generate;
function writeToFolder (blogID, templateID, callback) {
isOwner(blogID, templateID, function (err, owner) {
if (err) return callback(err);
if (!owner) return callback(badPermission(blogID, templateID));
getAllViews(templateID, function (err, views, metadata) {
if (err) return callback(err);
if (!views || !metadata) return callback(noTemplate(blogID, templateID));
makeClient(blogID, function (err, client, blogTemplate) {
if (err) {
return callback(err);
}
var dir = joinpath("Templates", metadata.slug);
// Reset the folder before writing. This fixes a bug in which
// there were two views with the same name, but different extension.
client.remove(blogID, dir, function (err) {
if (err) {
return callback(err);
}
metadata.enabled = blogTemplate === templateID;
writePackage(blogID, client, dir, metadata, views, function (err) {
if (err) {
return callback(err);
}
async.eachOfSeries(
views,
function (view, name, next) {
if (!view.name || !view.content) return next();
write(blogID, client, dir, view, next);
},
callback
);
});
});
});
});
});
}
function writePackage (blogID, client, dir, metadata, views, callback) {
var Package = generatePackage(blogID, metadata, views);
client.write(blogID, dir + "/package.json", Package, callback);
}
function makeClient (blogID, callback) {
require("models/blog").get({ id: blogID }, function (err, blog) {
var client = require("clients")[blog.client];
// we create a fake client to write the template files directly
// to the blog's folder if the user has not configured a client
if (!blog.client || !client) {
return callback(null, {
remove: function (blogID, path, callback) {
fs.remove(localPath(blogID, path), callback);
},
write: function (blogID, path, content, callback) {
fs.outputFile(localPath(blogID, path), content, callback);
}
});
}
return callback(null, client, blog.template);
});
}
function write (blogID, client, dir, view, callback) {
callback = callOnce(callback);
var path = joinpath(dir, view.name);
var content = view.content;
client.write(blogID, path, content, callback);
}
function badPermission (blogID, templateID) {
return new Error("No permission for " + blogID + " to write " + templateID);
}
function noTemplate (blogID, templateID) {
return new Error("No template for " + blogID + " and " + templateID);
}
module.exports = writeToFolder;
```
|
```java
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.flowable.common.engine.impl.tenant;
import static org.assertj.core.api.Assertions.assertThat;
import org.flowable.common.engine.api.tenant.TenantContext;
import org.junit.jupiter.api.Test;
/**
* @author Filip Hrisafov
*/
class ThreadLocalTenantContextTest {
protected TenantContext underTest = new ThreadLocalTenantContext();
@Test
void getTenantId() {
assertThat(underTest.getTenantId()).isNull();
underTest.setTenantId("acme");
assertThat(underTest.getTenantId()).isEqualTo("acme");
underTest.setTenantId("muppets");
assertThat(underTest.getTenantId()).isEqualTo("muppets");
underTest.clearTenantId();
assertThat(underTest.getTenantId()).isNull();
}
@Test
void isTenantIdSet() {
assertThat(underTest.isTenantIdSet()).isFalse();
underTest.setTenantId("flowable");
assertThat(underTest.isTenantIdSet()).isTrue();
underTest.clearTenantId();
assertThat(underTest.isTenantIdSet()).isFalse();
underTest.setTenantId(null);
assertThat(underTest.isTenantIdSet()).isTrue();
}
}
```
|
```php
<?php
namespace pdo\stmtclass;
class CustomStatement extends \PDOStatement
{
protected function __construct()
{
}
}
function stmtclass()
{
// path_to_url
$pdo = new \PDO("sqlite::memory:");
$pdo->setAttribute(\PDO::ATTR_STATEMENT_CLASS, [CustomStatement::class, []]);
$stmt = $pdo->prepare("SELECT name FROM sqlite_master");
echo \get_class($stmt), PHP_EOL;
}
stmtclass();
echo "Done.";
```
|
Dolina () is a rural locality (a village) in Ternovskoye Rural Settlement, Ternovsky District, Voronezh Oblast, Russia. The population was 126 as of 2010. There are 5 streets.
Geography
Dolina is located 9 km south of Ternovka (the district's administrative centre) by road. Ternovka is the nearest rural locality.
References
Rural localities in Ternovsky District
|
This is a list of baseball players from Netherlands Antilles (Aruba and Curaçao) who have played in Major League Baseball. Hensley Meulens was the first player from the Netherlands Antilles to make it into the Major Leagues. In Bold denotes still active players in the league.
Players
References
Resources
Baseball Reference
Netherlands Antilles
List
Major League
Major League Baseball players
|
```xml
/**
* Wechaty Chatbot SDK - path_to_url
*
* @copyright 2016 Huan LI () <path_to_url and
* Wechaty Contributors <path_to_url
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*
*/
import type * as PUPPET from 'wechaty-puppet'
import {
log,
} from 'wechaty-puppet'
import type {
FileBoxInterface,
} from 'file-box'
import type { Constructor } from 'clone-class'
import {
guardQrCodeValue,
} from '../pure-functions/guard-qr-code-value.js'
import {
ContactImpl,
} from './contact.js'
import { validationMixin } from '../user-mixins/validation.js'
import { poolifyMixin } from '../user-mixins/poolify.js'
const MixinBase = poolifyMixin(
ContactImpl,
)<ContactSelfInterface>()
/**
* Bot itself will be encapsulated as a ContactSelf.
*
* > Tips: this class is extends Contact
* @example
* const bot = new Wechaty()
* await bot.start()
* bot.on('login', (user: ContactSelf) => {
* console.log(`user ${user} login`)
* })
*/
class ContactSelfMixin extends MixinBase {
static override async find (
query : string | PUPPET.filters.Contact,
): Promise<undefined | ContactSelfInterface> {
if (!this.wechaty.isLoggedIn) {
return undefined
}
try {
const contact = await super.find(query)
if (contact && contact.id === this.wechaty.puppet.currentUserId) {
return contact as ContactSelfInterface
}
} catch (e) {
log.silly('ContactSelf', 'find() exception: %s', (e as Error).message)
}
return undefined
}
public override async avatar () : Promise<FileBoxInterface>
public override async avatar (file: FileBoxInterface) : Promise<void>
/**
* GET / SET bot avatar
*
* @param {FileBox} [file]
* @returns {(Promise<void | FileBox>)}
*
* @example <caption> GET the avatar for bot, return {Promise<FileBox>}</caption>
* // Save avatar to local file like `1-name.jpg`
*
* bot.on('login', (user: ContactSelf) => {
* console.log(`user ${user} login`)
* const file = await user.avatar()
* const name = file.name
* await file.toFile(name, true)
* console.log(`Save bot avatar: ${contact.name()} with avatar file: ${name}`)
* })
*
* @example <caption>SET the avatar for a bot</caption>
* import { FileBox } from 'wechaty'
* bot.on('login', (user: ContactSelf) => {
* console.log(`user ${user} login`)
* const fileBox = FileBox.fromUrl('path_to_url
* await user.avatar(fileBox)
* console.log(`Change bot avatar successfully!`)
* })
*
*/
public override async avatar (file?: FileBoxInterface): Promise<void | FileBoxInterface> {
log.verbose('Contact', 'avatar(%s)', file ? file.name : '')
if (!file) {
const filebox = await super.avatar()
return filebox
}
if (this.id !== this.wechaty.puppet.currentUserId) {
throw new Error('set avatar only available for user self')
}
await this.wechaty.puppet.contactAvatar(this.id, file)
}
/**
* Get bot qrcode
*
* @returns {Promise<string>}
*
* @example
* import { generate } from 'qrcode-terminal'
* bot.on('login', (user: ContactSelf) => {
* console.log(`user ${user} login`)
* const qrcode = await user.qrcode()
* console.log(`Following is the bot qrcode!`)
* generate(qrcode, { small: true })
* })
*/
public async qrcode (): Promise<string> {
log.verbose('Contact', 'qrcode()')
if (this.id !== this.wechaty.puppet.currentUserId) {
throw new Error('only can get qrcode for the currentUser')
}
const qrcodeValue = await this.wechaty.puppet.contactSelfQRCode()
return guardQrCodeValue(qrcodeValue)
}
/**
* Change bot name
*
* @param name The new name that the bot will change to
*
* @example
* bot.on('login', async user => {
* console.log(`user ${user} login`)
* const oldName = user.name()
* try {
* await user.name(`${oldName}-${new Date().getTime()}`)
* } catch (e) {
* console.error('change name failed', e)
* }
* })
*/
public override name (): string
public override name (name: string): Promise<void>
public override name (name?: string): string | Promise<void> {
log.verbose('ContactSelf', 'name(%s)', name || '')
if (typeof name === 'undefined') {
return super.name()
}
if (this.id !== this.wechaty.puppet.currentUserId) {
throw new Error('only can set name for user self')
}
return this.wechaty.puppet.contactSelfName(name).then(this.sync.bind(this))
}
/**
* Change bot signature
*
* @param signature The new signature that the bot will change to
*
* @example
* bot.on('login', async user => {
* console.log(`user ${user} login`)
* try {
* await user.signature(`Signature changed by wechaty on ${new Date()}`)
* } catch (e) {
* console.error('change signature failed', e)
* }
* })
*/
public async signature (signature: string): Promise<void> {
log.verbose('ContactSelf', 'signature()')
if (this.id !== this.wechaty.puppet.currentUserId) {
throw new Error('only can change signature for user self')
}
return this.wechaty.puppet.contactSelfSignature(signature).then(this.sync.bind(this))
}
}
class ContactSelfImpl extends validationMixin(ContactSelfMixin)<ContactSelfInterface>() {}
interface ContactSelfInterface extends ContactSelfImpl {}
type ContactSelfConstructor = Constructor<
ContactSelfInterface,
Omit<typeof ContactSelfImpl, 'load'>
>
export type {
ContactSelfConstructor,
ContactSelfInterface,
}
export {
ContactSelfImpl,
}
```
|
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
import logging
import numpy as np
from dist_amp_base import (
MLP,
RandomDataset,
compare_state_dict,
create_optimizer,
save_model_parameters,
)
import paddle
from paddle.distributed.fleet.utils.hybrid_parallel_util import (
fused_allreduce_gradients,
)
logging.basicConfig(level="INFO", format="%(message)s")
def train_mlp(
model, train_loader, use_pure_bf16=False, use_main_grad=False, acc_steps=1
):
logging.info(
f"-- Train Info: use_pure_bf16={use_pure_bf16}, use_main_grad={use_main_grad}, acc_steps={acc_steps}"
)
optimizer = create_optimizer(
model=model, use_pure_bf16=use_pure_bf16, use_main_grad=use_main_grad
)
if use_pure_bf16:
level = 'O2'
custom_white_list = None
model = paddle.amp.decorate(
models=model,
dtype="bfloat16",
level=level,
)
else:
level = 'O1'
custom_white_list = [
"matmul_v2",
"elementwise_add",
"relu",
]
model = paddle.DataParallel(model)
if not use_pure_bf16:
for param in model.parameters():
t = paddle.cast(
paddle.cast(param, dtype='bfloat16'), dtype='float32'
)
param.set_value(t)
local_rank = paddle.distributed.get_rank()
losses = []
epoch = 2
for eop in range(epoch):
model.train()
for batch_id, data in enumerate(train_loader()):
data.stop_gradient = True
enable_stats = False # eop == 0
if enable_stats:
logging.info("<<<<<<<<<<<< forward-backward >>>>>>>>>>>")
paddle.amp.debugging.enable_operator_stats_collection()
with model.no_sync():
with paddle.amp.auto_cast(
True,
level=level,
dtype="bfloat16",
custom_white_list=custom_white_list,
):
out = model(data)
# compute loss in float32
loss = paddle.mean(out.astype("float32"))
# normal implementation for gradient accumulation.
if acc_steps != 1:
loss = loss / acc_steps
losses.append(loss.item())
loss.backward()
logging.info(
f"-- [rank={local_rank}] epoch {eop}, batch {batch_id}, loss: {loss.astype(paddle.float32).numpy()}"
)
if enable_stats:
paddle.amp.debugging.disable_operator_stats_collection()
if (batch_id + 1) % acc_steps == 0:
if enable_stats:
logging.info(
"<<<<<<<<<<<< fused_allreduce_gradients >>>>>>>>>>>"
)
paddle.amp.debugging.enable_operator_stats_collection()
fused_allreduce_gradients(list(model.parameters()), None)
if enable_stats:
paddle.amp.debugging.disable_operator_stats_collection()
if enable_stats:
logging.info("<<<<<<<<<<<< optimizer >>>>>>>>>>>")
paddle.amp.debugging.enable_operator_stats_collection()
optimizer.step()
optimizer.clear_grad()
if enable_stats:
paddle.amp.debugging.disable_operator_stats_collection()
model_param_dict = save_model_parameters(model)
optimizer_state_dict = optimizer.state_dict()
return losses, model_param_dict, optimizer_state_dict
def test_dp_bf16():
if not paddle.amp.is_bfloat16_supported():
logging.info("BFloat16 is not supported!")
return
paddle.distributed.init_parallel_env()
local_rank = paddle.distributed.get_rank()
paddle.seed(2023 + local_rank)
np.random.seed(2023 + local_rank)
# For DataParallel, DataLoader should feed different data for different GPUs.
train_loader = paddle.io.DataLoader(
RandomDataset(),
batch_size=100,
shuffle=False,
drop_last=True,
num_workers=0,
)
single_mlp = MLP()
state_dict = single_mlp.state_dict()
def _compare_bf16_o1_vs_o2(acc_steps=1):
# dp bf16 O1 vs dp bf16 O2 main_grad
mlp1 = MLP()
mlp2 = MLP()
mlp1.set_state_dict(state_dict)
mlp2.set_state_dict(state_dict)
losses_o1, model_param_dict_o1, optimizer_state_dict_o1 = train_mlp(
mlp1, train_loader, use_pure_bf16=False, acc_steps=acc_steps
)
losses_o2, model_param_dict_o2, optimizer_state_dict_o2 = train_mlp(
mlp2,
train_loader,
use_pure_bf16=True,
use_main_grad=True,
acc_steps=acc_steps,
)
np.testing.assert_array_equal(losses_o2, losses_o1)
compare_state_dict(
model_param_dict_o1, model_param_dict_o2, optimizer_state_dict_o2
)
# no gradient accumulation
_compare_bf16_o1_vs_o2(acc_steps=1)
# gradient accumulation
_compare_bf16_o1_vs_o2(acc_steps=2)
if __name__ == '__main__':
test_dp_bf16()
```
|
```c++
#include <aws/core/Aws.h>
#include <aws/elasticache/ElastiCacheClient.h>
#include <aws/elasticache/model/AddTagsToResourceRequest.h>
#include <aws/elasticache/model/AddTagsToResourceResult.h>
#include <aws/elasticache/model/Tag.h>
#include <iostream>
int main(int argc, char ** argv)
{
if (argc != 4)
{
std::cout << "Usage: add_tags <resource_name> <tag_key> <tag_value>" << std::endl;
return 1;
}
Aws::SDKOptions options;
Aws::InitAPI(options);
{
Aws::String name(argv[1]);
Aws::String tag_key(argv[2]);
Aws::String tag_value(argv[3]);
Aws::ElastiCache::ElastiCacheClient elasticache;
Aws::ElastiCache::Model::AddTagsToResourceRequest attr_req;
Aws::ElastiCache::Model::Tag tags;
tags.SetKey(tag_key);
tags.SetValue(tag_value);
attr_req.SetResourceName(name);
attr_req.AddTags(tags);
auto attr_out = elasticache.AddTagsToResource(attr_req);
if (attr_out.IsSuccess())
{
std::cout << "Successfully added tags to resource" << std::endl;
}
else
{
std::cout << "Error adding tags" << attr_out.GetError().GetMessage()
<< std::endl;
}
}
Aws::ShutdownAPI(options);
return 0;
}
```
|
```go
package common
import (
"encoding/json"
"fmt"
"io"
"net/http"
"os"
"github.com/djannot/aws-sdk-go/aws"
"github.com/djannot/aws-sdk-go/aws/session"
"github.com/djannot/aws-sdk-go/service/s3"
"github.com/emc-advanced-dev/pkg/errors"
"github.com/layer-x/layerx-commons/lxhttpclient"
"github.com/sirupsen/logrus"
"github.com/solo-io/unik/pkg/config"
"github.com/solo-io/unik/pkg/types"
)
const (
unik_hub_region = "us-east-1"
unik_hub_bucket = "unik-hub"
unik_image_info = "Unik-Image-Info"
)
func PullImage(config config.HubConfig, imageName string, writer io.Writer) (*types.Image, error) {
//to trigger modified djannot/aws-sdk
os.Setenv("S3_AUTH_PROXY_URL", config.URL)
//search available images, get user for image name
resp, body, err := lxhttpclient.Get(config.URL, "/images", nil)
if err != nil {
return nil, errors.New("performing GET request", err)
}
if resp.StatusCode != http.StatusOK {
return nil, errors.New(fmt.Sprintf("failed GETting image list status %v: %s", resp.StatusCode, string(body)), nil)
}
var images []*types.UserImage
if err := json.Unmarshal(body, &images); err != nil {
logrus.Fatal(err)
}
var user string
for _, image := range images {
if image.Name == imageName {
user = image.Owner
break
}
}
if user == "" {
return nil, errors.New("could not find image "+imageName, nil)
}
metadata, err := s3Download(imageKey(user, imageName), config.Password, writer)
if err != nil {
return nil, errors.New("downloading image", err)
}
var image types.Image
if err := json.Unmarshal([]byte(metadata), &image); err != nil {
return nil, errors.New("unmarshalling metadata for image", err)
}
logrus.Infof("downloaded image %v", image)
return &image, nil
}
func PushImage(config config.HubConfig, image *types.Image, imagePath string) error {
//to trigger modified djannot/aws-sdk
os.Setenv("S3_AUTH_PROXY_URL", config.URL)
metadata, err := json.Marshal(image)
if err != nil {
return errors.New("converting image metadata to json", err)
}
//upload image
reader, err := os.Open(imagePath)
if err != nil {
return errors.New("opening file", err)
}
defer reader.Close()
fileInfo, err := reader.Stat()
if err != nil {
return errors.New("getting file info", err)
}
if err := s3Upload(config, imageKey(config.Username, image.Name), string(metadata), reader, fileInfo.Size()); err != nil {
return errors.New("uploading image file", err)
}
logrus.Infof("Image %v pushed to %s", image, config.URL)
return nil
}
func RemoteDeleteImage(config config.HubConfig, imageName string) error {
//to trigger modified djannot/aws-sdk
os.Setenv("S3_AUTH_PROXY_URL", config.URL)
if err := s3Delete(config, imageKey(config.Username, imageName)); err != nil {
return errors.New("deleting image file", err)
}
logrus.Infof("Image %v deleted from %s", imageName, config.URL)
return nil
}
func s3Download(key, password string, writer io.Writer) (string, error) {
params := &s3.GetObjectInput{
Bucket: aws.String(unik_hub_bucket),
Key: aws.String(key),
Password: aws.String(password),
}
result, err := s3.New(session.New(&aws.Config{Region: aws.String(unik_hub_region)})).GetObject(params)
if err != nil {
return "", errors.New("failed to download from s3", err)
}
n, err := io.Copy(writer, result.Body)
if err != nil {
return "", errors.New("copying image bytes", err)
}
logrus.Infof("downloaded %v bytes", n)
if result.Metadata[unik_image_info] == nil {
return "", errors.New(fmt.Sprintf(unik_image_info+" was empty. full metadata: %+v", result.Metadata), nil)
}
return *result.Metadata[unik_image_info], nil
}
func s3Upload(config config.HubConfig, key, metadata string, body io.ReadSeeker, length int64) error {
params := &s3.PutObjectInput{
Body: body,
Bucket: aws.String(unik_hub_bucket),
Key: aws.String(key),
Metadata: map[string]*string{
"unik-password": aws.String(config.Password),
"unik-email": aws.String(config.Username),
"unik-access": aws.String("public"),
unik_image_info: aws.String(metadata),
},
}
result, err := s3.New(session.New(&aws.Config{Region: aws.String(unik_hub_region)})).PutObject(params)
if err != nil {
return errors.New("uploading image to s3 backend", err)
}
logrus.Infof("uploaded %v bytes: %v", length, result)
return nil
}
// unik hub has to do it itself to validate user
func s3Delete(config config.HubConfig, key string) error {
deleteMessage := struct {
Username string `json:"user"`
Password string `json:"pass"`
Key string `json:"key"`
}{
Username: config.Username,
Password: config.Password,
Key: key,
}
resp, body, err := lxhttpclient.Post(config.URL, "/delete_image", nil, deleteMessage)
if err != nil {
return errors.New("failed to perform delete request", err)
}
if resp.StatusCode != 204 {
return errors.New(fmt.Sprintf("expected status code 204, got %v: %s", resp.StatusCode, string(body)), nil)
}
return nil
}
func imageKey(username, imageName string) string {
return "/" + username + "/" + imageName + "/latest" //TODO: support image versioning
}
```
|
Andriy Viktorovych Zadorozhny (born 21 May 1968 in Kyiv) is a Ukrainian lawyer and human rights activist. People's Deputy of Ukraine of the 9th convocation from the Servant of the People.
Biography
Candidate for People's Deputies from the Servant of the People party in the 2019 parliamentary elections, № 119 on the list. At the time of the election: Director of Proxen Law Firm, non-partisan, living in Kyiv.
He graduated from the Faculty of International Law at the Institute of International Relations of the Taras Shevchenko National University of Kyiv, obtained the qualification of an international lawyer and English translator.
Member of the Verkhovna Rada of Ukraine Committee on Environmental Policy and Nature Management.
References
Link
.
Living people
1968 births
20th-century Ukrainian lawyers
Servant of the People (political party) politicians
Taras Shevchenko National University of Kyiv alumni
21st-century Ukrainian lawyers
|
```go
// Code generated by mockery v1.0.0. DO NOT EDIT.
package mocks
import mock "github.com/stretchr/testify/mock"
// IAuditLogTelemetry is an autogenerated mock type for the IAuditLogTelemetry type
type IAuditLogTelemetry struct {
mock.Mock
}
// ScheduleAuditEvents provides a mock function with given fields:
func (_m *IAuditLogTelemetry) ScheduleAuditEvents() {
_m.Called()
}
// SendAuditMessage provides a mock function with given fields:
func (_m *IAuditLogTelemetry) SendAuditMessage() {
_m.Called()
}
// StopScheduler provides a mock function with given fields:
func (_m *IAuditLogTelemetry) StopScheduler() {
_m.Called()
}
```
|
```javascript
var NewTemplateView = require( 'elementor-admin/new-template/view' );
import LockPro from './behaviors/lock-pro';
module.exports = elementorModules.common.views.modal.Layout.extend( {
getModalOptions() {
return {
id: 'elementor-new-template-modal',
};
},
getLogoOptions() {
return {
title: __( 'New Template', 'elementor' ),
};
},
initialize() {
elementorModules.common.views.modal.Layout.prototype.initialize.apply( this, arguments );
const lookupControlIdPrefix = 'elementor-new-template__form__';
const templateTypeSelectId = `${ lookupControlIdPrefix }template-type`;
this.showLogo();
this.showContentView();
this.initElements();
this.lockProBehavior = new LockPro( this.elements );
this.lockProBehavior.bindEvents();
const dynamicControlsVisibilityListener = () => {
elementorAdmin.templateControls.setDynamicControlsVisibility( lookupControlIdPrefix, elementor_new_template_form_controls );
};
this.getModal().onShow = () => {
dynamicControlsVisibilityListener();
document.getElementById( templateTypeSelectId ).addEventListener( 'change', dynamicControlsVisibilityListener );
};
this.getModal().onHide = () => {
document.getElementById( templateTypeSelectId ).removeEventListener( 'change', dynamicControlsVisibilityListener );
};
},
initElements() {
const container = this.$el[ 0 ],
root = '#elementor-new-template__form';
this.elements = {
form: container.querySelector( root ),
submitButton: container.querySelector( `${ root }__submit` ),
lockButton: container.querySelector( `${ root }__lock_button` ),
templateType: container.querySelector( `${ root }__template-type` ),
lockBadge: container.querySelector( `${ root }__template-type-badge` ),
lockBadgeText: container.querySelector( `${ root }__template-type-badge__text` ),
lockBadgeIcon: container.querySelector( `${ root }__template-type-badge__icon` ),
};
},
showContentView() {
this.modalContent.show( new NewTemplateView() );
},
} );
```
|
```shell
#!/usr/bin/env bash
# Tags: no-fasttest
CURDIR=$(cd "$(dirname "${BASH_SOURCE[0]}")" && pwd)
# shellcheck source=../shell_config.sh
. "$CURDIR"/../shell_config.sh
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_float.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_str.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_unicode.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/two_dim.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/two_dim_float.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/two_dim_str.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/two_dim_unicode.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/two_dim_bool.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/two_dim_null.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/three_dim.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/none_endian_array.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/big_endian_array.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/one_dim.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/one_dim_float.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/one_dim_str.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/one_dim_unicode.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/two_dim.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/two_dim_float.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/two_dim_str.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/two_dim_unicode.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/two_dim_bool.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/two_dim_null.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/three_dim.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/none_endian_array.npy')"
$CLICKHOUSE_LOCAL -q "describe file('$CURDIR/data_npy/big_endian_array.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim.npy', Npy, 'value UInt8')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim.npy', Npy, 'value UInt16')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim.npy', Npy, 'value UInt32')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim.npy', Npy, 'value UInt64')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim.npy', Npy, 'value Int8')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim.npy', Npy, 'value Int16')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim.npy', Npy, 'value Int32')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim.npy', Npy, 'value Int64')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_float.npy', Npy, 'value Float32')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_float.npy', Npy, 'value Float64')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_str.npy', Npy, 'value FixedString(1)')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_str.npy', Npy, 'value String')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/two_dim.npy', Npy, 'value Array(Int8)')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/three_dim.npy', Npy, 'value Array(Array(Int8))')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_float.npy', Npy, 'value Array(Float32)')" 2>&1 | grep -c "BAD_ARGUMENTS"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_float.npy', Npy, 'value UUID')" 2>&1 | grep -c "UNKNOWN_TYPE"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_float.npy', Npy, 'value Tuple(UInt8)')" 2>&1 | grep -c "UNKNOWN_TYPE"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_float.npy', Npy, 'value Int8')" 2>&1 | grep -c "ILLEGAL_COLUMN"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_str.npy', Npy, 'value Int8')" 2>&1 | grep -c "ILLEGAL_COLUMN"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/one_dim_unicode.npy', Npy, 'value Float32')" 2>&1 | grep -c "ILLEGAL_COLUMN"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/complex.npy')" 2>&1 | grep -c "CANNOT_EXTRACT_TABLE_STRUCTURE"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/float_16.npy')"
$CLICKHOUSE_LOCAL -q "select * from file('$CURDIR/data_npy/npy_inf_nan_null.npy')"
```
|
This Changes Everything may refer to:
This Changes Everything (book), a book on global warming and climate change by Naomi Klein,
This Changes Everything (2015 film), a film by Avi Lewis based on the book,
This Changes Everything (2018 film), a film on sexism in Hollywood by Tom Donahue.
This Changes Everything (album)
|
```qmake
-optimizationpasses 5
-ignorewarnings
-dontusemixedcaseclassnames
-dontskipnonpubliclibraryclasses
-dontskipnonpubliclibraryclassmembers
-useuniqueclassmembernames
-allowaccessmodification
-dontpreverify
-verbose
-dontoptimize
-renamesourcefileattribute SourceFile
-keepattributes SourceFile,LineNumberTable
-keepattributes Signature
-keepattributes *Annotation*
-optimizations !code/simplification/arithmetic,!field/*,!class/merging/*
-keepclassmembers class * extends android.app.Activity {
public void *(android.view.View);
}
-keepclassmembers enum * {
public static **[] values();
public static ** valueOf(java.lang.String);
}
-keep public class **.R$*{
public static final int *;
}
-keepclassmembers class **.R$* {
public static <fields>;
}
-keepclassmembers class * {
native <methods>;
}
-keepclasseswithmembernames class * {
native <methods>;
}
-keepclasseswithmembers class * {
public <init>(android.content.Context);
public <init>(android.content.Context, android.util.AttributeSet);
public <init>(android.content.Context, android.util.AttributeSet, int);
public void set*(***);
public *** set*(***);
public *** get*(***);
public *** get*();
}
-keep class android.support.annotation.Keep
-keep @android.support.annotation.Keep class * {*;}
-keepclasseswithmembers class * {
@android.support.annotation.Keep <methods>;
}
-keepclasseswithmembers class * {
@android.support.annotation.Keep <fields>;
}
-keepclasseswithmembers class * {
@android.support.annotation.Keep <init>(...);
}
-keep public class * implements android.os.Parcelable{*;}
-keepclasseswithmembers class * implements android.os.Parcelable {
public static final android.os.Parcelable$Creator *;
}
-keep public class android.support.v7.widget.SearchView{*;}
-keep public class * extends android.support.v4.view.ActionProvider{*;}
```
|
Below is a list of the more common initial opening move sequences found in professional shogi games.
First move
Out of the 64,046 recorded (mostly) professional games on Kyokumenpedia (局面ペヂィア) as of 2019 Jan 23 spanning the timeframe from the 1600s to 2018, 77.2% started with a bishop pawn opening (P-76) and 20.8% started with a rook pawn opening (P-26). The rook pawn push naturally leads to Static Rook openings; however, it is possible to play a Feint Ranging Rook as well. The bishop pawn push is more flexible and thus more ambiguous about the planned opening information given to White.
A less common first move (1.6% of Kyokumenpedia games) is the king's pawn (P-56). This move often suggests a Ranging Rook opening (Central Rook or Opposing Rook) for Black.
Other first moves are relatively rare and occur less than 0.5% of the time. For instance, the fourth most frequent move is the left edge pawn (P-96), but this only occurs less than 0.1% of the time.
Second move
Just as the most common first moves are 1.P-76 and 1.P-26, the most common first move responses by White are also the rook pawn and bishop pawn pushes.
1. P-76
Out of professional games with the bishop pawn push as the first move (1.P-76), 56.4% had White respond by advancing their bishop pawn (...P-34) and 42.5% responded by advancing their rook pawn (...P-84).
All other second moves (e.g. ...G-32) occur less than 1.1% of the time.
The ...G-32 choice prevents White from making a Boat castle, which is a standard castle used for a Static Rook position against a Ranging Rook opponent, since the Boat castle requires the king to the 32 square while the left gold remains on its starting 41 square. Thus, this move seems to invite Black to play a Ranging Rook position in order to exploit White's more limited piece development. Nonetheless, if Black chooses a Ranging Rook opening, White's gold on 32 can still be used to develop a Silver Crown castle or if Black plays a Bishop-Exchange Ranging Rook opening White can develop a Fortress castle in response with the gold in this position.
1.P-26
Out of the rook pawn (1.P-26) first move games, 50.8% had a rook pawn advance as White's response and 48.7% had a bishop pawn response.
All other second moves (e.g. ...G-32) occur less than 0.5% of the time.
1.P-56
Out of the central pawn (1.P-56) first move games, 65.5% had a bishop pawn advance as White's response, 30.2% had a rook pawn response, 2.5% have silver to 62, and 1.2% advance the central pawn.
All other second moves occur less than 0.6% of the time.
1.P-96
Advancing the left edge pawn is an uncommon first move that like other more common first moves is usually followed by a bishop pawn (64.2%) or rook pawn (17.0%) push.
Less common responses include advancing either edge pawn.
First 2-move probabilities
To state it in a different way, the probabilities of these first two-move sequences are shown below along with their log probability. In the adjacent diagrams are the six most common two-move positions.
These probabilities highlight how the most common first move from either side are the bishop and rook pawn pushes accounting for over 97% of all games.
Third move
1.P-76 P-34
Out of the 1.P-76 P-34 professional games, for the third move, Black:
advances their rook pawn (P-26) 64.2% of the time,
advances their sixth file pawn (P-66) 20.1% of the time,
continues pushing their seventh file pawn (P-75) 5.1% of the time,
advances their left edge pawn (P-96) 3.2% of the time,
advances their right edge pawn (P-16) 2.5% of the time,
advances their right silver to the fourth file (S-48) 1.2% of the time,
moves their rook to the fourth file (R-68) 1.0% of the time, and
advances their central pawn (P-56) 0.9% of the time.
All other third moves occur 1.7% of the time.
Playing 1.P-76 P-34 2.P-26 results in the same board position as a 1.P-26 P-34 2.P-76 sequence. (See: Transposition (chess).) This is the most commonly encountered 3-move sequence in shogi.
The 1.P-76 P-34 2.P-66 sequence suggests that Black may play a Ranging Rook opening (Opposing, Third File, or Fourth File).
However, Fortress or Snowroof are also possible.
The 1.P-76 P-34 2.P-75 sequence strongly suggests that Black will play an Ishida opening (Third File Ranging Rook).
Both the 1.P-76 P-34 2.P-96 and 1.P-76 P-34 2.P-1f sequences with the edge pawn push are relatively noncommittal initial moves by Black. Here, it is as if Black is asking White to determine which opening to play. (These moves also recall the shogi aphorism (将棋の格言 shōgi no kakugen): 手のない時には端歩を突け te no nai toki wa hashifu o tsuke "When there's no (good) move, push an edge pawn".)
1.P-76 P-34 2.P-96 can transpose to 1.P-96 P-34 2.P-76. However, 1.P-96 is an uncommon first move, and 1.P-76 P-34 2.P-96 is 38 times more likely than the transposition.
1.P-76 P-84
Out of 1.P-76 P-84 games, common third moves for Black include:
(S-68) advancing their left silver to the sixth file (52.3%),
(P-26) advancing their rook pawn (16.4%),
(P-56) advancing their central pawn (11.7%),
(S-78) advancing their left silver to the seventh file (7.4%),
(R-78) moving their rook to the seventh file (4.1%),
(G-78) moving their left gold up the seventh file (2.6%),
(P-16) advancing their right edge pawn (1.8%),
(R-68) moving their rook to the sixth file (1.8%), and
(P-66) advancing their sixth file pawn (1.4%).
All other third moves occur 0.5% of the time.
Playing 1.P-76 P-84 2.P-26 results in the same board position as the uncommon 1.P-26 P-84 2.P-76 sequence.
The 1.P-76 P-84 2.S-68 sequence suggests that Black might play a Fortress opening (Static Rook). Although Fortress is very common, the moves could also transition to other Static Rook openings like Bishop Exchange or Snowroof as well as to several Ranging Rook openings. This 3-move sequence is the second most common found in shogi.
1.P-76 G-32
White's G-32 is an uncommon second move. Out of 1.P-76 G-32 games, common third moves for Black include:
(P-26) pushing their rook pawn push (29.1%),
(P-56) advancing their central pawn (20.6%),
(G-78) advancing their left gold up the seventh file (16.6%), and
(R-78) swinging their rook to the seventh file (13.1%).
All other third moves occur 20.6% of the time.
1.P-26 P-84
Out of 1.P-26 P-84 games, common third moves for Black include:
(P-25) further advancing their rook pawn (93%) and
(P-76) advancing their bishop pawn (6%).
Other third moves occur less 0.5% of the time.
Playing the uncommon 1.P-26 P-84 2.P-76 sequence results in the same board position as the more common 1.P-76 P-84 2.P-26 sequence.
1.P-26 P-34
Out of 1.P-26 P-34 games, common third moves for Black include:
(P-76) advancing their bishop pawn (85.4%),
(P-25) further advancing their rook pawn (13.1%), and
(S-48) moving their right silver to the fourth file (1.2%).
Other third moves occur 0.3% of the time.
Playing 1.P-26 P-34 2.P-76 transposes to the 1.P-76 P-34 2.P-26 sequence.
1.P-56 P-34
Out of 1.P-56 P-34 games, the most common third moves for Black include:
(R-58) moving their rook to the central file (97.6%) and
(P-76) opening their bishop diagonal (0.9%)
All other third moves occur 1.4% of the time.
1.P-96 P-34
Out of 1.P-96 P-34 games, the most common third moves for Black include:
(P-76) opening their bishop diagonal (76.5%) and
(S-48) moving their right silver to the fourth file (11.8%).
First 3-move probabilities
Below are the joint probabilities of these common 3 move sequences along with their log probability. The following table collapses different sequences that result in the same board position. The adjacent diagrams show the eight most common positions found in the game records.
Fourth move
1.P-76 P-34 2.P-26 / 1.P-26 P-34 2.P-76
Out of the 1.P-76 P-34 2.P-26 / 1.P-26 P-34 2.P-76 professional games, for the fourth move, White
advances their fourth file pawn (P-44) 54% of the time,
advances their rook pawn (P-84) 19% of the time,
advances their central pawn (P-54) 12% of the time, and
moves their left gold toward the bishop (G-32) 9% of the time.
Other fourth moves occur 6% of the time.
The 1.P-76 P-34 2.P-26 P-44 and 1.P-26 P-34 2.P-76 P-44 sequences suggest that White will play a Ranging Rook opening.
The 1.P-76 P-34 2.P-26 P-84 and 1.P-26 P-34 2.P-76 P-84 sequences suggest a Side Pawn Capture opening (Double Static Rook).
The 1.P-76 P-34 2.P-26 P-54 and 1.P-26 P-34 2.P-76 P-54 sequences suggest White will play a Central Rook opening (Ranging Rook).
The 1.P-76 P-34 2.P-26 G-32 and 1.P-26 P-34 2.P-76 G-32 sequences suggest White wants to play a Bishop Exchange opening (Double Static Rook).
1.P-76 P-34 2.P-66
Out of 1.P-76 P-34 2.P-66 games, common fourth moves for White include:
(P-84) advancing their rook pawn (40%),
(S-62) moving their right silver toward the center (23%),
(R-32) ranging their rook to the third file (9%), and
(P-35) further advancing their bishop pawn (8%).
Other fourth moves occur 19% of the time.
The first three moves already suggest that Black will play a Ranging Rook opening.
The 1.P-76 P-34 2.P-66 S-62 sequence suggests that White will play a Static Rook opening.
Both the 1.P-76 P-34 2.P-66 R-32 and 1.P-76 P-34 2.P-66 P-35 sequences suggest that White will also play a Ranging Rook opening (Double Ranging Rook), in particular Third File Rook.
1.P-76 P-34 2.P-75
Out of 1.P-76 P-34 2.P-75 games, common fourth moves for White include:
(K-42) castling their king toward the bishop (21%),
(P-84) advancing their rook pawn (17%),
(P-54) advancing their central pawn (14%), and
(S-62) advancing their silver up (14%).
Other fourth moves occur 35% of the time.
1.P-76 P-84 2.S-68
Out of 1.P-76 P-84 2.S-68 games, White usually (99%) advances their bishop pawn (P-34).
Other fourth moves occur less than 0.5% of the time.
This 4-move 1.P-76 P-84 2.S-68 P-34 sequence will usually lead to a Fortress opening (just like the first 3 moves) with White threatening Black's bishop. However, it's still possible that Black could transition to a Bishop Exchange or Snowroof opening or a Ranging Rook openings like Central Rook or Opposing Rook. (Third File Rook or Fourth File Rook are less likely here as the silver is blocking the rook from moving to these files.)
1.P-76 P-84 2.P-26 / 1.P-26 P-84 2.P-76
Out of 1.P-76 P-84 2.P-26 / 1.P-26 P-84 2.P-76 games, common fourth moves for White include:
(P-85) further advancing their rook pawn (62%),
(G-32) moving their left gold toward the bishop (32%), and
(P-34) advancing their bishop pawn (5%).
The 1.P-76 P-84 2.P-26 P-34 sequence results in the same board position as the 1.P-76 P-34 2.P-26 P-84, 1.P-26 P-34 2.P-76 P-84, and 1.P-26 P-84 2.P-76 P-34 sequences – all of which suggest a Side Pawn Capture opening (Static Rook).
The 1.P-76 P-84 2.P-26 G-32 and 1.P-26 P-84 2.P-76 G-32 sequences suggest the possibility of a Bishop Exchange opening (Double Static Rook).
1.P-76 P-84 2.P-56
Out of 1.P-76 P-84 2.P-56 games, common fourth moves for White include:
(P-85) further advancing their rook pawn (59%),
(P-54) advancing their central pawn (22%), and
(P-34) advancing their bishop pawn (18%).
Other fourth moves occur 2% of the time.
1.P-76 P-84 2.S-78
Out of 1.P-76 P-84 2.S-78 games, White usually (98% of the time) advances their bishop pawn (P-34).
Other fourth moves occur 2% of the time.
1.P-26 P-84 2.P-25
Out of 1.P-26 P-84 2.P-25 games, White usually (96% of the time) further advances their rook pawn (P-85).
Other fourth moves occur 4% of the time.
This sequence suggests a Double Wing Attack opening (Static Rook). (It's possible that this could also transition to other Static Rook openings.)
1.P-26 P-34 2.P-25
Out of 1.P-26 P-34 2.P-25 games, White usually (97% of the time) moves their bishop to the third file (B-33).
Other fourth moves occur 3% of the time.
First 4-move probabilities
Below are the joint probabilities for these 4-move sequences.
Notes
References
Bibliography
: Many shogi games (professional, online, AI) put into a decision tree structure with user-generated commentary and references and some opening classifications.
External links
Wikibooks: 将棋
Yamajunn's Wikishogi Shogi Opening
evergreenな部屋:
初手～4手目で戦型判断 · openings categorized by first 4 moves
初手～6手目で戦型判断 · openings categorized by first 6 moves
Shogi openings
|
```java
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
/** Wire coders for communications between runner and SDK harness. */
package org.apache.beam.runners.fnexecution.wire;
```
|
Dionisio de Santos, O.P. (died 1577) was a Roman Catholic prelate who served as Bishop of Cartagena (1574–1577).
Biography
Dionisio de Santos was born in Spain and ordained a priest in the Order of Preachers.
On 25 Jun 1574, he was appointed during the papacy of Pope Gregory XIII as Bishop of Cartagena.
On Dec 1575, he was consecrated bishop by Luis Zapata de Cárdenas, Archbishop of Santafé en Nueva Granada.
He served as Bishop of Cartagena until his death on 9 Sep 1577.
References
External links and additional sources
(for Chronology of Bishops)
(for Chronology of Bishops)
16th-century Roman Catholic bishops in New Granada
Bishops appointed by Pope Gregory XIII
Roman Catholic bishops of Cartagena in Colombia
1577 deaths
Dominican bishops
|
Group B of the 2019 AFC Asian Cup took place from 6 to 15 January 2019. The group consisted of defending champions Australia, Syria, Palestine, and Jordan. The top two teams, Jordan and Australia, advanced to the round of 16.
Teams
Notes
Standings
In the round of 16:
The winners of Group B, Jordan, advanced to play the third-placed team of Group D, Vietnam.
The runners-up of Group B, Australia, advanced to play the runners-up of Group F, Uzbekistan.
Matches
All times listed are GST (UTC+4).
Australia vs Jordan
With 10 minutes on the clock, Musa Al-Taamari turned in the area, only to shoot across the face of the goal. Robbie Kruse’s through ball found Awer Mabil, whose first-time shot was kept out by Amer Shafi. At 26 minutes, Baha' Abdel-Rahman’s corner found Anas Bani Yaseen who powered his header beyond Mathew Ryan. Minutes later Jordan almost doubled their lead after Trent Sainsbury’s foul on Al-Taamari provided Abdel-Rahman the opportunity to go for goal from the edge of the area, only for Ryan to tip the free-kick onto the crossbar. Australia were denied a penalty for Feras Shelbaieh's apparent handball shortly before the break. Early in the second half, Mabil drove a low ball across the face of goal that Shafi pushed to the feet of one of his own defenders, while Tom Rogic’s dipping shot from range was also beaten away by the goalkeeper. At the other end, Yaseen Al-Bakhit’s long range drive was just off target moments after beating two defenders and seeing the ball out for a corner. Twelve minutes from time, Mabil saw his low drive come back off the base of Shafi’s left upright while substitute Jackson Irvine headed wide three minutes later. Australia continued to push and Shafi was forced into action in the final seconds of the game as Jordan recorded a historic result.
Syria vs Palestine
Omar Al Somah’s run down the left caught Palestine off guard and his cross found Omar Kharbin in the area who fired his effort wide. Syria almost took the lead after seven minutes, when Palestine custodian Rami Hamadeh lost the ball in the area only for Kharbin to see his close-range effort cleared off the line by Abdullah Jaber. Syria continued to pile the pressure on Palestine as Hamadeh was called into action in the 29th minute when he produced an acrobatic save to deny Kharbin's header. Syria then suffered a blow in the 39th minute when Osama Omari was stretchered off the pitch after picking up an injury and replaced by Youssef Kalfa. With a minute left in the half, Syria were given another opportunity but Al Somah couldn’t convert his free-kick as the score remained 0–0 at half-time. Palestine went down to 10 men after Mohammed Saleh picked up his second yellow card in the 68th minute. However, Syria failed to capitalise on their one-man advantage, and both the teams settled for a share of the points.
Jordan vs Syria
The opener came in the 26th minute when Yaseen Al-Bakhit cut the ball back from the left to Yousef Al-Rawashdeh and his low driven centre was steered home at pace by Musa Al-Taamari. Three minutes later Jordan came close to score their second as Al-Bakhit found Al-Taamari, only for his effort to bounce off the turf before clearing the crossbar. The second goal came two minutes before the interval, Baha' Abdel-Rahman’s short corner to Al-Taamari was whipped into the area and Tareq Khattab held off the Syrian defence to head home at the near post. Omar Kharbin headed just over the bar five minutes after the restart before shooting straight at Amer Shafi six minutes later. Kharbin was involved again in the 71st minute as the Jordanian defence made an error to gift him the ball 25 yards from goal, but this time Shafi was on hand to save, doing just enough to divert his shot wide of the left post. Jordan came close to score late as both Saeed Murjan and Ahmad Ersan narrowly missed. The Syrian coach Bernd Stange was sacked after this match, and replaced with former manager Fajr Ibrahim.
Palestine vs Australia
Jamie Maclaren headed in from Tom Rogic's cross to score his first international goal and give the holders a 1–0 lead in the 18th minute. Two minutes later, Australia doubled their lead when Awer Mabil found his way in behind the defence to side-foot home an angled pass from Chris Ikonomidis. Mabil was teed up by Maclaren in the dying moments of the first half, only for the winger to blaze his effort high and wide from close range. An attempted 54th-minute cross from Rhyan Grant caught the woodwork after a heavy deflection off Abdullah Jaber, while Palestine's Musab Al-Battat made a defensive intervention moments later. Australia sealed their win in the 90th minute, with substitute Apostolos Giannou rising high to head home an Ikonomidis cross following an Australian set-piece.
Australia vs Syria
Chris Ikonomidis found the hands of Ibrahim Alma with his long range attempt before the Syrian keeper twice denied Jamie Maclaren. In the 41st minute, Awer Mabil's curling strike arced its way inside the keeper’s right post. The lead was to last less than two minutes, however, as Moayad Ajan seared down the left flank beyond Rhyan Grant and sent in a cross that Omar Kharbin headed goalward. Mathew Ryan made the initial save, but Kharbin converted the rebound. Nine minutes after the restart, Australia were back in front. Tom Rogic’s ball from the left slid past Hussein Jwayed to land at the feet of Ikonomidis, who steered his effort over the line. Substitute Apostolos Giannou then hit the post 15 minutes from time, and five minutes later Syria were level after the referee pointed to the spot and Omar Al Somah converted. Three minutes into added time, Rogic gave Australia the win after he scored with an effort from distance. For Syria, this defeat meant they had not progressed from the group stage for the sixth consecutive AFC Asian Cup.
Palestine vs Jordan
Palestine came close to breaking the deadlock in the 17th minute when Amer Shafi produced a fingertip save to keep out Abdelatif Bahdari’s flicked attempt from a Tamer Seyam corner. Baha' Abdel-Rahman then flashed a shot inches over the bar from distance, before, in the final moments of the first half, Shafi punched clear with striker Mahmoud Wadi lurking. Six minutes after the restart, Oday Dabbagh failed to find the target with a header from Musab Al-Battat’s delivery. Moments later, Bahdari’s header from another Seyam set-piece was gathered on his line by Shafi, and Ahmad Ersan’s 68th minute shot at the other end was saved by Rami Hamadeh.
Discipline
Fair play points were used as tiebreakers if the head-to-head and overall records of teams were tied (and if a penalty shoot-out was not applicable as a tiebreaker). These were calculated based on yellow and red cards received in all group matches as follows:
yellow card = 1 point
red card as a result of two yellow cards = 3 points
direct red card = 3 points
yellow card followed by direct red card = 4 points
Only one of the above deductions was applied to a player in a single match.
References
External links
Group B
2019 in Australian soccer
2018–19 in Syrian football
2018–19 in Jordanian football
2018–19 in Palestinian football
|
```cmake
# - Try to find Libsmbclient
# Once done this will define
#
# LIBSMBCLIENT_FOUND - system has Libsmbclient
# LIBSMBCLIENT_INCLUDE_DIRS - the Libsmbclient include directory
# LIBSMBCLIENT_LIBRARIES - Link these to use Libsmbclient
# LIBSMBCLIENT_DEFINITIONS - Compiler switches required for using Libsmbclient
#
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (LIBSMBCLIENT_LIBRARIES AND LIBSMBCLIENT_INCLUDE_DIRS)
# in cache already
set(LIBSMBCLIENT_FOUND TRUE)
else (LIBSMBCLIENT_LIBRARIES AND LIBSMBCLIENT_INCLUDE_DIRS)
find_path(LIBSMBCLIENT_INCLUDE_DIR
NAMES
libsmbclient.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
PATH_SUFFIXES
samba-4.0
samba4
)
find_library(SMBCLIENT_LIBRARY
NAMES
smbclient
PATH_SUFFIXES
samba-4.0
samba4
)
if (SMBCLIENT_LIBRARY)
set(SMBCLIENT_FOUND TRUE)
endif (SMBCLIENT_LIBRARY)
set(LIBSMBCLIENT_INCLUDE_DIRS
${LIBSMBCLIENT_INCLUDE_DIR}
)
if (SMBCLIENT_FOUND)
set(LIBSMBCLIENT_LIBRARIES
${LIBSMBCLIENT_LIBRARIES}
${SMBCLIENT_LIBRARY}
)
endif (SMBCLIENT_FOUND)
if (LIBSMBCLIENT_INCLUDE_DIRS AND LIBSMBCLIENT_LIBRARIES)
set(LIBSMBCLIENT_FOUND TRUE)
endif (LIBSMBCLIENT_INCLUDE_DIRS AND LIBSMBCLIENT_LIBRARIES)
# if (LIBSMBCLIENT_FOUND)
# if (NOT Libsmbclient_FIND_QUIETLY)
# message(STATUS "Found Libsmbclient: ${LIBSMBCLIENT_LIBRARIES}")
# endif (NOT Libsmbclient_FIND_QUIETLY)
# else (LIBSMBCLIENT_FOUND)
# if (Libsmbclient_FIND_REQUIRED)
# message(FATAL_ERROR "Could not find Libsmbclient")
# endif (Libsmbclient_FIND_REQUIRED)
# endif (LIBSMBCLIENT_FOUND)
# show the LIBSMBCLIENT_INCLUDE_DIRS and LIBSMBCLIENT_LIBRARIES variables only in the advanced view
mark_as_advanced(LIBSMBCLIENT_INCLUDE_DIRS LIBSMBCLIENT_LIBRARIES)
endif (LIBSMBCLIENT_LIBRARIES AND LIBSMBCLIENT_INCLUDE_DIRS)
```
|
Bruno Valencony (born 16 June 1968) is a French former professional footballer who played as a goalkeeper.
Honours
Nice
Coupe de France: 1997
References
1968 births
Living people
Footballers from Allier
French men's footballers
Men's association football goalkeepers
Ligue 1 players
Ligue 2 players
INF Vichy players
SC Bastia players
OGC Nice players
|
```vue
<template>
<p></p>
</template>
<script>
export default {
data () {
return {
msg: 'Hello from Component A!'
}
}
}
</script>
<style>
comp-a h2 {
color: #f00;
}
</style>
```
|
```protocol buffer
// Since: cosmos-sdk 0.43
syntax = "proto3";
package cosmos.feegrant.v1beta1;
import "gogoproto/gogo.proto";
import "google/protobuf/any.proto";
import "cosmos_proto/cosmos.proto";
import "cosmos/base/v1beta1/coin.proto";
import "amino/amino.proto";
import "google/protobuf/timestamp.proto";
import "google/protobuf/duration.proto";
option go_package = "cosmossdk.io/x/feegrant";
// BasicAllowance implements Allowance with a one-time grant of coins
// that optionally expires. The grantee can use up to SpendLimit to cover fees.
message BasicAllowance {
option (cosmos_proto.implements_interface) = "cosmos.feegrant.v1beta1.FeeAllowanceI";
option (amino.name) = "cosmos-sdk/BasicAllowance";
// spend_limit specifies the maximum amount of coins that can be spent
// by this allowance and will be updated as coins are spent. If it is
// empty, there is no spend limit and any amount of coins can be spent.
repeated cosmos.base.v1beta1.Coin spend_limit = 1 [
(gogoproto.nullable) = false,
(amino.dont_omitempty) = true,
(amino.encoding) = "legacy_coins",
(gogoproto.castrepeated) = "github.com/cosmos/cosmos-sdk/types.Coins"
];
// expiration specifies an optional time when this allowance expires
google.protobuf.Timestamp expiration = 2 [(gogoproto.stdtime) = true];
}
// PeriodicAllowance extends Allowance to allow for both a maximum cap,
// as well as a limit per time period.
message PeriodicAllowance {
option (cosmos_proto.implements_interface) = "cosmos.feegrant.v1beta1.FeeAllowanceI";
option (amino.name) = "cosmos-sdk/PeriodicAllowance";
// basic specifies a struct of `BasicAllowance`
BasicAllowance basic = 1 [(gogoproto.nullable) = false, (amino.dont_omitempty) = true];
// period specifies the time duration in which period_spend_limit coins can
// be spent before that allowance is reset
google.protobuf.Duration period = 2
[(gogoproto.stdduration) = true, (gogoproto.nullable) = false, (amino.dont_omitempty) = true];
// period_spend_limit specifies the maximum number of coins that can be spent
// in the period
repeated cosmos.base.v1beta1.Coin period_spend_limit = 3 [
(gogoproto.nullable) = false,
(amino.dont_omitempty) = true,
(amino.encoding) = "legacy_coins",
(gogoproto.castrepeated) = "github.com/cosmos/cosmos-sdk/types.Coins"
];
// period_can_spend is the number of coins left to be spent before the period_reset time
repeated cosmos.base.v1beta1.Coin period_can_spend = 4 [
(gogoproto.nullable) = false,
(amino.dont_omitempty) = true,
(amino.encoding) = "legacy_coins",
(gogoproto.castrepeated) = "github.com/cosmos/cosmos-sdk/types.Coins"
];
// period_reset is the time at which this period resets and a new one begins,
// it is calculated from the start time of the first transaction after the
// last period ended
google.protobuf.Timestamp period_reset = 5
[(gogoproto.stdtime) = true, (gogoproto.nullable) = false, (amino.dont_omitempty) = true];
}
// AllowedMsgAllowance creates allowance only for specified message types.
message AllowedMsgAllowance {
option (gogoproto.goproto_getters) = false;
option (cosmos_proto.implements_interface) = "cosmos.feegrant.v1beta1.FeeAllowanceI";
option (amino.name) = "cosmos-sdk/AllowedMsgAllowance";
// allowance can be any of basic and periodic fee allowance.
google.protobuf.Any allowance = 1 [(cosmos_proto.accepts_interface) = "cosmos.feegrant.v1beta1.FeeAllowanceI"];
// allowed_messages are the messages for which the grantee has the access.
repeated string allowed_messages = 2;
}
// Grant is stored in the KVStore to record a grant with full context
message Grant {
// granter is the address of the user granting an allowance of their funds.
string granter = 1 [(cosmos_proto.scalar) = "cosmos.AddressString"];
// grantee is the address of the user being granted an allowance of another user's funds.
string grantee = 2 [(cosmos_proto.scalar) = "cosmos.AddressString"];
// allowance can be any of basic, periodic, allowed fee allowance.
google.protobuf.Any allowance = 3 [(cosmos_proto.accepts_interface) = "cosmos.feegrant.v1beta1.FeeAllowanceI"];
}
```
|
Epizod (Bulgarian: Епизод) is a Bulgarian heavy metal band formed in 1983 in Sofia. The first songs of the band were inspired by the French poet François Villon. Epizod are famous in Bulgaria for their concerts which include theatre, an Orthodox church choir, and an ensemble for Bulgarian folk songs and dances.
History
1980s–1993
Since 1983 different musicians from the 'Emil Shekerdzhiyski' culture club in Sofia had played different music styles under the name 'Epizod. At that time the drummer was Panayot Kerelezov. When Rosen Doychinov (keyboards) and Miroslav Galabov (guitar) joined him and began to write their first original songs on lyrics by François Villon with the help of Simeon Hristov (bass guitar) who joined later the actual rock and metal band had its direction. They only needed a lead singer and so in 1989 Dimitar Argirov (then a student in the Medical University, Sofia) was found. It was going to be their very first album Pray!. Later during a concert it was announced the replacing of P. Kerelezov with new drummer Stoyan Petrov who played the second part of it. In October 1990, the British BBC filmed Epizod's concert at the National Palace of Culture in Sofia. After the change of the political regime in Bulgaria most of the band members emigrated in Western countries (Netherlands, Canada, Italy). Later M. Galabov returned to Bulgaria and together with S. Hristov (who remained in homeland at that time) found new musicians to fill the band: Vasil Kalpachki (vocals), Emil Tasev (drums) and Dragomir Draganov (guitar), who recorded the album together.
Two years later, in 1992 Vasil Kalpachki left them and the group recorded their second album Dead Among the Dead (with lyrics by Charles Baudelaire and François Villon) sung by guitarist M. Galabov. Later in 1993 they disbanded for about 3 years.
1996–2009
In 1996 S. Hristov and Dr. Draganov started work on songs from the album The Time Has Come with lyrics by the French classical poets François Villon and Pierre de Ronsard. They found their new singer Emil Chendov and drummer St. Petrov returned as well. The band toured with various keyboardists. Later E. Chendov briefly left the band and in 1999 they released a new album 'Respect' with singer Nikolay Urumov instead, leaving the previous album unreleased. Respekt featured two songs based on translations of the works of Moliere and Joachim du Bellay, but otherwise contained original material, written by Hristov and Draganov.
In 2000 Emil Chendov returned and the band started to work on The Bulgarian God, an album which is considered to be one of the best in the history of Bulgarian rock. The texts used in the songs are lyrics by the revolutionary poet Hristo Botev and Ivan Vazov. After the release of the first singles of the album The National Television included the song "Haiduks" based on a poem by Hristo Botev in the 2001 New Year's Eve Show. During that time Stoyan Petrov was replaced by the new drummer Hristo Gyosharkov. The album was officially released in 2002 and was one of the most sold albums of the year in Bulgaria. Essential for the success of the album were the voices of the guest folklore singers- father Andon, Daniela Velichkova, Kristina Yaneva as well as St.John Kukuzelis Choir.
In 2003 Epizod released the previously recorded album The Time Has Come. In 2004 they released Male songs. By the end of 2004 Epizod released the so-called rock opera (actually a conceptual album) Saint Patriarch Evtimiy. The promotional concert in Veliko Turnovo was held exactly where the events described in the album took place – at Tsarevets Castle, the reconstructed palace of the medieval Bulgarian tsars. The concert was filmed and later released on a DVD. The band appeared clad in armour, the show included a folklore dance ensemble, a church choir, Bulgarian folklore songs and the performance of the virtuoso Rosen Genkov who plays the ancient string instrument gadulka (Bulgarian: гъдулка) – a kind of Bulgarian rebec. In 2006 Epizod released the album Our Roots with the image of the Madara Rider on the front cover. Since 1 January 2007 Bulgaria is a member of the European Union. On 3 January 2007 BBC announced Epizod as 'the most qualitative Bulgarian rock band'.
In 2008 the band released the album The Old Warrior.
2009–2010s
In April 2009 Epizod parted from the guitarist Dragomir Draganov and the bassist Simeon Hristov found a replacement in the person of Vasil Belezhkov (student in the National Music Academy 'Prof. Pancho Vladigerov' – Sofia) just a few days before their next concert. At first Vasil joins only as a guest musician just to cover the concerts till the end of Juny 2009 but in the meantime he accepts the offer of the band to become a member and to take part in the next album of Epizod. In December 2009 the keyboardist Delyan Georgiev (who is professional cameraman and participates in a film by Luc Besson) left the band and Vasil Belezhkov continued to work as keyboardist as well as guitarist. In the summer of 2010 the drummer Stoyan Petrov returned for a while in Epizod. In that time (July 2010 – January 2011) the band had concerts with various guest drummers – Stoyan Petrov, Hristo Gyosharkov, Ivan Tsonkov and Georgi Varamezov.
In October 2010 the album The people of Dulo was released. This album coincides with the 20th anniversary of Epizod and here take part some of the most famous rock singers in Bulgaria – Zvezdomir Keremidchiev from Ahat and Yordan Karadzhov from Signal as well as the young singer Filip Brashkov. There is also a guest composer – the music and lyrics of the first and the last songs are by Alexander Alexiev-Hoffart who is an artist and the cover of the album is a fragment from a historical picture painted by him. The picture represents Khan Kubrat – founder and ruler of Old Great Bulgaria from the Dulo clan sitting in his throne with his sons around him.
In January 2011 the young drummer Deyan Aleksandrov joined Epizod as a member of the band. In October 2012 the band finished the records on their album My prayer (the title song is based on the eponymous poem by Hristo Botev). It incorporates the typical for the group elements like Bulgarian folklore music, orthodox church singing and heavy metal. In this album take apart the folklore singers Iliya Lukov and Daniela Velichkova, the violinist Nikola Vaklinov and the kaval player Kiril Belezhkov (the younger brother of the guitarist Vasil), as well as Zvezdi, the aforementioned singer of rock band 'Ahat'. In this album Vasil Belezhkov manifests also as a composer/songwriter (the song "Father's advice" on the eponymous poem by Stefan Stambolov) and tambourist (the song from Pirin region "Elenko mome" sung by Iliya Lukov). Besides poems by Botev and Stambolov the album includes songs based on poems by the Russian poets Alexander Pushkin and Vladimir Vysotsky and one of the songs is with lyrics by the bassist Simeon Hristov. In the same year the first novel by Simeon Hristov – 'The treasure of Shishman' was released.
In 2016 Deyan Aleksanrov left the band and they toured with different guest musicians. In 2017 was released the album of Viktoriya Milanova (who was 11-years old Bulgarian girl at that time) and Epizod called I am Bulgarian. In the autumn of 2017 the drummer Hristo Gyosharkov rejoined Epizod and the band made a trip to Ukraine together with him and the family of Viktoriya. They participated in a concert held at the place where the Pereshchepina Treasure of the Bulgarian ruler Kubrat was found.
In the spring of 2018 three of the band members together with three guest performers presented in front of public the drama called Rock Theater 'Asparuh – the Battle of Ongal' written by Simeon Hristov. In this project the same performers play the theatrical roles, sing the songs and play the instruments. The text was based on the very new researches about the Bulgarian medieval history, religion, state organisation and relations with the Eastern Roman Empire. Later in the same year the band recorded their new songs with the singer Simeon Angelov who performs the role of Asparuh in the aforementioned rock theater and who is deputy director of a school in Sofia as well as a singer in an orthodox church choir. The new songs together with two of the already recorded songs – 'The laws of Krum', and 'The city of Asen' become part of the album The great rulers which is dedicated entirely to the Bulgarian medieval rulers (Tervel, Omurtag, Simeon, Samuil, Kaloyan, etc.)
In October 2020, Chendov was diagnosed with asthma, and had to leave Epizod in order to get treatment. The group briefly deputised Argirov to return to the vocals in his stead.
2023 saw the release of two greatest hits albums, Metalni dushi (Metal Souls) and Obich za Bulgaria (Love for Bulgaria), containing 37 tracks from between the two albums, culled from the band's discography over the past 20 years.
Membership
Members
Emil Chendov – vocals
Simeon Angelov – vocals
Simeon Hristov – bass guitar, backing vocals, drum programming, songwriter, producer
Vasil Belezhkov – guitars, keyboards, tambura, backing vocals, songwriter
Hristo Gyosharkov – drums
Former members
Panayot Kerelezov – drums
Rosen Doychinov – keyboards, songwriter
Miroslav Galabov – guitars, backing vocals, songwriter
Dimitar Argirov (Dimmi Argus) – vocals
Vasil Rangelov Kalpachki – vocals
Dragomir Draganov – guitars, backing vocals, songwriter
Emil Tasev – drums
Yavor Aleksandrov – drums
Nikolay Urumov- vocals
Stoyan Petrov – drums
Ivo Georgiev (musician) – keyboards
Pavlin Bachvarov – keyboards
Delyan Georgiev – keyboards
Deyan Aleksandrov – drums
Guest musicians
Daniela Velichkova – folk singer
Kristina Yaneva – folk singer
Viktoriya Milanova – vocals
Iliya Lukov – folk singer
Kiril Yanev – vocals
Zvezdomir Keremidchiev – vocals
Yordan Karadzhov – vocals
Filip Brashkov – vocals
Alexander Alexiev-Hoffart – backing vocals
Andon Petrov – backing vocals
Ivan Lechev – backing vocals
Ivaylo Kraychovski – backing vocals
Vladimir Mitin – trumpet
Petyo Mitin – accordion
Angel Andonov – keyboards
Nikola Vaklinov – violin
Rosen Genkov – gadulka
Nonyo Hristov – kaval
Kiril Belezhkov – kaval
Borislav Kyosev – bagpipes
Martin Lyamov – bagpipes
'In Sacris' vocal ensemble (Boryana Naydenova – conductor)
Timeline
Discography
Mолете се... / Pray (1992)
Мъртвец сред Мъртъвци / Dead Among The Dead (1993)
Респект / Respect (1999)
Българският Бог / The Bulgarian God (2002)
Дошло е време / The Time Has Come (2003)
Мъжки песни / Songs of Men (2004)
Свети патриарх Евтимий / St. Patriarch Evtimii (2004)
Нашите корени / Our Roots (2006)
Старият Войн / The Old Soldier (2008)
Народът на Дуло / The people of Dulo (2010)
Моята Молитва / My Prayer (2012)
Аз съм българче / I am Bulgarian (2017)
Великите владетели / The great rulers (2019)
References
Epizod tour 2012 info (In Bulgarian)
Epizod: Patriotism is simply love – Interview with Epizod (In Bulgarian)
Interview (In Bulgarian)
Article in the Bulgarian newspaper "Smolyan"
Epizod with open letter to the Bulgarian media
Biography of Epizod
External links
Official site of Epizod
Epizod at Bulgarian Rock Archives
Metal storm profile
Musical quintets
Bulgarian heavy metal musical groups
Bulgarian rock music groups
1983 establishments in Bulgaria
Musical groups established in 1983
Culture in Sofia
|
Niedermodern is a commune in the Bas-Rhin department in Grand Est in north-eastern France.
See also
Communes of the Bas-Rhin department
References
Communes of Bas-Rhin
|
The Karate Kid Part III is a 1989 American martial arts drama film, the third entry in the Karate Kid franchise and a sequel to The Karate Kid Part II (1986). It stars Ralph Macchio, Pat Morita, Robyn Lively, and Thomas Ian Griffith in his film debut. As was the case with the first two films in the series, it was directed by John G. Avildsen and written by Robert Mark Kamen, with stunts choreographed by Pat E. Johnson and music composed by Bill Conti. In the film, the returning John Kreese, with the help of his best friend Terry Silver, attempts to gain revenge on Daniel and Mr. Miyagi which involves hiring a ruthless martial artist and harming their relationship.
Though moderately successful at the box office, The Karate Kid Part III received generally negative reviews, with criticism aimed at its rehashing of elements found in its two predecessors, though Griffith's performance as Silver received praise from some critics. It was followed by The Next Karate Kid in 1994.
Plot
John Kreese, broke and destitute following the events of The Karate Kid and The Karate Kid Part II, visits his friend Terry Silver, a now-wealthy Vietnam War comrade. Silver vows to personally help him get revenge on Daniel LaRusso and Mr. Miyagi, and to re-establish Cobra Kai. Sending Kreese to Tahiti for a vacation, Silver hires Mike Barnes - a national karate champion, known for his vicious personality and utter lack of sportsmanship - to challenge Daniel at the next AVT (that is, All-Valley Tournament).
Returning to Los Angeles from Okinawa, Daniel and Miyagi discover that the South Seas apartment complex has been sold and demolished; this leaves Miyagi unemployed and Daniel homeless. Daniel moves in with Miyagi, while Daniel's mother Lucille nurses an ill uncle back in New Jersey. Daniel uses his college funds to finance a bonsai shop for Miyagi, who gratefully makes him a partner in the business.
Silver introduces himself to Daniel and Miyagi as Kreese's service buddy. He tells them that Kreese has passed away, and apologizes on his friend's behalf.
Visiting a pottery store across the street from "Mr. Miyagi's Little Trees", Daniel befriends the sole employee - Jessica Andrews, whose aunt owns the store. Jessica agrees to a date that same night. During the date, Daniel learns that Jessica is visiting from Columbus, Ohio where she already has a boyfriend. She and Daniel remain cordial.
Along with Silver's goons Dennis and Snake, Barnes harasses Daniel and Jessica. They wreck Miyagi's shop, from which they steal the entire stock of bonsai trees. Daniel and Jessica decide to dig up and sell a valuable bonsai, which Miyagi brought from Okinawa, in order to replace the missing trees. Suddenly, Barnes and his henchmen appear. They force Daniel to sign up for the AVT, by retracting his and Jessica's climbing-ropes. Daniel accepts Silver's offer to train him for the AVT, after Miyagi refuses to do so on principle.
At the Cobra Kai dojo, Daniel is subjected to a brutal training regimen which leaves him bruised and bloody, and which alienates him from Miyagi. It also leads Daniel to violently attack a stranger who was bribed by Silver to provoke him. Daniel makes amends with Jessica as she prepares to go home. She encourages him to patch things up with Miyagi, which he does.
Returning to the Cobra Kai dojo, Daniel informs Silver that he's changed his mind about competing in the AVT. Silver discards his ruse and brings out Barnes to attack Daniel, whose escape is blocked by Kreese. Miyagi suddenly shows up to fight Barnes, Kreese, and Silver. He effortlessly defeats all three, and agrees to train Daniel for the tournament.
At the AVT, Silver reveals his plan to re-establish Cobra Kai as a business franchise. After Barnes steamrolls his way to the finals, Silver instructs him to make Daniel "experience pain and fear" by alternately scoring points and losing them via illegal strikes. The final match ends in a draw, necessitating sudden death overtime. Severely pummeled, Daniel wants to quit. But Miyagi urges him onward, saying Daniel's best karate is still inside him. Daniel takes this advice and continues, performing the kata. He scores on Barnes to win the AVT, foiling Silver's revival of Cobra Kai.
Cast
Production
Robert Mark Kamen had originally wanted The Karate Kid Part III to be a prequel with the two main leads still involved. The original plot would have involved Daniel and Mr. Miyagi traveling to 16th century China in a dream and meeting Miyagi's ancestors. Kamen envisioned the sequel to resemble a Hong Kong-style Wuxia film, and would also have a female protagonist. However, the producers balked at the idea and Kamen was reluctant on rehashing "the same story all over again"; he only returned after the studio agreed to pay him substantially more.
After Robyn Lively was cast as Jessica Andrews in The Karate Kid Part III in 1988, producers were forced to modify her role of protagonist Daniel LaRusso's new love interest because Lively was only 16 at the time of filming and still a minor, while Ralph Macchio was 27 (although his character Daniel is 17). This situation caused romantic scenes between Jessica and Daniel to be rewritten so that the pair only developed a close friendship. Although he plays a Vietnam veteran who is roughly 20 years older than Daniel, Griffith is actually a few months younger than Macchio.
John Kreese was initially intended to have a larger role in the film, but due to Martin Kove's filming schedule conflicts with Hard Time on Planet Earth, the character of Terry Silver was written into the script.
The film featured the same crew from the first two films, except for two key people: executive producer R.J. Louis, who was replaced by Sheldon Schrager, and cinematographer James Crabe, who was forced to pull out due to the AIDS virus making him severely ill at the time, was replaced by Steve Yaconelli. On May 2, 1989, Crabe died from AIDS at the age of 57; the film was dedicated to his memory.
Release
The film was released in the United States on June 30, 1989. In the Philippines, the film was released on September 6.
Critical reception
On Rotten Tomatoes, the film holds an approval rating of 15% based on 33 reviews and an average rating of 3.8/10. The website's critics consensus reads: "Inspiration is in short supply in this third Karate Kid film, which recycles the basic narrative from its predecessors but adds scenery-chewing performances and a surprising amount of violence". On Metacritic, the film has a weighted average score of 36 out of 100, based on 12 critics, indicating "generally unfavorable reviews". Audiences polled by CinemaScore gave the film an average grade of "B−" on an A+ to F scale.
Roger Ebert, who praised the first two films, did not enjoy Part III. His colleague, Gene Siskel, also did not recommend the film, though he commended the performance of Thomas Ian Griffith, which he thought was nearly enough to save it. Critic Kevin Thomas of the Los Angeles Times stated that "writer Robert Mark Kamen gave director Avildsen and his cast too little to work with".
Caryn James of The New York Times was critical of the lack of character development for the film's protagonist, saying that he "has aged about a year in movie time and hasn't become a day smarter" and criticized the film for having "the rote sense of film makers trying to crank out another moneymaker".
A 2008 DVD review of the film from Scott Weinberg of the website JoBlo said it was the installment of the series "where the wheels started to come off", remarking that it "approaches the Karate Kid formula as if it's the world's last home-cooked meatloaf", deriding the "cartoonishness" of the villains, and saying that "it all feels cynical and hollow...which is NOT the vibe we still get from Part 1". Reviewing a 2001 UK DVD of the film, Almar Haflidason of the BBC praised the disc's picture and sound quality, but dismissed the film as a "desperate continuation of The Karate Kid franchise [which] shudders to a pathetic halt" and criticized its loss of "any warmth of the previous two films".
In 2015, director John G. Avildsen called the film "a horrible imitation of the original...hastily written and sloppily rewritten", adding that it "will baffle those who haven't seen the first two (movies) and insult those who have". Ralph Macchio was also disappointed with the film, stating that he "just felt for the LaRusso character he never went forward" and that when doing The Karate Kid Part III it "felt like we were redoing the first movie in a cartoon kind of a sense without the heart and soul".
The Karate Kid Part III was nominated for 5 Razzies at the 1989 Golden Raspberry Awards: Worst Picture (Jerry Weintraub); Worst Screenplay (Robert Mark Kamen); Worst Director (John G. Avildsen); Worst Actor (Macchio) and Worst Supporting Actor (Pat Morita).
References
External links
Official trailer
The Karate Kid and Cobra Kai - Reunited Apart, December 21, 2020
1989 films
1989 drama films
1989 martial arts films
1980s American films
1980s action drama films
1980s coming-of-age drama films
1980s English-language films
1980s teen drama films
American coming-of-age drama films
American films about revenge
American martial arts films
American sequel films
American teen drama films
Columbia Pictures films
Films about bullying
Films directed by John G. Avildsen
Films with screenplays by Robert Mark Kamen
Films scored by Bill Conti
Films set in 1985
Films set in the San Fernando Valley
Films shot in Los Angeles
Karate films
Martial arts tournament films
The Karate Kid (franchise) films
|
Emmett Williams (4 April 1925 – 14 February 2007) was an American poet and visual artist. He was married to British visual artist Ann Noël.
Williams was born in Greenville, South Carolina, grew up in Virginia, and lived in Europe from 1949 to 1966. Williams studied poetry with John Crowe Ransom at Kenyon College, anthropology at the University of Paris, and worked as an assistant to the ethnologist Paul Radin in Switzerland.
As an artist and poet, Emmett Williams collaborated with Daniel Spoerri and German poet Claus Bremer in the Darmstadt circle of concrete poetry from 1957 to 1959. One of his notable pieces from this period is "Four-Directional Song of Doubt for Five Voices" (1957), in which five performers are each assigned one word of the phrase "You just never quite know", and say their word according to a grid on a card, keeping together with the beat of a metronome: when a black circle appears on the grid, the performer speaks the word, and when no circle appears they say nothing. In the resulting performance, the core phrase "you never quite know" is overshadowed by other combinations of words, such as "you know" and "quite just".
In the 1960s, Williams was the European coordinator of Fluxus and worked closely with French artist Robert Filliou, and a founding member of the Domaine Poetique in Paris, France. Williams was friends with Václav Havel during his dissident years' he translated some of Havel's work into English. Williams was a guest artist in residence teaching at Mount Holyoke College from September 1975 to June 1976.
Williams' theater essays appeared in Das Neue Forum, Berner Blatter, Ulmer Theater, and other European magazines. He translated Daniel Spoerri's Topographie Anecdotee du Hasard (An Anecdoted Topography of Chance), collaborated with Claes Oldenburg on Store Days, and edited An Anthology of Concrete Poetry, all published by the Something Else Press, which was owned and managed by fellow Fluxus artist Dick Higgins. From the mid-1960s through the early 1970s Williams was Editor in Chief of the Something Else Press.
In 1991, Williams published an autobiography, My Life in Fluxus - And Vice Versa, published by Edition Hansjörg Mayer, Stuttgart, and reprinted the next year by Thames and Hudson.
In 1996, he was honored for his life work with the Hannah-Höch-Preis. He died in Berlin in 2007.
In 2014, Edition Zédélé published a reprint of SOLDIER (Reprint Collection, curated by Anne Moeglin-Delcroix and Clive Phillpot), first published in A Valentine for Noel (1973) by Something Else Press and Hansjörg Mayer.
References
Notes
External links
Archivio Conz
Emmett Williams at VIRTUALITAS
Emmett Williams Interview
Emmett Williams at UBUWEB
Emmett Williams, RIP
1925 births
2007 deaths
Writers from Greenville, South Carolina
Fluxus
Kenyon College alumni
University of Paris alumni
American contemporary artists
American conceptual artists
20th-century American poets
|
```vue
<template>
<div class="vux-week-calendar">
<slot name="header" :current-month="currentMonth"></slot>
<swiper
class="vux-week-calendar"
v-model="index"
:show-dots="false"
:height="height"
@on-index-change="onIndexChange"
loop>
<template v-for="(item, index) in [lastWeekList, currentWeekList, nextWeekList]">
<swiper-item :data-start="item[0].format" :id="`x000${index}`">
<slot :name="`header-day-list-${index}`">
<flexbox :gutter="0">
<flexbox-item
class="vux-week-calendar-day-item"
v-for="(i, index) in ['', '', '', '', '', '', '']"
:key="index">
{{ i }}</flexbox-item>
</flexbox>
</slot>
<flexbox :gutter="0">
<flexbox-item
class="vux-week-calendar-date-item"
@click.native="onClick(i)"
:class="{
'is-weekend': i.isWeekend,
'vux-week-calendar-is-today': i.isToday,
'vux-week-calendar-is-selected': i.format === value
}"
v-for="(i, itemIndex) in item"
:key="itemIndex"
:data-date="i.format">
<div class="vux-week-calendar-each-day-box">
<slot
:name="`each-item-${index}`"
:str="i.str"
:formatedDate="i.format"
:is-weekend="i.isWeekend"
:is-today="i.isToday"
:is-selected="i.format === value"
>
<span class="vux-week-calendar-each-day" :style="getMarkStyle(i)">
{{ i.str }}
<span class="vux-week-calendar-top-tip" v-if="isShowTopTip(i)" :style="isShowTopTip(i, 'style')">
<span>{{ isShowTopTip(i, 'text') }}</span>
</span>
</span>
<span class="vux-calendar-dot" v-show="isShowBottomDot(i)"></span>
</slot>
</div>
</flexbox-item>
</flexbox>
</swiper-item>
</template>
</swiper>
</div>
</template>
<script>
import { Flexbox, FlexboxItem } from '../flexbox'
import { Swiper, SwiperItem } from '../swiper'
import dateFormat from '../../tools/date/format'
import calendarMarksMixin from '../../mixins/calendar-marks'
/**
import { Flexbox, FlexboxItem, Swiper, SwiperItem, dateFormat } from 'vux'
**/
const getNextIndex = (index) => {
if (index === 2) {
return 0
}
if (index === 0) {
return 1
}
return 2
}
const getPrevIndex = index => {
if (index === 2) {
return 1
}
if (index === 1) {
return 0
}
if (index === 0) {
return 2
}
}
const indexMap = {
0: 'last',
1: 'current',
2: 'next'
}
export default {
mixins: [calendarMarksMixin],
components: {
Swiper,
SwiperItem,
Flexbox,
FlexboxItem
},
props: {
value: String,
height: {
type: String,
default: '65px'
},
marks: {
type: Array,
default () {
return []
}
}
},
created () {
[0, 7, -7].forEach(item => {
this.getThisWeekRange(item)
})
},
mounted () {
this.index = 1
},
watch: {
value (val) {
this.currentValue = val
this.changeData(null, this.index, val)
},
currentValue (val) {
this.$emit('input', val)
this.$emit('on-change', val)
},
currentMonth (val) {
const value = this.currentMonth.split('-')
const data = {
year: value[0],
month: value[1]
}
this.$emit('on-year-month-change', data)
}
},
data () {
return {
currentValue: this.value,
index: 0,
lastWeekList: [],
currentWeekList: [],
nextWeekList: [],
startDate: dateFormat(new Date(), 'YYYY-MM-DD'),
currentMonth: '',
changeCount: -1,
hasRender: false
}
},
methods: {
switchViewToCurrentValue () {
if (this.currentValue) {
this.changeData(null, this.index, this.currentValue)
}
},
switchViewToMonth (year, month) {
this.changeData(null, this.index, `${year}-${month}-01`)
},
switchViewToToday () {
const today = dateFormat(new Date(), 'YYYY-MM-DD')
this.changeData(null, this.index, today)
},
onClick (i) {
this.currentValue = i.format
},
onIndexChange (newIndex) {
let el = document.querySelector('#x000' + newIndex)
const start = el.getAttribute('data-start')
const date = new Date(start)
this.changeData(date, newIndex)
},
changeData (date, index, value) {
// if has value, reset start
if (value) {
const _date = new Date(value.replace(/-/g, '/'))
date = new Date(_date.setDate(_date.getDate() - _date.getDay()))
this[indexMap[index] + 'WeekList'] = this.getWeekRange(new Date(date.setDate(date.getDate())))
}
this.startDate = dateFormat(date, 'YYYY-MM-DD')
const lastMonth = dateFormat(date.getTime() + 6 * 24 * 3600 * 1000, 'YYYY-MM')
this.currentMonth = lastMonth
const nextIndex = getNextIndex(index)
const nextKey = indexMap[nextIndex]
this[nextKey + 'WeekList'] = this.getWeekRange(new Date(date.setDate(date.getDate() + 7)))
const lastIndex = getPrevIndex(index)
const lastKey = indexMap[lastIndex]
this[lastKey + 'WeekList'] = this.getWeekRange(new Date(date.setDate(date.getDate() - 14)))
this.$nextTick(() => {
this.changeCount++
this.$emit('on-view-change', {
allDates: this[indexMap[this.index] + 'WeekList']
}, this.changeCount)
})
},
getCurrentDates () {
return this[indexMap[this.index] + 'WeekList']
},
getCurrentYearMonth () {
const value = this.currentMonth.split('-')
return {
year: value[0],
month: value[1]
}
},
isToday (date) {
return dateFormat(date, 'YYYY-MM-DD') === dateFormat(new Date(), 'YYYY-MM-DD')
},
isSelected (date) {
return dateFormat(date, 'YYYY-MM-DD') === this.date
},
isWeekend (date) {
return date.getDay() === 0 || date.getDay() === 6
},
getWeekRange (start) {
let rs = [{
format: dateFormat(start, 'YYYY-MM-DD'),
formatedDate: dateFormat(start, 'YYYY-MM-DD'),
date: start,
str: dateFormat(start, 'D'),
isWeekend: this.isWeekend(start),
isToday: this.isWeekend(start),
isSelected: this.isSelected(start),
_date: start.getDate()
}]
for (let i = 1; i < 7; i++) {
let current = start
current.setDate(current.getDate() + 1)
rs.push({
format: dateFormat(current, 'YYYY-MM-DD'),
date: current,
str: dateFormat(current, 'D'),
formatedDate: dateFormat(current, 'YYYY-MM-DD'),
isWeekend: this.isWeekend(current),
isToday: this.isToday(current),
isSelected: this.isSelected(current),
_date: current.getDate()
})
}
return rs
},
getThisWeekRange (day = 0, start) {
const now = start || new Date()
const firstday = new Date(now.setDate(now.getDate() - now.getDay() + day))
if (day === 0) {
this.currentWeekList = this.getWeekRange(firstday)
}
if (day === 7) {
this.nextWeekList = this.getWeekRange(firstday)
}
if (day === -7) {
this.lastWeekList = this.getWeekRange(firstday)
}
}
}
}
</script>
<style lang="less" scoped>
@import '../../styles/variable.less';
.vux-week-calendar {
background-color: @week-calendar-bg;
}
.vux-week-calendar-day-item, .vux-week-calendar-date-item {
text-align: center;
}
.vux-week-calendar-day-item {
color: @week-calendar-header-day-item-color;
}
.vux-week-calendar-each-day-box {
padding: 5px 0;
}
.vux-week-calendar-each-day-box {
position: relative;
}
.vux-week-calendar-each-day {
position: relative;
background-color: transparent;
border: 1px solid transparent;
display: inline-block;
font-size: 16px;
color: @week-calendar-each-date-item-color;
width: @week-calendar-each-date-item-size;
height: @week-calendar-each-date-item-size;
line-height: @week-calendar-each-date-item-line-height;
text-align: center;
border-radius: 50%;
box-sizing: border-box;
}
.vux-week-calendar-is-selected .vux-week-calendar-each-day {
background-color: @week-calendar-selected-item-bg-color;
color: @week-calendar-selected-item-text-color;
}
.vux-calendar-dot {
display: block;
text-align: center;
width: 5px;
height: 5px;
position: absolute;
left: 50%;
bottom: 0px;
margin-left: -2.5px;
background-color: @week-calendar-dot-color;
border-radius: 50%;
}
.vux-week-calendar-top-tip {
position: absolute;
left: -10px;
top: 0;
font-size: 20px;
transform: scale(0.5);
transform-origin: top left;
}
</style>
```
|
```java
/*
* one or more contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright ownership.
*/
package io.camunda.zeebe.engine.processing.variable.mapping;
import static io.camunda.zeebe.test.util.MsgPackUtil.asMsgPack;
import static org.assertj.core.api.Assertions.assertThat;
import static org.assertj.core.api.Assertions.tuple;
import io.camunda.zeebe.engine.util.EngineRule;
import io.camunda.zeebe.model.bpmn.Bpmn;
import io.camunda.zeebe.model.bpmn.BpmnModelInstance;
import io.camunda.zeebe.model.bpmn.builder.ZeebeVariablesMappingBuilder;
import io.camunda.zeebe.model.bpmn.instance.BoundaryEvent;
import io.camunda.zeebe.model.bpmn.instance.IntermediateCatchEvent;
import io.camunda.zeebe.model.bpmn.instance.ReceiveTask;
import io.camunda.zeebe.model.bpmn.instance.StartEvent;
import io.camunda.zeebe.model.bpmn.instance.SubProcess;
import io.camunda.zeebe.protocol.record.Record;
import io.camunda.zeebe.protocol.record.intent.ProcessInstanceIntent;
import io.camunda.zeebe.protocol.record.intent.VariableIntent;
import io.camunda.zeebe.protocol.record.value.BpmnElementType;
import io.camunda.zeebe.protocol.record.value.DeploymentRecordValue;
import io.camunda.zeebe.test.util.record.RecordingExporter;
import io.camunda.zeebe.test.util.record.RecordingExporterTestWatcher;
import java.util.Map;
import java.util.UUID;
import java.util.function.Consumer;
import org.camunda.bpm.model.xml.instance.ModelElementInstance;
import org.junit.ClassRule;
import org.junit.Rule;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.Parameterized;
import org.junit.runners.Parameterized.Parameter;
import org.junit.runners.Parameterized.Parameters;
@RunWith(Parameterized.class)
public final class MessageCatchElementOutputMappingTest {
@ClassRule public static final EngineRule ENGINE_RULE = EngineRule.singlePartition();
private static final String PROCESS_ID = "process";
private static final String MESSAGE_NAME = "message";
private static final String MESSAGE_NAME_2 = "message2";
private static final String CORRELATION_VARIABLE = "key";
private static final String MAPPING_ELEMENT_ID = "catch";
private static final BpmnModelInstance CATCH_EVENT_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.startEvent()
.intermediateCatchEvent(MAPPING_ELEMENT_ID)
.message(m -> m.name(MESSAGE_NAME).zeebeCorrelationKeyExpression(CORRELATION_VARIABLE))
.done();
private static final BpmnModelInstance RECEIVE_TASK_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.startEvent()
.receiveTask(MAPPING_ELEMENT_ID)
.message(m -> m.name(MESSAGE_NAME).zeebeCorrelationKeyExpression(CORRELATION_VARIABLE))
.done();
private static final BpmnModelInstance INTERRUPTING_BOUNDARY_EVENT_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.startEvent()
.serviceTask("task", b -> b.zeebeJobType("type"))
.boundaryEvent(MAPPING_ELEMENT_ID)
.message(m -> m.name(MESSAGE_NAME).zeebeCorrelationKeyExpression(CORRELATION_VARIABLE))
.endEvent()
.done();
private static final BpmnModelInstance NON_INTERRUPTING_BOUNDARY_EVENT_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.startEvent()
.serviceTask("task", b -> b.zeebeJobType("type"))
.boundaryEvent(MAPPING_ELEMENT_ID, b -> b.cancelActivity(false))
.message(m -> m.name(MESSAGE_NAME).zeebeCorrelationKeyExpression(CORRELATION_VARIABLE))
.endEvent()
.done();
private static final BpmnModelInstance EVENT_BASED_GATEWAY_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.startEvent("start")
.eventBasedGateway()
.id("gateway")
.intermediateCatchEvent(
MAPPING_ELEMENT_ID,
c ->
c.message(
m ->
m.name(MESSAGE_NAME).zeebeCorrelationKeyExpression(CORRELATION_VARIABLE)))
.sequenceFlowId("to-end1")
.endEvent("end1")
.moveToLastGateway()
.intermediateCatchEvent("timer", c -> c.timerWithDuration("PT10S"))
.sequenceFlowId("to-end2")
.endEvent("end2")
.done();
private static final BpmnModelInstance INTERRUPTING_EVENT_SUBPROCESS_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.eventSubProcess(
"event-subprocess",
eventSubProcess ->
eventSubProcess
.startEvent(MAPPING_ELEMENT_ID)
.message(
m ->
m.name(MESSAGE_NAME)
.zeebeCorrelationKeyExpression(CORRELATION_VARIABLE))
.interrupting(true)
.serviceTask("task-2", t -> t.zeebeJobType("type"))
.endEvent())
.startEvent()
.serviceTask("task", t -> t.zeebeJobType("type"))
.endEvent()
.done();
private static final BpmnModelInstance NON_INTERRUPTING_EVENT_SUBPROCESS_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.eventSubProcess(
"event-subprocess",
eventSubProcess ->
eventSubProcess
.startEvent(MAPPING_ELEMENT_ID)
.message(
m ->
m.name(MESSAGE_NAME)
.zeebeCorrelationKeyExpression(CORRELATION_VARIABLE))
.interrupting(false)
.serviceTask("task-2", t -> t.zeebeJobType("type"))
.endEvent())
.startEvent()
.serviceTask("task", t -> t.zeebeJobType("type"))
.endEvent()
.done();
private static final BpmnModelInstance INTERRUPTING_BOUNDARY_EVENT_ON_RECEIVE_TASK_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.startEvent()
.receiveTask(
"task",
t ->
t.message(
m -> m.name("other").zeebeCorrelationKeyExpression(CORRELATION_VARIABLE)))
.boundaryEvent(MAPPING_ELEMENT_ID)
.message(m -> m.name(MESSAGE_NAME).zeebeCorrelationKeyExpression(CORRELATION_VARIABLE))
.endEvent()
.done();
private static final BpmnModelInstance NON_INTERRUPTING_BOUNDARY_EVENT_ON_RECEIVE_TASK_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.startEvent()
.receiveTask(
"task",
t ->
t.message(
m -> m.name("other").zeebeCorrelationKeyExpression(CORRELATION_VARIABLE)))
.boundaryEvent(MAPPING_ELEMENT_ID, b -> b.cancelActivity(false))
.message(m -> m.name(MESSAGE_NAME).zeebeCorrelationKeyExpression(CORRELATION_VARIABLE))
.endEvent()
.done();
private static final BpmnModelInstance MESSAGE_START_EVENT_PROCESS =
Bpmn.createExecutableProcess(PROCESS_ID)
.startEvent(MAPPING_ELEMENT_ID)
.message(m -> m.name(MESSAGE_NAME).zeebeCorrelationKeyExpression(CORRELATION_VARIABLE))
.endEvent()
.done();
@Rule
public final RecordingExporterTestWatcher recordingExporterTestWatcher =
new RecordingExporterTestWatcher();
@Parameter(0)
public String elementType;
@Parameter(1)
public BpmnModelInstance process;
@Parameter(2)
public boolean createInstance;
private String correlationKey;
@Parameters(name = "{0}")
public static Object[][] parameters() {
return new Object[][] {
{"intermediate catch event", CATCH_EVENT_PROCESS, true},
{"receive task", RECEIVE_TASK_PROCESS, true},
{"event-based gateway", EVENT_BASED_GATEWAY_PROCESS, true},
{"interrupting boundary event", INTERRUPTING_BOUNDARY_EVENT_PROCESS, true},
{"non-interrupting boundary event", NON_INTERRUPTING_BOUNDARY_EVENT_PROCESS, true},
{"interrupting event subprocess", INTERRUPTING_EVENT_SUBPROCESS_PROCESS, true},
{"non-interrupting event subprocess", NON_INTERRUPTING_EVENT_SUBPROCESS_PROCESS, true},
{
"interrupting boundary event on receive task",
INTERRUPTING_BOUNDARY_EVENT_ON_RECEIVE_TASK_PROCESS,
true
},
{
"non-interrupting boundary event on receive task",
NON_INTERRUPTING_BOUNDARY_EVENT_ON_RECEIVE_TASK_PROCESS,
true
},
{"message start event", MESSAGE_START_EVENT_PROCESS, false}
};
}
@Test
public void shouldMergeMessageVariablesByDefault() {
// given
final var deploymentRecord = deployProcessWithMapping(e -> {});
// when
final long processInstanceKey = triggerProcessInstance(deploymentRecord);
// then
assertThat(
RecordingExporter.variableRecords(VariableIntent.CREATED)
.withScopeKey(processInstanceKey)
.filter(v -> v.getValue().getName().contains("foo"))
.limit(2))
.extracting(Record::getValue)
.extracting(v -> tuple(v.getScopeKey(), v.getName(), v.getValue()))
.hasSize(2)
.containsExactlyInAnyOrder(
tuple(processInstanceKey, "foo", "\"bar\""),
tuple(processInstanceKey, "_foo", "\"bar2\""));
}
@Test
public void shouldMergeMessageVariables() {
// given
final var deploymentRecord = deployProcessWithMapping(e -> {});
// when
final long processInstanceKey = triggerProcessInstance(deploymentRecord);
// then
assertThat(
RecordingExporter.variableRecords(VariableIntent.CREATED)
.withScopeKey(processInstanceKey)
.filter(v -> v.getValue().getName().contains("foo"))
.limit(2))
.extracting(Record::getValue)
.extracting(v -> tuple(v.getScopeKey(), v.getName(), v.getValue()))
.hasSize(2)
.containsExactlyInAnyOrder(
tuple(processInstanceKey, "foo", "\"bar\""),
tuple(processInstanceKey, "_foo", "\"bar2\""));
}
@Test
public void shouldMapMessageVariablesIntoInstanceVariables() {
// given
final var deploymentRecord =
deployProcessWithMapping(
e -> {
e.zeebeOutputExpression("foo", MESSAGE_NAME);
e.zeebeOutputExpression("_foo", MESSAGE_NAME_2);
});
// when
final long processInstanceKey = triggerProcessInstance(deploymentRecord);
// then
assertThat(
RecordingExporter.variableRecords(VariableIntent.CREATED)
.withScopeKey(processInstanceKey)
.filter(v -> v.getValue().getName().contains(MESSAGE_NAME))
.limit(2))
.extracting(Record::getValue)
.extracting(v -> tuple(v.getScopeKey(), v.getName(), v.getValue()))
.hasSize(2)
.containsExactlyInAnyOrder(
tuple(processInstanceKey, MESSAGE_NAME, "\"bar\""),
tuple(processInstanceKey, MESSAGE_NAME_2, "\"bar2\""));
}
private Record<DeploymentRecordValue> deployProcessWithMapping(
final Consumer<ZeebeVariablesMappingBuilder<?>> c) {
final BpmnModelInstance modifiedProcess = process.clone();
final ModelElementInstance element = modifiedProcess.getModelElementById(MAPPING_ELEMENT_ID);
if (element instanceof IntermediateCatchEvent) {
c.accept(((IntermediateCatchEvent) element).builder());
} else if (element instanceof StartEvent) {
c.accept(((StartEvent) element).builder());
} else if (element instanceof BoundaryEvent) {
c.accept(((BoundaryEvent) element).builder());
} else if (element instanceof SubProcess) {
c.accept(((SubProcess) element).builder());
} else {
c.accept(((ReceiveTask) element).builder());
}
return ENGINE_RULE.deployment().withXmlResource(modifiedProcess).deploy();
}
private long triggerProcessInstance(final Record<DeploymentRecordValue> deploymentRecord) {
correlationKey = UUID.randomUUID().toString();
ENGINE_RULE
.message()
.withCorrelationKey(correlationKey)
.withName(MESSAGE_NAME)
.withVariables(asMsgPack(Map.of("foo", "bar", "_foo", "bar2")))
.publish();
if (createInstance) {
return ENGINE_RULE
.processInstance()
.ofBpmnProcessId(PROCESS_ID)
.withVariable(CORRELATION_VARIABLE, correlationKey)
.create();
} else {
return RecordingExporter.processInstanceRecords(ProcessInstanceIntent.ELEMENT_ACTIVATING)
.withProcessDefinitionKey(
deploymentRecord.getValue().getProcessesMetadata().get(0).getProcessDefinitionKey())
.withElementType(BpmnElementType.PROCESS)
.getFirst()
.getKey();
}
}
}
```
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<WixLocalization Culture="nl-nl" xmlns="path_to_url">
<String Id="Locale" Overridable="yes">nl</String>
<String Id="ProductName" Overridable="yes">Aspia Console</String>
<String Id="ShortcutName" Overridable="yes">Aspia Console</String>
<String Id="DowngradeErrorMessage" Overridable="yes">Er is al een nieuwere versie van de applicatie geinstalleerd.</String>
<String Id="AddressBookFile" Overridable="yes">Aspia Adresboek (.aab)</String>
<String Id="CreateDesktopShortcut" Overridable="yes">Maak bureaublad snelkoppelingen</String>
<String Id="CreateProgramMenuShortcut" Overridable="yes">Maak snelkoppelingen in het Start menu</String>
</WixLocalization>
```
|
Club Me is the second EP released as an extra by the American punk rock band The Offspring on January 1, 1997. It was initially only available to fan club members. Copies of it were sometimes sold from their online store.
Club Me is from the Ixnay on the Hombre (1997) era. The picture on the actual CD is a larger version of one of the pictures on the back of Ixnay on the Hombre. None of the tracks on the EP, however, appear on Ixnay on the Hombre or any other Offspring album. This is unlike the previous EPs released by the Offspring (Baghdad, They Were Born to Kill, and A Piece of Americana), which all contained tracks that appeared on other studio albums.
"Smash It Up" was also released as a single on the Batman Forever soundtrack. "D.U.I." was used in "I Know What You Did Last Summer" soundtrack.
Track listing
See also
"Night of Destruction"
"Machine Gun Etiquette"
References
The Offspring EPs
1997 EPs
|
Helen Berhane (born c. 1974) is an Eritrean Christian Gospel singer who was a prisoner in Eritrea.
Life
Berhane is a member of the Rema church, one of several minority Evangelical Christian churches not officially recognized by the state of Eritrea and heavily persecuted. She was arrested on 13 May 2004, shortly after she released an album of Christian music, after refusing to sign a document pledging to end all participation in Evangelical activities, which included her music. She was detained at Mai Serwa military camp, north of the capital Asmara. She had no possibility of contact with her family and was denied legal representation or medical care.
On Eritrean Independence Day, 24 May 2006, Amnesty International renewed their appeal to Eritrea's president Isaias Afewerki to ensure the improvement of human rights standards in the country. Five of the six female prisoners Amnesty International appealed for the release of last year on this date, including Berhane, were still held at the time. They had not been charged with anything nor brought to any court.
Berhane's 2003 album, T' Kebaeku (I Am Anointed), was re-released in Europe in June 2006.
Release
On 2 November 2006 it was reported that Berhane was released from prison in late October 2006, suffering heavy illnesses. She and her daughter Eva were granted asylum in Denmark after fleeing separately to the Sudanese capital of Khartoum for refuge.
UK visa refusal
In 2010, Berhane was refused an entry visa to the UK, even though she had been invited to speak of her experiences of persecution in Eritrea at a series of meetings in Great Britain. An early day motion expressing regret about this decision was supported by 41 out of 41 MPs, none chose to withdraw from voting.
Book
Berhane has written of her experiences in the following book:
Song of the Nightingale, AUTHENTIC PUBLISHING (1 September 2009),
References
External links
Amnesty International report on Berhane's case
BBC Article on Helen Berhane's release in 2006
Information on religious persecution in Eritrea
St. Andrew's Bookshop - T' Kebaeku
Living people
Eritrean Protestants
21st-century Eritrean women singers
1975 births
Prisoners and detainees of Eritrea
Eritrean prisoners and detainees
|
```smalltalk
using System.ComponentModel.DataAnnotations.Schema;
using Npgsql.EntityFrameworkCore.PostgreSQL.TestUtilities;
namespace Npgsql.EntityFrameworkCore.PostgreSQL.Query;
[MinimumPostgresVersion(14, 0)] // Multiranges were introduced in PostgreSQL 14
public class MultirangeQueryNpgsqlTest : IClassFixture<MultirangeQueryNpgsqlTest.MultirangeQueryNpgsqlFixture>
{
private MultirangeQueryNpgsqlFixture Fixture { get; }
// ReSharper disable once UnusedParameter.Local
public MultirangeQueryNpgsqlTest(MultirangeQueryNpgsqlFixture fixture, ITestOutputHelper testOutputHelper)
{
Fixture = fixture;
Fixture.TestSqlLoggerFactory.Clear();
Fixture.TestSqlLoggerFactory.SetTestOutputHelper(testOutputHelper);
}
#region Operators
[ConditionalFact]
public void Contains_value()
{
using var context = CreateContext();
var value = 3;
var id = context.TestEntities
.Single(x => x.IntMultirange.Contains(value))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__value_0='3'
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" @> @__value_0
LIMIT 2
""");
}
[ConditionalFact]
public void Contains_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(1, 2) };
var id = context.TestEntities
.Single(x => x.IntMultirange.Contains(multirange))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[1,2]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" @> @__multirange_0
LIMIT 2
""");
}
[ConditionalFact]
public void Contains_range()
{
using var context = CreateContext();
var range = new NpgsqlRange<int>(1, 2);
var id = context.TestEntities
.Single(x => x.IntMultirange.Contains(range))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__range_0='[1,2]' (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" @> @__range_0
LIMIT 2
""");
}
[ConditionalFact]
public void ContainedBy_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(1, 2) };
var id = context.TestEntities
.Single(x => multirange.ContainedBy(x.IntMultirange))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[1,2]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE @__multirange_0 <@ t."IntMultirange"
LIMIT 2
""");
}
[ConditionalFact]
public void Equals_operator()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(0, 5), new(7, 10) };
var id = context.TestEntities
.Single(x => x.IntMultirange == multirange)
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[0,5]', '[7,10]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" = @__multirange_0
LIMIT 2
""");
}
[ConditionalFact]
public void Equals_method()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(0, 5), new(7, 10) };
var id = context.TestEntities
.Single(x => x.IntMultirange.Equals(multirange))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[0,5]', '[7,10]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" = @__multirange_0
LIMIT 2
""");
}
[ConditionalFact]
public void Overlaps_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(-3, 0), new(100, 101) };
var id = context.TestEntities
.Single(x => x.IntMultirange.Overlaps(multirange))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[-3,0]', '[100,101]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" && @__multirange_0
LIMIT 2
""");
}
[ConditionalFact]
public void Overlaps_range()
{
using var context = CreateContext();
var range = new NpgsqlRange<int>(-3, 0);
var id = context.TestEntities
.Single(x => x.IntMultirange.Overlaps(range))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__range_0='[-3,0]' (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" && @__range_0
LIMIT 2
""");
}
[ConditionalFact]
public void IsStrictlyLeftOf_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(11, 13), new(15, 16) };
var id = context.TestEntities
.Single(x => x.IntMultirange.IsStrictlyLeftOf(multirange))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[11,13]', '[15,16]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" << @__multirange_0
LIMIT 2
""");
}
[ConditionalFact]
public void IsStrictlyLeftOf_range()
{
using var context = CreateContext();
var range = new NpgsqlRange<int>(11, 13);
var id = context.TestEntities
.Single(x => x.IntMultirange.IsStrictlyLeftOf(range))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__range_0='[11,13]' (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" << @__range_0
LIMIT 2
""");
}
[ConditionalFact]
public void IsStrictlyRightOf_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(-10, -7), new(-5, 3) };
var id = context.TestEntities
.Single(x => x.IntMultirange.IsStrictlyRightOf(multirange))
.Id;
Assert.Equal(2, id);
AssertSql(
"""
@__multirange_0={ '[-10,-7]', '[-5,3]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" >> @__multirange_0
LIMIT 2
""");
}
[ConditionalFact]
public void IsStrictlyRightOf_range()
{
using var context = CreateContext();
var range = new NpgsqlRange<int>(-5, 3);
var id = context.TestEntities
.Single(x => x.IntMultirange.IsStrictlyRightOf(range))
.Id;
Assert.Equal(2, id);
AssertSql(
"""
@__range_0='[-5,3]' (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" >> @__range_0
LIMIT 2
""");
}
[ConditionalFact]
public void DoesNotExtendLeftOf_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(2, 7), new(13, 18) };
var id = context.TestEntities
.Single(x => x.IntMultirange.DoesNotExtendLeftOf(multirange))
.Id;
Assert.Equal(2, id);
AssertSql(
"""
@__multirange_0={ '[2,7]', '[13,18]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" &> @__multirange_0
LIMIT 2
""");
}
[ConditionalFact]
public void DoesNotExtendLeftOf_range()
{
using var context = CreateContext();
var range = new NpgsqlRange<int>(2, 7);
var id = context.TestEntities
.Single(x => x.IntMultirange.DoesNotExtendLeftOf(range))
.Id;
Assert.Equal(2, id);
AssertSql(
"""
@__range_0='[2,7]' (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" &> @__range_0
LIMIT 2
""");
}
[ConditionalFact]
public void DoesNotExtendRightOf_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(-5, -3), new(13, 18) };
var id = context.TestEntities
.Single(x => x.IntMultirange.DoesNotExtendRightOf(multirange))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[-5,-3]', '[13,18]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" &< @__multirange_0
LIMIT 2
""");
}
[ConditionalFact]
public void DoesNotExtendRightOf_range()
{
using var context = CreateContext();
var range = new NpgsqlRange<int>(13, 18);
var id = context.TestEntities
.Single(x => x.IntMultirange.DoesNotExtendRightOf(range))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__range_0='[13,18]' (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" &< @__range_0
LIMIT 2
""");
}
[ConditionalFact]
public void IsAdjacentTo_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(-5, -4), new(-2, -1) };
var id = context.TestEntities
.Single(x => x.IntMultirange.IsAdjacentTo(multirange))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[-5,-4]', '[-2,-1]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" -|- @__multirange_0
LIMIT 2
""");
}
[ConditionalFact]
public void IsAdjacentTo_range()
{
using var context = CreateContext();
var range = new NpgsqlRange<int>(-2, -1);
var id = context.TestEntities
.Single(x => x.IntMultirange.IsAdjacentTo(range))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__range_0='[-2,-1]' (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" -|- @__range_0
LIMIT 2
""");
}
[ConditionalFact]
public void Union_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(-5, -1) };
var id = context.TestEntities
.Single(x => x.IntMultirange.Union(multirange) == new NpgsqlRange<int>[] { new(-5, 5), new(7, 10) })
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[-5,-1]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" + @__multirange_0 = '{[-5,5], [7,10]}'::int4multirange
LIMIT 2
""");
}
[ConditionalFact]
public void Intersect_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(-5, 1), new(9, 13) };
var id = context.TestEntities
.Single(x => x.IntMultirange.Intersect(multirange) == new NpgsqlRange<int>[] { new(0, 1), new(9, 10) })
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[-5,1]', '[9,13]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" * @__multirange_0 = '{[0,1], [9,10]}'::int4multirange
LIMIT 2
""");
}
[ConditionalFact]
public void Intersect_aggregate()
{
using var context = CreateContext();
var intersection = context.TestEntities
.Where(x => x.Id == 1 || x.Id == 2)
.GroupBy(x => true)
.Select(g => g.Select(x => x.IntMultirange).RangeIntersectAgg())
.Single();
Assert.Equal([new(4, true, 6, false), new(7, true, 9, false)], intersection);
AssertSql(
"""
SELECT range_intersect_agg(t0."IntMultirange")
FROM (
SELECT t."IntMultirange", TRUE AS "Key"
FROM "TestEntities" AS t
WHERE t."Id" IN (1, 2)
) AS t0
GROUP BY t0."Key"
LIMIT 2
""");
}
[ConditionalFact]
public void Except_multirange()
{
using var context = CreateContext();
var multirange = new NpgsqlRange<int>[] { new(2, 3) };
var id = context.TestEntities
.Single(x => x.IntMultirange.Except(multirange) == new NpgsqlRange<int>[] { new(0, 1), new(4, 5), new(7, 10) })
.Id;
Assert.Equal(1, id);
AssertSql(
"""
@__multirange_0={ '[2,3]' } (DbType = Object)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" - @__multirange_0 = '{[0,1], [4,5], [7,10]}'::int4multirange
LIMIT 2
""");
}
#endregion
#region Functions
// TODO: lower, upper, lower_inc, upper_inc, lower_inf, upper_inf
[ConditionalFact]
public void Is_empty()
{
using var context = CreateContext();
var id = context.TestEntities
.Single(x => x.IntMultirange.Intersect(new NpgsqlRange<int>[] { new(18, 19) }).Any())
.Id;
Assert.Equal(2, id);
AssertSql(
"""
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE NOT (isempty(t."IntMultirange" * '{[18,19]}'::int4multirange))
LIMIT 2
""");
}
[ConditionalFact]
public void Merge()
{
using var context = CreateContext();
var id = context.TestEntities
.Single(x => x.IntMultirange.Merge() == new NpgsqlRange<int>(0, 10))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE range_merge(t."IntMultirange") = '[0,10]'::int4range
LIMIT 2
""");
}
#endregion
#region Built-in multiranges
[ConditionalFact]
public void IntMultirange()
{
using var context = CreateContext();
var value = 3;
var result = context.TestEntities.Single(x => x.IntMultirange.Contains(value));
Assert.Equal(1, result.Id);
AssertSql(
"""
@__value_0='3'
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" @> @__value_0
LIMIT 2
""");
}
[ConditionalFact]
public void LongMultirange()
{
using var context = CreateContext();
var value = 3;
var result = context.TestEntities.Single(x => x.LongMultirange.Contains(value));
Assert.Equal(1, result.Id);
AssertSql(
"""
@__p_0='3'
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."LongMultirange" @> @__p_0
LIMIT 2
""");
}
[ConditionalFact]
public void DecimalMultirange()
{
using var context = CreateContext();
var value = 3;
var result = context.TestEntities.Single(x => x.DecimalMultirange.Contains(value));
Assert.Equal(1, result.Id);
AssertSql(
"""
@__p_0='3'
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."DecimalMultirange" @> @__p_0
LIMIT 2
""");
}
[ConditionalFact]
public void Datemultirange_DateOnly()
{
using var context = CreateContext();
var value = new DateOnly(2020, 1, 3);
var result = context.TestEntities.Single(x => x.DateOnlyDateMultirange.Contains(value));
Assert.Equal(1, result.Id);
AssertSql(
"""
@__value_0='01/03/2020' (DbType = Date)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."DateOnlyDateMultirange" @> @__value_0
LIMIT 2
""");
}
[ConditionalFact]
public void Datemultirange_DateTime()
{
using var context = CreateContext();
var value = new DateTime(2020, 1, 3);
var result = context.TestEntities.Single(x => x.DateTimeDateMultirange.Contains(value));
Assert.Equal(1, result.Id);
AssertSql(
"""
@__value_0='2020-01-03T00:00:00.0000000' (DbType = Date)
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."DateTimeDateMultirange" @> @__value_0
LIMIT 2
""");
}
#endregion Built-in multiranges
#region Query as primitive collection
[ConditionalFact]
public void Contains()
{
using var context = CreateContext();
var id = context.TestEntities
.Single(x => x.IntMultirange.Contains(new NpgsqlRange<int>(0, 5)))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE t."IntMultirange" @> '[0,5]'::int4range
LIMIT 2
""");
}
[ConditionalFact]
public void Skip_Contains()
{
using var context = CreateContext();
var id = context.TestEntities
.Single(x => x.IntMultirange.Skip(1).Contains(new NpgsqlRange<int>(7, 10)))
.Id;
Assert.Equal(1, id);
AssertSql(
"""
SELECT t."Id", t."DateOnlyDateMultirange", t."DateTimeDateMultirange", t."DecimalMultirange", t."IntMultirange", t."LongMultirange"
FROM "TestEntities" AS t
WHERE '[7,10]'::int4range IN (
SELECT i.value
FROM unnest(t."IntMultirange") AS i(value)
OFFSET 1
)
LIMIT 2
""");
}
#endregion
#region Fixtures
public class MultirangeQueryNpgsqlFixture : SharedStoreFixtureBase<MultirangeContext>
{
protected override string StoreName
=> "MultirangeQueryTest";
protected override ITestStoreFactory TestStoreFactory
=> NpgsqlTestStoreFactory.Instance;
public TestSqlLoggerFactory TestSqlLoggerFactory
=> (TestSqlLoggerFactory)ListLoggerFactory;
protected override void Seed(MultirangeContext context)
=> MultirangeContext.Seed(context);
}
public class MultirangeTestEntity
{
public int Id { get; set; }
public NpgsqlRange<int>[] IntMultirange { get; set; }
public NpgsqlRange<long>[] LongMultirange { get; set; }
public NpgsqlRange<decimal>[] DecimalMultirange { get; set; }
public NpgsqlRange<DateOnly>[] DateOnlyDateMultirange { get; set; }
[Column(TypeName = "datemultirange")]
public NpgsqlRange<DateTime>[] DateTimeDateMultirange { get; set; }
}
private void AssertSql(params string[] expected)
=> Fixture.TestSqlLoggerFactory.AssertBaseline(expected);
public class MultirangeContext(DbContextOptions options) : PoolableDbContext(options)
{
public DbSet<MultirangeTestEntity> TestEntities { get; set; }
public static void Seed(MultirangeContext context)
{
context.TestEntities.AddRange(
new MultirangeTestEntity
{
Id = 1,
IntMultirange = [new(0, 5), new(7, 10)],
LongMultirange = [new(0, 5), new(7, 10)],
DecimalMultirange = [new(0, 5), new(7, 10)],
DateOnlyDateMultirange =
[
new(new DateOnly(2020, 1, 1), new DateOnly(2020, 1, 5)),
new(new DateOnly(2020, 1, 7), new DateOnly(2020, 1, 10))
],
DateTimeDateMultirange =
[
new(new DateTime(2020, 1, 1), new DateTime(2020, 1, 5)), new(new DateTime(2020, 1, 7), new DateTime(2020, 1, 10))
]
},
new MultirangeTestEntity
{
Id = 2,
IntMultirange = [new(4, 8), new(13, 20)],
LongMultirange = [new(4, 8), new(13, 20)],
DecimalMultirange = [new(4, 8), new(13, 20)],
DateOnlyDateMultirange =
[
new(new DateOnly(2020, 1, 4), new DateOnly(2020, 1, 8)),
new(new DateOnly(2020, 1, 13), new DateOnly(2020, 1, 20))
],
DateTimeDateMultirange =
[
new(new DateTime(2020, 1, 4), new DateTime(2020, 1, 8)), new(new DateTime(2020, 1, 13), new DateTime(2020, 1, 20))
]
});
context.SaveChanges();
}
}
#endregion
#region Helpers
protected MultirangeContext CreateContext()
=> Fixture.CreateContext();
#endregion
}
```
|
Conophis morai, Mora's road guarder, is a species of snake in the family Colubridae. The species is native to Mexico.
References
Conophis
Snakes of North America
Reptiles described in 2002
Endemic reptiles of Mexico
Endemic fauna of Los Tuxtlas
|
Marko Strahija (born 28 May 1975 in Zagreb) is a backstroke swimmer from Croatia, who competed at three Summer Olympics between 1996 and 2008.
Early career
Marko attended The Ohio State University and held university records in the 100 and 200 backstroke before the times were eclipsed by RJ Lemyre.
In Atlanta, United States, he finished in 11th position (B-Final) in the Men's 200 m backstroke, and was eliminated in the heats of the Men's 4 × 200 m freestyle relay, alongside Gordan Kožulj, Miroslav Vučetić, and Marijan Kanjer. Strahija won the silver medal, behind Aaron Peirsol of the United States, in the 200 m backstroke at the 2002 FINA Short Course World Championships.
Doping suspension and exoneration
Strahija's urine sample, taken in an out-of-competition control in July 2002, tested positive for human chorionic gonadotropin (hCG). Since hCG is a known tumor marker, Strahija underwent medical tests that found nothing suspicious. He maintained his innocence and disputed scientific validity of testing for hCG. Nevertheless, in 2003 he received a two-year suspension.
In October 2007 Strahija again tested positive for hCG, which caused him to miss the European Short Course Championships held in December that year. This time, subsequent medical tests found testicular cancer, and Strahija immediately underwent surgery. In February 2008, the International Swimming Federation exonerated Strahija, lifting his provisional suspension. He made a successful recovery, taking part in the 2008 Summer Olympics.
Olympic results
References
External links
1975 births
Living people
Male backstroke swimmers
Croatian male swimmers
Olympic swimmers for Croatia
Swimmers at the 1996 Summer Olympics
Swimmers at the 2000 Summer Olympics
Swimmers at the 2008 Summer Olympics
Swimmers from Zagreb
Croatian sportspeople in doping cases
Doping cases in swimming
Medalists at the FINA World Swimming Championships (25 m)
European Aquatics Championships medalists in swimming
Mediterranean Games gold medalists for Croatia
Mediterranean Games silver medalists for Croatia
Swimmers at the 2001 Mediterranean Games
Mediterranean Games medalists in swimming
|
```shell
Adding a remote repository
What is a checksum?
How to set your username and email
Check the status of your files
Recover lost code
```
|
The Supreme Court of Maryland (previously the Maryland Court of Appeals) is the highest court of the U.S. state of Maryland. The court, which is composed of one chief justice and six associate justices, meets in the Robert C. Murphy Courts of Appeal Building in the state capital, Annapolis. The term of the Court begins the second Monday of September. The Court is unique among American courts in that the justices wear red robes.
History
As the highest tribunal in Maryland, the Court of Appeals was created by Article 56 of the Maryland Constitution of 1776. The Court was to be "composed of persons of integrity and sound judgment in the law, whose judgment shall be final and conclusive in all cases of appeal, from the general court, court of chancery, and court of admiralty . . ." With counsel, advice and consent, the Governor appointed all of the judges. Five judges were commissioned in 1778, but that number was reduced to three in 1801. The Court was restructured in 1806 by dividing the State into six judicial districts with a chief judge and two associate judges for each district appointed by the Governor and Council. Together, these six chief judges constituted the Court of Appeals which began to sit on the Eastern Shore at Easton as well as on the Western Shore at the State capital.
The Maryland Constitution of 1851 divided the State into four judicial districts. Voters of each district elected a judge to the Court of Appeals for a ten-year term. The Court became responsible solely for appellate duties and sat only at Annapolis, whereas before it sat in various locations throughout the State. Five judges, each elected from one of five judicial districts, were prescribed by the Maryland Constitution of 1864.
The Maryland Constitution of 1867 (currently in effect) returned to the older form of requiring Court of Appeals judges to assume trial court and appellate duties. In seven judicial circuits, the Governor, with Senate advice and consent, designated a chief judge. In the eighth judicial circuit in Baltimore, the voters elected the chief judge. These eight chief judges then constituted the Court of Appeals.
Judicial reorganization in 1943 provided for a five-member Court of Appeals elected for terms of fifteen years. The five judges included two from Baltimore City and one each from three appellate judicial circuits. In 1960, the number of judges was increased to the present-day seven. Until 1994, there was one from each of the first five Appellate Judicial Circuits and two from the Sixth Appellate Judicial Circuit (Baltimore), but a Constitutional amendment realigned the circuits to create seven circuits with one judge from each. Since 1975, the Court of Appeals has heard cases almost exclusively by way of certiorari. As a result, the Court's formerly excessive workload has been reduced to a more manageable level, thus allowing the Court to devote more time to the most important and far-reaching issues.
Maryland was formerly one of only two states whose highest judicial body was called a "Court of Appeals" rather than a "Supreme Court," along with the New York Court of Appeals. In the 2022 general election held on November 8, 2022, voters approved a constitutional amendment to change the name of the court to the "Supreme Court of Maryland", and the title of its judges to "Justice." The same amendment also renamed the intermediate appellate court from the Court of Special Appeals to the Appellate Court of Maryland. The new names became effective on December 14, 2022.
Functions
As Maryland's highest court, the Supreme Court of Maryland reviews cases of both major and minor importance. Throughout the year, the Supreme Court of Maryland holds hearings on the adoption or amendment of rules of practice and procedure. It also supervises the Attorney Grievance Commission and State Board of Law Examiners in attorney disciplinary and admission matters. The Chief Justice of the Supreme Court of Maryland, designated by the Governor, is the constitutional administrative head of the Maryland judicial system.
Cases typically come before the Supreme Court of Maryland on a petition for a writ of certiorari to the Appellate Court of Maryland. The court can decline the petition, and refuse to hear the case, or it can grant the "cert," and hear the appeal. The justices sometimes decide to hear an appeal before the lower appellate court has heard the case. This is known as the Court 'granting certiorari on its own motion', or 'reaching down'. In this instance, the writ of certiorari is issued to the trial court, rather than to the Appellate Court of Maryland (Maryland's intermediate appellate court, or appellate court of right).
The court does not sit in panels; all seven justices sit on each case (en banc) unless there is a disqualification, in which event a judge from another court, or a retired appellate judge, may be specially assigned to sit in the place of the disqualified justice. In practice, almost all cases are heard by seven justices, though a quorum for the court is five justices.
While it is generally an appellate court and hears most cases on appeal, the Supreme Court of Maryland has exclusive jurisdiction over certain matters, such as legislative redistricting, removal of certain officers, and certification of questions of law. Additionally, it had exclusive jurisdiction in death penalty appeals prior to the abolition of capital punishment in Maryland.
The Supreme Court of Maryland likewise retains original jurisdiction to discipline all attorneys admitted to the practice of law in Maryland. It can impose penalties ranging from reprimands to the ultimate punishment, disbarment.
Justices
Appointment and qualifications
The seven justices of the Supreme Court of Maryland are appointed by the Governor of Maryland with Senate consent. They serve ten-year terms. However, note that the ballot for re-election says only 'for continuance in office'. I.e. there is no opposing candidate.
The justices of the court are required to be citizens of and qualified voters in Maryland. Prior to their appointment, they must have lived in Maryland for at least five years, and must have lived for at least six months in the appellate judicial circuit from which they are appointed. They must be at least thirty years of age at the time of appointment, and must have been admitted to practice law in Maryland. Appointees should be "most distinguished for integrity, wisdom and sound legal knowledge."
After initial appointment by the Governor and confirmation by the Senate, members of the court, at the first general election occurring at least one year after their appointment, run for continuance in office on their records without opposition. If the voters reject the retention in office of a justice, or the vote is tied, the office becomes vacant. Otherwise, the incumbent justice is retained in office for a ten-year term. This requirement of voter approval is similar to provisions in the Missouri Plan, a non-partisan method for selecting judges which is used by 11 states. Like all Maryland judges, members of the Supreme Court of Maryland must retire by their 70th birthday.
There is one justice from each of the state's seven Judicial Circuits. Each justice is required to be a resident of his or her respective circuit. The circuits are currently as follows:
Current justices
Unlike most other American federal, state, and local courts, the justices on the Supreme Court of Maryland wear red robes and with white cross-collars, reminiscent of British court dress. Judges at all other levels of the Maryland judiciary wear the more customary black robes.
Senior justices
Justices of the Supreme Court of Maryland who no longer wish to work full time, or wish to have more control over their schedules, may become senior justices and be appointed to hear cases if: they were not removed or involuntarily retired from the bench, they did not leave the bench for reason of disability, they did not leave the bench because they lost an election or did not gain Senate confirmation, they were not censured by the Supreme Court of Maryland upon recommendation of the Commission on Judicial Disabilities, and they do not engage in the practice of law.
See also
Courts of Maryland
Government of Maryland
Appellate Court of Maryland
Notes
References
External links
Homepage for the Supreme Court of Maryland
Information from the Maryland Archives
Maryland Constitution, Article IV: Judiciary Department
Red Robes and the Maryland Court of Appeals
Judicial Records from The Archives of Maryland
Court Overview | Maryland Courts
State supreme courts of the United States
Maryland state courts
1776 establishments in Maryland
Courts and tribunals established in 1776
|
```java
package com.thealgorithms.datastructures.trees;
import com.thealgorithms.datastructures.trees.BinaryTree.Node;
/**
* Given a sorted array. Create a balanced binary search tree from it.
*
* Steps: 1. Find the middle element of array. This will act as root 2. Use the
* left half recursively to create left subtree 3. Use the right half
* recursively to create right subtree
*/
public final class BSTFromSortedArray {
private BSTFromSortedArray() {
}
public static Node createBST(int[] array) {
if (array == null || array.length == 0) {
return null;
}
return createBST(array, 0, array.length - 1);
}
private static Node createBST(int[] array, int startIdx, int endIdx) {
// No element left.
if (startIdx > endIdx) {
return null;
}
int mid = startIdx + (endIdx - startIdx) / 2;
// middle element will be the root
Node root = new Node(array[mid]);
root.left = createBST(array, startIdx, mid - 1);
root.right = createBST(array, mid + 1, endIdx);
return root;
}
}
```
|
Zunil is an impact crater near the Cerberus Fossae on Mars, with a diameter of . It is named after the town of Zunil in Guatemala. The crater is located in the Elysium quadrangle. Visible in images from the Viking 1 and Viking 2 Mars orbiters in the 1970s, Zunil was subsequently imaged at higher resolution for the first time by the Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) in 2000.
A ray system associated with the Zunil impact, visible in infrared images from the Mars Odyssey Thermal Emission Spectrometer (THEMIS) was later detailed by McEwen et al. (2003); before this, large craters with ray systems had not been seen on Mars.
The debris from a recent landslide was first spotted on the south-east wall of the crater by the Mars Global Surveyor Mars Orbiter Camera (MOC) in 2003, and was subsequently imaged at higher resolution by the Mars Reconnaissance Orbiter High Resolution Imaging Science Experiment (HiRISE) in December 2006.
Formation
The impact which formed Zunil occurred no more than a few million years ago and hence the crater is in a relatively pristine form. It was probably not produced in a high-velocity impact, such as from a comet. If the interpretation that Zunil is the source of the basaltic shergottite meteorites is correct, then the crater formed in basalt deposited 165–177 million years ago.
The impact created a ray system, visible in the infrared, that extends up to from the crater and produced hundreds of millions of secondary craters with diameters ranging from . Very few of these secondary craters lie within of Zunil. Around 80% of the craters in Athabasca Valles are Zunil secondaries. If similar impacts also produced comparable amounts of secondaries, this calls into question the accuracy of crater counting as a dating technique for geologically young Martian surface features.
A simulation of the Zunil impact ejected on the order of ten billion rock fragments greater than in diameter, the total ejecta comprising . These formed about a billion secondary craters 10 m in size up to away from the primary impact. It is possible that some of these fragments from the impact made it to Earth to become shergottites, a form of Martian meteorite.
Research published in the journal Icarus has found pits in Zunil Crater that are caused by hot ejecta falling on ground containing ice. The pits are formed by heat forming steam that rushes out from groups of pits simultaneously, thereby blowing away from the pit ejecta.
See also
List of craters on Mars
List of craters with ray systems
References
External links
Themis page about Zunil
Rayed craters on Mars
Impact craters on Mars
Elysium quadrangle
Extraterrestrial landslides
|
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta name="generator" content="rustdoc">
<meta name="description" content="API documentation for the Rust `kw_from_string` fn in crate `mentat_ffi`.">
<meta name="keywords" content="rust, rustlang, rust-lang, kw_from_string">
<title>mentat_ffi::utils::strings::kw_from_string - Rust</title>
<link rel="stylesheet" type="text/css" href="../../../normalize.css">
<link rel="stylesheet" type="text/css" href="../../../rustdoc.css"
id="mainThemeStyle">
<link rel="stylesheet" type="text/css" href="../../../dark.css">
<link rel="stylesheet" type="text/css" href="../../../light.css" id="themeStyle">
<script src="../../../storage.js"></script>
</head>
<body class="rustdoc fn">
<!--[if lte IE 8]>
<div class="warning">
This old browser is unsupported and will most likely display funky
things.
</div>
<![endif]-->
<nav class="sidebar">
<div class="sidebar-menu">☰</div>
<div class="sidebar-elems"><p class='location'><a href='../../index.html'>mentat_ffi</a>::<wbr><a href='../index.html'>utils</a>::<wbr><a href='index.html'>strings</a></p><script>window.sidebarCurrent = {name: 'kw_from_string', ty: 'fn', relpath: ''};</script><script defer src="sidebar-items.js"></script></div>
</nav>
<div class="theme-picker">
<button id="theme-picker" aria-label="Pick another theme!">
<img src="../../../brush.svg" width="18" alt="Pick another theme!">
</button>
<div id="theme-choices"></div>
</div>
<script src="../../../theme.js"></script>
<nav class="sub">
<form class="search-form js-only">
<div class="search-container">
<input class="search-input" name="search"
autocomplete="off"
placeholder="Click or press S to search, ? for more options"
type="search">
</div>
</form>
</nav>
<section id='main' class="content"><h1 class='fqn'><span class='in-band'>Function <a href='../../index.html'>mentat_ffi</a>::<wbr><a href='../index.html'>utils</a>::<wbr><a href='index.html'>strings</a>::<wbr><a class="fn" href=''>kw_from_string</a></span><span class='out-of-band'><span id='render-detail'>
<a id="toggle-all-docs" href="javascript:void(0)" title="collapse all docs">
[<span class='inner'>−</span>]
</a>
</span><a class='srclink' href='../../../src/mentat_ffi/utils.rs.html#32-37' title='goto source code'>[src]</a></span></h1><pre class='rust fn'>pub fn kw_from_string(keyword_string: &'static <a class="primitive" href="path_to_url">str</a>) -> <a class="struct" href="../../../edn/symbols/struct.Keyword.html" title="struct edn::symbols::Keyword">Keyword</a></pre></section>
<section id='search' class="content hidden"></section>
<section class="footer"></section>
<aside id="help" class="hidden">
<div>
<h1 class="hidden">Help</h1>
<div class="shortcuts">
<h2>Keyboard Shortcuts</h2>
<dl>
<dt><kbd>?</kbd></dt>
<dd>Show this help dialog</dd>
<dt><kbd>S</kbd></dt>
<dd>Focus the search field</dd>
<dt><kbd></kbd></dt>
<dd>Move up in search results</dd>
<dt><kbd></kbd></dt>
<dd>Move down in search results</dd>
<dt><kbd></kbd></dt>
<dd>Switch tab</dd>
<dt><kbd>⏎</kbd></dt>
<dd>Go to active search result</dd>
<dt><kbd>+</kbd></dt>
<dd>Expand all sections</dd>
<dt><kbd>-</kbd></dt>
<dd>Collapse all sections</dd>
</dl>
</div>
<div class="infos">
<h2>Search Tricks</h2>
<p>
Prefix searches with a type followed by a colon (e.g.
<code>fn:</code>) to restrict the search to a given type.
</p>
<p>
Accepted types are: <code>fn</code>, <code>mod</code>,
<code>struct</code>, <code>enum</code>,
<code>trait</code>, <code>type</code>, <code>macro</code>,
and <code>const</code>.
</p>
<p>
Search functions by type signature (e.g.
<code>vec -> usize</code> or <code>* -> vec</code>)
</p>
</div>
</div>
</aside>
<script>
window.rootPath = "../../../";
window.currentCrate = "mentat_ffi";
</script>
<script src="../../../main.js"></script>
<script defer src="../../../search-index.js"></script>
</body>
</html>
```
|
```smalltalk
using System;
using System.Collections.Generic;
namespace Microsoft.Build.Framework;
/// <summary>
/// Generic custom build events including extended data for event enriching.
/// Extended data are implemented by <see cref="IExtendedBuildEventArgs"/>
/// </summary>
public sealed class ExtendedBuildMessageEventArgs : BuildMessageEventArgs, IExtendedBuildEventArgs
{
/// <inheritdoc />
public string ExtendedType { get; set; }
/// <inheritdoc />
public IDictionary<string, string?>? ExtendedMetadata { get; set; }
/// <inheritdoc />
public string? ExtendedData { get; set; }
/// <summary>
/// Default constructor. Used for deserialization.
/// </summary>
internal ExtendedBuildMessageEventArgs() : this("undefined") { }
/// <summary>
/// This constructor specifies only type of extended data.
/// </summary>
/// <param name="type">Type of <see cref="IExtendedBuildEventArgs.ExtendedType"/>.</param>
public ExtendedBuildMessageEventArgs(string type) => ExtendedType = type;
/// <summary>
/// This constructor allows all event data to be initialized
/// </summary>
/// <param name="type">Type of <see cref="IExtendedBuildEventArgs.ExtendedType"/>.</param>
/// <param name="message">text message</param>
/// <param name="helpKeyword">help keyword </param>
/// <param name="senderName">name of event sender</param>
/// <param name="importance">importance of the message</param>
public ExtendedBuildMessageEventArgs(string type, string? message, string? helpKeyword, string? senderName, MessageImportance importance)
: base(message, helpKeyword, senderName, importance) => ExtendedType = type;
/// <summary>
/// This constructor allows a timestamp to be set
/// </summary>
/// <param name="type">Type of <see cref="IExtendedBuildEventArgs.ExtendedType"/>.</param>
/// <param name="message">text message</param>
/// <param name="helpKeyword">help keyword </param>
/// <param name="senderName">name of event sender</param>
/// <param name="importance">importance of the message</param>
/// <param name="eventTimestamp">Timestamp when event was created</param>
public ExtendedBuildMessageEventArgs(string type, string? message, string? helpKeyword, string? senderName, MessageImportance importance, DateTime eventTimestamp)
: base(message, helpKeyword, senderName, importance, eventTimestamp) => ExtendedType = type;
/// <summary>
/// This constructor allows a timestamp to be set
/// </summary>
/// <param name="type">Type of <see cref="IExtendedBuildEventArgs.ExtendedType"/>.</param>
/// <param name="message">text message</param>
/// <param name="helpKeyword">help keyword </param>
/// <param name="senderName">name of event sender</param>
/// <param name="importance">importance of the message</param>
/// <param name="eventTimestamp">Timestamp when event was created</param>
/// <param name="messageArgs">message arguments</param>
public ExtendedBuildMessageEventArgs(string type, string? message, string? helpKeyword, string? senderName, MessageImportance importance, DateTime eventTimestamp, params object[]? messageArgs)
: base(message, helpKeyword, senderName, importance, eventTimestamp, messageArgs) => ExtendedType = type;
/// <summary>
/// This constructor allows all event data to be initialized
/// </summary>
/// <param name="type">Type of <see cref="IExtendedBuildEventArgs.ExtendedType"/>.</param>
/// <param name="subcategory">event sub-category</param>
/// <param name="code">event code</param>
/// <param name="file">file associated with the event</param>
/// <param name="lineNumber">line number (0 if not applicable)</param>
/// <param name="columnNumber">column number (0 if not applicable)</param>
/// <param name="endLineNumber">end line number (0 if not applicable)</param>
/// <param name="endColumnNumber">end column number (0 if not applicable)</param>
/// <param name="message">text message</param>
/// <param name="helpKeyword">help keyword </param>
/// <param name="senderName">name of event sender</param>
/// <param name="importance">importance of the message</param>
public ExtendedBuildMessageEventArgs(string type, string? subcategory, string? code, string? file, int lineNumber, int columnNumber, int endLineNumber, int endColumnNumber,
string? message, string? helpKeyword, string? senderName, MessageImportance importance)
: base(subcategory, code, file, lineNumber, columnNumber, endLineNumber, endColumnNumber, message, helpKeyword, senderName, importance) => ExtendedType = type;
/// <summary>
/// This constructor which allows a timestamp to be set
/// </summary>
/// <param name="type">Type of <see cref="IExtendedBuildEventArgs.ExtendedType"/>.</param>
/// <param name="subcategory">event sub-category</param>
/// <param name="code">event code</param>
/// <param name="file">file associated with the event</param>
/// <param name="lineNumber">line number (0 if not applicable)</param>
/// <param name="columnNumber">column number (0 if not applicable)</param>
/// <param name="endLineNumber">end line number (0 if not applicable)</param>
/// <param name="endColumnNumber">end column number (0 if not applicable)</param>
/// <param name="message">text message</param>
/// <param name="helpKeyword">help keyword </param>
/// <param name="senderName">name of event sender</param>
/// <param name="importance">importance of the message</param>
/// <param name="eventTimestamp">Timestamp when event was created</param>
public ExtendedBuildMessageEventArgs(string type, string? subcategory, string? code, string? file, int lineNumber, int columnNumber, int endLineNumber, int endColumnNumber,
string? message, string? helpKeyword, string? senderName, MessageImportance importance, DateTime eventTimestamp)
: base(subcategory, code, file, lineNumber, columnNumber, endLineNumber, endColumnNumber, message, helpKeyword, senderName, importance, eventTimestamp) => ExtendedType = type;
/// <summary>
/// This constructor which allows a timestamp to be set
/// </summary>
/// <param name="type">Type of <see cref="IExtendedBuildEventArgs.ExtendedType"/>.</param>
/// <param name="subcategory">event sub-category</param>
/// <param name="code">event code</param>
/// <param name="file">file associated with the event</param>
/// <param name="lineNumber">line number (0 if not applicable)</param>
/// <param name="columnNumber">column number (0 if not applicable)</param>
/// <param name="endLineNumber">end line number (0 if not applicable)</param>
/// <param name="endColumnNumber">end column number (0 if not applicable)</param>
/// <param name="message">text message</param>
/// <param name="helpKeyword">help keyword </param>
/// <param name="senderName">name of event sender</param>
/// <param name="importance">importance of the message</param>
/// <param name="eventTimestamp">Timestamp when event was created</param>
/// <param name="messageArgs">message arguments</param>
public ExtendedBuildMessageEventArgs(string type, string? subcategory, string? code, string? file, int lineNumber, int columnNumber, int endLineNumber, int endColumnNumber,
string? message, string? helpKeyword, string? senderName, MessageImportance importance, DateTime eventTimestamp, params object[]? messageArgs)
: base(subcategory, code, file, lineNumber, columnNumber, endLineNumber, endColumnNumber, message, helpKeyword, senderName, importance, eventTimestamp, messageArgs) => ExtendedType = type;
}
```
|
```go
package heap
import "jvmgo/ch09/classfile"
type ClassRef struct {
SymRef
}
func newClassRef(cp *ConstantPool, classInfo *classfile.ConstantClassInfo) *ClassRef {
ref := &ClassRef{}
ref.cp = cp
ref.className = classInfo.Name()
return ref
}
```
|
Mitogen-activated protein kinase 7 also known as MAP kinase 7 is an enzyme that in humans is encoded by the MAPK7 gene.
Function
MAPK7 is a member of the MAP kinase family. MAP kinases act as an integration point for multiple biochemical signals, and are involved in a wide variety of cellular processes such as proliferation, differentiation, transcription regulation and development. This kinase is specifically activated by mitogen-activated protein kinase kinase 5 (MAP2K5/MEK5). It is involved in the downstream signaling processes of various receptor molecules including receptor tyrosine kinases, and G protein-coupled receptors. In response to extracellular signals, this kinase translocates to the cell nucleus, where it regulates gene expression by phosphorylating, and activating different transcription factors. Four alternatively spliced transcript variants of this gene encoding two distinct isoforms have been reported.
MAPK7 is also critical for cardiovascular development and is essential for endothelial cell function.
Interactions
MAPK7 has been shown to interact with:
C-Raf,
Gap junction protein, alpha 1
MAP2K5,
MEF2C,
MEF2D,
PTPRR,
SGK, and
YWHAB.
ERK5 (= MAPK7) Inhibitors
XMD8-92 was one of the first described ERK5 inhibitors and was used in several pharmacological studies as tool compound. However, XMD8-92 hits BRD4 as an off-target leading to false or inconclusive results. Consequently, ERK5 inhibitors with improved selectivity (void of the BRD4 off-target effect) such as AX15836 and BAY-885 were developed and should preferably be used for future pharmacological studies. BAY-885 fulfils the quality criteria for a 'Donated Chemical Probe' as defined by the Structural Genomics Consortium. In 2020, it was demonstrated that ATP-competitive inhibitors paradoxically activate ERK5 signalling. A recent review discussed the modulation of ERK5 activity as a therapeutic anti-cancer strategy.
ERK5 (= MAPK7) Degrader
Based on a close analog of the ERK5 inhibitor BAY-885 the Proteolysis Targeting Chimera (PROTAC) INY-06-061 was developed which allows to compare the phenotypes resulting from ERK5 inhibition versus degradation.
References
Further reading
External links
MAP Kinase Resource .
EC 2.7.11
|
```python
# coding: utf-8
"""
Kubernetes
No description provided (generated by Openapi Generator path_to_url # noqa: E501
The version of the OpenAPI document: release-1.30
Generated by: path_to_url
"""
import pprint
import re # noqa: F401
import six
from kubernetes.client.configuration import Configuration
class V1alpha1SelfSubjectReviewStatus(object):
"""NOTE: This class is auto generated by OpenAPI Generator.
Ref: path_to_url
Do not edit the class manually.
"""
"""
Attributes:
openapi_types (dict): The key is attribute name
and the value is attribute type.
attribute_map (dict): The key is attribute name
and the value is json key in definition.
"""
openapi_types = {
'user_info': 'V1UserInfo'
}
attribute_map = {
'user_info': 'userInfo'
}
def __init__(self, user_info=None, local_vars_configuration=None): # noqa: E501
"""V1alpha1SelfSubjectReviewStatus - a model defined in OpenAPI""" # noqa: E501
if local_vars_configuration is None:
local_vars_configuration = Configuration()
self.local_vars_configuration = local_vars_configuration
self._user_info = None
self.discriminator = None
if user_info is not None:
self.user_info = user_info
@property
def user_info(self):
"""Gets the user_info of this V1alpha1SelfSubjectReviewStatus. # noqa: E501
:return: The user_info of this V1alpha1SelfSubjectReviewStatus. # noqa: E501
:rtype: V1UserInfo
"""
return self._user_info
@user_info.setter
def user_info(self, user_info):
"""Sets the user_info of this V1alpha1SelfSubjectReviewStatus.
:param user_info: The user_info of this V1alpha1SelfSubjectReviewStatus. # noqa: E501
:type: V1UserInfo
"""
self._user_info = user_info
def to_dict(self):
"""Returns the model properties as a dict"""
result = {}
for attr, _ in six.iteritems(self.openapi_types):
value = getattr(self, attr)
if isinstance(value, list):
result[attr] = list(map(
lambda x: x.to_dict() if hasattr(x, "to_dict") else x,
value
))
elif hasattr(value, "to_dict"):
result[attr] = value.to_dict()
elif isinstance(value, dict):
result[attr] = dict(map(
lambda item: (item[0], item[1].to_dict())
if hasattr(item[1], "to_dict") else item,
value.items()
))
else:
result[attr] = value
return result
def to_str(self):
"""Returns the string representation of the model"""
return pprint.pformat(self.to_dict())
def __repr__(self):
"""For `print` and `pprint`"""
return self.to_str()
def __eq__(self, other):
"""Returns true if both objects are equal"""
if not isinstance(other, V1alpha1SelfSubjectReviewStatus):
return False
return self.to_dict() == other.to_dict()
def __ne__(self, other):
"""Returns true if both objects are not equal"""
if not isinstance(other, V1alpha1SelfSubjectReviewStatus):
return True
return self.to_dict() != other.to_dict()
```
|
The Mexico City Alebrije Parade is an annual event to honor Mexican handcrafts and folk art, especially a hard kind of papier-mâché called “cartonería” and the creation of fantastic figures with it called “alebrijes.” Alebrijes are chimera-like creatures credited to artisan Pedro Linares painted in bright colors. The alebrijes for the parade are larger than anything Linares created, up to four meters in height and three meters in width. The parade begins on midday on a Saturday in late October in the historic center of Mexico City. The giant creatures are accompanied by musicians, clowns, people in costume and more, giving the event a Carnival-like atmosphere. After the parade the creations are judged with prizes awarded. There are also related literary and musical compositions.
Event
The event is alternatively known as La Noche de los Alebrijes (Night of the Alebrijes), and the Desfile y Concurso de Alebrijes Monumentales del MAP (Monumental Alebrije Parade and Contest of MAP). The parade and contest is organized by the Museo de Arte Popular, in collaboration with the federal and city secretariats of culture, the authorities of the historic center of Mexico City, the Consejo Nacional para la Cultura y las Artes, the Associación de Amigos del MAP and the BBDO company. Its purpose is a homage to Mexican handcrafts and folk art, especially cartonería (a kind of very hard paper mache) in order to restore value to it in modern society. In the spring or early summer, the Museo de Art Popular puts out an open call for participants, inviting individual artists and artisans along with museums, galleries, hotels, restaurants, businesses and public and private institutions. Notable artisans who have participated include Arturo Caballero Arroyo, Ricardo Hernández, Esteban G. Vargas, Laila Yamille Sabag, Enriqueta Landgrave Zamora and Fabián Hernández. Alebrijes have been sponsored by organizations such as CONACULTA, el Taller Los Olvidados, El FARO de Oriente, Arte en Papel, the Centro Cultural Xavier Villarrutia, Librarte, Arte Mexicano para el Mundo and the Mexico City Secretariat of Culture.
The parade begins at midday on a Saturday late in October, with about 400 uniformed officers needed to clear the parade route and keep order. This route takes the alebrijes through the historic center of Mexico City, from the main square or Zocalo, onto Paseo de la Reforma down to the Angel de la Independencia . Thousands of people, mostly children and their parents, line the 5.5 km parade route to see the creations. The alebrijes are accompanied by musical bands such as the Symphonic Band of the Navy, clowns, people on stilts and in costume, cheerleaders, acrobats, lucha libre wrestlers and more to give a Carnival like atmosphere. In addition to the alebrijes, other figures of cartonería appear such as Catrina figures, 30 cm brightly decorated skulls (related to Day of the Dead) as well as Judas figures (normally made for Holy Saturday) as a tribute to the traditional uses of this craft.
At the end of the parade, the alebrijes are placed on display on the sidewalk areas of Paseo de la Reforma between the Angel de la Independencia and the statue of Diana de Huntress for viewing and judging until early November. The prizes for the best alebrijes are 50,000, 30,000 and 20,000 pesos for first, second and third place.
In addition to the alebrijes themselves, there are two related literary competitions as well as one musical one. The literary competitions called the Concurso de Cuento sobre Alebrijes (Alebrije Story Contest) and the Concurso de Obra de Teatro para Títeres sobre Alebrijes (Alebrije Puppet Show Script Contest) . The literary contest is open to Mexican writers and foreign writers living in Mexico, with the works written in Spanish or an indigenous language of Mexico, with Spanish translation available. The work must be original and created for the event. There are first, second and third prizes for each of these competitions as well (40,000, 30,000 and 20,000 respectively), with the winners selected by audience vote. The music composition contest is called the Concurso de Música sobre Alebrijes (Alebrije Music Contest) . It also awards prizes for the best composition of fanfare music. The musical event has had judges such as Silvia Navarrete González, Betty Luisa Zanolli Fabila and Gustavo Rivero Weber.
History
The annual event was begun in 2007 by the Museo de Arte Popular (MAP) with the purpose of establishing a Mexico City tradition related to valuing Mexican handcrafts and folk art. The reason that alebrijes were chosen for the event is that their wild shapes and colors create surprise for both Mexicans and foreigners, according to Museo de Arte Popular director Walther Boelsterly. Some of the first participants include Arturo Caballero, Felipe Linares and Arte en Papel. To date, it has succeeded in becoming a tradition for October, shortly before Day of the Dead.
Each year since its founding, the event has grown. During the first four years, 392 alebrijes were created for the event, with 3,600 people participating in their creation. The first year saw the participation of over forty alebrijes, with sizes ranging from thirty centimeters to four meters in height. This grew to over eighty in 2008, over 200 in 2010 about that many in 2011. About the same number of alebrijes participated in 2012, but with about 6,600 people creating the alebrijes for that year alone. During its first four years, the parade has over seven million spectators watching live or on television with six million watching in 2011. The creations have been as tall as 4.2 meters and as wide as three meters, transported to the event by their creators. There have been cases when the resulting alebrije was so big and heavy, the participants could not bring it to be on parade or displayed.
When the event was created in 2007, two other competitions for the creation of short stories and puppet shows about alebrijes were also begun. This was followed in 2008 but a musical competition. In 2011, there were ninety five literary entries: seventy seven short stories and eighteen scripts.
In 2010, the theme of the event was the heroes of the Mexican War of Independence and Mexican Revolution whose 200th and 100th anniversaries were celebrated that year. In 2010, the alebrijes included the visages of Miguel Hidalgo, Ignacio Allende, José María Morelos y Pavón, Francisco Villa, Emiliano Zapata, Victoriano Huerta, Porfírio Díaz, Agustín de Iturbide and others. In 2010, the winners were “La Patria es Primero” by Alejandro Camacho Barrera in first place, “Si Adelita se fuera con otro” by Daniel Macias Camacho in second place and “El Masiosare” by Hugo Orozco Flores in third place.
The success of the event has spawned a similar event at the Instituto Politécnico Nacional (IPN) in 2011 for students and professors. The difference with this event is that the alebrije have moving robotic parts, lights and more, but with the same purpose of promoting Mexican handcrafts. The same year, three of these robotic alebrijes called Agui-burro, P-Esime Pezadilla and Cyber-burro participated in the MAP event as well.
The alebrijes
The monumental alebrijes of the parade are based on those credited to artisan Pedro Linares, who began creating fantastic, chimera-like, brightly colored creatures after dreaming them while ill. They generally combine elements of real and fantastic animals as well as humans including faces, wings, horns, hoofs, multiple heads, tails and more. No two alebrijes are exactly alike.(arthistory) . The alebrijes are generally made with a technique called cartonería, a very hard type of papier-mâché, although other materials can be used as well. The difference is that these alebrijes are far larger than anything Linares ever made, with sizes ranging up to four meters in height and three meters in width. Mexican sculptor Ricardo Linares has participated with creations such as a Chinese dragon with a snail’s head, eagle claws and octopus tentacles. It was three meters tall, four meters long, 2.5 meters wide and weighed over 350 kilograms. It was made with paper, fiberglass and resin.
The creatures are not meant to be scary as much as fantastic. They generally have a dream like quality and their appearance as well as name is supposed to convey an emotion or attitude. These alebrijes have incorporated elements of pre Hispanic myth along with images from Europe, Asia and Africa. The names given to the creations are generally fanciful such as El malévolo (The Evil One), Señor Mariposa (Mr. Butterfly), “Por si las moscas” (For if the flies), “Jejete,” “Viaje alegre al Viento” (The Wind Travels Happy) and Dragón de la Esperanza (Dragon of Hope) as well as names from Nahuatl such as Tepitecac, Xolotl and Ehecatl.
They are created in local workshops and transported to the event by their creators. One of the main problems aspiring participants have is obtaining sponsorship for the creation of the monumental pieces. The creation of the pieces is expensive. Smaller figures can cost on average of 10,000 pesos to create. For a figure of over four meters, the cost is between 50,000 and 70,000 pesos as metal frames need to be used along with paper, paint and other materials.
References
External links
2007 establishments in Mexico
Articles containing video clips
Autumn events in Mexico
Parades in Mexico
Recurring events established in 2007
Papier-mâché
Art festivals in Mexico
Festivals in Mexico City
|
In enzymology, an inositol-tetrakisphosphate 5-kinase () is an enzyme that catalyzes the chemical reaction
ATP + 1D-myo-inositol 1,3,4,6-tetrakisphosphate ADP + 1D-myo-inositol 1,3,4,5,6-pentakisphosphate
Thus, the two substrates of this enzyme are ATP and 1D-myo-inositol 1,3,4,6-tetrakisphosphate, whereas its two products are ADP and 1D-myo-inositol 1,3,4,5,6-pentakisphosphate.
This enzyme belongs to the family of transferases, specifically those transferring phosphorus-containing groups (phosphotransferases) with an alcohol group as acceptor. The systematic name of this enzyme class is ATP:1D-myo-inositol-1,3,4,6-tetrakisphosphate 5-phosphotransferase. This enzyme is also called 1D-myo-inositol-tetrakisphosphate 5-kinase. This enzyme participates in inositol phosphate metabolism and phosphatidylinositol signaling system.
References
EC 2.7.1
Enzymes of unknown structure
|
```c++
#include <vespa/messagebus/network/rpctargetpool.h>
#include <vespa/messagebus/testlib/slobrok.h>
#include <vespa/messagebus/testlib/testserver.h>
#include <vespa/vespalib/testkit/test_kit.h>
#include <vespa/log/log.h>
LOG_SETUP("targetpool_test");
using namespace mbus;
class PoolTimer : public ITimer {
public:
uint64_t millis;
PoolTimer() : millis(0) {
// empty
}
uint64_t getMilliTime() const override {
return millis;
}
};
TEST("targetpool_test") {
// Necessary setup to be able to resolve targets.
Slobrok slobrok;
TestServer srv1(Identity("srv1"), RoutingSpec(), slobrok);
RPCServiceAddress adr1("", srv1.mb.getConnectionSpec());
TestServer srv2(Identity("srv2"), RoutingSpec(), slobrok);
RPCServiceAddress adr2("", srv2.mb.getConnectionSpec());
TestServer srv3(Identity("srv3"), RoutingSpec(), slobrok);
RPCServiceAddress adr3("", srv3.mb.getConnectionSpec());
fnet::frt::StandaloneFRT server;
FRT_Supervisor & orb = server.supervisor();
std::unique_ptr<PoolTimer> ptr(new PoolTimer());
PoolTimer &timer = *ptr;
RPCTargetPool pool(std::move(ptr), 0.666, 1 );
// Assert that all connections expire.
RPCTarget::SP target;
ASSERT_TRUE((target = pool.getTarget(orb, adr1))); target.reset();
ASSERT_TRUE((target = pool.getTarget(orb, adr2))); target.reset();
ASSERT_TRUE((target = pool.getTarget(orb, adr3))); target.reset();
EXPECT_EQUAL(3u, pool.size());
for (uint32_t i = 0; i < 10; ++i) {
pool.flushTargets(false);
EXPECT_EQUAL(3u, pool.size());
}
timer.millis += 999;
pool.flushTargets(false);
EXPECT_EQUAL(0u, pool.size());
// Assert that only idle connections expire.
ASSERT_TRUE((target = pool.getTarget(orb, adr1))); target.reset();
ASSERT_TRUE((target = pool.getTarget(orb, adr2))); target.reset();
ASSERT_TRUE((target = pool.getTarget(orb, adr3))); target.reset();
EXPECT_EQUAL(3u, pool.size());
timer.millis += 444;
pool.flushTargets(false);
EXPECT_EQUAL(3u, pool.size());
ASSERT_TRUE((target = pool.getTarget(orb, adr2))); target.reset();
ASSERT_TRUE((target = pool.getTarget(orb, adr3))); target.reset();
timer.millis += 444;
pool.flushTargets(false);
EXPECT_EQUAL(2u, pool.size());
ASSERT_TRUE((target = pool.getTarget(orb, adr3))); target.reset();
timer.millis += 444;
pool.flushTargets(false);
EXPECT_EQUAL(1u, pool.size());
timer.millis += 444;
pool.flushTargets(false);
EXPECT_EQUAL(0u, pool.size());
// Assert that connections never expire while they are referenced.
ASSERT_TRUE((target = pool.getTarget(orb, adr1)));
EXPECT_EQUAL(1u, pool.size());
for (int i = 0; i < 10; ++i) {
timer.millis += 999;
pool.flushTargets(false);
EXPECT_EQUAL(1u, pool.size());
}
target.reset();
timer.millis += 999;
pool.flushTargets(false);
EXPECT_EQUAL(0u, pool.size());
}
TEST_MAIN() { TEST_RUN_ALL(); }
```
|
Gomm is a surname. Notable people with the surname include:
Archie Gomm (1897–1978), English footballer
Brian Gomm (1918–1995), British cricketer
Ian Gomm (born 1947), British singer-songwriter
Jon Gomm (born 1977), British singer-songwriter
Margaret Gomm (1921–1974), British swimmer
William Maynard Gomm (1784–1875), British Army officer
|
```objective-c
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of NVIDIA CORPORATION nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
// OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
#ifndef PARTICLE_IOS_ACTOR_H
#define PARTICLE_IOS_ACTOR_H
#include "Apex.h"
#if PX_PHYSICS_VERSION_MAJOR == 3
#include "ScopedPhysXLock.h"
#endif
namespace nvidia
{
namespace apex
{
PX_PUSH_PACK_DEFAULT
/**
\brief ParticleIOS Actor. A simple actor that simulates a particle system.
*/
class ParticleIosActor : public Actor
{
public:
// This actor is not publically visible
protected:
virtual ~ParticleIosActor() {}
};
PX_POP_PACK
}
} // namespace nvidia
#endif // PARTICLE_IOS_ACTOR_H
```
|
Laurence Braddon (died 29 November 1724), was an English politician and writer. He believed that Arthur Capell, 1st Earl of Essex was murdered, and was found guilty of a number of crimes committed in the process of attempting to prove this.
Biography
Braddon was the second son of William Braddon of Treworgy, in St Gennys, Cornwall and studied law at the Inner Temple.
He was elected a Fellow of the Royal Society in 1681.
When Arthur Capell, 1st Earl of Essex died in the Tower in 1683, Braddon believed that he had been murdered, and worked to collect sufficient evidence to prove the murder. He set on foot inquiries on the subject in London, and when a rumour reached him that the news of the earl's death was known at Marlborough on the very day of, if not before, the occurrence, he posted off. When his action became known at court, he was arrested and put under restraint. For a time he was let out on bail, but on 7 February 1683/4 he was tried with Hugh Speke at the king's bench on the accusation of conspiring to spread the belief that the Earl of Essex was murdered by some persons about him, and of endeavouring to suborn witnesses to testify the same. Braddon was found guilty on all the counts, but Speke was acquitted of the latter charge. The one was fined 1,000 pounds and the other 2,000 pounds, with sureties for good behaviour during their lives. Braddon remained in prison for five years until the landing of William III, when he was liberated.
He was called to the bar in 1693 and for some time worked at his profession. In February 1695 he was appointed solicitor to the wine licence office, a place valued at 100 pounds per annum.
He died on Sunday, 29 November 1724.
Writings
Most of Braddon's works relate to the death of the Earl of Essex. The "Enquiry into and Detection of the Barbarous Murther of the late Earl of Essex" (1689) was probably by him, and he was the author of "Essex's Innocency and Honour vindicated" (1690), "Murther will out" (1692), "True and Impartial Narrative of the Murder of Arthur, Earl of Essex" (1729), as well as "Bishop Burnet's late History charg'd with great Partiality and Misrepresentation" (1725) in the bishop's account of this affair. Braddon also published "The Constitutions of the Company of Watermen and Lightermen", and an "Abstract of the Rules, Orders, and Constitutions" of the same company, both of them issued in 1708. "The Miseries of the Poor are a National Sin, Shame, and Danger" was the title of a work (1717) in which he argued for the establishment of guardians of the poor and inspectors for the encouragement of arts and manufactures. Five years later he brought out "Particular Answers to the most material Objections made to the Proposals for relieving the Poor". The report of his trial was printed in 1684, and reprinted in "Cobbett's State Trials", ix. 1127–1228, and his impeachment of Bishop Burnet's "History" is reprinted in the same volume of Cobbett, pp. 1229–1332.
References
External links
Year of birth missing
1724 deaths
Politicians from Cornwall
Fellows of the Royal Society
Writers from Cornwall
English politicians
18th-century English writers
18th-century English male writers
|
```java
package com.yahoo.messagebus;
import com.yahoo.messagebus.test.SimpleMessage;
import org.junit.jupiter.api.Test;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Set;
import java.util.concurrent.ConcurrentLinkedQueue;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.Executor;
import java.util.concurrent.Executors;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicReference;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertNotNull;
import static org.junit.jupiter.api.Assertions.assertTrue;
/**
* @author Simon Thoresen Hult
*/
public class SequencerTestCase {
@Test
void testSyncNone() {
TestQueue src = new TestQueue();
TestQueue dst = new TestQueue();
QueueSender sender = new QueueSender(dst);
Sequencer seq = new Sequencer(sender);
seq.handleMessage(src.createMessage(false, 0));
seq.handleMessage(src.createMessage(false, 0));
seq.handleMessage(src.createMessage(false, 0));
seq.handleMessage(src.createMessage(false, 0));
seq.handleMessage(src.createMessage(false, 0));
assertEquals(0, src.size());
assertEquals(5, dst.size());
dst.replyNext();
dst.replyNext();
dst.replyNext();
dst.replyNext();
dst.replyNext();
assertEquals(5, src.size());
assertEquals(0, dst.size());
src.checkReply(false, 0);
src.checkReply(false, 0);
src.checkReply(false, 0);
src.checkReply(false, 0);
src.checkReply(false, 0);
assertEquals(0, src.size());
assertEquals(0, dst.size());
}
@Test
void testSyncId() {
TestQueue src = new TestQueue();
TestQueue dst = new TestQueue();
QueueSender sender = new QueueSender(dst);
Sequencer seq = new Sequencer(sender);
seq.handleMessage(src.createMessage(true, 1L));
seq.handleMessage(src.createMessage(true, 2L));
seq.handleMessage(src.createMessage(true, 3L));
seq.handleMessage(src.createMessage(true, 4L));
seq.handleMessage(src.createMessage(true, 5L));
assertEquals(0, src.size());
assertEquals(5, dst.size());
seq.handleMessage(src.createMessage(true, 1L));
seq.handleMessage(src.createMessage(true, 5L));
seq.handleMessage(src.createMessage(true, 2L));
seq.handleMessage(src.createMessage(true, 10L));
seq.handleMessage(src.createMessage(true, 4L));
seq.handleMessage(src.createMessage(true, 3L));
assertEquals(0, src.size());
assertEquals(6, dst.size());
dst.replyNext();
dst.replyNext();
dst.replyNext();
dst.replyNext();
dst.replyNext();
assertEquals(5, src.size());
assertEquals(6, dst.size());
dst.replyNext();
dst.replyNext();
dst.replyNext();
dst.replyNext();
dst.replyNext();
dst.replyNext();
assertEquals(11, src.size());
assertEquals(0, dst.size());
src.checkReply(true, 1);
src.checkReply(true, 2);
src.checkReply(true, 3);
src.checkReply(true, 4);
src.checkReply(true, 5);
src.checkReply(true, 10);
src.checkReply(true, 1);
src.checkReply(true, 2);
src.checkReply(true, 3);
src.checkReply(true, 4);
src.checkReply(true, 5);
assertEquals(0, src.size());
assertEquals(0, dst.size());
}
@Test
void testRecursiveSending() throws InterruptedException {
// This test queues up a lot of replies, and then has them all ready to return at once.
int n = 10000;
CountDownLatch latch = new CountDownLatch(n);
CountDownLatch started = new CountDownLatch(1);
AtomicReference<Reply> waiting = new AtomicReference<>();
Executor executor = Executors.newSingleThreadExecutor();
MessageHandler sender = message -> {
Runnable task = () -> {
Reply reply = new EmptyReply();
reply.swapState(message);
reply.setMessage(message);
if (waiting.compareAndSet(null, reply)) started.countDown();
else reply.popHandler().handleReply(reply);
};
if (Math.random() < 0.5) executor.execute(task); // Usually, RPC thread runs this.
else task.run(); // But on, e.g., timeouts, it runs in the caller thread instead.
};
Queue<Message> answered = new ConcurrentLinkedQueue<>();
ReplyHandler handler = reply -> {
answered.add(reply.getMessage());
latch.countDown();
};
Messenger messenger = new Messenger();
messenger.start();
Sequencer sequencer = new Sequencer(sender, messenger); // Not using the messenger results in a stack overflow error.
Queue<Message> sent = new ConcurrentLinkedQueue<>();
for (int i = 0; i < 10000; i++) {
Message message = new MyMessage(true, 1);
message.pushHandler(handler);
sequencer.handleMessage(message);
sent.add(message);
}
assertTrue(started.await(10, TimeUnit.SECONDS));
waiting.get().popHandler().handleReply(waiting.get());
assertTrue(latch.await(10, TimeUnit.SECONDS), "All messages should obtain a reply within 10s");
assertEquals(Set.copyOf(sent), Set.copyOf(answered)); // Order is not guaranteed at all!
messenger.destroy();
}
private static class TestQueue extends LinkedList<Routable> implements ReplyHandler {
void checkReply(boolean hasSeqId, long seqId) {
if (size() == 0) {
throw new IllegalStateException("No routable in queue.");
}
Routable obj = remove();
assertTrue(obj instanceof Reply);
Reply reply = (Reply)obj;
Message msg = reply.getMessage();
assertNotNull(msg);
assertEquals(hasSeqId, msg.hasSequenceId());
if (hasSeqId) {
assertEquals(seqId, msg.getSequenceId());
}
}
public void handleReply(Reply reply) {
add(reply);
}
void replyNext() {
Routable obj = remove();
assertTrue(obj instanceof Message);
Message msg = (Message)obj;
Reply reply = new EmptyReply();
reply.swapState(msg);
reply.setMessage(msg);
ReplyHandler handler = reply.popHandler();
handler.handleReply(reply);
}
Message createMessage(final boolean hasSeqId, final long seqId) {
Message ret = new MyMessage(hasSeqId, seqId);
ret.pushHandler(this);
return ret;
}
}
private static class QueueSender implements MessageHandler {
Queue<Routable> queue;
QueueSender(Queue<Routable> queue) {
this.queue = queue;
}
@Override
public void handleMessage(Message msg) {
queue.offer(msg);
}
}
private static class MyMessage extends SimpleMessage {
final boolean hasSeqId;
final long seqId;
MyMessage(boolean hasSeqId, long seqId) {
super("foo");
this.hasSeqId = hasSeqId;
this.seqId = seqId;
}
@Override
public boolean hasSequenceId() {
return hasSeqId;
}
@Override
public long getSequenceId() {
return seqId;
}
}
}
```
|
Sally Hoyt Spofford ( Sarah Elizabeth Foresman; April 11, 1914 – October 26, 2002) was an American ornithologist who was long associated with the Cornell Laboratory of Ornithology. In retirement, she was involved in conservation and birding in Arizona, known as the "doyenne of southern Arizona's birding community". She authored some 50 articles on bird behavior and co-authored the books Enjoying Birds in Upstate New York (1963) with O. S. Pettingill Jr. and Enjoying Birds Around New York City (1966) with Pettingill and R.S. Arbib Jr. She was a member of the American Ornithologists' Union from 1940 onward.
Born Sarah Elizabeth Foresman in Williamsport, Pennsylvania, she received a BA degree from Wilson College in 1935 and her MS degree from the University of Pennsylvania in 1936.
In 1948, she received her PhD in ornithology from Cornell University, where she met and married fellow ornithologist John Southgate Hoyt. Her husband died in 1951, and, from 1955 to 1969, Hoyt worked in various administrative positions at the Cornell Lab of Ornithology, being called the de facto manager. In 1964 she married ornithologist Walter R. Spofford, a specialist on raptors. Sally and Walter made several research trips, including Africa and Alaska, and after retiring from Cornell the two moved to Portal, Arizona, where their ranch became a popular wildlife watching area, featured in several bird-watching guides and attracting up to 6,000 visitors annually. She had no children by either marriage.
Walter died in 1995, and Sally died in Tucson in 2002, aged 88. The two are buried in a small cemetery near Paradise, Arizona.
References
External links
Sally Hoyt Spofford Papers, 1923–1982 at Cornell University Library
1914 births
2002 deaths
American ornithologists
People from Williamsport, Pennsylvania
Wilson College (Pennsylvania) alumni
University of Pennsylvania alumni
Cornell University alumni
People from Cochise County, Arizona
Women ornithologists
20th-century American women scientists
20th-century American zoologists
|
The China Brain Project is a 15-year project, approved by the Chinese National People's Congress in March 2016 as part of the 13th Five-Year Plan (2016–2020); it is one of four pilot programs of the Innovation of Science and Technology Forward 2030 program, targeted at research into the neural basis of cognitive function. Additional goals include improving diagnosis and prevention of brain diseases and driving information technology and artificial intelligence projects that are inspired by the brain.
The China Brain Project prioritizes brain-inspired AI over other approaches. The project is addressing legal, ethical, and social issues related to brain emulation (neuroethics) according to international standards and Chinese values. The project is supported by the Chinese Academy of Sciences' (CAS) Centre for Excellence in Brain Science and Intelligence, a consortium of laboratories at over twenty CAS institutes and universities, and the Chinese Institute for Brain Research, launched in March 2018.
See also
Artificial brain
BRAIN Initiative
Brain/MINDS
Human Brain Project
References
Chinese Academy of Sciences
Research in China
Neuroscience projects
2016 establishments in China
|
A sparse image is a type of disk image file used on macOS that grows in size as the user adds data to the image, taking up only as much disk space as stored in it. Encrypted sparse image files are used to secure a user's home directory by the FileVault feature in Mac OS X Snow Leopard and earlier. Sparse images can be created using Disk Utility.
Unlike a full image file (), which takes up as much actual space as the real disk it represents (regardless of the amount of unused space), a sparse image file () takes up only as much actual disk space as the data contained within, up to a maximum of the capacity assigned during creation.
Limitations
Two limitations are therefore worth noting regarding the use of this image file format:
A customized ".sparseimage" image file can be assigned a larger total capacity than the physical volume (or HD partition) on which it originally resides. While the virtual volume will seem to make that capacity available, attempting to exceed the physical capacity of the underlying volume will result in a disk error: "ran out of space". The file must first be moved to a larger physical disk or partition.
As noted above, while mounted image files automatically expand to their preassigned limit when data is added, they cannot be arbitrarily resized without the use of Disk Utility, , or other such software.
Sparse bundle disk images
Mac OS X Leopard introduced the concept of the sparse bundle. Instead of a single big file, a sparse bundle is a bundle (directory) containing a number of files called bands, each on the order of 8 MB in size. This means even though to the end user the sparse bundle appears as a single file, it is composed of smaller files. As of Mac OS X 10.8, the bands are 8 MiB () each. When the content of the image changes, one or more band files is changed, created, or deleted. This allows easier shrinking of the amount of space used on the underlying filesystem when a large amount of data is deleted inside the disk image, as long as the code supporting the filesystem inside the image notifies the kernel of the "releasing" of blocks, as happens in filesystems that support SSD "trim" operations to be triggered automatically for de-allocated filesystem blocks.
Sparse bundle advantages over non-diskimage backup for Time Machine:
the backup destination no longer needs to be an HFS+/HFSX volume (for the hard links to work and to preserve metadata), but can be any shared folder, on any server, connected using any protocol and using any file system to store the actual files
the entire sparse bundle is replicable from one location to another; this is particularly useful when upgrading the backup storage and when the on-site backup storage needs to be replicated to an off-site backup storage. A tool such as rsync may be used to keep one or more disk images consistent across various systems.
References
External links
- a FUSE filesystem for reading macOS sparse-bundle disk images
MacOS
Disk images
|
```xml
export { default as Hamburger } from './Hamburger';
export { default as Sidebar } from './Sidebar';
export { default as SidebarList, SubSidebarList } from './SidebarList';
export { default as SidebarBackButton } from './SidebarBackButton';
export { default as SidebarListItem, SubSidebarListItem } from './SidebarListItem';
export { default as SimpleSidebarListItemLink } from './SimpleSidebarListItemLink';
export { default as SimpleSidebarListItemHeader } from './SimpleSidebarListItemHeader';
export { default as SidebarListItemHeaderButton } from './SidebarListItemHeaderButton';
export { default as SidebarListItemHeaderLink } from './SidebarListItemHeaderLink';
export { default as SidebarListItemContent } from './SidebarListItemContent';
export { default as SidebarListItemContentIcon } from './SidebarListItemContentIcon';
export { default as SidebarListItemDiv } from './SidebarListItemDiv';
export { default as SidebarListItemLabel } from './SidebarListItemLabel';
export { default as SidebarListItemLink } from './SidebarListItemLink';
export { default as SidebarListItemButton } from './SidebarListItemButton';
export { default as SidebarNav } from './SidebarNav';
export { default as SidebarPrimaryButton } from './SidebarPrimaryButton';
export { default as SidebarLogo } from './SidebarLogo';
export { default as SidebarListItemSettingsLink } from './SidebarListItemSettingsLink';
export { default as SettingsListItem } from './SettingsListItem';
export { default as CollapsibleSidebarSpotlight } from './CollapsibleSidebarSpotlight';
```
|
Acinetobacter defluvii is a gram-negative and non-motile bacterium from the genus Acinetobacter which has been isolated from hospital sewage from the West China Hospital in China.
References
External links
Type strain of Acinetobacter defluvii at BacDive - the Bacterial Diversity Metadatabase
Moraxellaceae
Bacteria described in 2017
|
Calcabrina is one of the demons featured in Inferno, the first canticle of Dante Alighieri's Divine Comedy. Calcabrina's name is possibly meant to mean "grace-stomper" or "frost trampler."
In Dante's Divine Comedy
Calcabrina is a member of the Malebranche, a group of demons whose mission is to guard the fifth bolgia of the eighth circle of hell, the Malebolge, where grafters are punished. He is one of the ten devils that escorts Dante and Virgil through Malebolge by orders of the leader of Malebranche, the demon Malacoda.
The most notable mention of Calcabrina is when Alichino, a fellow demon, falls for the escape plan attempted by Bonturo Dati, one of the grafters punished in the bolgia. Calcabrina then decides to fly after the escaping sinner and ends up fighting with Alichino, who is also in pursuit, only for them to both fall into the boiling pitch.
References
Demons in the Divine Comedy
Male literary villains
|
```xml
import { useApi, useFolders, useNotifications } from '@proton/components/hooks';
import { TelemetryMailSelectAllEvents } from '@proton/shared/lib/api/telemetry';
import { isMessage as testIsMessage } from 'proton-mail/helpers/elements';
import { getCleanedFolderID, sendSelectAllTelemetryReport } from 'proton-mail/helpers/moveToFolder';
import { getSelectAllNotificationText } from 'proton-mail/helpers/selectAll';
import { useEmptyLabel } from 'proton-mail/hooks/actions/useEmptyLabel';
import { useGetElementsFromIDs } from 'proton-mail/hooks/mailbox/useElements';
import { useMailDispatch } from 'proton-mail/store/hooks';
import { layoutActions } from 'proton-mail/store/layout/layoutSlice';
/**
* If you need to use permanent delete on a full location, prefer to use the hook "usePermanentDelete" with selectAll to true instead.
*/
export const usePermanentDeleteAll = (labelID: string) => {
const api = useApi();
const { createNotification } = useNotifications();
const getElementsFromIDs = useGetElementsFromIDs();
const [folders = []] = useFolders();
const { emptyLabel, modal: deleteAllModal } = useEmptyLabel();
const dispatch = useMailDispatch();
const handleDeleteAll = async (selectedIDs: string[]) => {
const elements = getElementsFromIDs(selectedIDs);
const isMessage = testIsMessage(elements[0]);
// Send Telemetry
const cleanedSourceLabelID = getCleanedFolderID(labelID, folders);
void sendSelectAllTelemetryReport({
api,
sourceLabelID: cleanedSourceLabelID,
event: TelemetryMailSelectAllEvents.banner_permanent_delete,
});
await emptyLabel(labelID);
createNotification({
text: getSelectAllNotificationText(isMessage),
});
dispatch(layoutActions.setSelectAll(false));
};
return { handleDeleteAll, deleteAllModal };
};
```
|
```yaml
{{- /*
*/}}
{{- if .Values.networkPolicy.enabled }}
kind: NetworkPolicy
apiVersion: {{ include "common.capabilities.networkPolicy.apiVersion" . }}
metadata:
name: {{ template "common.names.fullname" . }}
namespace: {{ include "common.names.namespace" . | quote }}
labels: {{- include "common.labels.standard" ( dict "customLabels" .Values.commonLabels "context" $ ) | nindent 4 }}
app.kubernetes.io/component: grafana
{{- if .Values.commonAnnotations }}
annotations: {{- include "common.tplvalues.render" ( dict "value" .Values.commonAnnotations "context" $ ) | nindent 4 }}
{{- end }}
spec:
{{- $podLabels := include "common.tplvalues.merge" ( dict "values" ( list .Values.podLabels .Values.commonLabels ) "context" . ) }}
podSelector:
matchLabels: {{- include "common.labels.matchLabels" ( dict "customLabels" $podLabels "context" $ ) | nindent 6 }}
app.kubernetes.io/component: grafana
policyTypes:
- Ingress
- Egress
egress:
{{- if .Values.networkPolicy.allowExternalEgress }}
- {}
{{- else }}
- ports:
# Allow dns resolution
- port: 53
protocol: UDP
- port: 53
protocol: TCP
{{- if .Values.smtp.enabled }}
# Use standard SMTP ports
- port: 25
- port: 587
- port: 465
{{- end }}
{{- if .Values.networkPolicy.extraEgress }}
{{- include "common.tplvalues.render" ( dict "value" .Values.networkPolicy.extraEgress "context" $ ) | nindent 4 }}
{{- end }}
{{- end }}
ingress:
- ports:
- port: {{ .Values.grafana.containerPorts.grafana }}
{{- if not .Values.networkPolicy.allowExternal }}
from:
- podSelector:
matchLabels: {{- include "common.labels.matchLabels" ( dict "customLabels" .Values.commonLabels "context" $ ) | nindent 14 }}
{{- if .Values.networkPolicy.addExternalClientAccess }}
- podSelector:
matchLabels:
{{ template "common.names.fullname" . }}-client: "true"
{{- end }}
{{- if .Values.networkPolicy.ingressPodMatchLabels }}
- podSelector:
matchLabels: {{- include "common.tplvalues.render" (dict "value" .Values.networkPolicy.ingressPodMatchLabels "context" $ ) | nindent 14 }}
{{- end }}
{{- if .Values.networkPolicy.ingressNSMatchLabels }}
- namespaceSelector:
matchLabels: {{- include "common.tplvalues.render" (dict "value" .Values.networkPolicy.ingressNSMatchLabels "context" $ ) | nindent 14 }}
{{- if .Values.networkPolicy.ingressNSPodMatchLabels }}
podSelector:
matchLabels: {{- include "common.tplvalues.render" (dict "value" .Values.networkPolicy.ingressNSPodMatchLabels "context" $ ) | nindent 14 }}
{{- end }}
{{- end }}
{{- end }}
{{- if .Values.networkPolicy.extraIngress }}
{{- include "common.tplvalues.render" ( dict "value" .Values.networkPolicy.extraIngress "context" $ ) | nindent 4 }}
{{- end }}
{{- end }}
```
|
Christ Episcopal Church is a historic church at 156 S. Main Street in Oberlin, Ohio.
It was built in 1855 and added to the National Register in 1978.
In addition to weekly masses, the church offers weekday community meals and a home stay program.
References
External links
Official website
Episcopal churches in Ohio
Churches on the National Register of Historic Places in Ohio
Romanesque Revival church buildings in Ohio
Churches completed in 1855
Churches in Lorain County, Ohio
National Register of Historic Places in Lorain County, Ohio
Oberlin, Ohio
19th-century Episcopal church buildings
|
```python
# coding: utf-8
"""
ASN.1 type classes for the online certificate status protocol (OCSP). Exports
the following items:
- OCSPRequest()
- OCSPResponse()
Other type classes are defined that help compose the types listed above.
"""
from __future__ import unicode_literals, division, absolute_import, print_function
from ._errors import unwrap
from .algos import DigestAlgorithm, SignedDigestAlgorithm
from .core import (
Boolean,
Choice,
Enumerated,
GeneralizedTime,
IA5String,
Integer,
Null,
ObjectIdentifier,
OctetBitString,
OctetString,
ParsableOctetString,
Sequence,
SequenceOf,
)
from .crl import AuthorityInfoAccessSyntax, CRLReason
from .keys import PublicKeyAlgorithm
from .x509 import Certificate, GeneralName, GeneralNames, Name
# The structures in this file are taken from path_to_url
class Version(Integer):
_map = {
0: 'v1'
}
class CertId(Sequence):
_fields = [
('hash_algorithm', DigestAlgorithm),
('issuer_name_hash', OctetString),
('issuer_key_hash', OctetString),
('serial_number', Integer),
]
class ServiceLocator(Sequence):
_fields = [
('issuer', Name),
('locator', AuthorityInfoAccessSyntax),
]
class RequestExtensionId(ObjectIdentifier):
_map = {
'1.3.6.1.5.5.7.48.1.7': 'service_locator',
}
class RequestExtension(Sequence):
_fields = [
('extn_id', RequestExtensionId),
('critical', Boolean, {'default': False}),
('extn_value', ParsableOctetString),
]
_oid_pair = ('extn_id', 'extn_value')
_oid_specs = {
'service_locator': ServiceLocator,
}
class RequestExtensions(SequenceOf):
_child_spec = RequestExtension
class Request(Sequence):
_fields = [
('req_cert', CertId),
('single_request_extensions', RequestExtensions, {'explicit': 0, 'optional': True}),
]
_processed_extensions = False
_critical_extensions = None
_service_locator_value = None
def _set_extensions(self):
"""
Sets common named extensions to private attributes and creates a list
of critical extensions
"""
self._critical_extensions = set()
for extension in self['single_request_extensions']:
name = extension['extn_id'].native
attribute_name = '_%s_value' % name
if hasattr(self, attribute_name):
setattr(self, attribute_name, extension['extn_value'].parsed)
if extension['critical'].native:
self._critical_extensions.add(name)
self._processed_extensions = True
@property
def critical_extensions(self):
"""
Returns a set of the names (or OID if not a known extension) of the
extensions marked as critical
:return:
A set of unicode strings
"""
if not self._processed_extensions:
self._set_extensions()
return self._critical_extensions
@property
def service_locator_value(self):
"""
This extension is used when communicating with an OCSP responder that
acts as a proxy for OCSP requests
:return:
None or a ServiceLocator object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._service_locator_value
class Requests(SequenceOf):
_child_spec = Request
class ResponseType(ObjectIdentifier):
_map = {
'1.3.6.1.5.5.7.48.1.1': 'basic_ocsp_response',
}
class AcceptableResponses(SequenceOf):
_child_spec = ResponseType
class PreferredSignatureAlgorithm(Sequence):
_fields = [
('sig_identifier', SignedDigestAlgorithm),
('cert_identifier', PublicKeyAlgorithm, {'optional': True}),
]
class PreferredSignatureAlgorithms(SequenceOf):
_child_spec = PreferredSignatureAlgorithm
class TBSRequestExtensionId(ObjectIdentifier):
_map = {
'1.3.6.1.5.5.7.48.1.2': 'nonce',
'1.3.6.1.5.5.7.48.1.4': 'acceptable_responses',
'1.3.6.1.5.5.7.48.1.8': 'preferred_signature_algorithms',
}
class TBSRequestExtension(Sequence):
_fields = [
('extn_id', TBSRequestExtensionId),
('critical', Boolean, {'default': False}),
('extn_value', ParsableOctetString),
]
_oid_pair = ('extn_id', 'extn_value')
_oid_specs = {
'nonce': OctetString,
'acceptable_responses': AcceptableResponses,
'preferred_signature_algorithms': PreferredSignatureAlgorithms,
}
class TBSRequestExtensions(SequenceOf):
_child_spec = TBSRequestExtension
class TBSRequest(Sequence):
_fields = [
('version', Version, {'explicit': 0, 'default': 'v1'}),
('requestor_name', GeneralName, {'explicit': 1, 'optional': True}),
('request_list', Requests),
('request_extensions', TBSRequestExtensions, {'explicit': 2, 'optional': True}),
]
class Certificates(SequenceOf):
_child_spec = Certificate
class Signature(Sequence):
_fields = [
('signature_algorithm', SignedDigestAlgorithm),
('signature', OctetBitString),
('certs', Certificates, {'explicit': 0, 'optional': True}),
]
class OCSPRequest(Sequence):
_fields = [
('tbs_request', TBSRequest),
('optional_signature', Signature, {'explicit': 0, 'optional': True}),
]
_processed_extensions = False
_critical_extensions = None
_nonce_value = None
_acceptable_responses_value = None
_preferred_signature_algorithms_value = None
def _set_extensions(self):
"""
Sets common named extensions to private attributes and creates a list
of critical extensions
"""
self._critical_extensions = set()
for extension in self['tbs_request']['request_extensions']:
name = extension['extn_id'].native
attribute_name = '_%s_value' % name
if hasattr(self, attribute_name):
setattr(self, attribute_name, extension['extn_value'].parsed)
if extension['critical'].native:
self._critical_extensions.add(name)
self._processed_extensions = True
@property
def critical_extensions(self):
"""
Returns a set of the names (or OID if not a known extension) of the
extensions marked as critical
:return:
A set of unicode strings
"""
if not self._processed_extensions:
self._set_extensions()
return self._critical_extensions
@property
def nonce_value(self):
"""
This extension is used to prevent replay attacks by including a unique,
random value with each request/response pair
:return:
None or an OctetString object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._nonce_value
@property
def acceptable_responses_value(self):
"""
This extension is used to allow the client and server to communicate
with alternative response formats other than just basic_ocsp_response,
although no other formats are defined in the standard.
:return:
None or an AcceptableResponses object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._acceptable_responses_value
@property
def preferred_signature_algorithms_value(self):
"""
This extension is used by the client to define what signature algorithms
are preferred, including both the hash algorithm and the public key
algorithm, with a level of detail down to even the public key algorithm
parameters, such as curve name.
:return:
None or a PreferredSignatureAlgorithms object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._preferred_signature_algorithms_value
class OCSPResponseStatus(Enumerated):
_map = {
0: 'successful',
1: 'malformed_request',
2: 'internal_error',
3: 'try_later',
5: 'sign_required',
6: 'unauthorized',
}
class ResponderId(Choice):
_alternatives = [
('by_name', Name, {'explicit': 1}),
('by_key', OctetString, {'explicit': 2}),
]
# Custom class to return a meaningful .native attribute from CertStatus()
class StatusGood(Null):
def set(self, value):
"""
Sets the value of the object
:param value:
None or 'good'
"""
if value is not None and value != 'good' and not isinstance(value, Null):
raise ValueError(unwrap(
'''
value must be one of None, "good", not %s
''',
repr(value)
))
self.contents = b''
@property
def native(self):
return 'good'
# Custom class to return a meaningful .native attribute from CertStatus()
class StatusUnknown(Null):
def set(self, value):
"""
Sets the value of the object
:param value:
None or 'unknown'
"""
if value is not None and value != 'unknown' and not isinstance(value, Null):
raise ValueError(unwrap(
'''
value must be one of None, "unknown", not %s
''',
repr(value)
))
self.contents = b''
@property
def native(self):
return 'unknown'
class RevokedInfo(Sequence):
_fields = [
('revocation_time', GeneralizedTime),
('revocation_reason', CRLReason, {'explicit': 0, 'optional': True}),
]
class CertStatus(Choice):
_alternatives = [
('good', StatusGood, {'implicit': 0}),
('revoked', RevokedInfo, {'implicit': 1}),
('unknown', StatusUnknown, {'implicit': 2}),
]
class CrlId(Sequence):
_fields = [
('crl_url', IA5String, {'explicit': 0, 'optional': True}),
('crl_num', Integer, {'explicit': 1, 'optional': True}),
('crl_time', GeneralizedTime, {'explicit': 2, 'optional': True}),
]
class SingleResponseExtensionId(ObjectIdentifier):
_map = {
'1.3.6.1.5.5.7.48.1.3': 'crl',
'1.3.6.1.5.5.7.48.1.6': 'archive_cutoff',
# These are CRLEntryExtension values from
# path_to_url
'2.5.29.21': 'crl_reason',
'2.5.29.24': 'invalidity_date',
'2.5.29.29': 'certificate_issuer',
# path_to_url#page-13
'1.3.6.1.4.1.11129.2.4.5': 'signed_certificate_timestamp_list',
}
class SingleResponseExtension(Sequence):
_fields = [
('extn_id', SingleResponseExtensionId),
('critical', Boolean, {'default': False}),
('extn_value', ParsableOctetString),
]
_oid_pair = ('extn_id', 'extn_value')
_oid_specs = {
'crl': CrlId,
'archive_cutoff': GeneralizedTime,
'crl_reason': CRLReason,
'invalidity_date': GeneralizedTime,
'certificate_issuer': GeneralNames,
'signed_certificate_timestamp_list': OctetString,
}
class SingleResponseExtensions(SequenceOf):
_child_spec = SingleResponseExtension
class SingleResponse(Sequence):
_fields = [
('cert_id', CertId),
('cert_status', CertStatus),
('this_update', GeneralizedTime),
('next_update', GeneralizedTime, {'explicit': 0, 'optional': True}),
('single_extensions', SingleResponseExtensions, {'explicit': 1, 'optional': True}),
]
_processed_extensions = False
_critical_extensions = None
_crl_value = None
_archive_cutoff_value = None
_crl_reason_value = None
_invalidity_date_value = None
_certificate_issuer_value = None
def _set_extensions(self):
"""
Sets common named extensions to private attributes and creates a list
of critical extensions
"""
self._critical_extensions = set()
for extension in self['single_extensions']:
name = extension['extn_id'].native
attribute_name = '_%s_value' % name
if hasattr(self, attribute_name):
setattr(self, attribute_name, extension['extn_value'].parsed)
if extension['critical'].native:
self._critical_extensions.add(name)
self._processed_extensions = True
@property
def critical_extensions(self):
"""
Returns a set of the names (or OID if not a known extension) of the
extensions marked as critical
:return:
A set of unicode strings
"""
if not self._processed_extensions:
self._set_extensions()
return self._critical_extensions
@property
def crl_value(self):
"""
This extension is used to locate the CRL that a certificate's revocation
is contained within.
:return:
None or a CrlId object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._crl_value
@property
def archive_cutoff_value(self):
"""
This extension is used to indicate the date at which an archived
(historical) certificate status entry will no longer be available.
:return:
None or a GeneralizedTime object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._archive_cutoff_value
@property
def crl_reason_value(self):
"""
This extension indicates the reason that a certificate was revoked.
:return:
None or a CRLReason object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._crl_reason_value
@property
def invalidity_date_value(self):
"""
This extension indicates the suspected date/time the private key was
compromised or the certificate became invalid. This would usually be
before the revocation date, which is when the CA processed the
revocation.
:return:
None or a GeneralizedTime object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._invalidity_date_value
@property
def certificate_issuer_value(self):
"""
This extension indicates the issuer of the certificate in question.
:return:
None or an x509.GeneralNames object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._certificate_issuer_value
class Responses(SequenceOf):
_child_spec = SingleResponse
class ResponseDataExtensionId(ObjectIdentifier):
_map = {
'1.3.6.1.5.5.7.48.1.2': 'nonce',
'1.3.6.1.5.5.7.48.1.9': 'extended_revoke',
}
class ResponseDataExtension(Sequence):
_fields = [
('extn_id', ResponseDataExtensionId),
('critical', Boolean, {'default': False}),
('extn_value', ParsableOctetString),
]
_oid_pair = ('extn_id', 'extn_value')
_oid_specs = {
'nonce': OctetString,
'extended_revoke': Null,
}
class ResponseDataExtensions(SequenceOf):
_child_spec = ResponseDataExtension
class ResponseData(Sequence):
_fields = [
('version', Version, {'explicit': 0, 'default': 'v1'}),
('responder_id', ResponderId),
('produced_at', GeneralizedTime),
('responses', Responses),
('response_extensions', ResponseDataExtensions, {'explicit': 1, 'optional': True}),
]
class BasicOCSPResponse(Sequence):
_fields = [
('tbs_response_data', ResponseData),
('signature_algorithm', SignedDigestAlgorithm),
('signature', OctetBitString),
('certs', Certificates, {'explicit': 0, 'optional': True}),
]
class ResponseBytes(Sequence):
_fields = [
('response_type', ResponseType),
('response', ParsableOctetString),
]
_oid_pair = ('response_type', 'response')
_oid_specs = {
'basic_ocsp_response': BasicOCSPResponse,
}
class OCSPResponse(Sequence):
_fields = [
('response_status', OCSPResponseStatus),
('response_bytes', ResponseBytes, {'explicit': 0, 'optional': True}),
]
_processed_extensions = False
_critical_extensions = None
_nonce_value = None
_extended_revoke_value = None
def _set_extensions(self):
"""
Sets common named extensions to private attributes and creates a list
of critical extensions
"""
self._critical_extensions = set()
for extension in self['response_bytes']['response'].parsed['tbs_response_data']['response_extensions']:
name = extension['extn_id'].native
attribute_name = '_%s_value' % name
if hasattr(self, attribute_name):
setattr(self, attribute_name, extension['extn_value'].parsed)
if extension['critical'].native:
self._critical_extensions.add(name)
self._processed_extensions = True
@property
def critical_extensions(self):
"""
Returns a set of the names (or OID if not a known extension) of the
extensions marked as critical
:return:
A set of unicode strings
"""
if not self._processed_extensions:
self._set_extensions()
return self._critical_extensions
@property
def nonce_value(self):
"""
This extension is used to prevent replay attacks on the request/response
exchange
:return:
None or an OctetString object
"""
if self._processed_extensions is False:
self._set_extensions()
return self._nonce_value
@property
def extended_revoke_value(self):
"""
This extension is used to signal that the responder will return a
"revoked" status for non-issued certificates.
:return:
None or a Null object (if present)
"""
if self._processed_extensions is False:
self._set_extensions()
return self._extended_revoke_value
@property
def basic_ocsp_response(self):
"""
A shortcut into the BasicOCSPResponse sequence
:return:
None or an asn1crypto.ocsp.BasicOCSPResponse object
"""
return self['response_bytes']['response'].parsed
@property
def response_data(self):
"""
A shortcut into the parsed, ResponseData sequence
:return:
None or an asn1crypto.ocsp.ResponseData object
"""
return self['response_bytes']['response'].parsed['tbs_response_data']
```
|
```javascript
import { Component, createElement } from 'react'
import { connectFactory } from 'fela-bindings'
import { RendererContext, ThemeContext } from './context'
export default connectFactory(
Component,
createElement,
RendererContext,
ThemeContext
)
```
|
Begun in 1981, ATYP – Academically Talented Youth Programs – is a K-12/higher education collaborative model that works cooperatively with over 60 public and private school districts.
Seventh through ninth graders are assessed for their higher-level math and verbal potential identified through the Midwest Academic Talent Search (MATS). They attend ATYP's weekly 2.5-hour class. The student's SAT scores, rather than their grade level, indicate their readiness for the classes. Qualifying scores, set at levels similar to Talent Search’s summer programs, use the SAT verbal score to indicate readiness for the writing/literature class. The SAT math score, and combined math plus verbal score, qualify students for the math class. Because the program focuses on serving higher levels of potential, very few students qualify for both the English and the math class.
The students’ motivation to work hard alongside their commitment to the program's rigor contributes to their ultimate success. Independent and small group work helps students complete the 6-8 hour weekly homework assignment. Housed on the campus of Western Michigan University in Kalamazoo and Grand Valley State University in Grand Rapids, ATYP provides fast-paced classes during the school year, in conjunction with the student's regular school schedule. ATYP's first two years cover pre-AP content; the third year focuses at the AP English Language and Composition / AP English Literature and Composition and Pre-Calculus / AP Statistics level. Because the course's students need to be challenged at all ages, not only at high school age, the ATYP model begins to identify students who will perform well in the classes at as early as 5th grade. Once identified, the students are invited to take the SAT or ACT to see if they can qualify.
References
https://web.archive.org/web/20070726030439/http://www.ctd.northwestern.edu/resources/inschooloptions/atyp.html
https://web.archive.org/web/20070208203815/http://www.wmich.edu/honors/atyp/index.html
Gifted education
|
Sapranthus palanga, commonly known as palanca, is a species of cauliflorous tree in the family Annonaceae, native to the tropical regions of Central America, especially Costa Rica.
This species was recently separated from Sapranthus violaceus, on the basis of cauliflory (flowers emerging from the side of stem instead of shoots).
The flowers are dark purple when mature and emit amines such as putrescine and cadaverine which mimic the smell of a rotting carcass to attract target pollinating agents such as flies.
Footnotes
References
(2018): Revision of the Neotropical genus Sapranthus (Annonaceae) PDF fulltext
Zamora, N.1999. Annonaceae. En Manual de Plantas de Costa Rica. Missouri Botanical Garden- Instituto Nacional de Biodiversidad- Museo Nacional de Costa Rica.
Annonaceae
Cauliflory
Trees of Costa Rica
Trees of Central America
Trees of El Salvador
|
```javascript
'use strict';
const EventEmitter = require('events');
const Task = require('./task');
const Scheduler = require('./scheduler');
const uuid = require('uuid');
class ScheduledTask extends EventEmitter {
constructor(cronExpression, func, options) {
super();
if(!options){
options = {
scheduled: true,
recoverMissedExecutions: false
};
}
this.options = options;
this.options.name = this.options.name || uuid.v4();
this._task = new Task(func);
this._scheduler = new Scheduler(cronExpression, options.timezone, options.recoverMissedExecutions);
this._scheduler.on('scheduled-time-matched', (now) => {
this.now(now);
});
if(options.scheduled !== false){
this._scheduler.start();
}
if(options.runOnInit === true){
this.now('init');
}
}
now(now = 'manual') {
let result = this._task.execute(now);
this.emit('task-done', result);
}
start() {
this._scheduler.start();
}
stop() {
this._scheduler.stop();
}
}
module.exports = ScheduledTask;
```
|
Xenopirostris is a genus of birds in the family Vangidae. They are all endemic to Madagascar.
Species
It contains the following species:
References
Bird genera
Taxa named by Charles Lucien Bonaparte
Taxonomy articles created by Polbot
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.