text
stringlengths 1
22.8M
|
|---|
```c++
/*******************************************************************************
*
*
* 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.
*******************************************************************************/
#include <compiler/ir/easy_build.hpp>
#include <compiler/ir/ir_comparer.hpp>
#include <compiler/ir/ir_module.hpp>
#include <compiler/ir/pass/dependency_analyzer.hpp>
#include <compiler/ir/sc_stmt.hpp>
#include <compiler/ir/transform/dead_write_eliminate.hpp>
#include <compiler/ir/viewer.hpp>
#include <iostream>
#include "gtest/gtest.h"
using namespace dnnl::impl::graph::gc;
using dependency_analysis::stmt_weak_set;
namespace ut {
using namespace dnnl::impl::graph::gc;
class dep_printer_t : public ir_viewer_t {
void view(assign_c v) override {
std::cout << "IR=" << v << "\ndepended by:\n";
auto &dep = dependency_analysis::get_dep_info(v.get());
for (auto v : dep.depended_by_) {
auto ptr = v.lock();
assert(ptr);
std::cout << '\t' << ptr.get() << '\n';
}
std::cout << "depending on:\n";
for (auto v : dep.depends_on_) {
auto ptr = v.lock();
assert(ptr);
std::cout << '\t' << ptr.get() << '\n';
}
}
};
} // namespace ut
static std::shared_ptr<stmt_base_t> get_builder_top() {
return builder::get_current_builder()
->get_current_scope()
.as_seq()
.back()
.impl;
}
static void check_dep(const std::shared_ptr<stmt_base_t> &ptr,
const stmt_weak_set &depended_by, const stmt_weak_set &depends_on) {
auto &dep = dependency_analysis::get_dep_info(ptr.get());
bool result = dep.depended_by_ == depended_by;
if (!result) { std::cout << "depended_by failed:" << ptr.get() << "\n"; }
EXPECT_TRUE(result);
result = dep.depends_on_ == depends_on;
if (!result) { std::cout << "depends_on failed:" << ptr.get() << "\n"; }
EXPECT_TRUE(result);
}
#define SAVE(v) v = get_builder_top();
TEST(GCCore_CPU_dependency_analyzer, TestDependency) {
builder::ir_builder_t builder;
std::shared_ptr<stmt_base_t> b_eq_3, c_eq_3, c_eq_4, c_eq_5, bc_eq_ab,
bc_eq_2, c_eq_bb, ab_eq_3, if_else_s, c_eq_ab, t_eq_ai, ai_eq_t,
loop_i;
_function_(datatypes::void_t, ccc, _arg_("A", datatypes::f32, {10000}),
_arg_("b", datatypes::s32)) {
_bind_(A, b);
_tensor_(B, datatypes::f32, 100);
_tensor_(D, datatypes::f32, 100);
b = 3;
SAVE(b_eq_3);
_var_(c, datatypes::s32);
c = 3;
SAVE(c_eq_3);
_if_(b == 2) {
c = 4;
SAVE(c_eq_4);
}
_else_ {
c = 5;
SAVE(c_eq_5);
}
SAVE(if_else_s);
B[c] = A[b];
SAVE(bc_eq_ab);
_for_(i, 0, 10) {
B[c] = 2;
SAVE(bc_eq_2);
c = B[b];
SAVE(c_eq_bb);
A[b] = 3;
SAVE(ab_eq_3);
c = A[b];
SAVE(c_eq_ab);
}
_for_(i, 0, 10) {
_var_(t, datatypes::s32);
t = D[i];
SAVE(t_eq_ai);
D[i] = t + 1;
SAVE(ai_eq_t);
}
SAVE(loop_i);
}
dependency_analyzer_t ana;
ana(ccc);
// ut::dep_printer_t p;
// p.dispatch(ccc);
check_dep(b_eq_3, {c_eq_ab, if_else_s, ab_eq_3, c_eq_bb, bc_eq_ab}, {});
check_dep(c_eq_3, {c_eq_bb, bc_eq_2, bc_eq_ab, c_eq_4, c_eq_5}, {});
check_dep(c_eq_4, {c_eq_bb, bc_eq_2, bc_eq_ab}, {c_eq_3});
check_dep(c_eq_5, {c_eq_bb, bc_eq_2, bc_eq_ab}, {c_eq_3});
check_dep(bc_eq_ab, {c_eq_ab, c_eq_bb, bc_eq_2, ab_eq_3},
{b_eq_3, c_eq_5, c_eq_3, c_eq_4});
check_dep(bc_eq_2, {c_eq_bb}, {c_eq_bb, bc_eq_ab, c_eq_5, c_eq_3, c_eq_4});
check_dep(c_eq_bb, {c_eq_ab, bc_eq_2},
{bc_eq_2, bc_eq_ab, c_eq_5, c_eq_3, c_eq_4, b_eq_3});
check_dep(ab_eq_3, {c_eq_ab}, {b_eq_3, bc_eq_ab, c_eq_ab});
check_dep(c_eq_ab, {ab_eq_3}, {ab_eq_3, bc_eq_ab, c_eq_bb, b_eq_3});
check_dep(t_eq_ai, {ai_eq_t}, {loop_i});
check_dep(ai_eq_t, {}, {loop_i, t_eq_ai});
}
TEST(GCCore_CPU_dead_write_elimination, TestDWE) {
builder::ir_builder_t builder;
auto mod = std::make_shared<ir_module_t>(get_default_context());
_global_tensor_(mod, G, datatypes::f32, 100);
_function_(datatypes::f32, ccc, _arg_("A", datatypes::f32, {10000})) {
_bind_(A);
_tensor_(B, datatypes::f32, 100);
_tensor_(C, datatypes::f32, 100);
_tensor_(D, datatypes::f32, 100);
_tensor_(E, datatypes::f32, 100);
// constant index, required by the code in the loop
C[1] = 1.0f;
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
_var_(t2, datatypes::f32);
_for_(j, 0, 100) {
t = D[j];
D[j] = t + 1;
}
t2 = B[i];
t = t + A[i] + G[i];
t = t * t2;
A[i] = C[1];
G[i] = t;
B[i] = t;
// constant index, dead write
C[0] = 1.0f;
// constant index, required by the code after the loop
C[2] = 1.0f;
// constant index, overlap with SIMD load
C[5] = 1.0f;
}
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
t = E[i];
t = t + 1;
E[i] = t;
}
_return_(C[2] + builder::make_reduce_add(C[span_t {{4}, 4}]));
}
dead_write_eliminator_t dwe;
auto out = dwe(ccc);
_function_(datatypes::f32, expected, _arg_("A", datatypes::f32, {10000})) {
_bind_(A);
_tensor_(B, datatypes::f32, 100);
_tensor_(C, datatypes::f32, 100);
_tensor_(D, datatypes::f32, 100);
_tensor_(E, datatypes::f32, 100);
C[1] = 1.0f;
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
_var_(t2, datatypes::f32);
_for_(j, 0, 100) {
t = D[j];
D[j] = t + 1;
}
t2 = B[i];
t = t + A[i] + G[i];
t = t * t2;
A[i] = C[1];
G[i] = t;
builder.push_scope();
builder.emit(builder.pop_scope());
builder.push_scope();
builder.emit(builder.pop_scope());
C[2] = 1.0f;
// constant index, overlap with SIMD load
C[5] = 1.0f;
}
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
t = E[i];
t = t + 1; // successful elimination
builder.push_scope();
builder.emit(builder.pop_scope());
}
_return_(C[2] + builder::make_reduce_add(C[span_t {{4}, 4}]));
}
ir_comparer cmper;
EXPECT_TRUE(cmper.compare(out, expected));
}
TEST(GCCore_CPU_dead_write_elimination, TestDWELoopIndependent) {
builder::ir_builder_t builder;
_function_(datatypes::f32, ccc, _arg_("A", datatypes::f32, {10000})) {
_bind_(A);
_tensor_(B, datatypes::f32, 100);
_var_(tid, datatypes::f32);
tid = 122;
B[tid] = 1.0f;
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
t = B[tid];
_if_(t == 1.0f) {
_var_(t2, datatypes::f32);
t2 = 2.0f;
B[tid] = t2;
}
}
_return_(0);
}
dead_write_eliminator_t dwe;
auto out = dwe(ccc);
EXPECT_TRUE(out == ccc);
}
```
|
Sittişah Mukrime Hatun (; "Keeper/Protector of the Şah'' and "hospitable"; 1430 - September 1486), know also as Sitti Hatun, was a Turkish princess, and the legal wife of Sultan Mehmed the Conqueror of the Ottoman Empire.
Early life
Sittişah Hatun was the daughter of Suleiman Beg, the sixth ruler of Dulkadir State. He is described as a man of unshapely corpulence and pathological sensuality but also as a skillful horseman and the owner of magnificent stables, possessed a considerable army of brave, devoted Turk men and was fabulously wealthy, two circumstances which in themselves sufficed to incline Murad toward the union of his son and heir with this respected noble families which centuries later, though dispossessed of its lands, was still revered as a family of royal blood. The Byzantine chronicler Ducas was convinced, not without reason, that one of the Sultan's chief motives in seeking this marriage was to obtain an ally against the arrogant Karamanids and Jahan Shah, the chief of the Turk men Black Sheep Tribe (Kara Koyunlu).
Marriage
Engagement
When Mehmed turned seventeen, his father decided that he should be married to a woman of inferior station for political purposes. The Sultan's choice fell on the wealthy and beautiful daughters of Süleyman Bey, the sixth ruler of Dulkadir State. It must have been in the winter of 1448-1449 that Murad summoned Çandarlı Halil Pasha, his trusted Grand Vizier, and informed him of the marriage plans. The Sultan declared that he wished the prince to marry and this time as he, Murad, saw fit. Halil Pasha approved wholeheartedly of his master's plan, whereupon they decided to choose one of Süleyman's daughters. The wife of Hizir Pasha, Governor of Amasya, was sent to Elbistan to select the bride in accordance with ancient custom. Her choice fell on Sittişah hatun, the most beautiful of the daughters; the intermediary kissed her eyes and put the engagement ring on the finger.
Wedding
Later the same matron, this time accompanied by Saruca Pasha, the Sultan's favoured adviser in family matters, returned to the court of Elbistan to bring the chosen bride home to Rumelia. The most distinguished nobles of the land escorted the young girl across the mountains to the former Ottoman capital of Bursa, where the judges, the ülema and the sheikhs of the religious orders came to meet her in solemn procession and then onward across the Dardanelles. At the news the cortege was approaching, Murad sent out the grandees of the realm from Edirne to meet his future daughter-in-law, who continued on the Sultan's residence with her imposing retinue.
The wedding took place on 15 December 1449 at Edirne and was celebrated with a great pomp for three months. Popular festivities of all sorts and poetry contests contributed to the rejoicings. The bridegroom, who had not been consulted on the choice of his bride, returned with her to Manisa immediately after the celebration. The marriage is seem to have childless and not very happy. Apparently, the whole arrangement was not to Mehmed's liking.
She was the last woman to legally marry an Ottoman sultan until the marriage between Suleiman the Magnificent and Hürrem Sultan in 1533/1534.
Due to their shared middle name, Sittişah is sometimes confused with Gülbahar Mükrime Hatun, another consort of Mehmed and mother of his successor Bayezid II.
After the accession to the throne of Bayezid II, son of Mehmed II, one of her nieces, Ayşe Hatun, daughter of her brother, became one of his consorts. As for Sittişah, also Ayşe was confused or exchanged and finally "merged" with Gülbahar Hatun, mother of Selim I, who for a long time was instead considered to be Ayşe's own son.
Death
Long After Mehmed had removed his court to Istanbul, Sittişah Hatun remained behind Edirne, where she lived, lonely and forsaken, until the end of September 1486. She was buried in her mausoleum inside the mosque she had built during the reign of Bayezid II, son of Mehmed and Gülbahar Hatun.
References
Sources
Year of birth unknown
1485 deaths
15th-century consorts of Ottoman sultans
Princesses
Dulkadirid princesses
|
The Smithies Peak, sometimes incorrectly called Smithies Towers, is a mountain in the Central Highlands region of Tasmania, Australia. The mountain is situated in the Cradle Mountain-Lake St Clair National Park.
At above sea level, it is the ninth-highest mountain in Tasmania, and is one of the summits of Cradle Mountain. The peak is composed of dolerite columns, similar to many of the other mountains in the area and rises above the glacially formed Dove Lake (), Lake Wilks and Crater Lake.
Cradle Mountain has four named summits. In order of height they are Cradle Mountain (); Smithies Peak; Weindorfers Tower (); and Little Horn ().
See also
Cradle Mountain-Lake St Clair National Park
List of highest mountains of Tasmania
References
External links
Tasmanian Parks and Wildlife Page
Photojournal covering Cradle Mountain as part of The Overland Track
Cradle Mountain Tourist Attraction
Parks and Wildlife Service Webcams
Central Highlands (Tasmania)
Mountains of Tasmania
Cradle Mountain-Lake St Clair National Park
|
```shell
Proxifying `ssh` connections
How to clear `iptables` rules
Find services running on your host
Disable `IPv6`
Get real network statistics with `slurm`
```
|
IARU may refer to:
International Amateur Radio Union
International Alliance of Research Universities
Irish Amateur Rowing Union - former title of Rowing Ireland
An alternative spelling for Aaru in ancient Egyptian mythology
|
Fred Hembeck (born January 30, 1953) is an American cartoonist best known for his parodies of characters from major American comic book publishers. His work has frequently been published by the firms whose characters he spoofs. His characters are always drawn with curlicues at the elbows and knees. He often portrays himself as a character in his own work, in the role of "interviewer" of various comic book characters. Interviewer Daniel Best has said of his work, "If you take your comic books seriously, and think that those characters are real, then you're probably not a fan of Hembeck."
Early life
Hembeck was born January 30, 1953. He grew up in Yaphank, Long Island.
Career
Fresh out of college, and failing to get work as a traditional comic book artist, Hembeck developed a unique artistic style based on the version of himself he used to write illustrated letters to his college friends. Hembeck used this character to conduct comedic "interviews" with Spider-Man and the Flash, which he sent to the leading fan publication of the day, The Buyer's Guide for Comic Fandom (later known as the Comics Buyer's Guide). Much to his surprise, the submissions were published, and Hembeck's strip, called "Dateline: @!!?#", became a popular feature. The "best" of these strips were published in Hembeck: The Best of Dateline: @!!?#, put out by Eclipse Comics in 1979 and reprinted by FantaCo Enterprises in 1980.
From 1979 to 1981, Hembeck wrote and drew a 3-panel comic strip that appeared in the Daily Planet page of DC comic books. (The Daily Planet featured news on current and upcoming DC comics and answers to reader questions.)
From 1980 to 1983, FantaCo produced a series of black-and-white magazine-format books featuring Hembeck's stories and strips. Hembeck also contributed humor pieces to other FantaCo titles, including Smilin’ Ed, the Chronicles series, Gates of Eden, and Alien Encounters. Hembeck wrote and laid out the artwork for Fantastic Four Roast #1 (May 1982), a one-shot which commemorated the 20th anniversary of the Fantastic Four series.
Marvel Age and Brother Voodoo
Hembeck was especially visible in the 1980s when his strips appeared regularly in Marvel Age, a Marvel Comics promotional magazine. Because Hembeck has a particular fascination with the minor Marvel Comics character Brother Voodoo, he regularly featured the character in the cartoons he drew each month in Marvel Age, generally depicting him as a lame character constantly trying (and failing) to get his own series. He introduced Brother Voodoo's sister and nephew: Sister Voodoo and Voodoo Chile.
When Brother Voodoo finally got his own solo story in Marvel Super-Heroes vol. 3 #1, Hembeck drew it, in a serious art style very different from his normal cartooning look.
In his cartoon in the final issue of Marvel Age Hembeck claimed he had only begun mocking Brother Voodoo because he had the character confused with an "even lamer" Silver Age character, DC's Brother Power the Geek.
Other publications
Hembeck has also been published by First Comics, Krause Publications, Comic Shop News, Fantagraphics Books, Topps Comics, TwoMorrows Publishing, and Archie Comics.
Many of Hembeck's past strips are available through his website.
Parody
Although most of Hembeck's work is itself parody, Hembeck and his drawing style have also been the subject of parody:
In issue #3 of the first Omega Men series (drawn by Keith Giffen), a team member named "Humbek" appears, drawn in a style approximating that of Hembeck (as opposed to the more representational art of the rest of the issue). His thoughts reveal him to be an underground cartoonist exiled from his homeworld. Seconds later, he is killed by Lobo.
Later in issue #307 of the second volume of the Legion of Super-Heroes (also drawn by Giffen), the words "I killed Fred Humbeck" appear in the filigree of a panel border.
Bibliography
FantaCo Hembeck series
#1 — Hembeck: The Best of Dateline: @!!?# (first published by Eclipse in 1979, reprinted with 8 new pages by FantaCo in 1980)
#2 — Hembeck 1980 (1980)
#3 — Abbott and Costello Meet the Bride of Hembeck (1980)
#4 — Bah, Hembeck! (1980)
#5 — The Hembeck File (1981)
#6 — Jimmy Olsen's Pal, Fred Hembeck (1981)
#7 — Dial H for Hembeck (1983)
DC
'Mazing Man #7–10 (1986)
Marvel
Fantastic Four Roast (1982)
Spectacular Spider-Man #86 (1984)
Fred Hembeck Destroys the Marvel Universe (1989)
Fred Hembeck Sells the Marvel Universe (1990)
Marvel Super-Heroes vol. 3 #1 (1990)
Marvel Universe According to Hembeck (2016) (collects Fantastic Four Roast, Fred Hembeck Destroys the Marvel Universe, Fred Hembeck Sells the Marvel Universe, Spectacular Spider-Man #86 and more)
Image Comics
The Nearly Complete Essential Hembeck Archives Omnibus (2008) — 900+-page compilation of previously published strips and comics not owned by other companies, including all of the books published by FantaCo. Introduction by Stan Lee.
Notes
References
Hembeck bio at Lambiek.net
External links
Hembeck's weekly blog, Fred Sez
Hembeck's MySpace page
The Hembeck Files — digitally recolored archive of Hembeck's Daily Planet strips
Tim Powers and Sax Carr. FandomPlanet Podcast Episode 12 Geekscape.
1953 births
Living people
People from Yaphank, New York
Parody superheroes
Farmingdale State College alumni
University at Buffalo alumni
DC Comics people
Marvel Comics people
|
```shell
#!/bin/bash -e
on_chroot << EOF
SUDO_USER="${FIRST_USER_NAME}" raspi-config nonint do_wayland W2
EOF
```
|
```c
/* $Id: tif_fax3.c,v 1.74 2012-06-21 02:01:31 fwarmerdam Exp $ */
/*
*
* Permission to use, copy, modify, distribute, and sell this software and
* its documentation for any purpose is hereby granted without fee, provided
* that (i) the above copyright notices and this permission notice appear in
* all copies of the software and related documentation, and (ii) the names of
* Sam Leffler and Silicon Graphics may not be used in any advertising or
* publicity relating to the software without the specific, prior written
* permission of Sam Leffler and Silicon Graphics.
*
* THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND,
* EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
* WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
*
* IN NO EVENT SHALL SAM LEFFLER OR SILICON GRAPHICS BE LIABLE FOR
* ANY SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND,
* OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
* WHETHER OR NOT ADVISED OF THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF
* LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
* OF THIS SOFTWARE.
*/
#include "tiffiop.h"
#ifdef CCITT_SUPPORT
/*
* TIFF Library.
*
* CCITT Group 3 (T.4) and Group 4 (T.6) Compression Support.
*
* This file contains support for decoding and encoding TIFF
* compression algorithms 2, 3, 4, and 32771.
*
* Decoder support is derived, with permission, from the code
* in Frank Cringle's viewfax program;
*/
#include "tif_fax3.h"
#define G3CODES
#include "t4.h"
#include <stdio.h>
/*
* Compression+decompression state blocks are
* derived from this ``base state'' block.
*/
typedef struct {
int rw_mode; /* O_RDONLY for decode, else encode */
int mode; /* operating mode */
tmsize_t rowbytes; /* bytes in a decoded scanline */
uint32 rowpixels; /* pixels in a scanline */
uint16 cleanfaxdata; /* CleanFaxData tag */
uint32 badfaxrun; /* BadFaxRun tag */
uint32 badfaxlines; /* BadFaxLines tag */
uint32 groupoptions; /* Group 3/4 options tag */
TIFFVGetMethod vgetparent; /* super-class method */
TIFFVSetMethod vsetparent; /* super-class method */
TIFFPrintMethod printdir; /* super-class method */
} Fax3BaseState;
#define Fax3State(tif) ((Fax3BaseState*) (tif)->tif_data)
typedef enum { G3_1D, G3_2D } Ttag;
typedef struct {
Fax3BaseState b;
/* Decoder state info */
const unsigned char* bitmap; /* bit reversal table */
uint32 data; /* current i/o byte/word */
int bit; /* current i/o bit in byte */
int EOLcnt; /* count of EOL codes recognized */
TIFFFaxFillFunc fill; /* fill routine */
uint32* runs; /* b&w runs for current/previous row */
uint32* refruns; /* runs for reference line */
uint32* curruns; /* runs for current line */
/* Encoder state info */
Ttag tag; /* encoding state */
unsigned char* refline; /* reference line for 2d decoding */
int k; /* #rows left that can be 2d encoded */
int maxk; /* max #rows that can be 2d encoded */
int line;
} Fax3CodecState;
#define DecoderState(tif) ((Fax3CodecState*) Fax3State(tif))
#define EncoderState(tif) ((Fax3CodecState*) Fax3State(tif))
#define is2DEncoding(sp) (sp->b.groupoptions & GROUP3OPT_2DENCODING)
#define isAligned(p,t) ((((size_t)(p)) & (sizeof (t)-1)) == 0)
/*
* Group 3 and Group 4 Decoding.
*/
/*
* These macros glue the TIFF library state to
* the state expected by Frank's decoder.
*/
#define DECLARE_STATE(tif, sp, mod) \
static const char module[] = mod; \
Fax3CodecState* sp = DecoderState(tif); \
int a0; /* reference element */ \
int lastx = sp->b.rowpixels; /* last element in row */ \
uint32 BitAcc; /* bit accumulator */ \
int BitsAvail; /* # valid bits in BitAcc */ \
int RunLength; /* length of current run */ \
unsigned char* cp; /* next byte of input data */ \
unsigned char* ep; /* end of input data */ \
uint32* pa; /* place to stuff next run */ \
uint32* thisrun; /* current row's run array */ \
int EOLcnt; /* # EOL codes recognized */ \
const unsigned char* bitmap = sp->bitmap; /* input data bit reverser */ \
const TIFFFaxTabEnt* TabEnt
#define DECLARE_STATE_2D(tif, sp, mod) \
DECLARE_STATE(tif, sp, mod); \
int b1; /* next change on prev line */ \
uint32* pb /* next run in reference line */\
/*
* Load any state that may be changed during decoding.
*/
#define CACHE_STATE(tif, sp) do { \
BitAcc = sp->data; \
BitsAvail = sp->bit; \
EOLcnt = sp->EOLcnt; \
cp = (unsigned char*) tif->tif_rawcp; \
ep = cp + tif->tif_rawcc; \
} while (0)
/*
* Save state possibly changed during decoding.
*/
#define UNCACHE_STATE(tif, sp) do { \
sp->bit = BitsAvail; \
sp->data = BitAcc; \
sp->EOLcnt = EOLcnt; \
tif->tif_rawcc -= (tmsize_t)((uint8*) cp - tif->tif_rawcp); \
tif->tif_rawcp = (uint8*) cp; \
} while (0)
/*
* Setup state for decoding a strip.
*/
static int
Fax3PreDecode(TIFF* tif, uint16 s)
{
Fax3CodecState* sp = DecoderState(tif);
(void) s;
assert(sp != NULL);
sp->bit = 0; /* force initial read */
sp->data = 0;
sp->EOLcnt = 0; /* force initial scan for EOL */
/*
* Decoder assumes lsb-to-msb bit order. Note that we select
* this here rather than in Fax3SetupState so that viewers can
* hold the image open, fiddle with the FillOrder tag value,
* and then re-decode the image. Otherwise they'd need to close
* and open the image to get the state reset.
*/
sp->bitmap =
TIFFGetBitRevTable(tif->tif_dir.td_fillorder != FILLORDER_LSB2MSB);
if (sp->refruns) { /* init reference line to white */
sp->refruns[0] = (uint32) sp->b.rowpixels;
sp->refruns[1] = 0;
}
sp->line = 0;
return (1);
}
/*
* Routine for handling various errors/conditions.
* Note how they are "glued into the decoder" by
* overriding the definitions used by the decoder.
*/
static void
Fax3Unexpected(const char* module, TIFF* tif, uint32 line, uint32 a0)
{
TIFFErrorExt(tif->tif_clientdata, module, "Bad code word at line %u of %s %u (x %u)",
line, isTiled(tif) ? "tile" : "strip",
(isTiled(tif) ? tif->tif_curtile : tif->tif_curstrip),
a0);
}
#define unexpected(table, a0) Fax3Unexpected(module, tif, sp->line, a0)
static void
Fax3Extension(const char* module, TIFF* tif, uint32 line, uint32 a0)
{
TIFFErrorExt(tif->tif_clientdata, module,
"Uncompressed data (not supported) at line %u of %s %u (x %u)",
line, isTiled(tif) ? "tile" : "strip",
(isTiled(tif) ? tif->tif_curtile : tif->tif_curstrip),
a0);
}
#define extension(a0) Fax3Extension(module, tif, sp->line, a0)
static void
Fax3BadLength(const char* module, TIFF* tif, uint32 line, uint32 a0, uint32 lastx)
{
TIFFWarningExt(tif->tif_clientdata, module, "%s at line %u of %s %u (got %u, expected %u)",
a0 < lastx ? "Premature EOL" : "Line length mismatch",
line, isTiled(tif) ? "tile" : "strip",
(isTiled(tif) ? tif->tif_curtile : tif->tif_curstrip),
a0, lastx);
}
#define badlength(a0,lastx) Fax3BadLength(module, tif, sp->line, a0, lastx)
static void
Fax3PrematureEOF(const char* module, TIFF* tif, uint32 line, uint32 a0)
{
TIFFWarningExt(tif->tif_clientdata, module, "Premature EOF at line %u of %s %u (x %u)",
line, isTiled(tif) ? "tile" : "strip",
(isTiled(tif) ? tif->tif_curtile : tif->tif_curstrip),
a0);
}
#define prematureEOF(a0) Fax3PrematureEOF(module, tif, sp->line, a0)
#define Nop
/*
* Decode the requested amount of G3 1D-encoded data.
*/
static int
Fax3Decode1D(TIFF* tif, uint8* buf, tmsize_t occ, uint16 s)
{
DECLARE_STATE(tif, sp, "Fax3Decode1D");
(void) s;
if (occ % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be read");
return (-1);
}
CACHE_STATE(tif, sp);
thisrun = sp->curruns;
while (occ > 0) {
a0 = 0;
RunLength = 0;
pa = thisrun;
#ifdef FAX3_DEBUG
printf("\nBitAcc=%08X, BitsAvail = %d\n", BitAcc, BitsAvail);
printf("-------------------- %d\n", tif->tif_row);
fflush(stdout);
#endif
SYNC_EOL(EOF1D);
EXPAND1D(EOF1Da);
(*sp->fill)(buf, thisrun, pa, lastx);
buf += sp->b.rowbytes;
occ -= sp->b.rowbytes;
sp->line++;
continue;
EOF1D: /* premature EOF */
CLEANUP_RUNS();
EOF1Da: /* premature EOF */
(*sp->fill)(buf, thisrun, pa, lastx);
UNCACHE_STATE(tif, sp);
return (-1);
}
UNCACHE_STATE(tif, sp);
return (1);
}
#define SWAP(t,a,b) { t x; x = (a); (a) = (b); (b) = x; }
/*
* Decode the requested amount of G3 2D-encoded data.
*/
static int
Fax3Decode2D(TIFF* tif, uint8* buf, tmsize_t occ, uint16 s)
{
DECLARE_STATE_2D(tif, sp, "Fax3Decode2D");
int is1D; /* current line is 1d/2d-encoded */
(void) s;
if (occ % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be read");
return (-1);
}
CACHE_STATE(tif, sp);
while (occ > 0) {
a0 = 0;
RunLength = 0;
pa = thisrun = sp->curruns;
#ifdef FAX3_DEBUG
printf("\nBitAcc=%08X, BitsAvail = %d EOLcnt = %d",
BitAcc, BitsAvail, EOLcnt);
#endif
SYNC_EOL(EOF2D);
NeedBits8(1, EOF2D);
is1D = GetBits(1); /* 1D/2D-encoding tag bit */
ClrBits(1);
#ifdef FAX3_DEBUG
printf(" %s\n-------------------- %d\n",
is1D ? "1D" : "2D", tif->tif_row);
fflush(stdout);
#endif
pb = sp->refruns;
b1 = *pb++;
if (is1D)
EXPAND1D(EOF2Da);
else
EXPAND2D(EOF2Da);
(*sp->fill)(buf, thisrun, pa, lastx);
SETVALUE(0); /* imaginary change for reference */
SWAP(uint32*, sp->curruns, sp->refruns);
buf += sp->b.rowbytes;
occ -= sp->b.rowbytes;
sp->line++;
continue;
EOF2D: /* premature EOF */
CLEANUP_RUNS();
EOF2Da: /* premature EOF */
(*sp->fill)(buf, thisrun, pa, lastx);
UNCACHE_STATE(tif, sp);
return (-1);
}
UNCACHE_STATE(tif, sp);
return (1);
}
#undef SWAP
/*
* The ZERO & FILL macros must handle spans < 2*sizeof(long) bytes.
* For machines with 64-bit longs this is <16 bytes; otherwise
* this is <8 bytes. We optimize the code here to reflect the
* machine characteristics.
*/
#if SIZEOF_UNSIGNED_LONG == 8
# define FILL(n, cp) \
switch (n) { \
case 15:(cp)[14] = 0xff; case 14:(cp)[13] = 0xff; case 13: (cp)[12] = 0xff;\
case 12:(cp)[11] = 0xff; case 11:(cp)[10] = 0xff; case 10: (cp)[9] = 0xff;\
case 9: (cp)[8] = 0xff; case 8: (cp)[7] = 0xff; case 7: (cp)[6] = 0xff;\
case 6: (cp)[5] = 0xff; case 5: (cp)[4] = 0xff; case 4: (cp)[3] = 0xff;\
case 3: (cp)[2] = 0xff; case 2: (cp)[1] = 0xff; \
case 1: (cp)[0] = 0xff; (cp) += (n); case 0: ; \
}
# define ZERO(n, cp) \
switch (n) { \
case 15:(cp)[14] = 0; case 14:(cp)[13] = 0; case 13: (cp)[12] = 0; \
case 12:(cp)[11] = 0; case 11:(cp)[10] = 0; case 10: (cp)[9] = 0; \
case 9: (cp)[8] = 0; case 8: (cp)[7] = 0; case 7: (cp)[6] = 0; \
case 6: (cp)[5] = 0; case 5: (cp)[4] = 0; case 4: (cp)[3] = 0; \
case 3: (cp)[2] = 0; case 2: (cp)[1] = 0; \
case 1: (cp)[0] = 0; (cp) += (n); case 0: ; \
}
#else
# define FILL(n, cp) \
switch (n) { \
case 7: (cp)[6] = 0xff; case 6: (cp)[5] = 0xff; case 5: (cp)[4] = 0xff; \
case 4: (cp)[3] = 0xff; case 3: (cp)[2] = 0xff; case 2: (cp)[1] = 0xff; \
case 1: (cp)[0] = 0xff; (cp) += (n); case 0: ; \
}
# define ZERO(n, cp) \
switch (n) { \
case 7: (cp)[6] = 0; case 6: (cp)[5] = 0; case 5: (cp)[4] = 0; \
case 4: (cp)[3] = 0; case 3: (cp)[2] = 0; case 2: (cp)[1] = 0; \
case 1: (cp)[0] = 0; (cp) += (n); case 0: ; \
}
#endif
/*
* Bit-fill a row according to the white/black
* runs generated during G3/G4 decoding.
*/
void
_TIFFFax3fillruns(unsigned char* buf, uint32* runs, uint32* erun, uint32 lastx)
{
static const unsigned char _fillmasks[] =
{ 0x00, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xff };
unsigned char* cp;
uint32 x, bx, run;
int32 n, nw;
long* lp;
if ((erun-runs)&1)
*erun++ = 0;
x = 0;
for (; runs < erun; runs += 2) {
run = runs[0];
if (x+run > lastx || run > lastx )
run = runs[0] = (uint32) (lastx - x);
if (run) {
cp = buf + (x>>3);
bx = x&7;
if (run > 8-bx) {
if (bx) { /* align to byte boundary */
*cp++ &= 0xff << (8-bx);
run -= 8-bx;
}
if( (n = run >> 3) != 0 ) { /* multiple bytes to fill */
if ((n/sizeof (long)) > 1) {
/*
* Align to longword boundary and fill.
*/
for (; n && !isAligned(cp, long); n--)
*cp++ = 0x00;
lp = (long*) cp;
nw = (int32)(n / sizeof (long));
n -= nw * sizeof (long);
do {
*lp++ = 0L;
} while (--nw);
cp = (unsigned char*) lp;
}
ZERO(n, cp);
run &= 7;
}
if (run)
cp[0] &= 0xff >> run;
} else
cp[0] &= ~(_fillmasks[run]>>bx);
x += runs[0];
}
run = runs[1];
if (x+run > lastx || run > lastx )
run = runs[1] = lastx - x;
if (run) {
cp = buf + (x>>3);
bx = x&7;
if (run > 8-bx) {
if (bx) { /* align to byte boundary */
*cp++ |= 0xff >> bx;
run -= 8-bx;
}
if( (n = run>>3) != 0 ) { /* multiple bytes to fill */
if ((n/sizeof (long)) > 1) {
/*
* Align to longword boundary and fill.
*/
for (; n && !isAligned(cp, long); n--)
*cp++ = 0xff;
lp = (long*) cp;
nw = (int32)(n / sizeof (long));
n -= nw * sizeof (long);
do {
*lp++ = -1L;
} while (--nw);
cp = (unsigned char*) lp;
}
FILL(n, cp);
run &= 7;
}
if (run)
cp[0] |= 0xff00 >> run;
} else
cp[0] |= _fillmasks[run]>>bx;
x += runs[1];
}
}
assert(x == lastx);
}
#undef ZERO
#undef FILL
static int
Fax3FixupTags(TIFF* tif)
{
(void) tif;
return (1);
}
/*
* Setup G3/G4-related compression/decompression state
* before data is processed. This routine is called once
* per image -- it sets up different state based on whether
* or not decoding or encoding is being done and whether
* 1D- or 2D-encoded data is involved.
*/
static int
Fax3SetupState(TIFF* tif)
{
static const char module[] = "Fax3SetupState";
TIFFDirectory* td = &tif->tif_dir;
Fax3BaseState* sp = Fax3State(tif);
int needsRefLine;
Fax3CodecState* dsp = (Fax3CodecState*) Fax3State(tif);
tmsize_t rowbytes;
uint32 rowpixels, nruns;
if (td->td_bitspersample != 1) {
TIFFErrorExt(tif->tif_clientdata, module,
"Bits/sample must be 1 for Group 3/4 encoding/decoding");
return (0);
}
/*
* Calculate the scanline/tile widths.
*/
if (isTiled(tif)) {
rowbytes = TIFFTileRowSize(tif);
rowpixels = td->td_tilewidth;
} else {
rowbytes = TIFFScanlineSize(tif);
rowpixels = td->td_imagewidth;
}
sp->rowbytes = rowbytes;
sp->rowpixels = rowpixels;
/*
* Allocate any additional space required for decoding/encoding.
*/
needsRefLine = (
(sp->groupoptions & GROUP3OPT_2DENCODING) ||
td->td_compression == COMPRESSION_CCITTFAX4
);
/*
Assure that allocation computations do not overflow.
TIFFroundup and TIFFSafeMultiply return zero on integer overflow
*/
dsp->runs=(uint32*) NULL;
nruns = TIFFroundup_32(rowpixels,32);
if (needsRefLine) {
nruns = TIFFSafeMultiply(uint32,nruns,2);
}
if ((nruns == 0) || (TIFFSafeMultiply(uint32,nruns,2) == 0)) {
TIFFErrorExt(tif->tif_clientdata, tif->tif_name,
"Row pixels integer overflow (rowpixels %u)",
rowpixels);
return (0);
}
dsp->runs = (uint32*) _TIFFCheckMalloc(tif,
TIFFSafeMultiply(uint32,nruns,2),
sizeof (uint32),
"for Group 3/4 run arrays");
if (dsp->runs == NULL)
return (0);
memset( dsp->runs, 0, TIFFSafeMultiply(uint32,nruns,2)*sizeof(uint32));
dsp->curruns = dsp->runs;
if (needsRefLine)
dsp->refruns = dsp->runs + nruns;
else
dsp->refruns = NULL;
if (td->td_compression == COMPRESSION_CCITTFAX3
&& is2DEncoding(dsp)) { /* NB: default is 1D routine */
tif->tif_decoderow = Fax3Decode2D;
tif->tif_decodestrip = Fax3Decode2D;
tif->tif_decodetile = Fax3Decode2D;
}
if (needsRefLine) { /* 2d encoding */
Fax3CodecState* esp = EncoderState(tif);
/*
* 2d encoding requires a scanline
* buffer for the ``reference line''; the
* scanline against which delta encoding
* is referenced. The reference line must
* be initialized to be ``white'' (done elsewhere).
*/
esp->refline = (unsigned char*) _TIFFmalloc(rowbytes);
if (esp->refline == NULL) {
TIFFErrorExt(tif->tif_clientdata, module,
"No space for Group 3/4 reference line");
return (0);
}
} else /* 1d encoding */
EncoderState(tif)->refline = NULL;
return (1);
}
/*
* CCITT Group 3 FAX Encoding.
*/
#define Fax3FlushBits(tif, sp) { \
if ((tif)->tif_rawcc >= (tif)->tif_rawdatasize) \
(void) TIFFFlushData1(tif); \
*(tif)->tif_rawcp++ = (uint8) (sp)->data; \
(tif)->tif_rawcc++; \
(sp)->data = 0, (sp)->bit = 8; \
}
#define _FlushBits(tif) { \
if ((tif)->tif_rawcc >= (tif)->tif_rawdatasize) \
(void) TIFFFlushData1(tif); \
*(tif)->tif_rawcp++ = (uint8) data; \
(tif)->tif_rawcc++; \
data = 0, bit = 8; \
}
static const int _msbmask[9] =
{ 0x00, 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff };
#define _PutBits(tif, bits, length) { \
while (length > bit) { \
data |= bits >> (length - bit); \
length -= bit; \
_FlushBits(tif); \
} \
assert( length < 9 ); \
data |= (bits & _msbmask[length]) << (bit - length); \
bit -= length; \
if (bit == 0) \
_FlushBits(tif); \
}
/*
* Write a variable-length bit-value to
* the output stream. Values are
* assumed to be at most 16 bits.
*/
static void
Fax3PutBits(TIFF* tif, unsigned int bits, unsigned int length)
{
Fax3CodecState* sp = EncoderState(tif);
unsigned int bit = sp->bit;
int data = sp->data;
_PutBits(tif, bits, length);
sp->data = data;
sp->bit = bit;
}
/*
* Write a code to the output stream.
*/
#define putcode(tif, te) Fax3PutBits(tif, (te)->code, (te)->length)
#ifdef FAX3_DEBUG
#define DEBUG_COLOR(w) (tab == TIFFFaxWhiteCodes ? w "W" : w "B")
#define DEBUG_PRINT(what,len) { \
int t; \
printf("%08X/%-2d: %s%5d\t", data, bit, DEBUG_COLOR(what), len); \
for (t = length-1; t >= 0; t--) \
putchar(code & (1<<t) ? '1' : '0'); \
putchar('\n'); \
}
#endif
/*
* Write the sequence of codes that describes
* the specified span of zero's or one's. The
* appropriate table that holds the make-up and
* terminating codes is supplied.
*/
static void
putspan(TIFF* tif, int32 span, const tableentry* tab)
{
Fax3CodecState* sp = EncoderState(tif);
unsigned int bit = sp->bit;
int data = sp->data;
unsigned int code, length;
while (span >= 2624) {
const tableentry* te = &tab[63 + (2560>>6)];
code = te->code, length = te->length;
#ifdef FAX3_DEBUG
DEBUG_PRINT("MakeUp", te->runlen);
#endif
_PutBits(tif, code, length);
span -= te->runlen;
}
if (span >= 64) {
const tableentry* te = &tab[63 + (span>>6)];
assert(te->runlen == 64*(span>>6));
code = te->code, length = te->length;
#ifdef FAX3_DEBUG
DEBUG_PRINT("MakeUp", te->runlen);
#endif
_PutBits(tif, code, length);
span -= te->runlen;
}
code = tab[span].code, length = tab[span].length;
#ifdef FAX3_DEBUG
DEBUG_PRINT(" Term", tab[span].runlen);
#endif
_PutBits(tif, code, length);
sp->data = data;
sp->bit = bit;
}
/*
* Write an EOL code to the output stream. The zero-fill
* logic for byte-aligning encoded scanlines is handled
* here. We also handle writing the tag bit for the next
* scanline when doing 2d encoding.
*/
static void
Fax3PutEOL(TIFF* tif)
{
Fax3CodecState* sp = EncoderState(tif);
unsigned int bit = sp->bit;
int data = sp->data;
unsigned int code, length, tparm;
if (sp->b.groupoptions & GROUP3OPT_FILLBITS) {
/*
* Force bit alignment so EOL will terminate on
* a byte boundary. That is, force the bit alignment
* to 16-12 = 4 before putting out the EOL code.
*/
int align = 8 - 4;
if (align != sp->bit) {
if (align > sp->bit)
align = sp->bit + (8 - align);
else
align = sp->bit - align;
code = 0;
tparm=align;
_PutBits(tif, 0, tparm);
}
}
code = EOL, length = 12;
if (is2DEncoding(sp))
code = (code<<1) | (sp->tag == G3_1D), length++;
_PutBits(tif, code, length);
sp->data = data;
sp->bit = bit;
}
/*
* Reset encoding state at the start of a strip.
*/
static int
Fax3PreEncode(TIFF* tif, uint16 s)
{
Fax3CodecState* sp = EncoderState(tif);
(void) s;
assert(sp != NULL);
sp->bit = 8;
sp->data = 0;
sp->tag = G3_1D;
/*
* This is necessary for Group 4; otherwise it isn't
* needed because the first scanline of each strip ends
* up being copied into the refline.
*/
if (sp->refline)
_TIFFmemset(sp->refline, 0x00, sp->b.rowbytes);
if (is2DEncoding(sp)) {
float res = tif->tif_dir.td_yresolution;
/*
* The CCITT spec says that when doing 2d encoding, you
* should only do it on K consecutive scanlines, where K
* depends on the resolution of the image being encoded
* (2 for <= 200 lpi, 4 for > 200 lpi). Since the directory
* code initializes td_yresolution to 0, this code will
* select a K of 2 unless the YResolution tag is set
* appropriately. (Note also that we fudge a little here
* and use 150 lpi to avoid problems with units conversion.)
*/
if (tif->tif_dir.td_resolutionunit == RESUNIT_CENTIMETER)
res *= 2.54f; /* convert to inches */
sp->maxk = (res > 150 ? 4 : 2);
sp->k = sp->maxk-1;
} else
sp->k = sp->maxk = 0;
sp->line = 0;
return (1);
}
static const unsigned char zeroruns[256] = {
8, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, /* 0x00 - 0x0f */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* 0x10 - 0x1f */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0x20 - 0x2f */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0x30 - 0x3f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x40 - 0x4f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x50 - 0x5f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x60 - 0x6f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x70 - 0x7f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x80 - 0x8f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x90 - 0x9f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xa0 - 0xaf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xb0 - 0xbf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xc0 - 0xcf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xd0 - 0xdf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xe0 - 0xef */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xf0 - 0xff */
};
static const unsigned char oneruns[256] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x00 - 0x0f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x10 - 0x1f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x20 - 0x2f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x30 - 0x3f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x40 - 0x4f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x50 - 0x5f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x60 - 0x6f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x70 - 0x7f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x80 - 0x8f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x90 - 0x9f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0xa0 - 0xaf */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0xb0 - 0xbf */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0xc0 - 0xcf */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0xd0 - 0xdf */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* 0xe0 - 0xef */
4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 7, 8, /* 0xf0 - 0xff */
};
/*
* On certain systems it pays to inline
* the routines that find pixel spans.
*/
#ifdef VAXC
static int32 find0span(unsigned char*, int32, int32);
static int32 find1span(unsigned char*, int32, int32);
#pragma inline(find0span,find1span)
#endif
/*
* Find a span of ones or zeros using the supplied
* table. The ``base'' of the bit string is supplied
* along with the start+end bit indices.
*/
inline static int32
find0span(unsigned char* bp, int32 bs, int32 be)
{
int32 bits = be - bs;
int32 n, span;
bp += bs>>3;
/*
* Check partial byte on lhs.
*/
if (bits > 0 && (n = (bs & 7))) {
span = zeroruns[(*bp << n) & 0xff];
if (span > 8-n) /* table value too generous */
span = 8-n;
if (span > bits) /* constrain span to bit range */
span = bits;
if (n+span < 8) /* doesn't extend to edge of byte */
return (span);
bits -= span;
bp++;
} else
span = 0;
if (bits >= (int32)(2 * 8 * sizeof(long))) {
long* lp;
/*
* Align to longword boundary and check longwords.
*/
while (!isAligned(bp, long)) {
if (*bp != 0x00)
return (span + zeroruns[*bp]);
span += 8, bits -= 8;
bp++;
}
lp = (long*) bp;
while ((bits >= (int32)(8 * sizeof(long))) && (0 == *lp)) {
span += 8*sizeof (long), bits -= 8*sizeof (long);
lp++;
}
bp = (unsigned char*) lp;
}
/*
* Scan full bytes for all 0's.
*/
while (bits >= 8) {
if (*bp != 0x00) /* end of run */
return (span + zeroruns[*bp]);
span += 8, bits -= 8;
bp++;
}
/*
* Check partial byte on rhs.
*/
if (bits > 0) {
n = zeroruns[*bp];
span += (n > bits ? bits : n);
}
return (span);
}
inline static int32
find1span(unsigned char* bp, int32 bs, int32 be)
{
int32 bits = be - bs;
int32 n, span;
bp += bs>>3;
/*
* Check partial byte on lhs.
*/
if (bits > 0 && (n = (bs & 7))) {
span = oneruns[(*bp << n) & 0xff];
if (span > 8-n) /* table value too generous */
span = 8-n;
if (span > bits) /* constrain span to bit range */
span = bits;
if (n+span < 8) /* doesn't extend to edge of byte */
return (span);
bits -= span;
bp++;
} else
span = 0;
if (bits >= (int32)(2 * 8 * sizeof(long))) {
long* lp;
/*
* Align to longword boundary and check longwords.
*/
while (!isAligned(bp, long)) {
if (*bp != 0xff)
return (span + oneruns[*bp]);
span += 8, bits -= 8;
bp++;
}
lp = (long*) bp;
while ((bits >= (int32)(8 * sizeof(long))) && (~0 == *lp)) {
span += 8*sizeof (long), bits -= 8*sizeof (long);
lp++;
}
bp = (unsigned char*) lp;
}
/*
* Scan full bytes for all 1's.
*/
while (bits >= 8) {
if (*bp != 0xff) /* end of run */
return (span + oneruns[*bp]);
span += 8, bits -= 8;
bp++;
}
/*
* Check partial byte on rhs.
*/
if (bits > 0) {
n = oneruns[*bp];
span += (n > bits ? bits : n);
}
return (span);
}
/*
* Return the offset of the next bit in the range
* [bs..be] that is different from the specified
* color. The end, be, is returned if no such bit
* exists.
*/
#define finddiff(_cp, _bs, _be, _color) \
(_bs + (_color ? find1span(_cp,_bs,_be) : find0span(_cp,_bs,_be)))
/*
* Like finddiff, but also check the starting bit
* against the end in case start > end.
*/
#define finddiff2(_cp, _bs, _be, _color) \
(_bs < _be ? finddiff(_cp,_bs,_be,_color) : _be)
/*
* 1d-encode a row of pixels. The encoding is
* a sequence of all-white or all-black spans
* of pixels encoded with Huffman codes.
*/
static int
Fax3Encode1DRow(TIFF* tif, unsigned char* bp, uint32 bits)
{
Fax3CodecState* sp = EncoderState(tif);
int32 span;
uint32 bs = 0;
for (;;) {
span = find0span(bp, bs, bits); /* white span */
putspan(tif, span, TIFFFaxWhiteCodes);
bs += span;
if (bs >= bits)
break;
span = find1span(bp, bs, bits); /* black span */
putspan(tif, span, TIFFFaxBlackCodes);
bs += span;
if (bs >= bits)
break;
}
if (sp->b.mode & (FAXMODE_BYTEALIGN|FAXMODE_WORDALIGN)) {
if (sp->bit != 8) /* byte-align */
Fax3FlushBits(tif, sp);
if ((sp->b.mode&FAXMODE_WORDALIGN) &&
!isAligned(tif->tif_rawcp, uint16))
Fax3FlushBits(tif, sp);
}
return (1);
}
static const tableentry horizcode =
{ 3, 0x1, 0 }; /* 001 */
static const tableentry passcode =
{ 4, 0x1, 0 }; /* 0001 */
static const tableentry vcodes[7] = {
{ 7, 0x03, 0 }, /* 0000 011 */
{ 6, 0x03, 0 }, /* 0000 11 */
{ 3, 0x03, 0 }, /* 011 */
{ 1, 0x1, 0 }, /* 1 */
{ 3, 0x2, 0 }, /* 010 */
{ 6, 0x02, 0 }, /* 0000 10 */
{ 7, 0x02, 0 } /* 0000 010 */
};
/*
* 2d-encode a row of pixels. Consult the CCITT
* documentation for the algorithm.
*/
static int
Fax3Encode2DRow(TIFF* tif, unsigned char* bp, unsigned char* rp, uint32 bits)
{
#define PIXEL(buf,ix) ((((buf)[(ix)>>3]) >> (7-((ix)&7))) & 1)
uint32 a0 = 0;
uint32 a1 = (PIXEL(bp, 0) != 0 ? 0 : finddiff(bp, 0, bits, 0));
uint32 b1 = (PIXEL(rp, 0) != 0 ? 0 : finddiff(rp, 0, bits, 0));
uint32 a2, b2;
for (;;) {
b2 = finddiff2(rp, b1, bits, PIXEL(rp,b1));
if (b2 >= a1) {
int32 d = b1 - a1;
if (!(-3 <= d && d <= 3)) { /* horizontal mode */
a2 = finddiff2(bp, a1, bits, PIXEL(bp,a1));
putcode(tif, &horizcode);
if (a0+a1 == 0 || PIXEL(bp, a0) == 0) {
putspan(tif, a1-a0, TIFFFaxWhiteCodes);
putspan(tif, a2-a1, TIFFFaxBlackCodes);
} else {
putspan(tif, a1-a0, TIFFFaxBlackCodes);
putspan(tif, a2-a1, TIFFFaxWhiteCodes);
}
a0 = a2;
} else { /* vertical mode */
putcode(tif, &vcodes[d+3]);
a0 = a1;
}
} else { /* pass mode */
putcode(tif, &passcode);
a0 = b2;
}
if (a0 >= bits)
break;
a1 = finddiff(bp, a0, bits, PIXEL(bp,a0));
b1 = finddiff(rp, a0, bits, !PIXEL(bp,a0));
b1 = finddiff(rp, b1, bits, PIXEL(bp,a0));
}
return (1);
#undef PIXEL
}
/*
* Encode a buffer of pixels.
*/
static int
Fax3Encode(TIFF* tif, uint8* bp, tmsize_t cc, uint16 s)
{
static const char module[] = "Fax3Encode";
Fax3CodecState* sp = EncoderState(tif);
(void) s;
if (cc % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be written");
return (0);
}
while (cc > 0) {
if ((sp->b.mode & FAXMODE_NOEOL) == 0)
Fax3PutEOL(tif);
if (is2DEncoding(sp)) {
if (sp->tag == G3_1D) {
if (!Fax3Encode1DRow(tif, bp, sp->b.rowpixels))
return (0);
sp->tag = G3_2D;
} else {
if (!Fax3Encode2DRow(tif, bp, sp->refline,
sp->b.rowpixels))
return (0);
sp->k--;
}
if (sp->k == 0) {
sp->tag = G3_1D;
sp->k = sp->maxk-1;
} else
_TIFFmemcpy(sp->refline, bp, sp->b.rowbytes);
} else {
if (!Fax3Encode1DRow(tif, bp, sp->b.rowpixels))
return (0);
}
bp += sp->b.rowbytes;
cc -= sp->b.rowbytes;
}
return (1);
}
static int
Fax3PostEncode(TIFF* tif)
{
Fax3CodecState* sp = EncoderState(tif);
if (sp->bit != 8)
Fax3FlushBits(tif, sp);
return (1);
}
static void
Fax3Close(TIFF* tif)
{
if ((Fax3State(tif)->mode & FAXMODE_NORTC) == 0) {
Fax3CodecState* sp = EncoderState(tif);
unsigned int code = EOL;
unsigned int length = 12;
int i;
if (is2DEncoding(sp))
code = (code<<1) | (sp->tag == G3_1D), length++;
for (i = 0; i < 6; i++)
Fax3PutBits(tif, code, length);
Fax3FlushBits(tif, sp);
}
}
static void
Fax3Cleanup(TIFF* tif)
{
Fax3CodecState* sp = DecoderState(tif);
assert(sp != 0);
tif->tif_tagmethods.vgetfield = sp->b.vgetparent;
tif->tif_tagmethods.vsetfield = sp->b.vsetparent;
tif->tif_tagmethods.printdir = sp->b.printdir;
if (sp->runs)
_TIFFfree(sp->runs);
if (sp->refline)
_TIFFfree(sp->refline);
_TIFFfree(tif->tif_data);
tif->tif_data = NULL;
_TIFFSetDefaultCompressionState(tif);
}
#define FIELD_BADFAXLINES (FIELD_CODEC+0)
#define FIELD_CLEANFAXDATA (FIELD_CODEC+1)
#define FIELD_BADFAXRUN (FIELD_CODEC+2)
#define FIELD_OPTIONS (FIELD_CODEC+7)
static const TIFFField faxFields[] = {
{ TIFFTAG_FAXMODE, 0, 0, TIFF_ANY, 0, TIFF_SETGET_INT, TIFF_SETGET_UNDEFINED, FIELD_PSEUDO, FALSE, FALSE, "FaxMode", NULL },
{ TIFFTAG_FAXFILLFUNC, 0, 0, TIFF_ANY, 0, TIFF_SETGET_OTHER, TIFF_SETGET_UNDEFINED, FIELD_PSEUDO, FALSE, FALSE, "FaxFillFunc", NULL },
{ TIFFTAG_BADFAXLINES, 1, 1, TIFF_LONG, 0, TIFF_SETGET_UINT32, TIFF_SETGET_UINT32, FIELD_BADFAXLINES, TRUE, FALSE, "BadFaxLines", NULL },
{ TIFFTAG_CLEANFAXDATA, 1, 1, TIFF_SHORT, 0, TIFF_SETGET_UINT16, TIFF_SETGET_UINT16, FIELD_CLEANFAXDATA, TRUE, FALSE, "CleanFaxData", NULL },
{ TIFFTAG_CONSECUTIVEBADFAXLINES, 1, 1, TIFF_LONG, 0, TIFF_SETGET_UINT32, TIFF_SETGET_UINT32, FIELD_BADFAXRUN, TRUE, FALSE, "ConsecutiveBadFaxLines", NULL }};
static const TIFFField fax3Fields[] = {
{ TIFFTAG_GROUP3OPTIONS, 1, 1, TIFF_LONG, 0, TIFF_SETGET_UINT32, TIFF_SETGET_UINT32, FIELD_OPTIONS, FALSE, FALSE, "Group3Options", NULL },
};
static const TIFFField fax4Fields[] = {
{ TIFFTAG_GROUP4OPTIONS, 1, 1, TIFF_LONG, 0, TIFF_SETGET_UINT32, TIFF_SETGET_UINT32, FIELD_OPTIONS, FALSE, FALSE, "Group4Options", NULL },
};
static int
Fax3VSetField(TIFF* tif, uint32 tag, va_list ap)
{
Fax3BaseState* sp = Fax3State(tif);
const TIFFField* fip;
assert(sp != 0);
assert(sp->vsetparent != 0);
switch (tag) {
case TIFFTAG_FAXMODE:
sp->mode = (int) va_arg(ap, int);
return 1; /* NB: pseudo tag */
case TIFFTAG_FAXFILLFUNC:
DecoderState(tif)->fill = va_arg(ap, TIFFFaxFillFunc);
return 1; /* NB: pseudo tag */
case TIFFTAG_GROUP3OPTIONS:
/* XXX: avoid reading options if compression mismatches. */
if (tif->tif_dir.td_compression == COMPRESSION_CCITTFAX3)
sp->groupoptions = (uint32) va_arg(ap, uint32);
break;
case TIFFTAG_GROUP4OPTIONS:
/* XXX: avoid reading options if compression mismatches. */
if (tif->tif_dir.td_compression == COMPRESSION_CCITTFAX4)
sp->groupoptions = (uint32) va_arg(ap, uint32);
break;
case TIFFTAG_BADFAXLINES:
sp->badfaxlines = (uint32) va_arg(ap, uint32);
break;
case TIFFTAG_CLEANFAXDATA:
sp->cleanfaxdata = (uint16) va_arg(ap, uint16_vap);
break;
case TIFFTAG_CONSECUTIVEBADFAXLINES:
sp->badfaxrun = (uint32) va_arg(ap, uint32);
break;
default:
return (*sp->vsetparent)(tif, tag, ap);
}
if ((fip = TIFFFieldWithTag(tif, tag)))
TIFFSetFieldBit(tif, fip->field_bit);
else
return 0;
tif->tif_flags |= TIFF_DIRTYDIRECT;
return 1;
}
static int
Fax3VGetField(TIFF* tif, uint32 tag, va_list ap)
{
Fax3BaseState* sp = Fax3State(tif);
assert(sp != 0);
switch (tag) {
case TIFFTAG_FAXMODE:
*va_arg(ap, int*) = sp->mode;
break;
case TIFFTAG_FAXFILLFUNC:
*va_arg(ap, TIFFFaxFillFunc*) = DecoderState(tif)->fill;
break;
case TIFFTAG_GROUP3OPTIONS:
case TIFFTAG_GROUP4OPTIONS:
*va_arg(ap, uint32*) = sp->groupoptions;
break;
case TIFFTAG_BADFAXLINES:
*va_arg(ap, uint32*) = sp->badfaxlines;
break;
case TIFFTAG_CLEANFAXDATA:
*va_arg(ap, uint16*) = sp->cleanfaxdata;
break;
case TIFFTAG_CONSECUTIVEBADFAXLINES:
*va_arg(ap, uint32*) = sp->badfaxrun;
break;
default:
return (*sp->vgetparent)(tif, tag, ap);
}
return (1);
}
static void
Fax3PrintDir(TIFF* tif, FILE* fd, long flags)
{
Fax3BaseState* sp = Fax3State(tif);
assert(sp != 0);
(void) flags;
if (TIFFFieldSet(tif,FIELD_OPTIONS)) {
const char* sep = " ";
if (tif->tif_dir.td_compression == COMPRESSION_CCITTFAX4) {
fprintf(fd, " Group 4 Options:");
if (sp->groupoptions & GROUP4OPT_UNCOMPRESSED)
fprintf(fd, "%suncompressed data", sep);
} else {
fprintf(fd, " Group 3 Options:");
if (sp->groupoptions & GROUP3OPT_2DENCODING)
fprintf(fd, "%s2-d encoding", sep), sep = "+";
if (sp->groupoptions & GROUP3OPT_FILLBITS)
fprintf(fd, "%sEOL padding", sep), sep = "+";
if (sp->groupoptions & GROUP3OPT_UNCOMPRESSED)
fprintf(fd, "%suncompressed data", sep);
}
fprintf(fd, " (%lu = 0x%lx)\n",
(unsigned long) sp->groupoptions,
(unsigned long) sp->groupoptions);
}
if (TIFFFieldSet(tif,FIELD_CLEANFAXDATA)) {
fprintf(fd, " Fax Data:");
switch (sp->cleanfaxdata) {
case CLEANFAXDATA_CLEAN:
fprintf(fd, " clean");
break;
case CLEANFAXDATA_REGENERATED:
fprintf(fd, " receiver regenerated");
break;
case CLEANFAXDATA_UNCLEAN:
fprintf(fd, " uncorrected errors");
break;
}
fprintf(fd, " (%u = 0x%x)\n",
sp->cleanfaxdata, sp->cleanfaxdata);
}
if (TIFFFieldSet(tif,FIELD_BADFAXLINES))
fprintf(fd, " Bad Fax Lines: %lu\n",
(unsigned long) sp->badfaxlines);
if (TIFFFieldSet(tif,FIELD_BADFAXRUN))
fprintf(fd, " Consecutive Bad Fax Lines: %lu\n",
(unsigned long) sp->badfaxrun);
if (sp->printdir)
(*sp->printdir)(tif, fd, flags);
}
static int
InitCCITTFax3(TIFF* tif)
{
static const char module[] = "InitCCITTFax3";
Fax3BaseState* sp;
/*
* Merge codec-specific tag information.
*/
if (!_TIFFMergeFields(tif, faxFields, TIFFArrayCount(faxFields))) {
TIFFErrorExt(tif->tif_clientdata, "InitCCITTFax3",
"Merging common CCITT Fax codec-specific tags failed");
return 0;
}
/*
* Allocate state block so tag methods have storage to record values.
*/
tif->tif_data = (uint8*)
_TIFFmalloc(sizeof (Fax3CodecState));
if (tif->tif_data == NULL) {
TIFFErrorExt(tif->tif_clientdata, module,
"No space for state block");
return (0);
}
sp = Fax3State(tif);
sp->rw_mode = tif->tif_mode;
/*
* Override parent get/set field methods.
*/
sp->vgetparent = tif->tif_tagmethods.vgetfield;
tif->tif_tagmethods.vgetfield = Fax3VGetField; /* hook for codec tags */
sp->vsetparent = tif->tif_tagmethods.vsetfield;
tif->tif_tagmethods.vsetfield = Fax3VSetField; /* hook for codec tags */
sp->printdir = tif->tif_tagmethods.printdir;
tif->tif_tagmethods.printdir = Fax3PrintDir; /* hook for codec tags */
sp->groupoptions = 0;
if (sp->rw_mode == O_RDONLY) /* FIXME: improve for in place update */
tif->tif_flags |= TIFF_NOBITREV; /* decoder does bit reversal */
DecoderState(tif)->runs = NULL;
TIFFSetField(tif, TIFFTAG_FAXFILLFUNC, _TIFFFax3fillruns);
EncoderState(tif)->refline = NULL;
/*
* Install codec methods.
*/
tif->tif_fixuptags = Fax3FixupTags;
tif->tif_setupdecode = Fax3SetupState;
tif->tif_predecode = Fax3PreDecode;
tif->tif_decoderow = Fax3Decode1D;
tif->tif_decodestrip = Fax3Decode1D;
tif->tif_decodetile = Fax3Decode1D;
tif->tif_setupencode = Fax3SetupState;
tif->tif_preencode = Fax3PreEncode;
tif->tif_postencode = Fax3PostEncode;
tif->tif_encoderow = Fax3Encode;
tif->tif_encodestrip = Fax3Encode;
tif->tif_encodetile = Fax3Encode;
tif->tif_close = Fax3Close;
tif->tif_cleanup = Fax3Cleanup;
return (1);
}
int
TIFFInitCCITTFax3(TIFF* tif, int scheme)
{
(void) scheme;
if (InitCCITTFax3(tif)) {
/*
* Merge codec-specific tag information.
*/
if (!_TIFFMergeFields(tif, fax3Fields,
TIFFArrayCount(fax3Fields))) {
TIFFErrorExt(tif->tif_clientdata, "TIFFInitCCITTFax3",
"Merging CCITT Fax 3 codec-specific tags failed");
return 0;
}
/*
* The default format is Class/F-style w/o RTC.
*/
return TIFFSetField(tif, TIFFTAG_FAXMODE, FAXMODE_CLASSF);
} else
return 01;
}
/*
* CCITT Group 4 (T.6) Facsimile-compatible
* Compression Scheme Support.
*/
#define SWAP(t,a,b) { t x; x = (a); (a) = (b); (b) = x; }
/*
* Decode the requested amount of G4-encoded data.
*/
static int
Fax4Decode(TIFF* tif, uint8* buf, tmsize_t occ, uint16 s)
{
DECLARE_STATE_2D(tif, sp, "Fax4Decode");
(void) s;
if (occ % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be read");
return (-1);
}
CACHE_STATE(tif, sp);
while (occ > 0) {
a0 = 0;
RunLength = 0;
pa = thisrun = sp->curruns;
pb = sp->refruns;
b1 = *pb++;
#ifdef FAX3_DEBUG
printf("\nBitAcc=%08X, BitsAvail = %d\n", BitAcc, BitsAvail);
printf("-------------------- %d\n", tif->tif_row);
fflush(stdout);
#endif
EXPAND2D(EOFG4);
if (EOLcnt)
goto EOFG4;
(*sp->fill)(buf, thisrun, pa, lastx);
SETVALUE(0); /* imaginary change for reference */
SWAP(uint32*, sp->curruns, sp->refruns);
buf += sp->b.rowbytes;
occ -= sp->b.rowbytes;
sp->line++;
continue;
EOFG4:
NeedBits16( 13, BADG4 );
BADG4:
#ifdef FAX3_DEBUG
if( GetBits(13) != 0x1001 )
fputs( "Bad EOFB\n", stderr );
#endif
ClrBits( 13 );
(*sp->fill)(buf, thisrun, pa, lastx);
UNCACHE_STATE(tif, sp);
return ( sp->line ? 1 : -1); /* don't error on badly-terminated strips */
}
UNCACHE_STATE(tif, sp);
return (1);
}
#undef SWAP
/*
* Encode the requested amount of data.
*/
static int
Fax4Encode(TIFF* tif, uint8* bp, tmsize_t cc, uint16 s)
{
static const char module[] = "Fax4Encode";
Fax3CodecState *sp = EncoderState(tif);
(void) s;
if (cc % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be written");
return (0);
}
while (cc > 0) {
if (!Fax3Encode2DRow(tif, bp, sp->refline, sp->b.rowpixels))
return (0);
_TIFFmemcpy(sp->refline, bp, sp->b.rowbytes);
bp += sp->b.rowbytes;
cc -= sp->b.rowbytes;
}
return (1);
}
static int
Fax4PostEncode(TIFF* tif)
{
Fax3CodecState *sp = EncoderState(tif);
/* terminate strip w/ EOFB */
Fax3PutBits(tif, EOL, 12);
Fax3PutBits(tif, EOL, 12);
if (sp->bit != 8)
Fax3FlushBits(tif, sp);
return (1);
}
int
TIFFInitCCITTFax4(TIFF* tif, int scheme)
{
(void) scheme;
if (InitCCITTFax3(tif)) { /* reuse G3 support */
/*
* Merge codec-specific tag information.
*/
if (!_TIFFMergeFields(tif, fax4Fields,
TIFFArrayCount(fax4Fields))) {
TIFFErrorExt(tif->tif_clientdata, "TIFFInitCCITTFax4",
"Merging CCITT Fax 4 codec-specific tags failed");
return 0;
}
tif->tif_decoderow = Fax4Decode;
tif->tif_decodestrip = Fax4Decode;
tif->tif_decodetile = Fax4Decode;
tif->tif_encoderow = Fax4Encode;
tif->tif_encodestrip = Fax4Encode;
tif->tif_encodetile = Fax4Encode;
tif->tif_postencode = Fax4PostEncode;
/*
* Suppress RTC at the end of each strip.
*/
return TIFFSetField(tif, TIFFTAG_FAXMODE, FAXMODE_NORTC);
} else
return (0);
}
/*
* CCITT Group 3 1-D Modified Huffman RLE Compression Support.
* (Compression algorithms 2 and 32771)
*/
/*
* Decode the requested amount of RLE-encoded data.
*/
static int
Fax3DecodeRLE(TIFF* tif, uint8* buf, tmsize_t occ, uint16 s)
{
DECLARE_STATE(tif, sp, "Fax3DecodeRLE");
int mode = sp->b.mode;
(void) s;
if (occ % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be read");
return (-1);
}
CACHE_STATE(tif, sp);
thisrun = sp->curruns;
while (occ > 0) {
a0 = 0;
RunLength = 0;
pa = thisrun;
#ifdef FAX3_DEBUG
printf("\nBitAcc=%08X, BitsAvail = %d\n", BitAcc, BitsAvail);
printf("-------------------- %d\n", tif->tif_row);
fflush(stdout);
#endif
EXPAND1D(EOFRLE);
(*sp->fill)(buf, thisrun, pa, lastx);
/*
* Cleanup at the end of the row.
*/
if (mode & FAXMODE_BYTEALIGN) {
int n = BitsAvail - (BitsAvail &~ 7);
ClrBits(n);
} else if (mode & FAXMODE_WORDALIGN) {
int n = BitsAvail - (BitsAvail &~ 15);
ClrBits(n);
if (BitsAvail == 0 && !isAligned(cp, uint16))
cp++;
}
buf += sp->b.rowbytes;
occ -= sp->b.rowbytes;
sp->line++;
continue;
EOFRLE: /* premature EOF */
(*sp->fill)(buf, thisrun, pa, lastx);
UNCACHE_STATE(tif, sp);
return (-1);
}
UNCACHE_STATE(tif, sp);
return (1);
}
int
TIFFInitCCITTRLE(TIFF* tif, int scheme)
{
(void) scheme;
if (InitCCITTFax3(tif)) { /* reuse G3 support */
tif->tif_decoderow = Fax3DecodeRLE;
tif->tif_decodestrip = Fax3DecodeRLE;
tif->tif_decodetile = Fax3DecodeRLE;
/*
* Suppress RTC+EOLs when encoding and byte-align data.
*/
return TIFFSetField(tif, TIFFTAG_FAXMODE,
FAXMODE_NORTC|FAXMODE_NOEOL|FAXMODE_BYTEALIGN);
} else
return (0);
}
int
TIFFInitCCITTRLEW(TIFF* tif, int scheme)
{
(void) scheme;
if (InitCCITTFax3(tif)) { /* reuse G3 support */
tif->tif_decoderow = Fax3DecodeRLE;
tif->tif_decodestrip = Fax3DecodeRLE;
tif->tif_decodetile = Fax3DecodeRLE;
/*
* Suppress RTC+EOLs when encoding and word-align data.
*/
return TIFFSetField(tif, TIFFTAG_FAXMODE,
FAXMODE_NORTC|FAXMODE_NOEOL|FAXMODE_WORDALIGN);
} else
return (0);
}
#endif /* CCITT_SUPPORT */
/* vim: set ts=8 sts=8 sw=8 noet: */
/*
* Local Variables:
* mode: c
* c-basic-offset: 8
* fill-column: 78
* End:
*/
```
|
McCosker's flasher wrasse, Paracheilinus mccoskeri, is a species of wrasse native to the Indian Ocean, from East Africa to Thailand and northern Sumatra. It is a reef inhabitant, at depths from , and can grow to in total length. It can be found in the aquarium trade. The common name and specific name honours the American ichthyologist John E. McCosker who collected the type specimens and colour photographs used in the description of this species by Randall and Harmelin-Vivien.
References
McCosker's flasher wrasse
Fish described in 1977
|
```python
from re import search
from unittest import mock
from tests.providers.gcp.gcp_fixtures import GCP_PROJECT_ID, set_mocked_gcp_provider
class Test_compute_instance_block_project_wide_ssh_keys_disabled:
def test_compute_no_instances(self):
compute_client = mock.MagicMock
compute_client.project_ids = [GCP_PROJECT_ID]
compute_client.instances = []
with mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=set_mocked_gcp_provider(),
), mock.patch(
"prowler.providers.gcp.services.compute.compute_instance_block_project_wide_ssh_keys_disabled.compute_instance_block_project_wide_ssh_keys_disabled.compute_client",
new=compute_client,
):
from prowler.providers.gcp.services.compute.compute_instance_block_project_wide_ssh_keys_disabled.compute_instance_block_project_wide_ssh_keys_disabled import (
compute_instance_block_project_wide_ssh_keys_disabled,
)
check = compute_instance_block_project_wide_ssh_keys_disabled()
result = check.execute()
assert len(result) == 0
def test_one_compliant_instance_with_block_project_ssh_keys_true(self):
from prowler.providers.gcp.services.compute.compute_service import Instance
instance = Instance(
name="test",
id="1234567890",
zone="us-central1-a",
public_ip=True,
metadata={"items": [{"key": "block-project-ssh-keys", "value": "true"}]},
shielded_enabled_vtpm=True,
shielded_enabled_integrity_monitoring=True,
confidential_computing=True,
service_accounts=[],
ip_forward=False,
disks_encryption=[("disk1", False), ("disk2", False)],
project_id=GCP_PROJECT_ID,
)
compute_client = mock.MagicMock
compute_client.project_ids = [GCP_PROJECT_ID]
compute_client.instances = [instance]
with mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=set_mocked_gcp_provider(),
), mock.patch(
"prowler.providers.gcp.services.compute.compute_instance_block_project_wide_ssh_keys_disabled.compute_instance_block_project_wide_ssh_keys_disabled.compute_client",
new=compute_client,
):
from prowler.providers.gcp.services.compute.compute_instance_block_project_wide_ssh_keys_disabled.compute_instance_block_project_wide_ssh_keys_disabled import (
compute_instance_block_project_wide_ssh_keys_disabled,
)
check = compute_instance_block_project_wide_ssh_keys_disabled()
result = check.execute()
assert len(result) == 1
assert result[0].status == "PASS"
assert search(
f"The VM Instance {instance.name} is not making use of common/shared project-wide SSH key",
result[0].status_extended,
)
assert result[0].resource_id == instance.id
def test_one_instance_without_metadata(self):
from prowler.providers.gcp.services.compute.compute_service import Instance
instance = Instance(
name="test",
id="1234567890",
zone="us-central1-a",
public_ip=True,
metadata={},
shielded_enabled_vtpm=True,
shielded_enabled_integrity_monitoring=True,
confidential_computing=True,
service_accounts=[],
ip_forward=False,
disks_encryption=[("disk1", False), ("disk2", False)],
project_id=GCP_PROJECT_ID,
)
compute_client = mock.MagicMock
compute_client.project_ids = [GCP_PROJECT_ID]
compute_client.instances = [instance]
with mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=set_mocked_gcp_provider(),
), mock.patch(
"prowler.providers.gcp.services.compute.compute_instance_block_project_wide_ssh_keys_disabled.compute_instance_block_project_wide_ssh_keys_disabled.compute_client",
new=compute_client,
):
from prowler.providers.gcp.services.compute.compute_instance_block_project_wide_ssh_keys_disabled.compute_instance_block_project_wide_ssh_keys_disabled import (
compute_instance_block_project_wide_ssh_keys_disabled,
)
check = compute_instance_block_project_wide_ssh_keys_disabled()
result = check.execute()
assert len(result) == 1
assert result[0].status == "FAIL"
assert search(
f"The VM Instance {instance.name} is making use of common/shared project-wide SSH key",
result[0].status_extended,
)
assert result[0].resource_id == instance.id
def test_one_instance_with_block_project_ssh_keys_false(self):
from prowler.providers.gcp.services.compute.compute_service import Instance
instance = Instance(
name="test",
id="1234567890",
zone="us-central1-a",
public_ip=True,
metadata={"items": [{"key": "block-project-ssh-keys", "value": "false"}]},
shielded_enabled_vtpm=True,
shielded_enabled_integrity_monitoring=True,
confidential_computing=True,
service_accounts=[],
ip_forward=False,
disks_encryption=[("disk1", False), ("disk2", False)],
project_id=GCP_PROJECT_ID,
)
compute_client = mock.MagicMock
compute_client.project_ids = [GCP_PROJECT_ID]
compute_client.instances = [instance]
with mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=set_mocked_gcp_provider(),
), mock.patch(
"prowler.providers.gcp.services.compute.compute_instance_block_project_wide_ssh_keys_disabled.compute_instance_block_project_wide_ssh_keys_disabled.compute_client",
new=compute_client,
):
from prowler.providers.gcp.services.compute.compute_instance_block_project_wide_ssh_keys_disabled.compute_instance_block_project_wide_ssh_keys_disabled import (
compute_instance_block_project_wide_ssh_keys_disabled,
)
check = compute_instance_block_project_wide_ssh_keys_disabled()
result = check.execute()
assert len(result) == 1
assert result[0].status == "FAIL"
assert search(
f"The VM Instance {instance.name} is making use of common/shared project-wide SSH key",
result[0].status_extended,
)
assert result[0].resource_id == instance.id
```
|
Admiral Sir Gervase Alard, Bart. (1270–1340), was an English knight and naval commander who was appointed Admiral of the Cinque Ports Fleet and Admiral of the Western Fleet of the English Navy who served under King's Edward I, Edward II and Edward III of England from 1296 to 1340.
He is known as the first serving naval officer to be granted a commission to the rank of Admiral of an English fleet in 1303.
Naval career
Geravse Alard was born in Winchelsea, East Sussex, England in 1270 and came from a seafaring family and was deemed a master mariner he served as a knight of King Edward I. In 1294 he was appointed as the first Mayor of Winchelsea. His first service in the navy came when he took part in Edward I naval campaigns in Scotland from (1300-1306).
On 25 September 1300 Alard was first appointed as an Admiral of the Cinque Ports by Edward I of England confirmed by a royal writ that outlined the position as an administrative office until 3 February 1303. On 4 February 1303 he became the first serving English naval officer to be granted a royal commission to the rank of Admiral of an English Fleet and appointed Captain and Admiral of the Fleet of the Cinque Ports. he remained in command of the Cinque Ports fleet until 1304. Additionally he was also appointed Admiral of the Irish Sea in 1304 a post he held until 1305.
In July 1306 he was granted two further commissions and appointed Admiral of the Western Fleet and re-appointed Admiral of the Cinque Ports he held both offices simultaneously until 1314.
Family
Gervase Alard is thought to be the son of Thomas Alard when he was granted the town of New Winchelsea for life by the King in November 1306 in succession to him. In addition he was father to Stephen Alard, who later became Admiral of the Cinque Ports and the Western Fleet.
Footnotes
Bibliography
Archives, National. (1306). "Edward I to Gervase Alard, admiral, and the barons of the Cinque Ports serving in the fleet: thanks for their good service, which he asks them to continue. Dated at Blenkinsop. Privy Seal. Draft". www.nationalarchives.gov.uk. Kew, England: The National Archives UK.
Carruthers, Bob (2013). Medieval Warfare. Barnsley, England: Pen and Sword. p. 84. .
Harris, Sir Nicholas (1847). A History of the Royal Navy: From the Earliest Times to the Wars of the French Revolution, Volume 1. London: R. Bentley.
Prestwich, Michael (1988). Edward I. Berkeley, United States: University of California Press. .
Pryde, E. B.; Greenway, D. E.; Porter, S.; Roy, I. (1996). Handbook of British Chronology. Cambridge, England: Cambridge University Press. p. 134. .
Rodger, N.A.M. (1997). "Appendix V:Admirals and Officials: English Admirals 1295 to 1408.". The safeguard of the sea : a naval history of Britain. Vol 1., 660–1649. London: Penguin. .
Rose, Susan (2013). England's Medieval Navy 1066-1509: Ships, Men & Warfare. Barnsley, England: Seaforth Publishing. .
Spence, Keith (1999). The Companion Guide to Kent and Sussex. Boydell & Brewer Ltd. .
Watson, Fiona James (1991). "Edward I in Scotland 1296 to 1305: Theses submitted for the Degree of Ph.D" (PDF). www.theses.gla.ac.uk. University of Glasgow.
1270 births
1340 deaths
13th-century English Navy personnel
14th-century English Navy personnel
English admirals
People from Winchelsea
Military personnel from Sussex
|
```markdown
TSG121 - Supervisor mssql-server logs
=====================================
These supervisor mssql-server logs can contain some more information
from Polybase, not available in errorlog or the polybase logs.
Steps
-----
### Parameters```
```python
import re
tail_lines = 500
pod = None # All
container = "mssql-server"
log_files = [ "/var/log/supervisor/log/mssql-server-*.log" ]
expressions_to_analyze = [
re.compile(".{26}[WARN ]"),
re.compile(".{26}[ERROR]")
]
```
```markdown
### Instantiate Kubernetes client```
```python
# Instantiate the Python Kubernetes client into 'api' variable
import os
from IPython.display import Markdown
try:
from kubernetes import client, config
from kubernetes.stream import stream
if "KUBERNETES_SERVICE_PORT" in os.environ and "KUBERNETES_SERVICE_HOST" in os.environ:
config.load_incluster_config()
else:
try:
config.load_kube_config()
except:
display(Markdown(f'HINT: Use [TSG118 - Configure Kubernetes config](../repair/tsg118-configure-kube-config.ipynb) to resolve this issue.'))
raise
api = client.CoreV1Api()
print('Kubernetes client instantiated')
except ImportError:
display(Markdown(f'HINT: Use [SOP059 - Install Kubernetes Python module](../install/sop059-install-kubernetes-module.ipynb) to resolve this issue.'))
raise
```
```markdown
### Get the namespace for the big data cluster
Get the namespace of the Big Data Cluster from the Kuberenetes API.
**NOTE:**
If there is more than one Big Data Cluster in the target Kubernetes
cluster, then either:
- set \[0\] to the correct value for the big data cluster.
- set the environment variable AZDATA\_NAMESPACE, before starting
Azure Data Studio.```
```python
# Place Kubernetes namespace name for BDC into 'namespace' variable
if "AZDATA_NAMESPACE" in os.environ:
namespace = os.environ["AZDATA_NAMESPACE"]
else:
try:
namespace = api.list_namespace(label_selector='MSSQL_CLUSTER').items[0].metadata.name
except IndexError:
from IPython.display import Markdown
display(Markdown(f'HINT: Use [TSG081 - Get namespaces (Kubernetes)](../monitor-k8s/tsg081-get-kubernetes-namespaces.ipynb) to resolve this issue.'))
display(Markdown(f'HINT: Use [TSG010 - Get configuration contexts](../monitor-k8s/tsg010-get-kubernetes-contexts.ipynb) to resolve this issue.'))
display(Markdown(f'HINT: Use [SOP011 - Set kubernetes configuration context](../common/sop011-set-kubernetes-context.ipynb) to resolve this issue.'))
raise
print('The kubernetes namespace for your big data cluster is: ' + namespace)
```
```markdown
### Get tail for log```
```python
# Display the last 'tail_lines' of files in 'log_files' list
pods = api.list_namespaced_pod(namespace)
entries_for_analysis = []
for p in pods.items:
if pod is None or p.metadata.name == pod:
for c in p.spec.containers:
if container is None or c.name == container:
for log_file in log_files:
print (f"- LOGS: '{log_file}' for CONTAINER: '{c.name}' in POD: '{p.metadata.name}'")
try:
output = stream(api.connect_get_namespaced_pod_exec, p.metadata.name, namespace, command=['/bin/sh', '-c', f'tail -n {tail_lines} {log_file}'], container=c.name, stderr=True, stdout=True)
except Exception:
print (f"FAILED to get LOGS for CONTAINER: {c.name} in POD: {p.metadata.name}")
else:
for line in output.split('
'):
for expression in expressions_to_analyze:
if expression.match(line):
entries_for_analysis.append(line)
print(line)
print("")
print(f"{len(entries_for_analysis)} log entries found for further analysis.")
```
```markdown
### Analyze log entries and suggest relevant Troubleshooting Guides```
```python
# Analyze log entries and suggest further relevant troubleshooting guides
from IPython.display import Markdown
import os
import json
import requests
import ipykernel
import datetime
from urllib.parse import urljoin
from notebook import notebookapp
def get_notebook_name():
"""Return the full path of the jupyter notebook. Some runtimes (e.g. ADS)
have the kernel_id in the filename of the connection file. If so, the
notebook name at runtime can be determined using `list_running_servers`.
Other runtimes (e.g. azdata) do not have the kernel_id in the filename of
the connection file, therefore we are unable to establish the filename
"""
connection_file = os.path.basename(ipykernel.get_connection_file())
# If the runtime has the kernel_id in the connection filename, use it to
# get the real notebook name at runtime, otherwise, use the notebook
# filename from build time.
try:
kernel_id = connection_file.split('-', 1)[1].split('.')[0]
except:
pass
else:
for servers in list(notebookapp.list_running_servers()):
try:
response = requests.get(urljoin(servers['url'], 'api/sessions'), params={'token': servers.get('token', '')}, timeout=.01)
except:
pass
else:
for nn in json.loads(response.text):
if nn['kernel']['id'] == kernel_id:
return nn['path']
def load_json(filename):
with open(filename, encoding="utf8") as json_file:
return json.load(json_file)
def get_notebook_rules():
"""Load the notebook rules from the metadata of this notebook (in the .ipynb file)"""
file_name = get_notebook_name()
if file_name == None:
return None
else:
j = load_json(file_name)
if "azdata" not in j["metadata"] or \
"expert" not in j["metadata"]["azdata"] or \
"log_analyzer_rules" not in j["metadata"]["azdata"]["expert"]:
return []
else:
return j["metadata"]["azdata"]["expert"]["log_analyzer_rules"]
rules = get_notebook_rules()
if rules == None:
print("")
print(f"Log Analysis only available when run in Azure Data Studio. Not available when run in azdata.")
else:
print(f"Applying the following {len(rules)} rules to {len(entries_for_analysis)} log entries for analysis, looking for HINTs to further troubleshooting.")
print(rules)
hints = 0
if len(rules) > 0:
for entry in entries_for_analysis:
for rule in rules:
if entry.find(rule[0]) != -1:
print (entry)
display(Markdown(f'HINT: Use [{rule[2]}]({rule[3]}) to resolve this issue.'))
hints = hints + 1
print("")
print(f"{len(entries_for_analysis)} log entries analyzed (using {len(rules)} rules). {hints} further troubleshooting hints made inline.")
```
```python
print('Notebook execution complete.')
```
|
```c++
// Boost.Geometry Index
// Unit Test
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#include <rtree/test_rtree.hpp>
int test_main(int, char* [])
{
typedef bg::model::box< bg::model::point<double, 3, bg::cs::cartesian> > Indexable;
testset::modifiers<Indexable>(bgi::quadratic<5, 2>(), std::allocator<int>());
return 0;
}
```
|
The Bayer designation δ Gruis (Delta Gruis) is shared by two stars in the constellation Grus:
δ1 Gruis
δ2 Gruis
Grus (constellation)
Gruis, Delta
|
Project MKUltra is the code name for a CIA mind-control research program that began in the 1950s.
MKULTRA or MK-ULTRA may also refer to:
MK Ultra (film), 2022 psychological thriller film written and directed by Joseph Sorrentino
mk Ultra (California band), a defunct alternative band
The MK Ultra, a music project by British rock musician James Ray
"MKultra", a song by American band Unwound on the album A Single History: 1991–1997
"MK Ultra", a song by British rock band Muse on the 2009 album The Resistance
"MK Ultra Ragman", a song by the Canadian electro band platEAU from the 2007 album Kushbush
"MK Ultra", a song by the American prog metal band Periphery from the 2015 album Juggernaut: Alpha
|
Sylvester James Jr. (September 6, 1947December 16, 1988), known mononymously as Sylvester, was an American singer-songwriter. Primarily active in the genres of disco, rhythm and blues, and soul, he was known for his flamboyant and androgynous appearance, falsetto singing voice, and hit disco singles in the late 1970s and 1980s.
Born in Watts, Los Angeles, to a middle-class African-American family, Sylvester developed a love of singing through the gospel choir of his Pentecostal church. Leaving the church after the congregation expressed disapproval of his homosexuality, he found friendship among a group of black cross-dressers and transgender women who called themselves the Disquotays.
Moving to San Francisco in 1970 at the age of 22, Sylvester embraced the counterculture and joined the avant-garde drag troupe the Cockettes, producing solo segments of their shows which were heavily influenced by female blues and jazz singers such as Billie Holiday and Josephine Baker. During the Cockettes' critically panned tour of New York City, Sylvester left them to pursue his career elsewhere. He came to front Sylvester and his Hot Band, a rock act that released two commercially unsuccessful albums on Blue Thumb Records in 1973 before disbanding.
Focusing on a solo career, Sylvester signed a recording contract with Harvey Fuqua of Fantasy Records and obtained three new backing singers in the form of Martha Wash and Izora Rhodes – the "Two Tons O' Fun" – as well as Jeanie Tracy. His first solo album, Sylvester (1977), was a moderate success. This was followed with the acclaimed disco album Step II (1978), which spawned the singles "You Make Me Feel (Mighty Real)" and "Dance (Disco Heat)", both of which were hits in the US and Europe.
Distancing himself from the disco genre, he recorded four more albums – including a live album – with Fantasy Records. After leaving this label, he signed to Megatone Records, the dance-oriented company founded by friend and collaborator Patrick Cowley, where he recorded four more albums, including the Cowley penned hit Hi-NRG track "Do Ya Wanna Funk".
During the late 1970s, Sylvester gained the moniker of the "Queen of Disco" and during his life he attained particular recognition in San Francisco, where he was awarded the key to the city. Sylvester was an activist who campaigned against the spread of HIV/AIDS. He died from complications arising from the virus in 1988, leaving all future royalties from his work to San Francisco-based HIV/AIDS charities. In 2005, he was posthumously inducted into the Dance Music Hall of Fame, while his life has been recorded in a biography and made the subject of both a documentary and a musical.
Early life
1947–1960: Childhood
Sylvester James was born on September 6, 1947, in the Watts district of Los Angeles, California, into a middle-class family. His mother, Letha Weaver, had been raised near Palestine, Arkansas, into a relatively wealthy African-American family who owned their own farmland. Letha's biological mother, Gertha Weaver, was unmarried and too sickly to care for her child, so Gertha's sister Julia, known to the family as JuJu, became Letha's adoptive mother. In the late 1930s, Julia and her husband took part in the Great Migration of African-Americans out of the Southern United States, relocating to Watts.
It was here that Letha was largely raised and where she met and married her first husband, Sylvester "Sweet" James, with the couple moving into a small cottage owned by Letha's parents. Their first child, named Sylvester after his father, was followed by the birth of John Wesley in 1948 and Larry in 1950. Sylvester and his brothers became better known in their predominantly African-American community by their nicknames, with Sylvester's being "Dooni". Sylvester considered his father to be a "lowlife" because he was an adulterer and left his wife and children when the boys were still young. Letha and her three sons moved to a downtown housing project at Aliso Village before moving back into her parental home at 114th Street in Watts.
Letha was a devout adherent of the Pentecostal denomination of Christianity, regularly attending the Palm Lane Church of God in Christ in South Los Angeles. Sylvester and his brothers accompanied her to the church's services, where he developed a particular interest in gospel music. Having been an avid singer since the age of three, Sylvester regularly joined in with gospel performances; he sang the song "My Buddy" at the funeral of one of the other children in the Park Lane congregation.
The women at his church described him as "feminine" and "as pretty as he could be, just like his mother. He wasn't rough like the other boys. He was prim and proper. We were always hugging on him and kissing on him, because he was so cute." Family members also described his as "his own kind of boy - 'born funny'" - preferring the company of girls and women like his grandmother to that of other boys. "He stayed inside a lot, reading encyclopedias, listening to music, and playing his grandmother's piano." When Sylvester would turn down the boys' invitations to play with them, they would say things like, "He act like a girl!" or "He's going to be a girl." But his mother would defend him, including his joy at dressing up in her and his grandmother's clothes, saying that he was not a girl, just a different kind of boy, and a valued part of their family.
At the age of eight, he was sexually molested by a man at the church—at the time rumored to be the church organist; although Sylvester would always maintain that this interaction had been consensual and not sexual molestation, Sylvester was only a child at the time of this incident while the assailant was an adult. Sylvester was taken to a doctor after receiving injuries when this man subjected the child to anal sex. It was this doctor who informed Letha that her son was gay, something that she could not accept, viewing homosexual activity as a perversion and a sin. News of Sylvester's "homosexual activity" (actually, having been raped) soon spread through the church congregation and, feeling unwelcome, he ceased his attendance at age 13.
During Sylvester's childhood, his mother gave birth to three more children by different fathers before marrying Robert "Sonny" Hurd in the early 1960s, with whom she adopted three foster children. A supervisor at aerospace manufacturer North American Rockwell, Hurd's job increased the family income and they were able to move into a more expensive, predominantly white neighborhood north of Watts. The relationship between Sylvester and both his mother and stepfather was strained; in the midst of one argument with his mother, Sylvester decided to leave their house permanently.
1960–1970: The Disquotays
Now homeless, Sylvester spent much of the next decade staying with friends and relatives, in particular, his grandmother Julia, who expressed no disapproval of his homosexuality, having been a friend of a number of gay men in the 1930s. On occasion, he returned to his mother and step-father's house for a few days at a time, particularly to spend time with his younger sisters, Bernadette and Bernadine. Aged 15, he began frequenting local gay clubs and built up a group of friends from the local gay black community, eventually forming themselves into a group which they called the Disquotays. Sylvester's best friend among the Disquotays was a trans woman named Duchess, who earned her money as a prostitute, a job that Sylvester refused to engage in. The group held lavish house parties, sometimes (without permission) at the home of their friend, rhythm and blues singer Etta James, in which they dressed up in female clothing and wigs, constantly trying to outdo one another in appearance.
Sylvester's boyfriend during the latter part of the 1960s was a young man named Lonnie Prince; well-built and attractive, many of Sylvester's friends described the pair as being "the It couple". Sylvester often hitchhiked around town while in female dress; such activity carried a risk of arrest and prosecution, for cross-dressing was then illegal in California. Although avoiding imprisonment for this crime, he was arrested for shoplifting on several occasions. He found work in a variety of professions, including cooking in McDonald's—where he was fired for refusing to wear a hairnet—cashier at an airport parking garage, working in a hair salon, at a department store, and as a make-up artist at a mortuary, preparing the corpses for their funerals. In the 1960s, the Civil Rights Movement was at its peak, but Sylvester and his friends did not take an active role within it. During the Watts riots between members of the black community and the predominantly white police force, they joined in with the widespread rioting and looting, stealing wigs, hairspray, and lipstick.
Although he had little interest in formal education and rarely attended classes, Sylvester was enrolled at Jordan High School. He graduated in 1969 at the age of 21; in his graduation photograph, he appeared in drag wearing a blue chiffon prom dress and beehive hairstyle. By the end of the decade, the Disquotays had begun to drift apart, with a number of them abandoning cross-dressing and others recognizing that they were trans women and undergoing sex reassignment surgery. Sylvester always considered himself male and began to tone down the feminine nature of his clothing, aiming for a more androgynous look which combined male and female styles and which was influenced by the fashions of the hippie movement.
1970–1972: The Cockettes
At Los Angeles' Whisky a Go Go bar, Sylvester met Reggie Dunnigan, who invited him to move to the city of San Francisco in Northern California to join the "Chocolate Cockettes"—black members of an avant-garde performance art drag troupe known as the Cockettes. Founded by drag queen Hibiscus in 1970, the Cockettes parodied popular culture, were involved in the Gay Liberation movement, and were influenced by the ethos of the hippie movement, living communally, embracing free love, and consuming mind-altering substances such as marijuana and LSD. With the Disquotays disbanded, Sylvester had tired of Los Angeles, and was attracted by San Francisco's reputation as a gay and counter-cultural haven. Arriving in the city, he stayed in the Cockettes' communal home for several days. They were impressed with his falsetto singing voice and his ability to play the piano, asking him to appear in an upcoming show, Radio Rodeo. Sylvester agreed, and one of his first performances involved singing the theme song of The Mickey Mouse Club while dressed in a cowgirl skirt. Moving into the Cockettes' communal residence, he soon found the flat too crowded and had difficulty with the lack of privacy; after a year he moved into a new house on Market Street with two fellow Cockettes.
Although a significant member of the troupe, Sylvester remained a relatively isolated figure; not only was he one of very few African-American members, he eschewed the group's more surrealist activities for what he saw as classier, more glamorous performances onstage. In the Cockettes' performances, he was usually given an entire scene to himself, often with little relevance to the narrative and theme of the rest of the show, although through doing so, he gained his own following. With a piano player named Peter Mintun, Sylvester worked on solo scenes in which he exhibited his interest in blues and jazz by imitating several of his musical idols such as Billie Holiday and Josephine Baker. Adding to his image, Sylvester used the pseudonym "Ruby Blue" and described himself as "Billie Holiday's cousin once removed". Fascinated by black musical heritage, he read up on the subject and became a collector of "negrobilia"; in some of his Cockette performances, he played up to racial stereotypes of African-Americans to ridicule the stereotypes themselves.
In 1970, Sylvester entered into an open relationship with Michael Lyons, a young white man, and soon proposed marriage to him. Although same-sex marriage was not legally recognized in the US, the couple held a wedding in the Shakespeare Garden of Golden Gate Park. At the invitation of the manager of the Palace Theater, Sylvester appeared in a spoof film, Tricia's Wedding, which parodied the marriage of Tricia Nixon Cox, daughter of President Richard Nixon. In the film, Sylvester played the role of both Coretta Scott King and the African ambassador Uma King. In 1971, Sylvester was given a one-man show, Sylvester Sings, at the Palace Theater, for which he was accompanied by Peter Mintun. He nevertheless remained a part of the Cockette troupe during their divisive split, in which Hibiscus and his followers left to form the Angels of Light. Following Hibiscus' departure, the Cockettes began to gain increasing media attention, with celebrities such as Rex Reed, Truman Capote, and Gloria Vanderbilt enthusing about their performances. Rolling Stone magazine singled out Sylvester's performances for particular praise, describing him as "a beautiful black androgyne who has a gospel sound with the heat and shimmer of Aretha".
The success led the troupe to take their show to New York City, a city with a long history of drag culture. Arriving in November 1971, they immersed themselves in the city's avant-garde, attending parties held by Andy Warhol and Screw magazine. Spending so much of their time partying, most of the Cockettes did not rehearse, the exception being Sylvester, who wanted to perfect his act. Although the Cockettes' performance at the Anderson Theater was panned by critics, Sylvester's act was widely praised as a highlight of the show. Realizing that he had far better prospects as a solo artist, on the second New York performance he opened his act by telling the audience, "I apologize for this travesty that I'm associated with", while on the seventh he announced that he would be leaving the Cockettes altogether.
Emerging solo career
1972–1974: Sylvester and his Hot Band
Returning to San Francisco, Sylvester was offered the opportunity to record a demo album by Rolling Stone editor Jann Wenner. Financed by A&M Records, the album featured a cover of Bonnie Bramlett and Leon Russell's song "Superstar", which had been a recent hit single for the Carpenters. Nevertheless, A&M felt that the work was not commercially viable and declined to release the album. For the album, Sylvester and his manager Dennis Lopez had assembled a group of heterosexual white males—Bobby Blood on trumpet, Chris Mostert on saxophone, James Q. Smith on guitar, Travis Fullerton on drums, and Kerry Hatch on bass—whom he named the Hot Band. After A&M's initial rejection, the band provided two songs for Lights Out San Francisco, an album compiled by San Francisco's KSAN radio and released on the Blue Thumb label. Gaining a number of local gigs, they were eventually asked to open for English glam rock star David Bowie at the Winterland Ballroom. The gig did not sell particularly well, and Bowie later commented that San Francisco did not need him, because "They've got Sylvester", referring to their shared preference for androgyny.
In early 1973, Sylvester and the Hot Band were signed by Bob Krasnow to Blue Thumb. On this label, they produced their first album, in which they switched their sound from blues to the more commercially viable rock, while the Pointer Sisters were employed as backing singers. Sylvester named this first album Scratch My Flower due to a gardenia-shaped scratch-and-sniff sticker adhered to the cover, although it was instead released under the title of Sylvester and his Hot Band. The album consisted primarily of covers of songs by artists such as James Taylor, Ray Charles, Neil Young, and Leiber and Stoller. Described by one of Sylvester's biographers as lacking in "the fire and focus of the live shows", it sold poorly on release.
Sylvester and his Hot Band toured the United States, receiving threats of violence in several Southern states, where widespread conservative and racist attitudes led to antagonism between the band and locals. In late 1973, the band recorded their second album, Bazaar, which included both cover songs and original compositions by bassist Kerry Hatch. Hatch later commented that the Hot Band found the album more satisfactory than its predecessor, but nevertheless it again sold poorly. The music journalist Peter Shapiro believed that on these Blue Thumb albums, Sylvester's "cottony falsetto was an uncomfortable match with guitars" and that they both had "an unpleasantly astringent quality".
Finding Sylvester difficult to work with, and frustrated by his lack of commercial success, the Hot Band left Sylvester in late 1974, after which Krasnow canceled his recording contract. At the same time, Sylvester's relationship with Lyons ended, with Lyons himself moving to Hawaii.
1974–1977: Two Tons O' Fun and Sylvester
Now without the Hot Band or a recording contract, Sylvester set himself up with a new band, the Four As, and a new set of backing singers, two black drag queens named Gerry Kirby and Lady Bianca. With this new entourage, he continued to perform at a number of local venues including Jewel's Catch One, a predominantly black gay dance club on West Pico Avenue in Los Angeles, but reviewers were unimpressed with the new line-up, most of whom abandoned Sylvester in December 1974. After a brief sojourn in England, Sylvester returned to San Francisco and assembled three young drag queens to be backing singers: Arnold Elzie, Leroy Davis, and Gerry Kirby. Nevertheless, although he performed at such events as the 1975 Castro Street Fair, success continued to elude him, and he eventually fired Elzie, Davis, and Kirby.
Sylvester employed Brent Thomson as his new manager; she suggested that he rid himself of his androgynous image and wear more masculine clothing to gain a recording contract; as she put it, "nobody is giving out recording contracts to drag queens". Thomson opened auditions for new backing singers, with Sylvester being captivated by one of those auditioning, Martha Wash. Sylvester asked her if she had another large black friend who could sing, after which she introduced him to Izora Rhodes. Although he referred to them simply as "the girls", Wash and Rhodes named themselves the Two Tons O' Fun (and much later, when they achieved mainstream success, as the Weather Girls), and continued to work with Sylvester intermittently until his death, developing a close friendship with him. They were soon joined by bassist John Dunstan and keyboard player Dan Reich.
Playing gay bars such as The Stud and The Endup, in September 1976 Sylvester and his band gained a regular weekend job at The Palms nightclub on Polk Street, performing two or three sets a night; most of these were covers, but some were original compositions by Sylvester and his then-guitarist Tip Wirrick. It was through this show that Sylvester came to the attention of Motown producer Harvey Fuqua, and Fuqua subsequently signed Sylvester onto a solo deal with Fantasy Records in 1977.
In the middle of that year, he recorded his third album, the self-titled Sylvester, which featured a cover design depicting Sylvester in male attire. The songs included on the album were influenced by dance music, and included Sylvester's own compositions, such as "Never Too Late", as well as covers of hits such as Ashford & Simpson's "Over and Over". Many reviewers noted that Sylvester's image had been altered since his early career, moving him away from the glittery androgynous appearance to that of a more conventional rhythm-and-blues singer which would have wider commercial appeal. Released as a single, Sylvester's "Over and Over" proved a minor hit in the US, but was more successful in Mexico and Europe. Building on the album's release, Sylvester toured Louisiana and then Mexico City.
1978: Step II and disco success
Sylvester's fame increased following the release of his solo album, and he was employed to perform regularly at The Elephant Walk gay bar in the Castro, an area of San Francisco known as a gay village. He became a friend of Harvey Milk—known locally as the "Mayor of Castro Street"—who was the first openly gay man to be elected to public office in California, and performed at Milk's birthday party that year. In the spring of 1978, Sylvester successfully auditioned for a cameo appearance in the film The Rose starring gay icon Bette Midler. In the film, he plays one of the drag queens singing along to Bob Seger's "Fire Down Below", in a single scene that was filmed in a run-down bar in downtown Los Angeles.
Sylvester released his second solo album, Step II, in September 1978. For this release, he was particularly influenced by the genre of dance music known as disco which was then becoming increasingly popular across the Western world. Disco was closely associated with the gay, black, and Latino communities in the US and dominated by black female artists such as Donna Summer, Gloria Gaynor, and Grace Jones, with Sylvester initially being unsure that it was a suitable genre for him to work in; he nevertheless recognized its increasing commercial potential. During production of the album, Sylvester invited the musician Patrick Cowley to join his studio band, being impressed by Cowley's innovative techniques using synthesizers. The album landed Cowley a job as a back-up musician on Sylvester's subsequent worldwide tours, and the two started a close friendship and collaboration. Once again co-produced by Harvey Fuqua and released on Fuqua's Fantasy label, Step II contained two disco songs that were subsequently released as singles, "You Make Me Feel (Mighty Real)", written by James Wirrick, and "Dance (Disco Heat)", written by Eric Robinson.
Both singles proved commercial hits both domestically and abroad, topping the American dance chart and breaking into the US pop charts. The album itself was also a success, being certified gold, and was described by Rolling Stone magazine as being "as good as disco gets". In his history of disco, Shapiro described "You Make Me Feel (Mighty Real)" as Sylvester's "greatest record", "the cornerstone of gay disco", and "an epochal record in disco history". Shapiro noted that Sylvester's work brought together elements from both of the main strands of disco; the "gospel/R&B tradition" and the "mechanical, piston-pumping beats" tradition, but that in doing so he went "way beyond either". Shapiro expressed the view that "Sylvester propelled his falsetto far above his natural range into the ether and rode machine rhythms that raced toward escape velocity, creating a new sonic lexicon powerful, camp, and otherworldly enough to articulate the exquisite bliss of disco's dance floor utopia".
In both August and December 1978, Sylvester visited London, England to promote his music; he proved hugely popular in the city, performing at a number of different nightclubs and being mobbed by fans. It was while in the city that he filmed the music video for "You Make Me Feel (Mighty Real)". Back in the US, Sylvester began to appear on television shows to advertise his music, appearing on Dinah Shore, American Bandstand, Rock Concert, and The Merv Griffin Show. He also undertook a series of tours across the country, opening for both the Commodores and Chaka Khan, and performing alongside the O'Jays, War, and L.T.D. As a result, he earned a number of awards and performed at several award ceremonies. Through this developing public presence, Sylvester, alongside other visibly queer performers such as the Village People, helped to solidify the connection between disco and homosexuality within the public imagination; this however furthered the anti-disco sentiment among rock music fans which would emerge as the Disco Sucks movement.
Later life
1979–1981: Stars, Sell My Soul, and Too Hot To Sleep
Sylvester followed the success of Step II with an album entitled Stars. Consisting of four love songs, the title track – released as a single in January 1979 – had been written by Cowley, and Sylvester would proceed to tell the press that it was his first completely disco album, but that it would also probably be his last. He premiered the album's four tracks on March 11, 1979, at a sold-out show in the San Francisco War Memorial Opera House. The performance was attended by a number of senior figures in local government, and halfway through, Mayor Dianne Feinstein sent her aide, Harry Britt, to award Sylvester with the key to the city and proclaim March 11 to be "Sylvester Day". The Opera House gig was recorded, and subsequently released as a live album, Living Proof. Sylvester thought very highly of the album, but it did not sell well. A single released from this album, "Can't Stop Dancing", was a hit in the disco clubs but not in the pop music charts.
Despite increasing mainstream success, Sylvester continued to reaffirm his connection to the gay community of San Francisco, performing at the main stage at the 1979 Gay Freedom Day parade. Further, during his summer 1979 tour of the UK, he performed at the London Gay Pride Festival in Hyde Park. That same year, Sylvester met the singer Jeanie Tracy through Harvey Fuqua, and they immediately became friends. A large black woman, Sylvester felt that Tracy would work well with his Two Tons O' Fun, and invited her to join his backing singers, which she proceeded to do. Subsequently, befriending the Tons, she would work for Sylvester for the rest of his life. The Tons themselves were convinced by Fuqua to produce their own self-titled album, from which came two dance chart hits, "Earth Can Be Just Like Heaven" and "Just Us"; as a result, they began to work less and less with Sylvester, only joining him on occasion for his live shows. In some interviews he would express bitterness at their departure, while in others he stressed that he had no bad feelings toward them.
In 1980, Sylvester also reached tabloid headlines after he was arrested on a visit to New York City, accused of being involved in the robbery of several rare coins. After three days of incarceration, he was released on a police bail of $30,000. Sylvester was never charged, and police later admitted their mistake after it was revealed that the real culprit had posed as Sylvester by signing cheques in his name.
Returning to San Francisco after this event, it was here that Sylvester produced his next album for Fantasy Records, Sell My Soul. Largely avoiding disco after the genre had become unpopular following the much publicized Disco Sucks movement, Sell My Soul instead represented a selection of soul-inspired dance tracks. Recorded in two weeks, Sylvester worked largely with backing singers and musicians whom he was unfamiliar with, and regular collaborators Rhodes and Cowley were entirely absent. Reviews were generally poor, describing the album as being average in quality. The only disco song on the album, "I Need You", was released as a single, but fared poorly.
Sylvester's fifth and final album for Fantasy Records was Too Hot to Sleep, in which he once again eschewed disco for a series of groove soul tunes, ballads, and gospel-style tracks. Missing the Two Tons entirely, Tracy was instead accompanied by a new backing singer, Maurice "Mo" Long, and because the three of them had all grown up in the Church of God in Christ, they decided to refer to themselves as the "C.O.G.I.C. Singers". The album also featured a number of tracks in which Sylvester avoided his usual falsetto tones to sing in a baritone voice. The album sold poorly.
1982–1986: Megatone Records
Both the Two Tons and Sylvester came to suspect that Fantasy Records had failed to pay them all of the money that they were owed from the sale of their records. Sylvester left Fantasy and in November 1982 he filed a lawsuit against them; it ultimately proved successful in establishing that the company had been withholding money from him totaling $218,112.50. Nevertheless, Fuqua proved unable to pay anything more than $20,000, meaning that Sylvester never saw the majority of the money that was legally owed to him. Sylvester grew to despise Fuqua, and forbade his friends from ever mentioning his name.
Closely associated with the now unpopular disco and having had no hit singles in the preceding few years, after leaving Fantasy Sylvester was not a particular draw for major record labels. Recognizing this state of affairs, in 1982 Sylvester commented that "there's nothing worse than a fallen star" who still has "illusions" of their continuing fame. Rather than chasing major chart success, Sylvester wanted to focus on retaining creative control over his music. Hiring his former tour manager and longstanding friend Tim McKenna as his new manager, Sylvester decided to produce his next album with Megatone Records, a small San Francisco company that had been founded in 1981 by Patrick Cowley and Marty Blecman and which catered largely to the gay club scene. The result was All I Need (1982), on which James Wirrick had written most of the songs, which were dance-orientated and influenced by the new wave music then in vogue. Sylvester insisted that he include several ballads on the album, which featured cover art by Mark Amerika depicting Sylvester in ancient Egyptian garb.
One of the best known Sylvester songs of this period was "Do Ya Wanna Funk", a Hi-NRG dance track co-written with Cowley which was released as a single in July 1982, topping the US dance charts and entering the pop charts in a number of countries across the world. Although he had continued working, Cowley was suffering from the recently discovered HIV/AIDS virus – at the time still referred to as "gay-related immune deficiency" (GRID) by American doctors – and was in a deteriorating physical condition. Sylvester continued touring, and it was while in London, preparing to perform at the Heaven superclub, that he learned of Cowley's death on November 12, 1982. He went onstage, informing the crowd of Cowley's passing and then sang "Do Ya Wanna Funk" in memory of him.
In 1983, Sylvester became a partner of Megatone Records. That year he also brought out his second album with the company, Call Me, but it was not a commercial success. Four songs from the album were released as singles, although only "Trouble in Paradise" entered the top 20 of the US dance charts; Sylvester later related that the song was his "AIDS message to San Francisco". Sylvester was emotionally moved by the HIV/AIDS epidemic, and began helping out at the Rita Rockett Lounge for patients of the disease at the San Francisco General Hospital as well as performing at various benefit concerts to raise money and awareness to combat the spread of the disease. In February 1984 he also performed a "One Night Only" retrospective of his work at the prestigious Castro Theatre. Sylvester still toured both domestically and in Europe, although he found that demand for his performances was decreasing, and that he was now playing to smaller venues and singing to a pre-recorded tape rather than to a live band as he had in the late 1970s.
His next album, entitled M-1015 (1984), was more frenetic and pumping than his previous releases, having embraced the recently developed genre of Hi-NRG, but it also included elements of electro and rap. The major figures behind the album had been Kessie and Morey Goldstein, and Sylvester himself had not written any of the tracks. The album also contained increasingly sexually explicit lyrics, in particular in the songs "How Do You Like Your Love" and "Sex". That year, he also entered into a relationship with an architect named Rick Cranmer, and together they moved into a new apartment in the hills, where Sylvester decorated his powder room with posters and memorabilia of Divine, the drag queen, actor and singer whom he had briefly known when they were in the Cockettes. In 1985, he fulfilled a lifelong ambition by working with the singer Aretha Franklin; he and Jeanie had been invited to provide backing vocals on Franklin's album Who's Zoomin' Who?.
Sylvester's final album, Mutual Attraction (1986), was produced by Megatone but licensed and released by Warner Bros. On the album, Sylvester had worked with a wide number of collaborators, and included new tracks alongside covers of songs by Stevie Wonder and George Gershwin. Reviews of the album were mixed, with many claiming that it was a poor release. One of the album's singles, "Someone Like You", proved more successful, reaching number one on the Billboard dance charts. Warner Bros booked him to appear on the New Year's Eve edition of The Late Show Starring Joan Rivers, during which Joan Rivers described him as a drag queen; visibly annoyed, he corrected her by stating that he was not a drag queen, proclaiming simply "I'm Sylvester!" The appearance was also notable for Sylvester publicly declaring his relationship with Rick Cranmer despite the fact that Cranmer's family were largely unaware of either the liaison or his sexuality.
1986–1988: Final years and death
In 1985, Sylvester's boyfriend, Rick Cranmer, became aware that he had become infected with HIV. With no known medical cure, his health deteriorated rapidly and he died September 7, 1987. Sylvester was devastated, and although recognizing that he too was probably infected, he refused to have his blood tested, only noticing the virus' first symptoms when he developed a persistent cough. Beginning work on an album that would remain unfinished, he moved into a new apartment on Collingwood Street in the Castro, and tried his best to continue performing in the Bay Area, even though he became too ill to undertake a full tour. Eventually diagnosed with AIDS, he was hospitalized for sinus surgery in late 1987, and upon returning to his apartment, he began to be cared for by his mother and Tracy, before being hospitalized again in May 1988, this time with pneumocystis pneumonia. Returning to his flat, he gave away many of his treasured possessions and wrote his will.
Having lost a lot of weight and unable to walk easily, he attended the Castro's 1988 Gay Freedom Parade in a wheelchair, being pushed along by McKenna in front of the People with AIDS banner; along Market Street, assembled crowds shouted out his name as he passed. The subsequent 1988 Castro Street Fair was named "A Tribute to Sylvester", and although he was too ill to attend, crowds chanted his name to such an extent that he was able to hear them from his bedroom. He continued to give interviews to the media, being open about the fact that he was dying of AIDS, and sought in particular to highlight the impact that the disease was having in the African-American community. In an interview with the NME, he stated, "I don't believe that AIDS is the wrath of God. People have a tendency to blame everything on God."
For Thanksgiving 1988, his family spent the holiday with him, although he had developed neuropathy and was increasingly bed-ridden and reliant on morphine; he died in his bed on December 16, 1988, at the age of 41. Sylvester had planned his own funeral, insisting that he be dressed in a red kimono and placed in an open-top coffin for the mourners to see, with his friend Yvette Flunder doing his corpse's makeup. He wanted Tracy to sing at his funeral, accompanied by choirs and many flowers. The whole affair took place in his church, the Love Center, with a sermon being provided by Reverend Walter Hawkins. The event was packed, with standing room only, and the coffin was subsequently taken and buried at his family's plot in Inglewood Park Cemetery. An album titled Immortal was posthumously released; it contained Sylvester's final studio recordings and was compiled by Marty Blecman.
Personal life
Sylvester has been described as having a "flamboyant and colourful" public persona, wearing both male and female gendered clothes as part of his attire, with his biographer Joshua Gamson opining that for Sylvester, "gender was an everyday choice". Sylvester described his public persona as "an extension of me, the real me".
Sylvester's friend and publicist Sharon Davis described him as "a quiet, often thoughtful, caring guy, who put others before himself, and was generous to a fault, having little regard for money. His policy was you only live once, so enjoy!" She also noted that he could be "unpredictable", being "stubborn as a mule" and "always speak[ing] his mind".
Sylvester was considered to be a prima donna by members of the Hot Band and could be temperamental and difficult with those with whom he worked. He found it difficult saving the money that he earned, instead spending it as soon as he obtained it, both on himself and on his lovers, friends, and family.
Sylvester was openly gay, with Gamson noting that he tended to enter into relationships with men who were "white, self-doubting and effeminate". In 1978, he entered into a relationship with a young white model named John Maley; Sylvester later devoted the song "Can't Forget the Love" from his Too Hot to Sleep album to his young lover. Maley ended the relationship to move to Los Angeles, later recollecting that Sylvester "was a lovely man, and I owe him a lot". In 1981, Sylvester entered into a relationship with a slim brunette from Deep River, Connecticut, named Michael Rayner, but unlike his predecessors, he did not move into Sylvester's house. Their partnership ended when Rayner admitted that he had not fallen completely in love with Sylvester. Sylvester's next major relationship was with Tom Daniels, a hairdresser whom he met in 1982, but their romance ended after six months when Daniels discovered that Sylvester had been having sex with other men while on tour. The singer's final partner, the architect Rick Cranmer, was a six-foot two blond, and the duo moved into a house together in the hills. Cranmer died of AIDS-related complications in 1987, the year before Sylvester succumbed to the virus.
As an openly gay man throughout his career, Sylvester came to be seen as a spokesman for the gay community. He informed a journalist that "I realize that gay people have put me on a pedestal and I love it. After all, of all the oppressed minorities, they just have to be the most oppressed. They have all the hassles of finding something or someone to identify with – and they chose me. I like being around gay people and they've proven to be some of my closest friends and most loyal audiences." Elsewhere, he nevertheless remarked that he felt his career had "transcended the gay movement. I mean, my sexuality has nothing to do with my music. When I'm fucking I'm not thinking about singing and vice versa." He was openly critical of what he perceived as divisive tendencies within the gay community itself, noting that "I get this conformist shit from queens all the time. They always want to read me. They always want me to do it their way. I am not going to conform to the gay lifestyle as they see it and that's for sure". He was particularly critical of "clones" – gay men who dressed alike with boots, boot-cut jeans, checked shirts and handlebar mustaches – stating that all too often they judged those gay people who were flamboyant or extravagant.
Davis characterized Sylvester as an "absolute perfectionist". He was very self-conscious about his physical appearance, and when he obtained enough money from the successful Step II album, he spent part of it on cosmetic surgery to remove a bump on his nose, inject silicone into his cheeks, and have cosmetic work done on his teeth. He would also insist that all pictures of himself were meticulously airbrushed.
Sylvester was born and raised into the Pentecostal denomination of Christianity, and remained a Christian throughout his life. He often compared the ecstatic feelings that accompanied his onstage performances with the feelings experienced in a gospel choir in a Pentecostal church. When performances reached a certain level of heightened emotion, he would comment that "we had service". In later life, he joined the Love Center Church in East Oakland, a ministry founded by the preacher and former gospel singer Walter Hawkins in the 1970s. He had been introduced to the church by Jeanie Tracy in the 1980s and would soon become a regular churchgoer, enjoying the place's welcoming attitude towards societal outcasts. Sylvester requested that his funeral be undertaken by the ministry at the Love Center.
Legacy
During the late 1970s, Sylvester gained the moniker of the "Queen of Disco", a term that continued to be given to the singer into the 21st century. The English journalist Stephen Brogan later described him as "a star who shined brightly. He only happened once. He was a radical and a visionary in terms of queerness, music and race." Reynaldo Anderson of Harris-Stowe State University described Sylvester's influence upon disco and subsequent electronic dance music as "incalculable". He added that Sylvester's songs "Dance (Disco Heat)", "You Make Me Feel (Mighty Real)", and "Do You Wanna Funk" represented "anthems of disco aficionados for a generation", while also expressing the view that Sylvester himself "personified the excesses of the 1970s and the experimentation that characterized [the decade's] changing social norms" within the United States.
Shapiro cited Sylvester alongside other artists such as Wendy Carlos, Throbbing Gristle, and Terre Thaemlitz as an individual who used electronic music as "a vehicle to express sexual transgression", while in her study of the use of falsetto in disco, Anne-Lise François believed that Sylvester's style of singing "makes the point most obviously about falsetto as a gender-bending device". The cultural studies scholar Tim Lawrence stated that Sylvester embodied "the [disco] movement's gay roots", and in doing could be contrasted with John Travolta, who embodied "its commercialization and suburbanization". The two figures thus reflected a divide between the gay and straight interpretations and presentations of disco music. Layli Philips and Marla R. Stewart compared Sylvester to both Willi Ninja and RuPaul as pop icons who exhibited "male femininity" within the "Black male diva (or 'queen') tradition".
In his will, Sylvester had declared that royalties from the future sale of this music be devoted to two HIV/AIDS charities, Project Open Hand and the AIDS Emergency Fund. Although Sylvester died deeply in debt as a result of taking advances on his royalties, by the early 1990s this debt had been paid off, and a balance had begun to build up. Roger Gross, the attorney to Sylvester's manager and the openly gay lawyer who helped him draw up his will, petitioned the probate court to designate the charities as the beneficiaries of Sylvester's will. The proceeds of $140,000 in accrued royalties were split between the two groups, and they will continue to be paid the royalties in the future.
On September 19, 2005, Sylvester was one of three artists inducted into the Dance Music Hall of Fame, alongside Chic and Gloria Gaynor. In December 2016, Billboard magazine ranked him as the 59th most successful dance artist of all-time. In 2023, Rolling Stone ranked Sylvester at number 169 on its list of the 200 Greatest Singers of All Time.
In 2019, "You Make Me Feel (Mighty Real)" was selected by the Library of Congress for preservation in the National Recording Registry for being "culturally, historically, or aesthetically significant".
Biographies, documentaries, and musicals
A biography of Sylvester was authored by Gamson and published in 2005. Writing for the London-based LGBT magazine Beige: The Provocative Cultural Quarterly, Stephen Brogan expressed his opinion that while Gamson's biography was well researched, it had a fragmented structure and as such was "not a joy to read". Entertainment Weekly called the book "playful and furious" and awarded it a B+ rating, The Boston Globe suggested that it was "as engaging as the times it so energetically resurrects", and The San Francisco Chronicle reported that the author "carefully paints the shifting social tapestry into his subject's life story without ever taking Sylvester out of the foreground". The Fabulous Sylvester won the 2006 Stonewall Book Award for nonfiction. In 2015, Sylvester's publicist Sharon Davis published memoirs of the time that she spent with Sylvester, noting that she planned for it to appear in 2013 to mark the 25th anniversary of Sylvester's death.
In 2010, the TV series Unsung aired an episode on Sylvester, that was later made available through YouTube. Sylvester: Mighty Real, an official feature-length documentary on the life and career of Sylvester, entered production; it featured interviews with members of Sylvester's family and other artists and musicians who have been inspired by, but by 2012 the film's progress had halted.
In August 2014, an Off-Broadway musical titled Mighty Real: A Fabulous Sylvester Musical opened at Theatre At St. Clement's in New York City. It was co-directed by Kendrell Bowman and Anthony Wayne, the latter of whom also performed as the titular character. Wayne stated that he discovered Sylvester's story through a television documentary, and was subsequently "inspired by his drive to be who he was regardless of what he went through", performing a concert of Sylvester's songs with friends Anastacia McCleskey and Jacqueline B. Arnold as the Two Tons o' Fun before deciding to begin work on the musical. A laudatory review of the musical from The New York Times noted that Wayne "certainly has the bravado, the androgynous sex appeal and the piercing voice to emulate the original convincingly". The Huffington Post review noted that the musical largely avoided dealing with the decline in Sylvester's musical success during the 1980s, and that although " anyone seeking an exhaustively researched play-by-play of the star's life would be better off waiting for a documentary", the musical "succeeds as a collection of infectious performances by a truly gifted cast".
In 2014 Sylvester was one of the inaugural honorees in the Rainbow Honor Walk, a walk of fame in San Francisco's Castro neighborhood noting LGBTQ people who have "made significant contributions in their fields".
Discography
Studio albums
Credited as Sylvester & the Hot Band.
Live albums
Compilation albums
Singles
Credited as Sylvester & the Hot Band.
See also
List of number-one dance hits (United States)
List of artists who reached number one on the US Dance chart
References
Citations
Sources
External links
Official website at the Wayback Machine
Sylvester entry at the Queer Cultural Center
Article at SoulMusic.com
Sylvester at DiscoMusic.com
1947 births
1988 deaths
African-American male singer-songwriters
AIDS-related deaths in California
American dance musicians
American male pop singers
African-American LGBT people
American gay musicians
American hi-NRG musicians
LGBT Pentecostals
American LGBT singers
LGBT people from California
African-American drag queens
American LGBT songwriters
Members of the Church of God in Christ
People from Watts, Los Angeles
Singers from Los Angeles
Burials at Inglewood Park Cemetery
Musicians from the San Francisco Bay Area
American disco singers
20th-century African-American male singers
Blue Thumb Records artists
Fantasy Records artists
HIV/AIDS activists
20th-century American LGBT people
Singer-songwriters from California
Gay singers
Gay songwriters
|
```java
//Problem: path_to_url
//Java 8
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
int c[] = new int[n];
for(int c_i=0; c_i < n; c_i++){
c[c_i] = in.nextInt();
}
int energy = 100;
int cloud = 0;
do
{
energy--; //You performed a jump
cloud = (cloud + k) % n;
if(c[cloud] == 1)
{
energy -= 2;//You landed on a thundercloud
}
}
while(cloud != 0);
System.out.println(energy);
}
}
```
|
```xml
/** @jsx jsx */
import { Node } from 'slate'
import { jsx } from 'slate-hyperscript'
export const input = (
<editor>
<element>
<text key="a" />
<text key="b" />
<text key="c" />
<text key="d" />
</element>
</editor>
)
export const test = value => {
return Array.from(
Node.descendants(value, {
from: [0, 1],
to: [0, 2],
})
)
}
export const output = [
[
<element>
<text key="a" />
<text key="b" />
<text key="c" />
<text key="d" />
</element>,
[0],
],
[<text key="b" />, [0, 1]],
[<text key="c" />, [0, 2]],
]
```
|
```python
from __future__ import division, absolute_import, print_function
import numpy as np
import numpy.matlib
from numpy.testing import assert_array_equal, assert_, run_module_suite
def test_empty():
x = numpy.matlib.empty((2,))
assert_(isinstance(x, np.matrix))
assert_(x.shape, (1, 2))
def test_ones():
assert_array_equal(numpy.matlib.ones((2, 3)),
np.matrix([[ 1., 1., 1.],
[ 1., 1., 1.]]))
assert_array_equal(numpy.matlib.ones(2), np.matrix([[ 1., 1.]]))
def test_zeros():
assert_array_equal(numpy.matlib.zeros((2, 3)),
np.matrix([[ 0., 0., 0.],
[ 0., 0., 0.]]))
assert_array_equal(numpy.matlib.zeros(2), np.matrix([[ 0., 0.]]))
def test_identity():
x = numpy.matlib.identity(2, dtype=np.int)
assert_array_equal(x, np.matrix([[1, 0], [0, 1]]))
def test_eye():
x = numpy.matlib.eye(3, k=1, dtype=int)
assert_array_equal(x, np.matrix([[ 0, 1, 0],
[ 0, 0, 1],
[ 0, 0, 0]]))
def test_rand():
x = numpy.matlib.rand(3)
# check matrix type, array would have shape (3,)
assert_(x.ndim == 2)
def test_randn():
x = np.matlib.randn(3)
# check matrix type, array would have shape (3,)
assert_(x.ndim == 2)
def test_repmat():
a1 = np.arange(4)
x = numpy.matlib.repmat(a1, 2, 2)
y = np.array([[0, 1, 2, 3, 0, 1, 2, 3],
[0, 1, 2, 3, 0, 1, 2, 3]])
assert_array_equal(x, y)
if __name__ == "__main__":
run_module_suite()
```
|
```php
<?php
/**
* Passbolt ~ Open source password manager for teams
*
* For full copyright and license information, please see the LICENSE.txt
* Redistributions of files must retain the above copyright notice.
*
* @link path_to_url Passbolt(tm)
* @since 4.5.0
*
* @see \Passbolt\PasswordExpiry\Notification\Email\PasswordExpirySettingsUpdatedEmailRedactor
* @var \App\View\AppView $this
* @var array $body
*/
use App\View\Helper\AvatarHelper;
use Cake\Routing\Router;
if (PHP_SAPI === 'cli') {
Router::fullBaseUrl($body['fullBaseUrl']);
}
/** @var array $operator */
$operator = $body['operator'];
/** @var array $setting */
$setting = $body['setting'];
/** @var string $userAgent */
$userAgent = $body['user_agent'];
/** @var string $clientIp */
$clientIp = $body['ip'];
echo $this->element('Email/module/avatar', [
'url' => AvatarHelper::getAvatarUrl($operator['profile']['avatar']),
'text' => $this->element('Email/module/avatar_text', [
'user' => $operator,
'datetime' => $setting['modified'],
'text' => $title,
]),
]);
$text = __('The password expiry settings have been updated.') . '<br/>';
echo $this->element('Email/module/text', [
'text' => $text,
]);
echo $this->element('Email/module/user_info', compact('userAgent', 'clientIp'));
echo $this->element('Email/module/button', [
'url' => Router::url('/app/administration/password-expiry', true),
'text' => __('View them in passbolt'),
]);
```
|
```c
/*
*
*/
#include "sdkconfig.h"
#include "esp_efuse.h"
#include <assert.h>
#include "esp_efuse_table.h"
// md5_digest_table 439495cbc35dc68d7566e05ac3dbb248
// This file was generated from the file esp_efuse_table.csv. DO NOT CHANGE THIS FILE MANUALLY.
// If you want to change some fields, you need to change esp_efuse_table.csv file
// then run `efuse_common_table` or `efuse_custom_table` command it will generate this file.
// To show efuse_table run the command 'show_efuse_table'.
static const esp_efuse_desc_t WR_DIS[] = {
{EFUSE_BLK0, 0, 8}, // [] Disable programming of individual eFuses,
};
static const esp_efuse_desc_t WR_DIS_RD_DIS[] = {
{EFUSE_BLK0, 0, 1}, // [] wr_dis of RD_DIS,
};
static const esp_efuse_desc_t WR_DIS_WDT_DELAY_SEL[] = {
{EFUSE_BLK0, 1, 1}, // [] wr_dis of WDT_DELAY_SEL,
};
static const esp_efuse_desc_t WR_DIS_DIS_PAD_JTAG[] = {
{EFUSE_BLK0, 1, 1}, // [] wr_dis of DIS_PAD_JTAG,
};
static const esp_efuse_desc_t WR_DIS_DIS_DOWNLOAD_ICACHE[] = {
{EFUSE_BLK0, 1, 1}, // [] wr_dis of DIS_DOWNLOAD_ICACHE,
};
static const esp_efuse_desc_t WR_DIS_DIS_DOWNLOAD_MANUAL_ENCRYPT[] = {
{EFUSE_BLK0, 2, 1}, // [] wr_dis of DIS_DOWNLOAD_MANUAL_ENCRYPT,
};
static const esp_efuse_desc_t WR_DIS_SPI_BOOT_CRYPT_CNT[] = {
{EFUSE_BLK0, 2, 1}, // [] wr_dis of SPI_BOOT_CRYPT_CNT,
};
static const esp_efuse_desc_t WR_DIS_XTS_KEY_LENGTH_256[] = {
{EFUSE_BLK0, 2, 1}, // [] wr_dis of XTS_KEY_LENGTH_256,
};
static const esp_efuse_desc_t WR_DIS_SECURE_BOOT_EN[] = {
{EFUSE_BLK0, 2, 1}, // [] wr_dis of SECURE_BOOT_EN,
};
static const esp_efuse_desc_t WR_DIS_UART_PRINT_CONTROL[] = {
{EFUSE_BLK0, 3, 1}, // [] wr_dis of UART_PRINT_CONTROL,
};
static const esp_efuse_desc_t WR_DIS_FORCE_SEND_RESUME[] = {
{EFUSE_BLK0, 3, 1}, // [] wr_dis of FORCE_SEND_RESUME,
};
static const esp_efuse_desc_t WR_DIS_DIS_DOWNLOAD_MODE[] = {
{EFUSE_BLK0, 3, 1}, // [] wr_dis of DIS_DOWNLOAD_MODE,
};
static const esp_efuse_desc_t WR_DIS_DIS_DIRECT_BOOT[] = {
{EFUSE_BLK0, 3, 1}, // [] wr_dis of DIS_DIRECT_BOOT,
};
static const esp_efuse_desc_t WR_DIS_ENABLE_SECURITY_DOWNLOAD[] = {
{EFUSE_BLK0, 3, 1}, // [] wr_dis of ENABLE_SECURITY_DOWNLOAD,
};
static const esp_efuse_desc_t WR_DIS_FLASH_TPUW[] = {
{EFUSE_BLK0, 3, 1}, // [] wr_dis of FLASH_TPUW,
};
static const esp_efuse_desc_t WR_DIS_SECURE_VERSION[] = {
{EFUSE_BLK0, 4, 1}, // [] wr_dis of SECURE_VERSION,
};
static const esp_efuse_desc_t WR_DIS_CUSTOM_MAC_USED[] = {
{EFUSE_BLK0, 4, 1}, // [WR_DIS.ENABLE_CUSTOM_MAC] wr_dis of CUSTOM_MAC_USED,
};
static const esp_efuse_desc_t WR_DIS_DISABLE_WAFER_VERSION_MAJOR[] = {
{EFUSE_BLK0, 4, 1}, // [] wr_dis of DISABLE_WAFER_VERSION_MAJOR,
};
static const esp_efuse_desc_t WR_DIS_DISABLE_BLK_VERSION_MAJOR[] = {
{EFUSE_BLK0, 4, 1}, // [] wr_dis of DISABLE_BLK_VERSION_MAJOR,
};
static const esp_efuse_desc_t WR_DIS_CUSTOM_MAC[] = {
{EFUSE_BLK0, 5, 1}, // [WR_DIS.MAC_CUSTOM WR_DIS.USER_DATA_MAC_CUSTOM] wr_dis of CUSTOM_MAC,
};
static const esp_efuse_desc_t WR_DIS_MAC[] = {
{EFUSE_BLK0, 6, 1}, // [WR_DIS.MAC_FACTORY] wr_dis of MAC,
};
static const esp_efuse_desc_t WR_DIS_WAFER_VERSION_MINOR[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of WAFER_VERSION_MINOR,
};
static const esp_efuse_desc_t WR_DIS_WAFER_VERSION_MAJOR[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of WAFER_VERSION_MAJOR,
};
static const esp_efuse_desc_t WR_DIS_PKG_VERSION[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of PKG_VERSION,
};
static const esp_efuse_desc_t WR_DIS_BLK_VERSION_MINOR[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of BLK_VERSION_MINOR,
};
static const esp_efuse_desc_t WR_DIS_BLK_VERSION_MAJOR[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of BLK_VERSION_MAJOR,
};
static const esp_efuse_desc_t WR_DIS_OCODE[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of OCODE,
};
static const esp_efuse_desc_t WR_DIS_TEMP_CALIB[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of TEMP_CALIB,
};
static const esp_efuse_desc_t WR_DIS_ADC1_INIT_CODE_ATTEN0[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of ADC1_INIT_CODE_ATTEN0,
};
static const esp_efuse_desc_t WR_DIS_ADC1_INIT_CODE_ATTEN3[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of ADC1_INIT_CODE_ATTEN3,
};
static const esp_efuse_desc_t WR_DIS_ADC1_CAL_VOL_ATTEN0[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of ADC1_CAL_VOL_ATTEN0,
};
static const esp_efuse_desc_t WR_DIS_ADC1_CAL_VOL_ATTEN3[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of ADC1_CAL_VOL_ATTEN3,
};
static const esp_efuse_desc_t WR_DIS_DIG_DBIAS_HVT[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of DIG_DBIAS_HVT,
};
static const esp_efuse_desc_t WR_DIS_DIG_LDO_SLP_DBIAS2[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of DIG_LDO_SLP_DBIAS2,
};
static const esp_efuse_desc_t WR_DIS_DIG_LDO_SLP_DBIAS26[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of DIG_LDO_SLP_DBIAS26,
};
static const esp_efuse_desc_t WR_DIS_DIG_LDO_ACT_DBIAS26[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of DIG_LDO_ACT_DBIAS26,
};
static const esp_efuse_desc_t WR_DIS_DIG_LDO_ACT_STEPD10[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of DIG_LDO_ACT_STEPD10,
};
static const esp_efuse_desc_t WR_DIS_RTC_LDO_SLP_DBIAS13[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of RTC_LDO_SLP_DBIAS13,
};
static const esp_efuse_desc_t WR_DIS_RTC_LDO_SLP_DBIAS29[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of RTC_LDO_SLP_DBIAS29,
};
static const esp_efuse_desc_t WR_DIS_RTC_LDO_SLP_DBIAS31[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of RTC_LDO_SLP_DBIAS31,
};
static const esp_efuse_desc_t WR_DIS_RTC_LDO_ACT_DBIAS31[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of RTC_LDO_ACT_DBIAS31,
};
static const esp_efuse_desc_t WR_DIS_RTC_LDO_ACT_DBIAS13[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of RTC_LDO_ACT_DBIAS13,
};
static const esp_efuse_desc_t WR_DIS_ADC_CALIBRATION_3[] = {
{EFUSE_BLK0, 6, 1}, // [] wr_dis of ADC_CALIBRATION_3,
};
static const esp_efuse_desc_t WR_DIS_BLOCK_KEY0[] = {
{EFUSE_BLK0, 7, 1}, // [WR_DIS.KEY0] wr_dis of BLOCK_KEY0,
};
static const esp_efuse_desc_t RD_DIS[] = {
{EFUSE_BLK0, 32, 2}, // [] Disable reading from BlOCK3,
};
static const esp_efuse_desc_t RD_DIS_KEY0[] = {
{EFUSE_BLK0, 32, 2}, // [] Read protection for EFUSE_BLK3. KEY0,
};
static const esp_efuse_desc_t RD_DIS_KEY0_LOW[] = {
{EFUSE_BLK0, 32, 1}, // [] Read protection for EFUSE_BLK3. KEY0 lower 128-bit key,
};
static const esp_efuse_desc_t RD_DIS_KEY0_HI[] = {
{EFUSE_BLK0, 33, 1}, // [] Read protection for EFUSE_BLK3. KEY0 higher 128-bit key,
};
static const esp_efuse_desc_t WDT_DELAY_SEL[] = {
{EFUSE_BLK0, 34, 2}, // [] RTC watchdog timeout threshold; in unit of slow clock cycle {0: "40000"; 1: "80000"; 2: "160000"; 3: "320000"},
};
static const esp_efuse_desc_t DIS_PAD_JTAG[] = {
{EFUSE_BLK0, 36, 1}, // [] Set this bit to disable pad jtag,
};
static const esp_efuse_desc_t DIS_DOWNLOAD_ICACHE[] = {
{EFUSE_BLK0, 37, 1}, // [] The bit be set to disable icache in download mode,
};
static const esp_efuse_desc_t DIS_DOWNLOAD_MANUAL_ENCRYPT[] = {
{EFUSE_BLK0, 38, 1}, // [] The bit be set to disable manual encryption,
};
static const esp_efuse_desc_t SPI_BOOT_CRYPT_CNT[] = {
{EFUSE_BLK0, 39, 3}, // [] Enables flash encryption when 1 or 3 bits are set and disables otherwise {0: "Disable"; 1: "Enable"; 3: "Disable"; 7: "Enable"},
};
static const esp_efuse_desc_t XTS_KEY_LENGTH_256[] = {
{EFUSE_BLK0, 42, 1}, // [] Flash encryption key length {0: "128 bits key"; 1: "256 bits key"},
};
static const esp_efuse_desc_t UART_PRINT_CONTROL[] = {
{EFUSE_BLK0, 43, 2}, // [] Set the default UARTboot message output mode {0: "Enable"; 1: "Enable when GPIO8 is low at reset"; 2: "Enable when GPIO8 is high at reset"; 3: "Disable"},
};
static const esp_efuse_desc_t FORCE_SEND_RESUME[] = {
{EFUSE_BLK0, 45, 1}, // [] Set this bit to force ROM code to send a resume command during SPI boot,
};
static const esp_efuse_desc_t DIS_DOWNLOAD_MODE[] = {
{EFUSE_BLK0, 46, 1}, // [] Set this bit to disable download mode (boot_mode[3:0] = 0; 1; 2; 4; 5; 6; 7),
};
static const esp_efuse_desc_t DIS_DIRECT_BOOT[] = {
{EFUSE_BLK0, 47, 1}, // [] This bit set means disable direct_boot mode,
};
static const esp_efuse_desc_t ENABLE_SECURITY_DOWNLOAD[] = {
{EFUSE_BLK0, 48, 1}, // [] Set this bit to enable secure UART download mode,
};
static const esp_efuse_desc_t FLASH_TPUW[] = {
{EFUSE_BLK0, 49, 4}, // [] Configures flash waiting time after power-up; in unit of ms. If the value is less than 15; the waiting time is the configurable value. Otherwise; the waiting time is twice the configurable value,
};
static const esp_efuse_desc_t SECURE_BOOT_EN[] = {
{EFUSE_BLK0, 53, 1}, // [] The bit be set to enable secure boot,
};
static const esp_efuse_desc_t SECURE_VERSION[] = {
{EFUSE_BLK0, 54, 4}, // [] Secure version for anti-rollback,
};
static const esp_efuse_desc_t CUSTOM_MAC_USED[] = {
{EFUSE_BLK0, 58, 1}, // [ENABLE_CUSTOM_MAC] True if MAC_CUSTOM is burned,
};
static const esp_efuse_desc_t DISABLE_WAFER_VERSION_MAJOR[] = {
{EFUSE_BLK0, 59, 1}, // [] Disables check of wafer version major,
};
static const esp_efuse_desc_t DISABLE_BLK_VERSION_MAJOR[] = {
{EFUSE_BLK0, 60, 1}, // [] Disables check of blk version major,
};
static const esp_efuse_desc_t USER_DATA[] = {
{EFUSE_BLK1, 0, 88}, // [] User data block,
};
static const esp_efuse_desc_t USER_DATA_MAC_CUSTOM[] = {
{EFUSE_BLK1, 0, 48}, // [MAC_CUSTOM CUSTOM_MAC] Custom MAC address,
};
static const esp_efuse_desc_t MAC[] = {
{EFUSE_BLK2, 40, 8}, // [MAC_FACTORY] MAC address,
{EFUSE_BLK2, 32, 8}, // [MAC_FACTORY] MAC address,
{EFUSE_BLK2, 24, 8}, // [MAC_FACTORY] MAC address,
{EFUSE_BLK2, 16, 8}, // [MAC_FACTORY] MAC address,
{EFUSE_BLK2, 8, 8}, // [MAC_FACTORY] MAC address,
{EFUSE_BLK2, 0, 8}, // [MAC_FACTORY] MAC address,
};
static const esp_efuse_desc_t WAFER_VERSION_MINOR[] = {
{EFUSE_BLK2, 48, 4}, // [] WAFER_VERSION_MINOR,
};
static const esp_efuse_desc_t WAFER_VERSION_MAJOR[] = {
{EFUSE_BLK2, 52, 2}, // [] WAFER_VERSION_MAJOR,
};
static const esp_efuse_desc_t PKG_VERSION[] = {
{EFUSE_BLK2, 54, 3}, // [] EFUSE_PKG_VERSION,
};
static const esp_efuse_desc_t BLK_VERSION_MINOR[] = {
{EFUSE_BLK2, 57, 3}, // [] Minor version of BLOCK2 {0: "No calib"; 1: "With calib"},
};
static const esp_efuse_desc_t BLK_VERSION_MAJOR[] = {
{EFUSE_BLK2, 60, 2}, // [] Major version of BLOCK2,
};
static const esp_efuse_desc_t OCODE[] = {
{EFUSE_BLK2, 62, 7}, // [] OCode,
};
static const esp_efuse_desc_t TEMP_CALIB[] = {
{EFUSE_BLK2, 69, 9}, // [] Temperature calibration data,
};
static const esp_efuse_desc_t ADC1_INIT_CODE_ATTEN0[] = {
{EFUSE_BLK2, 78, 8}, // [] ADC1 init code at atten0,
};
static const esp_efuse_desc_t ADC1_INIT_CODE_ATTEN3[] = {
{EFUSE_BLK2, 86, 5}, // [] ADC1 init code at atten3,
};
static const esp_efuse_desc_t ADC1_CAL_VOL_ATTEN0[] = {
{EFUSE_BLK2, 91, 8}, // [] ADC1 calibration voltage at atten0,
};
static const esp_efuse_desc_t ADC1_CAL_VOL_ATTEN3[] = {
{EFUSE_BLK2, 99, 6}, // [] ADC1 calibration voltage at atten3,
};
static const esp_efuse_desc_t DIG_DBIAS_HVT[] = {
{EFUSE_BLK2, 105, 5}, // [] BLOCK2 digital dbias when hvt,
};
static const esp_efuse_desc_t DIG_LDO_SLP_DBIAS2[] = {
{EFUSE_BLK2, 110, 7}, // [] BLOCK2 DIG_LDO_DBG0_DBIAS2,
};
static const esp_efuse_desc_t DIG_LDO_SLP_DBIAS26[] = {
{EFUSE_BLK2, 117, 8}, // [] BLOCK2 DIG_LDO_DBG0_DBIAS26,
};
static const esp_efuse_desc_t DIG_LDO_ACT_DBIAS26[] = {
{EFUSE_BLK2, 125, 6}, // [] BLOCK2 DIG_LDO_ACT_DBIAS26,
};
static const esp_efuse_desc_t DIG_LDO_ACT_STEPD10[] = {
{EFUSE_BLK2, 131, 4}, // [] BLOCK2 DIG_LDO_ACT_STEPD10,
};
static const esp_efuse_desc_t RTC_LDO_SLP_DBIAS13[] = {
{EFUSE_BLK2, 135, 7}, // [] BLOCK2 DIG_LDO_SLP_DBIAS13,
};
static const esp_efuse_desc_t RTC_LDO_SLP_DBIAS29[] = {
{EFUSE_BLK2, 142, 9}, // [] BLOCK2 DIG_LDO_SLP_DBIAS29,
};
static const esp_efuse_desc_t RTC_LDO_SLP_DBIAS31[] = {
{EFUSE_BLK2, 151, 6}, // [] BLOCK2 DIG_LDO_SLP_DBIAS31,
};
static const esp_efuse_desc_t RTC_LDO_ACT_DBIAS31[] = {
{EFUSE_BLK2, 157, 6}, // [] BLOCK2 DIG_LDO_ACT_DBIAS31,
};
static const esp_efuse_desc_t RTC_LDO_ACT_DBIAS13[] = {
{EFUSE_BLK2, 163, 8}, // [] BLOCK2 DIG_LDO_ACT_DBIAS13,
};
static const esp_efuse_desc_t ADC_CALIBRATION_3[] = {
{EFUSE_BLK2, 192, 11}, // [] Store the bit [86:96] of ADC calibration data,
};
static const esp_efuse_desc_t KEY0[] = {
{EFUSE_BLK3, 0, 256}, // [BLOCK_KEY0] BLOCK_BLOCK_KEY0 - 256-bits. 256-bit key of Flash Encryption,
};
static const esp_efuse_desc_t KEY0_FE_256BIT[] = {
{EFUSE_BLK3, 0, 256}, // [] 256bit FE key,
};
static const esp_efuse_desc_t KEY0_FE_128BIT[] = {
{EFUSE_BLK3, 0, 128}, // [] 128bit FE key,
};
static const esp_efuse_desc_t KEY0_SB_128BIT[] = {
{EFUSE_BLK3, 128, 128}, // [] 128bit SB key,
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS[] = {
&WR_DIS[0], // [] Disable programming of individual eFuses
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_RD_DIS[] = {
&WR_DIS_RD_DIS[0], // [] wr_dis of RD_DIS
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_WDT_DELAY_SEL[] = {
&WR_DIS_WDT_DELAY_SEL[0], // [] wr_dis of WDT_DELAY_SEL
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIS_PAD_JTAG[] = {
&WR_DIS_DIS_PAD_JTAG[0], // [] wr_dis of DIS_PAD_JTAG
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIS_DOWNLOAD_ICACHE[] = {
&WR_DIS_DIS_DOWNLOAD_ICACHE[0], // [] wr_dis of DIS_DOWNLOAD_ICACHE
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIS_DOWNLOAD_MANUAL_ENCRYPT[] = {
&WR_DIS_DIS_DOWNLOAD_MANUAL_ENCRYPT[0], // [] wr_dis of DIS_DOWNLOAD_MANUAL_ENCRYPT
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_SPI_BOOT_CRYPT_CNT[] = {
&WR_DIS_SPI_BOOT_CRYPT_CNT[0], // [] wr_dis of SPI_BOOT_CRYPT_CNT
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_XTS_KEY_LENGTH_256[] = {
&WR_DIS_XTS_KEY_LENGTH_256[0], // [] wr_dis of XTS_KEY_LENGTH_256
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_SECURE_BOOT_EN[] = {
&WR_DIS_SECURE_BOOT_EN[0], // [] wr_dis of SECURE_BOOT_EN
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_UART_PRINT_CONTROL[] = {
&WR_DIS_UART_PRINT_CONTROL[0], // [] wr_dis of UART_PRINT_CONTROL
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_FORCE_SEND_RESUME[] = {
&WR_DIS_FORCE_SEND_RESUME[0], // [] wr_dis of FORCE_SEND_RESUME
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIS_DOWNLOAD_MODE[] = {
&WR_DIS_DIS_DOWNLOAD_MODE[0], // [] wr_dis of DIS_DOWNLOAD_MODE
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIS_DIRECT_BOOT[] = {
&WR_DIS_DIS_DIRECT_BOOT[0], // [] wr_dis of DIS_DIRECT_BOOT
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_ENABLE_SECURITY_DOWNLOAD[] = {
&WR_DIS_ENABLE_SECURITY_DOWNLOAD[0], // [] wr_dis of ENABLE_SECURITY_DOWNLOAD
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_FLASH_TPUW[] = {
&WR_DIS_FLASH_TPUW[0], // [] wr_dis of FLASH_TPUW
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_SECURE_VERSION[] = {
&WR_DIS_SECURE_VERSION[0], // [] wr_dis of SECURE_VERSION
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_CUSTOM_MAC_USED[] = {
&WR_DIS_CUSTOM_MAC_USED[0], // [WR_DIS.ENABLE_CUSTOM_MAC] wr_dis of CUSTOM_MAC_USED
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DISABLE_WAFER_VERSION_MAJOR[] = {
&WR_DIS_DISABLE_WAFER_VERSION_MAJOR[0], // [] wr_dis of DISABLE_WAFER_VERSION_MAJOR
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DISABLE_BLK_VERSION_MAJOR[] = {
&WR_DIS_DISABLE_BLK_VERSION_MAJOR[0], // [] wr_dis of DISABLE_BLK_VERSION_MAJOR
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_CUSTOM_MAC[] = {
&WR_DIS_CUSTOM_MAC[0], // [WR_DIS.MAC_CUSTOM WR_DIS.USER_DATA_MAC_CUSTOM] wr_dis of CUSTOM_MAC
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_MAC[] = {
&WR_DIS_MAC[0], // [WR_DIS.MAC_FACTORY] wr_dis of MAC
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_WAFER_VERSION_MINOR[] = {
&WR_DIS_WAFER_VERSION_MINOR[0], // [] wr_dis of WAFER_VERSION_MINOR
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_WAFER_VERSION_MAJOR[] = {
&WR_DIS_WAFER_VERSION_MAJOR[0], // [] wr_dis of WAFER_VERSION_MAJOR
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_PKG_VERSION[] = {
&WR_DIS_PKG_VERSION[0], // [] wr_dis of PKG_VERSION
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_BLK_VERSION_MINOR[] = {
&WR_DIS_BLK_VERSION_MINOR[0], // [] wr_dis of BLK_VERSION_MINOR
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_BLK_VERSION_MAJOR[] = {
&WR_DIS_BLK_VERSION_MAJOR[0], // [] wr_dis of BLK_VERSION_MAJOR
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_OCODE[] = {
&WR_DIS_OCODE[0], // [] wr_dis of OCODE
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_TEMP_CALIB[] = {
&WR_DIS_TEMP_CALIB[0], // [] wr_dis of TEMP_CALIB
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_ADC1_INIT_CODE_ATTEN0[] = {
&WR_DIS_ADC1_INIT_CODE_ATTEN0[0], // [] wr_dis of ADC1_INIT_CODE_ATTEN0
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_ADC1_INIT_CODE_ATTEN3[] = {
&WR_DIS_ADC1_INIT_CODE_ATTEN3[0], // [] wr_dis of ADC1_INIT_CODE_ATTEN3
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_ADC1_CAL_VOL_ATTEN0[] = {
&WR_DIS_ADC1_CAL_VOL_ATTEN0[0], // [] wr_dis of ADC1_CAL_VOL_ATTEN0
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_ADC1_CAL_VOL_ATTEN3[] = {
&WR_DIS_ADC1_CAL_VOL_ATTEN3[0], // [] wr_dis of ADC1_CAL_VOL_ATTEN3
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIG_DBIAS_HVT[] = {
&WR_DIS_DIG_DBIAS_HVT[0], // [] wr_dis of DIG_DBIAS_HVT
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIG_LDO_SLP_DBIAS2[] = {
&WR_DIS_DIG_LDO_SLP_DBIAS2[0], // [] wr_dis of DIG_LDO_SLP_DBIAS2
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIG_LDO_SLP_DBIAS26[] = {
&WR_DIS_DIG_LDO_SLP_DBIAS26[0], // [] wr_dis of DIG_LDO_SLP_DBIAS26
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIG_LDO_ACT_DBIAS26[] = {
&WR_DIS_DIG_LDO_ACT_DBIAS26[0], // [] wr_dis of DIG_LDO_ACT_DBIAS26
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_DIG_LDO_ACT_STEPD10[] = {
&WR_DIS_DIG_LDO_ACT_STEPD10[0], // [] wr_dis of DIG_LDO_ACT_STEPD10
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_RTC_LDO_SLP_DBIAS13[] = {
&WR_DIS_RTC_LDO_SLP_DBIAS13[0], // [] wr_dis of RTC_LDO_SLP_DBIAS13
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_RTC_LDO_SLP_DBIAS29[] = {
&WR_DIS_RTC_LDO_SLP_DBIAS29[0], // [] wr_dis of RTC_LDO_SLP_DBIAS29
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_RTC_LDO_SLP_DBIAS31[] = {
&WR_DIS_RTC_LDO_SLP_DBIAS31[0], // [] wr_dis of RTC_LDO_SLP_DBIAS31
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_RTC_LDO_ACT_DBIAS31[] = {
&WR_DIS_RTC_LDO_ACT_DBIAS31[0], // [] wr_dis of RTC_LDO_ACT_DBIAS31
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_RTC_LDO_ACT_DBIAS13[] = {
&WR_DIS_RTC_LDO_ACT_DBIAS13[0], // [] wr_dis of RTC_LDO_ACT_DBIAS13
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_ADC_CALIBRATION_3[] = {
&WR_DIS_ADC_CALIBRATION_3[0], // [] wr_dis of ADC_CALIBRATION_3
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WR_DIS_BLOCK_KEY0[] = {
&WR_DIS_BLOCK_KEY0[0], // [WR_DIS.KEY0] wr_dis of BLOCK_KEY0
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_RD_DIS[] = {
&RD_DIS[0], // [] Disable reading from BlOCK3
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_RD_DIS_KEY0[] = {
&RD_DIS_KEY0[0], // [] Read protection for EFUSE_BLK3. KEY0
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_RD_DIS_KEY0_LOW[] = {
&RD_DIS_KEY0_LOW[0], // [] Read protection for EFUSE_BLK3. KEY0 lower 128-bit key
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_RD_DIS_KEY0_HI[] = {
&RD_DIS_KEY0_HI[0], // [] Read protection for EFUSE_BLK3. KEY0 higher 128-bit key
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WDT_DELAY_SEL[] = {
&WDT_DELAY_SEL[0], // [] RTC watchdog timeout threshold; in unit of slow clock cycle {0: "40000"; 1: "80000"; 2: "160000"; 3: "320000"}
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIS_PAD_JTAG[] = {
&DIS_PAD_JTAG[0], // [] Set this bit to disable pad jtag
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIS_DOWNLOAD_ICACHE[] = {
&DIS_DOWNLOAD_ICACHE[0], // [] The bit be set to disable icache in download mode
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIS_DOWNLOAD_MANUAL_ENCRYPT[] = {
&DIS_DOWNLOAD_MANUAL_ENCRYPT[0], // [] The bit be set to disable manual encryption
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_SPI_BOOT_CRYPT_CNT[] = {
&SPI_BOOT_CRYPT_CNT[0], // [] Enables flash encryption when 1 or 3 bits are set and disables otherwise {0: "Disable"; 1: "Enable"; 3: "Disable"; 7: "Enable"}
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_XTS_KEY_LENGTH_256[] = {
&XTS_KEY_LENGTH_256[0], // [] Flash encryption key length {0: "128 bits key"; 1: "256 bits key"}
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_UART_PRINT_CONTROL[] = {
&UART_PRINT_CONTROL[0], // [] Set the default UARTboot message output mode {0: "Enable"; 1: "Enable when GPIO8 is low at reset"; 2: "Enable when GPIO8 is high at reset"; 3: "Disable"}
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_FORCE_SEND_RESUME[] = {
&FORCE_SEND_RESUME[0], // [] Set this bit to force ROM code to send a resume command during SPI boot
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIS_DOWNLOAD_MODE[] = {
&DIS_DOWNLOAD_MODE[0], // [] Set this bit to disable download mode (boot_mode[3:0] = 0; 1; 2; 4; 5; 6; 7)
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIS_DIRECT_BOOT[] = {
&DIS_DIRECT_BOOT[0], // [] This bit set means disable direct_boot mode
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_ENABLE_SECURITY_DOWNLOAD[] = {
&ENABLE_SECURITY_DOWNLOAD[0], // [] Set this bit to enable secure UART download mode
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_FLASH_TPUW[] = {
&FLASH_TPUW[0], // [] Configures flash waiting time after power-up; in unit of ms. If the value is less than 15; the waiting time is the configurable value. Otherwise; the waiting time is twice the configurable value
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_SECURE_BOOT_EN[] = {
&SECURE_BOOT_EN[0], // [] The bit be set to enable secure boot
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_SECURE_VERSION[] = {
&SECURE_VERSION[0], // [] Secure version for anti-rollback
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_CUSTOM_MAC_USED[] = {
&CUSTOM_MAC_USED[0], // [ENABLE_CUSTOM_MAC] True if MAC_CUSTOM is burned
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DISABLE_WAFER_VERSION_MAJOR[] = {
&DISABLE_WAFER_VERSION_MAJOR[0], // [] Disables check of wafer version major
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DISABLE_BLK_VERSION_MAJOR[] = {
&DISABLE_BLK_VERSION_MAJOR[0], // [] Disables check of blk version major
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_USER_DATA[] = {
&USER_DATA[0], // [] User data block
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_USER_DATA_MAC_CUSTOM[] = {
&USER_DATA_MAC_CUSTOM[0], // [MAC_CUSTOM CUSTOM_MAC] Custom MAC address
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_MAC[] = {
&MAC[0], // [MAC_FACTORY] MAC address
&MAC[1], // [MAC_FACTORY] MAC address
&MAC[2], // [MAC_FACTORY] MAC address
&MAC[3], // [MAC_FACTORY] MAC address
&MAC[4], // [MAC_FACTORY] MAC address
&MAC[5], // [MAC_FACTORY] MAC address
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WAFER_VERSION_MINOR[] = {
&WAFER_VERSION_MINOR[0], // [] WAFER_VERSION_MINOR
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_WAFER_VERSION_MAJOR[] = {
&WAFER_VERSION_MAJOR[0], // [] WAFER_VERSION_MAJOR
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_PKG_VERSION[] = {
&PKG_VERSION[0], // [] EFUSE_PKG_VERSION
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_BLK_VERSION_MINOR[] = {
&BLK_VERSION_MINOR[0], // [] Minor version of BLOCK2 {0: "No calib"; 1: "With calib"}
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_BLK_VERSION_MAJOR[] = {
&BLK_VERSION_MAJOR[0], // [] Major version of BLOCK2
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_OCODE[] = {
&OCODE[0], // [] OCode
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_TEMP_CALIB[] = {
&TEMP_CALIB[0], // [] Temperature calibration data
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_ADC1_INIT_CODE_ATTEN0[] = {
&ADC1_INIT_CODE_ATTEN0[0], // [] ADC1 init code at atten0
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_ADC1_INIT_CODE_ATTEN3[] = {
&ADC1_INIT_CODE_ATTEN3[0], // [] ADC1 init code at atten3
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_ADC1_CAL_VOL_ATTEN0[] = {
&ADC1_CAL_VOL_ATTEN0[0], // [] ADC1 calibration voltage at atten0
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_ADC1_CAL_VOL_ATTEN3[] = {
&ADC1_CAL_VOL_ATTEN3[0], // [] ADC1 calibration voltage at atten3
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIG_DBIAS_HVT[] = {
&DIG_DBIAS_HVT[0], // [] BLOCK2 digital dbias when hvt
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIG_LDO_SLP_DBIAS2[] = {
&DIG_LDO_SLP_DBIAS2[0], // [] BLOCK2 DIG_LDO_DBG0_DBIAS2
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIG_LDO_SLP_DBIAS26[] = {
&DIG_LDO_SLP_DBIAS26[0], // [] BLOCK2 DIG_LDO_DBG0_DBIAS26
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIG_LDO_ACT_DBIAS26[] = {
&DIG_LDO_ACT_DBIAS26[0], // [] BLOCK2 DIG_LDO_ACT_DBIAS26
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_DIG_LDO_ACT_STEPD10[] = {
&DIG_LDO_ACT_STEPD10[0], // [] BLOCK2 DIG_LDO_ACT_STEPD10
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_RTC_LDO_SLP_DBIAS13[] = {
&RTC_LDO_SLP_DBIAS13[0], // [] BLOCK2 DIG_LDO_SLP_DBIAS13
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_RTC_LDO_SLP_DBIAS29[] = {
&RTC_LDO_SLP_DBIAS29[0], // [] BLOCK2 DIG_LDO_SLP_DBIAS29
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_RTC_LDO_SLP_DBIAS31[] = {
&RTC_LDO_SLP_DBIAS31[0], // [] BLOCK2 DIG_LDO_SLP_DBIAS31
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_RTC_LDO_ACT_DBIAS31[] = {
&RTC_LDO_ACT_DBIAS31[0], // [] BLOCK2 DIG_LDO_ACT_DBIAS31
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_RTC_LDO_ACT_DBIAS13[] = {
&RTC_LDO_ACT_DBIAS13[0], // [] BLOCK2 DIG_LDO_ACT_DBIAS13
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_ADC_CALIBRATION_3[] = {
&ADC_CALIBRATION_3[0], // [] Store the bit [86:96] of ADC calibration data
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_KEY0[] = {
&KEY0[0], // [BLOCK_KEY0] BLOCK_BLOCK_KEY0 - 256-bits. 256-bit key of Flash Encryption
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_KEY0_FE_256BIT[] = {
&KEY0_FE_256BIT[0], // [] 256bit FE key
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_KEY0_FE_128BIT[] = {
&KEY0_FE_128BIT[0], // [] 128bit FE key
NULL
};
const esp_efuse_desc_t* ESP_EFUSE_KEY0_SB_128BIT[] = {
&KEY0_SB_128BIT[0], // [] 128bit SB key
NULL
};
```
|
Egchel is a village in the Dutch province of Limburg. It is a part of the municipality of Peel en Maas, and lies about 14 km north of Roermond.
The village was first mentioned in 1405 as Heynchen van Aygel. The etymology is unknown.
Egchel was home to 195 people in 1840. The Catholic St Jacobus de Meerdere Church was built in 1948.
References
Populated places in Limburg (Netherlands)
Peel en Maas
|
```java
package apoc.mongodb;
import org.junit.BeforeClass;
/**
* To check that, with the latest mongodb java driver,
* the {@link MongoTest} works correctly with mongoDB 4
*/
public class MongoVersion4Test extends MongoTest {
@BeforeClass
public static void setUp() throws Exception {
beforeClassCommon(MongoVersion.FOUR);
}
}
```
|
```c++
//
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
// entry_points_gles_2_0_ext.cpp : Implements the GLES 2.0 extension entry points.
#include "libGLESv2/entry_points_gles_2_0_ext.h"
#include "libGLESv2/global_state.h"
#include "libANGLE/Buffer.h"
#include "libANGLE/Context.h"
#include "libANGLE/Error.h"
#include "libANGLE/Fence.h"
#include "libANGLE/Framebuffer.h"
#include "libANGLE/Shader.h"
#include "libANGLE/Query.h"
#include "libANGLE/validationES.h"
#include "libANGLE/validationES2.h"
#include "libANGLE/validationES3.h"
#include "common/debug.h"
#include "common/utilities.h"
namespace gl
{
void GL_APIENTRY BeginQueryEXT(GLenum target, GLuint id)
{
EVENT("(GLenum target = 0x%X, GLuint %d)", target, id);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateBeginQuery(context, target, id))
{
return;
}
Error error = context->beginQuery(target, id);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY DeleteFencesNV(GLsizei n, const GLuint* fences)
{
EVENT("(GLsizei n = %d, const GLuint* fences = 0x%0.8p)", n, fences);
Context *context = GetValidGlobalContext();
if (context)
{
if (n < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
for (int i = 0; i < n; i++)
{
context->deleteFenceNV(fences[i]);
}
}
}
void GL_APIENTRY DeleteQueriesEXT(GLsizei n, const GLuint *ids)
{
EVENT("(GLsizei n = %d, const GLuint *ids = 0x%0.8p)", n, ids);
Context *context = GetValidGlobalContext();
if (context)
{
if (n < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
for (int i = 0; i < n; i++)
{
context->deleteQuery(ids[i]);
}
}
}
void GL_APIENTRY DrawArraysInstancedANGLE(GLenum mode, GLint first, GLsizei count, GLsizei primcount)
{
EVENT("(GLenum mode = 0x%X, GLint first = %d, GLsizei count = %d, GLsizei primcount = %d)", mode, first, count, primcount);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateDrawArraysInstancedANGLE(context, mode, first, count, primcount))
{
return;
}
Error error = context->drawArraysInstanced(mode, first, count, primcount);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY DrawElementsInstancedANGLE(GLenum mode, GLsizei count, GLenum type, const GLvoid *indices, GLsizei primcount)
{
EVENT("(GLenum mode = 0x%X, GLsizei count = %d, GLenum type = 0x%X, const GLvoid* indices = 0x%0.8p, GLsizei primcount = %d)",
mode, count, type, indices, primcount);
Context *context = GetValidGlobalContext();
if (context)
{
IndexRange indexRange;
if (!ValidateDrawElementsInstancedANGLE(context, mode, count, type, indices, primcount, &indexRange))
{
return;
}
Error error =
context->drawElementsInstanced(mode, count, type, indices, primcount, indexRange);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY EndQueryEXT(GLenum target)
{
EVENT("GLenum target = 0x%X)", target);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateEndQuery(context, target))
{
return;
}
Error error = context->endQuery(target);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY FinishFenceNV(GLuint fence)
{
EVENT("(GLuint fence = %d)", fence);
Context *context = GetValidGlobalContext();
if (context)
{
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (fenceObject->isSet() != GL_TRUE)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
fenceObject->finish();
}
}
void GL_APIENTRY GenFencesNV(GLsizei n, GLuint* fences)
{
EVENT("(GLsizei n = %d, GLuint* fences = 0x%0.8p)", n, fences);
Context *context = GetValidGlobalContext();
if (context)
{
if (n < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
for (int i = 0; i < n; i++)
{
fences[i] = context->createFenceNV();
}
}
}
void GL_APIENTRY GenQueriesEXT(GLsizei n, GLuint* ids)
{
EVENT("(GLsizei n = %d, GLuint* ids = 0x%0.8p)", n, ids);
Context *context = GetValidGlobalContext();
if (context)
{
if (n < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
for (GLsizei i = 0; i < n; i++)
{
ids[i] = context->createQuery();
}
}
}
void GL_APIENTRY GetFenceivNV(GLuint fence, GLenum pname, GLint *params)
{
EVENT("(GLuint fence = %d, GLenum pname = 0x%X, GLint *params = 0x%0.8p)", fence, pname, params);
Context *context = GetValidGlobalContext();
if (context)
{
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (fenceObject->isSet() != GL_TRUE)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
switch (pname)
{
case GL_FENCE_STATUS_NV:
{
// GL_NV_fence spec:
// Once the status of a fence has been finished (via FinishFenceNV) or tested and the returned status is TRUE (via either TestFenceNV
// or GetFenceivNV querying the FENCE_STATUS_NV), the status remains TRUE until the next SetFenceNV of the fence.
GLboolean status = GL_TRUE;
if (fenceObject->getStatus() != GL_TRUE)
{
Error error = fenceObject->test(&status);
if (error.isError())
{
context->recordError(error);
return;
}
}
*params = status;
break;
}
case GL_FENCE_CONDITION_NV:
{
*params = static_cast<GLint>(fenceObject->getCondition());
break;
}
default:
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
}
}
}
GLenum GL_APIENTRY GetGraphicsResetStatusEXT(void)
{
EVENT("()");
Context *context = GetGlobalContext();
if (context)
{
return context->getResetStatus();
}
return GL_NO_ERROR;
}
void GL_APIENTRY GetQueryivEXT(GLenum target, GLenum pname, GLint *params)
{
EVENT("GLenum target = 0x%X, GLenum pname = 0x%X, GLint *params = 0x%0.8p)", target, pname, params);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidQueryType(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
switch (pname)
{
case GL_CURRENT_QUERY_EXT:
params[0] = context->getState().getActiveQueryId(target);
break;
default:
context->recordError(Error(GL_INVALID_ENUM));
return;
}
}
}
void GL_APIENTRY GetQueryObjectuivEXT(GLuint id, GLenum pname, GLuint *params)
{
EVENT("(GLuint id = %d, GLenum pname = 0x%X, GLuint *params = 0x%0.8p)", id, pname, params);
Context *context = GetValidGlobalContext();
if (context)
{
Query *queryObject = context->getQuery(id, false, GL_NONE);
if (!queryObject)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (context->getState().getActiveQueryId(queryObject->getType()) == id)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
switch(pname)
{
case GL_QUERY_RESULT_EXT:
{
Error error = queryObject->getResult(params);
if (error.isError())
{
context->recordError(error);
return;
}
}
break;
case GL_QUERY_RESULT_AVAILABLE_EXT:
{
Error error = queryObject->isResultAvailable(params);
if (error.isError())
{
context->recordError(error);
return;
}
}
break;
default:
context->recordError(Error(GL_INVALID_ENUM));
return;
}
}
}
void GL_APIENTRY GetTranslatedShaderSourceANGLE(GLuint shader, GLsizei bufsize, GLsizei* length, GLchar* source)
{
EVENT("(GLuint shader = %d, GLsizei bufsize = %d, GLsizei* length = 0x%0.8p, GLchar* source = 0x%0.8p)",
shader, bufsize, length, source);
Context *context = GetValidGlobalContext();
if (context)
{
if (bufsize < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
Shader *shaderObject = context->getShader(shader);
if (!shaderObject)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
// Only returns extra info if ANGLE_GENERATE_SHADER_DEBUG_INFO is defined
shaderObject->getTranslatedSourceWithDebugInfo(bufsize, length, source);
}
}
void GL_APIENTRY GetnUniformfvEXT(GLuint program, GLint location, GLsizei bufSize, GLfloat* params)
{
EVENT("(GLuint program = %d, GLint location = %d, GLsizei bufSize = %d, GLfloat* params = 0x%0.8p)",
program, location, bufSize, params);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateGetnUniformfvEXT(context, program, location, bufSize, params))
{
return;
}
Program *programObject = context->getProgram(program);
ASSERT(programObject);
programObject->getUniformfv(location, params);
}
}
void GL_APIENTRY GetnUniformivEXT(GLuint program, GLint location, GLsizei bufSize, GLint* params)
{
EVENT("(GLuint program = %d, GLint location = %d, GLsizei bufSize = %d, GLint* params = 0x%0.8p)",
program, location, bufSize, params);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateGetnUniformivEXT(context, program, location, bufSize, params))
{
return;
}
Program *programObject = context->getProgram(program);
ASSERT(programObject);
programObject->getUniformiv(location, params);
}
}
GLboolean GL_APIENTRY IsFenceNV(GLuint fence)
{
EVENT("(GLuint fence = %d)", fence);
Context *context = GetValidGlobalContext();
if (context)
{
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
return GL_FALSE;
}
// GL_NV_fence spec:
// A name returned by GenFencesNV, but not yet set via SetFenceNV, is not the name of an existing fence.
return fenceObject->isSet();
}
return GL_FALSE;
}
GLboolean GL_APIENTRY IsQueryEXT(GLuint id)
{
EVENT("(GLuint id = %d)", id);
Context *context = GetValidGlobalContext();
if (context)
{
return (context->getQuery(id, false, GL_NONE) != NULL) ? GL_TRUE : GL_FALSE;
}
return GL_FALSE;
}
void GL_APIENTRY ReadnPixelsEXT(GLint x, GLint y, GLsizei width, GLsizei height,
GLenum format, GLenum type, GLsizei bufSize,
GLvoid *data)
{
EVENT("(GLint x = %d, GLint y = %d, GLsizei width = %d, GLsizei height = %d, "
"GLenum format = 0x%X, GLenum type = 0x%X, GLsizei bufSize = 0x%d, GLvoid *data = 0x%0.8p)",
x, y, width, height, format, type, bufSize, data);
Context *context = GetValidGlobalContext();
if (context)
{
if (width < 0 || height < 0 || bufSize < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
if (!ValidateReadPixelsParameters(context, x, y, width, height,
format, type, &bufSize, data))
{
return;
}
Framebuffer *framebufferObject = context->getState().getReadFramebuffer();
ASSERT(framebufferObject);
Rectangle area(x, y, width, height);
Error error = framebufferObject->readPixels(context, area, format, type, data);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY RenderbufferStorageMultisampleANGLE(GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height)
{
EVENT("(GLenum target = 0x%X, GLsizei samples = %d, GLenum internalformat = 0x%X, GLsizei width = %d, GLsizei height = %d)",
target, samples, internalformat, width, height);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateRenderbufferStorageParametersANGLE(context, target, samples, internalformat,
width, height))
{
return;
}
Renderbuffer *renderbuffer = context->getState().getCurrentRenderbuffer();
Error error = renderbuffer->setStorageMultisample(samples, internalformat, width, height);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY SetFenceNV(GLuint fence, GLenum condition)
{
EVENT("(GLuint fence = %d, GLenum condition = 0x%X)", fence, condition);
Context *context = GetValidGlobalContext();
if (context)
{
if (condition != GL_ALL_COMPLETED_NV)
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
Error error = fenceObject->set(condition);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
GLboolean GL_APIENTRY TestFenceNV(GLuint fence)
{
EVENT("(GLuint fence = %d)", fence);
Context *context = GetValidGlobalContext();
if (context)
{
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return GL_TRUE;
}
if (fenceObject->isSet() != GL_TRUE)
{
context->recordError(Error(GL_INVALID_OPERATION));
return GL_TRUE;
}
GLboolean result;
Error error = fenceObject->test(&result);
if (error.isError())
{
context->recordError(error);
return GL_TRUE;
}
return result;
}
return GL_TRUE;
}
void GL_APIENTRY TexStorage2DEXT(GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height)
{
EVENT("(GLenum target = 0x%X, GLsizei levels = %d, GLenum internalformat = 0x%X, GLsizei width = %d, GLsizei height = %d)",
target, levels, internalformat, width, height);
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().textureStorage)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (context->getClientVersion() < 3 &&
!ValidateES2TexStorageParameters(context, target, levels, internalformat, width, height))
{
return;
}
if (context->getClientVersion() >= 3 &&
!ValidateES3TexStorageParameters(context, target, levels, internalformat, width, height, 1))
{
return;
}
Extents size(width, height, 1);
Texture *texture = context->getTargetTexture(target);
Error error = texture->setStorage(target, levels, internalformat, size);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY VertexAttribDivisorANGLE(GLuint index, GLuint divisor)
{
EVENT("(GLuint index = %d, GLuint divisor = %d)", index, divisor);
Context *context = GetValidGlobalContext();
if (context)
{
if (index >= MAX_VERTEX_ATTRIBS)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
if (context->getLimitations().attributeZeroRequiresZeroDivisorInEXT)
{
if (index == 0 && divisor != 0)
{
const char *errorMessage = "The current context doesn't support setting a non-zero divisor on the attribute with index zero. "
"Please reorder the attributes in your vertex shader so that attribute zero can have a zero divisor.";
context->recordError(Error(GL_INVALID_OPERATION, errorMessage));
// We also output an error message to the debugger window if tracing is active, so that developers can see the error message.
ERR("%s", errorMessage);
return;
}
}
context->setVertexAttribDivisor(index, divisor);
}
}
void GL_APIENTRY BlitFramebufferANGLE(GLint srcX0, GLint srcY0, GLint srcX1, GLint srcY1, GLint dstX0, GLint dstY0, GLint dstX1, GLint dstY1,
GLbitfield mask, GLenum filter)
{
EVENT("(GLint srcX0 = %d, GLint srcY0 = %d, GLint srcX1 = %d, GLint srcY1 = %d, "
"GLint dstX0 = %d, GLint dstY0 = %d, GLint dstX1 = %d, GLint dstY1 = %d, "
"GLbitfield mask = 0x%X, GLenum filter = 0x%X)",
srcX0, srcY0, srcX1, srcX1, dstX0, dstY0, dstX1, dstY1, mask, filter);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateBlitFramebufferParameters(context, srcX0, srcY0, srcX1, srcY1,
dstX0, dstY0, dstX1, dstY1, mask, filter,
true))
{
return;
}
Framebuffer *readFramebuffer = context->getState().getReadFramebuffer();
ASSERT(readFramebuffer);
Framebuffer *drawFramebuffer = context->getState().getDrawFramebuffer();
ASSERT(drawFramebuffer);
Rectangle srcArea(srcX0, srcY0, srcX1 - srcX0, srcY1 - srcY0);
Rectangle dstArea(dstX0, dstY0, dstX1 - dstX0, dstY1 - dstY0);
Error error =
drawFramebuffer->blit(context, srcArea, dstArea, mask, filter, readFramebuffer);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY DiscardFramebufferEXT(GLenum target, GLsizei numAttachments, const GLenum *attachments)
{
EVENT("(GLenum target = 0x%X, GLsizei numAttachments = %d, attachments = 0x%0.8p)", target, numAttachments, attachments);
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().discardFramebuffer)
{
context->recordError(Error(GL_INVALID_OPERATION, "Extension not enabled"));
return;
}
if (!ValidateDiscardFramebufferEXT(context, target, numAttachments, attachments))
{
return;
}
Framebuffer *framebuffer = context->getState().getTargetFramebuffer(target);
ASSERT(framebuffer);
// The specification isn't clear what should be done when the framebuffer isn't complete.
// We leave it up to the framebuffer implementation to decide what to do.
Error error = framebuffer->discard(numAttachments, attachments);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY TexImage3DOES(GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth,
GLint border, GLenum format, GLenum type, const GLvoid* pixels)
{
EVENT("(GLenum target = 0x%X, GLint level = %d, GLenum internalformat = 0x%X, "
"GLsizei width = %d, GLsizei height = %d, GLsizei depth = %d, GLint border = %d, "
"GLenum format = 0x%X, GLenum type = 0x%x, const GLvoid* pixels = 0x%0.8p)",
target, level, internalformat, width, height, depth, border, format, type, pixels);
UNIMPLEMENTED(); // FIXME
}
void GL_APIENTRY GetProgramBinaryOES(GLuint program, GLsizei bufSize, GLsizei *length, GLenum *binaryFormat, void *binary)
{
EVENT("(GLenum program = 0x%X, bufSize = %d, length = 0x%0.8p, binaryFormat = 0x%0.8p, binary = 0x%0.8p)",
program, bufSize, length, binaryFormat, binary);
Context *context = GetValidGlobalContext();
if (context)
{
Program *programObject = context->getProgram(program);
if (!programObject || !programObject->isLinked())
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
Error error = programObject->saveBinary(binaryFormat, binary, bufSize, length);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY ProgramBinaryOES(GLuint program, GLenum binaryFormat, const void *binary, GLint length)
{
EVENT("(GLenum program = 0x%X, binaryFormat = 0x%x, binary = 0x%0.8p, length = %d)",
program, binaryFormat, binary, length);
Context *context = GetValidGlobalContext();
if (context)
{
const std::vector<GLenum> &programBinaryFormats = context->getCaps().programBinaryFormats;
if (std::find(programBinaryFormats.begin(), programBinaryFormats.end(), binaryFormat) == programBinaryFormats.end())
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
Program *programObject = context->getProgram(program);
if (!programObject)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
Error error = programObject->loadBinary(binaryFormat, binary, length);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY DrawBuffersEXT(GLsizei n, const GLenum *bufs)
{
EVENT("(GLenum n = %d, bufs = 0x%0.8p)", n, bufs);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateDrawBuffers(context, n, bufs))
{
return;
}
Framebuffer *framebuffer = context->getState().getDrawFramebuffer();
ASSERT(framebuffer);
framebuffer->setDrawBuffers(n, bufs);
}
}
void GL_APIENTRY GetBufferPointervOES(GLenum target, GLenum pname, void** params)
{
EVENT("(GLenum target = 0x%X, GLenum pname = 0x%X, GLvoid** params = 0x%0.8p)", target, pname, params);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
if (pname != GL_BUFFER_MAP_POINTER)
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (!buffer || !buffer->isMapped())
{
*params = NULL;
}
else
{
*params = buffer->getMapPointer();
}
}
}
void *GL_APIENTRY MapBufferOES(GLenum target, GLenum access)
{
EVENT("(GLenum target = 0x%X, GLbitfield access = 0x%X)", target, access);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return NULL;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (buffer == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
if (access != GL_WRITE_ONLY_OES)
{
context->recordError(Error(GL_INVALID_ENUM));
return NULL;
}
if (buffer->isMapped())
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
Error error = buffer->map(access);
if (error.isError())
{
context->recordError(error);
return NULL;
}
return buffer->getMapPointer();
}
return NULL;
}
GLboolean GL_APIENTRY UnmapBufferOES(GLenum target)
{
EVENT("(GLenum target = 0x%X)", target);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return GL_FALSE;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (buffer == NULL || !buffer->isMapped())
{
context->recordError(Error(GL_INVALID_OPERATION));
return GL_FALSE;
}
GLboolean result;
Error error = buffer->unmap(&result);
if (error.isError())
{
context->recordError(error);
return GL_FALSE;
}
return result;
}
return GL_FALSE;
}
void *GL_APIENTRY MapBufferRangeEXT(GLenum target, GLintptr offset, GLsizeiptr length, GLbitfield access)
{
EVENT("(GLenum target = 0x%X, GLintptr offset = %d, GLsizeiptr length = %d, GLbitfield access = 0x%X)",
target, offset, length, access);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return NULL;
}
if (offset < 0 || length < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return NULL;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (buffer == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
// Check for buffer overflow
size_t offsetSize = static_cast<size_t>(offset);
size_t lengthSize = static_cast<size_t>(length);
if (!rx::IsUnsignedAdditionSafe(offsetSize, lengthSize) ||
offsetSize + lengthSize > static_cast<size_t>(buffer->getSize()))
{
context->recordError(Error(GL_INVALID_VALUE));
return NULL;
}
// Check for invalid bits in the mask
GLbitfield allAccessBits = GL_MAP_READ_BIT |
GL_MAP_WRITE_BIT |
GL_MAP_INVALIDATE_RANGE_BIT |
GL_MAP_INVALIDATE_BUFFER_BIT |
GL_MAP_FLUSH_EXPLICIT_BIT |
GL_MAP_UNSYNCHRONIZED_BIT;
if (access & ~(allAccessBits))
{
context->recordError(Error(GL_INVALID_VALUE));
return NULL;
}
if (length == 0 || buffer->isMapped())
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
// Check for invalid bit combinations
if ((access & (GL_MAP_READ_BIT | GL_MAP_WRITE_BIT)) == 0)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
GLbitfield writeOnlyBits = GL_MAP_INVALIDATE_RANGE_BIT |
GL_MAP_INVALIDATE_BUFFER_BIT |
GL_MAP_UNSYNCHRONIZED_BIT;
if ((access & GL_MAP_READ_BIT) != 0 && (access & writeOnlyBits) != 0)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
if ((access & GL_MAP_WRITE_BIT) == 0 && (access & GL_MAP_FLUSH_EXPLICIT_BIT) != 0)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
Error error = buffer->mapRange(offset, length, access);
if (error.isError())
{
context->recordError(error);
return NULL;
}
return buffer->getMapPointer();
}
return NULL;
}
void GL_APIENTRY FlushMappedBufferRangeEXT(GLenum target, GLintptr offset, GLsizeiptr length)
{
EVENT("(GLenum target = 0x%X, GLintptr offset = %d, GLsizeiptr length = %d)", target, offset, length);
Context *context = GetValidGlobalContext();
if (context)
{
if (offset < 0 || length < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (buffer == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (!buffer->isMapped() || (buffer->getAccessFlags() & GL_MAP_FLUSH_EXPLICIT_BIT) == 0)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
// Check for buffer overflow
size_t offsetSize = static_cast<size_t>(offset);
size_t lengthSize = static_cast<size_t>(length);
if (!rx::IsUnsignedAdditionSafe(offsetSize, lengthSize) ||
offsetSize + lengthSize > static_cast<size_t>(buffer->getMapLength()))
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
// We do not currently support a non-trivial implementation of FlushMappedBufferRange
}
}
void GL_APIENTRY InsertEventMarkerEXT(GLsizei length, const char *marker)
{
// Don't run an EVENT() macro on the EXT_debug_marker entry points.
// It can interfere with the debug events being set by the caller.
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().debugMarker)
{
// The debug marker calls should not set error state
// However, it seems reasonable to set an error state if the extension is not enabled
context->recordError(Error(GL_INVALID_OPERATION, "Extension not enabled"));
return;
}
if (!ValidateInsertEventMarkerEXT(context, length, marker))
{
return;
}
context->insertEventMarker(length, marker);
}
}
void GL_APIENTRY PushGroupMarkerEXT(GLsizei length, const char *marker)
{
// Don't run an EVENT() macro on the EXT_debug_marker entry points.
// It can interfere with the debug events being set by the caller.
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().debugMarker)
{
// The debug marker calls should not set error state
// However, it seems reasonable to set an error state if the extension is not enabled
context->recordError(Error(GL_INVALID_OPERATION, "Extension not enabled"));
return;
}
if (!ValidatePushGroupMarkerEXT(context, length, marker))
{
return;
}
if (marker == nullptr)
{
// From the EXT_debug_marker spec,
// "If <marker> is null then an empty string is pushed on the stack."
context->pushGroupMarker(length, "");
}
else
{
context->pushGroupMarker(length, marker);
}
}
}
void GL_APIENTRY PopGroupMarkerEXT()
{
// Don't run an EVENT() macro on the EXT_debug_marker entry points.
// It can interfere with the debug events being set by the caller.
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().debugMarker)
{
// The debug marker calls should not set error state
// However, it seems reasonable to set an error state if the extension is not enabled
context->recordError(Error(GL_INVALID_OPERATION, "Extension not enabled"));
return;
}
context->popGroupMarker();
}
}
ANGLE_EXPORT void GL_APIENTRY EGLImageTargetTexture2DOES(GLenum target, GLeglImageOES image)
{
EVENT("(GLenum target = 0x%X, GLeglImageOES image = 0x%0.8p)", target, image);
Context *context = GetValidGlobalContext();
if (context)
{
egl::Display *display = egl::GetGlobalDisplay();
egl::Image *imageObject = reinterpret_cast<egl::Image *>(image);
if (!ValidateEGLImageTargetTexture2DOES(context, display, target, imageObject))
{
return;
}
Texture *texture = context->getTargetTexture(target);
Error error = texture->setEGLImageTarget(target, imageObject);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
ANGLE_EXPORT void GL_APIENTRY EGLImageTargetRenderbufferStorageOES(GLenum target,
GLeglImageOES image)
{
EVENT("(GLenum target = 0x%X, GLeglImageOES image = 0x%0.8p)", target, image);
Context *context = GetValidGlobalContext();
if (context)
{
egl::Display *display = egl::GetGlobalDisplay();
egl::Image *imageObject = reinterpret_cast<egl::Image *>(image);
if (!ValidateEGLImageTargetRenderbufferStorageOES(context, display, target, imageObject))
{
return;
}
Renderbuffer *renderbuffer = context->getState().getCurrentRenderbuffer();
Error error = renderbuffer->setStorageEGLImageTarget(imageObject);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY BindVertexArrayOES(GLuint array)
{
EVENT("(GLuint array = %u)", array);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateBindVertexArrayOES(context, array))
{
return;
}
context->bindVertexArray(array);
}
}
void GL_APIENTRY DeleteVertexArraysOES(GLsizei n, const GLuint *arrays)
{
EVENT("(GLsizei n = %d, const GLuint* arrays = 0x%0.8p)", n, arrays);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateDeleteVertexArraysOES(context, n))
{
return;
}
for (int arrayIndex = 0; arrayIndex < n; arrayIndex++)
{
if (arrays[arrayIndex] != 0)
{
context->deleteVertexArray(arrays[arrayIndex]);
}
}
}
}
void GL_APIENTRY GenVertexArraysOES(GLsizei n, GLuint *arrays)
{
EVENT("(GLsizei n = %d, GLuint* arrays = 0x%0.8p)", n, arrays);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateGenVertexArraysOES(context, n))
{
return;
}
for (int arrayIndex = 0; arrayIndex < n; arrayIndex++)
{
arrays[arrayIndex] = context->createVertexArray();
}
}
}
GLboolean GL_APIENTRY IsVertexArrayOES(GLuint array)
{
EVENT("(GLuint array = %u)", array);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateIsVertexArrayOES(context))
{
return GL_FALSE;
}
if (array == 0)
{
return GL_FALSE;
}
VertexArray *vao = context->getVertexArray(array);
return (vao != nullptr ? GL_TRUE : GL_FALSE);
}
return GL_FALSE;
}
}
```
|
Revali Mahotsav is a small village in Ratnagiri district, Maharashtra state in Western India. The 2011 Census of India recorded a total of 208 residents in the village. Revali Mahostsav's geographical area is .
References
Villages in Ratnagiri district
|
```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.thingsboard.server.common.data.sync.vc;
import lombok.Data;
import lombok.NoArgsConstructor;
import org.thingsboard.server.common.data.id.EntityId;
@Data
@NoArgsConstructor
public class VersionedEntityInfo {
private EntityId externalId;
public VersionedEntityInfo(EntityId externalId) {
this.externalId = externalId;
}
}
```
|
```c++
/*
This program is free software; you can redistribute it and/or modify
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <ndb_global.h>
#include <ndb_opts.h>
#include <NdbOut.hpp>
#include <NdbApi.hpp>
#include <NDBT.hpp>
static const char* _dbname = "TEST_DB";
const char *load_default_groups[]= { "mysql_cluster",0 };
static struct my_option my_long_options[] =
{
NDB_STD_OPTS("ndb_desc"),
{ "database", 'd', "Name of database table is in",
(uchar**) &_dbname, (uchar**) &_dbname, 0,
GET_STR, REQUIRED_ARG, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0}
};
static void short_usage_sub(void)
{
ndb_short_usage_sub(NULL);
}
static void usage()
{
ndb_usage(short_usage_sub, load_default_groups, my_long_options);
}
int main(int argc, char** argv){
NDB_INIT(argv[0]);
ndb_opt_set_usage_funcs(short_usage_sub, usage);
load_defaults("my",load_default_groups,&argc,&argv);
int ho_error;
if ((ho_error=handle_options(&argc, &argv, my_long_options,
ndb_std_get_one_option)))
return NDBT_ProgramExit(NDBT_WRONGARGS);
if (argc < 1) {
usage();
return NDBT_ProgramExit(NDBT_WRONGARGS);
}
Ndb_cluster_connection con(opt_ndb_connectstring, opt_ndb_nodeid);
con.set_name("ndb_drop_table");
if(con.connect(12, 5, 1) != 0)
{
ndbout << "Unable to connect to management server." << endl;
return NDBT_ProgramExit(NDBT_FAILED);
}
if (con.wait_until_ready(30,3) < 0)
{
ndbout << "Cluster nodes not ready in 30 seconds." << endl;
return NDBT_ProgramExit(NDBT_FAILED);
}
Ndb MyNdb(&con, _dbname );
if(MyNdb.init() != 0){
ERR(MyNdb.getNdbError());
return NDBT_ProgramExit(NDBT_FAILED);
}
int res = 0;
for(int i = 0; i<argc; i++){
ndbout << "Dropping table " << argv[i] << "...";
int tmp;
if((tmp = MyNdb.getDictionary()->dropTable(argv[i])) != 0){
ndbout << endl << MyNdb.getDictionary()->getNdbError() << endl;
res = tmp;
} else {
ndbout << "OK" << endl;
}
}
if(res != 0){
return NDBT_ProgramExit(NDBT_FAILED);
}
return NDBT_ProgramExit(NDBT_OK);
}
```
|
```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.thingsboard.monitoring.client;
import org.springframework.beans.factory.annotation.Value;
import org.springframework.beans.factory.config.ConfigurableBeanFactory;
import org.springframework.boot.web.client.RestTemplateBuilder;
import org.springframework.context.annotation.Scope;
import org.springframework.stereotype.Component;
import org.thingsboard.rest.client.RestClient;
import java.time.Duration;
@Component
@Scope(ConfigurableBeanFactory.SCOPE_PROTOTYPE)
public class TbClient extends RestClient {
@Value("${monitoring.rest.username}")
private String username;
@Value("${monitoring.rest.password}")
private String password;
public TbClient(@Value("${monitoring.rest.base_url}") String baseUrl,
@Value("${monitoring.rest.request_timeout_ms}") int requestTimeoutMs) {
super(new RestTemplateBuilder()
.setConnectTimeout(Duration.ofMillis(requestTimeoutMs))
.setReadTimeout(Duration.ofMillis(requestTimeoutMs))
.build(), baseUrl);
}
public String logIn() {
login(username, password);
return getToken();
}
}
```
|
The Bridge over the River Kwai () is a novel by the French novelist Pierre Boulle, published in French in 1952 and English translation by Xan Fielding in 1954. The story is fictional but uses the construction of the Burma Railway, in 1942–1943, as its historical setting, and is partly based on Pierre Boulle's own life experience working in Malaysia rubber plantations and later working for allied forces in Singapore and Indochina during World War II. The novel deals with the plight of World War II British prisoners of war forced by the Imperial Japanese Army to build a bridge for the "Death Railway", so named because of the large number of prisoners and conscripts who died during its construction. The novel won France's Prix Sainte-Beuve in 1952.
Historical context
The largely fictitious plot is based on the building in 1942 of one of the railway bridges over the Mae Klong river—renamed Khwae Yai in the 1960s—at a place called Tha Ma Kham, from the Thai town of Kanchanaburi.
According to the Commonwealth War Graves Commission
"The notorious Burma-Siam railway, built by Commonwealth, Dutch and American prisoners of war, was a Japanese project driven by the need for improved communications to support the large Japanese army in Burma. During its construction, approximately 13,000 prisoners of war died and were buried along the railway. An estimated 80,000 to 100,000 civilians also died in the course of the project, chiefly forced labour brought from Malaya and the Dutch East Indies, or conscripted in Siam (Thailand) and Burma (Myanmar). Two labour forces, one based in Siam and the other in Burma worked from opposite ends of the line towards the centre."
Boulle had been a prisoner of the Japanese in Southeast Asia and his story of collaboration was based on his experience with some French officers. However, he chose instead to use British officers in his book.
Plot summary
The story describes the use of prisoners in the POW camp to build the bridge and how a separate team of experts from 'Force 316' based in Calcutta were sent to sabotage the bridge.
Lt. Colonel Nicholson marches his men into Prisoner of War Camp 16, commanded by Colonel Saito. Saito announces that the prisoners will be required to work on construction of a bridge over the River Kwai so that the railroad connection between Bangkok and Rangoon can be completed. Saito also demands that all men, including officers, will do manual labor. In response to this, Nicholson informs Saito that, under the Hague Conventions (1899 and 1907), officers cannot be required to do hard work. Saito reiterates his demand and Nicholson remains adamant in his refusal to submit his officers to manual labor. Because of Nicholson's unwillingness to back down, he and his officers are placed in the "ovens"—small, iron boxes sitting in the heat of day. Eventually, Nicholson's stubbornness forces Saito to relent.
Construction of the bridge serves as a symbol of the preservation of professionalism and personal integrity to one prisoner, Colonel Nicholson, a proud perfectionist. Pitted against Colonel Saito, the warden of the Japanese POW camp, Nicholson will nevertheless, out of a distorted sense of duty, aid his enemy. As the Allies, on the outside, race to destroy the bridge, Nicholson must decide which to sacrifice: his patriotism or his pride.
Historicity
The incidents portrayed in the book are mostly fictional, and though it depicts bad conditions and suffering caused by the building of the Burma Railway and its bridges, the reality was appalling. Historically the conditions were much worse. The real senior Allied officer at the bridge was British Lieutenant Colonel Philip Toosey. On a BBC Timewatch programme, a former prisoner at the camp states that it is unlikely that a man like the fictional Nicholson could have risen to the rank of lieutenant colonel; and if he had, he would have been "quietly eliminated" by the other prisoners. Julie Summers, in her book The Colonel of Tamarkan, writes that Pierre Boulle, who had been a prisoner of war in Thailand, created the fictional Nicholson character as an amalgam of his memories of collaborating French officers. Boulle outlined the psychological reasoning which led him to conceive the character of Nicholson in an interview which forms part of the 1969 BBC2 documentary "Return to the River Kwai" made by former POW John Coast. A transcript of the interview and the documentary as a whole can be found in the new edition of John Coast's book "Railroad of Death".
Unlike the fictional Nicholson, Toosey was not a collaborator with the Japanese. Toosey, in fact, delayed building the bridge by obstruction. Whereas Nicholson disapproves of acts of sabotage and other deliberate attempts to delay progress, Toosey encouraged this: termites were collected in large numbers to eat the wooden structures, and the concrete was badly mixed.
Film adaptation
The novel was made into the 1957 film The Bridge on the River Kwai, directed by David Lean, which won the 1957 Academy Award for Best Picture. This film was shot in Sri Lanka (then called Ceylon), and a bridge was erected for the purpose of shooting the film over Kelani River at Kitulgala, Sri Lanka.
The film was relatively faithful to the novel, with two major exceptions. Shears, who is a British commando officer like Warden in the novel, became an American sailor who escapes from the POW camp. Also, in the novel, the bridge is not destroyed: the train plummets into the river from a secondary charge placed by Warden, but Nicholson (never realising "what have I done?") does not fall onto the plunger, and the bridge suffers only minor damage. Boulle nonetheless enjoyed the film version though he disagreed with its climax.
After the film was released, the Thais faced a problem as thousands of tourists came to see the 'bridge over the River Kwai', but no such bridge existed due to Boulle's aforementioned misassumption. As the film and book meant to 'portray' the bridge over the Mae Klong, the Thai authorities officially renamed the river. The Mae Klong is now called the Kwae Yai ('Big Kwae') for several miles north of the confluence with the Kwae Noi ('Little Kwae'), including the section under the bridge.
Parody
In 1962 Spike Milligan and Peter Sellers, with Peter Cook and Jonathan Miller, released the record The Bridge on the River Wye, a spoof of the film version of Kwai based around the 1957 Goon Show "An African Incident". It was intended to have the same name as the film, but shortly before its release, the film company threatened legal action if the name was used. Producer George Martin edited out the "K" every time the word "Kwai" was spoken.
References
1952 French novels
Bridges in fiction
French historical novels
French novels adapted into films
Novels set in Thailand
Novels about prisoners of war
Books about imprisonment
Works about rail transport
Novels set during World War II
Works by Pierre Boulle
|
```objective-c
#pragma once
#include <string>
#include <vector>
#include "envoy/network/socket.h"
#include "envoy/singleton/manager.h"
#include "envoy/upstream/cluster_manager.h"
#include "source/extensions/common/dynamic_forward_proxy/dns_cache.h"
#include "source/extensions/common/dynamic_forward_proxy/dns_cache_impl.h"
#include "library/common/engine_types.h"
#include "library/common/network/proxy_settings.h"
#include "library/common/types/c_types.h"
/**
* envoy_netconf_t identifies a snapshot of network configuration state. It's returned from calls
* that may alter current state, and passed back as a parameter to this API to determine if calls
* remain valid/relevant at time of execution.
*
* Currently, there are two primary circumstances this is used:
* 1. When network type changes, a refreshDNS call will be scheduled on the event dispatcher, along
* with a configuration key of this type. If network type changes again before that refresh
* executes, the refresh is now stale, another refresh task will have been queued, and it should no
* longer execute. The configuration key allows the connectivity_manager to determine if the
* refreshDNS call is representative of current configuration.
* 2. When a request is configured with a certain set of socket options and begins, it is given a
* configuration key. The heuristic in reportNetworkUsage relies on characteristics of the
* request/response to make future decisions about socket options, but needs to be able to correctly
* associate these metrics with their original configuration. If network state changes while the
* request/response are in-flight, the connectivity_manager can determine the relevance of
* associated metrics through the configuration key.
*
* Additionally, in the future, more advanced heuristics may maintain multiple parallel
* configurations across different interfaces/network types. In these more complicated scenarios, a
* configuration key will be able to identify not only if the configuration is current, but also
* which of several current configurations is relevant.
*/
typedef uint16_t envoy_netconf_t;
namespace Envoy {
namespace Network {
/**
* These values specify the behavior of the network connectivity_manager with respect to the
* upstream socket options it supplies.
*/
enum class SocketMode : int {
// In this mode, the connectivity_manager will provide socket options that result in the creation
// of a
// distinct connection pool for a given value of preferred network.
DefaultPreferredNetworkMode = 0,
// In this mode, the connectivity_manager will provide socket options that intentionally attempt
// to
// override the current preferred network type with an alternative, via interface-binding socket
// options. Note this mode is experimental, and it will not be enabled at all unless
// enable_interface_binding_ is set to true.
AlternateBoundInterfaceMode = 1,
};
using DnsCacheManagerSharedPtr = Extensions::Common::DynamicForwardProxy::DnsCacheManagerSharedPtr;
using InterfacePair = std::pair<const std::string, Address::InstanceConstSharedPtr>;
/**
* Object responsible for tracking network state, especially with respect to multiple interfaces,
* and providing auxiliary configuration to network connections, in the form of upstream socket
* options.
*
* Code is largely structured to be run exclusively on the engine's main thread. However,
* setPreferredNetwork is allowed to be called from any thread, and the internal NetworkState that
* it modifies owns a mutex used to synchronize all access to that state.
* (Note NetworkState was originally designed to fit into an atomic, and could still feasibly be
* switched to one.)
*
* This object is a singleton per-engine. Note that several pieces of functionality assume a DNS
* cache adhering to the one set up in base configuration will be present, but will become no-ops
* if that cache is missing either due to alternate configurations, or lifecycle-related timing.
*
*/
class ConnectivityManager
: public Extensions::Common::DynamicForwardProxy::DnsCache::UpdateCallbacks {
public:
virtual ~ConnectivityManager() = default;
/**
* @returns a list of local network interfaces supporting IPv4.
*/
virtual std::vector<InterfacePair> enumerateV4Interfaces() PURE;
/**
* @returns a list of local network interfaces supporting IPv6.
*/
virtual std::vector<InterfacePair> enumerateV6Interfaces() PURE;
/**
* @param family, network family of the interface.
* @param select_flags, flags which MUST be set for each returned interface.
* @param reject_flags, flags which MUST NOT be set for any returned interface.
* @returns a list of local network interfaces filtered by the providered flags.
*/
virtual std::vector<InterfacePair> enumerateInterfaces(unsigned short family,
unsigned int select_flags,
unsigned int reject_flags) PURE;
/**
* @returns the current OS default/preferred network class.
*/
virtual NetworkType getPreferredNetwork() PURE;
/**
* @returns the current mode used to determine upstream socket options.
*/
virtual SocketMode getSocketMode() PURE;
/**
* @returns configuration key representing current network state.
*/
virtual envoy_netconf_t getConfigurationKey() PURE;
/**
*
* @return the current proxy settings.
*/
virtual Envoy::Network::ProxySettingsConstSharedPtr getProxySettings() PURE;
/**
* Call to report on the current viability of the passed network configuration after an attempt
* at transmission (e.g., an HTTP request).
* @param network_fault, whether a transmission attempt terminated w/o receiving upstream bytes.
*/
virtual void reportNetworkUsage(envoy_netconf_t configuration_key, bool network_fault) PURE;
/**
* @brief Sets the current proxy settings.
*
* @param proxy_settings The proxy settings. `nullptr` if there is no proxy configured on a
* device.
*/
virtual void setProxySettings(ProxySettingsConstSharedPtr proxy_settings) PURE;
/**
* Configure whether connections should be drained after a triggered DNS refresh. Currently this
* may happen either due to an external call to refreshConnectivityState or an update to
* setPreferredNetwork.
* @param enabled, whether to enable connection drain after DNS refresh.
*/
virtual void setDrainPostDnsRefreshEnabled(bool enabled) PURE;
/**
* Sets whether subsequent calls for upstream socket options may leverage options that bind
* to specific network interfaces.
* @param enabled, whether to enable interface binding.
*/
virtual void setInterfaceBindingEnabled(bool enabled) PURE;
/**
* Refresh DNS in response to preferred network update. May be no-op.
* @param configuration_key, key provided by this class representing the current configuration.
* @param drain_connections, request that connections be drained after next DNS resolution.
*/
virtual void refreshDns(envoy_netconf_t configuration_key, bool drain_connections) PURE;
/**
* Drain all upstream connections associated with this Engine.
*/
virtual void resetConnectivityState() PURE;
/**
* @returns the current socket options that should be used for connections.
*/
virtual Socket::OptionsSharedPtr getUpstreamSocketOptions(NetworkType network,
SocketMode socket_mode) PURE;
/**
* @param options, upstream connection options to which additional options should be appended.
* @returns configuration key to associate with any related calls.
*/
virtual envoy_netconf_t addUpstreamSocketOptions(Socket::OptionsSharedPtr options) PURE;
/**
* Returns the default DNS cache set up in base configuration. This cache may be missing either
* due to engine lifecycle-related timing or alternate configurations. If it is, operations
* that use it should revert to no-ops.
*
* @returns the default DNS cache set up in base configuration or nullptr.
*/
virtual Extensions::Common::DynamicForwardProxy::DnsCacheSharedPtr dnsCache() PURE;
};
class ConnectivityManagerImpl : public ConnectivityManager,
public Singleton::Instance,
public Logger::Loggable<Logger::Id::upstream> {
public:
/**
* Sets the current OS default/preferred network class. Note this function is allowed to be
* called from any thread.
* @param network, the OS-preferred network.
* @returns configuration key to associate with any related calls.
*/
static envoy_netconf_t setPreferredNetwork(NetworkType network);
ConnectivityManagerImpl(Upstream::ClusterManager& cluster_manager,
DnsCacheManagerSharedPtr dns_cache_manager)
: cluster_manager_(cluster_manager), dns_cache_manager_(dns_cache_manager) {}
// Extensions::Common::DynamicForwardProxy::DnsCache::UpdateCallbacks
void onDnsHostAddOrUpdate(
const std::string& /*host*/,
const Extensions::Common::DynamicForwardProxy::DnsHostInfoSharedPtr&) override {}
void onDnsHostRemove(const std::string& /*host*/) override {}
void onDnsResolutionComplete(const std::string& /*host*/,
const Extensions::Common::DynamicForwardProxy::DnsHostInfoSharedPtr&,
Network::DnsResolver::ResolutionStatus) override;
// ConnectivityManager
std::vector<InterfacePair> enumerateV4Interfaces() override;
std::vector<InterfacePair> enumerateV6Interfaces() override;
std::vector<InterfacePair> enumerateInterfaces(unsigned short family, unsigned int select_flags,
unsigned int reject_flags) override;
NetworkType getPreferredNetwork() override;
SocketMode getSocketMode() override;
envoy_netconf_t getConfigurationKey() override;
Envoy::Network::ProxySettingsConstSharedPtr getProxySettings() override;
void reportNetworkUsage(envoy_netconf_t configuration_key, bool network_fault) override;
void setProxySettings(ProxySettingsConstSharedPtr new_proxy_settings) override;
void setDrainPostDnsRefreshEnabled(bool enabled) override;
void setInterfaceBindingEnabled(bool enabled) override;
void refreshDns(envoy_netconf_t configuration_key, bool drain_connections) override;
void resetConnectivityState() override;
Socket::OptionsSharedPtr getUpstreamSocketOptions(NetworkType network,
SocketMode socket_mode) override;
envoy_netconf_t addUpstreamSocketOptions(Socket::OptionsSharedPtr options) override;
Extensions::Common::DynamicForwardProxy::DnsCacheSharedPtr dnsCache() override;
private:
struct NetworkState {
// The configuration key is passed through calls dispatched on the run loop to determine if
// they're still valid/relevant at time of execution.
envoy_netconf_t configuration_key_ ABSL_GUARDED_BY(mutex_);
NetworkType network_ ABSL_GUARDED_BY(mutex_);
uint8_t remaining_faults_ ABSL_GUARDED_BY(mutex_);
SocketMode socket_mode_ ABSL_GUARDED_BY(mutex_);
Thread::MutexBasicLockable mutex_;
};
Socket::OptionsSharedPtr getAlternateInterfaceSocketOptions(NetworkType network);
InterfacePair getActiveAlternateInterface(NetworkType network, unsigned short family);
bool enable_drain_post_dns_refresh_{false};
bool enable_interface_binding_{false};
absl::flat_hash_set<std::string> hosts_to_drain_;
Extensions::Common::DynamicForwardProxy::DnsCache::AddUpdateCallbacksHandlePtr
dns_callbacks_handle_{nullptr};
Upstream::ClusterManager& cluster_manager_;
DnsCacheManagerSharedPtr dns_cache_manager_;
ProxySettingsConstSharedPtr proxy_settings_;
static NetworkState network_state_;
};
using ConnectivityManagerSharedPtr = std::shared_ptr<ConnectivityManager>;
/**
* Provides access to the singleton ConnectivityManager.
*/
class ConnectivityManagerFactory {
public:
ConnectivityManagerFactory(Server::Configuration::GenericFactoryContext& context)
: context_(context) {}
/**
* @returns singleton ConnectivityManager instance.
*/
ConnectivityManagerSharedPtr get();
private:
Server::GenericFactoryContextImpl context_;
};
/**
* Provides nullable access to the singleton ConnectivityManager.
*/
class ConnectivityManagerHandle {
public:
ConnectivityManagerHandle(Singleton::Manager& singleton_manager)
: singleton_manager_(singleton_manager) {}
/**
* @returns singleton ConnectivityManager instance. Can be nullptr if it hasn't been created.
*/
ConnectivityManagerSharedPtr get();
private:
Singleton::Manager& singleton_manager_;
};
} // namespace Network
} // namespace Envoy
```
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package org.graalvm.visualvm.pluginimporter;
import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.jar.JarFile;
import java.util.jar.Manifest;
import java.util.logging.Level;
import java.util.logging.Logger;
import org.netbeans.api.autoupdate.UpdateUnitProvider;
import org.netbeans.api.autoupdate.UpdateUnitProvider.CATEGORY;
import org.netbeans.spi.autoupdate.UpdateItem;
import org.netbeans.spi.autoupdate.UpdateProvider;
import org.openide.util.NbBundle;
import org.openide.util.lookup.ServiceProvider;
import org.openide.xml.EntityCatalog;
import org.openide.xml.XMLUtil;
import org.w3c.dom.Document;
import org.w3c.dom.Element;
import org.w3c.dom.Node;
import org.w3c.dom.NodeList;
import org.xml.sax.InputSource;
import org.xml.sax.SAXException;
/**
*
* @author Jiri Rechtacek
*/
@ServiceProvider(service=UpdateProvider.class)
public class ClusterUpdateProvider implements UpdateProvider {
private static File cluster = null;
private static final Logger LOG = Logger.getLogger (ClusterUpdateProvider.class.getName ());
private static final String ELEMENT_MODULE = "module"; // NOI18N
public ClusterUpdateProvider () {}
public static void attachCluster (File newCluster) {
if (newCluster == null) {
throw new IllegalArgumentException ("Cluster cannot be null!"); // NOI18N
}
cluster = newCluster;
}
public String getName () {
return Installer.CODE_NAME;
}
public String getDisplayName () {
if (cluster == null) {
return NbBundle.getMessage(ClusterUpdateProvider.class, "ClusterUpdateProvider_DisplayName_disabled");
}
return NbBundle.getMessage (ClusterUpdateProvider.class, "ClusterUpdateProvider_DisplayName", cluster); // NOI18N
}
public String getDescription () {
return NbBundle.getMessage (ClusterUpdateProvider.class, "ClusterUpdateProvider_Description"); // NOI18N
}
public CATEGORY getCategory () {
return UpdateUnitProvider.CATEGORY.STANDARD;
}
public Map<String, UpdateItem> getUpdateItems () throws IOException {
Map<String, UpdateItem> res = new HashMap<> ();
for (File cf: readModules (cluster)) {
String cnb = (cf.getName ().substring (0, cf.getName ().length () - ".xml".length ())).replaceAll ("-", "."); // NOI18N
Map<String, String> attr = new HashMap<> (7);
readConfigFile (cf, attr);
String jarName = attr.get ("jar");
if(jarName == null) {
LOG.info ("Can`t get jar file name for " + cnb + ", skip checking.");
continue;
}
File jarFile = new File (cluster, jarName); // NOI18N
if (! jarFile.exists ()) {
LOG.info ("Jar file " + jarFile + " doesn't exists. Skip checking " + cnb);
continue;
}
File updateTrackingFile = new File(cluster, "update_tracking" + File.separator + cf.getName());
if (! updateTrackingFile.exists ()) {
LOG.info ("Update tracking file " + updateTrackingFile + " doesn't exists. Skip checking " + cnb);
continue;
}
Manifest mf = new JarFile (jarFile).getManifest ();
UpdateItem item = UpdateItem.createModule (
cnb,
attr.get ("specversion"), // NOI18N
null,
cluster.getName (), // XXX: to identify such items later
"0", // NOI18N
"",
"",
"",
mf,
Boolean.valueOf (attr.get ("eager")), // NOI18N
Boolean.valueOf (attr.get ("autoload")), // NOI18N
null,
null,
"",
res.put (cnb + '_' + attr.get ("specversion"), item); // NOI18N
}
return res;
}
public boolean refresh (boolean force) throws IOException {
return true;
}
private static Collection<File> readModules (File cluster) {
if (cluster == null || ! cluster.exists ()) {
return Collections.emptySet ();
}
Collection<File> res = new HashSet<> ();
File config = new File (new File (cluster, "config"), "Modules"); // NOI18N
if (config.listFiles () == null) {
return Collections.emptySet ();
}
for (File cf : config.listFiles ()) {
if(cf.getName ().endsWith(".xml_hidden")) {
//158204
continue;
}
if (cf.getName ().endsWith (".xml")) { // NOI18N
if(cf.length() > 0) {
res.add (cf);
} else {
LOG.log(Level.INFO, "Found zero-sized xml file in config/Modules, ignoring: " + cf);
}
} else {
LOG.log(Level.INFO, "Found non-xml file in config/Modules, ignoring: " + cf);
}
}
return res;
}
private static void readConfigFile (File cf, Map<String, String> attr) {
Document document = null;
InputStream is = null;
try {
is = new BufferedInputStream (new FileInputStream (cf));
InputSource xmlInputSource = new InputSource (is);
document = XMLUtil.parse (xmlInputSource, false, false, null, EntityCatalog.getDefault ());
} catch (SAXException saxe) {
LOG.log(Level.INFO, "Error while reading " + cf);
LOG.log(Level.INFO, saxe.getLocalizedMessage (), saxe);
return;
} catch (IOException ioe) {
LOG.log(Level.INFO, "Error while reading " + cf);
LOG.log(Level.WARNING, ioe.getLocalizedMessage (), ioe);
} finally {
if (is != null) {
try {
is.close ();
} catch (IOException e){
//ignore
}
}
}
assert document.getDocumentElement () != null : "File " + cf + " must contain document element.";
Element element = document.getDocumentElement ();
assert ELEMENT_MODULE.equals (element.getTagName ()) : "The root element is: " + ELEMENT_MODULE + " but was: " + element.getTagName ();
NodeList children = element.getChildNodes ();
for (int i = 0; i < children.getLength (); i++) {
Node n = children.item (i);
if (Node.ELEMENT_NODE != n.getNodeType()) {
continue;
}
Element e = (Element) n;
String name = e.getAttributes ().getNamedItem ("name").getNodeValue (); // NOI18N
String value = e.getChildNodes ().item (0).getNodeValue ();
attr.put (name, value);
}
}
}
```
|
```smalltalk
namespace CreateExportTaskExample
{
// snippet-start:[CloudWatchLogs.dotnetv3.CreateExportTaskExample]
using System;
using System.Threading.Tasks;
using Amazon.CloudWatchLogs;
using Amazon.CloudWatchLogs.Model;
/// <summary>
/// Shows how to create an Export Task to export the contents of the Amazon
/// CloudWatch Logs to the specified Amazon Simple Storage Service (Amazon S3)
/// bucket.
/// </summary>
public class CreateExportTask
{
public static async Task Main()
{
// This client object will be associated with the same AWS Region
// as the default user on this system. If you need to use a
// different AWS Region, pass it as a parameter to the client
// constructor.
var client = new AmazonCloudWatchLogsClient();
string taskName = "export-task-example";
string logGroupName = "cloudwatchlogs-example-loggroup";
string destination = "doc-example-bucket";
var fromTime = 1437584472382;
var toTime = 1437584472833;
var request = new CreateExportTaskRequest
{
From = fromTime,
To = toTime,
TaskName = taskName,
LogGroupName = logGroupName,
Destination = destination,
};
var response = await client.CreateExportTaskAsync(request);
if (response.HttpStatusCode == System.Net.HttpStatusCode.OK)
{
Console.WriteLine($"The task, {taskName} with ID: " +
$"{response.TaskId} has been created successfully.");
}
}
}
// snippet-end:[CloudWatchLogs.dotnetv3.CreateExportTaskExample]
}
```
|
```xml
<vector xmlns:android="path_to_url"
xmlns:tools="path_to_url"
android:width="640dp"
android:height="512dp"
android:viewportWidth="640.0"
android:viewportHeight="512.0"
tools:keep="@drawable/fa_vnv">
<path
android:fillColor="#FFFFFFFF"
android:pathData="M104.9,352c-34.1,0 -46.4,-30.4 -46.4,-30.4L2.6,210.1S-7.8,192 13,192h32.8c10.4,0 13.2,8.7 18.8,18.1l36.7,74.5s5.2,13.1 21.1,13.1 21.1,-13.1 21.1,-13.1l36.7,-74.5c5.6,-9.5 8.4,-18.1 18.8,-18.1h32.8c20.8,0 10.4,18.1 10.4,18.1l-55.8,111.5S174.2,352 140,352h-35.1zM499.9,352c-34.1,0 -46.4,-30.4 -46.4,-30.4l-55.9,-111.5S387.2,192 408,192h32.8c10.4,0 13.2,8.7 18.8,18.1l36.7,74.5s5.2,13.1 21.1,13.1 21.1,-13.1 21.1,-13.1l36.8,-74.5c5.6,-9.5 8.4,-18.1 18.8,-18.1L627,192c20.8,0 10.4,18.1 10.4,18.1l-55.9,111.5S569.3,352 535.1,352h-35.2zM337.6,192c34.1,0 46.4,30.4 46.4,30.4l55.9,111.5s10.4,18.1 -10.4,18.1h-32.8c-10.4,0 -13.2,-8.7 -18.8,-18.1l-36.7,-74.5s-5.2,-13.1 -21.1,-13.1c-15.9,0 -21.1,13.1 -21.1,13.1l-36.7,74.5c-5.6,9.4 -8.4,18.1 -18.8,18.1h-32.9c-20.8,0 -10.4,-18.1 -10.4,-18.1l55.9,-111.5s12.2,-30.4 46.4,-30.4h35.1z"/>
</vector>
```
|
```javascript
Handling modules
Defaults values apply only to `undefined` (and not to `null`)
Symbols in ES6
The `spread` operator
Tail call optimisation in ES6
```
|
Kulunda () is a rural locality (a selo) and the administrative center of Kulundinsky District of Altai Krai, Russia. Population: It is located on the Kazakhstan–Russia border.
Geography
The village is located in the area of the Kulunda Steppe, at the southern edge of the West Siberian Plain.
References
Notes
Sources
Rural localities in Kulundinsky District
Populated places established in 1917
Former urban-type settlements of Altai Krai
|
Pål Jacobsen (born 20 May 1956) is a Norwegian football coach and former player.
His debut for Ham-Kam came at an age of 16 years and 358 days, and he is among the youngest players ever in the Norwegian top division. In the 1981 season Jacobsen became top goalscorer in the Norwegian top division scoring 16 goals. At this date he was playing for Vålerenga. He scored 13 goals in 42 caps for the national team.
Haunted by a failed achilles tendon operation in 1985, he chose to finish his career in 1987. The injury led to amputation in 2001.
Jacobsen currently works as an assistant coach for Ham-Kam, and as a freelance sports journalist in the local newspaper Hamar Arbeiderblad.
References
1956 births
Living people
Footballers from Molde
Norwegian men's footballers
Norway men's international footballers
Hamarkameratene players
Vålerenga Fotball players
Eliteserien players
Hamarkameratene non-playing staff
Men's association football forwards
|
Two British Royal Navy warships have been called HMS Lance after the spear.
The first was a destroyer launched at Thornycroft in 1914, and fired the first British shot of World War I on 5 August 1914 when she intercepted the German minelayer Königin Luise.
The second was an launched in 1940 and sunk by aircraft at Malta on 9 April 1942. She was salvaged and towed to Chatham but found on arrival to be beyond repair.
References
Royal Navy ship names
|
Mario Valiante (31 August 1925 – 22 September 2018) was an Italian politician who was a Member of Parliament between 1958 and 1983.
References
1925 births
2018 deaths
Christian Democracy (Italy) members of the Chamber of Deputies (Italy)
Deputies of Legislature III of Italy
Deputies of Legislature IV of Italy
Deputies of Legislature V of Italy
Deputies of Legislature VI of Italy
Senators of Legislature VII of Italy
Senators of Legislature VIII of Italy
People from the Province of Salerno
|
```html
<html lang="en">
<head>
<title>i386-16bit - Using as</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="Using as">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="i386_002dDependent.html#i386_002dDependent" title="i386-Dependent">
<link rel="prev" href="i386_002dTBM.html#i386_002dTBM" title="i386-TBM">
<link rel="next" href="i386_002dArch.html#i386_002dArch" title="i386-Arch">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<!--
This file documents the GNU Assembler "as".
Permission is granted to copy, distribute and/or modify this document
or any later version published by the Free Software Foundation;
with no Invariant Sections, with no Front-Cover Texts, and with no
Back-Cover Texts. A copy of the license is included in the
-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="i386-16bit"></a>
<a name="i386_002d16bit"></a>
Next: <a rel="next" accesskey="n" href="i386_002dArch.html#i386_002dArch">i386-Arch</a>,
Previous: <a rel="previous" accesskey="p" href="i386_002dTBM.html#i386_002dTBM">i386-TBM</a>,
Up: <a rel="up" accesskey="u" href="i386_002dDependent.html#i386_002dDependent">i386-Dependent</a>
<hr>
</div>
<h4 class="subsection">9.15.14 Writing 16-bit Code</h4>
<p><a name="index-i386-16_002dbit-code-1149"></a><a name="index-g_t16_002dbit-code_002c-i386-1150"></a><a name="index-real_002dmode-code_002c-i386-1151"></a><a name="index-g_t_0040code_007bcode16gcc_007d-directive_002c-i386-1152"></a><a name="index-g_t_0040code_007bcode16_007d-directive_002c-i386-1153"></a><a name="index-g_t_0040code_007bcode32_007d-directive_002c-i386-1154"></a><a name="index-g_t_0040code_007bcode64_007d-directive_002c-i386-1155"></a><a name=your_sha256_hash6"></a>While <code>as</code> normally writes only “pure” 32-bit i386 code
or 64-bit x86-64 code depending on the default configuration,
it also supports writing code to run in real mode or in 16-bit protected
mode code segments. To do this, put a `<samp><span class="samp">.code16</span></samp>' or
`<samp><span class="samp">.code16gcc</span></samp>' directive before the assembly language instructions to
be run in 16-bit mode. You can switch <code>as</code> to writing
32-bit code with the `<samp><span class="samp">.code32</span></samp>' directive or 64-bit code with the
`<samp><span class="samp">.code64</span></samp>' directive.
<p>`<samp><span class="samp">.code16gcc</span></samp>' provides experimental support for generating 16-bit
code from gcc, and differs from `<samp><span class="samp">.code16</span></samp>' in that `<samp><span class="samp">call</span></samp>',
`<samp><span class="samp">ret</span></samp>', `<samp><span class="samp">enter</span></samp>', `<samp><span class="samp">leave</span></samp>', `<samp><span class="samp">push</span></samp>', `<samp><span class="samp">pop</span></samp>',
`<samp><span class="samp">pusha</span></samp>', `<samp><span class="samp">popa</span></samp>', `<samp><span class="samp">pushf</span></samp>', and `<samp><span class="samp">popf</span></samp>' instructions
default to 32-bit size. This is so that the stack pointer is
manipulated in the same way over function calls, allowing access to
function parameters at the same stack offsets as in 32-bit mode.
`<samp><span class="samp">.code16gcc</span></samp>' also automatically adds address size prefixes where
necessary to use the 32-bit addressing modes that gcc generates.
<p>The code which <code>as</code> generates in 16-bit mode will not
necessarily run on a 16-bit pre-80386 processor. To write code that
runs on such a processor, you must refrain from using <em>any</em> 32-bit
constructs which require <code>as</code> to output address or operand
size prefixes.
<p>Note that writing 16-bit code instructions by explicitly specifying a
prefix or an instruction mnemonic suffix within a 32-bit code section
generates different machine instructions than those generated for a
16-bit code segment. In a 32-bit code section, the following code
generates the machine opcode bytes `<samp><span class="samp">66 6a 04</span></samp>', which pushes the
value `<samp><span class="samp">4</span></samp>' onto the stack, decrementing `<samp><span class="samp">%esp</span></samp>' by 2.
<pre class="smallexample"> pushw $4
</pre>
<p>The same code in a 16-bit code section would generate the machine
opcode bytes `<samp><span class="samp">6a 04</span></samp>' (i.e., without the operand size prefix), which
is correct since the processor default operand size is assumed to be 16
bits in a 16-bit code section.
</body></html>
```
|
```python
""" Simple linear regression example in TensorFlow
This program tries to predict the number of thefts from
the number of fire in the city of Chicago
Author: Chip Huyen
Prepared for the class CS 20SI: "TensorFlow for Deep Learning Research"
cs20si.stanford.edu
"""
import os
os.environ['TF_CPP_MIN_LOG_LEVEL']='2'
import numpy as np
import matplotlib.pyplot as plt
import tensorflow as tf
import xlrd
import utils
DATA_FILE = 'data/fire_theft.xls'
# Step 1: read in data from the .xls file
book = xlrd.open_workbook(DATA_FILE, encoding_override="utf-8")
sheet = book.sheet_by_index(0)
data = np.asarray([sheet.row_values(i) for i in range(1, sheet.nrows)])
n_samples = sheet.nrows - 1
# Step 2: create placeholders for input X (number of fire) and label Y (number of theft)
X = tf.placeholder(tf.float32, name='X')
Y = tf.placeholder(tf.float32, name='Y')
# Step 3: create weight and bias, initialized to 0
w = tf.Variable(0.0, name='weights')
b = tf.Variable(0.0, name='bias')
# Step 4: build model to predict Y
Y_predicted = X * w + b
# Step 5: use the square error as the loss function
loss = tf.square(Y - Y_predicted, name='loss')
# loss = utils.huber_loss(Y, Y_predicted)
# Step 6: using gradient descent with learning rate of 0.01 to minimize loss
optimizer = tf.train.GradientDescentOptimizer(learning_rate=0.001).minimize(loss)
with tf.Session() as sess:
# Step 7: initialize the necessary variables, in this case, w and b
sess.run(tf.global_variables_initializer())
writer = tf.summary.FileWriter('./graphs/linear_reg', sess.graph)
# Step 8: train the model
for i in range(50): # train the model 100 epochs
total_loss = 0
for x, y in data:
# Session runs train_op and fetch values of loss
_, l = sess.run([optimizer, loss], feed_dict={X: x, Y:y})
total_loss += l
print('Epoch {0}: {1}'.format(i, total_loss/n_samples))
# close the writer when you're done using it
writer.close()
# Step 9: output the values of w and b
w, b = sess.run([w, b])
# plot the results
X, Y = data.T[0], data.T[1]
plt.plot(X, Y, 'bo', label='Real data')
plt.plot(X, X * w + b, 'r', label='Predicted data')
plt.legend()
plt.show()
```
|
Baron Gaetano Ventimiglia (1888-1973) was an Italian cinematographer who worked in the Italian and British film industries during the silent era. di Ventimiglia collaborated three times with Alfred Hitchcock. He was a descendant of the House of Ventimiglia.
Selected filmography
Theodora, the Slave Princess (1921)
The Pleasure Garden (1925)
Venetian Lovers (1925)
The City of Temptation (1925)
The Mountain Eagle (1926)
The Lodger (1927)
A Woman in Pawn (1927)
The Physician (1928)
Sailors Don't Care (1928)
Smashing Through (1929)
Bibliography
Mcgilligan, Patrick. Alfred Hitchcock: A Life in Darkness and Light. HarperCollins, 2004.
Gottlieb, Sidney & Brookhouse, Christopher. Framing Hitchcock: Selected Essays from the Hitchock Annual. Wayne State University Press, 2002.
External links
1888 births
1973 deaths
Italian cinematographers
Film people from Catania
House of Ventimiglia
|
The Beelzebub anime and manga series feature an extensive cast of fictional characters created by Ryūhei Tamura.
Main characters
Oga is first introduced as a strong fighter, beating up some classmates and then making them bow down to him because they had attacked him in his sleep, he is the main protagonist of the anime and manga Beelzebub, but occasionally he can be represented as an anti-hero by his violent nature around Ishiyama and even his friends. It is revealed that he is relaying the story of a series of strange events which leads to his becoming the Earthly father of the son of the devil, Beelzebub IV. He was picked to become Beelzebub's father because, in the eyes of Alaindelon (see below), who was carrying the baby, he appeared to possess the qualities of the ideal parent for the future Devil King: strong, arrogant, and thinking nothing of his fellow man.
Oga and Beelzebub (nicknamed baby Beel) cannot be separated by more than 15 meters or else it may result in instant death for Oga, according to Hilda (as of chapter 38, the distance has increased by 8 centimetres). A tattoo-like seal on Oga's right hand, which grows larger the more he fights, signifies the contract between Beelzebub and him, whereby Oga can access large amounts of demonic power. He tries to stop fighting to limit the powers which will ultimately be used to end the human race. However, he is unsuccessful, as his fame of invincibility keeps attracting the attention of other delinquents who seek to conquer him and gain the fame that would come from defeating him.
As the story progresses, the reader learns that Oga is not exactly like the other delinquents in Ishiyama High School. He is certainly a hoodlum, as he relishes the opportunity to fight and seems to take some pride of his reputation of being almost impossible to beat. However, he is not a bully, and does not use his strength to intimidate other people. Also, at first he does not seek fights actively, is not interested in the power struggle that pits Ishiyama's gangs against each other, and does not want to belong to a gang or find underlings of his own. He minds his own business unless provoked, which to his dismay happens all the time.
However, when he learns that the baby will become attached to someone that is both stronger and possessing of the attributes that make the ideal parent, he decides to actively seek confrontation with delinquents who show promise in this regard. This first pits him against the Touhoushinki (see below), but he is disappointed that none of them is able to defeat him. In the process, baby Beel becomes progressively more attached to him and Oga's access to demonic power becomes easier. On defeating Himekawa (see below), he uses for the first time what later becomes his signature attack, the Zebub Blast: a powerful outburst that is strong enough to destroy a building. Later, he becomes able to draw demonic power even without physical contact with baby Beel, and by chapter 84, he uses it consciously for the first time.
Oga's skill is revealed, in the course of the story, to be the consequence of a strong fighting instinct honed by numerous confrontations with other delinquents from an early age. His fame begins at Kata Middle School, when it is told that the mean look in his eyes invited attacks from older students, from which he always came out on top, earning him his first nickname, Mad Dog Oga (by Furuichi). At the end of his 7th grade, he fought alone, and presumably won, against about fifty thugs who had the school under siege.
His exploits at Kata cemented his reputation and at the time of his arrival at Ishiyama as a first-year student, Oga is already known by aliases such as Demon and Raging Ogre, seems to have a lot of enemies from the outset, and makes even more as the series progresses (despite trying not to fight). He also seems to have no friends except for his classmate, Furuichi. He lives with his parents and elder sister (who is an ex-delinquent; it is revealed that she was the first head of the Red Tail gang), though Hilda and Beelzebub have recently moved into his house.
Surprisingly, and often with comical effect, Oga is a decent father figure to Beelzebub. He appears to have his own skewed idea of what a 'man' should be like, and attempts to pass on these ideals to Beel. Despite being called evil by almost every character in the series, he has shown to have a calmer and - if only slightly - warmer side to him, such as when he speaks with Hilda about his position as Beel's parent and assuring Lamia that if Beel ever got ill again he would call her immediately. Despite spending much of the first arc trying to pass Beel on to someone stronger and more evil than him, after all the time they spent together they've formed a close bond, and Oga seems to act more friendly towards Beel.
His long fighting record has made him a formidable enemy: although he has no formal training in martial arts, he is quick enough to dodge attacks from skilled fighters like Kunieda or Shinjou Alex; his agility counterbalances Tojo's heavier build and allows Oga to defeat him; and his resilience enables him to resist most direct hits from Miki and largely evade Kunieda's attacks while only sustaining minimal injuries. Oga is possessing of incredible, near superhuman, strength, even if not heavily built: he is able to send people flying in the air with an effortless punch; most of his opponents are knocked out cold with one hit, often being planted headfirst into the ground, ceiling or walls for comic effect; and in chapter 91 he lifted an enormous boulder off the ground. He comes out of most fights unscathed; and the number of opponents, or how they are equipped, seems to be of little concern to him. Due to him defeating the Touhoushinki and his virtual invincibility, he is considered to be "The King Of Ishiyama", the title given to the school's strongest fighter (Tojo was the "King" until Oga defeated him).
He is able to hold his own against a demon for some time without resort to demon power (although he did use the Zebub blast against this enemy, it had no effect). He can feel Saotome (see below) using his demon power, which shows he has notable strength for a human. In chapter 75, the Zebub spell temporarily extends up his arm, over his trunk and across his face, giving him a demonic appearance in the eyes of Kiriya. Later, though, upon having to be rescued from a confrontation with a demon by Saotome, he becomes irritated by the fact he is unable to protect anyone and decides to take formal training from Kunieda's grandfather. After teaching Oga the basics, he engages Saotome to instruct the young man on how to tap Beel's demonic powers to their full extent. In chapter 106, he shows his acquired skills for the first time by defeating a demon with a new movement, the Zebub Emblem: after placing a projection of the Fly King Seal onto the intended target, Oga can launch a barrage of punches that cause an enormous amount of energy to accumulate on the victim, later released as a massive explosion. Oga also becomes capable of dissipating the dark aura of energy that demons release when they prepare an attack.
Also as a consequence of his training, Oga develops an extreme attack, comically dubbed Super Milk Time, whereby he drinks Baby Beel's milk as a way of increasing their synchronisation ratio, thus enabling Oga to use Beel's power without limit. As a result, he can unleash a frantic, wild attack that can overwhelm even Saotome. As a trade-off, Oga and Beel's mentalities and bodies coalesce and Saotome has warned Oga that allowing himself to run on this state for longer than five minutes may overtax him physical and mentally to the point that he will lose his humanity. He goes on to train under Ikaruga Suiten (see below) in order to keep this process under control.
As with most thugs in the series, he lacks any particular technique in fighting, mostly relying on his natural prowess to diminish the advantage of trained martial artists like Kunieda and Miki. However, he has figured out some classical techniques from wrestling: he defeats Tojo with a suplex and leads baby Beel in a Clothesline, an Elbow drop and a Boston crab. Later, not wanting to be looked down on by Miki (see below), he starts to invent nonsensical names for his punches and kicks, so that they will sound more respectable like the elaborate movements of trained fighters. However, his immense strength and agility mean that even basic techniques may become quite destructive in his hands. So far, he has learned one specialized movement, Nadeshiko, from Grandpa Kunieda, and in only one day's training became capable of using it to split massive rocks with ease. On his return from training with Suiten, he begins to show superhuman agility and strength similar to Saotome's, and a fine control of Beel's power that allows him to face demons as easily as delinquents.
Oga is also pretty honourable by delinquents' standards. Although he has no qualms about humiliating petty thugs who pick fights with him, e.g. by making them bow down to him, he respects his opponents of more consequence. In the case of Tojo, for example, after having won the fight against him, Oga is willing to have everyone leave the scene quickly to let Tojo brood over his defeat in peace. He is also quick to acknowledge other people's strength or courage.
Oga's fighting record is not only of clear-cut victories. When caught by surprise or lacking motivation, or unwilling to fight, Oga can be pushed back if the enemy is strong or agile enough, as in his first confrontation with Tojo (who managed to land a punch on him when Oga got distracted by his tattoo) and Aizawa (who attacked from behind). Skilled martial artists like Miki and Kunieda may lack the strength to knock him out, but can come out of a fight against Oga largely unharmed by repeatedly evading or pushing him back. The only humans who have been able thoroughly to defeat Oga are Grandpa Kunieda and Saotome Zenjuurou.
Oga is easily agitated and does not avoid fighting. However, he also seems to care, at least to some degree, about his classmates, as he quickly stopped Nene when she was about to fight Miki, telling her she would lose if she did. Oga, along with Furuichi, is an avid fan of the video game series Dragon Quest, and regularly makes references to the series in the manga.
In a twisted manner, Oga is able to show some affection for his friends. For example, he misses Furuichi during holidays and uses Alaindelon to kidnap him from a five-star resort, if only to annoy him. He also resorts to the extreme measure of badly beating Miki up in order to prevent him from taking part in a fight against Kiriya and his gang (see below). At the end of the manga he is trusted to care for Beel's little sister Nico.
Known as Beelzebub or . He is the youngest son of the Devil King. He is very attached to Oga, always clinging onto Oga's back or sitting on Oga's head. When he becomes agitated (and initially when he saw blood), he'll often throw a tantrum that will spontaneously electrocute anyone within his vicinity. Without Oga, he is physically weaker than even the average human child, but contact with Oga allows him to unleash his demonic powers. After fearing for Oga's safety when he contracted a fever (as his power would end up killing Oga), he severed the contract and ran away. He then became somewhat attached to Tojo, who resembles Oga (at least in his own mind). Later, when Oga and Tojo start to fight, Beel snaps out of his fever and goes back to Oga. At that point, their mutual trust becomes so great that Beel even erases the Zebub spell to allow Oga to fight Tojo without using demonic powers.
Beelzebub's characteristic cry is "Daabū!" and he is always naked with a pacifier in his mouth (in the Animax Asia airing of the anime, he wears a diaper). He, like Oga, is shown to anger easily, yet his outbursts are portrayed in a more comical fashion. He, like other demons, is able to sense when a human is particularly strong, and this first leads him to take a liking to Kunieda. Later, when she learns how to use demonic powers, Beel becomes even more attached to her. He has also shown to have some liking to Tojo, who appears to remind him of Oga. When Oga reunites with Miki, Beel showed immediate disgust and possible fear toward the Saint Ishiyama Student. The reason for this has not been stated.
In the demon world, the extent of Beel's true power is finally known when he strikes down a gigantic monster bird in one hit and later defeats a monster larger than a mountain under Oga's direction.
Through the series (so far covering a period of about six months), he shows some development, as expected from an infant, and his ability to interact with other people increases. He and Kunieda's little brother Kouta (see below) develop a rivalry, with comic effect. Beel's power increases as he ages and so does Oga's, but the process is accelerated when both undergo training to allow Oga to control his possession by Beel.
His name is borrowed from a semitic deity that was incorporated as a demon by Abrahamic religions.
Preferring to be called by a shorter name, Hilda is a demon maid who helps Oga take care of Beelzebub IV. She reveres the Devil, or Demon Lord, and feels that it is a great honour to be chosen as the child's "Mother", or caretaker, by the Demon Lord. Her most characteristic features include her Gothic Lolita appearance and (as pointed out by Oga's mother) "great big knockers." Hilda is also described as a bombshell, and her right eye is green. The left eye was only revealed in chapter 186, and is normally hidden behind a fringe of hair. That is because it shows moving things at one tenth of their normal speed and captures even minute objects; thus, if both eyes are working together for a long time, Hilda becomes nauseated by the discrepancy between them.
Hilda rides a flying, leathery creature known as an AK-Baba as transportation and owns an umbrella which conceals a sword in the handle. Oga's family is under the impression that Oga and Hilda had sex and that Beelzebub was the result. After the fight with Tojo, she seems to accept Oga raising Baby Beel and becomes warmer towards him.
Despite being blunt and cold most of the time, she has been shown to have a kinder side that comes out from time to time, often at the surprise and/or disbelief of the other characters. Being a demon herself, she is quite knowledgeable about the demon world, being able to successfully navigate Oga and company through Vlad's Haunt. She takes being Beel's mother quite seriously and even goes as far as to state that it was the only reason for her existence. As a fighter she is quite skilled. Her skills gained her the nickname "Oga Bride" at Ishiyama, as she dispatches her enemies in a similar manner to Oga (e.g., shoving her opponents' heads into walls). In the anime, she has developed an interest in watching soap opera, much to Oga's disbelief. Her name comes from the Old High German name "Hildegard" meaning Hild (=war or battle) and Gard (=protection) and means "protecting battle-maid".
Hilda and Oga's rapport is pragmatic for the most part. Hilda often looks down on him and never hesitates to mock him, but at the same time acknowledges his strength and allies with him in Beel's interest. In turn, he finds her cold and manipulative personality annoying, but does follow her advice. However, it is shown on rare occasions that they do care about each other and work extremely well together in a fight.
Initially in the manga, Hilda was probably the most powerful of the series' protagonists, as she was able to, for a short time, fight with Saotome while Oga, Tojou, and Izuma were taken out instantly by the teacher. When she becomes serious in a fight, she becomes surrounded by a pure black aura, which she then channels into her sword for a powerful attack. It is implied that, as with Beel, her full-fledged powers are much greater than what she is able to show in the human world, but she would need a human contractor to access them. She is considered to be the very elite among demon wet nurses, and is able to defeat Lord En's three maids single-handedly (see below). More recently, though, Oga may have surpassed her by learning to use Beel's powers. Kunieda (see below) may also have become a match for Hilda after seemingly having trained to improve her sword skill and procuring help from Koma and Ikaruga Nazuna (see below). Just recently her age was revealed to be 16.
Another first year at Ishiyama, Furuichi seems to be the only non-delinquent student there and has little, if any, fighting ability. He often points out the absurdities in Oga's situation, acting as the rational and most passive member of the group. Furuichi often complains about Oga, stating that just because he hangs around with him, people take him for a delinquent as well. He is the eldest child of his family, which seems to be wealthier than Oga's, since they are able to spend summer holidays in a five-star resort. He is also implied to be quite a good student, and Miki says that his grades would have easily earned him a place in Saint Ishiyama School. He is a prototypical lovelorn teenager and is always scheming to ingratiate himself with the fair sex, to little avail: most women - human and demon alike - around are stronger than he, and many moments of comic relief in the series arise when Furuichi has his advances on girls frustrated. He envies Oga for being the object of Kunieda's love and for having Hilda under the same roof (see below).
He is very conscious of his own weakness and will not stand up to thugs, although he is quick to do an about-face when a pretty girl is involved. At these junctures, he shows considerable strategy and is even ruthless, for example using baby Beel to electrocute several enemies in a pool, suggesting a different but no less evil commonality with Oga.
Furuichi and Oga seem to be reciprocal only friends, and the former is often the one that Oga goes to for conversation. He is comically referred to as "idiot Furuichi" by Oga, and is often the victim of many jokes in the story, although he is shown to have a darker side to him as well: Furuichi is not above returning to Oga some of the distress he is involved in because of him, and does not mind having Oga electrocuted as collateral damage in the episode described above. Their mutual loyalty is very fierce: Oga becomes riled up when Himekawa kidnaps and manhandles his friend, and Furuichi does not refrain from standing on Oga's side in tight spots, and even to put himself in danger to help him. Furuichi quickly (if reluctantly) forgives him for kidnapping him from his holiday resort. Like Oga, he is a fan of Dragon Quest. He has a younger sister, Honoka.
The story of how such disparate characters got along is eventually told. It turns out that Oga sees Furuichi as being very strong, but in a different way: in order to earn Oga's trust when they were ten years old, Furuichi resisted Oga's strikes multiple times, always getting back on his feet, something that had never happened before. This and Furuichi disregard for the danger around Oga's fights have cemented their friendship, and Oga holds Furuichi's judgement in high regard.
In chapter 174, Behemoth (see below) wonders about Furuichi's ability to channel demonic power, despite the fact that Furuichi seems to be only a normal human.
A dimensional transfer demon working under Hildegarde, he is first seen floating down the river with an arrow on his chest. He sees Oga forcing other delinquents to kneel before him and decides to deliver baby Beel to him as a potential parent. He is heavily built and is most often seen wearing a tank-top and boxer-shorts. After Oga becomes Beel's parent he moves in with Furuichi, against the boy's wishes. It is revealed in Chapter 42 that he has a daughter, but in the course of the story he also displays homosexual affection for Furuichi, much to the latter's chagrin. These tendencies are exaggerated in the anime.
He is supposed to be a satirical representation of the singer Freddie Mercury and is named after French actor Alain Delon; his appearances are often used for comic effect. Despite that, he is considered highly competent by Hilda, both as an assistant and a transdimensional demon: he is one of few who are capable of transporting two people at once and is able to recover from injuries in little time; his power is such that he can use a communicator as a homing device and send a person to the corresponding location. Alaindelon often advises Hilda about Oga and Beel. Both demons later join St. Ishiyama disguised as students in order to try to identify demons hiding in the school (see below).
Ishiyama High
Ishiyama is described as "the hoodlum school": with the exception of Furuichi, all students are delinquents who spend most of the time fighting. It is accidentally destroyed by Oga on chapter 37.
Tōhōshinki
The four leaders of the delinquent forces in Ishiyama High. Tōhōshinki is an acronym of their respective last names, , , , and . In the English subtitled version of the anime by Crunchyroll, the abbreviation TKKH (using the first letters of their surnames) is used. While initially introduced as antagonists early in the series, the four later become Oga's most loyal followers, each gaining the King's Emblem (located on different parts of their body) that allows them to tap into Beelzebub's demon powers during fights to a level that allows them to go toe-to-toe with other demon contract holders.
The first of the four to be introduced, he was the closest to dominating the school at the time. A sadistic and malignant third year, he was sought out by Oga to be a replacement father for Beel, Oga hoping Kanzaki's purportedly sinister and malicious character would be more appealing to the demon baby than his own. However, after Kanzaki viciously humiliates Shiroyama, his most loyal underling and until then his right-hand man, Oga becomes enraged and punches Kanzaki through a top-story window, sending him to the hospital and further solidifying Beel's attachment to him. After that, Kanzaki loses his retinue, save for Shiroyama and Natsume (see below). He later consorted with Himekawa and Oga in order to pull down the powerful Tojo, but gets caught up with Himekawa in a fight against Tojo's underlings and is sent to the hospital again due to injuries contracted in the explosion that destroyed the school.
Later he begins to reciprocate the loyalty of his remaining subordinates - now better described as friends -, such as when he goes to get revenge for Shiroyama after he is beaten up by St. Ishiyama High students, and his character evolves in a more likable fashion. At St. Ishiyama, he seeks to preserve the reputation of the Ishiyama students against the advances of the six Horsemen (see below), and starts to show some loyalty to Oga and the others. His considerable and unwarranted pride is often depicted in comical fashion, such as when he intervenes to relieve Tojo, who is much stronger than he is, in a fight against a demon.
His fighting style is raw and brutal, and does not appear to have any technique, but is effective against the average thug. Even after being defeated by Oga, his reputation as a Tōhōshinki persists and he is greatly feared by lesser delinquents. It is implied that his family is wealthy and/or influential, and that he pushed that influence to achieve his status as a gang leader. On chapter 143, the reader learns that Kanzaki is indeed the second son of a yakuza family and has a little niece from his brother.
He wears a small chain hanging from his left ear and from a piercing below his mouth. It is revealed that Kanzaki becomes enraged if someone pulls the chain and in these occasions he becomes three times stronger than normal. Nevertheless, after being defeated by Oga, he was gradually displaced in the scale of strength, to the point of being harshly beaten by the Poltergeists in chapter 193 (see below). However, he was then branded with a secondary Zebub Spell, effectively becoming Beel's first human knight, and proceeded to defeat all of his opponents single-handedly.
Kanzaki's most devoted underling. A strong, tall third-year, he is nevertheless easily defeated by Oga with a single shot to the chin. Even after his humiliation by Kanzaki and the dissolution of the latter's gang, he remains attached to Kanzaki. Later, when he is sent to the hospital by St. Ishiyama students, Kanzaki visits upon him. He escapes the hospital to support Ishiyama against the Horsemen in the volleyball match, but is taken back by the staff. He is often seen acting as Kanzaki's voice of reason.
A soft-spoken, third-year student and an underling of Kanzaki, he shows exceptional interest in Oga and his exploits. Handsome and long-haired, he prefers to make lighthearted quips during frays to engaging in them personally. Though he rarely participates in fights himself, he is incredibly strong, taking out the MK5 by himself and even downing one of Tojo's underlings within seconds. From this it is implied that Natsume is significantly stronger than previously credited, as not even Kanzaki or Himekawa were capable of such a feat. He shows these fighting skills again when he blocks Gou Hiromichi from attacking Oga head on, later stating during their fight, "it's not really my style to go all out in a fight."
He is the son of the "Himekawa Group", a financial zaibatsu, a third-year student and the second member of the Tohoshinki. Using money to solve his problems, he bribes friends and enemies into his employment, often turning the tables on dissident challengers by co-opting their own friends against them. This tactic proved completely useless on Oga, and Himekawa was the first victim of the Zebub Blast. Following his recovery, he groups himself together with Oga and Kanzaki in order to remove Tojo from power, but is caught up in the explosion with Kanzaki and most of the student body. He has a slightly outlandish appearance, including his hair in Pompadour hairstyle and his constant use of sunglasses, most often complete with a Hawaii shirt. For comedic effect, he is shown to be quite handsome without his glasses and with his hair brushed down, which makes him look like a completely different person.
Although a capable fighter, Himekawa uses underhanded tactics to prevail, such as having his opponents break their fists by punching a ceramic tile shield hidden under his shirt, or electrocuting them with a shock-baton (both are shown to be useless against Oga). In his first appearance, he resorted to outright criminal acts to lure Oga, such as kidnapping Furuichi and threatening to kill him and Hilda. He behaved quite viciously towards her, shooting her garments multiple times with a water gun filled with acid in search of a mobile phone.
After losing his gang and later at St. Ishiyama, his character also evolves in a more positive fashion. Like Kanzaki, he starts to show some loyalty to his colleagues, especially to Oga, even stopping an attack by Sakaki Mitsuteru against an unarmed Kunieda. His strategic skills prove useful when he clinches a deal with St. Ishiyama's teachers to prevent his and his colleagues' expulsion. He is also the source of outside information regarding other gangs and always seems to be in the knowing of what is going on outside the classroom. It is revealed in chapter 135 that he has abnormal puzzle-solving skills.
Even for the standards of upper class families, Himekawa is granted extravagant means by his family: his pocket money, for example is enough to acquire the proprietor rights over an Internet game. He used to live in a multiple-story elite condominium penthouse he purchased with his and his friend Kugayama's (see below) winnings in Internet wager games, but it got destroyed by Oga.
In contrast to the other Touhoushinki, none of his underlings can be called his friend, and he was left completely alone after his defeat at Oga's hands. However, he garnered some respect from the others after helping out in the search for Lord En (see below). Aside from that, he is sometimes seen with a young butler called Hasui, who is the only person who calls him by his given name. He is revealed to be the fourth person with a Zebub Symbol, only he is actually the 3rd Knight.
Aoi is 17 years old, a second-year student and the third leader of the "strongest ladies of Kantou", the Red Tails. She is first introduced in disguise at the park taking care of her baby brother, Kouta, who is constantly mistaken as being Aoi's own child by the mothers at the park. She is the daughter of a local shrine keeper. Her nickname is Queen because she is the protector of all the girls at Ishiyama High from the men's "grubby hands". Because of Oga's dense personality, he has yet to realize that the girl he befriended at the park that Oga knows as "Aoi Kunie" and Kunieda are one and the same. Despite her tough personality, she has a rather girlish crush on Oga but refuses to admit this fact to others. She can feel Saotome using his demon power, which shows she has notable strength for a human.
Aoi differs from the other thugs at Ishiyama in that she has formal martial arts training from her grandfather, the master of the shingetsu style. She is also not a bully, and steers the leadership of the Red Tails towards preventing unnecessary fights in the school. This is what puts her first in collision course with Oga, as the latter is deemed by her to be responsible for most of recent violent events in the school. They have two exchanges: in neither does Oga return her attacks, limiting himself to evade them, first to let baby Beel assess her strength and thus find out whether she is a potential replacement for him; later, because a failure in communication leads Oga to believe that Aoi's condition to take Beel is that he should resist her charges. She is greatly impressed by Oga's speed and power, and misunderstands his advances on her (to get rid of Beel) as romantic interest. After he saves her from a plot by the MK5, she decides to leave the Red Tails and become a more disciplined person, and at the same time her crush on Oga increases. Later, she and the Red Tails intervene to stop the whole male student body of Ishiyama from attacking Oga, allowing him to proceed to a confrontation with Tojo unhindered.
She at first harboured some jealousy against Hilda, seeing her as a potential rival for Oga, but on discovering the truth about her and Baby Beel's true nature, their animosity becomes less pronounced. Later, it is Hilda who becomes jealous of Beel's attachment to Aoi.
She is a skilled swordswoman and martial artist, and possesses an immense amount of vitality and stamina, as well as impressive speed that is above Sakaki Mitsuteru's, who is known to be able to wield his sword at 250 km/h (however, she is not fast enough to hit Oga, who manages to evade even her best attacks with minor injuries). She can use any weapon she chooses in battle, and has even been shown to fight with nothing more than a ruler. She has shown the ability to assess opponents' strengths and weaknesses very quickly. Despite all this however, Hilda has noted that Aoi is still below Oga's level in terms of battle capabilities.
After being targeted by demons, she and Oga went on a training trip with her grandfather to improve their fighting skills. She then requested for advice on how to exorcise demons from her friend Isafuyu (see below). After training, she and Hilda fight again, and this time Kunieda proves to be a match for the demon maid. Hilda then notices that Kunieda has somehow learned to use demonic powers herself. It is later explained that Kunieda forged an alliance with a minor deity, Koma (see below), and becomes able to release demonic power, as sensed by Beel and Hilda. She become's the second of Beel's Knights, gaining her Zebub Symbol on her chest during her fight with Ringo.
A first-year and leading member of the Red Tails. Chiaki rarely speaks and dispatches her enemies swiftly with a pair of modified air-guns hidden under her skirt (actually, she can use up to four guns at the same time). She is very loyal to Kunieda even after she leaves the gang, and is ready to shoot anyone other than Oga who makes advances on her. She is the first to recognise that Kunieda is in love with Oga and thinks it very cute, as opposed to Nene (see next). She is an expert video game player, often playing with her little brother, and Kanzaki gives her the nickname "Akichi" (an inversion of the syllables of her name) to signify her gaming persona.
Originally Kunieda Aoi's second-in-command, Nene is far more aggressive than her permissive leader. Though she often openly disagrees with and occasionally disobeys Kunieda, she is still her faithful wingman, balking vociferously when Kunieda opts to leave the Red Tails and relinquish the mantle of leadership to her. She takes it nevertheless and soon proves to be worthy of it, gaining the confidence and trust of the Red Tails as their fourth leader. Her weapon of preference are chains, which she uses proficiently to gain an advantage against stronger men. As Kunieda, she is a second-year student.
A first-year student and a talkative member of the Red Tails who often makes embarrassing statements. She has long hair that is always adorned with a flower-shaped hairpin that can be used as a dagger. As a member of the Red Tails, she is a very good fighter and is not afraid of facing men. Lately, she and Kanzaki have been getting along, beginning when both witnessed Tojo's fight with a demon. In some recent chapters, it is lightly implied that she might have feelings for Kanzaki.
The fourth, and by far the strongest, Tōhōshinki (his strength in comparison to Kunieda is not confirmed, though it can be implied that he is stronger than she indirectly thought from their other fights). He is introduced how a main antagonist in the anime and a third-year student, Tojo has an unexpected soft side towards smaller creatures and babies, though said creatures do not feel similarly towards him. He is mostly bored with weaklings and is always looking for a good fight, which subsequently leads to his interest towards Oga. He works multiple jobs and sometimes has to miss school because of them. He can feel Saotome using his demon power, which shows he has notable strength for a human. His fighting style is a rigid brutal force. He appears to possess an incredible amount of stamina, as he was able to take a full blow from Miki without so much as flinching. Tojo presents an immediate threat to anyone he faces and has shown a strong willingness to fight, even at the expense of his own body. He is also called by the nickname Tora by his friends.
His main adversary thus far has been Oga, and although he does show a certain amount of respect for him, it is clear that the battles they share are the only things that matter to him. Tojo is stronger and more resilient, but Oga is more agile and has a superior technique. They have had three skirmishes so far: in the first one, Oga was gaining the upper hand but got distracted by Tojo's tattoo and was sent flying (although the punch failed to knock him out - the first time someone resisted a punch by Tojo). In the second, Oga defeated him fair and square, if narrowly, after a protracted fight. Contrarily to Himekawa and Kanzaki, Tojo is very honourable and promptly acknowledges his defeat. Later his fighting skill increased and when they have a third, amicable fight, it ended in a draw.
He appears to know Nanami Shizuka, the female member of the Horsemen, quite well. She referred to him as Tora when they met after the volleyball match, and both went searching for Saotome afterwards.
He looks up to Saotome Zenjuurou (see below), and has copied the latter's royal seal in the form of a tattoo in order to resemble him. Contrarily to Oga, he actively seeks to fight against progressively stronger opponents, and has his eyes currently on Izuma (see below) and demons. However, he is not a bully and shows no real interest in attracting followers as Himekawa and Kanzaki. He tends to be more aloof in class, although he does show loyalty towards his colleagues. He and Oga are the only humans so far to have been able temporarily to hold their ground against demons without resort to demonic powers of their own.
After being nearly killed by a demon, Tojo receives basic instructions from Saotome on how to tackle this kind of adversary, and the teacher states that he is safe to improve his skill if left to his own devices, as Tojo's fighting is mostly driven by instinct. When he appears again, he begins to show superhuman strength and speed on par with Oga's, but the origin of those hasn't been explained. He is the third person revealed to be one of Beel's Knights, with his symbol appearing on his upper arm. His number, however, is 4.
Kaoru Jinno
A long-haired, third-year underling of Tojo's. He has a calm attitude and is shown to be bookish, but is nevertheless a strong fighter, being able to defeat Himekawa and Kanzaki on his own easily.
Shoji Aizawa
Tojo's right-hand man and a third-year student. He wears sunglasses and has a cool attitude, and is a strong fighter. He has been able to evade one of Oga's attacks and even fight him briefly, although Oga had been taken by surprise. He and Kaoru are caught in the destruction of Ishiyama High and later share a hospital room with Kanzaki, Shiroyama and Himekawa.
Six Killer Elements
Also known as "Ishiyama's Six Upstarts", they are six first-years who make their appearance at Ishiyama when it is finally rebuilt. Each one leads their own gang. During the period when the students were scattered among different schools, they seem to have grown strong and confident enough to challenge Oga and the Tōhōshinki for the leadership of the school. They are divided in two tiers: the Three Kings and, above them, the Three Beasts.
The Three Kings
Kankurō Akahoshi
The former leader of Hiaburi High School, his battle name is "Fan that dyes everything blood red", and his coat has the picture of a fan on its backside. Other than the hairstyle, he resembles Oga quite closely in physical appearance. Despite being the lowest-ranked of the Elements, he is quite proud and confident, and has declared that he will beat Oga fair and square to take his place as king of the school. His number two is Ryou Haizawa, a third year; and his number three is Shigeru Shigemori, a second-year. He is the contractor of one of the Seven Sins, Mammon
Houjou Ringo
The only woman in the group. She was a former Red Tail under Aoi's leadership, but now has formed her own group at Majougari Academy, calling themselves the New World Red Tails. Her class and year are still unclear: she is described as a first year, but also as the second leader of the Red Tails before Kunieda. In their first clash with Aoi, the latter refused to fight back against former comrades and suffered minor injuries. Houjou is nicknamed "Tabako", since she is often smoking. Her numbers two and three are third-years Maaya Ajari and Yukino Kagemiya, respectively.
Ebian Ichikawa
Formerly the head of Sabatou High, and known as "Blind Swordsman" due to a scar that keeps his left eye permanently shut, he is a bulky, bald man who is constantly scowling and who sports a moustache. He wears a dark suit with a scarf and carries a flower on his mouth, resulting in a slightly outlandish appearance. He is described as temperamental and describes Beel as "cute" on first seeing him. His weapon of choice is a sword and, like Aoi, he can cut through concrete with it. His numbers two and three are third-years Souken Chabou and Tetsuhito Kajiura, respectively.
Three Beasts
Yōhei Nasu
The former head of Sourei High and nicknamed as "Aubergine" (the meaning of the kanji that form his name), "Nasubi" is a tall, blond man of dishevelled appearance and who behaves condescendingly against opponents, even calling Oga "Lil' Oga". He is strong enough not only to take Oga's wall-burying punch but to easily detach himself from the wall, breaking it in the process. He and his gang members formed a musical group called The Poltergeists: Masao Onizuka, a tall third-year who used to fight Toujou and be the "ki" in the Tōhōshinki before Himekawa, is the pianist; Teruomi Hino, a second-year who wears a mask, is the trumpeter; Seiji Kamayama, a dark-haired second-year, is the bassist; and Taizō Shiori, an obese third-year, is the drummer.
On their first encounter, Nasu tells Oga he is going to steal Beel from him, and indeed seems to be very interested in the baby. It is eventually revealed that Nasu, like Saotome (see below) is a Spellmaster, and quite an advanced one at that. He is defeated by Oga and Beel, while his henchmen are beaten by Kanzaki. He is part of a larger conspiracy which seems to be targeting Baby Beel. He is the third Beast.
Shinobu Takamiya
The former leader of Daten High and the second Beast, he is the contractor of Lucifer. He led a gang called Fallen Angels.
Fuji
He is the contractor of one of the Seven Sins, Satan.
Others
MK5
Named "Majide Kuukiyomenai 5 ningumi" [translation: The Unbelievably Tactless 5], this gang was suspended from school and is famous for its immense cruelty and poor hygiene. They always sport neckties and make a point of appearing in choreographic fashion, often with comical effects. Despite this, they are relatively weak in comparison to most of the other characters and have yet to win a single fight; they are almost always quickly defeated in an instant. They are distinct from most other thugs in that they use firearms loaded with actual bullets, and have even gone so far as to try to eliminate Nene Oomori. Members consist of:
: Short, snarky, and black-haired. The acting leader.
: Marked by a heart-shaped tattoo on his face. Uses a pistol.
: Bald and scarred. Uses nunchuks.
: Chapeaued and bespectacled. Carries a rifle.
: Immense, muscular, and has long hair.
Better known as "Good Night Shimokawa", he is a second-year thug who has a crush on Kunieda and is one of the first to be defeated by Oga. His nickname derives from his constant use of "Good night" to address people.
Saint Ishiyama Academy
Oga and his friends were transferred to Saint Ishiyama Academy, the sister school of Ishiyama High, when the latter was destroyed. They are not welcome however, as the school is unwilling to adopt the delinquents. The group is constantly harassed by the students of the school, but they are not the only problem. The school of Saint Ishiyama Academy has a force within it that upholds the rules of conduct. They are known as the (or horsemen). They are six captains of different sports teams and groups/clubs who possess an extraordinary amount of strength and fighting experience. They have set out to get rid of Oga and his friends, and are backed by an unfair rule that allows them to carry out "judgement" on any person or party within the student body. The six knights challenged Oga and his friends to a sports competition (after a huge fight on the rooftops of Saint Ishiyama). The wager of the battle was clear: if Oga and his friends won, they would not be expelled. Himekawa also managed to clinch a deal with the teacher in charge of student life, whereby if the six knights lost the competition they would be stripped of their authority and privileges. In the end, Ishiyama came out on top.
Six Holy Knights
The only first-year student of Saint Ishiyama to become a member of the Six Knights. He is the captain of the Karate team and a master of Hakkyokuken, as well as an advanced practitioner of the fictional Izuma-style martial arts. He is very strong, being able to take down Kanzaki with a single punch. Miki knows Oga from middle school, where Oga (intentionally or not) saved Miki from a group of high school delinquents. Wanting to become stronger, he started to hang around Oga, but later realized that this would not make him any stronger, because no matter what kind of fight he was dragged into, Oga Tatsumi took care of everything. However, when they meet again at St. Ishiyama, he appears to hold deep feelings of contempt towards Oga and to be obsessed with proving to his former classmate how strong he has become.
The origin of Miki's grudge against Oga is later told. Miki used to hang out with Oga and Furuichi and longed to be accepted as a friend by them. One night, Miki found himself in a tight spot when he tried to recover a charm given to him by his father from a group of middle school thugs led by Kiriya Reiji, who gave him his double scar in the left cheek. At the occasion, Oga helped Miki out and used Kiriya's own nails to carve a triple scar across his face. Later, Miki found that Oga, without telling him, was being constantly harassed by Kiriya and his underlings who wanted revenge. Miki went after Oga to offer to fight along him, but Oga shunned him coldly, purporting not even to know his friend. Still, Miki thought Oga just wanted to keep him from harm, especially as Miki was about to move to Nara with his mother. One afternoon, however, when Kiriya's gang surrounded Kata Middle School after Oga, Miki decided to join him. At this point, Oga lashed out, viciously beating and humiliating him in front of everybody. Miki then became severely resentful of Oga and decided to become better than he at fighting, in order eventually to beat him.
However, when Kiriya holds St. Ishiyama hostage three years later to get his own revenge against Oga, he casually reveals to Miki that he moved with his family to Nara at the same time as Miki, who finally realises the truth: Oga was aware that Kiriya and Miki would live in the same area and that, if Miki, who had no fighting skill at the time, had taken part in the fight against Kiriya, the latter would have retaliated against him in a treacherous manner later. Therefore, Oga decided to sever ties with Miki, and even to beat him up in front of Kiriya, in order to shift attention off him. In this he succeeded: Kiriya did not go after Miki while both were living at Nara and actually did not remember him at all when they met again.
When Miki realises this, all animosity against Oga vanishes and the two fight back to back against Kiriya. From that point on, Oga, who had refrained to acknowledge their former acquaintance, begins to use Miki's name, and the latter begins to try to get close to his former friend again.
Miki's fighting record is mixed. Having been thoroughly trained in martial arts, he relies on his agility to evade Oga's attacks, and is one of very few people to come out of a fight with him unscathed. However, most of his own attacks, although strong enough to take down Kanzaki, fail to have much of an effect on stronger thugs like Oga and Tojo. The Izuma style finisher (the Black Owl Killer) is strong enough to take down Oga in one hit, but it must be stressed that Oga actually intended to take the blow to measure Miki's strength, and made no effort to dodge or counter it. In Miki's own estimation, in that occasion he couldn't claim to have beaten Oga, mainly because executing the Black Owl Killer on him before having perfected the move damaged his hands badly to the point of bleeding. It is worth noting that Oga, though certainly incapable of retaliating, was not knocked out and was able to stand up on his feet soon afterwards, even though the move was supposed to send the victim to the hospital. Miki's own resilience does not seem particularly high, as he was quite affected by two hits from Teimou's shadow forces (see below), and was saved from further injury by Oga. By that point, though, he had perfected the Black Owl Killer and performed it to devastating effect on Kosei Kuroki (see below).
Despite being one of the six people who can feel Saotome using his powers, and therefore possessing of notable strength for a human, it is unclear whether Miki knows of the demon world, as he has not had any contact with demons. However, it is later learned that he is training with Izuma in preparation for a confrontation with the 34th Pillar Squad.
The leader of the six knights, Miki's teacher, the master of the Izuma dojo and until recently the student council president. A third-year, he is shown to be the strongest of its members, holding a great deal of authority over the group. Izuma is the descendant of a demon who escaped to the human world and he was taken up by Saint Ishiyama's headmaster upon losing his place in society for showing his powers in a previous school. As such, he can also release the dark aura seen in full demons, though apparently in lower levels.
He is often shown to oscillate between a calm and controlled attitude and a positive thirst for death. He has shown considerable authority, not only among students, but with the faculty members other than the headmaster as well, and is behind the initiative to challenge Ishiyama students for a volleyball match. During the match, he uses his martial style technique to send killer serves, but is eventually defeated by Kunieda. When Oga uses the Zebub Blast against Kiriya, he recognises the use of demonic powers and arranges a quick cover-up to prevent Oga from being exposed. In a later conversation, the headmaster reveals to him that Oga may be a target to demons, but it is not known whether he knows about baby Beel's being the Demon Lord's son. He can feel Saotome using his demon power, which shows he has notable strength for a human. In chapter 178, it is implied that he has feelings for Shizuka.
Izuma's fighting ability is superior to that of the other Knights and on par with Tojo's and Oga's. However, contrarily to them, he is taken down with ease by a demon and is saved from certain death by Tojo's intervention. Afterwards, he also set out to train in order to become capable of facing this kind of enemy.
His heritage is still unknown but it is clear that he has some Spanish heritage. He is a second-year at Saint Ishiyama High with light wavy hair. The captain of the boxing club, he is regarded as the second best high school boxer in the nation and is known to finish all matches with a one-hit knockout of the opponent. He also plays the piano. As of chapter 177, he has replaced Kaname Izuma as student council president.
At first, he shows contempt for Ishiyama's students and seeks a confrontation with Oga in the first opportunity. At the point, Oga's thoughts are of forcing baby Beel on him; knowing that fighting back means expulsion, he decides to take Alex' punches at first, while testing him with trivia questions in order to show baby Beel that he is not only strong but clever, with comic effect.
Alex is strong enough to defeat the MK5 with ease. However, he is no match for Oga: his punches fail to knock him out at first; later, Oga easily evades them and even stops one with his hand. When he finally evokes a reaction from Oga, the latter deals him a defeat similar to the ones Alex is known to deal to others: a one-hit knockout.
Sakaki is a second-year like Shinjou. He has long black hair that is usually kept in a ponytail. He is usually seen in his standard Ishiyama uniform and is the least talkative of the knights. He is the captain of the kendo team.
Sakaki is a very skilled swordsman and is able to cut a few hairs of Kunieda's with a wooden sword. However, he is not in her league: Kunieda is able to cut his sword with a ruler, to Sakaki's shock. He then begins to believe her the strongest of the Ishiyama students and longs to have a rematch with her. He even goes to the length of attacking her when she is unarmed and unwilling to fight back, but is stopped by Himekawa. The two men then fight and seem reasonably well matched, with Himekawa coming out in a slightly worse condition.
Later, Sakaki begins to show some attraction to Kunieda, and her toughness leads him to consider her a tsundere character.
Go is a muscular third-year. He is the captain of the radio club and participates in international ARDF competitions. He is ruthless and actively seeks fights, and attacked out of impulse once Miki admitted that Oga was the strongest of the four who showed up for the rooftop fights. His advance was intercepted by Shintarou Natsume and the two had a reasonably matched fight.
She is an attractive, red-haired third-year, the only female member of the six knights, the captain of the archery team and until recently the student council vice-president. She seems to have a strong relationship with Izuma as she is able to joke and laugh with him, something the other horsemen seem unable to do (likely due to their fear of him). She is seen massaging Izuma's back after their volleyball training session. She knows Tojo from the past and calls him Tora, and both are longing to meet Saotome Zenjuurou. Her actual fighting skill is yet undetermined, but Kunieda was surprised that she could reach the rooftop undetected by her, and both girls rose up to help Oga and Miki against Teimou, which indicates Shizuka is as unafraid of physical combat against men as Kunieda. She can feel Saotome using his demonic powers, which shows she has notable strength for a human. Shizuka has three siblings, two boys and a girl, the eldest of whom seems to look up to Tojo. It is heavily implied that she has feelings for him, but is content for now with being his friend.
Others
A first year student who looks up to thugs and gangs and wants to become a delinquent himself. He deeply admires Oga as the best hoodlum around and their first contact is when Oga and Kunieda save him and his friend Azusa from harassment by Teimou students. He then kowtows to Oga and begs to become his underling. After some insistence and flattery, Oga ends up accepting his company. He also admires Furuichi, to the latter's delight, calling him "General Furuichi", for being the only man able to follow Oga. His plot role so far has been mostly comic relief and as an information source on the Six Knights.
Yamamura's girlfriend and classmate and an easy-going, lighthearted girl who quickly gets on good terms with Kunieda and Oga, even rooting for them in their fight against the Six Knights.
A spellmaster, a human who made a contract with a demon and becomes capable of using their powers, who is assigned to Oga's class. The difference between simple contractors and spellmasters is not clear and may be just a matter of experience. It is not known which demon made the contract, but it is implied to be a member of the royal family, as Hilda recognises the seal on his hand. He already had sealed the contract when he was in High School. He wears a bandana, long, black dishevelled hair and is always seen smoking. He is also quite perverted, shamelessly flirting with Kunieda and her subordinates, peeking up Hilda's skirt and also groping her breasts during their fight.
Saotome is the most powerful human described so far, although Oga may have matched him recently. He shows superhuman strength, speed and agility and is able to defeat several uncontracted demons with relative ease, including Hilda. He can use the Nadeshiko movement as Oga, but in a much larger scale, even splitting hillocks with it. It is implied that he has access to information from the demon world that even Hilda is not privy to. His control of his demonic powers was initially much greater than Oga's, and he can gauge the amount of energy he wants to use with precision, as seen by the fine control he has over the size and expansion of his own tattoo. Recently, he offered to teach Tojo how to fight a demon. It seems that he is acting on Genma Isurugi's orders: in the school, he is appointed as homeroom teacher to the Ishiyama students. After overcoming some resistance from Oga, Saotome teaches him how to use Beel's powers to fight other demons.
Some of Saotome's deeds go beyond simple enhancement of human physical skills: he can perform authentic feats of magic in the same fashion as Oga, such as sealing a dimensional hole open by Oga in the roof of the volleyball court and dispatching Behemoth's subordinates (see below) back to the demon world. When he uses his powers to seal the hole, the pulse of energy is felt, other than by Hilda, by six characters that are thus identified as possessing of notable strength for humans: Oga, two Touhoushinki (Kunieda and Tojo) and three Horsemen (Izuma, Miki and Shizuka). This event seems to set apart which humans in the story are fit for celebrating contracts with demons: Oga is already a contractor, being chosen by baby Beel; Izuma has demon blood in him and Kunieda is soon targeted by a demon for this very purpose.
Later, it is revealed that Saotome took part in some sort of war in the Demon World, and was a respected champion in that conflict. Ikaruga Suiten (see below) states that a limitation to Saotome's use of demon power, as opposed to Oga's, is that Saotome does not master Black Techs and thus cannot allow himself to merge with his demon.
Genma Isurugi
St. Ishiyama's Headmaster. An old man who knows of the demon world and, like Saotome, has access to information from there. He also offers protection to young people who are trying to cope with their demon powers by accepting them into his school. It is implied that Izuma is not the only descendant of demons currently enrolled at St. Ishiyama. He can feel demonic energy like Saotome and realises immediately when members of the 34th Pillar Squad (see below) arrive in the city. When fighting, his muscles expand quickly and he can launch very powerful strikes.
The first homeroom teacher of the Ishiyama class at St. Ishiyama prior to Saotome's arrival. Bespectacled, and at first overconfident on his ability to exert control over the thugs, he quickly fails to do so, when his attempts to intimidate them by means of authority, strength or coercion backfire badly. He later becomes attached to the group and supports them in the volleyball match, and is greatly disappointed to be replaced by Saotome.
A teacher in charge of student life, he sustains an impassive expression when dealing with pupils and tries to enforce his authority over Ishiyama students, first by threatening to expel Kunieda and Oga if they do not restrain their colleagues; later, by deciding on the expulsion of Oga, all the Touhoushinki, Furuichi and Natsume. However, he is outmaneuvered by Himekawa and ends up agreeing to the condition of removing the Horsemen's authority in case Ishiyama win the volleyball match, which they do. During Kiriya and Teimou's plot, he keeps his cool and even threatens expulsion in case either of the opposing sides resorts to violence.
Demon World
In the Beelzebub series, the demon world bears little resemblance to Christian or Jewish Demonologies. It is described as a realm in another dimension that is inhabited by many fantastic creatures and ruled by the royal dynasty of the Beelzebubs. From what can be inferred, the way of life has traits of common medieval fiction stories, but at the same time contemporary devices such as video games are known. However, the technology seems to be slightly behind the human world's, as Lord En (see below) is shocked by how advanced a PlayStation 2 is. The Beelzebubs' power is not uncontested, though: there are rogues and thieves and other people living outside of the royal family's authority. Demons still have an intent to destroy Man, as in Western belief; however, they are not immortal and can be killed in a similar way to humans, although they are more powerful. They may have many different shapes, but most of those who interact with Oga and other humans are also human-like, with minor anatomical differences in some cases, such as reptilian ears, fangs or spots on the skin.
The Devil King and Baby Beel's father. He is referred to as the third Beelzebub in chapter 48, so his full name may be Kaiser de Emperana Beelzebub III. He is a tall figure with long light-colored hair, wearing a helmet with two prominent, cartoonish horns and dressed in a long cape, who is always pictured from behind. His main characteristic, often alluded to in the course of the series, is being "extremely random". He spends his time mostly playing karaoke or video games, and has twice decided to destroy mankind out of pure whim: however, his schedule full of ceremonies and engagements prevents him from going on his own, and thus he whimsically decides to send his children: first Baby Beel, then Lord En.
A former imperial doctor to the royal family. He has the appearance of a tall, dark-haired man, but in the human world he takes up a provisional body due to his contempt of humans. This body is similar to one of Lamia's (see below) "muumuu" pets, a random mass with a pair of eyes that can float above the ground at times. He is able to read minds. A highly skilled physician, he is first brought by Hilda in order to diagnose baby Beel, and is able to devise a cure for the kid by reestablishing his bond to Oga. He comes back later to treat Hilda's wound. Foras and Saotome know each other, but the nature of the acquaintance, as Saotome's connection to the demon world, is currently unknown. His name is probably a reference to a demon of the same name. It is later revealed that Forcas current position is as doctor to the 34th Pillar Squad (see below).
A demon doctor who is very small. Lamia comes to the human world in her capacity as Dr. Rachmaninorr's assistant to help in treating baby Beel and later takes care of Oga's wounds after a confrontation with a demon. Like her boss, she can read minds, even baby Beel's, although she does not do it very often. She disapproves of Oga as Beel's parent, but reluctantly accepts it after his battle with Tojo. Although she seemed cold and hostile upon their first encounter, she thanks Oga for saving her after the incident in the demon world. She is very protective of Baby Beel and greatly respects Hilda, whom she refers to as "Hilda-nee-san." Her name is possibly an allusion to the mythological demon. Later in the series, she seeks Furuichi's help to find Lord En on Hilda's request. Furuichi suspects her of being a tsundere character. Lamia carries a pistol loaded with bullets containing demonic concoctions that can erase memories, force a person to do one's bidding or, in the case of Oga, trap him in a psychic loop. She is always accompanied by two small muumuu pets, one of which sits atop her head and often mimics her mood. Her age is unspecified, but her appearance is that of a preteen girl. Her mother is general Laymia of the 34th Pillar Squad (see below).
Alaindelon's beautiful daughter. Like her father, she is a transdimensional demon. A naturalist, she is currently stationed in the outskirts of Vlad's Haunt to study its ecosystem. She seems to be a bit foolish and absent-minded.
Lord En
Baby Beel's elder brother, sent by their father to help in destroying mankind. He is a very spoiled, pompous child and a video game addict. However, he seems to be extremely powerful, on par with his brother: if he cries, he will destroy everything up to a radius of 15 km in a sea of flames. An example of this happens in chapter 138, when he incinerates Akumano Academy (see below). He is also lazy and a crybaby, and is not as interested in destroying mankind as he is in clearing video games. Lord En seems to have a crush on Lamia and even calls her his wife, but she does not reciprocate. His juvenile canine teeth are actually fangs and the left one is slightly longer. He has green hair like his brother and is attended by three wet nurses:
Yolda is Hilda's younger sister and bears a strong resemblance to her. She carries a mop and uses it as a weapon much as Hilda uses her umbrella. The two seem to have an unsettled score and Yolda positively despises Hilda. She is also able to move very quickly and knocks Furuichi and Kunieda out easily. In contrast to Hilda, she has a femme fatale attitude. It is later revealed that she is a dimensional transfer demon like Alaindelon; her powers are said to be even greater than his, and she is able to distort dimensions and create sections of space detached from the physical world. Despite not being as competent as Hilda, she is fiercely loyal to Lord En, to the point of allowing herself to be imprisoned so she can stay close to her master.
Sachura wears her long black hair in two braids and appears to be the youngest of the nurses. She brings Lord En his drinks. Her weapons are two pistols.
Isabella leads the three nurses and has a cold, serious attitude. She wears glasses and carries a book of incantations that she uses to cater for Lord En's needs and whims.
Athrun
A powerful demon who appears for the first time in Angelica's house in the demon world. At first, he appears to be working on commission of the thieves' leader, but later he saves Oga and the others from being stomped flat by the giant baby Beel. He considers killing Oga when he seems unable to summon Beel to him and revert him to his original size, but Oga instinctively succeeds in doing so and Athrun changes his mind.
He is able to teleport himself by using stones that Lamia describes as byproducts of dimensional transfer demons, and is last seen reporting to mysterious parties on his encounter with Oga. He is then told by his superiors that he will meet Oga again in the human world.
Postman
A demon who delivers letters to the human world. He has long blond hair and is constantly smiling. Because his method of delivery consists of letting the package fall from the sky, usually causing some damage, he tends to be on the receiving end of Oga's hostility, with comic effect.
Tama-and-Pochi
Called by Hilda a "demon of embodiment", Tama-and-Pochi is an artificial demon made by the Great Demon Lord to protect a painting he made of Baby Beel's mother, known in the human world as "the demon's portrait". Tama-and-Pochi has the appearance of a teenage girl, uses a crescent moon-shaped sickle as a weapon and her power is the "demon script": those under its effect see their companion's defects amplified a hundredfold, which causes any party of people greater than two who sees the painting to devolve into man-on-man fights until there is only one left standing. This did not work on Oga and Beel, though, because they don't believe they have any defects and actually rejoice on what would disgust others.
Tama-and-Pochi is nearly as random as her creator, and can actually fall asleep on the spot, even while standing, and while asleep she often urinates on herself.
Mrs Iris
Beel's mother. An extremely beautiful woman whom Hilda originally served and considers an older sister. The Demon's Portrait, painted by the Demon King, is a picture of hers. Her whereabouts haven't been revealed yet.
34th Pillar Squad
A military division that works directly under Lord En. It consists of ten divisions, each one commanded by a "Pillar Head" (or Lieutenant General), who may have one or more "Pillars" (or Brigadier General) under their command, for a total of 24. Each Pillar has 15 "Peons" under them. Ranking officers wear black, peons wear white leather coats. Pillar Heads' names are normally borrowed from mythical or literary dragons or dragon-like creatures; they have special powers and can be distinguished by their fringed epaulettes. Pillars have alphabetic names and are tattooed, each tattoo representing a letter of the demonic alphabet. Their loyalty and deference to En is unwavering, sometimes with comic effect.
Behemoth is the squad's founder and its former leader with the rank of general of the army. At least in the human world, he has the appearance of an eccentric, oddly dressed old man. He is named after the biblical beast. In contrast to the Demon Lord, who could not care less whether Beel or En is the one to destroy humanity, Behemoth wants En to prevail and be advanced as the rightful heir to the throne. He then sends his subordinates to the human world in order to kill Beel's contractor. Later, he builds a school (Akumano Academy, "Akumano" meaning "demon's") for Lord En in the place of the destroyed Ishiyama and populates it both with the other members of the squad and with Ishiyama's lesser thugs, who underwent some sort of brainwashing in the process. After the Squad is defeated by Oga and Akumano is burnt by En's crying, Behemoth and the rest of the Squad remain stuck in the human world.
Jabberwock, named after Lewis Carroll's character, is Behemoth's son and just appointed successor as leader of the squad, with the same rank as his father. He has a massive constitution and a big transversal scar across his face. His attitude is haughty and he immediately dismisses Oga as an unworthy opponent on first meeting him. Jabberwock then proceeds to have his pet dragon Sodom (described as a "Grand Bahamut") kidnap Hilda by swallowing her alive. He seems to respect Saotome and wishes to face him in battle, but is more reluctant than his father to be under the leadership of Lord En's, to whom he refers as a stupid kid. His recklessness has earned him the nickname "Crazy Dragon". Jabberwock is very powerful; the Zebub Emblem and even Super Milk Time seem to be ineffective against him, but he develops a little amount of respect for Oga on fighting him for the first time. His nasty temper got him expelled from the squad at a point, but he was readmitted by his father. Jabberwock is eventually defeated by Oga and Beel after a fierce battle. He has his own squadron, whose members seem to have a bad reputation with the rest of the Squad due to their lack of honour. They include three personal Pillars:
Lunana is a dark-skinned, stocky woman with a detached expression who seems to be able to move extremely quickly.
Lindworm wears a chest plate and has long dark hair, as well as a mischievous attitude.
Kirin has fair hair, wields two batons fitted with blades and is blindfolded.
A number of Pillar Heads have been presented, as well as some Pillars working under them.
Naga is first introduced alongside Graffel when the latter attacks Izuma and Tojo, but maintains a detached attitude that contrasts with Graffel's violence. He rushes with Graffel to Hecadoth's aid against Saotome, only to be dispatched to the demon world by the teacher. It is later revealed that he is known as the Water Dragon King and his power is way above Hecatos' and Graffel's. His black aura often takes the shape of a dragon. He is probably named after the Hindu deity. Naga is eventually defeated by Oga and Beel's Super Milk Time.
Hecadoth is the 8th Pillar. He begins his attack on Oga and the others by imprisoning Kunieda with the intention to use her blood to forge a demon contract; it is understood that the already powerful demons increase their power in the human world considerably if they find a contractor. It seems that the contract itself is not necessarily consensual.
However, Hecadoth looks down on Hilda and Oga and, instead of proceeding to seal the contract, he allows them to have a shot at him. The two succeed in surprising him with Oga's Zebub Blast, while Hilda releases Kunieda. Hecadoth, who had planned for that, uses the opportunity to impale Hilda with his spear, putting her out of combat. He then proceeds to face Oga, and is only prevented from killing him by Saotome's intervention, whereby he is sent back to the demon world. His spear fails to kill Hilda thanks to Kunieda's first aid and Dr. Rachmaninoff's timely intervention, but it puts the demon maid out of action for some time, since it has the property of diffusing demonic powers around the wound.
Later, Hecadoth meets Hilda again, but this time she is at the top of her powers and unhindered, and attacks him fiercely. Before he can retaliate, Oga arrives from his training with Saotome and takes up the fight from Hilda. He defeats Hecadoth easily and the demon is the first victim of the Zebub Emblem.
Graffel, the 7th Pillar, also works under Naga and is first presented when he interrupts Tojo and Izuma's fight, having been attracted to it by Izuma's demonic energy. He is very proud of his power and considers humans and lower demons inferior, and nearly kills Tojo and Izuma before sensing Saotome's attack on Hecatos and rushing to his aid. He is sent back to the demon world by Saotome. He is later the first victim of Oga and Beel's Super Milk Time.
Graffel is general Yata's younger brother, although Yata considers him a good-for-nothing. Despite this assessment, his loyalty to Lord En is such that, alongside Hecadoth and Naga, he takes the initiative to kill Oga without authorisation from the Squad's leadership, and is ready to give his life to attain that goal. After their second defeat, he and Hecadoth are seen imprisoned in Akumano High's dungeon.
Laymia is a Pillar Head and Lamia's mother. She seems to be one of Behemoth's closest advisors. Although her daughter sides with Beel, she is one of the main architects in the plot to kill Oga and deprive the demon baby of his Contractor. She is a tall woman with an unfathomable expression who is seen heading a meeting of the Squad's officers.
Agiel, the first Pillar, is a cheerful, slim girl in Laymia's division who is extremely strong and violent and who becomes obsessed with Aoi after being defeated by her.
Odonel, the 14th Pillar and also under Laymia, is a short man whose head is completely covered in bandages and who is first shown with his arms tied up to his torso.
Quetzalcoatl is Harlequin-like in appearance and has the ability to control people's minds. He uses this power on Lord En's orders to turn all of Ishiyama's former students who did not go to St. Ishiyama into slaves to corner Furuichi and the others. He then challenges the Ishiyama gang to a game with their lives on the line. He is named after the Mesoamerican deity.
Basilisk is a large, scarred, hirsute man who is seen smoking a cigar with his feet on the table at the meeting Laymia headed. His weapon of choice is a giant ax, and he has the power to immobilise his opponents if they look at him in the eye. Oga falls for the trick, but Beel stops the ax and both defeat Basilisk using Super Milk Time. His power and name are adapted from the Greek mythological monster.
Salamander is a fair-haired young man whose light demeanour and warm smile contrast with the offhand way he discusses executing Graffel and Hecatos for disobedience. His power, Lost Prominence, is a fire that burns memories instead of matter, and which can also be used for mind control. His namesake is the mediaeval mythical creature.
Yata is a young swordsman seen in the meeting headed by Laymia. In the occasion he proposed executing Graffel and Hecatos – even though Graffel is his brother – for attacking Oga without an express order to do so. His power consists of wielding his katana at supersonic speed. His name is probably a derivation of the Japanese deity.
In addition to these characters, the meeting mentioned above introduced Vritra, a woman with a cold attitude. Tojo's return in chapter 132 pits him against Yinglong, a tall man with a ponytail. Ananta, first glimpsed in chapter 123, is a girl with odango hair who battles Kunieda on chapter 134.
Finally, a number of Pillars have made quick appearances. Zela, the 24th, is a tall blond man introduced with Agiel and Odonel while standing sentry at Akumano Academy. When Oga attacks Akumano High, he meets and defeats Din (4th), a young man with shoulder-length black hair; Kne (10th), who wears a French-style beret; Labed (11th), who sports dreadlocks; Wasboga (21st), who wears sideboards; Xoblah (22nd), a plump man who is knocked out by Oga on first sight; and Yshiel (23rd), a blond swordswoman with a patch over her left eye. Tojo then defeats Cemor (3rd), a man with light, pointy hair; and Nebak (13th), a short man with an African lion mask. Kunieda faces Elim (5th), a little girl in oversized clothes who wields a cane; Fabas (6th), a punk who fights with two backswords; Pamiel (15th), a Hippie who uses a dagger; and Tiriel (19th), a long-haired blonde who uses two swords. Oga meets Schethalim (18th), a light-haired man ; and Vabam (20th), an anthropomorphic dog; both of whom use pistols.
Others
Oga's older sister and the first leader of the Red Tails. A young adult now, she is nevertheless still violent and scares even Oga and Furuichi, but seems to get along with Hilda very well. As Oga's parents, she seems easily to accept the strange events happening around her brother ever since Hilda and Baby Beel arrived, even when blatantly supernatural beings like Forkas appear (she is seen being massaged by him in chapter 38). She is under the assumption that Hilda, Beel and the others are from Macao (apparently having mistaken it from the word Makai, the Japanese word for the demons' dwelling).
Reiji Kiriya
Also known as the Viper, he is a vicious thug who is at the centre of Oga and Miki's story. His cunning and thirst for revenge gain him the leadership of Teimou Academy's skinheads, who are driven by him to take St. Ishiyama hostage in order to get back at Oga. He wears the hair in black power style and his face has three vertical scars carved by Oga using Kiriya's own nails, in retribution for his attack on Miki.
His plan for revenge ultimately backfires when the Red Tails and the Six Knights capture his underlings and Oga and Miki defeat Teimou's shadow group (see below). After being badly injured by Oga's Zebub Blast, he hallucinates and takes Oga himself for a devil, and crawls away in mortal fear.
Teimou's shadow group
The four strongest fighters of Teimou Academy, they ruled over Teimou from the shadows under Kiriya's orders while the latter was in hiding. They are defeated by Oga and Miki, and later go to the Shingetsu Temple to become stronger and get back at St. Ishiyama, only to find Oga already there and be badly beaten again. They are nevertheless taken in by Kunieda's grandfather and begin their training alongside Oga, in what seems to be a temporary truce.
Kotaro Mikagami wears a jumper with a hood and several piercings and rings. He is able to pull several punches of great strength in a matter of seconds. He later develops a crush on Aoi Kunieda, exploited in the story for comedic effect.
Unsho Onizuka is very heavily built and relies on sheer strength to overcome his opponents. He and Mikagami are defeated by Oga in one punch.
Kosei Kuroki is a plain skinhead who wields a three-section staff. He is able to repel an attack from Miki, but is later defeated by his Black Owl Killer.
Takumi Dezaki is a bespectacled, homosexual man and a very capable fighter who deals a heavy blow on Miki. He is not directly defeated by Miki, but is caught in Oga's Zebub Blast directed at Kiriya. He seems to have a crush on Mikagami and is jealous of the latter's interest in Kunieda.
Ittousai Kunieda
Kunieda's grandfather and instructor, the master of the Shingetsu martial arts style is a strong old man who sports long white hair and a moustache. He has a violent personality and, on meeting Oga for the first time, drags him to a brief spar, and is actually victorious. Seeing potential in Oga, he offers to train him if he wants to become stronger.
When Oga decides to take his offer, Kunieda smiles mischievously and begins by ordering Oga to perform a number of household chores, to his great dismay. Later he takes up Teimou's shadow group and leads them all into a training excursion, first ordering them to break stones with their bare hands. He is a very stern man with a hair-trigger temper, and adopts an attitude of fighting first, asking questions later.
Not only does he know about demons and the demon world, but he also recognises Oga as a contractor and decides to train him to use demonic powers. He engages Saotome's assistance to this end, much to Oga's dismay. The three adults who know of the demon world so far - Kunieda, Saotome and Isurugi - are united in their goals and are shown together for the first time facing Behemoth.
Kouta Kunieda
Kunieda's little brother. An infant about the same age Beel, the two first meet in the park when Oga tries to get Beel to fight him. Since Beel is weak when not in contact with Oga, Kouta won the match by simply forcing Beel off the park bench. Since that, the two have developed a rivalry, and in all their encounters so far, Kouta has come out on top. He seems to be somewhat evil like Beel, and to enjoy tormenting the baby demon. Their rivalry is a regular source of comedy in the story. In the anime, the two babies are friendlier towards each other.
Isafuyu Kashino
Voiced by: Saori Hayami
The shy young daughter of the keeper of the Mapputatsu shrine, she is first introduced when Grandpa Kunieda takes Oga and the others to spend the night there. She immediately recognises Baby Beel's true nature and is greatly scared of him. She is described by Kunieda as very spiritually aware and, besides demons, can detect the presence of ghosts and perform exorcisms. Kunieda requests her help to learn how to defeat a demon, with a view to fighting the 34th Pillar Squad, as Oga and Tojo. Isafuyu then introduces Kunieda to the minor god Koma.
Koma
Describing himself as a minor god, Koma is a komainu, although he used the literal meaning of his kind's name to pass for a tengu when he inhabited the Mapputatsu shrine. Although she had never actually seen him, Isafuyu used to borrow his powers whenever she needed to exorcise demons, and took Kunieda to his abode when she requested assistance in this regard.
Koma at first demurs and threatens to sever his agreement with Isafuyu, but becomes interested in Kunieda when he realises she can hear his voice. He then reveals to be quite perverted, trying to get Kunieda to answer questions about her growth and underwear, and revealing that he posed the same questions to Isafuyu in exchange for assistance. Kunieda then becomes enraged and uses her swordstyle to attack Koma's house and force him to reveal himself. He then agrees to help her and becomes her companion, not without showing interest in the Red Tails in the process. In chapter 118 he assumes the form of a gigantic wolf-like creature when he is preparing to fight alongside Kunieda, and in the following chapter he is recognised by Odonel as a 'sicarion' (maybe a corruption of Sicarii), a member of a family of demons who were exiled into the human world after being defeated in war. With his power, Kunieda's swordsmanship is improved enough so that she can face off against Hilda or Agiel.
He can conceal his presence and remain hidden from sight, including from other demons. Even when he is not actively hiding, he can normally be seen or heard only by people who are either spiritually aware or stronger than the average human. A partial exception seems to be Furuichi: despite being extremely weak, he can sense a presence filling the space around Kunieda in chapter 119, even if he doesn't see Koma. He can become visible if he decides so.
Mr Takahashi
A formerly unemployed teacher who inadvertently jumps at the opportunity of a new job and is hired by Behemoth to keep a veneer of normalcy in Akumano Academy by teaching Lord En and the officers, with comic effect.
Ikaruga Suiten
Formerly known as Ikaruga Nazuna, she is a priestess in a temple in the isolated Decapitation Island. Saotome sends Oga and Kunieda to learn from her how to use a demon's powers by merging with them - the skill behind Super Milk Time, known as Black Techs.
Ikaruga is referred to by Saotome and Grandpa Kunieda as unreliable and a snake, but she nevertheless acquiesces to teaching Oga and Kunieda. She moves around in a motorbicycle and can be quite violent when challenged. She can also "shoot" things without a pistol, using her fingers to send some kind of power towards the target.
It is later revealed that Ikaruga and Saotome were colleagues at Ishiyama, and that she used to have feelings for him. Like Kunieda, she led a girl gang. She also knows Kunieda's mother, whom she considers her better in martial skill.
Futaba Kanzaki
Kanzaki's niece by his elder brother. She is an extremely spoiled, four-year-old brat who continually abuses his family and their yakuza underlings. She recruits Beel as her "lackey" and becomes jealous when Chi Aiba (see below) appears with Beel in tow.:
Mugen Kanzaki
Kanzaki's father and the boss of the Ishiyama yakuza. Despite this, he is a doting grandfather who is completely manipulated by Futaba and mainly responsible for spoiling her.
South Chinpira High School
An all-male delinquent school met by Oga and the other thugs during their field trip to Okinawa. They idolise Ishiyama High as the ultimate delinquent school and have emulated many of their customs, to the point of their four strongest thugs calling themselves Touhoushinki: Kamiya wears a chain piercing and copies Kanzaki's taste for yoghurt, Higashiyama is bulky like Tojo, and Himeji wears Hawaii-style shirts and a pompadour like Himekawa. Kunihiko, being a man, does not copy Kunieda but sports his Touhoushinki kanji character on a mask over his mouth. Ironically, on their first meeting, they are unaware that Oga and the others belong to Ishiyama and mutual hostility instantly arises. It is later found that they are considerably weaker than their Ishiyama counterparts.
Izou Aiba
The king of South Chinpira High and Oga's counterpart there. He is immensely strong, apparently on par with Oga but, contrarily to the latter, he does fulfill his role as the leader of his school's thugs, controls them and is followed without question. His temperament is much lighter than Oga's. He feels instantly attracted to Aoi and tries to get a date with her, much to the Red Tails' chagrin. His signature move is an extremely powerful finger flick that can send an average human flying a long distance. However, like Oga, he does not seem to pick fights, but will mercilessly use his power to punish his underlings if they misbehave. When they finally fight, Oga defeats him, but no hard feelings are born afterwards and Aiba tells Aoi he will be back eventually to try and woo her again.
Chiyo Aiba
Izou's little sister, a four-year-old who falls for Beel on first sight. She is quite precocious and can already read, having developed a taste for fortune-telling and the Western Zodiac. She normally travels on a carrier strapped to Izou's back.
San Marx Private Fine Arts Academy
An absurdly posh school in a valley in the countryside, attended by children of political and economical elites from Japan and abroad. Himekawa used to attend it until he was 15.
Kugayama
The student at the top of the social hierarchy at San Marx, always seen escorted by bodyguards in black suits. Kugayama is the only person to have outwitted Himekawa, and there seems to be some bitterness between the two. The student is the current owner of the Demon's Portrait and knows about the existence of demons, having seen Tama-and-Pochi while in possession of the painting. Due to an androginous appearance and the donning of a male uniform, Kugayama was originally thought by Oga and the others to be a man, but they were proven otherwise in chapter 167: Kugayama is a girl and her family and Himekawa's had actually agreed that the two would marry. While she has been in love with him for a long time, his stance on the matter is not yet known. Kugayama is an ambitious woman who wants to rise politically, and is also a skilled fighter, having been able to break the forearm of a man effortlessly.
References
Beelzebub
|
Nalliah Kumaraguruparan (; ) is a Sri Lankan Tamil accountant, politician and former provincial councillor. He is leader of the Democratic National Front.
Career
Kumaraguruparan was one of the All Ceylon Tamil Congress's (ACTC) candidates in Jaffna District at the 1989 parliamentary election but the ACTC failed to win any seats in Parliament. He contested the 1994 parliamentary election as part of an independent group in Colombo District but the group failed to win any seats in Parliament.
Kumaraguruparan was elected general-secretary of the ACTC in January 2000. He was later senior deputy president of the party.
Kumaraguruparan joined the Western People's Front (WPF) in May 2004. He contested the 2004 provincial election as one of the WPF's candidates in Colombo District but failed to get elected after coming third amongst the WPF candidates. He contested the 2006 local government election as a WPF candidate and was elected to Colombo Municipal Council. Kumaraguruparan served as general-secretary of the WPF.
Kumaraguruparan contested the 2009 provincial council election as one of the United National Front's (UNF) candidates in Colombo District and was elected to the Western Provincial Council. He contested the 2010 parliamentary election as one of the UNF's candidates in Colombo District but failed to get elected after coming tenth amongst the UNF candidates. He contested the 2014 provincial election as one of the Democratic People's Front's (DPF) candidates in Colombo District but failed to get re-elected. Shortly afterwards Kumaraguruparan fell out with the DPF leadership and was expelled from the party.
Kumaraguruparan then founded a party called Democratic National Front. He contested the 2015 parliamentary election as one of the United People's Freedom Alliance's (UPFA) candidates in Colombo District but failed to get elected after coming 19th amongst the UPFA candidates.
Electoral history
References
All Ceylon Tamil Congress politicians
Colombo municipal councillors
Democratic People's Front politicians
Living people
Members of the Western Provincial Council
People from Jaffna
Sri Lankan Hindus
Sri Lankan Tamil accountants
Tamil politicians
United People's Freedom Alliance politicians
Year of birth missing (living people)
|
```cmake
string(REPLACE "." "_" REF "R_${VERSION}")
vcpkg_from_github(
OUT_SOURCE_PATH SOURCE_PATH
REPO libexpat/libexpat
REF "${REF}"
SHA512 your_sha256_hashyour_sha256_hash
HEAD_REF master
)
string(COMPARE EQUAL "${VCPKG_LIBRARY_LINKAGE}" "dynamic" EXPAT_LINKAGE)
string(COMPARE EQUAL "${VCPKG_CRT_LINKAGE}" "static" EXPAT_CRT_LINKAGE)
vcpkg_cmake_configure(
SOURCE_PATH "${SOURCE_PATH}/expat"
OPTIONS
-DEXPAT_BUILD_EXAMPLES=OFF
-DEXPAT_BUILD_TESTS=OFF
-DEXPAT_BUILD_TOOLS=OFF
-DEXPAT_BUILD_DOCS=OFF
-DEXPAT_SHARED_LIBS=${EXPAT_LINKAGE}
-DEXPAT_MSVC_STATIC_CRT=${EXPAT_CRT_LINKAGE}
-DEXPAT_BUILD_PKGCONFIG=ON
MAYBE_UNUSED_VARIABLES
EXPAT_MSVC_STATIC_CRT
)
vcpkg_cmake_install()
vcpkg_copy_pdbs()
vcpkg_cmake_config_fixup(CONFIG_PATH "lib/cmake/expat-${VERSION}")
vcpkg_fixup_pkgconfig()
file(REMOVE_RECURSE "${CURRENT_PACKAGES_DIR}/debug/include")
file(REMOVE_RECURSE "${CURRENT_PACKAGES_DIR}/debug/share")
file(REMOVE_RECURSE "${CURRENT_PACKAGES_DIR}/share/doc")
vcpkg_replace_string("${CURRENT_PACKAGES_DIR}/include/expat_external.h" "defined(_MSC_EXTENSIONS)" "defined(_WIN32)")
if(VCPKG_LIBRARY_LINKAGE STREQUAL "static")
vcpkg_replace_string("${CURRENT_PACKAGES_DIR}/include/expat_external.h" "! defined(XML_STATIC)" "0")
endif()
file(COPY "${CMAKE_CURRENT_LIST_DIR}/vcpkg-cmake-wrapper.cmake" DESTINATION "${CURRENT_PACKAGES_DIR}/share/${PORT}")
vcpkg_install_copyright(FILE_LIST "${SOURCE_PATH}/expat/COPYING")
```
|
```python
# Authors: Andreas Mueller
# Manoj Kumar
import warnings
import numpy as np
from ..externals import six
from ..utils.fixes import in1d
from .fixes import bincount
def compute_class_weight(class_weight, classes, y):
"""Estimate class weights for unbalanced datasets.
Parameters
----------
class_weight : dict, 'balanced' or None
If 'balanced', class weights will be given by
``n_samples / (n_classes * np.bincount(y))``.
If a dictionary is given, keys are classes and values
are corresponding class weights.
If None is given, the class weights will be uniform.
classes : ndarray
Array of the classes occurring in the data, as given by
``np.unique(y_org)`` with ``y_org`` the original class labels.
y : array-like, shape (n_samples,)
Array of original class labels per sample;
Returns
-------
class_weight_vect : ndarray, shape (n_classes,)
Array with class_weight_vect[i] the weight for i-th class
References
----------
The "balanced" heuristic is inspired by
Logistic Regression in Rare Events Data, King, Zen, 2001.
"""
# Import error caused by circular imports.
from ..preprocessing import LabelEncoder
if class_weight is None or len(class_weight) == 0:
# uniform class weights
weight = np.ones(classes.shape[0], dtype=np.float64, order='C')
elif class_weight in ['auto', 'balanced']:
# Find the weight of each class as present in y.
le = LabelEncoder()
y_ind = le.fit_transform(y)
if not all(np.in1d(classes, le.classes_)):
raise ValueError("classes should have valid labels that are in y")
# inversely proportional to the number of samples in the class
if class_weight == 'auto':
recip_freq = 1. / bincount(y_ind)
weight = recip_freq[le.transform(classes)] / np.mean(recip_freq)
warnings.warn("The class_weight='auto' heuristic is deprecated in"
" 0.17 in favor of a new heuristic "
"class_weight='balanced'. 'auto' will be removed in"
" 0.19", DeprecationWarning)
else:
recip_freq = len(y) / (len(le.classes_) *
bincount(y_ind).astype(np.float64))
weight = recip_freq[le.transform(classes)]
else:
# user-defined dictionary
weight = np.ones(classes.shape[0], dtype=np.float64, order='C')
if not isinstance(class_weight, dict):
raise ValueError("class_weight must be dict, 'auto', or None,"
" got: %r" % class_weight)
for c in class_weight:
i = np.searchsorted(classes, c)
if i >= len(classes) or classes[i] != c:
raise ValueError("Class label %d not present." % c)
else:
weight[i] = class_weight[c]
return weight
def compute_sample_weight(class_weight, y, indices=None):
"""Estimate sample weights by class for unbalanced datasets.
Parameters
----------
class_weight : dict, list of dicts, "balanced", or None, optional
Weights associated with classes in the form ``{class_label: weight}``.
If not given, all classes are supposed to have weight one. For
multi-output problems, a list of dicts can be provided in the same
order as the columns of y.
The "balanced" mode uses the values of y to automatically adjust
weights inversely proportional to class frequencies in the input data:
``n_samples / (n_classes * np.bincount(y))``.
For multi-output, the weights of each column of y will be multiplied.
y : array-like, shape = [n_samples] or [n_samples, n_outputs]
Array of original class labels per sample.
indices : array-like, shape (n_subsample,), or None
Array of indices to be used in a subsample. Can be of length less than
n_samples in the case of a subsample, or equal to n_samples in the
case of a bootstrap subsample with repeated indices. If None, the
sample weight will be calculated over the full sample. Only "auto" is
supported for class_weight if this is provided.
Returns
-------
sample_weight_vect : ndarray, shape (n_samples,)
Array with sample weights as applied to the original y
"""
y = np.atleast_1d(y)
if y.ndim == 1:
y = np.reshape(y, (-1, 1))
n_outputs = y.shape[1]
if isinstance(class_weight, six.string_types):
if class_weight not in ['balanced', 'auto']:
raise ValueError('The only valid preset for class_weight is '
'"balanced". Given "%s".' % class_weight)
elif (indices is not None and
not isinstance(class_weight, six.string_types)):
raise ValueError('The only valid class_weight for subsampling is '
'"balanced". Given "%s".' % class_weight)
elif n_outputs > 1:
if (not hasattr(class_weight, "__iter__") or
isinstance(class_weight, dict)):
raise ValueError("For multi-output, class_weight should be a "
"list of dicts, or a valid string.")
if len(class_weight) != n_outputs:
raise ValueError("For multi-output, number of elements in "
"class_weight should match number of outputs.")
expanded_class_weight = []
for k in range(n_outputs):
y_full = y[:, k]
classes_full = np.unique(y_full)
classes_missing = None
if class_weight in ['balanced', 'auto'] or n_outputs == 1:
class_weight_k = class_weight
else:
class_weight_k = class_weight[k]
if indices is not None:
# Get class weights for the subsample, covering all classes in
# case some labels that were present in the original data are
# missing from the sample.
y_subsample = y[indices, k]
classes_subsample = np.unique(y_subsample)
weight_k = np.choose(np.searchsorted(classes_subsample,
classes_full),
compute_class_weight(class_weight_k,
classes_subsample,
y_subsample),
mode='clip')
classes_missing = set(classes_full) - set(classes_subsample)
else:
weight_k = compute_class_weight(class_weight_k,
classes_full,
y_full)
weight_k = weight_k[np.searchsorted(classes_full, y_full)]
if classes_missing:
# Make missing classes' weight zero
weight_k[in1d(y_full, list(classes_missing))] = 0.
expanded_class_weight.append(weight_k)
expanded_class_weight = np.prod(expanded_class_weight,
axis=0,
dtype=np.float64)
return expanded_class_weight
```
|
```kotlin
/*
*
*
* 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 com.drakeet.multitype.sample.communication
import android.os.Bundle
import androidx.recyclerview.widget.RecyclerView
import com.drakeet.multitype.MultiTypeAdapter
import com.drakeet.multitype.sample.MenuBaseActivity
import com.drakeet.multitype.sample.R
import com.drakeet.multitype.sample.normal.TextItem
import java.util.*
/**
* @author Drakeet Xu
*/
class CommunicateWithBinderActivity : MenuBaseActivity() {
private val aFieldValue = "aFieldValue of SimpleActivity"
private var adapter: MultiTypeAdapter = MultiTypeAdapter()
override fun onCreate(savedInstanceState: Bundle?) {
super.onCreate(savedInstanceState)
setContentView(R.layout.activity_list)
val recyclerView = findViewById<RecyclerView>(R.id.list)
val items = ArrayList<Any>()
adapter.register(TextItemWithOutsizeDataViewBinder(aFieldValue))
recyclerView.adapter = adapter
for (i in 0..19) {
items.add(TextItem(i.toString()))
}
adapter.items = items
adapter.notifyDataSetChanged()
}
}
```
|
Port Macquarie-Hastings Council is a local government area in the Mid North Coast region of New South Wales, Australia.
The area is located adjacent to the Hastings River, the Pacific Highway, the Oxley Highway and the North Coast railway line. Major population centres in the local government area are Port Macquarie, Camden Haven, Wauchope, Lake Cathie and Kendall.
The mayor of the Port Macquarie-Hastings Council since 4 August 2017 is Cr. Peta Pinson, an independent politician who joined the Nationals in 2023.
Port Macquarie suburbs
Blackmans Point
Port Macquarie CBD (not a suburb)
Fernbank Creek
Flynns Beach
Innes View
Lake Innes
Limeburners Creek
North Shore
Port Macquarie
Port Macquarie West
Sancrox
Sovereign Hills
Tacking Point
The Hatch
Thrumster
Towns and localities
Towns and localities (including Port Macquarie suburbs) in the Port Macquarie-Hastings Council are:
Demographics
At the 2011 Census, there were people in the Port Macquarie-Hastings local government area, of these 48.1% were male and 51.9% were female. Aboriginal and Torres Strait Islander people made up 3.3% of the population, slightly higher than the national average. The median age of people in the Port Macquarie-Hastings Council area was 47 years; some ten years higher than the national median. Children aged 0 – 14 years made up 17.8% of the population and people aged 65 years and over made up 24.7% of the population. Of people in the area aged 15 years and over, 52.4% were married and 14.7% were either divorced or separated.
Population growth in the Port Macquarie-Hastings Council area between the 2001 Census and the 2006 Census was 6.68%; and in the subsequent five years to the 2011 Census was 6.23%. When compared with total population growth of Australia for the same periods, being 5.78% and 8.32% respectively, population growth in the Port Macquarie-Hastings local government area was generally on par with the national average. The median weekly income for residents within the Port Macquarie-Hastings Council area was slightly below the national average.
At the 2011 Census, the proportion of residents in the Port Macquarie-Hastings local government area who stated their ancestry as Australian or Anglo-Celtic exceeded 83% of all residents (national average was 65.2%). In excess of 64% of all residents in the Port Macquarie-Hastings Council area nominated a religious affiliation with Christianity at the 2011 Census, which was higher than the national average of 50.2%. Meanwhile, as at the Census date, compared to the national average, households in the Port Macquarie-Hastings local government area had a significantly lower than average proportion (3.6%) where two or more languages are spoken (national average was 20.4%); and a significantly higher proportion (93.7%) where English only was spoken at home (national average was 76.8%).
Council
Current composition and election methods
Port Macquarie-Hastings Council is composed of nine councillors, including the mayor, for a fixed four-year term of office. The mayor is directly elected while the eight other councillors are elected proportionally as one entire ward. The most recent election was held on 10 September 2016, and the makeup of the council is as follows:
On 8 May 2017, the elected mayor since 2012, Peter Besseling, resigned effective immediately to take up an executive business position. Deputy Mayor Lisa Intemann served as acting mayor until a by-election was held for the mayoral position on 29 July 2017. On 4 August 2017, the final results were declared and Peta Pinson became mayor.
The current council, elected in 2021, is:
History
Local government in the Hastings region started with the passage of the District Councils Act 1842, which allowed for limited local government in the form of a warden and between 3 and 12 councillors to be appointed by the Governor. Between July and September 1843, 28 such entities had been proclaimed by Governor George Gipps. The Macquarie District Council, the 8th to be declared, was proclaimed on 12 August 1843, with a population of 2,409 and an area of . Due to various factors, the district councils were ineffective, and most had ceased to operate by the end of the decade.
After the enactment of the Municipalities Act of 1858, which gave the councils more authority and which allowed for residents to petition for incorporation of areas and also to elect councillors, the town of Port Macquarie, population 984, petitioned to be incorporated as a municipality twice: in 1859 and again in 1867; but on both occasions, counter-petitions from other residents prevented it from being incorporated. Finally, on 15 March 1887, the Port Macquarie Municipal District was proclaimed, with the first elections on 25 May 1887 electing James McInherney as the first mayor.
The Local Government (Shires) Act 1905 enabled the Shire of Hastings, based in the town of Wauchope, to come into being in June 1906, in time for elections in November 1906. The first Shire President was James O'Neill.
In 1981, the two councils were amalgamated to form the Municipality of Hastings, with Norm Matesich becoming the council's inaugural mayor. In 1991, the council moved into its present premises in Burrawan Street, Port Macquarie. With the enactment of the , which changed the responsibilities of the mayor and councillors, the Hastings Council was created. In 2005, the name was changed to Port Macquarie-Hastings following a community survey, showing that many people thought that the new name would better reflect the area.
Glasshouse controversy
On 27 February 2008 the Minister for Local Government, Paul Lynch, dismissed the council and appointed an administrator, Dick Persson, who also administered the Northern Beaches Council and Warringah Council in Sydney, and the Central Coast Council in the Central Coast region. The dismissal of council was made after alleged mishandling of a project initiated in 2001 to build a cultural and entertainment centre, known to locals as the Glasshouse. The project, initially a joint venture with the management of the neighbouring shopping centre, Port Central, was initially expected to cost the Council A$7.3 million, but by late 2007, despite the centre not yet having opened, the costs had blown out to over A$41.7 million, with interest repayments likely to extend the council's liability to A$66 million. On 27 July 2007, a full public inquiry was announced by the Minister for Local Government, which reported back in February 2008.
The inquiry report found that the council had failed to provide appropriate financial and project management and had lost control of the costs, that the project costs had harmed the council's ability to provide services and amenities to the community, and that the council's "communications management strategies" had resulted in inadequate consultation with the public or appropriate regard to their concerns. The outgoing mayor, Rob Drew, was critical of the process throughout, maintaining that errors had been made and misinformation had been accepted as fact; however, the New South Wales Urban Task Force, a property development lobby group, believed the dismissal served as a warning to other councils to stick to "core responsibilities". In 2009 it was revealed that the Glasshouse would cost ratepayers around A$6 million a year to run.
See also
Local government in New South Wales
References
External links
Local government areas of New South Wales
Mid North Coast
Port Macquarie
|
```html
{{template "header"}}
<link rel="stylesheet" href="/public/css/signup.css">
{{template "header2" .}}
<form method="POST" action="/api/createuser" id="form-create-user">
<i class="fa fa-user fa-5x"></i>
<input id="email" name="email" type="email" placeholder="Enter your email">
<p class="form-field-err"></p>
<input id="userName" name="userName" placeholder="Enter a twitter name" autocomplete="off">
<p class="form-field-err" id="username-err"></p>
<input id="password" name="password" type="password" placeholder="Create your password">
<input id="password2" name="password2" type="password" placeholder="Retype your password">
<p class="form-field-err" id="password-err"></p>
<button id="btn-create-account">Create Account</button>
</form>
<script>
var formUser = document.querySelector('#form-create-user');
var userName = document.querySelector('#userName');
var p1 = document.querySelector('#password');
var p2 = document.querySelector('#password2');
var btnSubmit = document.querySelector('#btn-create-account');
var nameErr = document.querySelector('#username-err');
var pErr = document.querySelector('#password-err');
// username must be unique
userName.addEventListener('input', function(){
console.log(userName.value);
var xhr = new XMLHttpRequest();
xhr.open('POST', '/api/checkUserName');
xhr.send(userName.value);
xhr.addEventListener('readystatechange', function(){
if (xhr.readyState === 4) {
var item = xhr.responseText;
console.log(item);
if (item == 'true') {
nameErr.textContent = 'Username taken - Try another name!';
} else {
nameErr.textContent = '';
}
}
});
});
// Validate passwords
// listen for submit button click
formUser.addEventListener('submit', function(e){
var ok = validatePasswords();
if (!ok) {
e.preventDefault();
return;
}
});
function validatePasswords() {
pErr.textContent = '';
if (p1.value === '') {
pErr.textContent = 'Enter a password.';
return false;
}
if (p1.value !== p2.value) {
pErr.textContent = 'Your passwords did not match. Please re-enter your passwords.';
p1.value = '';
p2.value = '';
return false;
}
return true;
};
</script>
{{template "footer"}}
```
|
In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean formula is a formula in quantified propositional logic (also known as Second-order propositional logic) where every variable is quantified (or bound), using either existential or universal quantifiers, at the beginning of the sentence. Such a formula is equivalent to either true or false (since there are no free variables). If such a formula evaluates to true, then that formula is in the language TQBF. It is also known as QSAT (Quantified SAT).
Overview
In computational complexity theory, the quantified Boolean formula problem (QBF) is a generalization of the Boolean satisfiability problem in which both existential quantifiers and universal quantifiers can be applied to each variable. Put another way, it asks whether a quantified sentential form over a set of Boolean variables is true or false. For example, the following is an instance of QBF:
QBF is the canonical complete problem for PSPACE, the class of problems solvable by a deterministic or nondeterministic Turing machine in polynomial space and unlimited time. Given the formula in the form of an abstract syntax tree, the problem can be solved easily by a set of mutually recursive procedures which evaluate the formula. Such an algorithm uses space proportional to the height of the tree, which is linear in the worst case, but uses time exponential in the number of quantifiers.
Provided that MA ⊊ PSPACE, which is widely believed, QBF cannot be solved, nor can a given solution even be verified, in either deterministic or probabilistic polynomial time (in fact, unlike the satisfiability problem, there's no known way to specify a solution succinctly). It can be solved using an alternating Turing machine in linear time, since AP = PSPACE, where AP is the class of problems alternating machines can solve in polynomial time.
When the seminal result IP = PSPACE was shown (see interactive proof system), it was done by exhibiting an interactive proof system that could solve QBF by solving a particular arithmetization of the problem.
QBF formulas have a number of useful canonical forms. For example, it can be shown that there is a polynomial-time many-one reduction that will move all quantifiers to the front of the formula and make them alternate between universal and existential quantifiers. There is another reduction that proved useful in the IP = PSPACE proof where no more than one universal quantifier is placed between each variable's use and the quantifier binding that variable. This was critical in limiting the number of products in certain subexpressions of the arithmetization.
Prenex normal form
A fully quantified Boolean formula can be assumed to have a very specific form, called prenex normal form. It has two basic parts: a portion containing only quantifiers and a portion containing an unquantified Boolean formula usually denoted as . If there are Boolean variables, the entire formula can be written as
where every variable falls within the scope of some quantifier. By introducing dummy variables, any formula in prenex normal form can be converted into a sentence where existential and universal quantifiers alternate. Using the dummy variable ,
The second sentence has the same truth value but follows the restricted syntax. Assuming fully quantified Boolean formulas to be in prenex normal form is a frequent feature of proofs.
QBF solvers
Naïve
There is a simple recursive algorithm for determining whether a QBF is in TQBF (i.e. is true). Given some QBF
If the formula contains no quantifiers, we can just return the formula. Otherwise, we take off the first quantifier and check both possible values for the first variable:
If , then return . If , then return .
How fast does this algorithm run?
For every quantifier in the initial QBF, the algorithm makes two recursive calls on only a linearly smaller subproblem. This gives the algorithm an exponential runtime O(2n).
How much space does this algorithm use?
Within each invocation of the algorithm, it needs to store the intermediate results of computing A and B. Every recursive call takes off one quantifier, so the total recursive depth is linear in the number of quantifiers. Formulas that lack quantifiers can be evaluated in space logarithmic in the number of variables. The initial QBF was fully quantified, so there are at least as many quantifiers as variables. Thus, this algorithm uses O(n + log n) = O(n) space. This makes the TQBF language part of the PSPACE complexity class.
State of the art
Despite the PSPACE-completeness of QBF, many solvers have been developed to solve these instances. (This is analogous to the situation with SAT, the single existential quantifier version; even though it is NP-complete, it is still possible to solve many SAT instances heuristically.) The case where there are only 2 quantifiers, known as 2QBF, has received special attention.
The QBF solver competition QBFEVAL has been running more-or-less annually since 2004; solvers are required to read instances in QDIMACS format and either the QCIR or QAIGER formats. High-performing QBF solvers generally use QDPLL (a generalization of DPLL) or CEGAR. Research into QBF solving began with the development of backtracking DPLL for QBF in 1998, followed by the introduction of clause learning and variable elimination in 2002; thus, as compared to SAT solving, which has been under development since the 1960s, QBF is a relatively young field of research as of 2017.
Some prominent QBF solvers include:
CADET, which solves quantified Boolean formulas restricted to one quantifier alternation (with the ability to compute Skolem functions), based on incremental determinization and with the ability to prove its answers.
CAQE - a CEGAR-based solver for quantified Boolean formulas; winner of the recent editions of QBFEVAL.
DepQBF - a search-based solver for quantified Boolean formulas
sKizzo - the first solver ever to use symbolic skolemization, extract certificates of satisfiability, use a hybrid inference engine, implement abstract branching, deal with limited quantifiers, and enumerate valid assignments, and winner of QBFEVAL 2005, 2006, and 2007.
Applications
QBF solvers can be applied to planning (in artificial intelligence), including safe planning; the latter is critical in applications of robotics. QBF solvers can also be applied to bounded model checking as they provide a shorter encoding than would be needed for a SAT-based solver.
The evaluation of a QBF can be seen as a two-player game between a player who controls existentially quantified variables and a player who controls universally quantified variables. This makes QBFs suitable for encoding reactive synthesis problems. Similarly, QBF solvers can be used to model adversarial games in game theory. For example, QBF solvers can be used to find winning strategies for games of geography, which can then be automatically played interactively.
QBF solvers can be used for formal equivalence checking, and can also be used to synthesize Boolean functions.
Other types of problems that can be encoded as QBFs include:
Detecting whether a clause in an unsatisfiable formula in conjunctive normal form belongs to some minimally unsatisfiable subset and whether a clause in a satisfiable formula belongs to a maximally satisfiable subset
Encodings of conformant planning
ASP-related problems
Abstract argumentation
Linear temporal logic model checking
Nondeterministic finite automaton language inclusion
Synthesis and reliability of distributed systems
Extensions
In QBFEVAL 2020, a "DQBF Track" was introduced where instances were allowed to have Henkin quantifiers (expressed in DQDIMACS format).
PSPACE-completeness
The TQBF language serves in complexity theory as the canonical PSPACE-complete problem. Being PSPACE-complete means that a language is in PSPACE and that the language is also PSPACE-hard. The algorithm above shows that TQBF is in PSPACE.
Showing that TQBF is PSPACE-hard requires showing that any language in the complexity class PSPACE can be reduced to TQBF in polynomial time. I.e.,
This means that, for a PSPACE language L, whether an input is in L can be decided by checking whether is in TQBF, for some function that is required to run in polynomial time (relative to the length of the input). Symbolically,
Proving that TQBF is PSPACE-hard, requires specification of .
So, suppose that L is a PSPACE language. This means that L can be decided by a polynomial space deterministic Turing machine (DTM). This is very important for the reduction of L to TQBF, because the configurations of any such Turing Machine can be represented as Boolean formulas, with Boolean variables representing the state of the machine as well as the contents of each cell on the Turing Machine tape, with the position of the Turing Machine head encoded in the formula by the formula's ordering. In particular, our reduction will use the variables and , which represent two possible configurations of the DTM for L, and a natural number t, in constructing a QBF which is true if and only if the DTM for L can go from the configuration encoded in to the configuration encoded in in no more than t steps. The function , then, will construct from the DTM for L a QBF , where is the DTM's starting configuration, is the DTM's accepting configuration, and T is the maximum number of steps the DTM could need to move from one configuration to the other. We know that T = O(exp(nk)) for some k, where n is the length of the input, because this bounds the total number of possible configurations of the relevant DTM. Of course, it cannot take the DTM more steps than there are possible configurations to reach unless it enters a loop, in which case it will never reach anyway.
At this stage of the proof, we have already reduced the question of whether an input formula (encoded, of course, in ) is in L to the question of whether the QBF , i.e., , is in TQBF. The remainder of this proof proves that can be computed in polynomial time.
For , computation of is straightforward—either one of the configurations changes to the other in one step or it does not. Since the Turing Machine that our formula represents is deterministic, this presents no problem.
For , computation of involves a recursive evaluation, looking for a so-called "middle point" . In this case, we rewrite the formula as follows:
This converts the question of whether can reach in t steps to the question of whether reaches a middle point in steps, which itself reaches in steps. The answer to the latter question of course gives the answer to the former.
Now, t is only bounded by T, which is exponential (and so not polynomial) in the length of the input. Additionally, each recursive layer virtually doubles the length of the formula. (The variable is only one midpoint—for greater t, there are more stops along the way, so to speak.) So the time required to recursively evaluate in this manner could be exponential as well, simply because the formula could become exponentially large. This problem is solved by universally quantifying using variables and over the configuration pairs (e.g., ), which prevents the length of the formula from expanding due to recursive layers. This yields the following interpretation of :
This version of the formula can indeed be computed in polynomial time, since any one instance of it can be computed in polynomial time. The universally quantified ordered pair simply tells us that whichever choice of is made, .
Thus, , so TQBF is PSPACE-hard. Together with the above result that TQBF is in PSPACE, this completes the proof that TQBF is a PSPACE-complete language.
(This proof follows Sipser 2006 pp. 310–313 in all essentials. Papadimitriou 1994 also includes a proof.)
Miscellany
One important subproblem in TQBF is the Boolean satisfiability problem. In this problem, you wish to know whether a given Boolean formula can be made true with some assignment of variables. This is equivalent to the TQBF using only existential quantifiers: This is also an example of the larger result NP ⊆ PSPACE which follows directly from the observation that a polynomial time verifier for a proof of a language accepted by a NTM (Non-deterministic Turing machine) requires polynomial space to store the proof.
Any class in the polynomial hierarchy (PH) has TQBF as a hard problem. In other words, for the class comprising all languages L for which there exists a poly-time TM V, a verifier, such that for all input x and some constant i, which has a specific QBF formulation that is given as such that where the 's are vectors of Boolean variables.
It is important to note that while TQBF the language is defined as the collection of true quantified Boolean formulas, the abbreviation TQBF is often used (even in this article) to stand for a totally quantified Boolean formula, often simply called a QBF (quantified Boolean formula, understood as "fully" or "totally" quantified). It is important to distinguish contextually between the two uses of the abbreviation TQBF in reading the literature.
A TQBF can be thought of as a game played between two players, with alternating moves. Existentially quantified variables are equivalent to the notion that a move is available to a player at a turn. Universally quantified variables mean that the outcome of the game does not depend on what move a player makes at that turn. Also, a TQBF whose first quantifier is existential corresponds to a formula game in which the first player has a winning strategy.
A TQBF for which the quantified formula is in 2-CNF may be solved in linear time, by an algorithm involving strong connectivity analysis of its implication graph. The 2-satisfiability problem is a special case of TQBF for these formulas, in which every quantifier is existential.
There is a systematic treatment of restricted versions of quantified Boolean formulas (giving Schaefer-type classifications) provided in an expository paper by Hubie Chen.
Planar TQBF, generalizing Planar SAT, was proved PSPACE-complete by D. Lichtenstein.
Notes and references
Fortnow & Homer (2003) provides some historical background for PSPACE and TQBF.
Zhang (2003) provides some historical background of Boolean formulas.
Arora, Sanjeev. (2001). COS 522: Computational Complexity. Lecture Notes, Princeton University. Retrieved October 10, 2005.
Fortnow, Lance & Steve Homer. (2003, June). A short history of computational complexity. The Computational Complexity Column, 80. Retrieved October 9, 2005.
Papadimitriou, C. H. (1994). Computational Complexity. Reading: Addison-Wesley.
Sipser, Michael. (2006). Introduction to the Theory of Computation. Boston: Thomson Course Technology.
Zhang, Lintao. (2003). Searching for truth: Techniques for satisfiability of Boolean formulas. Retrieved October 10, 2005.
See also
Cook–Levin theorem, stating that SAT is NP-complete
Generalized geography
External links
The Quantified Boolean Formulas Library (QBFLIB)
International Workshop on Quantified Boolean Formulas
Satisfiability problems
Boolean algebra
PSPACE-complete problems
|
In algebraic number theory, a supersingular prime for a given elliptic curve is a prime number with a certain relationship to that curve. If the curve E is defined over the rational numbers, then a prime p is supersingular for E if the reduction of E modulo p is a supersingular elliptic curve over the residue field Fp.
Noam Elkies showed that every elliptic curve over the rational numbers has infinitely many supersingular primes. However, the set of supersingular primes has asymptotic density zero (if E does not have complex multiplication). conjectured that the number of supersingular primes less than a bound X is within a constant multiple of , using heuristics involving the distribution of eigenvalues of the Frobenius endomorphism. As of 2019, this conjecture is open.
More generally, if K is any global field—i.e., a finite extension either of Q or of Fp(t)—and A is an abelian variety defined over K, then a supersingular prime for A is a finite place of K such that the reduction of A modulo is a supersingular abelian variety.
References
Classes of prime numbers
Algebraic number theory
Unsolved problems in number theory
|
Aurelius Battaglia (January 16, 1910 – May 29, 1984) was an American illustrator, muralist, writer, and director.
Early life
Battaglia was born in Washington, D.C., in 1910. He was the son of Giuseppe and Concetta Battaglia, who had emigrated from Cefalù, Italy. He attended the Corcoran School of Art. He graduated, winning $50 in a Corcoran-sponsored art contest.
Battaglia married fellow student Edith Richmond after they graduated from Corcoran School of Art in 1932. They bartered paintings for dental work and other necessities. He worked as a caricaturist for The Washington Star and Reporter. In 1934, the Public Works of Art Project commissioned Battaglia to paint murals in the children's section of the library in the Mount Pleasant neighborhood of Washington where he resided. The result is a whimsical panorama of anthropomorphic animals at play, still viewable on the second floor of the Mount Pleasant Library. He later worked for the Resettlement Administration, a New Deal federal agency that, between April 1935 and December 1936, relocated struggling urban and rural families to communities planned by the federal government.
Move to California and subsequent career
Battaglia migrated west in the late 1930s and worked for the Walt Disney Studios from 1937 to 1941. Battaglia started as an in-betweener and soon after moved to the story department. He worked on Dumbo, Fantasia, and Pinocchio and is credited as one of the writers of the latter. Battaglia participated in the Disney animators' strike. He was fired but later rehired. He also worked briefly for Warner Brothers and made training films for the navy during World War II.
In the mid-1950s, Battaglia joined United Productions of America. There he directed the short film The Invisible Moustache of Raoul Dufy, which was nominated for a BAFTA award, and worked on "The Beanstalk Trial"
Battaglia was a prolific children's book illustrator, favoring bold colors and stylized pen and brush work. Titles include "Cowboy Jack, the Sheriff," "The Fire Engine Book," "Little Boy With a Big Horn," "When I Met Robin," "Captain Kangaroo's Read-Aloud Book," and "The Fireside Book of American Folk Songs." He contributed to the Childcraft book series published by Field Enterprises.
Battaglia moved to Provincetown, Massachusetts, where he continued to work until his death in May 1984.
Illustrated books
References
External links
1910 births
1984 deaths
20th-century American painters
Artists from Washington, D.C.
American illustrators
American people of Italian descent
Public Works of Art Project artists
George Washington University Corcoran School alumni
American male painters
American muralists
Walt Disney Animation Studios people
|
is a passenger railway station located in the city of Yamaguchi, Yamaguchi Prefecture, Japan. It is operated by the West Japan Railway Company (JR West).
Lines
Yotsutsuji Station is served by the JR West San'yō Main Line, and is located 454.0 kilometers from the terminus of the line at .
Station layout
The station consists of one side platform and one island platform connected by a footbridge; however, the middle track is no longer in operation. The station is unattended.
Platforms
History
Yotsutsuji Station was opened on 16 May 1920. With the privatization of the Japan National Railway (JNR) on 1 April 1987, the station came under the aegis of the West Japan railway Company (JR West).
Passenger statistics
In fiscal 2020, the station was used by an average of 273 passengers daily.
Surrounding area
Sanyo Expressway Yamaguchi south IC
Japan National Route 2
Yamaguchi Municipal Chusenji Elementary School
See also
List of railway stations in Japan
References
External links
JR West Station Official Site
Railway stations in Yamaguchi Prefecture
Sanyō Main Line
Railway stations in Japan opened in 1920
Yamaguchi (city)
|
```xml
import { ChangeDetectionStrategy, ChangeDetectorRef, Component, Input, OnChanges, OnInit } from '@angular/core';
import { Store } from '@ngxs/store';
import { IdName, LoadOpts, Project } from 'app/model/project.model';
import { EnrichProject } from 'app/store/project.action';
import { finalize } from 'rxjs/operators';
@Component({
selector: 'app-project-applications',
templateUrl: './application.list.html',
styleUrls: ['./application.list.scss'],
changeDetection: ChangeDetectionStrategy.OnPush
})
export class ProjectApplicationListComponent implements OnInit, OnChanges {
@Input() project: Project;
filter = '';
loading = true;
filteredApplications: Array<IdName> = [];
constructor(
private _store: Store,
private _cd: ChangeDetectorRef
) { }
ngOnInit(): void {
let opts: Array<LoadOpts> = [new LoadOpts('withApplicationNames', 'application_names')];
this._store.dispatch(new EnrichProject({ projectKey: this.project.key, opts }))
.pipe(finalize(() => {
this.loading = false;
this._cd.markForCheck();
}))
.subscribe();
}
ngOnChanges(): void {
this.filterChanged(this.filter);
}
filterChanged(filter: string): void {
this.filter = filter;
if (!this.filter) {
this.filteredApplications = this.project.application_names;
} else {
this.filteredApplications = (this.project.application_names ?? []).filter(app =>
app.name.toLowerCase().indexOf(this.filter.toLowerCase()) !== -1);
}
this._cd.markForCheck();
}
}
```
|
Bedford Blues are a rugby union club in the town of Bedford, England, currently playing in The RFU Championship. Bedford is one of the few towns in England where the rugby club is better supported than the football team. The Blues are a semi-pro team, with a mix of experienced and young players. The Blues are coached by Mike Rayer.
History
Foundation and 19th century
Bedford RUFC was founded in 1886 after an amalgamation between Bedford Rovers (1876) and Bedford Swifts (1882). Both parent clubs had close connections with Bedford School and Bedford Modern School, and both had fixtures with the leading teams of the period. The Bedford colours of dark and light blue are believed to be a reflection of the schoolmasters association with Oxbridge and the full badge colours are based on the strip of Swifts (black) and Rovers (cerise).
Under the captaincy of Alfred Parrott, a Bedford Modern School master, the new club made an auspicious start, losing only once in its first season (to Leicester) and again only once in its second (to a composite London XV). The early successes, however, paled before the achievements of 1893–94, when the club's reputation persuaded opponents of the stature of Stade Francais, from Paris, and the Barbarians to make the journey over. These two distinguished teams suffered the fate of all other visitors to the club's ground in that marvelous season, defeated by scores of 22–0 and 7–3 respectively in front of huge crowds. Indeed, the Club would complete its normal programme unbeaten, only to lose when somewhat understrength, in an extra match arranged as an Easter Monday attraction at Coventry (0–12). The season's final record was 29 played, 27 won, one drawn and one lost, with 521 points and only 49 against. Records created that season stood for many years and winger H.M Morris still holds the highest try-scoring tally with 38 scores in a season.
While the success on the playing field had been good there was often a problem of where to play at home. There were two main sites where pitches could be made available. One was known as 'The House of Industry' ground in Goldington Road. This was the field in front of the House of Industry -now known as the North Wing Hospital. This is approximately where Bedford play now. The other site was known as Midland Road Ground, an area near the Queen's Park railway bridge.
The first matches in 1886–87 were in Goldington Road — where the Bedford Swifts had played — but during the next few seasons several pitches near the railway station were used. It was recorded in local papers at the time that at least one game was played in the field where Queens Works now stands. The railway and industry required this land and Bedford Rugby returned to the Goldington Road area before an agreement in 1895 was reached with Bedford Cricket Club who actually held the lease. The pitch was laid out in virtually the same spot as it is now.
Beginning of the century
The club's record prior to 1905 was good enough to bring the all Blacks to the town for the first time. The match itself was a great attraction with the town's schools and factories closing for the half day to enable people to attend. The result (0–41 to New Zealand) was similar to the fate that most club sides suffered in their successful tour. Only Wales beat them.
In the seasons immediately preceding World War I the fixture list grew stronger, and the club lost only one game in 1913–14. The facilities had also improved. With a better playing arena, the first stand had been erected in 1905 and in 1910 a new pavilion was built. At that time it was considered one of the best rugby club pavilions in the country. The fact that it is still standing (now known as the 'Scrumhall' bar) is proof of the quality of workmanship and materials.
The First World War threatened the club's existence when the ground was taken over by the Military Authorities for use as an Army Camp. Things did improve very quickly and by the late twenties and early thirties Bedford once again were at the top. Even today some older supporters consider this the club's best ever period - practically every member of the team in 1938–39 was very close to international honours. Further improvements had been made at the ground, the biggest being the stand opened in 1933 which is still in use today.
Post war yo-yo era
The club recovered again after the Second World War and continued to play all the leading clubs and had a great spell in the mid sixties. There were three Bedford players regularly in the England team with David Perry and Budge Rogers captaining their county. In 1969–70 season Bedford won the Sunday Telegraph English-Welsh rugby union table. Probably, the Blues finest hour was in 1975 when Bedford, captained by Budge Rogers beat Rosslyn Park in the final of the Knock Out Cup at Twickenham 28–12. There was a gate of nearly 18,000 which at the time was a record attendance.
Unfortunately this achievement did not continue with the club having little success resulting in many players with great potential leaving the club. There were bright moments such as John Orwin captaining the England touring party to Australia and Fiji in 1988. When the leagues were introduced in 1987-88 Bedford were in Division 2, promoted to Division 1 in 1989 but relegated immediately to finish in Division 3 for a period.
The professional era
At the start of the 1996–97 season when 'The Blues' were in Division 2 the club turned professional. Frank Warren (the boxing promoter) and Sports Network putting in a big investment to secure quality players, many of whom were internationally famous, while others were young but promising. The best example is probably Scott Murray who until June 2008 was Scotland's most capped international. At the second attempt Bedford easily won the Allied Dunbar Division 2 Championship in 1998 and were promoted to Division 1 and were runners up in the Cheltenham & Gloucester Cup. Financial problems with the club's owners resulted in the club losing many players but there was a nucleus that remained loyal. The Club Coach and Director of Rugby also left.
The decline
In April 1999 Sports Network sold the club to Jefferson Lloyd International but this was a financial disaster resulting in Bedford losing further staff. The club was about to be sold and moved from the town, which would have meant the end of first class rugby in Bedford. Following intervention by the RFU in October 1999 a consortium of Bedford businessmen headed by David Ledsom (SDC), Mike Kavanagh, Geoff Irvine (Irvine-Whitlock), David Gunner and David Rawlinson with assistance from Bedford Borough Council and other professional people, the transfer of the club to Bedford Blues Ltd. was organised. Several thousand supporters and businesses in the town bought shares and the club is now viable. The club is now sponsored by Charles Wells Brewery and many other local companies. Bedford have been playing on virtually the same pitch for over 100 years and 32 players have gained International honours while they were actually playing for the club at the time of being honoured.
Stability
Mike Rayer, an ex-player of the club and Cardiff RFC, has introduced a free-flowing style which saw Bedford rise to 2nd in the league in 2006, only held back by the dominance of Harlequins, who had been demoted from the Premiership the year before.
The 2006 season had seen the commencement of a relationship with Leicester Tigers, the prominent Premiership side, which allowed some of Leicester's most promising young players to gain experience by playing for Bedford in National Division One. Within the next five years it was hoped that 50% of the club's players would have been brought into the squad through the Academy and youth teams.
The 2006–07 Academy Colts became champions of the English Colts Club Knockout Cup after beating Redruth at Franklin's Gardens. 2007–08 season saw the Colts win the cup again. Being the first Colts team to retain the cup.
Goldington Road Stadium
Goldington Road is the home ground of the Bedford Blues, with a capacity of 5,000, usually drawing 2000+ people with each home game. Towards the end of the 05–06 season, two new temporary stands were built for the big home tie against Harlequins, at one point these stands were made a long term part of the stadium, along with the grounds public house and original stand. As of the 06–07 season the extra stands have been removed.
Kit
The club kit was supplied by Kooga from at least 2004 up until the 2011–2012 season and then supplied by Zoo Sport Ltd before changing back to Gilbert on 1 September 2020. The kit is sponsored by three companies; The front of the team shirt by Blue Chip, the sleeves by Wells Bombardier and the back by Lifesure insurance.
Special events
Ladies Day
October is Breast Cancer Awareness Month and to support the charity Breast Cancer Care the Blues hold a yearly 'Ladies Day' home match at Goldington Road. The team wear a unique Kooga pink strip for the game with the playing shirts auctioned giving proceeds to Breast Cancer Care.
https://web.archive.org/web/20111003121344/https://www.medocmall.co.uk/images/theclubshop_bedford_tickets/products/large/KSSHIRT.gif
The Mobbs Memorial Match
The Mobbs Memorial Match is held annually in memory of Edgar Mobbs, an England international who was killed in the First World War. Mobbs played for Northampton and was educated at Bedford Modern School. Between 2008 and 2011 the match was played at Goldington Road between Bedford Blues and the Barbarians. From 2012 to April 2023 it was played alternately at Goldington Road and the Northampton Saints ground at Franklin's Gardens, with the host club facing the British Army team. From 2024 the match will be played as a preseason game between Bedford and Northampton.
League history
Current standings
Current squad
The Bedford Blues squad for the 2022–23 season.
International players
Martin Bayfield (England)
Lee Dickson (England)
Andy Gomarsall, (England) and (2003 World Cup Winner)
Danny Hearn, (England)
John Orwin (England)
Jeff Probyn
Paul Sackey (England)
Rory Underwood, (England) and (British Lions)
David Perry, (England)
Budge Rogers, (England) -first English player to be honoured by the Queen when he was appointed an OBE in 1969
Dick Stafford, (England)
Tony Jorden, (England)
Bob Wilkinson, (England)
Derek Wyatt, (England)
Sam Stanley, (England sevens)
Martin Offiah, (Great Britain)
Grayson Hart (Scotland)
Craig Moir (Scotland)
Scott Murray, (Scotland and British Lions)
Billy Steele (Scotland)
Clem Boyd Ireland
Corey Hircock (Ireland)
Darragh O'Mahony (Ireland)
Chris Czekaj (Wales)
Jason Forster (Wales)
Mike Rayer (Wales)
Paul Turner (Wales)
Ben Alexander (Australia)
Alistair Murdoch (Australia)
Justin Blanchet (Canada)
Norm Hadley (Canada)
James Pritchard (Canada)
Gareth Rees (Canada)
Scott Stewart(Canada)
Will Hooley (USA)
Rudolf Straeuli, (South Africa) and (1995 World Cup Winner)
Junior Paramore (Samoa
Soane Tongaʻuiha (Tonga and Pacific Islanders)
Marco Rivaro (Italy)
Matthew Cook, (Spain)
Martina Sharp, (Slovakia 7s Women)
Honours
Men's honours
John Player Cup winners: 1975
Courage League Division Three champions: 1994–95
Allied Dunbar Premiership Division Two champions: 1997–98
Powergen Shield winners: 2005
Women's honours
RFU NC3 Midlands (central) champions: 2021-22
Bedford Blues Women
Back in 2017 the Bedford Blues produced a development plan to help further grow female participation in the game of rugby in the town of Bedford and the surrounding area. The plan initially included the development of school aged rugby, providing rugby for girls aged 11 to 17. Over the following three seasons the Bedford Blues successfully set up and run three separate age group teams; U13s, U15s & U18s. With numbers across all three age groups rapidly growing, a realisation that there was no clear pathway for the girls to follow locally in Women’s rugby was recognised. The development plan was updated to include the goal of creating a Women’s rugby team under the Bedford rugby umbrella.
The idea then became a reality in January 2020 when the first training session was held with 12 players attending on a cold Saturday morning. The team continued to increase its numbers over the preceding year, even during the COVID-19 situation, building up a healthy roster of over 30 players. The following season (2021–22) the Bedford Blues Women became a league team, playing in the NC3 Midlands (Central) League, led by head coach Mark Stapley. The Bedford Blues Women play their home matches at Goldington Rd and at Bedford Athletic RFC ground.
On Sunday 10 October 2021, Emma Graham made history by being the first player to score points for the Bedford Blues Women Rugby Union Team during their first match against Shelford Nomads, played at Goldington Rd (with the Blues Women winning 31-0)
The 2022-23 season sees the Bedford Blues Women competing in NC2 Midlands (Central), coached by Peter Frost and Daryl Veenendaal, they will be playing 4 games at Goldington Road.
For the 2023-24 season, the women's side will be playing all their home matches at Goldington Road, and competing in NC2 Midlands (South).
References
External links
Rugby union teams in England
Premiership Rugby teams
Rugby clubs established in 1886
Rugby union in Bedfordshire
Sport in Bedford
1886 establishments in England
|
Babeque Secundaria is a high school in the Dominican Republic.
References
External links
Babeque secundaria homepage (in Spanish)
Schools in the Dominican Republic
|
```objective-c
#ifndef PopcornTimetvOS_Bridging_Header_h
#define PopcornTimetvOS_Bridging_Header_h
#import <TVVLCKit/TVVLCKit.h>
#import "NSObject+Swift_Observer.h"
#import <ifaddrs.h>
#endif
```
|
Safarabad-e Chin (, also Romanized as Şafarābād-e Chīn; also known as Şafarābād and Z̧afarābād) is a village in Chin Rural District, Ludab District, Boyer-Ahmad County, Kohgiluyeh and Boyer-Ahmad Province, Iran. At the 2006 census, its population was 219, in 42 families.
References
Populated places in Boyer-Ahmad County
|
```python
from QRec import QRec
from util.config import ModelConf
if __name__ == '__main__':
print('='*80)
print(' QRec: An effective python-based recommendation model library. ')
print('='*80)
# print('0. Analyze the input data.(Configure the visual.conf in config/visual first.)')
# print('-' * 80)
print('Generic Recommenders:')
print('1. UserKNN 2. ItemKNN 3. BasicMF 4. SlopeOne 5. SVD')
print('6. PMF 7. SVD++ 8. EE 9. BPR 10. WRMF')
print('11. ExpoMF')
print('MF-based Social Recommenders:')
print('s1. RSTE s2. SoRec s3. SoReg s4. SocialMF s5. SBPR')
print('s6. SREE s7. LOCABAL s8. SocialFD s9. TBPR s10. SERec')
print('Network Embedding based Recommenders:')
print('a1. CoFactor a2. CUNE-MF a3. CUNE-BPR a4. IF-BPR')
print('DNNs-based Recommenders:')
print('d1. APR d2. CDAE d3. DMF d4. NeuMF d5. CFGAN')
print('d6. IRGAN d7. RSGAN')
print('GNNs-based Recommenders:')
print('g1. NGCF g2. LightGCN g3. ESRF g4. DHCF g5. DiffNet')
print('Self-Supervised Recommenders:')
print('q1. SGL q2. SEPT q3. BUIR q4. MHCN q5. SimGCL')
print('Basic Methods:')
print('b1. UserMean b2. ItemMean b3. MostPopular b4. Rand')
print('='*80)
num = input('please enter the number of the model you want to run:')
import time
s = time.time()
#Register your model here and add the conf file into the config directory
models = {'1':'UserKNN','2':'ItemKNN','3':'BasicMF','4':'SlopeOne','5':'SVD','6':'PMF',
'7':'SVD++','8':'EE','9':'BPR','10':'WRMF','11':'ExpoMF',
's1':'RSTE','s2':'SoRec','s3':'SoReg','s4':'SocialMF','s5':'SBPR','s6':'SREE',
's7':'LOCABAL','s8':'SocialFD','s9':'TBPR','s10':'SEREC','a1':'CoFactor',
'a2':'CUNE_MF','a3':'CUNE_BPR','a4':'IF_BPR',
'd1':'APR','d2':'CDAE','d3':'DMF','d4':'NeuMF','d5':'CFGAN','d6':'IRGAN','d7':'RSGAN',
'g1':'NGCF', 'g2':'LightGCN', 'g3':'ESRF', 'g4':'DHCF', 'g5':'DiffNet',
'q1':'SGL', 'q2':'SEPT', 'q3':'BUIR', 'q4':'MHCN', 'q5':'SimGCL',
'b1':'UserMean','b2':'ItemMean','b3':'MostPopular','b4':'Rand'}
try:
conf = ModelConf('./config/' + models[num] + '.conf')
except KeyError:
print('wrong num!')
exit(-1)
recSys = QRec(conf)
recSys.execute()
e = time.time()
print("Running time: %f s" % (e - s))
```
|
```xml
<clickhouse>
<logger>
<level>trace</level>
<log>/var/log/clickhouse-server/clickhouse-server.log</log>
<errorlog>/var/log/clickhouse-server/clickhouse-server.err.log</errorlog>
<size>1000M</size>
<count>10</count>
</logger>
<tcp_port>9000</tcp_port>
<listen_host>127.0.0.1</listen_host>
<openSSL>
<client>
<cacheSessions>true</cacheSessions>
<verificationMode>none</verificationMode>
<invalidCertificateHandler>
<name>AcceptCertificateHandler</name>
</invalidCertificateHandler>
</client>
</openSSL>
<max_concurrent_queries>500</max_concurrent_queries>
<path>./clickhouse/</path>
<users_config>users.xml</users_config>
<dictionaries_config>/etc/clickhouse-server/config.d/*.xml</dictionaries_config>
</clickhouse>
```
|
Rowan McNamara is an Aboriginal Australian actor, best known for his role in Samson and Delilah.
Career
McNamara's first acting role was in the 2009 Australian film, Samson and Delilah. He had the lead role in this film, playing the title character of Samson. His role led him to win an Inside Film Award for best actor and he was nominated for the best lead actor award in the 2009 Australian Film Institute Awards .
In 2015, McNamara received a suspended jail sentence for contravening a domestic violence order.
References
External links
IMDB news for Rowan McNamara
Year of birth missing (living people)
Living people
Australian male film actors
Indigenous Australian male actors
|
```ocaml
(*
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*)
(* This lists two valid unicode point ranges in tuple format.
see more details in path_to_url
TODO: store it in a flat array
add more docs
*)
[@@@ocamlformat "disable"]
(* JS has stricter rules with start id *)
let id_start = [|36,37;65,91;95,96;97,123;170,171;181,182;186,187;192,215;216,247;248,706;710,722;736,741;748,749;750,751;880,885;886,888;890,894;895,896;902,903;904,907;908,909;910,930;931,1014;1015,1154;1162,1328;1329,1367;1369,1370;1376,1417;1488,1515;1519,1523;1568,1611;1646,1648;1649,1748;1749,1750;1765,1767;1774,1776;1786,1789;1791,1792;1808,1809;1810,1840;1869,1958;1969,1970;1994,2027;2036,2038;2042,2043;2048,2070;2074,2075;2084,2085;2088,2089;2112,2137;2144,2155;2208,2229;2230,2238;2308,2362;2365,2366;2384,2385;2392,2402;2417,2433;2437,2445;2447,2449;2451,2473;2474,2481;2482,2483;2486,2490;2493,2494;2510,2511;2524,2526;2527,2530;2544,2546;2556,2557;2565,2571;2575,2577;2579,2601;2602,2609;2610,2612;2613,2615;2616,2618;2649,2653;2654,2655;2674,2677;2693,2702;2703,2706;2707,2729;2730,2737;2738,2740;2741,2746;2749,2750;2768,2769;2784,2786;2809,2810;2821,2829;2831,2833;2835,2857;2858,2865;2866,2868;2869,2874;2877,2878;2908,2910;2911,2914;2929,2930;2947,2948;2949,2955;2958,2961;2962,2966;2969,2971;2972,2973;2974,2976;2979,2981;2984,2987;2990,3002;3024,3025;3077,3085;3086,3089;3090,3113;3114,3130;3133,3134;3160,3163;3168,3170;3200,3201;3205,3213;3214,3217;3218,3241;3242,3252;3253,3258;3261,3262;3294,3295;3296,3298;3313,3315;3333,3341;3342,3345;3346,3387;3389,3390;3406,3407;3412,3415;3423,3426;3450,3456;3461,3479;3482,3506;3507,3516;3517,3518;3520,3527;3585,3633;3634,3636;3648,3655;3713,3715;3716,3717;3718,3723;3724,3748;3749,3750;3751,3761;3762,3764;3773,3774;3776,3781;3782,3783;3804,3808;3840,3841;3904,3912;3913,3949;3976,3981;4096,4139;4159,4160;4176,4182;4186,4190;4193,4194;4197,4199;4206,4209;4213,4226;4238,4239;4256,4294;4295,4296;4301,4302;4304,4347;4348,4681;4682,4686;4688,4695;4696,4697;4698,4702;4704,4745;4746,4750;4752,4785;4786,4790;4792,4799;4800,4801;4802,4806;4808,4823;4824,4881;4882,4886;4888,4955;4992,5008;5024,5110;5112,5118;5121,5741;5743,5760;5761,5787;5792,5867;5870,5881;5888,5901;5902,5906;5920,5938;5952,5970;5984,5997;5998,6001;6016,6068;6103,6104;6108,6109;6176,6265;6272,6313;6314,6315;6320,6390;6400,6431;6480,6510;6512,6517;6528,6572;6576,6602;6656,6679;6688,6741;6823,6824;6917,6964;6981,6988;7043,7073;7086,7088;7098,7142;7168,7204;7245,7248;7258,7294;7296,7305;7312,7355;7357,7360;7401,7405;7406,7412;7413,7415;7418,7419;7424,7616;7680,7958;7960,7966;7968,8006;8008,8014;8016,8024;8025,8026;8027,8028;8029,8030;8031,8062;8064,8117;8118,8125;8126,8127;8130,8133;8134,8141;8144,8148;8150,8156;8160,8173;8178,8181;8182,8189;8305,8306;8319,8320;8336,8349;8450,8451;8455,8456;8458,8468;8469,8470;8472,8478;8484,8485;8486,8487;8488,8489;8490,8506;8508,8512;8517,8522;8526,8527;8544,8585;11264,11311;11312,11359;11360,11493;11499,11503;11506,11508;11520,11558;11559,11560;11565,11566;11568,11624;11631,11632;11648,11671;11680,11687;11688,11695;11696,11703;11704,11711;11712,11719;11720,11727;11728,11735;11736,11743;12293,12296;12321,12330;12337,12342;12344,12349;12353,12439;12443,12448;12449,12539;12540,12544;12549,12592;12593,12687;12704,12731;12784,12800;13312,19894;19968,40944;40960,42125;42192,42238;42240,42509;42512,42528;42538,42540;42560,42607;42623,42654;42656,42736;42775,42784;42786,42889;42891,42944;42946,42951;42999,43010;43011,43014;43015,43019;43020,43043;43072,43124;43138,43188;43250,43256;43259,43260;43261,43263;43274,43302;43312,43335;43360,43389;43396,43443;43471,43472;43488,43493;43494,43504;43514,43519;43520,43561;43584,43587;43588,43596;43616,43639;43642,43643;43646,43696;43697,43698;43701,43703;43705,43710;43712,43713;43714,43715;43739,43742;43744,43755;43762,43765;43777,43783;43785,43791;43793,43799;43808,43815;43816,43823;43824,43867;43868,43880;43888,44003;44032,55204;55216,55239;55243,55292;63744,64110;64112,64218;64256,64263;64275,64280;64285,64286;64287,64297;64298,64311;64312,64317;64318,64319;64320,64322;64323,64325;64326,64434;64467,64830;64848,64912;64914,64968;65008,65020;65136,65141;65142,65277;65313,65339;65345,65371;65382,65471;65474,65480;65482,65488;65490,65496;65498,65501;65536,65548;65549,65575;65576,65595;65596,65598;65599,65614;65616,65630;65664,65787;65856,65909;66176,66205;66208,66257;66304,66336;66349,66379;66384,66422;66432,66462;66464,66500;66504,66512;66513,66518;66560,66718;66736,66772;66776,66812;66816,66856;66864,66916;67072,67383;67392,67414;67424,67432;67584,67590;67592,67593;67594,67638;67639,67641;67644,67645;67647,67670;67680,67703;67712,67743;67808,67827;67828,67830;67840,67862;67872,67898;67968,68024;68030,68032;68096,68097;68112,68116;68117,68120;68121,68150;68192,68221;68224,68253;68288,68296;68297,68325;68352,68406;68416,68438;68448,68467;68480,68498;68608,68681;68736,68787;68800,68851;68864,68900;69376,69405;69415,69416;69424,69446;69600,69623;69635,69688;69763,69808;69840,69865;69891,69927;69956,69957;69968,70003;70006,70007;70019,70067;70081,70085;70106,70107;70108,70109;70144,70162;70163,70188;70272,70279;70280,70281;70282,70286;70287,70302;70303,70313;70320,70367;70405,70413;70415,70417;70419,70441;70442,70449;70450,70452;70453,70458;70461,70462;70480,70481;70493,70498;70656,70709;70727,70731;70751,70752;70784,70832;70852,70854;70855,70856;71040,71087;71128,71132;71168,71216;71236,71237;71296,71339;71352,71353;71424,71451;71680,71724;71840,71904;71935,71936;72096,72104;72106,72145;72161,72162;72163,72164;72192,72193;72203,72243;72250,72251;72272,72273;72284,72330;72349,72350;72384,72441;72704,72713;72714,72751;72768,72769;72818,72848;72960,72967;72968,72970;72971,73009;73030,73031;73056,73062;73063,73065;73066,73098;73112,73113;73440,73459;73728,74650;74752,74863;74880,75076;77824,78895;82944,83527;92160,92729;92736,92767;92880,92910;92928,92976;92992,92996;93027,93048;93053,93072;93760,93824;93952,94027;94032,94033;94099,94112;94176,94178;94179,94180;94208,100344;100352,101107;110592,110879;110928,110931;110948,110952;110960,111356;113664,113771;113776,113789;113792,113801;113808,113818;119808,119893;119894,119965;119966,119968;119970,119971;119973,119975;119977,119981;119982,119994;119995,119996;119997,120004;120005,120070;120071,120075;120077,120085;120086,120093;120094,120122;120123,120127;120128,120133;120134,120135;120138,120145;120146,120486;120488,120513;120514,120539;120540,120571;120572,120597;120598,120629;120630,120655;120656,120687;120688,120713;120714,120745;120746,120771;120772,120780;123136,123181;123191,123198;123214,123215;123584,123628;124928,125125;125184,125252;125259,125260;126464,126468;126469,126496;126497,126499;126500,126501;126503,126504;126505,126515;126516,126520;126521,126522;126523,126524;126530,126531;126535,126536;126537,126538;126539,126540;126541,126544;126545,126547;126548,126549;126551,126552;126553,126554;126555,126556;126557,126558;126559,126560;126561,126563;126564,126565;126567,126571;126572,126579;126580,126584;126585,126589;126590,126591;126592,126602;126603,126620;126625,126628;126629,126634;126635,126652;131072,173783;173824,177973;177984,178206;178208,183970;183984,191457;194560,195102|]
(* The followed ID restriction is relaxed, this one
is used in our customized unicode lexing.
*)
let id_continue = [|36,37;48,58;65,91;95,96;97,123;170,171;181,182;183,184;186,187;192,215;216,247;248,706;710,722;736,741;748,749;750,751;768,885;886,888;890,894;895,896;902,907;908,909;910,930;931,1014;1015,1154;1155,1160;1162,1328;1329,1367;1369,1370;1376,1417;1425,1470;1471,1472;1473,1475;1476,1478;1479,1480;1488,1515;1519,1523;1552,1563;1568,1642;1646,1748;1749,1757;1759,1769;1770,1789;1791,1792;1808,1867;1869,1970;1984,2038;2042,2043;2045,2046;2048,2094;2112,2140;2144,2155;2208,2229;2230,2238;2259,2274;2275,2404;2406,2416;2417,2436;2437,2445;2447,2449;2451,2473;2474,2481;2482,2483;2486,2490;2492,2501;2503,2505;2507,2511;2519,2520;2524,2526;2527,2532;2534,2546;2556,2557;2558,2559;2561,2564;2565,2571;2575,2577;2579,2601;2602,2609;2610,2612;2613,2615;2616,2618;2620,2621;2622,2627;2631,2633;2635,2638;2641,2642;2649,2653;2654,2655;2662,2678;2689,2692;2693,2702;2703,2706;2707,2729;2730,2737;2738,2740;2741,2746;2748,2758;2759,2762;2763,2766;2768,2769;2784,2788;2790,2800;2809,2816;2817,2820;2821,2829;2831,2833;2835,2857;2858,2865;2866,2868;2869,2874;2876,2885;2887,2889;2891,2894;2902,2904;2908,2910;2911,2916;2918,2928;2929,2930;2946,2948;2949,2955;2958,2961;2962,2966;2969,2971;2972,2973;2974,2976;2979,2981;2984,2987;2990,3002;3006,3011;3014,3017;3018,3022;3024,3025;3031,3032;3046,3056;3072,3085;3086,3089;3090,3113;3114,3130;3133,3141;3142,3145;3146,3150;3157,3159;3160,3163;3168,3172;3174,3184;3200,3204;3205,3213;3214,3217;3218,3241;3242,3252;3253,3258;3260,3269;3270,3273;3274,3278;3285,3287;3294,3295;3296,3300;3302,3312;3313,3315;3328,3332;3333,3341;3342,3345;3346,3397;3398,3401;3402,3407;3412,3416;3423,3428;3430,3440;3450,3456;3458,3460;3461,3479;3482,3506;3507,3516;3517,3518;3520,3527;3530,3531;3535,3541;3542,3543;3544,3552;3558,3568;3570,3572;3585,3643;3648,3663;3664,3674;3713,3715;3716,3717;3718,3723;3724,3748;3749,3750;3751,3774;3776,3781;3782,3783;3784,3790;3792,3802;3804,3808;3840,3841;3864,3866;3872,3882;3893,3894;3895,3896;3897,3898;3902,3912;3913,3949;3953,3973;3974,3992;3993,4029;4038,4039;4096,4170;4176,4254;4256,4294;4295,4296;4301,4302;4304,4347;4348,4681;4682,4686;4688,4695;4696,4697;4698,4702;4704,4745;4746,4750;4752,4785;4786,4790;4792,4799;4800,4801;4802,4806;4808,4823;4824,4881;4882,4886;4888,4955;4957,4960;4969,4978;4992,5008;5024,5110;5112,5118;5121,5741;5743,5760;5761,5787;5792,5867;5870,5881;5888,5901;5902,5909;5920,5941;5952,5972;5984,5997;5998,6001;6002,6004;6016,6100;6103,6104;6108,6110;6112,6122;6155,6158;6160,6170;6176,6265;6272,6315;6320,6390;6400,6431;6432,6444;6448,6460;6470,6510;6512,6517;6528,6572;6576,6602;6608,6619;6656,6684;6688,6751;6752,6781;6783,6794;6800,6810;6823,6824;6832,6846;6912,6988;6992,7002;7019,7028;7040,7156;7168,7224;7232,7242;7245,7294;7296,7305;7312,7355;7357,7360;7376,7379;7380,7419;7424,7674;7675,7958;7960,7966;7968,8006;8008,8014;8016,8024;8025,8026;8027,8028;8029,8030;8031,8062;8064,8117;8118,8125;8126,8127;8130,8133;8134,8141;8144,8148;8150,8156;8160,8173;8178,8181;8182,8189;8204,8206;8255,8257;8276,8277;8305,8306;8319,8320;8336,8349;8400,8413;8417,8418;8421,8433;8450,8451;8455,8456;8458,8468;8469,8470;8472,8478;8484,8485;8486,8487;8488,8489;8490,8506;8508,8512;8517,8522;8526,8527;8544,8585;11264,11311;11312,11359;11360,11493;11499,11508;11520,11558;11559,11560;11565,11566;11568,11624;11631,11632;11647,11671;11680,11687;11688,11695;11696,11703;11704,11711;11712,11719;11720,11727;11728,11735;11736,11743;11744,11776;12293,12296;12321,12336;12337,12342;12344,12349;12353,12439;12441,12448;12449,12539;12540,12544;12549,12592;12593,12687;12704,12731;12784,12800;13312,19894;19968,40944;40960,42125;42192,42238;42240,42509;42512,42540;42560,42608;42612,42622;42623,42738;42775,42784;42786,42889;42891,42944;42946,42951;42999,43048;43072,43124;43136,43206;43216,43226;43232,43256;43259,43260;43261,43310;43312,43348;43360,43389;43392,43457;43471,43482;43488,43519;43520,43575;43584,43598;43600,43610;43616,43639;43642,43715;43739,43742;43744,43760;43762,43767;43777,43783;43785,43791;43793,43799;43808,43815;43816,43823;43824,43867;43868,43880;43888,44011;44012,44014;44016,44026;44032,55204;55216,55239;55243,55292;63744,64110;64112,64218;64256,64263;64275,64280;64285,64297;64298,64311;64312,64317;64318,64319;64320,64322;64323,64325;64326,64434;64467,64830;64848,64912;64914,64968;65008,65020;65024,65040;65056,65072;65075,65077;65101,65104;65136,65141;65142,65277;65296,65306;65313,65339;65343,65344;65345,65371;65382,65471;65474,65480;65482,65488;65490,65496;65498,65501;65536,65548;65549,65575;65576,65595;65596,65598;65599,65614;65616,65630;65664,65787;65856,65909;66045,66046;66176,66205;66208,66257;66272,66273;66304,66336;66349,66379;66384,66427;66432,66462;66464,66500;66504,66512;66513,66518;66560,66718;66720,66730;66736,66772;66776,66812;66816,66856;66864,66916;67072,67383;67392,67414;67424,67432;67584,67590;67592,67593;67594,67638;67639,67641;67644,67645;67647,67670;67680,67703;67712,67743;67808,67827;67828,67830;67840,67862;67872,67898;67968,68024;68030,68032;68096,68100;68101,68103;68108,68116;68117,68120;68121,68150;68152,68155;68159,68160;68192,68221;68224,68253;68288,68296;68297,68327;68352,68406;68416,68438;68448,68467;68480,68498;68608,68681;68736,68787;68800,68851;68864,68904;68912,68922;69376,69405;69415,69416;69424,69457;69600,69623;69632,69703;69734,69744;69759,69819;69840,69865;69872,69882;69888,69941;69942,69952;69956,69959;69968,70004;70006,70007;70016,70085;70089,70093;70096,70107;70108,70109;70144,70162;70163,70200;70206,70207;70272,70279;70280,70281;70282,70286;70287,70302;70303,70313;70320,70379;70384,70394;70400,70404;70405,70413;70415,70417;70419,70441;70442,70449;70450,70452;70453,70458;70459,70469;70471,70473;70475,70478;70480,70481;70487,70488;70493,70500;70502,70509;70512,70517;70656,70731;70736,70746;70750,70752;70784,70854;70855,70856;70864,70874;71040,71094;71096,71105;71128,71134;71168,71233;71236,71237;71248,71258;71296,71353;71360,71370;71424,71451;71453,71468;71472,71482;71680,71739;71840,71914;71935,71936;72096,72104;72106,72152;72154,72162;72163,72165;72192,72255;72263,72264;72272,72346;72349,72350;72384,72441;72704,72713;72714,72759;72760,72769;72784,72794;72818,72848;72850,72872;72873,72887;72960,72967;72968,72970;72971,73015;73018,73019;73020,73022;73023,73032;73040,73050;73056,73062;73063,73065;73066,73103;73104,73106;73107,73113;73120,73130;73440,73463;73728,74650;74752,74863;74880,75076;77824,78895;82944,83527;92160,92729;92736,92767;92768,92778;92880,92910;92912,92917;92928,92983;92992,92996;93008,93018;93027,93048;93053,93072;93760,93824;93952,94027;94031,94088;94095,94112;94176,94178;94179,94180;94208,100344;100352,101107;110592,110879;110928,110931;110948,110952;110960,111356;113664,113771;113776,113789;113792,113801;113808,113818;113821,113823;119141,119146;119149,119155;119163,119171;119173,119180;119210,119214;119362,119365;119808,119893;119894,119965;119966,119968;119970,119971;119973,119975;119977,119981;119982,119994;119995,119996;119997,120004;120005,120070;120071,120075;120077,120085;120086,120093;120094,120122;120123,120127;120128,120133;120134,120135;120138,120145;120146,120486;120488,120513;120514,120539;120540,120571;120572,120597;120598,120629;120630,120655;120656,120687;120688,120713;120714,120745;120746,120771;120772,120780;120782,120832;121344,121399;121403,121453;121461,121462;121476,121477;121499,121504;121505,121520;122880,122887;122888,122905;122907,122914;122915,122917;122918,122923;123136,123181;123184,123198;123200,123210;123214,123215;123584,123642;124928,125125;125136,125143;125184,125260;125264,125274;126464,126468;126469,126496;126497,126499;126500,126501;126503,126504;126505,126515;126516,126520;126521,126522;126523,126524;126530,126531;126535,126536;126537,126538;126539,126540;126541,126544;126545,126547;126548,126549;126551,126552;126553,126554;126555,126556;126557,126558;126559,126560;126561,126563;126564,126565;126567,126571;126572,126579;126580,126584;126585,126589;126590,126591;126592,126602;126603,126620;126625,126628;126629,126634;126635,126652;131072,173783;173824,177973;177984,178206;178208,183970;183984,191457;194560,195102;917760,918000|]
```
|
Mashpee Wampanoag Indian Museum is a cultural center in the town of Mashpee in Barnstable County, Massachusetts, United States. The town of Mashpee is the location of the Mashpee Wampanoag Tribe, one of the two federally recognized representative bodies of the Wampanoag people. The museum ground itself is well known for the Avant House as well as hosting the Mill Pond Herring Ladder, a Fish ladder on the Mashpee River. The museum was established in 1997 through a town meeting vote. Since 1999 the site has been listed under the National Register of Historic Places.
References
External links
Mashpee Wampanoag Indian Museum - official website
Museums in Barnstable County, Massachusetts
Native American museums in Massachusetts
Mashpee Wampanoag Tribe
Mashpee, Massachusetts
National Register of Historic Places in Massachusetts
|
```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 com.google.training.appdev.console;
/*
*
*
* 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 com.fasterxml.jackson.databind.ObjectMapper;
import com.google.cloud.pubsub.v1.AckReplyConsumer;
import com.google.cloud.pubsub.v1.MessageReceiver;
import com.google.cloud.pubsub.v1.Subscriber;
import com.google.cloud.pubsub.v1.SubscriptionAdminClient;
import com.google.common.util.concurrent.MoreExecutors;
import com.google.pubsub.v1.PubsubMessage;
import com.google.pubsub.v1.PushConfig;
import com.google.pubsub.v1.SubscriptionName;
import com.google.pubsub.v1.TopicName;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import com.google.training.appdev.services.gcp.domain.Feedback;
import com.google.training.appdev.services.gcp.languageapi.LanguageService;
import com.google.training.appdev.services.gcp.spanner.SpannerService;
public class ConsoleApp {
public static void main(String... args) throws Exception {
Logger logger = LoggerFactory.getLogger(ConsoleApp.class);
String projectId = System.getenv("GCLOUD_PROJECT");
TopicName topic = TopicName.create(projectId, "feedback");
LanguageService languageService = LanguageService.create();
SpannerService spannerService = SpannerService.create();
SubscriptionName subscription = SubscriptionName.create(projectId, "worker-subscription");
System.out.println("Starting...");
try (SubscriptionAdminClient subscriptionAdminClient = SubscriptionAdminClient.create()) {
System.out.println("Creating subscription...");
subscriptionAdminClient.createSubscription(subscription, topic, PushConfig.getDefaultInstance(), 0);
System.out.println("Created.");
} catch (Exception e) { // probably the subscription already exists...
logger.error("Subscription creation failed: "+ e.getMessage());
e.printStackTrace();
}
MessageReceiver receiver =
new MessageReceiver() {
@Override
public void receiveMessage(PubsubMessage message, AckReplyConsumer consumer) {
String fb = message.getData().toStringUtf8();
consumer.ack();
logger.info("\n\n**************\n\nId : " + message.getMessageId());
logger.info("\n\n**************\n\nData : " + fb);
consumer.ack();
try {
ObjectMapper mapper = new ObjectMapper();
Feedback feedback = mapper.readValue(fb, Feedback.class);
float sentimentScore = languageService.analyseSentiment(feedback.getFeedback());
feedback.setSentimentScore(sentimentScore);
spannerService.insertFeedback(feedback);
} catch (Exception e) {
logger.error("PubSub receiver failed: "+ e.getMessage());
e.printStackTrace();
}
}
};
Subscriber subscriber = null;
try {
subscriber = Subscriber.defaultBuilder(subscription, receiver).build();
subscriber.addListener(
new Subscriber.Listener() {
@Override
public void failed(Subscriber.State from, Throwable failure) {
// Handle failure. This is called when the Subscriber encountered a fatal error and is shutting down.
System.err.println(failure);
}
},
MoreExecutors.directExecutor());
subscriber.startAsync().awaitRunning();
// Gosh this feels hacky...
Object o = new Object();
synchronized (o) {
o.wait();
}
} finally {
if (subscriber != null) {
subscriber.stopAsync().awaitTerminated();
}
try (SubscriptionAdminClient subscriptionAdminClient = SubscriptionAdminClient.create()) {
System.out.println("Deleting subscription...");
subscriptionAdminClient.deleteSubscription(subscription);
System.out.println("Deleted.");
}
}
}
}
// import com.fasterxml.jackson.databind.ObjectMapper;
// import com.google.cloud.pubsub.v1.AckReplyConsumer;
// import com.google.cloud.pubsub.v1.MessageReceiver;
// import com.google.cloud.pubsub.v1.Subscriber;
// import com.google.pubsub.v1.PubsubMessage;
// import com.google.pubsub.v1.SubscriptionName;
// import com.google.training.appdev.services.gcp.domain.Feedback;
// import com.google.training.appdev.services.gcp.languageapi.LanguageService;
// import com.google.training.appdev.services.gcp.spanner.SpannerService;
// import org.slf4j.Logger;
// import org.slf4j.LoggerFactory;
// public class ConsoleApp {
// public static void main(String ...args) throws Exception{
// Logger logger = LoggerFactory.getLogger(ConsoleApp.class);
// String projectId = System.getenv("GCLOUD_PROJECT");
// String subscriptionId = "cloud-shell-subscription";
// LanguageService languageService = LanguageService.create();
// SpannerService spannerService = SpannerService.create();
// SubscriptionName subscriptionName = SubscriptionName.create(projectId, subscriptionId);
// logger.info("Subscription name:" + subscriptionName.toString());
// MessageReceiver receiver =
// new MessageReceiver() {
// @Override
// public void receiveMessage(PubsubMessage message, AckReplyConsumer consumer){
// String fb = message.getData().toStringUtf8();
// logger.info("\n\n**************\n\nId : " + message.getMessageId());
// logger.info("\n\n**************\n\nData : " + fb);
// consumer.ack();
// try {
// ObjectMapper mapper = new ObjectMapper();
// Feedback feedback = mapper.readValue(fb, Feedback.class);
// float sentimentScore = languageService.analyseSentiment(feedback.getFeedback());
// feedback.setSentimentScore(sentimentScore);
// spannerService.insertFeedback(feedback);
// } catch (Exception e) {
// logger.error("PubSub receiver failed: "+ e.getMessage());
// e.printStackTrace();
// }
// }
// };
// Subscriber subscriber = null;
// try {
// subscriber = Subscriber.defaultBuilder(subscriptionName, receiver).build();
// logger.info("*** Starting Async Receiver");
// subscriber.startAsync();
// logger.info("*** Waiting for Messages");
// System.in.read();
// } finally {
// if (subscriber != null) {
// subscriber.stopAsync();
// }
// }
// }
// }
```
|
Octiabr' V. Emelianenko (7 November 1926, Leningrad - 27 May 2012, Saint Petersburg) was a Soviet physicist, Ph.D. in Physics and Mathematical Sciences. He did fundamental work in physics of III-V compound semiconductors, and made significant contributions to pave the way for the creation of the first semiconductor laser, optoelectronics, LEDs, solar cells, infrared detectors and other semiconductor devices.
Biography
In 1945 he was called up for military service at the age of seventeen. Location Service - Eastern Front. After the Second World War was to re-enlist. While serving in the army in absentia received secondary and higher education. He graduated from the Physics Faculty of Saint Petersburg State University, enrolled in graduate school. From 1955 to 1989 he worked in the Laboratory of Semiconductor Nasledov D.(Ioffe Physical-Technical Institute of the Russian Academy of Sciences)
Scientific work
Studies of III–V compounds in the Soviet Union were started in the early 1950s at the Physical-Technical Institute, USSR Academy of Sciences. In 1950, N. Goryunovа and A. Regel opened their semiconducting properties of III-V compounds on the example of indium antimonide
In the 1950s only the laboratory of Professor Heinrich Welker in Germany, and laboratory Dmitriy N. Nasledov in the Ioffe Physical-Technical Institute, USSR Academy of Sciences were engaged in studies of III–V compounds. All scientists in the field of semiconductors concentrated almost exclusively on germanium and silicon. It seemed that these elemental semiconductors, which brought electronics to a new level, could not be surpassed by any compound semiconductor.
The first significant report on studies of III–V semi-conductors (InSb, InAs) at the Physical-Technical Institute was made by Nasledov at the First All-Union Conference on Semiconductors (Leningrad, 1956). He mentioned (among other phenomena) that neither electrical conductivity nor the Hall effect depend on temperature in new III–V compounds. Many scientists considered this observation strange and even accidental. However, it was found shortly afterwards that the above temperature independence is the consequence of profound degeneracy in the electron gas, which is typical of heavily doped (then, simply “impure”) III–V crystals. Fundamentally new phenomena in these crystals gave rise to a new field in the physics of semiconductors, specifically, the physics of heavily doped semiconductors. This researches was conducted group headed by O. Emelianenko in the laboratory D. Nasledov
A team led by O. Emelianenko continued fundamental research of phenomena transport in a wide class of III-V compounds (solid solutions and structures). The most interesting were: the study of the impurity band; Later, discovery of giant magnetoresistance when driving vehicles on impurities; the investigation of the metal–semiconductor transition in various materials compounds III–V, as well as the determination of the origin of negative (quantum) magnetoresistance (discovered by a team Emelianenko even earlier, in 1958).
The results obtained by O. Emelianenko and his team are included in the modern understanding of semiconducting properties of compounds III-V.
References
Links
https://books.google.com/books?id=r-WzXVaKctIC&dq=GaAs++Nasledov+Emel%E2%80%99yanenko&pg=PA468
http://dn.nasledov.com/nasledov.pdf
http://library.eltech.ru/cgi-bin/irbis64r_11/cgiirbis_64.exe?LNG=&P21DBN=GK&I21DBN=GK_PRINT&S21FMT=fullw_print&C21COM=F&Z21MFN=27457
http://www.dissercat.com/content/osobennosti-rezistivnykh-i-galvanomagnitnykh-yavlenii-v-anizotropnykh-poluprovodnikakh
http://www.issp.ac.ru/ebooks/disser/Sergeev_G_S.pdf
http://www.dissercat.com/content/vliyanie-neravnovesnykh-sostoyanii-medi-na-fotoprovodimost-fosfida-galliya
http://www.dissercat.com/content/vliyanie-elektricheskogo-polya-na-magnitosoprotivlenie-germaniya-i-armenida-galliya
1926 births
2012 deaths
Soviet physicists
Scientists from Saint Petersburg
Russian scientists
|
```javascript
'use strict';
const common = require('../common');
if (!common.hasCrypto)
common.skip('missing crypto');
const assert = require('assert');
const child_process = require('child_process');
const path = require('path');
process.env.NODE_DEBUG_NATIVE = 'http2';
process.env.NODE_DEBUG = 'http2';
const { stdout, stderr } = child_process.spawnSync(process.execPath, [
path.resolve(__dirname, 'test-http2-ping.js')
], { encoding: 'utf8' });
assert(stderr.match(/Setting the NODE_DEBUG environment variable to 'http2' can expose sensitive data \(such as passwords, tokens and authentication headers\) in the resulting log\.\r?\n/),
stderr);
assert(stderr.match(/Http2Session client \(\d+\) handling data frame for stream \d+\r?\n/),
stderr);
assert(stderr.match(/HttpStream \d+ \(\d+\) \[Http2Session client \(\d+\)\] reading starting\r?\n/),
stderr);
assert(stderr.match(/HttpStream \d+ \(\d+\) \[Http2Session client \(\d+\)\] closed with code 0\r?\n/),
stderr);
assert(stderr.match(/HttpStream \d+ \(\d+\) \[Http2Session server \(\d+\)\] closed with code 0\r?\n/),
stderr);
assert(stderr.match(/HttpStream \d+ \(\d+\) \[Http2Session server \(\d+\)\] tearing down stream\r?\n/),
stderr);
assert.strictEqual(stdout.trim(), '');
```
|
```shell
#!/usr/bin/env bats
# vim:set ft=bash :
load helpers
function setup() {
setup_test
CONTAINER_CONMON_CGROUP="pod" CONTAINER_INFRA_CTR_CPUSET="0" CONTAINER_DROP_INFRA_CTR=false start_crio
}
function teardown() {
cleanup_test
}
@test "test infra ctr cpuset" {
if [[ $RUNTIME_TYPE == pod ]]; then
skip "not yet supported by conmonrs"
fi
pod_id=$(crictl runp "$TESTDATA"/sandbox_config.json)
output=$(crictl inspectp -o yaml "$pod_id")
[[ "$output" = *"cpus: \"0\""* ]]
check_conmon_cpuset "$pod_id" '0'
# Ensure the container gets the appropriate taskset
ctr_id=$(crictl create "$pod_id" "$TESTDATA"/container_redis.json "$TESTDATA"/sandbox_config.json)
ctr_output=$(crictl inspect -o json "$ctr_id")
ctr_pid=$(jq -r '.info.pid' <<< "$ctr_output")
ctr_taskset=$(taskset -p "$ctr_pid")
[[ ${ctr_taskset#*current affinity mask: } = 1 ]]
}
```
|
Acacia glutinosissima is a shrub belonging to the genus Acacia and the subgenus Phyllodineae that is endemic to western Australia.
Description
The spindly. open, sparingly branched and viscid shrub typically grows to a height of . The branchlets have a rough texture formed by stem-projections where phyllodes were once attached. Caducous stipules that are linear and have a length of also cover the branchlets. It has ascending to erect green to yellowish green phyllodes that are linear to shallowly incurved. Phyllodes are in length and wide. It produces yellow flowers from July to September. The spherical flower-heads contained 40 to 55 densely pack golden flowers. The linear seed pods that form after flowering have a length of up to and a width of containing oblong to elliptic shaped seeds with a length of .
Distribution
It is native to an area in the Wheatbelt region of Western Australia where it is found on rises and on sandplains growing in gravelly, sandy and lateritic soils. It has a scattered distribution from around Wubin in the north to around Bruce Rock in the south growing in open scrub.
See also
List of Acacia species
References
glutinosissima
Acacias of Western Australia
Taxa named by Joseph Maiden
Taxa named by William Blakely
Plants described in 1928
|
Lafayette High School, located in Wildwood, Missouri, is a secondary school in the Rockwood School District.
Lafayette High School opened September 7, 1960, in one small building in Ellisville. To handle the growing student body, the school moved in 1989 to Wildwood. The old school site became Crestview Middle School.
Lafayette's colors are black and white, often accented with gold.
Student Body
In the 202122 school year, Lafayette enrolled 1,742 students. The racial makeup of the school is 76.5% White, 9.9% Black, 7.7% Asian, and 3.7% Hispanic. A majority of students at Lafayette are graduates of Rockwood Valley Middle School, Crestview Middle School (only some students who went to Ellisville Elementary), and Wildwood Middle School (only students who went to Green Pines Elementary). The school serves Wildwood, and the westernmost portions of Chesterfield.
Sports and clubs
Sports and activities include cross country, field hockey, football, golf, soccer, softball, swimming & diving, tennis, volleyball, basketball, wrestling, baseball, lacrosse, track & field, water polo, Jam Bands, Lafayette Regiment Marching Band, Student Publications, Vocal Groups, Yearbook, AFJROTC, Book Club, esports, FCA, HOSA, Jewish Students Union, Mock Trial, Mu Alpha Theta, Photography Club, Premier Chamber Strings, Racquetball Club, Robotics, Senior Women, Thespians, Winter Colorguard, Asian American Association, French Club, Latin American Culture club, Key Club, Speech and Debate Team, Student Council, National Honor Society, Cheerleaders, Escadrille, Super Fans, and Lafayette Science Council. Sports are an important aspect of Lafayette, capturing 33 state championships since 1992.
Lafayette Lancer Regiment
The Lafayette Lancer Regiment is the school's marching band. It is a volunteer band, with an approximate annual membership of 80 people. Various staff members also aid sections throughout the season. The Lancer Regiment performs locally at many shows and participates at the Greater St. Louis Marching Festival at the Edward Jones Dome.
Newspaper
The monthly student newspaper, The Image, has run since 1965. The school's print yearbook, The Legend, is in its 48th year of publication.
Notable alumni
Robert Archibald, former NBA power forward and center (Memphis Grizzlies, Phoenix Suns, Orlando Magic, Toronto Raptors) and second-round 2002 NBA draft pick
Matt Buschmann, former MLB pitcher (Arizona Diamondbacks)
John Dettmer, former MLB pitcher (Texas Rangers)
Cliff Frazier, former NFL defensive tackle (Kansas City Chiefs) and actor
David Freese, former MLB third baseman (St. Louis Cardinals, Los Angeles Angels, Pittsburgh Pirates, Los Angeles Dodgers) and 2011 World Series MVP
Jeff Gray, former MLB pitcher (Oakland Athletics, Chicago Cubs, Chicago White Sox, Seattle Mariners, Minnesota Twins)
Scarborough Green, former MLB outfielder (St. Louis Cardinals, Texas Rangers)
Tyler Griffey, former professional basketball player (Swans Gmunden) and NCAA player for Illinois who made a buzzer beater to defeat top-ranked Indiana in the 2012-13 season
Ryan Howard, former Philadelphia Phillies first baseman, three-time MLB All-Star, 2005 NL Rookie of the Year and 2006 NL MVP, analyst for Baseball Tonight
Christina Machamer, professional chef who won season four of Fox reality cooking show Hell's Kitchen
Brandon Manzonelli, professional soccer midfielder (New England Revolution, Atlanta Silverbacks FC, St. Louis Ambush, Springfield Demize)
Austin Panchot, professional soccer, North Carolina FC
Luke Voit, Washington Nationals first baseman and DH
References
External links
Lafayette High School Website
The Image
Lafayette Lancers Football
Educational institutions established in 1960
High schools in St. Louis County, Missouri
Public high schools in Missouri
1960 establishments in Missouri
|
Beerse () is a municipality located in the Belgian province of Antwerp. The municipality comprises the towns of Beerse proper and . In 2021, Beerse had a total population of 18,194. The total area is 37.48 km2 (14.5 sq mi). The pharmaceutical company Janssen Pharmaceutica, founded by Dr. Paul Janssen, has its headquarters in Beerse.
Industry
Several companies are located in Beerse, of which the most important are:
Janssen Pharmaceutica (pharmaceuticals)
Metallo-Chimique (metallurgy)
Wienerberger Beerse (bricks)
Glacio (ice cream)
Aurora productions (paper and plastics)
Climate
Notable inhabitants
Peter Evrard, singer
René Verheyen, soccer player
Patrick Vervoort, soccer player
References
External links
Age distribution
Municipalities of Antwerp Province
Populated places in Antwerp Province
|
"Shallow Be Thy Game" is a song by Red Hot Chili Peppers and was the fourth single from their 1995 album, One Hot Minute. The single was released in Australia only. It was also the only single from the album not to have a music video made for it.
The song is quite polemic in its direct assault on fundamentalist religion, which the lyrics openly mock.
Live performances
Despite being a single, the song was performed very rarely on the One Hot Minute tour and has not been performed since 1996 and never in the United States.
Track listing
CD single (1996)
"Shallow Be Thy Game" (album)
"Walkabout" (album)
"Suck My Kiss" (live)
Charts
References
1996 singles
Red Hot Chili Peppers songs
Song recordings produced by Rick Rubin
Songs critical of religion
Songs written by Flea (musician)
Songs written by Anthony Kiedis
Songs written by Chad Smith
Songs written by Dave Navarro
Warner Records singles
Funk metal songs
Alternative metal songs
|
Haslundichilis is a genus of jumping bristletails in the family Machilidae. There are at least two described species in Haslundichilis.
Species
These two species belong to the genus Haslundichilis:
Haslundichilis afghani Wygodzinsky, 1950
Haslundichilis hedini
References
Further reading
Archaeognatha
Articles created by Qbugbot
|
```php
<?php
/*
*
* ____ _ _ __ __ _ __ __ ____
* | _ \ ___ ___| | _____| |_| \/ (_)_ __ ___ | \/ | _ \
* | |_) / _ \ / __| |/ / _ \ __| |\/| | | '_ \ / _ \_____| |\/| | |_) |
* | __/ (_) | (__| < __/ |_| | | | | | | | __/_____| | | | __/
* |_| \___/ \___|_|\_\___|\__|_| |_|_|_| |_|\___| |_| |_|_|
*
* This program is free software: you can redistribute it and/or modify
* (at your option) any later version.
*
* @author PocketMine Team
* @link path_to_url
*
*
*/
declare(strict_types=1);
namespace pocketmine\player;
interface IPlayer{
public function getName() : string;
public function getFirstPlayed() : ?int;
public function getLastPlayed() : ?int;
public function hasPlayedBefore() : bool;
}
```
|
```xml
/**
* Sets up the AI Assist plugin with preset prompts for content creation
*/
import { assist } from "@sanity/assist";
import postType from "../schemas/documents/post";
export const assistWithPresets = () =>
assist({
__presets: {
[postType.name]: {
fields: [
{
/**
* Creates Portable Text `content` blocks from the `title` field
*/
path: "content",
instructions: [
{
_key: "preset-instruction-1",
title: "Generate sample content",
icon: "block-content",
prompt: [
{
_key: "86e70087d4d5",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "Given the draft title ",
_key: "6b5d5d6a63cf0",
},
{
path: "title",
_type: "sanity.assist.instruction.fieldRef",
_key: "0132742d463b",
},
{
_type: "span",
marks: [],
text: " of a blog post, generate a comprehensive and engaging sample content that spans the length of one to two A4 pages. The content should be structured, informative, and tailored to the subject matter implied by the title, whether it be travel, software engineering, fashion, politics, or any other theme. The text will be displayed below the ",
_key: "a02c9ab4eb2d",
},
{
_type: "sanity.assist.instruction.fieldRef",
_key: "f208ef240062",
path: "title",
},
{
text: " and doesn't need to repeat it in the text. The generated text should include the following elements:",
_key: "8ecfa74a8487",
_type: "span",
marks: [],
},
],
_type: "block",
style: "normal",
},
{
style: "normal",
_key: "e4dded41ea89",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "1. Introduction: A brief paragraph that captures the essence of the blog post, hooks the reader with intriguing insights, and outlines the purpose of the post.",
_key: "cc5ef44a2fb5",
},
],
_type: "block",
},
{
style: "normal",
_key: "585e8de2fe35",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "2. Main Body:",
_key: "fab36eb7c541",
},
],
_type: "block",
},
{
_type: "block",
style: "normal",
_key: "e96b89ef6357",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "- For thematic consistency, divide the body into several sections with subheadings that explore different facets of the topic.",
_key: "b685a310a0ff",
},
],
},
{
children: [
{
marks: [],
text: "- Include engaging and informative content such as personal anecdotes (for travel or fashion blogs), technical explanations or tutorials (for software engineering blogs), satirical or humorous observations (for shitposting), or well-argued positions (for political blogs).",
_key: "c7468d106c91",
_type: "span",
},
],
_type: "block",
style: "normal",
_key: "ce4acdb00da9",
markDefs: [],
},
{
_type: "block",
style: "normal",
_key: "fb4572e65833",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "- ",
_key: "5358f261dce4",
},
{
_type: "span",
marks: [],
text: " observations (for shitposting), or well-argued positions (for political blogs).",
_key: "50792c6d0f77",
},
],
},
{
children: [
{
marks: [],
text: "Where applicable, incorporate bullet points or numbered lists to break down complex information, steps in a process, or key highlights.",
_key: "3b891d8c1dde0",
_type: "span",
},
],
_type: "block",
style: "normal",
_key: "9364b67074ce",
markDefs: [],
},
{
_key: "a6ba7579cd66",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "3. Conclusion: Summarize the main points discussed in the post, offer final thoughts or calls to action, and invite readers to engage with the content through comments or social media sharing.",
_key: "1280f11d499d",
},
],
_type: "block",
style: "normal",
},
{
style: "normal",
_key: "719a79eb4c1c",
markDefs: [],
children: [
{
marks: [],
text: "4. Engagement Prompts: Conclude with questions or prompts that encourage readers to share their experiences, opinions, or questions related to the blog post's topic, but keep in mind there is no Comments field below the blog post.",
_key: "f1512086bab6",
_type: "span",
},
],
_type: "block",
},
{
_type: "block",
style: "normal",
_key: "4a1c586fd44a",
markDefs: [],
children: [
{
marks: [],
text: "Ensure the generated content maintains a balance between being informative and entertaining, to capture the interest of a wide audience. The sample content should serve as a solid foundation that can be further customized or expanded upon by the blog author to finalize the post.",
_key: "697bbd03cb110",
_type: "span",
},
],
},
{
children: [
{
marks: [],
text: 'Don\'t prefix each section with "Introduction", "Main Body", "Conclusion" or "Engagement Prompts"',
_key: "d20bb9a03b0d",
_type: "span",
},
],
_type: "block",
style: "normal",
_key: "b072b3c62c3c",
markDefs: [],
},
],
},
],
},
{
/**
* Summarize content into the `excerpt` field
*/
path: "excerpt",
instructions: [
{
_key: "preset-instruction-2",
title: "Summarize content",
icon: "blockquote",
prompt: [
{
markDefs: [],
children: [
{
_key: "650a0dcc327d",
_type: "span",
marks: [],
text: "Create a short excerpt based on ",
},
{
path: "content",
_type: "sanity.assist.instruction.fieldRef",
_key: "c62d14c73496",
},
{
_key: "38e043efa606",
_type: "span",
marks: [],
text: " that doesn't repeat what's already in the ",
},
{
path: "title",
_type: "sanity.assist.instruction.fieldRef",
_key: "445e62dda246",
},
{
_key: "98cce773915e",
_type: "span",
marks: [],
text: " . Consider the UI has limited horizontal space and try to avoid too many line breaks and make it as short, terse and brief as possible. At best a single sentence, at most two sentences.",
},
],
_type: "block",
style: "normal",
_key: "392c618784b0",
},
],
},
],
},
],
},
},
});
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* 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.
*/
'use strict';
var sort2hp = require( '@stdlib/blas/ext/base/gsort2hp' );
var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
var oneTo = require( './../lib' );
// Generate an array of random numbers:
var opts = {
'dtype': 'generic'
};
var x = discreteUniform( 10, 100, 200, opts );
// Generate a linearly-spaced array:
var y = oneTo( x.length, opts.dtype );
// Create a temporary array to avoid mutation:
var tmp = x.slice();
// Sort `y` according to the sort order of `x`:
sort2hp( x.length, 1, tmp, 1, y, 1 );
console.log( x );
console.log( y );
```
|
Robert Aglionby Slaney (9 June 1791 – 19 May 1862) was a British barrister and Whig politician from Shropshire. He sat in the House of Commons as a Member of Parliament for the borough of Shrewsbury for most of the period from 1826 until his death in 1862.
Early life
Slaney was the eldest son of Robert Slaney (1764–1834) of Hatton Grange, Shropshire, and his wife, Mary, daughter of Thomas Mason of Shrewsbury. He was educated at Trinity College, Cambridge, and was called to the bar in 1817 at Lincoln's Inn. He succeeded to his father's Hatton Grange estates in 1834.
Career
He was first elected at the 1826 general election, and was re-elected at the next three general elections, until his defeat at the 1835 general election by the Conservative Party candidate John Cressett-Pelham. He was re-elected in 1837, but did not stand in 1841, when the seat was won by Benjamin Disraeli. He won the seat again in 1847, but did not stand in 1852. He was High Sheriff of Shropshire in 1854.
Slaney was returned again at the 1857 general election, re-elected in 1859, and held the seat until his death, aged 70.
Among other achievements, Slaney was instrumental in setting up the Select Committee on Public Health of 1840, which paved the way for the later Board of Health; and in fostering the Industrial and Provident Societies Partnership Act 1852, sometimes known as Slaney's Act. He served as commissioner "on the health of towns" from 1843 to 1848, and was particularly noted for his efforts to improve living conditions in urban industrial areas.
Attending the opening of the London International Exhibition on 1 May 1862, he fell through a gap in a platform floor and injured his right leg, despite which he continued to view the exhibition and attended Parliament up until the 8th. He died on 19 May 1862, at his London house in Mayfair, from gangrene (then reported as 'mortification') that set in.
Family
His residence was listed in 1857 as Walford Manor, Shropshire. He married twice: in 1812 to Elizabeth Muckleston, and in 1854 to Catherine Anne Archer. Slaney had three daughters, amongst whom his estate was shared. The youngest, Frances Catherine, married William Kenyon, who as a condition of Slaney's will took the additional surname of Slaney. The eldest, Elizabeth Frances (died c. 1870), married the naturalist Thomas Campbell Eyton, a Deputy Lieutenant of Shropshire.
Archives
A collection of letters sent to Slanley are held at the Cadbury Research Library, University of Birmingham. This archive collection also includes correspondence of his son-in-law, Thomas Campbell Eyton, and other family members.
References
External links
1791 births
1862 deaths
Whig (British political party) MPs for English constituencies
Liberal Party (UK) MPs for English constituencies
UK MPs 1826–1830
UK MPs 1830–1831
UK MPs 1831–1832
UK MPs 1832–1835
UK MPs 1837–1841
UK MPs 1847–1852
UK MPs 1857–1859
UK MPs 1859–1865
High Sheriffs of Shropshire
Members of Lincoln's Inn
Alumni of Trinity College, Cambridge
Members of the Parliament of the United Kingdom for constituencies in Shropshire
Committee members of the Society for the Diffusion of Useful Knowledge
|
```javascript
Hoisting
Functions can be declared after use
`.bind()`
Easily generate a random `HEX` color
Move cursor at the end of text input
```
|
```c++
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#if V8_TARGET_ARCH_X64
#include "src/regexp/x64/regexp-macro-assembler-x64.h"
#include "src/log.h"
#include "src/macro-assembler.h"
#include "src/profiler/cpu-profiler.h"
#include "src/regexp/regexp-macro-assembler.h"
#include "src/regexp/regexp-stack.h"
#include "src/unicode.h"
namespace v8 {
namespace internal {
#ifndef V8_INTERPRETED_REGEXP
/*
* This assembler uses the following register assignment convention
* - rdx : Currently loaded character(s) as Latin1 or UC16. Must be loaded
* using LoadCurrentCharacter before using any of the dispatch methods.
* Temporarily stores the index of capture start after a matching pass
* for a global regexp.
* - rdi : Current position in input, as negative offset from end of string.
* Please notice that this is the byte offset, not the character
* offset! Is always a 32-bit signed (negative) offset, but must be
* maintained sign-extended to 64 bits, since it is used as index.
* - rsi : End of input (points to byte after last character in input),
* so that rsi+rdi points to the current character.
* - rbp : Frame pointer. Used to access arguments, local variables and
* RegExp registers.
* - rsp : Points to tip of C stack.
* - rcx : Points to tip of backtrack stack. The backtrack stack contains
* only 32-bit values. Most are offsets from some base (e.g., character
* positions from end of string or code location from Code* pointer).
* - r8 : Code object pointer. Used to convert between absolute and
* code-object-relative addresses.
*
* The registers rax, rbx, r9 and r11 are free to use for computations.
* If changed to use r12+, they should be saved as callee-save registers.
* The macro assembler special register r13 (kRootRegister) isn't special
* during execution of RegExp code (it doesn't hold the value assumed when
* creating JS code), so Root related macro operations can be used.
*
* Each call to a C++ method should retain these registers.
*
* The stack will have the following content, in some order, indexable from the
* frame pointer (see, e.g., kStackHighEnd):
* - Isolate* isolate (address of the current isolate)
* - direct_call (if 1, direct call from JavaScript code, if 0 call
* through the runtime system)
* - stack_area_base (high end of the memory area to use as
* backtracking stack)
* - capture array size (may fit multiple sets of matches)
* - int* capture_array (int[num_saved_registers_], for output).
* - end of input (address of end of string)
* - start of input (address of first character in string)
* - start index (character index of start)
* - String* input_string (input string)
* - return address
* - backup of callee save registers (rbx, possibly rsi and rdi).
* - success counter (only useful for global regexp to count matches)
* - Offset of location before start of input (effectively character
* position -1). Used to initialize capture registers to a non-position.
* - At start of string (if 1, we are starting at the start of the
* string, otherwise 0)
* - register 0 rbp[-n] (Only positions must be stored in the first
* - register 1 rbp[-n-8] num_saved_registers_ registers)
* - ...
*
* The first num_saved_registers_ registers are initialized to point to
* "character -1" in the string (i.e., char_size() bytes before the first
* character of the string). The remaining registers starts out uninitialized.
*
* The first seven values must be provided by the calling code by
* calling the code's entry address cast to a function pointer with the
* following signature:
* int (*match)(String* input_string,
* int start_index,
* Address start,
* Address end,
* int* capture_output_array,
* bool at_start,
* byte* stack_area_base,
* bool direct_call)
*/
#define __ ACCESS_MASM((&masm_))
RegExpMacroAssemblerX64::RegExpMacroAssemblerX64(Isolate* isolate, Zone* zone,
Mode mode,
int registers_to_save)
: NativeRegExpMacroAssembler(isolate, zone),
masm_(isolate, NULL, kRegExpCodeSize),
no_root_array_scope_(&masm_),
code_relative_fixup_positions_(4, zone),
mode_(mode),
num_registers_(registers_to_save),
num_saved_registers_(registers_to_save),
entry_label_(),
start_label_(),
success_label_(),
backtrack_label_(),
exit_label_() {
DCHECK_EQ(0, registers_to_save % 2);
__ jmp(&entry_label_); // We'll write the entry code when we know more.
__ bind(&start_label_); // And then continue from here.
}
RegExpMacroAssemblerX64::~RegExpMacroAssemblerX64() {
// Unuse labels in case we throw away the assembler without calling GetCode.
entry_label_.Unuse();
start_label_.Unuse();
success_label_.Unuse();
backtrack_label_.Unuse();
exit_label_.Unuse();
check_preempt_label_.Unuse();
stack_overflow_label_.Unuse();
}
int RegExpMacroAssemblerX64::stack_limit_slack() {
return RegExpStack::kStackLimitSlack;
}
void RegExpMacroAssemblerX64::AdvanceCurrentPosition(int by) {
if (by != 0) {
__ addq(rdi, Immediate(by * char_size()));
}
}
void RegExpMacroAssemblerX64::AdvanceRegister(int reg, int by) {
DCHECK(reg >= 0);
DCHECK(reg < num_registers_);
if (by != 0) {
__ addp(register_location(reg), Immediate(by));
}
}
void RegExpMacroAssemblerX64::Backtrack() {
CheckPreemption();
// Pop Code* offset from backtrack stack, add Code* and jump to location.
Pop(rbx);
__ addp(rbx, code_object_pointer());
__ jmp(rbx);
}
void RegExpMacroAssemblerX64::Bind(Label* label) {
__ bind(label);
}
void RegExpMacroAssemblerX64::CheckCharacter(uint32_t c, Label* on_equal) {
__ cmpl(current_character(), Immediate(c));
BranchOrBacktrack(equal, on_equal);
}
void RegExpMacroAssemblerX64::CheckCharacterGT(uc16 limit, Label* on_greater) {
__ cmpl(current_character(), Immediate(limit));
BranchOrBacktrack(greater, on_greater);
}
void RegExpMacroAssemblerX64::CheckAtStart(Label* on_at_start) {
Label not_at_start;
// Did we start the match at the start of the string at all?
__ cmpl(Operand(rbp, kStartIndex), Immediate(0));
BranchOrBacktrack(not_equal, ¬_at_start);
// If we did, are we still at the start of the input?
__ leap(rax, Operand(rsi, rdi, times_1, 0));
__ cmpp(rax, Operand(rbp, kInputStart));
BranchOrBacktrack(equal, on_at_start);
__ bind(¬_at_start);
}
void RegExpMacroAssemblerX64::CheckNotAtStart(Label* on_not_at_start) {
// Did we start the match at the start of the string at all?
__ cmpl(Operand(rbp, kStartIndex), Immediate(0));
BranchOrBacktrack(not_equal, on_not_at_start);
// If we did, are we still at the start of the input?
__ leap(rax, Operand(rsi, rdi, times_1, 0));
__ cmpp(rax, Operand(rbp, kInputStart));
BranchOrBacktrack(not_equal, on_not_at_start);
}
void RegExpMacroAssemblerX64::CheckCharacterLT(uc16 limit, Label* on_less) {
__ cmpl(current_character(), Immediate(limit));
BranchOrBacktrack(less, on_less);
}
void RegExpMacroAssemblerX64::CheckGreedyLoop(Label* on_equal) {
Label fallthrough;
__ cmpl(rdi, Operand(backtrack_stackpointer(), 0));
__ j(not_equal, &fallthrough);
Drop();
BranchOrBacktrack(no_condition, on_equal);
__ bind(&fallthrough);
}
void RegExpMacroAssemblerX64::CheckNotBackReferenceIgnoreCase(
int start_reg,
Label* on_no_match) {
Label fallthrough;
ReadPositionFromRegister(rdx, start_reg); // Offset of start of capture
ReadPositionFromRegister(rbx, start_reg + 1); // Offset of end of capture
__ subp(rbx, rdx); // Length of capture.
// -----------------------
// rdx = Start offset of capture.
// rbx = Length of capture
// If length is negative, this code will fail (it's a symptom of a partial or
// illegal capture where start of capture after end of capture).
// This must not happen (no back-reference can reference a capture that wasn't
// closed before in the reg-exp, and we must not generate code that can cause
// this condition).
// If length is zero, either the capture is empty or it is nonparticipating.
// In either case succeed immediately.
__ j(equal, &fallthrough);
// -----------------------
// rdx - Start of capture
// rbx - length of capture
// Check that there are sufficient characters left in the input.
__ movl(rax, rdi);
__ addl(rax, rbx);
BranchOrBacktrack(greater, on_no_match);
if (mode_ == LATIN1) {
Label loop_increment;
if (on_no_match == NULL) {
on_no_match = &backtrack_label_;
}
__ leap(r9, Operand(rsi, rdx, times_1, 0));
__ leap(r11, Operand(rsi, rdi, times_1, 0));
__ addp(rbx, r9); // End of capture
// ---------------------
// r11 - current input character address
// r9 - current capture character address
// rbx - end of capture
Label loop;
__ bind(&loop);
__ movzxbl(rdx, Operand(r9, 0));
__ movzxbl(rax, Operand(r11, 0));
// al - input character
// dl - capture character
__ cmpb(rax, rdx);
__ j(equal, &loop_increment);
// Mismatch, try case-insensitive match (converting letters to lower-case).
// I.e., if or-ing with 0x20 makes values equal and in range 'a'-'z', it's
// a match.
__ orp(rax, Immediate(0x20)); // Convert match character to lower-case.
__ orp(rdx, Immediate(0x20)); // Convert capture character to lower-case.
__ cmpb(rax, rdx);
__ j(not_equal, on_no_match); // Definitely not equal.
__ subb(rax, Immediate('a'));
__ cmpb(rax, Immediate('z' - 'a'));
__ j(below_equal, &loop_increment); // In range 'a'-'z'.
// Latin-1: Check for values in range [224,254] but not 247.
__ subb(rax, Immediate(224 - 'a'));
__ cmpb(rax, Immediate(254 - 224));
__ j(above, on_no_match); // Weren't Latin-1 letters.
__ cmpb(rax, Immediate(247 - 224)); // Check for 247.
__ j(equal, on_no_match);
__ bind(&loop_increment);
// Increment pointers into match and capture strings.
__ addp(r11, Immediate(1));
__ addp(r9, Immediate(1));
// Compare to end of capture, and loop if not done.
__ cmpp(r9, rbx);
__ j(below, &loop);
// Compute new value of character position after the matched part.
__ movp(rdi, r11);
__ subq(rdi, rsi);
} else {
DCHECK(mode_ == UC16);
// Save important/volatile registers before calling C function.
#ifndef _WIN64
// Caller save on Linux and callee save in Windows.
__ pushq(rsi);
__ pushq(rdi);
#endif
__ pushq(backtrack_stackpointer());
static const int num_arguments = 4;
__ PrepareCallCFunction(num_arguments);
// Put arguments into parameter registers. Parameters are
// Address byte_offset1 - Address captured substring's start.
// Address byte_offset2 - Address of current character position.
// size_t byte_length - length of capture in bytes(!)
// Isolate* isolate
#ifdef _WIN64
// Compute and set byte_offset1 (start of capture).
__ leap(rcx, Operand(rsi, rdx, times_1, 0));
// Set byte_offset2.
__ leap(rdx, Operand(rsi, rdi, times_1, 0));
// Set byte_length.
__ movp(r8, rbx);
// Isolate.
__ LoadAddress(r9, ExternalReference::isolate_address(isolate()));
#else // AMD64 calling convention
// Compute byte_offset2 (current position = rsi+rdi).
__ leap(rax, Operand(rsi, rdi, times_1, 0));
// Compute and set byte_offset1 (start of capture).
__ leap(rdi, Operand(rsi, rdx, times_1, 0));
// Set byte_offset2.
__ movp(rsi, rax);
// Set byte_length.
__ movp(rdx, rbx);
// Isolate.
__ LoadAddress(rcx, ExternalReference::isolate_address(isolate()));
#endif
{ // NOLINT: Can't find a way to open this scope without confusing the
// linter.
AllowExternalCallThatCantCauseGC scope(&masm_);
ExternalReference compare =
ExternalReference::re_case_insensitive_compare_uc16(isolate());
__ CallCFunction(compare, num_arguments);
}
// Restore original values before reacting on result value.
__ Move(code_object_pointer(), masm_.CodeObject());
__ popq(backtrack_stackpointer());
#ifndef _WIN64
__ popq(rdi);
__ popq(rsi);
#endif
// Check if function returned non-zero for success or zero for failure.
__ testp(rax, rax);
BranchOrBacktrack(zero, on_no_match);
// On success, increment position by length of capture.
// Requires that rbx is callee save (true for both Win64 and AMD64 ABIs).
__ addq(rdi, rbx);
}
__ bind(&fallthrough);
}
void RegExpMacroAssemblerX64::CheckNotBackReference(
int start_reg,
Label* on_no_match) {
Label fallthrough;
// Find length of back-referenced capture.
ReadPositionFromRegister(rdx, start_reg); // Offset of start of capture
ReadPositionFromRegister(rax, start_reg + 1); // Offset of end of capture
__ subp(rax, rdx); // Length to check.
// Fail on partial or illegal capture (start of capture after end of capture).
// This must not happen (no back-reference can reference a capture that wasn't
// closed before in the reg-exp).
__ Check(greater_equal, kInvalidCaptureReferenced);
// Succeed on empty capture (including non-participating capture)
__ j(equal, &fallthrough);
// -----------------------
// rdx - Start of capture
// rax - length of capture
// Check that there are sufficient characters left in the input.
__ movl(rbx, rdi);
__ addl(rbx, rax);
BranchOrBacktrack(greater, on_no_match);
// Compute pointers to match string and capture string
__ leap(rbx, Operand(rsi, rdi, times_1, 0)); // Start of match.
__ addp(rdx, rsi); // Start of capture.
__ leap(r9, Operand(rdx, rax, times_1, 0)); // End of capture
// -----------------------
// rbx - current capture character address.
// rbx - current input character address .
// r9 - end of input to match (capture length after rbx).
Label loop;
__ bind(&loop);
if (mode_ == LATIN1) {
__ movzxbl(rax, Operand(rdx, 0));
__ cmpb(rax, Operand(rbx, 0));
} else {
DCHECK(mode_ == UC16);
__ movzxwl(rax, Operand(rdx, 0));
__ cmpw(rax, Operand(rbx, 0));
}
BranchOrBacktrack(not_equal, on_no_match);
// Increment pointers into capture and match string.
__ addp(rbx, Immediate(char_size()));
__ addp(rdx, Immediate(char_size()));
// Check if we have reached end of match area.
__ cmpp(rdx, r9);
__ j(below, &loop);
// Success.
// Set current character position to position after match.
__ movp(rdi, rbx);
__ subq(rdi, rsi);
__ bind(&fallthrough);
}
void RegExpMacroAssemblerX64::CheckNotCharacter(uint32_t c,
Label* on_not_equal) {
__ cmpl(current_character(), Immediate(c));
BranchOrBacktrack(not_equal, on_not_equal);
}
void RegExpMacroAssemblerX64::CheckCharacterAfterAnd(uint32_t c,
uint32_t mask,
Label* on_equal) {
if (c == 0) {
__ testl(current_character(), Immediate(mask));
} else {
__ movl(rax, Immediate(mask));
__ andp(rax, current_character());
__ cmpl(rax, Immediate(c));
}
BranchOrBacktrack(equal, on_equal);
}
void RegExpMacroAssemblerX64::CheckNotCharacterAfterAnd(uint32_t c,
uint32_t mask,
Label* on_not_equal) {
if (c == 0) {
__ testl(current_character(), Immediate(mask));
} else {
__ movl(rax, Immediate(mask));
__ andp(rax, current_character());
__ cmpl(rax, Immediate(c));
}
BranchOrBacktrack(not_equal, on_not_equal);
}
void RegExpMacroAssemblerX64::CheckNotCharacterAfterMinusAnd(
uc16 c,
uc16 minus,
uc16 mask,
Label* on_not_equal) {
DCHECK(minus < String::kMaxUtf16CodeUnit);
__ leap(rax, Operand(current_character(), -minus));
__ andp(rax, Immediate(mask));
__ cmpl(rax, Immediate(c));
BranchOrBacktrack(not_equal, on_not_equal);
}
void RegExpMacroAssemblerX64::CheckCharacterInRange(
uc16 from,
uc16 to,
Label* on_in_range) {
__ leal(rax, Operand(current_character(), -from));
__ cmpl(rax, Immediate(to - from));
BranchOrBacktrack(below_equal, on_in_range);
}
void RegExpMacroAssemblerX64::CheckCharacterNotInRange(
uc16 from,
uc16 to,
Label* on_not_in_range) {
__ leal(rax, Operand(current_character(), -from));
__ cmpl(rax, Immediate(to - from));
BranchOrBacktrack(above, on_not_in_range);
}
void RegExpMacroAssemblerX64::CheckBitInTable(
Handle<ByteArray> table,
Label* on_bit_set) {
__ Move(rax, table);
Register index = current_character();
if (mode_ != LATIN1 || kTableMask != String::kMaxOneByteCharCode) {
__ movp(rbx, current_character());
__ andp(rbx, Immediate(kTableMask));
index = rbx;
}
__ cmpb(FieldOperand(rax, index, times_1, ByteArray::kHeaderSize),
Immediate(0));
BranchOrBacktrack(not_equal, on_bit_set);
}
bool RegExpMacroAssemblerX64::CheckSpecialCharacterClass(uc16 type,
Label* on_no_match) {
// Range checks (c in min..max) are generally implemented by an unsigned
// (c - min) <= (max - min) check, using the sequence:
// leap(rax, Operand(current_character(), -min)) or sub(rax, Immediate(min))
// cmp(rax, Immediate(max - min))
switch (type) {
case 's':
// Match space-characters
if (mode_ == LATIN1) {
// One byte space characters are '\t'..'\r', ' ' and \u00a0.
Label success;
__ cmpl(current_character(), Immediate(' '));
__ j(equal, &success, Label::kNear);
// Check range 0x09..0x0d
__ leap(rax, Operand(current_character(), -'\t'));
__ cmpl(rax, Immediate('\r' - '\t'));
__ j(below_equal, &success, Label::kNear);
// \u00a0 (NBSP).
__ cmpl(rax, Immediate(0x00a0 - '\t'));
BranchOrBacktrack(not_equal, on_no_match);
__ bind(&success);
return true;
}
return false;
case 'S':
// The emitted code for generic character classes is good enough.
return false;
case 'd':
// Match ASCII digits ('0'..'9')
__ leap(rax, Operand(current_character(), -'0'));
__ cmpl(rax, Immediate('9' - '0'));
BranchOrBacktrack(above, on_no_match);
return true;
case 'D':
// Match non ASCII-digits
__ leap(rax, Operand(current_character(), -'0'));
__ cmpl(rax, Immediate('9' - '0'));
BranchOrBacktrack(below_equal, on_no_match);
return true;
case '.': {
// Match non-newlines (not 0x0a('\n'), 0x0d('\r'), 0x2028 and 0x2029)
__ movl(rax, current_character());
__ xorp(rax, Immediate(0x01));
// See if current character is '\n'^1 or '\r'^1, i.e., 0x0b or 0x0c
__ subl(rax, Immediate(0x0b));
__ cmpl(rax, Immediate(0x0c - 0x0b));
BranchOrBacktrack(below_equal, on_no_match);
if (mode_ == UC16) {
// Compare original value to 0x2028 and 0x2029, using the already
// computed (current_char ^ 0x01 - 0x0b). I.e., check for
// 0x201d (0x2028 - 0x0b) or 0x201e.
__ subl(rax, Immediate(0x2028 - 0x0b));
__ cmpl(rax, Immediate(0x2029 - 0x2028));
BranchOrBacktrack(below_equal, on_no_match);
}
return true;
}
case 'n': {
// Match newlines (0x0a('\n'), 0x0d('\r'), 0x2028 and 0x2029)
__ movl(rax, current_character());
__ xorp(rax, Immediate(0x01));
// See if current character is '\n'^1 or '\r'^1, i.e., 0x0b or 0x0c
__ subl(rax, Immediate(0x0b));
__ cmpl(rax, Immediate(0x0c - 0x0b));
if (mode_ == LATIN1) {
BranchOrBacktrack(above, on_no_match);
} else {
Label done;
BranchOrBacktrack(below_equal, &done);
// Compare original value to 0x2028 and 0x2029, using the already
// computed (current_char ^ 0x01 - 0x0b). I.e., check for
// 0x201d (0x2028 - 0x0b) or 0x201e.
__ subl(rax, Immediate(0x2028 - 0x0b));
__ cmpl(rax, Immediate(0x2029 - 0x2028));
BranchOrBacktrack(above, on_no_match);
__ bind(&done);
}
return true;
}
case 'w': {
if (mode_ != LATIN1) {
// Table is 256 entries, so all Latin1 characters can be tested.
__ cmpl(current_character(), Immediate('z'));
BranchOrBacktrack(above, on_no_match);
}
__ Move(rbx, ExternalReference::re_word_character_map());
DCHECK_EQ(0, word_character_map[0]); // Character '\0' is not a word char.
__ testb(Operand(rbx, current_character(), times_1, 0),
current_character());
BranchOrBacktrack(zero, on_no_match);
return true;
}
case 'W': {
Label done;
if (mode_ != LATIN1) {
// Table is 256 entries, so all Latin1 characters can be tested.
__ cmpl(current_character(), Immediate('z'));
__ j(above, &done);
}
__ Move(rbx, ExternalReference::re_word_character_map());
DCHECK_EQ(0, word_character_map[0]); // Character '\0' is not a word char.
__ testb(Operand(rbx, current_character(), times_1, 0),
current_character());
BranchOrBacktrack(not_zero, on_no_match);
if (mode_ != LATIN1) {
__ bind(&done);
}
return true;
}
case '*':
// Match any character.
return true;
// No custom implementation (yet): s(UC16), S(UC16).
default:
return false;
}
}
void RegExpMacroAssemblerX64::Fail() {
STATIC_ASSERT(FAILURE == 0); // Return value for failure is zero.
if (!global()) {
__ Set(rax, FAILURE);
}
__ jmp(&exit_label_);
}
Handle<HeapObject> RegExpMacroAssemblerX64::GetCode(Handle<String> source) {
Label return_rax;
// Finalize code - write the entry point code now we know how many
// registers we need.
// Entry code:
__ bind(&entry_label_);
// Tell the system that we have a stack frame. Because the type is MANUAL, no
// is generated.
FrameScope scope(&masm_, StackFrame::MANUAL);
// Actually emit code to start a new stack frame.
__ pushq(rbp);
__ movp(rbp, rsp);
// Save parameters and callee-save registers. Order here should correspond
// to order of kBackup_ebx etc.
#ifdef _WIN64
// MSVC passes arguments in rcx, rdx, r8, r9, with backing stack slots.
// Store register parameters in pre-allocated stack slots,
__ movq(Operand(rbp, kInputString), rcx);
__ movq(Operand(rbp, kStartIndex), rdx); // Passed as int32 in edx.
__ movq(Operand(rbp, kInputStart), r8);
__ movq(Operand(rbp, kInputEnd), r9);
// Callee-save on Win64.
__ pushq(rsi);
__ pushq(rdi);
__ pushq(rbx);
#else
// GCC passes arguments in rdi, rsi, rdx, rcx, r8, r9 (and then on stack).
// Push register parameters on stack for reference.
DCHECK_EQ(kInputString, -1 * kRegisterSize);
DCHECK_EQ(kStartIndex, -2 * kRegisterSize);
DCHECK_EQ(kInputStart, -3 * kRegisterSize);
DCHECK_EQ(kInputEnd, -4 * kRegisterSize);
DCHECK_EQ(kRegisterOutput, -5 * kRegisterSize);
DCHECK_EQ(kNumOutputRegisters, -6 * kRegisterSize);
__ pushq(rdi);
__ pushq(rsi);
__ pushq(rdx);
__ pushq(rcx);
__ pushq(r8);
__ pushq(r9);
__ pushq(rbx); // Callee-save
#endif
__ Push(Immediate(0)); // Number of successful matches in a global regexp.
__ Push(Immediate(0)); // Make room for "input start - 1" constant.
// Check if we have space on the stack for registers.
Label stack_limit_hit;
Label stack_ok;
ExternalReference stack_limit =
ExternalReference::address_of_stack_limit(isolate());
__ movp(rcx, rsp);
__ Move(kScratchRegister, stack_limit);
__ subp(rcx, Operand(kScratchRegister, 0));
// Handle it if the stack pointer is already below the stack limit.
__ j(below_equal, &stack_limit_hit);
// Check if there is room for the variable number of registers above
// the stack limit.
__ cmpp(rcx, Immediate(num_registers_ * kPointerSize));
__ j(above_equal, &stack_ok);
// Exit with OutOfMemory exception. There is not enough space on the stack
// for our working registers.
__ Set(rax, EXCEPTION);
__ jmp(&return_rax);
__ bind(&stack_limit_hit);
__ Move(code_object_pointer(), masm_.CodeObject());
CallCheckStackGuardState(); // Preserves no registers beside rbp and rsp.
__ testp(rax, rax);
// If returned value is non-zero, we exit with the returned value as result.
__ j(not_zero, &return_rax);
__ bind(&stack_ok);
// Allocate space on stack for registers.
__ subp(rsp, Immediate(num_registers_ * kPointerSize));
// Load string length.
__ movp(rsi, Operand(rbp, kInputEnd));
// Load input position.
__ movp(rdi, Operand(rbp, kInputStart));
// Set up rdi to be negative offset from string end.
__ subq(rdi, rsi);
// Set rax to address of char before start of the string
// (effectively string position -1).
__ movp(rbx, Operand(rbp, kStartIndex));
__ negq(rbx);
if (mode_ == UC16) {
__ leap(rax, Operand(rdi, rbx, times_2, -char_size()));
} else {
__ leap(rax, Operand(rdi, rbx, times_1, -char_size()));
}
// Store this value in a local variable, for use when clearing
// position registers.
__ movp(Operand(rbp, kInputStartMinusOne), rax);
#if V8_OS_WIN
// Ensure that we have written to each stack page, in order. Skipping a page
// on Windows can cause segmentation faults. Assuming page size is 4k.
const int kPageSize = 4096;
const int kRegistersPerPage = kPageSize / kPointerSize;
for (int i = num_saved_registers_ + kRegistersPerPage - 1;
i < num_registers_;
i += kRegistersPerPage) {
__ movp(register_location(i), rax); // One write every page.
}
#endif // V8_OS_WIN
// Initialize code object pointer.
__ Move(code_object_pointer(), masm_.CodeObject());
Label load_char_start_regexp, start_regexp;
// Load newline if index is at start, previous character otherwise.
__ cmpl(Operand(rbp, kStartIndex), Immediate(0));
__ j(not_equal, &load_char_start_regexp, Label::kNear);
__ Set(current_character(), '\n');
__ jmp(&start_regexp, Label::kNear);
// Global regexp restarts matching here.
__ bind(&load_char_start_regexp);
// Load previous char as initial value of current character register.
LoadCurrentCharacterUnchecked(-1, 1);
__ bind(&start_regexp);
// Initialize on-stack registers.
if (num_saved_registers_ > 0) {
// Fill saved registers with initial value = start offset - 1
// Fill in stack push order, to avoid accessing across an unwritten
// page (a problem on Windows).
if (num_saved_registers_ > 8) {
__ Set(rcx, kRegisterZero);
Label init_loop;
__ bind(&init_loop);
__ movp(Operand(rbp, rcx, times_1, 0), rax);
__ subq(rcx, Immediate(kPointerSize));
__ cmpq(rcx,
Immediate(kRegisterZero - num_saved_registers_ * kPointerSize));
__ j(greater, &init_loop);
} else { // Unroll the loop.
for (int i = 0; i < num_saved_registers_; i++) {
__ movp(register_location(i), rax);
}
}
}
// Initialize backtrack stack pointer.
__ movp(backtrack_stackpointer(), Operand(rbp, kStackHighEnd));
__ jmp(&start_label_);
// Exit code:
if (success_label_.is_linked()) {
// Save captures when successful.
__ bind(&success_label_);
if (num_saved_registers_ > 0) {
// copy captures to output
__ movp(rdx, Operand(rbp, kStartIndex));
__ movp(rbx, Operand(rbp, kRegisterOutput));
__ movp(rcx, Operand(rbp, kInputEnd));
__ subp(rcx, Operand(rbp, kInputStart));
if (mode_ == UC16) {
__ leap(rcx, Operand(rcx, rdx, times_2, 0));
} else {
__ addp(rcx, rdx);
}
for (int i = 0; i < num_saved_registers_; i++) {
__ movp(rax, register_location(i));
if (i == 0 && global_with_zero_length_check()) {
// Keep capture start in rdx for the zero-length check later.
__ movp(rdx, rax);
}
__ addp(rax, rcx); // Convert to index from start, not end.
if (mode_ == UC16) {
__ sarp(rax, Immediate(1)); // Convert byte index to character index.
}
__ movl(Operand(rbx, i * kIntSize), rax);
}
}
if (global()) {
// Restart matching if the regular expression is flagged as global.
// Increment success counter.
__ incp(Operand(rbp, kSuccessfulCaptures));
// Capture results have been stored, so the number of remaining global
// output registers is reduced by the number of stored captures.
__ movsxlq(rcx, Operand(rbp, kNumOutputRegisters));
__ subp(rcx, Immediate(num_saved_registers_));
// Check whether we have enough room for another set of capture results.
__ cmpp(rcx, Immediate(num_saved_registers_));
__ j(less, &exit_label_);
__ movp(Operand(rbp, kNumOutputRegisters), rcx);
// Advance the location for output.
__ addp(Operand(rbp, kRegisterOutput),
Immediate(num_saved_registers_ * kIntSize));
// Prepare rax to initialize registers with its value in the next run.
__ movp(rax, Operand(rbp, kInputStartMinusOne));
if (global_with_zero_length_check()) {
// Special case for zero-length matches.
// rdx: capture start index
__ cmpp(rdi, rdx);
// Not a zero-length match, restart.
__ j(not_equal, &load_char_start_regexp);
// rdi (offset from the end) is zero if we already reached the end.
__ testp(rdi, rdi);
__ j(zero, &exit_label_, Label::kNear);
// Advance current position after a zero-length match.
if (mode_ == UC16) {
__ addq(rdi, Immediate(2));
} else {
__ incq(rdi);
}
}
__ jmp(&load_char_start_regexp);
} else {
__ movp(rax, Immediate(SUCCESS));
}
}
__ bind(&exit_label_);
if (global()) {
// Return the number of successful captures.
__ movp(rax, Operand(rbp, kSuccessfulCaptures));
}
__ bind(&return_rax);
#ifdef _WIN64
// Restore callee save registers.
__ leap(rsp, Operand(rbp, kLastCalleeSaveRegister));
__ popq(rbx);
__ popq(rdi);
__ popq(rsi);
// Stack now at rbp.
#else
// Restore callee save register.
__ movp(rbx, Operand(rbp, kBackup_rbx));
// Skip rsp to rbp.
__ movp(rsp, rbp);
#endif
// Exit function frame, restore previous one.
__ popq(rbp);
__ ret(0);
// Backtrack code (branch target for conditional backtracks).
if (backtrack_label_.is_linked()) {
__ bind(&backtrack_label_);
Backtrack();
}
Label exit_with_exception;
// Preempt-code
if (check_preempt_label_.is_linked()) {
SafeCallTarget(&check_preempt_label_);
__ pushq(backtrack_stackpointer());
__ pushq(rdi);
CallCheckStackGuardState();
__ testp(rax, rax);
// If returning non-zero, we should end execution with the given
// result as return value.
__ j(not_zero, &return_rax);
// Restore registers.
__ Move(code_object_pointer(), masm_.CodeObject());
__ popq(rdi);
__ popq(backtrack_stackpointer());
// String might have moved: Reload esi from frame.
__ movp(rsi, Operand(rbp, kInputEnd));
SafeReturn();
}
// Backtrack stack overflow code.
if (stack_overflow_label_.is_linked()) {
SafeCallTarget(&stack_overflow_label_);
// Reached if the backtrack-stack limit has been hit.
Label grow_failed;
// Save registers before calling C function
#ifndef _WIN64
// Callee-save in Microsoft 64-bit ABI, but not in AMD64 ABI.
__ pushq(rsi);
__ pushq(rdi);
#endif
// Call GrowStack(backtrack_stackpointer())
static const int num_arguments = 3;
__ PrepareCallCFunction(num_arguments);
#ifdef _WIN64
// Microsoft passes parameters in rcx, rdx, r8.
// First argument, backtrack stackpointer, is already in rcx.
__ leap(rdx, Operand(rbp, kStackHighEnd)); // Second argument
__ LoadAddress(r8, ExternalReference::isolate_address(isolate()));
#else
// AMD64 ABI passes parameters in rdi, rsi, rdx.
__ movp(rdi, backtrack_stackpointer()); // First argument.
__ leap(rsi, Operand(rbp, kStackHighEnd)); // Second argument.
__ LoadAddress(rdx, ExternalReference::isolate_address(isolate()));
#endif
ExternalReference grow_stack =
ExternalReference::re_grow_stack(isolate());
__ CallCFunction(grow_stack, num_arguments);
// If return NULL, we have failed to grow the stack, and
// must exit with a stack-overflow exception.
__ testp(rax, rax);
__ j(equal, &exit_with_exception);
// Otherwise use return value as new stack pointer.
__ movp(backtrack_stackpointer(), rax);
// Restore saved registers and continue.
__ Move(code_object_pointer(), masm_.CodeObject());
#ifndef _WIN64
__ popq(rdi);
__ popq(rsi);
#endif
SafeReturn();
}
if (exit_with_exception.is_linked()) {
// If any of the code above needed to exit with an exception.
__ bind(&exit_with_exception);
// Exit with Result EXCEPTION(-1) to signal thrown exception.
__ Set(rax, EXCEPTION);
__ jmp(&return_rax);
}
FixupCodeRelativePositions();
CodeDesc code_desc;
masm_.GetCode(&code_desc);
Isolate* isolate = this->isolate();
Handle<Code> code = isolate->factory()->NewCode(
code_desc, Code::ComputeFlags(Code::REGEXP),
masm_.CodeObject());
PROFILE(isolate, RegExpCodeCreateEvent(*code, *source));
return Handle<HeapObject>::cast(code);
}
void RegExpMacroAssemblerX64::GoTo(Label* to) {
BranchOrBacktrack(no_condition, to);
}
void RegExpMacroAssemblerX64::IfRegisterGE(int reg,
int comparand,
Label* if_ge) {
__ cmpp(register_location(reg), Immediate(comparand));
BranchOrBacktrack(greater_equal, if_ge);
}
void RegExpMacroAssemblerX64::IfRegisterLT(int reg,
int comparand,
Label* if_lt) {
__ cmpp(register_location(reg), Immediate(comparand));
BranchOrBacktrack(less, if_lt);
}
void RegExpMacroAssemblerX64::IfRegisterEqPos(int reg,
Label* if_eq) {
__ cmpp(rdi, register_location(reg));
BranchOrBacktrack(equal, if_eq);
}
RegExpMacroAssembler::IrregexpImplementation
RegExpMacroAssemblerX64::Implementation() {
return kX64Implementation;
}
void RegExpMacroAssemblerX64::LoadCurrentCharacter(int cp_offset,
Label* on_end_of_input,
bool check_bounds,
int characters) {
DCHECK(cp_offset >= -1); // ^ and \b can look behind one character.
DCHECK(cp_offset < (1<<30)); // Be sane! (And ensure negation works)
if (check_bounds) {
CheckPosition(cp_offset + characters - 1, on_end_of_input);
}
LoadCurrentCharacterUnchecked(cp_offset, characters);
}
void RegExpMacroAssemblerX64::PopCurrentPosition() {
Pop(rdi);
}
void RegExpMacroAssemblerX64::PopRegister(int register_index) {
Pop(rax);
__ movp(register_location(register_index), rax);
}
void RegExpMacroAssemblerX64::PushBacktrack(Label* label) {
Push(label);
CheckStackLimit();
}
void RegExpMacroAssemblerX64::PushCurrentPosition() {
Push(rdi);
}
void RegExpMacroAssemblerX64::PushRegister(int register_index,
StackCheckFlag check_stack_limit) {
__ movp(rax, register_location(register_index));
Push(rax);
if (check_stack_limit) CheckStackLimit();
}
STATIC_ASSERT(kPointerSize == kInt64Size || kPointerSize == kInt32Size);
void RegExpMacroAssemblerX64::ReadCurrentPositionFromRegister(int reg) {
if (kPointerSize == kInt64Size) {
__ movq(rdi, register_location(reg));
} else {
// Need sign extension for x32 as rdi might be used as an index register.
__ movsxlq(rdi, register_location(reg));
}
}
void RegExpMacroAssemblerX64::ReadPositionFromRegister(Register dst, int reg) {
if (kPointerSize == kInt64Size) {
__ movq(dst, register_location(reg));
} else {
// Need sign extension for x32 as dst might be used as an index register.
__ movsxlq(dst, register_location(reg));
}
}
void RegExpMacroAssemblerX64::ReadStackPointerFromRegister(int reg) {
__ movp(backtrack_stackpointer(), register_location(reg));
__ addp(backtrack_stackpointer(), Operand(rbp, kStackHighEnd));
}
void RegExpMacroAssemblerX64::SetCurrentPositionFromEnd(int by) {
Label after_position;
__ cmpp(rdi, Immediate(-by * char_size()));
__ j(greater_equal, &after_position, Label::kNear);
__ movq(rdi, Immediate(-by * char_size()));
// On RegExp code entry (where this operation is used), the character before
// the current position is expected to be already loaded.
// We have advanced the position, so it's safe to read backwards.
LoadCurrentCharacterUnchecked(-1, 1);
__ bind(&after_position);
}
void RegExpMacroAssemblerX64::SetRegister(int register_index, int to) {
DCHECK(register_index >= num_saved_registers_); // Reserved for positions!
__ movp(register_location(register_index), Immediate(to));
}
bool RegExpMacroAssemblerX64::Succeed() {
__ jmp(&success_label_);
return global();
}
void RegExpMacroAssemblerX64::WriteCurrentPositionToRegister(int reg,
int cp_offset) {
if (cp_offset == 0) {
__ movp(register_location(reg), rdi);
} else {
__ leap(rax, Operand(rdi, cp_offset * char_size()));
__ movp(register_location(reg), rax);
}
}
void RegExpMacroAssemblerX64::ClearRegisters(int reg_from, int reg_to) {
DCHECK(reg_from <= reg_to);
__ movp(rax, Operand(rbp, kInputStartMinusOne));
for (int reg = reg_from; reg <= reg_to; reg++) {
__ movp(register_location(reg), rax);
}
}
void RegExpMacroAssemblerX64::WriteStackPointerToRegister(int reg) {
__ movp(rax, backtrack_stackpointer());
__ subp(rax, Operand(rbp, kStackHighEnd));
__ movp(register_location(reg), rax);
}
// Private methods:
void RegExpMacroAssemblerX64::CallCheckStackGuardState() {
// This function call preserves no register values. Caller should
// store anything volatile in a C call or overwritten by this function.
static const int num_arguments = 3;
__ PrepareCallCFunction(num_arguments);
#ifdef _WIN64
// Second argument: Code* of self. (Do this before overwriting r8).
__ movp(rdx, code_object_pointer());
// Third argument: RegExp code frame pointer.
__ movp(r8, rbp);
// First argument: Next address on the stack (will be address of
// return address).
__ leap(rcx, Operand(rsp, -kPointerSize));
#else
// Third argument: RegExp code frame pointer.
__ movp(rdx, rbp);
// Second argument: Code* of self.
__ movp(rsi, code_object_pointer());
// First argument: Next address on the stack (will be address of
// return address).
__ leap(rdi, Operand(rsp, -kRegisterSize));
#endif
ExternalReference stack_check =
ExternalReference::re_check_stack_guard_state(isolate());
__ CallCFunction(stack_check, num_arguments);
}
// Helper function for reading a value out of a stack frame.
template <typename T>
static T& frame_entry(Address re_frame, int frame_offset) {
return reinterpret_cast<T&>(Memory::int32_at(re_frame + frame_offset));
}
template <typename T>
static T* frame_entry_address(Address re_frame, int frame_offset) {
return reinterpret_cast<T*>(re_frame + frame_offset);
}
int RegExpMacroAssemblerX64::CheckStackGuardState(Address* return_address,
Code* re_code,
Address re_frame) {
return NativeRegExpMacroAssembler::CheckStackGuardState(
frame_entry<Isolate*>(re_frame, kIsolate),
frame_entry<int>(re_frame, kStartIndex),
frame_entry<int>(re_frame, kDirectCall) == 1, return_address, re_code,
frame_entry_address<String*>(re_frame, kInputString),
frame_entry_address<const byte*>(re_frame, kInputStart),
frame_entry_address<const byte*>(re_frame, kInputEnd));
}
Operand RegExpMacroAssemblerX64::register_location(int register_index) {
DCHECK(register_index < (1<<30));
if (num_registers_ <= register_index) {
num_registers_ = register_index + 1;
}
return Operand(rbp, kRegisterZero - register_index * kPointerSize);
}
void RegExpMacroAssemblerX64::CheckPosition(int cp_offset,
Label* on_outside_input) {
__ cmpl(rdi, Immediate(-cp_offset * char_size()));
BranchOrBacktrack(greater_equal, on_outside_input);
}
void RegExpMacroAssemblerX64::BranchOrBacktrack(Condition condition,
Label* to) {
if (condition < 0) { // No condition
if (to == NULL) {
Backtrack();
return;
}
__ jmp(to);
return;
}
if (to == NULL) {
__ j(condition, &backtrack_label_);
return;
}
__ j(condition, to);
}
void RegExpMacroAssemblerX64::SafeCall(Label* to) {
__ call(to);
}
void RegExpMacroAssemblerX64::SafeCallTarget(Label* label) {
__ bind(label);
__ subp(Operand(rsp, 0), code_object_pointer());
}
void RegExpMacroAssemblerX64::SafeReturn() {
__ addp(Operand(rsp, 0), code_object_pointer());
__ ret(0);
}
void RegExpMacroAssemblerX64::Push(Register source) {
DCHECK(!source.is(backtrack_stackpointer()));
// Notice: This updates flags, unlike normal Push.
__ subp(backtrack_stackpointer(), Immediate(kIntSize));
__ movl(Operand(backtrack_stackpointer(), 0), source);
}
void RegExpMacroAssemblerX64::Push(Immediate value) {
// Notice: This updates flags, unlike normal Push.
__ subp(backtrack_stackpointer(), Immediate(kIntSize));
__ movl(Operand(backtrack_stackpointer(), 0), value);
}
void RegExpMacroAssemblerX64::FixupCodeRelativePositions() {
for (int i = 0, n = code_relative_fixup_positions_.length(); i < n; i++) {
int position = code_relative_fixup_positions_[i];
// The position succeeds a relative label offset from position.
// Patch the relative offset to be relative to the Code object pointer
// instead.
int patch_position = position - kIntSize;
int offset = masm_.long_at(patch_position);
masm_.long_at_put(patch_position,
offset
+ position
+ Code::kHeaderSize
- kHeapObjectTag);
}
code_relative_fixup_positions_.Clear();
}
void RegExpMacroAssemblerX64::Push(Label* backtrack_target) {
__ subp(backtrack_stackpointer(), Immediate(kIntSize));
__ movl(Operand(backtrack_stackpointer(), 0), backtrack_target);
MarkPositionForCodeRelativeFixup();
}
void RegExpMacroAssemblerX64::Pop(Register target) {
DCHECK(!target.is(backtrack_stackpointer()));
__ movsxlq(target, Operand(backtrack_stackpointer(), 0));
// Notice: This updates flags, unlike normal Pop.
__ addp(backtrack_stackpointer(), Immediate(kIntSize));
}
void RegExpMacroAssemblerX64::Drop() {
__ addp(backtrack_stackpointer(), Immediate(kIntSize));
}
void RegExpMacroAssemblerX64::CheckPreemption() {
// Check for preemption.
Label no_preempt;
ExternalReference stack_limit =
ExternalReference::address_of_stack_limit(isolate());
__ load_rax(stack_limit);
__ cmpp(rsp, rax);
__ j(above, &no_preempt);
SafeCall(&check_preempt_label_);
__ bind(&no_preempt);
}
void RegExpMacroAssemblerX64::CheckStackLimit() {
Label no_stack_overflow;
ExternalReference stack_limit =
ExternalReference::address_of_regexp_stack_limit(isolate());
__ load_rax(stack_limit);
__ cmpp(backtrack_stackpointer(), rax);
__ j(above, &no_stack_overflow);
SafeCall(&stack_overflow_label_);
__ bind(&no_stack_overflow);
}
void RegExpMacroAssemblerX64::LoadCurrentCharacterUnchecked(int cp_offset,
int characters) {
if (mode_ == LATIN1) {
if (characters == 4) {
__ movl(current_character(), Operand(rsi, rdi, times_1, cp_offset));
} else if (characters == 2) {
__ movzxwl(current_character(), Operand(rsi, rdi, times_1, cp_offset));
} else {
DCHECK(characters == 1);
__ movzxbl(current_character(), Operand(rsi, rdi, times_1, cp_offset));
}
} else {
DCHECK(mode_ == UC16);
if (characters == 2) {
__ movl(current_character(),
Operand(rsi, rdi, times_1, cp_offset * sizeof(uc16)));
} else {
DCHECK(characters == 1);
__ movzxwl(current_character(),
Operand(rsi, rdi, times_1, cp_offset * sizeof(uc16)));
}
}
}
#undef __
#endif // V8_INTERPRETED_REGEXP
} // namespace internal
} // namespace v8
#endif // V8_TARGET_ARCH_X64
```
|
The Balances Mechanics (; from balances of bookkeeping respectively the credit system and mechanics to characterize the strict universal identities) is a work and mean of economics, comparable with Stock-Flow Consistent Modelling. Statements of Balances Mechanics are not based on assumptions and preconditions of a model but are of trivial arithmetic nature, usually shaped as equation and universal without restrictions. Balances Mechanics were developed by Wolfgang Stützel and published in his books Paradoxa der Geld- und Konkurrenzwirtschaft (Paradoxes of Competition-Based Monetary Economies) and Volkswirtschaftliche Saldenmechanik (Balances Mechanics of Economics).
Overview
Balances Mechanics deals with interrelations, the validity of which – contrary to most economics postulates – does not depend on assumptions about human behaviour. Balances Mechanics allows to put these frequently necessary assumptions of economic theories and postulates onto a logic fundament of overall economics thinking (Size Mechanics). Previously false conclusions in pricing theory, theory of money, and trade cycle theory, resulting from single economy thinking (partial sentence) are overcome by a correct micro foundation and introduction of the real existing credit economy to the modeling (global sentence, size mechanics/relational sentence).
For example, from the view of the single economy experience it seems to be absolutely logical that rising expenses of a national economy go along with a rising need for medium of exchange in terms of quantity theory. From the view of Balances Mechanics one recognizes, with regard to the counter entry, that growing expenses in overall economy mean growing revenues as well and that, for instance, at payment lock step there is no correlation at all between overall sales volume and need for medium of exchange.
Beside the mechanics of the real identities, in particular of buy surplus and sales surplus, it is just the insight from Balances Mechanics thinking that shows many issues, which commonly and with levity are viewed as connected, are not connected mechanically at all. Stützel uses the term "problem plaitings" () when e.g. the equilibrium of the plans for changes of money assets are identified as invalid with the lock step of those changes and the steady state of the overall expenses or the capital stock. Similar applies to Balances Mechanics of – strictly viewed as separated – operations of money assets and operations of medium of exchange, which can only enable a self-consistent clarification of the interrelations between money system and real economy by using a clear distinction.
Balances Mechanics thus uses the interrelations of real identities and reveals serious fallacies of model making from wrongly assumed identities (ex ante equilibrium conditions/ex post identity equations).
Basic concepts
Bank money creation and Credit Mechanics
Balances Mechanics considers the mechanics of private credit creation and recognizes the credit mechanics, which comes from Otto Pfleiderer and Wilhelm Lautenbach. (Wolfgang Stützel often spoke of the "Lautenbachsche Kreditmechanik").
From the mechanics of giving a loan it becomes obvious: Once a debtor uses its credit entry, which corresponds to a liability, as payment for a purchase at the market, by Balances Mechanics this creates a surplus of the debtors expenses over its revenues. With that the remainder of the economy has a surplus of revenues over expenses.
This business relationship (temporarily) created new fiat money (if the seller does not use the received money to pay back own bank liabilities). and in tendency leads to national economy value added (in a phase of growing economy only).
This relativises common statements by classic theories which claim that so called capital collector locations would loan deposits from savers to debtors. Because the surplus of expenses of a debtor enables additional property to the economy (lowering liabilities, increasing monetary property) it is valid to say , in no case the opposite.
Economic entities, groups and the overall economy
Stützel distinguishes the totality of all economic entities (overall economy) and groups of economic entities. A group is defined as the totality of all economic entities minus at least one economic entity.
Group of economic entities < Sum of all economic entities (overall economy)
Thereby a group also can be a single economic entity. Each group has a complementary group, so that the sum of group plus complementary group gives the overall economy.
Group + Complementary Group = Overall Economy
Examples for groups are all private households of a national economy or all companies of a national economy. The group of private economic entities (private sector) is the sum of all companies and all private households.
A national economy is a group as well. It is the sum of all economic entities of a nation (following the inland concept, these are all economic entities inside a state territorium; following the inhabitant concept, these are all economic entities of same nationality).
The complementary group to the sector of private households are all not-households (state, companies, foreign countries). The complementary group of a national economy are all other national economies, the foreign country sector.
So groups can be defined as needed and for a certain purpose.
Sentence categories
Three sentences about the relationship of groups and overall economy can be set:
Partial sentences: These are sentences, which are valid for groups and individual economic entities.
Global sentences: These are sentences, which are valid for the totality of all economic entities.
Size Mechanics: Tells under what conditions (the behaviour of the complementary group) statements for groups and single entities are valid (partial sentences).
When a partial sentence is applied to the totality of economic entities then that is a fallacy of composition.
Example:
Partial sentence: A company rises its sales volume when it lowers its prices.
Global sentence: If all companies lower their prices, sales do not change but the price level lowers.
Size mechanics: A company can only rise its sales volume if the complementary group (all other companies) keeps its prices.
This example is an application of the paradox of competition (Konkurrenzparadoxon).
Single economy and overall economy buildup of money assets
For a single economic entity and groups of economic entities the partial sentence is valid, that the entities can rise their net-money assets by surplus of revenues (partial sentence):
Revenues – Expenses = ΔNet money assets
Furthermore, it is valid that the expense of an economic entity A is the revenue of an economic entity B:
Expense A = Revenue B
A purchase of a good by a customer leads to a revenue to the seller, the wage payment of an employer leads to the revenue of a worker and so on. Because every expense faces a revenue (and every revenue faces an expense) the sum of all expenses must be the sum of all revenues:
Sum revenues = Sum expenses
From that the global sentence derives that the aggregate expense-revenue-balance of a closed aggregate economy equals zero (current account/performance record). This is valid for the global economy and closed national economies. Open national economies are groups because they can have a current account balance value. For them the partial sentence is valid that their net money assets can differ from zero. In addition, it is valid that every debt claim of an economic entity corresponds to a liability of an other economic entity, so that the sum of all claims necessarily corresponds to the sum of all liabilities:
Sum claims = Sum liabilities
From that comes the global sentence that the aggregate net financial assets of a closed economy (all claims minus all liabilities) necessarily is Zero. The same is valid for changes of claims and liabilities:
Sum Δclaims = Sum Δliabilities
Here the Global Sentence is:
The totality of economic entities cannot rise or lower their overall net money assets.
After all the Size Mechanics shows the conditions which make the partial sentence valid that individuals and groups can change their net money assets by expense-revenue-balances:
A group can only rise its net money assets (by surplus of revenue) if its complementary group (the remaining of all economy subjects, literally spoken the rest of the world) lowers its net money assets with the same amount (by an expenses surplus).
Balance of a single economic entity
Every economic entity (individuals, private households, companies, states, national economies etc.) has a balance sheet which consists of assets (activa) and liabilities (passiva). On the assets side there is the tangible assets (examples: machines, buildings, etc.) and the accounts receivable (examples: money, shares, bonds, etc.). On the liabilities side there are the liabilities and the net worth (also called equity).
So it is valid for each economic entity:
net worth = tangible assets + claims – liabilities
Claims minus liabilities equals net money assets:
net money assets = claims – liabilities
The claims can be divided into medium of exchange and other claims:
claims = medium of exchange + other claims
Generally all "other claims" can be converted into a medium of exchange by monetization. Debt claims against business banks are monetized claims because they commonly are accepted as fiat money as medium of exchange.
Application fields
Analysis of money assets streams
The most essential application field of Balances Mechanics in economics is the analysis of changes in net financial assets. Net financial assets is the margin between claims and liabilities and changes with the expense-revenue-balances. In contrast to that, the money creation of the bank system generates medium of exchange against debt (in which an accurate demarcation of medium of exchange as part of the monetary assets is not possible).
Revenue surpluses of a group are only possible if the complementary group enables an expense surplus. Economic relationships always are two-sided, because every expense comes up to a revenue and every debt to a claim. If an economic entity gains more than it spends, the complementary group must spend more than it gains:
Revenue surplus of one group = Expense surplus of the complementary group
If individual economic entities cut their expenses, so that their expenses are lower than their revenues the global sentence is as follows:
A decline of expenses always leads to a decline of revenues and never to a revenue surplus.
At each economy subject (in the meaning of every individual) revenues and expenses can differ, for all economy subjects (in the meaning of all together) revenues and expenses compulsorily must be equal.
For example, it counts:
Surplus of the private households (financial saving) = expenses surplus of the companies + expenses surplus of the state (state deficit) + expenses surplus of foreign countries (trade balance).
The overall national accounts includes the revenues and expenses surplus (funding balances) of the individual sectors of the national economy (including the foreign sector) and thus it appears: the sum of funding balances of all individual sectors (difference between revenues and expenses) results to Zero.
Action Concurrency and credit demand
Action Concurrency refers to the revenues and expenses balances of a group of agents in any period and describes their similarity in actions at the same time. Stützel defines Action Concurrency as follows:
"Action Concurrency occurs, when - by accidence - the same that applies to the overall economy, applies to individual agents, too"
For example, if revenues would be fully spent (without delay) in favor of other agents and all other agents act the same way (strict revenue-expense concurrency), then the demand for credit of each of the agents would be zero. According to the Size Mechanics theorem, credit demand occurs only if the complementary group generates savings through spending less than is earned:
"Credit demand is a function of the deviation from expenses concurrency, not a function of the level of expenses."
Balances Mechanics and trade cycle theory
Balances Mechanics itself is no trade cycle theory, but it allows the accurate micro founding of the behaviour assumptions needed.
At buyers markets the plans for consumption and investment determine the overall expenses, and with that the overall revenues and the economic cycle. Balances Mechanics allows, with the modeling of the real existing credit economy instead of an imaginary barter economy, to picture the influences of the financial system on the expenses plans.
The starting point is the balance of the individual economies' and the state's plans for building monetary assets. If the balance of the plans for building money assets (plans for sales surplus) has a surplus over the plans for money assets reduction (plans for buy surplus) this generates a negative momentum. As a consequence, economic actors overall -as expected- make less expenses in the following periods when they reduce money assets unplanned and make more expenses in the opposite case when their money assets increase by planning.
This momentum is reinforced by the multiplier which results from the average willingness of the economic actors to accept unplanned changes of their money assets.
Wolfgang Stützel describes a theoretical edge case where the state at all costs wants to enforce a buildup of own money assets, but where no private actor wants to accept a reduction of its money assets: "Economy would instantly stand still." He goes on: "In this case the Keynes-multiplier would be negative and of infinite number. Because the sum of plans to heighten money assets would at any revenue level exceed the concurrent plans for reducing money assets."
Balances Mechanics allows from the ex-post-analysis of the funding balances of the macroeconomic accounting (national accounts) as well as from the Balances Mechanics of national debt and in connection with only a few behavioral assumptions, to give very specific policy recommendations in order to limit national debt.
In 2002 Ewald Nowotny for instance explained: "Significant for economy politics thereby is the compulsory Balances Mechanics relationship, that a policy aiming at reducing budget deficits (funding consolidation) can only be successful when it succeeds in reducing the financial surplus of the private households (e.g. by higher private consumption) and/or in rising the debt willingness of companies (for instance, by investments) and/or in improving the trade balance (for example, by additional export)."
See also
Paradox of thrift
Paradox of competition
Sectoral balances
References
Literature
Wolfgang Stützel: Volkswirtschaftliche Saldenmechanik. Ein Beitrag zur Geldtheorie. Mohr (Siebeck). Tübingen 1958, Nachdruck der 2. Auflage. Tübingen 2011. (preview at google books)
Wolfgang Stützel: Paradoxa der Geld- und Konkurrenzwirtschaft. Scientia. Aalen 1979.
Fabian Lindner: Saving does not Finance Investment. Accounting as an Indispensable Tool for Economic Theory. IMK Working Paper 100, October 2012. Düsseldorf: Macroeconomic Policy Institute (download)
Johannes Schmidt: Reforming the Undergraduate Macroeconomics Curriculum: The Case for a Thorough Treatment of Accounting Relationships. Discussion Paper 2/2016, Faculty of Management Science and Engineering. Karlsruhe: Hochschule Technik und Wirtschaft (download)
Wolfgang Theil: Systematic Legal Foundations for Monetary Economics. Working Paper presented at WINIR Symposium on Property Rights, April 2016, Bristol UK (download) - last section connects law and accounting to Stützel's mechanics of balances.
External links
Johannes Schmidt: Sparen - Fluch oder Segen? Anmerkungen zu einem alten Problem aus der Sicht der Saldenmechanik. (PDF; 125 kB)
Fabian Lindner's Blog on Balance Mechanics
Macroeconomics
Economic methods
|
The men's high jump event at the 1982 European Athletics Indoor Championships was held on 6 March.
Results
References
High jump at the European Athletics Indoor Championships
High
|
Hope Olson may refer to:
Hope A. Olson, a library scholar known for her critical analyses of classification systems
Hope Olson (born April 4, 1956), an American model
|
Simona Manzaneda (1770-1816) was a Bolivian heroine. Together with Vicenta Juaristi Eguino and Úrsula Goyzueta, she is counted as one of the three heroines of the Bolivian War of Independence.
References
Roca, José Luis (2007). Ni con Lima ni con Buenos Aires: la formación de un estado nacional en Charcas. Plural editores. .
1770 births
1816 deaths
Bolivian rebels
19th-century Bolivian people
People of the Bolivian War of Independence
Women in 19th-century warfare
|
```go
// Unless explicitly stated otherwise all files in this repository are licensed
// This product includes software developed at Datadog (path_to_url
// Package serverstore implements storing logic for fakeintake server
// Stores raw payloads and try parsing known payloads dumping them to json
package serverstore
import (
"errors"
"fmt"
"log"
"time"
"github.com/prometheus/client_golang/prometheus"
"github.com/DataDog/datadog-agent/test/fakeintake/api"
)
// Store is the interface for a store that can store payloads and try parsing them
type Store interface {
// AppendPayload adds a payload to the store and tries parsing and adding a dumped json to the parsed store
AppendPayload(route string, data []byte, encoding string, contentType string, collectTime time.Time) error
// CleanUpPayloadsOlderThan removes payloads older than the given time
CleanUpPayloadsOlderThan(time.Time)
// GetRawPayloads returns all raw payloads for a given route
GetRawPayloads(route string) []api.Payload
// GetRouteStats returns the number of payloads for each route
GetRouteStats() map[string]int
// Flush flushes the store
Flush()
// GetInternalMetrics returns the prometheus metrics for the store
GetInternalMetrics() []prometheus.Collector
// Close closes the store
Close()
}
// NewStore returns a new store
func NewStore(driver string) Store {
if driver == "sql" {
return newSQLStore()
}
return newInMemoryStore()
}
// GetJSONPayloads returns the parsed payloads for a given route
func GetJSONPayloads(store Store, route string) ([]api.ParsedPayload, error) {
parser, ok := parserMap[route]
if !ok {
return nil, fmt.Errorf("no parser for route %s", route)
}
payloads := store.GetRawPayloads(route)
parsedPayloads := make([]api.ParsedPayload, 0, len(payloads))
var errs []error
for _, payload := range payloads {
parsedPayload, err := parser(payload)
if err != nil {
log.Printf("failed to parse payload %+v: %v\n", payload, err)
errs = append(errs, err)
continue
}
parsedPayloads = append(parsedPayloads, api.ParsedPayload{
Timestamp: payload.Timestamp,
Data: parsedPayload,
Encoding: payload.Encoding,
})
}
return parsedPayloads, errors.Join(errs...)
}
```
|
Linoleum is a material used for floor covering and also by artists for linocut prints.
Linoleum may also refer to:
Linoleum (band), a London-based musical group
Linoleum (EP), an EP by progressive metal band Pain Of Salvation
Linoleum (film), a 2022 film starring Jim Gaffigan
"Linoléum", a song by Dumas
"Linoleum", a track on the album Punk in Drublic by the Californian punk rock band NOFX
See also
Linoleum knife, a small knife
|
```objective-c
function [J, grad] = linearRegCostFunction(X, y, theta, lambda)
%LINEARREGCOSTFUNCTION Compute cost and gradient for regularized linear
%regression with multiple variables
% [J, grad] = LINEARREGCOSTFUNCTION(X, y, theta, lambda) computes the
% cost of using theta as the parameter for linear regression to fit the
% data points in X and y. Returns the cost in J and the gradient in grad
% Initialize some useful values
m = length(y); % number of training examples
% You need to return the following variables correctly
J = 0;
grad = zeros(size(theta));
% ====================== YOUR CODE HERE ======================
% Instructions: Compute the cost and gradient of regularized linear
% regression for a particular choice of theta.
%
% You should set J to the cost and grad to the gradient.
%
real_theta = theta(2:end, :);
regularization = lambda * sum(real_theta .^ 2) / (2 * m);
prediction = sum(((X * theta) .- y) .^ 2) / (2 * m);
J = prediction + regularization;
mask = ones(size(theta));
mask(1) = 0;
gradient0 = sum(((X * theta) .- y) .* X) / m;
offset = lambda * (theta .* mask) / m;
gradient = gradient0 .+ offset';
grad = gradient;
% =========================================================================
grad = grad(:);
end
```
|
```javascript
/**
* Sample React Native App
* path_to_url
* @flow
*/
import React, { Component } from "react";
import {
StyleSheet,
Text,
TouchableOpacity,
View,
Clipboard,
Platform,
ScrollView
} from "react-native";
import { StackNavigator } from "react-navigation";
import FCM, { NotificationActionType } from "react-native-fcm";
import { registerKilledListener, registerAppListener } from "./Listeners";
import firebaseClient from "./FirebaseClient";
registerKilledListener();
class MainPage extends Component {
constructor(props) {
super(props);
this.state = {
token: "",
tokenCopyFeedback: ""
};
}
async componentDidMount() {
//FCM.createNotificationChannel is mandatory for Android targeting >=8. Otherwise you won't see any notification
FCM.createNotificationChannel({
id: 'default',
name: 'Default',
description: 'used for example',
priority: 'high'
})
registerAppListener(this.props.navigation);
FCM.getInitialNotification().then(notif => {
this.setState({
initNotif: notif
});
if (notif && notif.targetScreen === "detail") {
setTimeout(() => {
this.props.navigation.navigate("Detail");
}, 500);
}
});
try {
let result = await FCM.requestPermissions({
badge: false,
sound: true,
alert: true
});
} catch (e) {
console.error(e);
}
FCM.getFCMToken().then(token => {
console.log("TOKEN (getFCMToken)", token);
this.setState({ token: token || "" });
});
if (Platform.OS === "ios") {
FCM.getAPNSToken().then(token => {
console.log("APNS TOKEN (getFCMToken)", token);
});
}
// topic example
// FCM.subscribeToTopic('sometopic')
// FCM.unsubscribeFromTopic('sometopic')
}
showLocalNotification() {
FCM.presentLocalNotification({
channel: 'default',
id: new Date().valueOf().toString(), // (optional for instant notification)
title: "Test Notification with action", // as FCM payload
body: "Force touch to reply", // as FCM payload (required)
sound: "bell.mp3", // "default" or filename
priority: "high", // as FCM payload
click_action: "com.myapp.MyCategory", // as FCM payload - this is used as category identifier on iOS.
badge: 10, // as FCM payload IOS only, set 0 to clear badges
number: 10, // Android only
ticker: "My Notification Ticker", // Android only
auto_cancel: true, // Android only (default true)
large_icon:
"path_to_url", // Android only
icon: "ic_launcher", // as FCM payload, you can relace this with custom icon you put in mipmap
big_text: "Show when notification is expanded", // Android only
sub_text: "This is a subText", // Android only
color: "red", // Android only
vibrate: 300, // Android only default: 300, no vibration if you pass 0
wake_screen: true, // Android only, wake up screen when notification arrives
group: "group", // Android only
picture:
"path_to_url", // Android only bigPicture style
ongoing: true, // Android only
my_custom_data: "my_custom_field_value", // extra data you want to throw
lights: true, // Android only, LED blinking (default false)
show_in_foreground: true // notification when app is in foreground (local & remote)
});
}
scheduleLocalNotification() {
FCM.scheduleLocalNotification({
id: "testnotif",
fire_date: new Date().getTime() + 5000,
vibrate: 500,
title: "Hello",
body: "Test Scheduled Notification",
sub_text: "sub text",
priority: "high",
large_icon:
"path_to_url",
show_in_foreground: true,
picture:
"path_to_url",
wake_screen: true,
extra1: { a: 1 },
extra2: 1
});
}
sendRemoteNotification(token) {
let body;
if (Platform.OS === "android") {
body = {
to: token,
data: {
custom_notification: {
title: "Simple FCM Client",
body: "Click me to go to detail",
sound: "default",
priority: "high",
show_in_foreground: true,
targetScreen: "detail"
}
},
priority: 10
};
} else {
body = {
to: token,
notification: {
title: "Simple FCM Client",
body: "Click me to go to detail",
sound: "default"
},
data: {
targetScreen: "detail"
},
priority: 10
};
}
firebaseClient.send(JSON.stringify(body), "notification");
}
sendRemoteData(token) {
let body = {
to: token,
data: {
title: "Simple FCM Client",
body: "This is a notification with only DATA.",
sound: "default"
},
priority: "normal"
};
firebaseClient.send(JSON.stringify(body), "data");
}
showLocalNotificationWithAction() {
FCM.presentLocalNotification({
title: "Test Notification with action",
body: "Force touch to reply",
priority: "high",
show_in_foreground: true,
click_action: "com.myidentifi.fcm.text", // for ios
android_actions: JSON.stringify([
{
id: "view",
title: "view"
},
{
id: "dismiss",
title: "dismiss"
}
]) // for android, take syntax similar to ios's. only buttons are supported
});
}
render() {
let { token, tokenCopyFeedback } = this.state;
return (
<View style={styles.container}>
<ScrollView style={{ paddingHorizontal: 20 }}>
<Text style={styles.welcome}>Welcome to Simple Fcm Client!</Text>
<Text style={styles.feedback}>{this.state.tokenCopyFeedback}</Text>
<Text style={styles.feedback}>
Remote notif won't be available to iOS emulators
</Text>
<TouchableOpacity
onPress={() => this.sendRemoteNotification(token)}
style={styles.button}
>
<Text style={styles.buttonText}>Send Remote Notification</Text>
</TouchableOpacity>
<TouchableOpacity
onPress={() => this.sendRemoteData(token)}
style={styles.button}
>
<Text style={styles.buttonText}>Send Remote Data</Text>
</TouchableOpacity>
<TouchableOpacity
onPress={() => this.showLocalNotification()}
style={styles.button}
>
<Text style={styles.buttonText}>Show Local Notification</Text>
</TouchableOpacity>
<TouchableOpacity
onPress={() => this.showLocalNotificationWithAction(token)}
style={styles.button}
>
<Text style={styles.buttonText}>
Show Local Notification with Action
</Text>
</TouchableOpacity>
<TouchableOpacity
onPress={() => this.scheduleLocalNotification()}
style={styles.button}
>
<Text style={styles.buttonText}>Schedule Notification in 5s</Text>
</TouchableOpacity>
<Text style={styles.instructions}>Init notif:</Text>
<Text>{JSON.stringify(this.state.initNotif)}</Text>
<Text style={styles.instructions}>Token:</Text>
<Text
selectable={true}
onPress={() => this.setClipboardContent(this.state.token)}
>
{this.state.token}
</Text>
</ScrollView>
</View>
);
}
setClipboardContent(text) {
Clipboard.setString(text);
this.setState({ tokenCopyFeedback: "Token copied to clipboard." });
setTimeout(() => {
this.clearTokenCopyFeedback();
}, 2000);
}
clearTokenCopyFeedback() {
this.setState({ tokenCopyFeedback: "" });
}
}
class DetailPage extends Component {
render() {
return (
<View style={{ flex: 1, alignItems: "center", justifyContent: "center" }}>
<Text>Detail page</Text>
</View>
);
}
}
export default StackNavigator(
{
Main: {
screen: MainPage
},
Detail: {
screen: DetailPage
}
},
{
initialRouteName: "Main"
}
);
const styles = StyleSheet.create({
container: {
flex: 1,
justifyContent: "center",
alignItems: "center",
backgroundColor: "#F5FCFF"
},
welcome: {
fontSize: 20,
textAlign: "center",
margin: 10
},
instructions: {
textAlign: "center",
color: "#333333",
marginBottom: 2
},
feedback: {
textAlign: "center",
color: "#996633",
marginBottom: 3
},
button: {
backgroundColor: "teal",
paddingHorizontal: 20,
paddingVertical: 15,
marginVertical: 10,
borderRadius: 10
},
buttonText: {
color: "white",
backgroundColor: "transparent"
}
});
```
|
The 2014 Women's Hockey World Cup was the 13th edition of the Women's Hockey World Cup field hockey tournament. It was held from 31 May to 14 June 2014 at the Kyocera Stadion in The Hague, Netherlands. simultaneously with the men's tournament. It was the third time that the Netherlands hosted the Women's World Cup after 1986 and 1998.
The Netherlands won the tournament for a seventh time after defeating Australia 2–0 in the final. Defending champions Argentina won the third place match by defeating the United States 2–1.
Bidding
The host was announced on 11 November 2010 during the FIH Congress and Forum in Montreux, Switzerland after FIH received bids from The Hague and London.
Qualification
Each of the continental champions from five confederations and the host nation receive an automatic berth. In addition to the six highest placed teams at the Semifinals of the 2012–13 FIH Hockey World League not already qualified, the following twelve teams, shown with final pre-tournament rankings, competed in this tournament.
Squads
Umpires
17 umpires were appointed by the FIH for this tournament.
Claire Adenot (FRA)
Amy Baxter (USA)
Karen Bennett (NZL)
Frances Block (ENG)
Caroline Brunekreef (NED)
Laurine Delforge (BEL)
Elena Eskina (RUS)
Soledad Iparraguirre (ARG)
Michelle Joubert (RSA)
Kang Hyun-young (KOR)
Michelle Meister (GER)
Miao Lin (CHN)
Irene Presenqui (ARG)
Lisa Roach (AUS)
Chieko Soma (JPN)
Wendy Stewart (CAN)
Melissa Trivic (AUS)
Results
All times are Central European Summer Time (UTC+02:00)
First round
Pool A
Pool B
Fifth to twelfth place classification
Eleventh and twelfth place
Ninth and tenth place
Seventh and eighth place
Fifth and sixth place
First to fourth place classification
Semifinals
Third and fourth place
Final
Awards
Statistics
Final standings
Goalscorers
7 goals
Maartje Paumen
6 goals
Anna Flanagan
5 goals
Kim Lammers
Anita Punt
Kelsey Kolojejchick
4 goals
Silvina D'Elía
Peng Yang
3 goals
Luciana Aymar
Carla Rebecchi
Stephanie De Groof
Kelly Jonker
Krystal Forgesson
Cheon Eun-bi
Katie Reinprecht
2 goals
Noel Barrionuevo
Delfina Merino
Jodie Kenny
Jill Boon
Emilie Sinia
Liang Meiyu
Kristina Hillmann
Hannah Krüger
Marie Mävers
Akane Shibata
Naomi van As
Ellen Hoog
Kayla Whitelock
Dirkie Chamberlain
Pietie Coetzee
Shelley Russell
Cheon Seul-ki
Kim Jong-eun
Park Mi-hyun
Lauren Crandall
Rachel Dawson
Caroline Nichols
Katie O'Donnell
Kathleen Sharkey
1 goal
Emily Hurtz
Emily Smith
Kellie White
Barbara Nelen
Alix Gerniers
Manon Simons
Wang Na
Wang Mengyu
Wu Mengrong
Sophie Bray
Alex Danson
Susie Gilbert
Hannah Macleod
Kate Richardson-Walsh
Susannah Townsend
Nicola White
Tina Bachmann
Julia Müller
Hazuki Nagai
Yuri Nagai
Ayaka Nishimura
Shiho Sakai
Shihori Oikawa
Carlien Dirkse van den Heuvel
Roos Drost
Marloes Keetels
Xan de Waard
Sophie Cocks
Katie Glynn
Tarryn Bright
Marsha Cox
Sulette Damons
Kelly Madsen
Kathleen Taylor
Han Hye-lyoung
Kim Da-rae
Kim Ok-ju
Paige Selenski
Michelle Vittese
References
External links
Women's Hockey World Cup
World Cup
International women's field hockey competitions hosted by the Netherlands
Hockey World Cup
Sports competitions in The Hague
21st century in The Hague
Hockey World Cup Women
Hockey World Cup Women
|
The Show is a 2020 British fantasy neo-noir film, written by Alan Moore and directed by Mitch Jenkins. The film follows a detective arriving in Northampton searching for a missing artefact. It stars Tom Burke, Siobhan Hewlett, Ellie Bamber and Alan Moore.
Plot
Fletcher Dennis (Tom Burke) arrives in Northampton in search of a missing person, James Mitchum. He visits the local public library where he meets librarian Henry Gaunt (Richard Dillane) who offers to assist him in the search and appears to hack into the network of the local hospital to reveal that James was admitted to there the previous evening. Fletcher heads to the hospital where he is ushered down to the morgue by Clive (Julian Bleach) to discover James dead from his injuries.
Following a series of leads, Fletcher meets with a pair of adolescent detectives in a garden shed. On his way out he also encounters a local gangster waiting to see our young Hardy Boys. Moving on, he next encounters the bouncer at the nightclub where James Mitchum was fatally injured. Next, he finds Faith (Siobhan Hewlett) who is in Hospital. She relates her near-death experience to Fletcher, in which she met James and danced with him in a club. Fletcher reveals to Faith that he isn’t looking for a friend but is in fact a private investigator looking for a missing necklace and that his client is an elderly East End businessman, Patsy Bleeker.
Fletcher’s dreams each night become increasingly strange until he dreams finds himself in the same club that Faith visited in her near-death experience. In that dream he meets Frank Metterton who relates that Patsy is not telling him the truth about himself or the necklace. The next day Fletcher explains to Faith what he has discovered about Patsy in the dream. They decide they must lure Patsy to Northampton to resolve the matter.
Patsy arrives in Northampton that evening, and with the help of his minions, kidnaps Faith in order to lure Fletcher into an ambush. Fletcher thwarts Patsy and his men and rescues Faith. The events are watched on closed-circuit television by Henry Gaunt, dressed as a masked superhero.
Cast
Tom Burke as Fletcher Dennis
Siobhan Hewlett as Faith Harrington
Ellie Bamber as Becky Cornelius
Alan Moore as Frank Metterton
Sheila Atim as John Conqueror
Antonia Campbell-Hughes as Monica Beardsley
Richard Dillane as Henry Gaunt
Christopher Fairbank as Patsy Bleeker
Darrell D'Silva as James Mitchum
Bradley John as Elton Carnaby
Production
In December 2018, it was announced in Deadline that production of the film was underway in Northampton, with Mitch Jenkins directing from a screenplay by Alan Moore. Jim Mooney, Mike Elliot and Tom Brown served as producers on the film with finance from the British Film Institute and LipSync and with Protagonist Pictures serving as the worldwide sales agent.
Moore was quoted in the article, saying: “With The Show, I wanted to apply the storytelling ability accumulated during the rest of my varied career to the medium of film.”
Release
The Show was an official selection for SXSW 2020. Following SXSW's cancellation due to the COVID-19 pandemic film had a world premiere at Sitges Film Festival on 12 October 2020. It had its premiere in the United Kingdom on 27 August 2021 at London FrightFest Film Festival and was released in the United States on 26 August 2021 by Shout! Factory and Fathom Events.
Reception
The Show was reviewed at its Sitges premiere by Spanish website Espinof, highlighting the British humour in The Show giving the film four out of five stars. Reviewing the premiere online, due to COVID-19 pandemic travel restrictions, Kirsty Puchko writing for IGN, described it as “an unrepentantly trippy Noir that assaults the senses, cackling all the while” and continued “Alan Moore gives his fans doses of what they crave from him. There's a mind-bending detective story in a twisted realm of violence, vigilantes, corruption, and chaos.” IGN gave the film a score of nine out of ten.
On its UK release, The Guardian gave the film four out of five stars, writing "The plot is a Chandlerian shoal of red herrings but, like Moore’s League of Extraordinary Gentlemen comics, no detail is accidental: from the pun-strewn flyposters to Fletcher’s Dennis the Menace red-and-black sweatshirt." Marc Burrows, reviewing for HeyUguys.com scored the film four out of five stars, noting the comic script: “Alan Moore’s sense of humour has always been an underrated aspect of his writing, and The Show is filled with cracking, beautifully observed dialogue and ridiculous imagery.” Writing in Sight & Sound, Kim Newman described Mitch Jenkins’ direction as “colourful, lucid-dream, Lynch-by-way-of-Film4”. Reviewing for Bleeding Cool, Rich Johnston gave the film a score of ten out of ten, noting the detail in the script "there are some aspects that only make sense if you read newspaper headlines on hoardings, adverts in the newsagent window, or pieces of graffiti around Northampton". Writing in BBC Culture, Nicholas Barber said The Show was a "must-see release" for October 2021, describing it as "a detective yarn about a mystery man scouring the streets of Northampton for a jewel thief, but it's also a surreal, magical, nocturnal odyssey".
References
External links
2020 films
2020s mystery horror films
British mystery horror films
British detective films
British supernatural horror films
Films set in England
Films about missing people
2020s English-language films
2020s British films
|
Alligator Shoes is a 1981 Canadian drama film directed by Clay Borris.
Written by Borris as a fictionalization of his own family story, and acted predominantly by Borris and his real family, the film centres on Mike and Bin Allard (brothers Clay and Garry Borris), two brothers in Toronto whose life is turned upside down when their aunt Danielle (stage actress Ronalda Jones, in the film's only major role played by a professional actress) comes to stay with their family after having a nervous breakdown. Made for a budget of just $400,000 ($ million today), the film was an expansion of Rose's House, a short film Borris previously directed for CBC Television.
The film premiered in the Director's Fortnight section of the 1981 Cannes Film Festival. It had its theatrical premiere in Canada in June 1981.
The film received four Genie Award nominations at the 3rd Genie Awards in 1982: Best Actress (Jones), Best Original Screenplay (Borris), Best Cinematography (John F. Phillips) and Best Editing (Gordon McClellan). It received the Golden Ducat at the 1981 International Filmfestival Mannheim-Heidelberg in Mannheim.
References
External links
1981 films
1981 drama films
Canadian drama films
English-language Canadian films
1980s English-language films
Films directed by Clay Borris
1980s Canadian films
English-language drama films
|
```c++
// This Source Code Form is subject to the terms of the Mozilla Public
// file, You can obtain one at path_to_url
#include <chrono>
#include <condition_variable>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <thread>
#include <map>
#include <algorithm>
#include <atomic>
#include <gtest/gtest.h>
#include <vsomeip/vsomeip.hpp>
#include <vsomeip/internal/logger.hpp>
#include "offer_test_globals.hpp"
#include "../someip_test_globals.hpp"
#include <common/vsomeip_app_utilities.hpp>
static std::string service_number;
class offer_test_service : public vsomeip_utilities::base_logger {
public:
offer_test_service(struct offer_test::service_info _service_info) :
vsomeip_utilities::base_logger("OTS1", "OFFER TEST SERVICE"),
service_info_(_service_info),
// service with number 1 uses "routingmanagerd" as application name
// this way the same json file can be reused for all local tests
// including the ones with routingmanagerd
app_(vsomeip::runtime::get()->create_application(
(service_number == "1") ? "routingmanagerd" :
"offer_test_service" + service_number)),
counter_(0),
wait_until_registered_(true),
shutdown_method_called_(false),
offer_thread_(std::bind(&offer_test_service::run, this)) {
if (!app_->init()) {
ADD_FAILURE() << "Couldn't initialize application";
return;
}
app_->register_state_handler(
std::bind(&offer_test_service::on_state, this,
std::placeholders::_1));
// offer field
std::set<vsomeip::eventgroup_t> its_eventgroups;
its_eventgroups.insert(service_info_.eventgroup_id);
app_->offer_event(service_info_.service_id, service_info_.instance_id,
service_info_.event_id, its_eventgroups,
vsomeip::event_type_e::ET_EVENT, std::chrono::milliseconds::zero(),
false, true, nullptr, vsomeip::reliability_type_e::RT_BOTH);
inc_counter_and_notify();
app_->register_message_handler(service_info_.service_id,
service_info_.instance_id, service_info_.method_id,
std::bind(&offer_test_service::on_request, this,
std::placeholders::_1));
app_->register_message_handler(service_info_.service_id,
service_info_.instance_id, service_info_.shutdown_method_id,
std::bind(&offer_test_service::on_shutdown_method_called, this,
std::placeholders::_1));
app_->start();
}
~offer_test_service() {
offer_thread_.join();
}
void offer() {
app_->offer_service(service_info_.service_id, service_info_.instance_id);
// this is allowed
app_->offer_service(service_info_.service_id, service_info_.instance_id);
// this is not allowed and will be rejected
app_->offer_service(service_info_.service_id, service_info_.instance_id, 33, 4711);
}
void on_state(vsomeip::state_type_e _state) {
VSOMEIP_INFO << "Application " << app_->get_name() << " is "
<< (_state == vsomeip::state_type_e::ST_REGISTERED ?
"registered." : "deregistered.");
if (_state == vsomeip::state_type_e::ST_REGISTERED) {
std::lock_guard<std::mutex> its_lock(mutex_);
wait_until_registered_ = false;
condition_.notify_one();
}
}
void on_request(const std::shared_ptr<vsomeip::message> &_message) {
app_->send(vsomeip::runtime::get()->create_response(_message));
}
void on_shutdown_method_called(const std::shared_ptr<vsomeip::message> &_message) {
(void)_message;
shutdown_method_called_ = true;
// this is will trigger a warning
app_->stop_offer_service(service_info_.service_id, service_info_.instance_id, 44, 4711);
app_->stop_offer_service(service_info_.service_id, service_info_.instance_id);
app_->clear_all_handler();
app_->stop();
}
void run() {
VSOMEIP_DEBUG << "[" << std::setw(4) << std::setfill('0') << std::hex
<< service_info_.service_id << "] Running";
std::unique_lock<std::mutex> its_lock(mutex_);
while (wait_until_registered_) {
condition_.wait(its_lock);
}
VSOMEIP_DEBUG << "[" << std::setw(4) << std::setfill('0') << std::hex
<< service_info_.service_id << "] Offering";
offer();
VSOMEIP_DEBUG << "[" << std::setw(4) << std::setfill('0') << std::hex
<< service_info_.service_id << "] Notifying";
while(!shutdown_method_called_) {
std::this_thread::sleep_for(std::chrono::milliseconds(10));
inc_counter_and_notify();
}
}
void inc_counter_and_notify() {
++counter_;
// set value to field
const std::shared_ptr<vsomeip::payload> its_payload(vsomeip::runtime::get()->create_payload());
std::vector<vsomeip::byte_t> its_data;
its_data.push_back(static_cast<vsomeip::byte_t>((counter_ & 0xFF000000) >> 24));
its_data.push_back(static_cast<vsomeip::byte_t>((counter_ & 0xFF0000) >> 16));
its_data.push_back(static_cast<vsomeip::byte_t>((counter_ & 0xFF00) >> 8));
its_data.push_back(static_cast<vsomeip::byte_t>((counter_ & 0xFF)));
its_payload->set_data(its_data);
app_->notify(service_info_.service_id, service_info_.instance_id,
service_info_.event_id, its_payload);
}
private:
struct offer_test::service_info service_info_;
std::shared_ptr<vsomeip::application> app_;
std::uint32_t counter_;
bool wait_until_registered_;
std::mutex mutex_;
std::condition_variable condition_;
std::atomic<bool> shutdown_method_called_;
std::thread offer_thread_;
};
TEST(someip_offer_test, notify_increasing_counter)
{
offer_test_service its_sample(offer_test::service);
}
#if defined(__linux__) || defined(ANDROID) || defined(__QNX__)
int main(int argc, char** argv)
{
::testing::InitGoogleTest(&argc, argv);
if(argc < 2) {
std::cerr << "Please specify a service number, like: " << argv[0] << " 2" << std::endl;
return 1;
}
service_number = std::string(argv[1]);
return RUN_ALL_TESTS();
}
#endif
```
|
The Women's National War Relief Association was an American relief organization founded during the Spanish–American War to give comfort to the officers, soldiers and sailors in the United States Military. The women founding the association used the group as a means for women "to supplement with material aid the sacrifices of time, strength, and life made by the men of the nation" during the military conflict.
Founding
The Women's National War Relief Association was incorporated at Albany, New York on May 31, 1898. According to a report in The American monthly review of reviews, its president was Mrs. General U. S. Grant, its director-general Mrs. Ellen Hardin Walworth, and its assistant director-general Helen Miller Gould. The board of vice-presidents comprised the wife of the Attorney-General, Mrs. John W. Griggs, along with the wives of the governors of Massachusetts, Rhode Island, Wyoming, Illinois, Virginia, Wyoming, Colorado, Connecticut, Ohio, North Dakota, Kentucky, Alabama, Oklahoma, Georgia, Idaho, Washington, New Mexico, Oregon, Montana, Arkansas, South Dakota, West Virginia, Maine, and Pennsylvania. The constitution was adopted in May 1898.
Activities
The early work of the Association included fitting out the ambulance ship Relief with a carbonating plant, electric fans, canvas awnings, food, and medical supplies, and Fortress Monroe was provided with ten chefs and 10 of assistants to assist with meals. Nine nurses were sent to Fortress Monroe from July 9 to October 10. The association made a monetary contribution of $100 a week for the convalescent table.
Three thousand dollars was distributed through official channels to aid in the equipment of the ambulance ships Relief, of the War Department, and Navy Department ship, Solace. Hospital supplies were sent to the United States Marine Corps at Santiago.
After the close of the war $2,500 worth of supplies were sent to Santiago, and also a steam launch, at a cost of $1,600, was supplied for the yellow-fever hospital about two miles from Santiago.
References
Spanish–American War
United States military support organizations
Service organizations based in the United States
Health charities in the United States
Women's organizations based in the United States
Medical and health organizations based in New York (state)
|
Pthirus is a genus of lice. There are only two extant species, and they are the sole known members of the family Pthiridae. Pthirus gorillae infests gorillas, and Pthirus pubis afflicts humans, and is commonly known as the crab louse or pubic louse. The two species diverged some 3.3 million years ago.
Since 1958 the generic name Pthirus has been spelled with pth rather than phth, despite this being based on a misspelling of the Greek-derived phthirus.
References
External links
Lice
Parasitic arthropods of mammals
Parasitic infestations, stings, and bites of the skin
|
State Road 42 (NM 42) is a state highway in the US state of New Mexico. Its total length is approximately . NM 42's southern terminus is in the village of Corona, at U.S. Route 54 (US 54) and NM 42's northern terminus is in the village of Willard, at US 60.
Major intersections
See also
References
042
Transportation in Torrance County, New Mexico
|
The Brahman languages, Biyom and Tauya, form a subbranch of the Rai Coast branch of the Madang languages of Papua New Guinea. The family is named after the cattle station and town of Brahman, which lies between the territories of the two languages.
Genetic relations
John Z'graggen (1971, 1975) classified four languages as Brahman, Biyom, Faita, Isabi, Tauya.
Ross (2005) broke up Brahman, placing Faita among the Sogeram languages (another sub-branch of Madang) and Isabi among the unrelated Goroka languages – a position followed by Usher (2018).
References
Rai Coast languages
Languages of Papua New Guinea
|
```javascript
Custom Node REPL Server
Asynchronous File Write/Read in Node.js
Global Objects and Environment Variables in **Node**
The built-in Node debugger
Automatic compilation for Node with **Nodemon**
```
|
Bertrand Guilladot or "Guillaudot" (died 1743) was a French priest and an alleged sorcerer. Guilladot was among the last people to be executed for witchcraft in France. He was the central figure in the Lyon witch trials that lead to the execution of several men for witchcraft in Dijon and Lyon between 1742 and 1745.
The case
The case was unusual, as witch trials, though still legal, had diminished in France since the Affair of the Poisons in 1680, and the execution of an alleged male sorcerer in Bordeaux in 1718 has traditionally been referred to as the last. However, a donkey-driver and the nobleman des Chauffors were in fact executed for the same crimes in Paris in 1724 and 1726 respectively.
Bertrand Guilladot was a Roman Catholic priest in Dijon. He was arrested in 1742, and put on trial charged with having made a pact with the Devil in order to find hidden treasures. He confessed to be guilty as charged. He was executed in 1743.
In his confession, he identified twenty-nine other individuals, all of them male, who reportedly had participated in the pact with him.
The witch trials begun by the denunciations in his confession were held in Lyon and lasted for three years.
In February 1745, five of the accused men were sentenced to death for witchcraft in connection to the treasure hunting. Three of the condemned were priests, who were accused of having performed sacrilegious masses for this purpose. One of the three condemned priests, Louis Debaraz, was sentenced to be executed by burning for having performed a black mass. Twenty-three of the remaining accused were sentenced to be galley slaves.
References
1743 deaths
French people executed for witchcraft
18th-century executions by France
18th-century French Roman Catholic priests
Year of birth unknown
|
```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 google.registry.util;
import static com.google.common.truth.Truth.assertThat;
import static org.junit.jupiter.api.Assertions.assertThrows;
import static org.mockito.Mockito.mock;
import static org.mockito.Mockito.when;
import java.lang.reflect.Method;
import java.util.ArrayList;
import javax.annotation.Nullable;
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;
/** Unit tests for {@link ComparingInvocationHandler}. */
class ComparingInvocationHandlerTest {
private static class Dummy {}
interface MyInterface {
String func(int a, String b);
Dummy func();
}
static class MyException extends RuntimeException {
MyException(String msg) {
super(msg);
}
}
static class MyOtherException extends RuntimeException {
MyOtherException(String msg) {
super(msg);
}
}
private static final ArrayList<String> log = new ArrayList<>();
static final class MyInterfaceComparingInvocationHandler
extends ComparingInvocationHandler<MyInterface> {
private boolean dummyEqualsResult = true;
private boolean exceptionEqualsResult = true;
MyInterfaceComparingInvocationHandler(MyInterface actual, MyInterface second) {
super(MyInterface.class, actual, second);
}
MyInterfaceComparingInvocationHandler setExeptionsEquals(boolean result) {
this.exceptionEqualsResult = result;
return this;
}
MyInterfaceComparingInvocationHandler setDummyEquals(boolean result) {
this.dummyEqualsResult = result;
return this;
}
@Override
protected void log(Method method, String message) {
log.add(String.format("%s: %s", method.getName(), message));
}
@Override
protected boolean compareResults(Method method, @Nullable Object a, @Nullable Object b) {
if (method.getReturnType().equals(Dummy.class)) {
return dummyEqualsResult;
}
return super.compareResults(method, a, b);
}
@Override
protected String stringifyResult(Method method, @Nullable Object a) {
if (method.getReturnType().equals(Dummy.class)) {
return "dummy";
}
return super.stringifyResult(method, a);
}
@Override
protected boolean compareThrown(Method method, Throwable a, Throwable b) {
return exceptionEqualsResult && super.compareThrown(method, a, b);
}
@Override
protected String stringifyThrown(Method method, Throwable a) {
return String.format("testException(%s)", super.stringifyThrown(method, a));
}
}
private static final String ACTUAL_RESULT = "actual result";
private static final String SECOND_RESULT = "second result";
private final MyInterface myActualMock = mock(MyInterface.class);
private final MyInterface mySecondMock = mock(MyInterface.class);
private MyInterfaceComparingInvocationHandler invocationHandler;
@BeforeEach
void beforeEach() {
log.clear();
invocationHandler = new MyInterfaceComparingInvocationHandler(myActualMock, mySecondMock);
}
@Test
void test_actualThrows_logDifference() {
MyInterface comparator = invocationHandler.makeProxy();
MyException myException = new MyException("message");
when(myActualMock.func(3, "str")).thenThrow(myException);
when(mySecondMock.func(3, "str")).thenReturn(SECOND_RESULT);
assertThrows(MyException.class, () -> comparator.func(3, "str"));
assertThat(log)
.containsExactly(
String.format(
"func: Only actual implementation threw exception: testException(%s)",
myException.toString()));
}
@Test
void test_secondThrows_logDifference() {
MyInterface comparator = invocationHandler.makeProxy();
MyOtherException myOtherException = new MyOtherException("message");
when(myActualMock.func(3, "str")).thenReturn(ACTUAL_RESULT);
when(mySecondMock.func(3, "str")).thenThrow(myOtherException);
assertThat(comparator.func(3, "str")).isEqualTo(ACTUAL_RESULT);
assertThat(log)
.containsExactly(
String.format(
"func: Only second implementation threw exception: testException(%s)",
myOtherException.toString()));
}
@Test
void test_bothThrowEqual_noLog() {
MyInterface comparator = invocationHandler.setExeptionsEquals(true).makeProxy();
MyException myException = new MyException("actual message");
MyOtherException myOtherException = new MyOtherException("second message");
when(myActualMock.func(3, "str")).thenThrow(myException);
when(mySecondMock.func(3, "str")).thenThrow(myOtherException);
assertThrows(MyException.class, () -> comparator.func(3, "str"));
assertThat(log).isEmpty();
}
@Test
void test_bothThrowDifferent_logDifference() {
MyInterface comparator = invocationHandler.setExeptionsEquals(false).makeProxy();
MyException myException = new MyException("actual message");
MyOtherException myOtherException = new MyOtherException("second message");
when(myActualMock.func(3, "str")).thenThrow(myException);
when(mySecondMock.func(3, "str")).thenThrow(myOtherException);
assertThrows(MyException.class, () -> comparator.func(3, "str"));
assertThat(log)
.containsExactly(
String.format(
"func: Both implementations threw, but got different exceptions! "
+ "'testException(%s)' vs 'testException(%s)'",
myException.toString(), myOtherException.toString()));
}
@Test
void test_bothReturnSame_noLog() {
MyInterface comparator = invocationHandler.makeProxy();
when(myActualMock.func(3, "str")).thenReturn(ACTUAL_RESULT);
when(mySecondMock.func(3, "str")).thenReturn(ACTUAL_RESULT);
assertThat(comparator.func(3, "str")).isEqualTo(ACTUAL_RESULT);
assertThat(log).isEmpty();
}
@Test
void test_bothReturnDifferent_logDifference() {
MyInterface comparator = invocationHandler.makeProxy();
when(myActualMock.func(3, "str")).thenReturn(ACTUAL_RESULT);
when(mySecondMock.func(3, "str")).thenReturn(SECOND_RESULT);
assertThat(comparator.func(3, "str")).isEqualTo(ACTUAL_RESULT);
assertThat(log)
.containsExactly("func: Got different results! 'actual result' vs 'second result'");
}
@Test
void test_usesOverriddenMethods_noDifference() {
MyInterface comparator = invocationHandler.setDummyEquals(true).makeProxy();
when(myActualMock.func()).thenReturn(new Dummy());
when(mySecondMock.func()).thenReturn(new Dummy());
comparator.func();
assertThat(log).isEmpty();
}
@Test
void test_usesOverriddenMethods_logDifference() {
MyInterface comparator = invocationHandler.setDummyEquals(false).makeProxy();
when(myActualMock.func()).thenReturn(new Dummy());
when(mySecondMock.func()).thenReturn(new Dummy());
comparator.func();
assertThat(log).containsExactly("func: Got different results! 'dummy' vs 'dummy'");
}
}
```
|
John Bailey (born 29 October 1941) is a New Zealand cricketer. He played in four first-class matches for Northern Districts in 1965/66.
See also
List of Northern Districts representative cricketers
References
External links
1941 births
Living people
New Zealand cricketers
Northern Districts cricketers
Cricketers from Preston, Lancashire
|
```smalltalk
//your_sha256_hash--------------
// <auto-generated>
// This code was generated by a tool.
// Runtime Version:4.0.30319.42000
//
// Changes to this file may cause incorrect behavior and will be lost if
// the code is regenerated.
// </auto-generated>
//your_sha256_hash--------------
namespace BulkCrapUninstaller.Properties {
using System;
/// <summary>
/// A strongly-typed resource class, for looking up localized strings, etc.
/// </summary>
// This class was auto-generated by the StronglyTypedResourceBuilder
// class via a tool like ResGen or Visual Studio.
// To add or remove a member, edit your .ResX file then rerun ResGen
// with the /str option, or rebuild your VS project.
[global::System.CodeDom.Compiler.GeneratedCodeAttribute("System.Resources.Tools.StronglyTypedResourceBuilder", "17.0.0.0")]
[global::System.Diagnostics.DebuggerNonUserCodeAttribute()]
[global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]
internal class Localisable {
private static global::System.Resources.ResourceManager resourceMan;
private static global::System.Globalization.CultureInfo resourceCulture;
[global::System.Diagnostics.CodeAnalysis.SuppressMessageAttribute("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
internal Localisable() {
}
/// <summary>
/// Returns the cached ResourceManager instance used by this class.
/// </summary>
[global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]
internal static global::System.Resources.ResourceManager ResourceManager {
get {
if (object.ReferenceEquals(resourceMan, null)) {
global::System.Resources.ResourceManager temp = new global::System.Resources.ResourceManager("BulkCrapUninstaller.Properties.Localisable", typeof(Localisable).Assembly);
resourceMan = temp;
}
return resourceMan;
}
}
/// <summary>
/// Overrides the current thread's CurrentUICulture property for all
/// resource lookups using this strongly typed resource class.
/// </summary>
[global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]
internal static global::System.Globalization.CultureInfo Culture {
get {
return resourceCulture;
}
set {
resourceCulture = value;
}
}
/// <summary>
/// Looks up a localized string similar to Default.
/// </summary>
internal static string DefaultLanguage {
get {
return ResourceManager.GetString("DefaultLanguage", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Empty.
/// </summary>
internal static string Empty {
get {
return ResourceManager.GetString("Empty", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to File not found..
/// </summary>
internal static string Error_FileNotFound {
get {
return ResourceManager.GetString("Error_FileNotFound", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Failed to save settings.
/// </summary>
internal static string Error_SaveSettingsFailed {
get {
return ResourceManager.GetString("Error_SaveSettingsFailed", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Select the directory with the applications to uninstall..
/// </summary>
internal static string FileTargeter_SelectDirectoryWithAppsToRemove {
get {
return ResourceManager.GetString("FileTargeter_SelectDirectoryWithAppsToRemove", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to GUID found.
/// </summary>
internal static string GuidFound {
get {
return ResourceManager.GetString("GuidFound", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to GUID missing.
/// </summary>
internal static string GuidMissing {
get {
return ResourceManager.GetString("GuidMissing", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Rating: {0}
///
///Positives:
///{1}
///
///Negatives:
///{2}.
/// </summary>
internal static string JunkRemove_Details_Message {
get {
return ResourceManager.GetString("JunkRemove_Details_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Rating details.
/// </summary>
internal static string JunkRemove_Details_Title {
get {
return ResourceManager.GetString("JunkRemove_Details_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Select down to....
/// </summary>
internal static string JunkRemove_SelectionBoxText {
get {
return ResourceManager.GetString("JunkRemove_SelectionBoxText", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Select where to save the backup. A new directory will be created..
/// </summary>
internal static string JunkRemoveWindow_SelectBackupDirectoryTitle {
get {
return ResourceManager.GetString("JunkRemoveWindow_SelectBackupDirectoryTitle", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Creating a restore point....
/// </summary>
internal static string LoadingDialogTitleCreatingRestorePoint {
get {
return ResourceManager.GetString("LoadingDialogTitleCreatingRestorePoint", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Loading Windows Features....
/// </summary>
internal static string LoadingDialogTitleLoadingWindowsFeatures {
get {
return ResourceManager.GetString("LoadingDialogTitleLoadingWindowsFeatures", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Searching for leftovers....
/// </summary>
internal static string LoadingDialogTitleLookingForJunk {
get {
return ResourceManager.GetString("LoadingDialogTitleLookingForJunk", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Populating uninstaller list....
/// </summary>
internal static string LoadingDialogTitlePopulatingList {
get {
return ResourceManager.GetString("LoadingDialogTitlePopulatingList", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Running post-uninstall commands....
/// </summary>
internal static string LoadingDialogTitlePostUninstallCommands {
get {
return ResourceManager.GetString("LoadingDialogTitlePostUninstallCommands", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Running pre-uninstall commands....
/// </summary>
internal static string LoadingDialogTitlePreUninstallCommands {
get {
return ResourceManager.GetString("LoadingDialogTitlePreUninstallCommands", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Removing leftovers....
/// </summary>
internal static string LoadingDialogTitleRemovingJunk {
get {
return ResourceManager.GetString("LoadingDialogTitleRemovingJunk", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Searching for updates....
/// </summary>
internal static string LoadingDialogTitleSearchingForUpdates {
get {
return ResourceManager.GetString("LoadingDialogTitleSearchingForUpdates", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Archived.
/// </summary>
internal static string LocalizedX509Certificate2_Archived {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_Archived", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Extensions.
/// </summary>
internal static string LocalizedX509Certificate2_Extensions {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_Extensions", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Friendly Name.
/// </summary>
internal static string LocalizedX509Certificate2_FriendlyName {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_FriendlyName", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Has Private Key.
/// </summary>
internal static string LocalizedX509Certificate2_HasPrivateKey {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_HasPrivateKey", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Issuer.
/// </summary>
internal static string LocalizedX509Certificate2_Issuer {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_Issuer", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Issuer Name.
/// </summary>
internal static string LocalizedX509Certificate2_IssuerName {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_IssuerName", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Not After.
/// </summary>
internal static string LocalizedX509Certificate2_NotAfter {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_NotAfter", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Not Before.
/// </summary>
internal static string LocalizedX509Certificate2_NotBefore {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_NotBefore", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Private Key.
/// </summary>
internal static string LocalizedX509Certificate2_PrivateKey {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_PrivateKey", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Public Key.
/// </summary>
internal static string LocalizedX509Certificate2_PublicKey {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_PublicKey", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Raw Data.
/// </summary>
internal static string LocalizedX509Certificate2_RawData {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_RawData", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Serial Number.
/// </summary>
internal static string LocalizedX509Certificate2_SerialNumber {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_SerialNumber", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Signature Algorithm.
/// </summary>
internal static string LocalizedX509Certificate2_SignatureAlgorithm {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_SignatureAlgorithm", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Subject.
/// </summary>
internal static string LocalizedX509Certificate2_Subject {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_Subject", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Subject Name.
/// </summary>
internal static string LocalizedX509Certificate2_SubjectName {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_SubjectName", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Thumbprint.
/// </summary>
internal static string LocalizedX509Certificate2_Thumbprint {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_Thumbprint", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Version.
/// </summary>
internal static string LocalizedX509Certificate2_Version {
get {
return ResourceManager.GetString("LocalizedX509Certificate2_Version", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Renaming "{0}".
/// </summary>
internal static string MainWindow_Rename_Description {
get {
return ResourceManager.GetString("MainWindow_Rename_Description", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Rename selected entry.
/// </summary>
internal static string MainWindow_Rename_Title {
get {
return ResourceManager.GetString("MainWindow_Rename_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Processing detected applications, {0} left....
/// </summary>
internal static string MainWindow_Statusbar_ProcessingUninstallers {
get {
return ResourceManager.GetString("MainWindow_Statusbar_ProcessingUninstallers", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Refreshing startup information....
/// </summary>
internal static string MainWindow_Statusbar_RefreshingStartup {
get {
return ResourceManager.GetString("MainWindow_Statusbar_RefreshingStartup", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Ready.
/// </summary>
internal static string MainWindow_Statusbar_StatusReady {
get {
return ResourceManager.GetString("MainWindow_Statusbar_StatusReady", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to {0} uninstallers selected.
/// </summary>
internal static string MainWindow_Statusbar_StatusSelection {
get {
return ResourceManager.GetString("MainWindow_Statusbar_StatusSelection", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to {0} uninstallers in total, {1}.
/// </summary>
internal static string MainWindow_Statusbar_Total {
get {
return ResourceManager.GetString("MainWindow_Statusbar_Total", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Following uninstallers will be restarted loudly:.
/// </summary>
internal static string MessageBoxes_AskToRetryFailedQuietAsLoud_Details {
get {
return ResourceManager.GetString("MessageBoxes_AskToRetryFailedQuietAsLoud_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Do you want to try running quiet uninstallers that failed as loud?.
/// </summary>
internal static string MessageBoxes_AskToRetryFailedQuietAsLoud_Header {
get {
return ResourceManager.GetString("MessageBoxes_AskToRetryFailedQuietAsLoud_Header", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Some uninstallers failed.
/// </summary>
internal static string MessageBoxes_AskToRetryFailedQuietAsLoud_Title {
get {
return ResourceManager.GetString("MessageBoxes_AskToRetryFailedQuietAsLoud_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to There are unsaved changes in the opened uninstall list that will be lost by closing it..
/// </summary>
internal static string MessageBoxes_AskToSaveUninstallList_Details {
get {
return ResourceManager.GetString("MessageBoxes_AskToSaveUninstallList_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Save changes to the opened uninstall list?.
/// </summary>
internal static string MessageBoxes_AskToSaveUninstallList_Message {
get {
return ResourceManager.GetString("MessageBoxes_AskToSaveUninstallList_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Save uninstall list.
/// </summary>
internal static string MessageBoxes_AskToSaveUninstallList_Title {
get {
return ResourceManager.GetString("MessageBoxes_AskToSaveUninstallList_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to This will take you less than a minute but help the development greatly! All feedback is appreciated, be it a bug report, feature request or a simple thanks!
///
///You can send it later from the top menu bar (Help->Submit feedback)..
/// </summary>
internal static string MessageBoxes_AskToSubmitFeedback_Details {
get {
return ResourceManager.GetString("MessageBoxes_AskToSubmitFeedback_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Would you like to send feedback concerning BCU?.
/// </summary>
internal static string MessageBoxes_AskToSubmitFeedback_Message {
get {
return ResourceManager.GetString("MessageBoxes_AskToSubmitFeedback_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Error details: .
/// </summary>
internal static string MessageBoxes_BackupFailedQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_BackupFailedQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Registry backup failed, do you want to continue anyway?.
/// </summary>
internal static string MessageBoxes_BackupFailedQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_BackupFailedQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to You will be able to roll back all changes by double-clicking it afterwards.
///
///Files and directories will be moved to the recycle bin, you can restore them from there..
/// </summary>
internal static string MessageBoxes_BackupRegistryQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_BackupRegistryQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Do you want to create a registry backup before continuing?.
/// </summary>
internal static string MessageBoxes_BackupRegistryQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_BackupRegistryQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Select exactly one uninstaller from the list. If you are using check-boxes make sure to check them..
/// </summary>
internal static string MessageBoxes_CanSelectOnlyOneItemInfo_Details {
get {
return ResourceManager.GetString("MessageBoxes_CanSelectOnlyOneItemInfo_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to You need to select only one entry for this action.
/// </summary>
internal static string MessageBoxes_CanSelectOnlyOneItemInfo_Message {
get {
return ResourceManager.GetString("MessageBoxes_CanSelectOnlyOneItemInfo_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Action failed.
/// </summary>
internal static string MessageBoxes_CanSelectOnlyOneItemInfo_Title {
get {
return ResourceManager.GetString("MessageBoxes_CanSelectOnlyOneItemInfo_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Remaining uninstallers should be able to complete without any user intervention. You should still check in from time to time in case one of the uninstallers crashes..
/// </summary>
internal static string MessageBoxes_CanWalkAwayInfo_Details {
get {
return ResourceManager.GetString("MessageBoxes_CanWalkAwayInfo_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to You can now leave the computer.
/// </summary>
internal static string MessageBoxes_CanWalkAwayInfo_Message {
get {
return ResourceManager.GetString("MessageBoxes_CanWalkAwayInfo_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Uninstall progress.
/// </summary>
internal static string MessageBoxes_CanWalkAwayInfo_Title {
get {
return ResourceManager.GetString("MessageBoxes_CanWalkAwayInfo_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Removing items marked with confidence lower than Good can be very dangerous! It is recommended that you verify that every single item is safe to delete..
/// </summary>
internal static string MessageBoxes_ConfirmLowConfidenceQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_ConfirmLowConfidenceQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Do you really want to modify low-confidence items?.
/// </summary>
internal static string MessageBoxes_ConfirmLowConfidenceQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_ConfirmLowConfidenceQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Following items will be removed from registry and will disappear from the uninstaller list, but will not be uninstalled.
///
///{0}.
/// </summary>
internal static string MessageBoxes_DeleteRegKeysConfirmation_Details {
get {
return ResourceManager.GetString("MessageBoxes_DeleteRegKeysConfirmation_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Are you sure you want to remove selected uninstaller entries?.
/// </summary>
internal static string MessageBoxes_DeleteRegKeysConfirmation_Message {
get {
return ResourceManager.GetString("MessageBoxes_DeleteRegKeysConfirmation_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Remove keys from registry.
/// </summary>
internal static string MessageBoxes_DeleteRegKeysConfirmation_Title {
get {
return ResourceManager.GetString("MessageBoxes_DeleteRegKeysConfirmation_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to
///
///Error details:
///.
/// </summary>
internal static string MessageBoxes_Error_details {
get {
return ResourceManager.GetString("MessageBoxes_Error_details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to If the error persists try saving to a different directory, for example to the desktop..
/// </summary>
internal static string MessageBoxes_ExportFailed_Details {
get {
return ResourceManager.GetString("MessageBoxes_ExportFailed_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to An error has been encountered while saving exported data.
/// </summary>
internal static string MessageBoxes_ExportFailed_Message {
get {
return ResourceManager.GetString("MessageBoxes_ExportFailed_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Export failed.
/// </summary>
internal static string MessageBoxes_ExportFailed_Title {
get {
return ResourceManager.GetString("MessageBoxes_ExportFailed_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Following command failed to execute:
///{0}.
/// </summary>
internal static string MessageBoxes_ExternalCommandFailed_Message {
get {
return ResourceManager.GetString("MessageBoxes_ExternalCommandFailed_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to External execute failed.
/// </summary>
internal static string MessageBoxes_ExternalCommandFailed_Title {
get {
return ResourceManager.GetString("MessageBoxes_ExternalCommandFailed_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Failed to run some of the uninstallers.
/// </summary>
internal static string MessageBoxes_ForceRunUninstallFailedError_Header {
get {
return ResourceManager.GetString("MessageBoxes_ForceRunUninstallFailedError_Header", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Following uninstallers failed to execute, likely because of a collision. Please wait for other uninstallers to finish and try again.
///{0}
///
///You can try disabling collision detection in the settings, but it is not recommended..
/// </summary>
internal static string MessageBoxes_ForceRunUninstallFailedError_Message {
get {
return ResourceManager.GetString("MessageBoxes_ForceRunUninstallFailedError_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Force uninstallation.
/// </summary>
internal static string MessageBoxes_ForceRunUninstallFailedError_Title {
get {
return ResourceManager.GetString("MessageBoxes_ForceRunUninstallFailedError_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to BCUninstaller is uninstalling {0} application(s).
/// </summary>
internal static string MessageBoxes_GetSystemRestoreDescription {
get {
return ResourceManager.GetString("MessageBoxes_GetSystemRestoreDescription", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Make sure you have not included any of the following characters:
///{0}.
/// </summary>
internal static string MessageBoxes_InvalidNewEntryName_Details {
get {
return ResourceManager.GetString("MessageBoxes_InvalidNewEntryName_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Supplied name is empty or contains invalid characters.
/// </summary>
internal static string MessageBoxes_InvalidNewEntryName_Message {
get {
return ResourceManager.GetString("MessageBoxes_InvalidNewEntryName_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Please note that this feature is intended only for power users that understand how it works. It is not necessary to remove these files and they will not affect system performance in any meaningful way..
/// </summary>
internal static string MessageBoxes_LookForJunkQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_LookForJunkQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Do you want to look for leftovers from performed uninstallation(s)?.
/// </summary>
internal static string MessageBoxes_LookForJunkQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_LookForJunkQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to The selected application has no modify command specified. It might be necessary to uninstall, and then install it again to change install settings..
/// </summary>
internal static string MessageBoxes_ModifyCommandMissing_Details {
get {
return ResourceManager.GetString("MessageBoxes_ModifyCommandMissing_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Selected application can't be modified.
/// </summary>
internal static string MessageBoxes_ModifyCommandMissing_Message {
get {
return ResourceManager.GetString("MessageBoxes_ModifyCommandMissing_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Modify application.
/// </summary>
internal static string MessageBoxes_ModifyCommandMissing_Title {
get {
return ResourceManager.GetString("MessageBoxes_ModifyCommandMissing_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to The v4.0 framework is optional, but recommended. The features that rely on the framework will be disabled until you install it..
/// </summary>
internal static string MessageBoxes_Net4Missing_Details {
get {
return ResourceManager.GetString("MessageBoxes_Net4Missing_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to .NET Framework v4.0 was not found, some features will be disabled.
/// </summary>
internal static string MessageBoxes_Net4Missing_Message {
get {
return ResourceManager.GetString("MessageBoxes_Net4Missing_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to .NET Framework v4.0 not found.
/// </summary>
internal static string MessageBoxes_Net4Missing_Title {
get {
return ResourceManager.GetString("MessageBoxes_Net4Missing_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to No leftovers were found. There still might be some residue left so you can run a temporary file cleaner like BleachBit..
/// </summary>
internal static string MessageBoxes_NoJunkFoundInfo_Details {
get {
return ResourceManager.GetString("MessageBoxes_NoJunkFoundInfo_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to No leftovers were found.
/// </summary>
internal static string MessageBoxes_NoJunkFoundInfo_Message {
get {
return ResourceManager.GetString("MessageBoxes_NoJunkFoundInfo_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Make sure that your network cable is plugged in. If you are using Wi-Fi ensure that you have good signal strength..
/// </summary>
internal static string MessageBoxes_NoNetworkConnected_Details {
get {
return ResourceManager.GetString("MessageBoxes_NoNetworkConnected_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Can't connect to the internet, there are no networks available..
/// </summary>
internal static string MessageBoxes_NoNetworkConnected_Message {
get {
return ResourceManager.GetString("MessageBoxes_NoNetworkConnected_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Open on-line content.
/// </summary>
internal static string MessageBoxes_NoNetworkConnected_Open_online_content {
get {
return ResourceManager.GetString("MessageBoxes_NoNetworkConnected_Open_online_content", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to There was nothing to copy to the clipboard. Either no selected uninstaller has this bit of information or you didn't select anything..
/// </summary>
internal static string MessageBoxes_NothingToCopy_Message {
get {
return ResourceManager.GetString("MessageBoxes_NothingToCopy_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to To uninstall applications you must first select them from the list view. If you are using check-boxes, make sure that they are checked..
/// </summary>
internal static string MessageBoxes_NoUninstallersSelectedInfo_Details {
get {
return ResourceManager.GetString("MessageBoxes_NoUninstallersSelectedInfo_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to No uninstallers were selected, nothing to uninstall.
/// </summary>
internal static string MessageBoxes_NoUninstallersSelectedInfo_Message {
get {
return ResourceManager.GetString("MessageBoxes_NoUninstallersSelectedInfo_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Run uninstallers.
/// </summary>
internal static string MessageBoxes_NoUninstallersSelectedInfo_Title {
get {
return ResourceManager.GetString("MessageBoxes_NoUninstallersSelectedInfo_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to No directories to open.
/// </summary>
internal static string MessageBoxes_OpenDirectories_NoDirsToOpen {
get {
return ResourceManager.GetString("MessageBoxes_OpenDirectories_NoDirsToOpen", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to This action will open {0} directories at once, are you sure you want to continue?.
/// </summary>
internal static string MessageBoxes_OpenDirectoriesMessageBox_OpenMultiple {
get {
return ResourceManager.GetString("MessageBoxes_OpenDirectoriesMessageBox_OpenMultiple", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to An error has been encountered while opening the directory.
/// </summary>
internal static string MessageBoxes_OpenDirectoryError_Message {
get {
return ResourceManager.GetString("MessageBoxes_OpenDirectoryError_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Failed to load selected files.
/// </summary>
internal static string MessageBoxes_OpenUninstallListError_Message {
get {
return ResourceManager.GetString("MessageBoxes_OpenUninstallListError_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to If you choose to keep current selection it will be merged with the opened list(s).
/// </summary>
internal static string MessageBoxes_OpenUninstallListQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_OpenUninstallListQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Do you want to keep current selection?.
/// </summary>
internal static string MessageBoxes_OpenUninstallListQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_OpenUninstallListQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to An error has been encountered while opening the URL.
/// </summary>
internal static string MessageBoxes_OpenUrlError_Message {
get {
return ResourceManager.GetString("MessageBoxes_OpenUrlError_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to No URLs to open.
/// </summary>
internal static string MessageBoxes_OpenUrlsMessageBox_No_URLs_to_open_Title {
get {
return ResourceManager.GetString("MessageBoxes_OpenUrlsMessageBox_No_URLs_to_open_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to This action will open {0} URLs at once, are you sure you want to continue?.
/// </summary>
internal static string MessageBoxes_OpenUrlsMessageBox_OpenMultiple_Message {
get {
return ResourceManager.GetString("MessageBoxes_OpenUrlsMessageBox_OpenMultiple_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Protected entry: {0}
///
///To modify this entry you need to disable uninstaller protection from the settings panel..
/// </summary>
internal static string MessageBoxes_ProtectedItemError_Details {
get {
return ResourceManager.GetString("MessageBoxes_ProtectedItemError_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Selected entry is protected and can not be modified.
/// </summary>
internal static string MessageBoxes_ProtectedItemError_Message {
get {
return ResourceManager.GetString("MessageBoxes_ProtectedItemError_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Affected entries:
///{0}
///
///To modify these entries you need to disable uninstaller protection from the settings sidebar.You can remove them from the task and continue with other items if you want..
/// </summary>
internal static string MessageBoxes_ProtectedItemsWarningQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_ProtectedItemsWarningQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Some entries are protected and can not be modified.
/// </summary>
internal static string MessageBoxes_ProtectedItemsWarningQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_ProtectedItemsWarningQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Following items are missing quiet uninstallers:
///{0}
///
///Do you want to use "loud" uninstallers for those items, or should they be removed them from the task?.
/// </summary>
internal static string MessageBoxes_QuietUninstallersNotAvailableQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_QuietUninstallersNotAvailableQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Some applications can't be uninstalled quietly.
/// </summary>
internal static string MessageBoxes_QuietUninstallersNotAvailableQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_QuietUninstallersNotAvailableQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Ratings not available.
/// </summary>
internal static string MessageBoxes_RatingErrorTitle {
get {
return ResourceManager.GetString("MessageBoxes_RatingErrorTitle", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to You have to enable ratings from the settings first..
/// </summary>
internal static string MessageBoxes_RatingsDisabled_Message {
get {
return ResourceManager.GetString("MessageBoxes_RatingsDisabled_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to You can't rate applications that are not installed properly..
/// </summary>
internal static string MessageBoxes_RatingUnavailable_Message {
get {
return ResourceManager.GetString("MessageBoxes_RatingUnavailable_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Remember choice.
/// </summary>
internal static string MessageBoxes_RememberChoiceCheckbox {
get {
return ResourceManager.GetString("MessageBoxes_RememberChoiceCheckbox", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to All of your settings will be lost permanently. BCUninstaller will have to restart to complete this action..
/// </summary>
internal static string MessageBoxes_ResetSettingsConfirmation_Details {
get {
return ResourceManager.GetString("MessageBoxes_ResetSettingsConfirmation_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Are you sure you want to reset all application settings?.
/// </summary>
internal static string MessageBoxes_ResetSettingsConfirmation_Message {
get {
return ResourceManager.GetString("MessageBoxes_ResetSettingsConfirmation_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Some settings will not take effect until the application is restarted..
/// </summary>
internal static string MessageBoxes_RestartNeededForSettingChangeQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_RestartNeededForSettingChangeQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Do you want to restart BCU to apply new settings?.
/// </summary>
internal static string MessageBoxes_RestartNeededForSettingChangeQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_RestartNeededForSettingChangeQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Change application settings.
/// </summary>
internal static string MessageBoxes_RestartNeededForSettingChangeQuestion_Title {
get {
return ResourceManager.GetString("MessageBoxes_RestartNeededForSettingChangeQuestion_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Failed to save the list to a file.
/// </summary>
internal static string MessageBoxes_SaveUninstallListError_Message {
get {
return ResourceManager.GetString("MessageBoxes_SaveUninstallListError_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to An error has been encountered while opening the search page.
/// </summary>
internal static string MessageBoxes_SearchOnlineError_Message {
get {
return ResourceManager.GetString("MessageBoxes_SearchOnlineError_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Nothing to search for.
/// </summary>
internal static string MessageBoxes_SearchOnlineMessageBox_NothingToSearchFor_Message {
get {
return ResourceManager.GetString("MessageBoxes_SearchOnlineMessageBox_NothingToSearchFor_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to I'm sorry to see you leave! If you have a minute or two please drop a word on why you uninstalled BCU on my website (path_to_url I'll do my best to fix any legitimate problems..
/// </summary>
internal static string MessageBoxes_SelfUninstallQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_SelfUninstallQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Are you sure you want to uninstall BCUninstaller?.
/// </summary>
internal static string MessageBoxes_SelfUninstallQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_SelfUninstallQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Uninstall BCUninstaller.
/// </summary>
internal static string MessageBoxes_SelfUninstallQuestion_Title {
get {
return ResourceManager.GetString("MessageBoxes_SelfUninstallQuestion_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to If you are unsure if applications you are uninstalling are important or required to system stability it is recommended to create a restore point.
/// If anything breaks after the procedure you can then use System Restore to roll back the changes..
/// </summary>
internal static string MessageBoxes_SysRestoreBeginQuestion_Details {
get {
return ResourceManager.GetString("MessageBoxes_SysRestoreBeginQuestion_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Do you want to create a restore point before continuing?.
/// </summary>
internal static string MessageBoxes_SysRestoreBeginQuestion_Message {
get {
return ResourceManager.GetString("MessageBoxes_SysRestoreBeginQuestion_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to The restore point WAS NOT CREATED, you will not be able to restore changes! Do you want to continue with the uninstallation anyway?.
/// </summary>
internal static string MessageBoxes_SysRestoreContinueAfterError_Details {
get {
return ResourceManager.GetString("MessageBoxes_SysRestoreContinueAfterError_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Failed to create a new restore point.
/// </summary>
internal static string MessageBoxes_SysRestoreContinueAfterError_Message {
get {
return ResourceManager.GetString("MessageBoxes_SysRestoreContinueAfterError_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Selecting "Terminate" will immediately close the running uninstaller and might result in uninstallation not being completed. Usually it is possible to run the uninstaller again to finish the uninstallation.
///
///Alternatively you can skip waiting for this process. Skipping will let the uninstaller continue working while the task moves on to the next item. Keep in mind that some uninstallers can fail to run until the skipped process finishes..
/// </summary>
internal static string MessageBoxes_TaskSkip_Details {
get {
return ResourceManager.GetString("MessageBoxes_TaskSkip_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Do you want to skip waiting for the currently running uninstaller?.
/// </summary>
internal static string MessageBoxes_TaskSkip_Message {
get {
return ResourceManager.GetString("MessageBoxes_TaskSkip_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Skip currently running task.
/// </summary>
internal static string MessageBoxes_TaskSkip_Title {
get {
return ResourceManager.GetString("MessageBoxes_TaskSkip_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Stopping the task prematurely will not revert any changes. Currently running uninstaller won't be stopped, the task will wait for it to finish..
/// </summary>
internal static string MessageBoxes_TaskStopConfirmation_Details {
get {
return ResourceManager.GetString("MessageBoxes_TaskStopConfirmation_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Are you sure you want to stop currently running task?.
/// </summary>
internal static string MessageBoxes_TaskStopConfirmation_Message {
get {
return ResourceManager.GetString("MessageBoxes_TaskStopConfirmation_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Stop current uninstall task.
/// </summary>
internal static string MessageBoxes_TaskStopConfirmation_Title {
get {
return ResourceManager.GetString("MessageBoxes_TaskStopConfirmation_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Copy to clipboard.
/// </summary>
internal static string MessageBoxes_Title_Copy_to_clipboard {
get {
return ResourceManager.GetString("MessageBoxes_Title_Copy_to_clipboard", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Create restore point.
/// </summary>
internal static string MessageBoxes_Title_Create_restore_point {
get {
return ResourceManager.GetString("MessageBoxes_Title_Create_restore_point", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Junk/Leftover removal.
/// </summary>
internal static string MessageBoxes_Title_Junk_Leftover_removal {
get {
return ResourceManager.GetString("MessageBoxes_Title_Junk_Leftover_removal", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Leftover removal.
/// </summary>
internal static string MessageBoxes_Title_Leftover_removal {
get {
return ResourceManager.GetString("MessageBoxes_Title_Leftover_removal", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Modify protected item.
/// </summary>
internal static string MessageBoxes_Title_Modify_protected_items {
get {
return ResourceManager.GetString("MessageBoxes_Title_Modify_protected_items", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Open directories.
/// </summary>
internal static string MessageBoxes_Title_Open_directories {
get {
return ResourceManager.GetString("MessageBoxes_Title_Open_directories", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Open Uninstall List.
/// </summary>
internal static string MessageBoxes_Title_Open_Uninstall_List {
get {
return ResourceManager.GetString("MessageBoxes_Title_Open_Uninstall_List", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Open URLs.
/// </summary>
internal static string MessageBoxes_Title_Open_urls {
get {
return ResourceManager.GetString("MessageBoxes_Title_Open_urls", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Quiet uninstall.
/// </summary>
internal static string MessageBoxes_Title_Quiet_uninstall {
get {
return ResourceManager.GetString("MessageBoxes_Title_Quiet_uninstall", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Rename uninstaller.
/// </summary>
internal static string MessageBoxes_Title_Rename_uninstaller {
get {
return ResourceManager.GetString("MessageBoxes_Title_Rename_uninstaller", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Restore default settings.
/// </summary>
internal static string MessageBoxes_Title_Restore_default_settings {
get {
return ResourceManager.GetString("MessageBoxes_Title_Restore_default_settings", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Save Uninstall List.
/// </summary>
internal static string MessageBoxes_Title_Save_Uninstall_List {
get {
return ResourceManager.GetString("MessageBoxes_Title_Save_Uninstall_List", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Search for updates.
/// </summary>
internal static string MessageBoxes_Title_Search_for_updates {
get {
return ResourceManager.GetString("MessageBoxes_Title_Search_for_updates", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Search on line.
/// </summary>
internal static string MessageBoxes_Title_Search_online {
get {
return ResourceManager.GetString("MessageBoxes_Title_Search_online", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Submit feedback.
/// </summary>
internal static string MessageBoxes_Title_Submit_feedback {
get {
return ResourceManager.GetString("MessageBoxes_Title_Submit_feedback", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Another uninstall task is already running. Please wait for it to finish and then try again..
/// </summary>
internal static string MessageBoxes_UninstallAlreadyRunning_Message {
get {
return ResourceManager.GetString("MessageBoxes_UninstallAlreadyRunning_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Uninstall from directory.
/// </summary>
internal static string MessageBoxes_UninstallFromDirectory_Title {
get {
return ResourceManager.GetString("MessageBoxes_UninstallFromDirectory_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Make sure that you selected the correct directory and that the application's executables are still present..
/// </summary>
internal static string MessageBoxes_UninstallFromDirectoryNothingFound_Details {
get {
return ResourceManager.GetString("MessageBoxes_UninstallFromDirectoryNothingFound_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to No applications were found in the specified directory.
/// </summary>
internal static string MessageBoxes_UninstallFromDirectoryNothingFound_Message {
get {
return ResourceManager.GetString("MessageBoxes_UninstallFromDirectoryNothingFound_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Do you want to run this uninstaller?.
/// </summary>
internal static string MessageBoxes_UninstallFromDirectoryUninstallerFound_Details {
get {
return ResourceManager.GetString("MessageBoxes_UninstallFromDirectoryUninstallerFound_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Found an uninstaller for {0}.
/// </summary>
internal static string MessageBoxes_UninstallFromDirectoryUninstallerFound_Message {
get {
return ResourceManager.GetString("MessageBoxes_UninstallFromDirectoryUninstallerFound_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Selected uninstaller doesn't have a valid Guid for use with MsiExec..
/// </summary>
internal static string MessageBoxes_UninstallMsiGuidMissing_Details {
get {
return ResourceManager.GetString("MessageBoxes_UninstallMsiGuidMissing_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to The selected entry can't be uninstalled using the MsiExec installer.
/// </summary>
internal static string MessageBoxes_UninstallMsiGuidMissing_Message {
get {
return ResourceManager.GetString("MessageBoxes_UninstallMsiGuidMissing_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Uninstall using Msi.
/// </summary>
internal static string MessageBoxes_UninstallMsiGuidMissing_Title {
get {
return ResourceManager.GetString("MessageBoxes_UninstallMsiGuidMissing_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to BCUninstaller will automatically download the update and apply it after a restart. Please note that you might lose your settings in the process.
///
///Changelog:
///- {0}
///
///Warning: During update the folder "Update" and the file "Update.zip" inside of the BCU directory will be removed..
/// </summary>
internal static string MessageBoxes_UpdateAskToDownload_Details {
get {
return ResourceManager.GetString("MessageBoxes_UpdateAskToDownload_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to New version {0} is available, do you want to upgrade now?.
/// </summary>
internal static string MessageBoxes_UpdateAskToDownload_Message {
get {
return ResourceManager.GetString("MessageBoxes_UpdateAskToDownload_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Make sure that BCUninstaller is not blocked in your firewall and that you have a working internet connection.
///
///.
/// </summary>
internal static string MessageBoxes_UpdateFailed_Details {
get {
return ResourceManager.GetString("MessageBoxes_UpdateFailed_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Encountered an error while checking for updates.
/// </summary>
internal static string MessageBoxes_UpdateFailed_Message {
get {
return ResourceManager.GetString("MessageBoxes_UpdateFailed_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to No updates were found at this time, you have the latest version.
///
///Want some functionality added or a bug fixed? Please send me your feedback using "Help->Submit feedback" menu..
/// </summary>
internal static string MessageBoxes_UpdateUptodate_Details {
get {
return ResourceManager.GetString("MessageBoxes_UpdateUptodate_Details", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Current version is up to date.
/// </summary>
internal static string MessageBoxes_UpdateUptodate_Message {
get {
return ResourceManager.GetString("MessageBoxes_UpdateUptodate_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Welcome to BCU version {0}!.
/// </summary>
internal static string NewsPopup_FirstStartTitle {
get {
return ResourceManager.GetString("NewsPopup_FirstStartTitle", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to BCU has been updated to v{0}!.
/// </summary>
internal static string NewsPopup_UpdatedTitle {
get {
return ResourceManager.GetString("NewsPopup_UpdatedTitle", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Not available.
/// </summary>
internal static string NotAvailable {
get {
return ResourceManager.GetString("NotAvailable", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Finishing up....
/// </summary>
internal static string Progress_Finishing {
get {
return ResourceManager.GetString("Progress_Finishing", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Loading icons.
/// </summary>
internal static string Progress_Finishing_Icons {
get {
return ResourceManager.GetString("Progress_Finishing_Icons", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Error.
/// </summary>
internal static string PropertiesWindow_Table_Error {
get {
return ResourceManager.GetString("PropertiesWindow_Table_Error", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to File doesn't exist..
/// </summary>
internal static string PropertiesWindow_Table_ErrorDoesntExist {
get {
return ResourceManager.GetString("PropertiesWindow_Table_ErrorDoesntExist", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to This application does not have a valid registry entry.
/// </summary>
internal static string PropertiesWindow_Table_ErrorMissingRegistry {
get {
return ResourceManager.GetString("PropertiesWindow_Table_ErrorMissingRegistry", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to This application does not have a valid uninstaller.
/// </summary>
internal static string PropertiesWindow_Table_ErrorMissingUninstaller {
get {
return ResourceManager.GetString("PropertiesWindow_Table_ErrorMissingUninstaller", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Nothing to display. This application is uninstalled using Windows Installer (MsiExec)..
/// </summary>
internal static string PropertiesWindow_Table_ErrorMsi {
get {
return ResourceManager.GetString("PropertiesWindow_Table_ErrorMsi", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Certificate is missing.
/// </summary>
internal static string PropertiesWindow_Table_ErrorNoCertificate {
get {
return ResourceManager.GetString("PropertiesWindow_Table_ErrorNoCertificate", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Name.
/// </summary>
internal static string PropertiesWindow_Table_Name {
get {
return ResourceManager.GetString("PropertiesWindow_Table_Name", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Value.
/// </summary>
internal static string PropertiesWindow_Table_Value {
get {
return ResourceManager.GetString("PropertiesWindow_Table_Value", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to {0} applications.
/// </summary>
internal static string RateTitle_Counted {
get {
return ResourceManager.GetString("RateTitle_Counted", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Average rating: {0}; My rating: {1}.
/// </summary>
internal static string RatingEntry_ToString {
get {
return ResourceManager.GetString("RatingEntry_ToString", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to There are no entries matching your search criteria..
/// </summary>
internal static string SearchNothingFoundMessage {
get {
return ResourceManager.GetString("SearchNothingFoundMessage", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to x64.
/// </summary>
internal static string Str64Bit {
get {
return ResourceManager.GetString("Str64Bit", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to DEBUG.
/// </summary>
internal static string StrDebug {
get {
return ResourceManager.GetString("StrDebug", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to BCUninstaller export
///Publisher | Version | Date | Size | Registry | Uninstaller type | Uninstall string | Quiet uninstall string | Comments.
/// </summary>
internal static string StrExportHeader {
get {
return ResourceManager.GetString("StrExportHeader", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Portable.
/// </summary>
internal static string StrIsPortable {
get {
return ResourceManager.GetString("StrIsPortable", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Failed to call the API.
/// </summary>
internal static string SysRestoreGenericError {
get {
return ResourceManager.GetString("SysRestoreGenericError", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to No valid files or directories were selected. Make sure you have access to them, and they aren't marked as system files..
/// </summary>
internal static string TargetWindow_NoFilesSelected_Message {
get {
return ResourceManager.GetString("TargetWindow_NoFilesSelected_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Look for application.
/// </summary>
internal static string TargetWindow_NoFilesSelected_Title {
get {
return ResourceManager.GetString("TargetWindow_NoFilesSelected_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Failed to find any applications inside {0}.
/// </summary>
internal static string Uninstaller_GetApplicationsFromDirectories_NothingFound_Message {
get {
return ResourceManager.GetString("Uninstaller_GetApplicationsFromDirectories_NothingFound_Message", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Look for applications.
/// </summary>
internal static string Uninstaller_GetApplicationsFromDirectories_NothingFound_Title {
get {
return ResourceManager.GetString("Uninstaller_GetApplicationsFromDirectories_NothingFound_Title", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Does nothing.
/// </summary>
internal static string UninstallerListDoubleClickAction_DoNothing {
get {
return ResourceManager.GetString("UninstallerListDoubleClickAction_DoNothing", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Opens properties.
/// </summary>
internal static string UninstallerListDoubleClickAction_Properties {
get {
return ResourceManager.GetString("UninstallerListDoubleClickAction_Properties", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Uninstalls.
/// </summary>
internal static string UninstallerListDoubleClickAction_Uninstall {
get {
return ResourceManager.GetString("UninstallerListDoubleClickAction_Uninstall", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Select directory with applications that you want to remove..
/// </summary>
internal static string UninstallFromDirectory_FolderBrowse {
get {
return ResourceManager.GetString("UninstallFromDirectory_FolderBrowse", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Scanning specified directory....
/// </summary>
internal static string UninstallFromDirectory_ScanningTitle {
get {
return ResourceManager.GetString("UninstallFromDirectory_ScanningTitle", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Putting PC to sleep in {0}s. Uncheck the sleep checkbox to cancel..
/// </summary>
internal static string UninstallProgressWindow_StatusPuttingToSleepInSeconds {
get {
return ResourceManager.GetString("UninstallProgressWindow_StatusPuttingToSleepInSeconds", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Task finished.
/// </summary>
internal static string UninstallProgressWindow_TaskDone {
get {
return ResourceManager.GetString("UninstallProgressWindow_TaskDone", resourceCulture);
}
}
/// <summary>
/// Looks up a localized string similar to Uninstalling.
/// </summary>
internal static string UninstallProgressWindow_Uninstalling {
get {
return ResourceManager.GetString("UninstallProgressWindow_Uninstalling", resourceCulture);
}
}
}
}
```
|
```yaml
# index page sections
# custom following lines to edit your index page
- id: about-me
i18n: nav.about_me
name: About
tpl: about.html
css:
- id: career
i18n: nav.career
name: Career
tpl: career.html
css: timeline
- id: skills
i18n: nav.skills
name: Skills
tpl: skills.html
css: team
- id: projects
i18n: nav.projects
name: Projects
tpl: projects.html
css: project
- id: blog
i18n: nav.blog
name: Blog
tpl: blog.html
page: blog/
css: testimonials navy-section
- id: links
i18n: nav.link
name: Links
tpl: links.html
css: contact
```
|
A "selfie museum" or "Instagram museum" is a type of art gallery or installation designed to provide a setting for visitors to pose in photographs to be posted on social media sites such as Instagram. Typical features of exhibits in a selfie museum include colorful backdrops, oversize props, and optical illusions such as anamorphosis.
29Rooms, a three-day immersive art installation created by Refinery29 in 2015 in New York City, has been cited as the first example of this type of facility. The Museum of Ice Cream, opened in 2016, is also credited as a major catalyst of selfie museums. By 2019, there were reportedly dozens of selfie museums across the United States. They faced challenges in 2020 when most were forced to close temporarily due to the COVID-19 pandemic.
Some predecessors to this trend from the contemporary art world have been identified, such as Rain Room, Urban Light, and the mirrored rooms of Yayoi Kusama. The large-scale experimental artworks exhibited at the Burning Man festival have also been cited as an influence, as well as the artist collective Meow Wolf.
Some commentators have criticized the use of the word "museum" to describe these establishments. Unlike traditional museums, which are often non-profit organizations with an educational mission, selfie museums are almost always for-profit businesses, earning money through admission fees and, in some cases, corporate sponsorships. Museum of Ice Cream founder Maryellis Bunn has expressed regret over using the word, and coined the term "experium" (a portmanteau of "experience" and "museum") to describe such businesses.
Selfie museums are an example of experiential commerce. Many are pop-up exhibitions, opening for only a few months in a particular location, while others are permanent.
Notable examples
Color Factory
Dessert Museum
Museum of Ice Cream
Museum of Pizza
References
Further reading
Types of museums
Installation art
Selfies
Visual arts exhibitions
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.