text stringlengths 1 22.8M |
|---|
Metroid Prime: Federation Force is a cooperative first-person shooter video game developed by Next Level Games and published by Nintendo for the Nintendo 3DS. Taking place after the events of Metroid Prime 3: Corruption (2007), players assume the role of Galactic Federation Marines attempting to thwart the continuing advances of the Space Pirates after Samus Aran eradicated the deadly Phazon mutagen. The gameplay places a greater emphasis on the shooting mechanics and multiplayer, similar to its handheld predecessor Metroid Prime Hunters, albeit with cooperation instead of competition. It also includes a competitive soccer-based game mode known as Metroid Prime: Blast Ball.
Federation Force'''s announcement was met with a largely negative reception from fans due to the game bearing very little resemblance to previous entries in the Metroid franchise. The game was further derided for its poor timing, as it was a spin-off title that was announced when the series had been on hiatus since the controversial Metroid: Other M (2010). Upon release, the game was a commercial failure and was met with a mixed reception.
Gameplay Metroid Prime: Federation Force plays similarly to Metroid Prime Hunters, which primarily focused on the shooting mechanics within the Metroid Prime series as opposed to the exploration. Like its handheld predecessor, Federation Force incorporates cooperative elements into the core gameplay. However, Federation Force lacks the touch-based controls of Hunters as well as the established scanning mechanics of the Metroid Prime series, which allowed players to analyze their character's surrounding environment and discover secrets.Federation Force is the first Metroid game where the player controls a Marine of the Galactic Federation. Within the context of the Metroid series, the Galactic Federation is a law-enforcing organization where soldiers are divided into platoons and go on planetary missions, which is how Federation Forces campaign is organized. The game features previously established aliens as enemies, including the titular jellyfish-like Metroids and Space Pirates. However, it also features original enemies, such as Goliath Beetles. The environments are diversified, with at least one mission taking place in an icy region, while another takes place in a desert.
Up to four players traverse the planets to meet their objective. Unlike the multiplayer modes within Hunters and Metroid Prime 2: Echoes, players work cooperatively as a single unit as opposed to competing with each other. Before starting a mission, players can customize their Marine with different weapons and utilities. Some are more offensive, like the returning Super Missiles. Others are more strategic, such as a healing first aid device that allows one Marine to hang back and aid his comrades. The different weapons have weight-based properties that affect the player's speed and mobility. These mechanics are inspired by the options within classical role-playing games.Federation Force canonically occurs after Metroid Prime 3: Corruption. The young Marine goes through various parts of training and eventually be sent to carry out research missions on three different planets. While conducting these missions, it is discovered that the Space Pirates have been creating weapons in secrecy as part of a plot to use them against the Galactic Federation. Although Samus Aran is not the main protagonist, she is featured in the game and emphasis is made on encountering her from the perspective of the Federation Marines. Producer Kensuke Tanabe hoped that Federation Forces plot would lead to future Metroid Prime games based on the relationship between Samus and Sylux, with additional involvement from the Federation Marines.
Blast Ball
"Blast Ball" is a mode which offers three-on-three matches, where players in their mecha suits shoot balls into nets akin to both the real life sport soccer and the video game Rocket League. This mode serves as a tutorial for the control scheme and an in-universe exercise for the playable Marines.
This mode was originally unveiled as a separate game under the same name during the Nintendo World Championships and was the first reveal of Metroid Prime: Federation Force in general. This mode was also playable during E3 2015, where Federation Force was announced days later.
"Blast Ball" was released independently as a free download on the Nintendo eShop on July 21, 2016, with a limited online play period. Nintendo of America branded the download as a special demo version of the full game. The mode is also included in the retail title with full online support, and saved progress from the free download can be transferred to the retail version. Online support for the free download was terminated on December 31 the same year. This did not affect the online support for the "Blast Ball" mode in the full version.
Synopsis
Setting
The events of Metroid Prime: Federation Force take place after Metroid Prime 3: Corruption. Instead of featuring Samus Aran as the protagonist or a playable character, the game focuses on the Galactic Federation's Federation Force, a group of elite marines equipped with gigantic mechanized armorsuits called Mechs modeled after Samus Aran's Power Suit.
The Federation Force is assigned to former Galactic Federation territory in the Bermuda System which features three planets: Excelcion, Talvania, and Bion. However, the Space Pirates have regrouped in this area and have obtained an ancient technology that increases their size to gargantuan proportions. Samus, featured as a secondary character in Metroid Prime: Federation Force, appears to conduct investigations regarding the Space Pirate's presence.
Plot
In an effort to eradicate the Space Pirate menace for good, the Galactic Federation authorizes Operation Golem, a top-secret project in developing Mech suits to better combat the threat. An elite unit in the Federation, known as the Federation Force, is formed to pilot these Mechs, led by General Alex Miles. The Federation Force is sent to the Bermuda System to conduct archaeological surveys.
The Federation Force soon discovers Space Pirate presence in the Bermuda System. The Galactic Federation hires Samus Aran to investigate the Space Pirates and provide intelligence. During an investigation on Bion, the Federation Force learns that the Space Pirates have acquired a technology that increases their size. Meanwhile, Samus discovers that the Space Pirates are building a massive battleship known as the Doomseye. The Federation then abruptly loses contact with Samus.
The Doomseye cannot be located due to sophisticated cloaking technology powered by generators on each of the three planets in the system. The Force destroys the devices and reveals the Doomseye in orbit, which retaliates and decimates the majority of the Federation Fleet before surrounding itself in an impenetrable shield. The Federation Force infiltrates the Doomseye and discovers that the Space Pirates have captured Samus, who is then brainwashed and transformed into gigantic size and forced to fight against the Force. The Force defeats her, returning her size to normal, and disables the Doomseye's force field, allowing the survivors of the Federation Fleet to launch their assault. During the ensuing chaos, the Force is sucked into the vacuum of space before the Fleet destroys the Doomseye, where they are saved by Samus. Samus then thanks the Federation Force for their efforts.
In a post-credits scene, if the Federation Force had successfully stolen a Metroid egg from the Space Pirates, an unseen individual bearing a striking resemblance to Sylux infiltrates a Galactic Federation facility and encounters the Metroid egg. The individual projects a beam onto the egg, causing it to rapidly hatch into larval form.
Development Federation Force was developed by Next Level Games, who are known for having previously developed Super Mario Strikers, Mario Strikers Charged, Punch-Out!! for Wii, and Luigi's Mansion: Dark Moon. In early 2014, an interview with Next Level Games' co-founder Jason Carr revealed the company's closeness with Nintendo and implied that their future games would be exclusive to Nintendo's consoles. Carr also shared that Nintendo gives them "better and better IP to work with".
Nintendo's subsidiary Retro Studios - who previously developed Metroid Prime, Metroid Prime 2: Echoes, and Metroid Prime 3: Corruption - were not directly involved with Federation Forces development, but they designed the Galactic Federation mechs for the title. It was speculated by some people that Nintendo Software Technology, the development studio behind previous handheld entry Metroid Prime Hunters, may have been involved, but this turned out to be untrue. NST were not even made aware of the title's existence and only learned of Federation Force during the E3 2015 Nintendo Direct.
The producer of Federation Force was Kensuke Tanabe, who produced all previous Metroid Prime titles. He first conceptualized of a game centered around the Galactic Federation while working on Metroid Prime 3: Corruption. He wanted to expand the Metroid universe by showing it from the perspective of the Galactic Federation's Marines. In addition to Tanabe, Nintendo's Yoshihito Ikebata and Ryuichi Nakada oversaw the game's development. They originally considered making it for the Nintendo DSi, but ultimately decided to make it for Nintendo 3DS due to Next Level Games' familiarity with the hardware. It was planned to release alongside the New Nintendo 3DS, but development pushed the title's release date to 2016.
While the game is playable on all Nintendo 3DS models, Metroid Prime: Federation Force specifically benefits from the C-Stick of the New Nintendo 3DS by allowing the player to adjust their view of the surrounding environments. This extends to the game also supporting the Circle Pad Pro and Gyro Sensor controls for earlier Nintendo 3DS models. The game also supports Amiibo functionality, with compatible Amiibo unlocking new paint jobs for the Mech that award special gameplay bonuses.
Reception
Pre-release
Upon its reveal at E3 2015, Metroid Prime: Federation Force received negative reception from many fans of the series. The game was criticized for lacking traditional Metroid series elements and not resembling other Metroid games, with criticism aimed toward the game's focus on first-person shooter combat and multiplayer over exploration and isolation, the lack of a single player mode, the graphics (both the technical aspect and the use of a cartoonish super-deformed art style, which was considered unfitting with the Metroid series' mature tones) and the absence of the series protagonist Samus Aran. Moreover, as the series had been on hiatus for five years since the last released game in the series, Metroid: Other M, and the last acclaimed Metroid game, Metroid Prime 3: Corruption, was released eight years prior, and the game's release window would coincide with the series' 30th anniversary, fans criticized Nintendo's choice of resuming the franchise after a half-decade of hiatus with a spin-off title rather than a main series Metroid game.
The game became one of the most discussed and controversial games of both that year's E3 and 2015 in general: the debut trailer received over 25,000 dislikes and just 2,500 likes on YouTube within the first day of its announcement, giving it a 90% dislike ratio, and reached 9,500 likes and 83,000 dislikes by the end of that year. A Change.org petition calling for the game's cancellation was also created in the hours following the game's announcement, reaching 7,500 signatures in under 24 hours. Within 2 months this petition went up to 20,000 signatures. It was later announced that the game does have a single player mode and that Samus Aran would appear in-game as a non-playable character. This game would be a defining factor on the negative reception of Nintendo's presence at E3 2015 as whole, fueled by the announcement of Animal Crossing: amiibo Festival and the lack of The Legend of Zelda: Breath of the Wild.
Following a long silence on the game, Tanabe detailed the game further in a March 2016 Nintendo Direct. However, an accompanying trailer on YouTube received a 2:1 dislike to like ratio (last recorded as 1,374 to 600) and resulted in Nintendo disabling the feature within hours of being available. Additionally, the game completely skipped E3 2016, even though its release was slated for a few months after the event.
Post-releaseMetroid Prime: Federation Force received a rating of 64/100 on the review aggregator website Metacritic, indicating "mixed or average reviews".
Sales
Upon release in Japan in August 2016, Metroid Prime: Federation Force sold less than 4,000 copies and failed to enter the top 20 of the sales charts. In the United Kingdom, the game debuted outside of the all-format software charts, below older 3DS titles such as New Super Mario Bros. 2 and Tomodachi Life, and charting outside of the top ten on the 3DS charts, leading some outlets to describe the game as a commercial failure.
Legacy
In the 2018 Nintendo Switch game Super Smash Bros. Ultimate, the blue Mech appears as a collectible Spirit and the title's main theme appears as a music track that can be played on stages hailing from the Metroid'' series.
References
2016 video games
First-person shooters
Metroid Prime
Nintendo 3DS eShop games
Nintendo 3DS games
Nintendo 3DS-only games
Nintendo Network games
Video games developed in Canada
Video games set on fictional planets
Video games that use Amiibo figurines
Metroid games
Interquel video games
Video games produced by Kensuke Tanabe
Next Level Games games
Multiplayer and single-player video games |
```xml
import assert from 'assert';
import AsyncTestUtil, { wait, waitUntil, randomString } from 'async-test-util';
import {
schemaObjects,
schemas,
humansCollection,
isNode
} from '../../plugins/test-utils/index.mjs';
import {
createRxDatabase,
randomCouchString,
addRxPlugin,
RxJsonSchema,
ensureNotFalsy,
RxLocalDocument,
RxCollection
} from '../../plugins/core/index.mjs';
import { RxDBLocalDocumentsPlugin } from '../../plugins/local-documents/index.mjs';
addRxPlugin(RxDBLocalDocumentsPlugin);
import config, { describeParallel } from './config.ts';
import {
filter,
first,
map
} from 'rxjs/operators';
import { firstValueFrom } from 'rxjs';
declare type TestDocType = {
foo: string;
};
describeParallel('local-documents.test.ts', () => {
describe('.insertLocal()', () => {
describe('positive', () => {
it('should create a local document', async () => {
const c = await humansCollection.create(0);
const doc = await c.insertLocal('foobar', {
foo: 'bar'
});
assert.ok(doc);
c.database.destroy();
});
it('should not find the doc because its local', async () => {
const c = await humansCollection.create(0);
await c.insertLocal('foobar', {
foo: 'bar'
});
const doc2 = await c.findOne().exec();
assert.strictEqual(doc2, null);
c.database.destroy();
});
});
describe('negative', () => {
it('should throw if already exists', async () => {
const c = await humansCollection.create(0);
const doc = await c.insertLocal('foobar', {
foo: 'bar'
});
assert.ok(doc);
let thrown = false;
try {
await c.insertLocal('foobar', {
foo: 'bar2'
});
} catch (err) {
thrown = true;
}
assert.ok(thrown);
c.database.destroy();
});
});
});
describe('.getLocal()', () => {
describe('positive', () => {
it('should find the document', async () => {
const c = await humansCollection.create(0);
await c.insertLocal('foobar', {
foo: 'bar'
});
const doc = await c.getLocal('foobar');
assert.ok(doc);
assert.strictEqual(doc.get('foo'), 'bar');
c.database.destroy();
});
it('should find the document twice (doc-cache)', async () => {
const c = await humansCollection.create(0);
await c.insertLocal('foobar', {
foo: 'bar'
});
const doc = await c.getLocal('foobar');
const doc2 = await c.getLocal('foobar');
assert.ok(doc);
assert.ok(doc === doc2);
c.database.destroy();
});
});
describe('negative', () => {
it('should not find non-existing', async () => {
const c = await humansCollection.create(0);
const doc = await c.getLocal('foobar');
assert.strictEqual(doc, null);
c.database.destroy();
});
});
});
describe('.$', () => {
it('should return the full RxLocaDocument, not just the data', async () => {
const c = await humansCollection.create(0);
const doc = await c.insertLocal('foobar', {
foo: 'bar'
});
const emitted: RxLocalDocument<any, any>[] = [];
doc.$.subscribe(fullDoc => {
emitted.push(fullDoc);
});
await waitUntil(() => emitted.length === 1);
await doc.incrementalPatch({ foo: 'bar2' });
await waitUntil(() => emitted.length === 2);
emitted.forEach(fullDoc => {
// ensure it is a full RxLocalDocument instance
assert.ok(fullDoc.primary);
});
// 2nd must have updated data
assert.strictEqual(emitted[1].get('foo'), 'bar2');
c.database.destroy();
});
});
describe('incremental mutation functions', () => {
type LocalDocType = {
foo: string;
added?: string;
};
describe('.incrementalPatch()', () => {
it('should modify the data', async () => {
const c = await humansCollection.create(0);
let doc = await c.upsertLocal<LocalDocType>(
'foobar',
{
foo: 'bar'
}
);
doc = await doc.incrementalPatch({
added: 'foo'
});
assert.strictEqual(doc.get('foo'), 'bar');
assert.strictEqual(doc.get('added'), 'foo');
c.database.destroy();
});
});
describe('.incrementalModify()', () => {
it('should modify the data', async () => {
const c = await humansCollection.create(0);
let doc: RxLocalDocument<RxCollection<any>, LocalDocType> = await c.upsertLocal<LocalDocType>('foobar', {
foo: 'bar'
});
doc = await doc.incrementalModify(data => {
data.added = 'foo';
return data;
});
assert.strictEqual(doc.get('foo'), 'bar');
assert.strictEqual(doc.get('added'), 'foo');
c.database.destroy();
});
});
});
describe('.getLocal$()', () => {
const id = 'foo';
it('should emit null when not exists', async () => {
const c = await humansCollection.create(0);
const cData = await c.getLocal$(id).pipe(first()).toPromise();
const dbData = await c.database.getLocal$(id).pipe(first()).toPromise();
assert.strictEqual(cData, null);
assert.strictEqual(dbData, null);
c.database.destroy();
});
it('should emit the document when exists', async () => {
const c = await humansCollection.create(0);
await c.insertLocal(id, {
foo: 'bar'
});
await c.database.insertLocal(id, {
foo: 'bar'
});
const cDoc = await c.getLocal$(id).pipe(first()).toPromise();
const dbDoc = await c.database.getLocal$(id).pipe(first()).toPromise();
assert.strictEqual(ensureNotFalsy(cDoc).get('foo'), 'bar');
assert.strictEqual(ensureNotFalsy(dbDoc).get('foo'), 'bar');
c.database.destroy();
});
it('collection: should emit again when state changed', async () => {
const c = await humansCollection.create(0);
const cEmits: any[] = [];
const sub = c.getLocal$(id).subscribe((x: any) => {
cEmits.push(x ? x.toJSON() : null);
});
await waitUntil(() => cEmits.length === 1);
assert.strictEqual(cEmits[0], null);
// insert
await c.insertLocal(id, { foo: 'bar' });
await waitUntil(() => cEmits.length === 2);
assert.strictEqual(cEmits[1].data.foo, 'bar');
// update
await c.upsertLocal(id, { foo: 'bar2' });
await waitUntil(() => cEmits.length === 3);
assert.strictEqual(cEmits[2].data.foo, 'bar2');
sub.unsubscribe();
c.database.destroy();
});
it('database: should emit again when state changed', async () => {
const c = await humansCollection.create(0);
const db = c.database;
const cEmits: any[] = [];
const sub = db.getLocal$(id).subscribe((x) => {
cEmits.push(x ? x.toJSON() : null);
});
await waitUntil(() => cEmits.length === 1);
assert.strictEqual(cEmits[0], null);
// insert
await db.insertLocal(id, { foo: 'bar' });
await waitUntil(() => cEmits.length === 2);
assert.strictEqual(cEmits[1].data.foo, 'bar');
// update
await db.upsertLocal(id, { foo: 'bar2' });
await waitUntil(() => cEmits.length === 3);
assert.strictEqual(cEmits[2].data.foo, 'bar2');
sub.unsubscribe();
c.database.destroy();
});
});
describe('.upsertLocal()', () => {
describe('positive', () => {
it('should insert when not exists', async () => {
const c = await humansCollection.create(0);
const doc: RxLocalDocument<any, { foo: string; }> = await c.upsertLocal<{ foo: string; }>('foobar', {
foo: 'bar'
});
assert.ok(doc);
assert.strictEqual(doc.get('foo'), 'bar');
c.database.destroy();
});
it('should update if the document already exists', async () => {
const c = await humansCollection.create(0);
const doc = await c.upsertLocal('foobar', {
foo: 'bar'
});
const doc2 = await c.upsertLocal('foobar', {
foo: 'bar2'
});
assert.strictEqual(doc2.get('foo'), 'bar2');
assert.ok(doc !== doc2);
c.database.destroy();
});
/**
* @link path_to_url
*/
it('should invoke subscription once', async () => {
const c = await humansCollection.create(0);
const emitted: RxLocalDocument<any, { foo: string; }>[] = [];
const doc = await c.upsertLocal<{ foo: string; }>('foobar', {
foo: 'barOne',
});
await wait(50);
const docSub = doc.$.subscribe(x => {
emitted.push(x as any);
});
await waitUntil(() => emitted.length === 1);
await c.upsertLocal('foobar', {
foo: 'barTwo',
});
assert.strictEqual(emitted.length, 2);
// first 'barOne' is emitted because.$ is a BehaviorSubject
assert.strictEqual(emitted[0].get('foo'), 'barOne');
// second after the change, barTwo is emitted
assert.strictEqual(emitted[1].get('foo'), 'barTwo');
docSub.unsubscribe();
c.database.destroy();
});
});
describe('negative', () => { });
});
describe('.remove()', () => {
it('should remove the document', async () => {
const c = await humansCollection.create(0);
const doc = await c.upsertLocal('foobar', {
foo: 'bar'
});
await doc.remove();
const doc2 = await c.getLocal('foobar');
assert.ok(ensureNotFalsy(doc2).deleted);
c.database.destroy();
});
});
describe('with database', () => {
it('should be able to use local documents directly on the database', async () => {
const c = await humansCollection.create(0);
const db = c.database;
const doc1 = await db.insertLocal('foobar', {
foo: 'bar'
});
const doc2 = await db.getLocal('foobar');
assert.strictEqual(doc1, doc2);
db.destroy();
});
});
describe('multi-instance', () => {
if (!config.storage.hasMultiInstance) {
return;
}
it('should stream events over multi-instance', async () => {
const name = randomCouchString(10);
const db = await createRxDatabase({
name,
storage: config.storage.getStorage(),
localDocuments: true
});
const db2 = await createRxDatabase({
name,
storage: config.storage.getStorage(),
ignoreDuplicate: true,
localDocuments: true
});
const doc1 = await db.insertLocal('foobar', {
foo: 'bar'
});
let doc2: RxLocalDocument<any, any> | null;
await waitUntil(async () => {
doc2 = await db2.getLocal('foobar');
return !!doc2;
});
await doc1.incrementalPatch({ foo: 'bar2' });
await waitUntil(() => {
return ensureNotFalsy(doc2).getLatest().get('foo') === 'bar2';
}, 1000, 50);
db.destroy();
db2.destroy();
});
it('should emit deleted', async () => {
const name = randomCouchString(10);
const db = await createRxDatabase({
name,
storage: config.storage.getStorage(),
localDocuments: true
});
const db2 = await createRxDatabase({
name,
storage: config.storage.getStorage(),
ignoreDuplicate: true,
localDocuments: true
});
const doc1 = await db.insertLocal('foobar', {
foo: 'bar'
});
let doc2: RxLocalDocument<any, any> | null = undefined as any;
await waitUntil(async () => {
doc2 = await db2.getLocal('foobar');
return !!doc2;
});
const hasEmitted = firstValueFrom(
ensureNotFalsy(doc2).deleted$
.pipe(
map(x => {
return x;
}),
filter(d => d === true),
first()
)
);
await doc1.remove();
await hasEmitted;
db.destroy();
db2.destroy();
});
it('should emit changes (database)', async () => {
const name = randomCouchString(10);
const db = await createRxDatabase({
name,
storage: config.storage.getStorage(),
localDocuments: true
});
const db2 = await createRxDatabase({
name,
storage: config.storage.getStorage(),
ignoreDuplicate: true,
localDocuments: true
});
const doc1 = await db.insertLocal('foobar', {
foo: 'bar'
});
await doc1.incrementalPatch({ foo: 'bar2' });
await waitUntil(async () => {
const doc2 = await db2.getLocal<TestDocType>('foobar');
return doc2 && doc2.toJSON().data.foo === 'bar2';
});
db.destroy();
db2.destroy();
});
it('should emit changes (collection)', async () => {
const name = randomCouchString(10);
const db = await createRxDatabase({
name,
storage: config.storage.getStorage(),
});
const db2 = await createRxDatabase({
name,
storage: config.storage.getStorage(),
ignoreDuplicate: true
});
const c1 = await db.addCollections({
humans: {
schema: schemas.primaryHuman,
localDocuments: true
}
});
const c2 = await db2.addCollections({
humans: {
schema: schemas.primaryHuman,
localDocuments: true
}
});
// insert on instance #1
const doc1 = await c1.humans.insertLocal('foobar', {
foo: 'bar'
});
const emitted: any[] = [];
const sub = c1.humans.getLocal$('foobar').subscribe((x: any) => {
emitted.push(x ? x.toJSON(true) : null);
});
await waitUntil(() => emitted.length === 1);
// update on instance #2
const doc2 = await c2.humans.getLocal<TestDocType>('foobar');
await doc1.incrementalPatch({ foo: 'bar2' });
await waitUntil(() => doc2 && doc2.getLatest().toJSON().data.foo === 'bar2');
await waitUntil(() => {
return emitted.length >= 2;
});
sub.unsubscribe();
db.destroy();
db2.destroy();
});
it('BUG insertLocal not send to other instance', async () => {
const name = randomCouchString(10);
const db = await createRxDatabase({
name,
storage: config.storage.getStorage(),
localDocuments: true
});
const db2 = await createRxDatabase({
name,
storage: config.storage.getStorage(),
ignoreDuplicate: true,
localDocuments: true
});
const emitted: any[] = [];
const sub = db2.getLocal$<TestDocType>('foobar').subscribe(x => {
emitted.push(x);
});
/**
* Before inserting, we must await that the empty result set
* was emitted. Otherwise we might miss the initial emit
* because creating the db2 can take a long time
* on some storages. So not awaiting here would make the test
* timing dependent.
*/
await waitUntil(() => emitted.length === 1);
await db.insertLocal<TestDocType>('foobar', {
foo: 'bar'
});
await waitUntil(() => {
return emitted.length === 2;
}, 2000, 50);
assert.ok(emitted.pop());
const doc = await db2.getLocal<TestDocType>('foobar');
assert.strictEqual(doc && doc.toJSON().data.foo, 'bar');
sub.unsubscribe();
db.destroy();
db2.destroy();
});
it('should not conflict with non-local-doc that has same id', async () => {
const name = randomCouchString(10);
const db = await createRxDatabase({
name,
storage: config.storage.getStorage(),
localDocuments: true
});
const c1 = await db.addCollections({
humans: {
schema: schemas.primaryHuman,
localDocuments: true
}
});
const db2 = await createRxDatabase({
name,
storage: config.storage.getStorage(),
ignoreDuplicate: true,
localDocuments: true
});
const c2 = await db2.addCollections({
humans: {
schema: schemas.primaryHuman,
localDocuments: true
}
});
const docData = schemaObjects.humanData();
docData.passportId = 'foobar';
docData.age = 40;
const doc = await c1.humans.insert(docData);
const localDoc = await c1.humans.insertLocal('foobar', {
foo: 'bar',
age: 10
});
let doc2: RxLocalDocument<any, any> | null = undefined as any;
await waitUntil(async () => {
doc2 = await c2.humans.findOne().exec();
return !!doc2;
});
let localDoc2: RxLocalDocument<any, any> | null = undefined as any;
await waitUntil(async () => {
localDoc2 = await c2.humans.getLocal('foobar');
return !!localDoc2;
});
await doc.incrementalPatch({ age: 50 });
await AsyncTestUtil.waitUntil(() => (doc2 as any).getLatest().age === 50);
await AsyncTestUtil.wait(20);
assert.strictEqual(ensureNotFalsy(localDoc2).get('age'), 10);
await localDoc.incrementalPatch({ age: 66, foo: 'bar' });
await AsyncTestUtil.waitUntil(() => ensureNotFalsy(localDoc2).getLatest().get('age') === 66);
await AsyncTestUtil.wait(20);
assert.strictEqual(ensureNotFalsy(doc2).getLatest().get('age'), 50);
db.destroy();
db2.destroy();
});
});
describe('issues', () => {
it('#661 LocalDocument Observer field error', async () => {
const myCollection = await humansCollection.create(0);
await myCollection.upsertLocal(
'foobar', {
foo: 'bar'
}
);
const emitted: any[] = [];
const localDoc = await myCollection.getLocal('foobar');
ensureNotFalsy(localDoc).get$('foo').subscribe((val: any) => {
emitted.push(val);
});
await AsyncTestUtil.waitUntil(() => emitted.length === 1);
assert.strictEqual(emitted[0], 'bar');
myCollection.database.destroy();
});
it('#663 Document conflicts with LocalDocument in the same Collection', async () => {
const name = randomCouchString(10);
const db = await createRxDatabase({
name,
storage: config.storage.getStorage(),
});
type DocData = { id: string; boundariesGrp: { bndrPlnId: string; bndrPlnNm: string; }[]; };
const boundaryMgmtSchema: RxJsonSchema<DocData> = {
version: 0,
type: 'object',
primaryKey: 'id',
properties: {
id: {
type: 'string',
maxLength: 100
},
boundariesGrp: {
type: 'array',
uniqueItems: false,
items: {
type: 'object',
properties: {
bndrPlnId: {
type: 'string',
},
bndrPlnNm: {
type: 'string',
}
}
},
default: [],
},
}
};
const boundaryMgmtCols = await db.addCollections({
human: {
schema: boundaryMgmtSchema,
localDocuments: true
}
});
const boundaryMgmtCol = boundaryMgmtCols.human;
const groups = {
bndrPlnId: 'mygroup',
bndrPlnNm: 'other'
};
// insert non-local
await boundaryMgmtCol.insert({
id: randomCouchString(12),
boundariesGrp: [groups]
});
await boundaryMgmtCol.insertLocal('metadata', {
userData: {},
selectedBndrPlnId: 'foobar1',
actionRev: 0,
bndrId: 'foobar2',
direction: 'foobar3',
});
// save localgrpId
const grpId = 'foobar';
const metadata = await boundaryMgmtCol.getLocal('metadata');
await ensureNotFalsy(metadata).incrementalModify(docData => {
docData.selectedBndrPlnId = grpId;
return docData;
});
const data = await boundaryMgmtCol.findOne().exec(true);
const json = data.toJSON();
assert.deepStrictEqual(json.boundariesGrp[0], groups);
db.destroy();
});
it('local documents not persistent on db restart', async () => {
if (!config.storage.hasPersistence) {
return;
}
if (!isNode) {
return;
}
const dbName: string = randomCouchString(10);
const localDocId = 'foobar';
const localDocData = {
foo: 'bar'
};
const db = await createRxDatabase({
name: dbName,
storage: config.storage.getStorage(),
multiInstance: false,
localDocuments: true
});
const cols = await db.addCollections({
humans: {
schema: schemas.human,
localDocuments: true
}
});
await db.insertLocal(localDocId, localDocData);
await cols.humans.insertLocal(localDocId, localDocData);
await db.destroy();
const db2 = await createRxDatabase({
name: dbName,
storage: config.storage.getStorage(),
multiInstance: false,
localDocuments: true
});
const col2 = await db2.addCollections({
humans: {
schema: schemas.human,
localDocuments: true
}
});
const docDb = await db2.getLocal(localDocId);
const docCol = await col2.humans.getLocal(localDocId);
assert.ok(docDb);
assert.ok(docCol);
assert.strictEqual(docDb.get('foo'), 'bar');
assert.strictEqual(docCol.get('foo'), 'bar');
await db2.destroy();
});
it('doing many upsertLocal() can cause a 404 document not found', async () => {
if (!isNode) {
return;
}
const dbName: string = randomCouchString(10);
const db = await createRxDatabase({
name: dbName,
storage: config.storage.getStorage(),
multiInstance: false,
localDocuments: true
});
const key = 'foobar';
let doc = await db.getLocal(key);
doc = await db.insertLocal(key, {
foo: 'bar'
});
assert.ok(doc);
let t = 0;
while (t < 50) {
await db.upsertLocal(key, {
foo: randomString(10)
});
t++;
}
db.destroy();
});
});
});
``` |
Entouch was an American male Alternative R&B group, composed of Eric McCaine and Eric Smith, also known as Free. They were signed to Elektra Entertainment during the height of the new jack swing era. The duo's 1989 debut album was called All Nite and featured two singles, "II Hype" and "All Nite".
The single "II Hype", released in 1989, peaked at No 18 on the Billboard R&B chart.
In 1990, the single "All Nite" entered the U.S. Billboard Hot 100 peaked at No. 71 (R&B No. 7).
The group released a self-titled second album in 1991. Soon after, Entouch disbanded, and McCaine went on to work in music production with other artists such as Keith Sweat, Jadakiss, Eve, Mista, Swizz Beatz, Bone Thugs N Harmony, Kut Klose and Lorenzo.
Discography
All Nite (Released: June 19, 1989)
Entouch (Released: October 29, 1991)
Singles
"Too Hype" (1989)
"All Nite" (1990)
"Drop Dead Gorgeous" (1991)
References
External links
Entouch, Discogs.com
Elektra Records artists
New jack swing music groups |
Zvika, Tzvika or Tzvikah ():
Tzvika Brot (born 1980), Israeli mayor of Bat Yam in the 21st century
Zvika Greengold (born 1952), Israeli officer awarded the Medal of Valor and politician
Tzvika Cohen, former drummer of the Israeli rock band Mofa Ha'arnavot Shel Dr. Kasper
Zvika Hadar (born 1966), Israeli actor, comedian and television host
Zvika or Svika Pick (born 1949), Israeli pop singer and composer
Tzvika Tzemah, Israeli football manager in the 21st century
Zvika Frank (born 1948), a Dutch-Israeli dancer, movement educator, university lecturer, and dance-movement therapist
Hebrew masculine given names
Masculine given names
Informal personal names |
Barış is a neighbourhood of the town Ardeşen, Ardeşen District, Rize Province, northeastern Turkey. Its population is 555 (2021).
History
According to list of villages in Laz language book (2009), name of the neighbourhood is Metisti. Most inhabitants of the neighbourhood are ethnically Laz.
References
Populated places in Ardeşen District
Laz settlements in Turkey
Neighbourhoods in Rize Province |
Vanilla walkeriae is a species of vanilla orchid native to India and Sri Lanka. It grows in forest and jungle habitat. It is considered to be a rare species.
Description
This species is an epiphyte with thick, succulent, rooting stems up to 15 meters long that climbs on trees and shrubs. The lance-shaped leaves are up to 3.7 centimeters long. The inflorescence is a large raceme of many flowers. The flower can be up to 6.8 centimeters wide and has wavy-edged white petals. The fruit is a thin capsule up to 15 centimeters long.
The scientific name commemorates Anna Maria Walker of Sri Lanka with whom Robert Wight collaborated.
Uses
The plant is used in the traditional veterinary medicine practices of the Irulas in India. Stem paste is fed to cattle to treat fever and as a nutritional supplement.
Conservation
The species is threatened by commercial overexploitation and habitat destruction.
References
External links
Vanilla walkeriae illustration. Swiss Orchid Foundation.
walkeriae
Epiphytic orchids
Orchids of India
Orchids of Sri Lanka
Threatened flora of Asia |
Come My Fanatics… is the second studio album by English heavy metal band Electric Wizard. The album was released in January 1997 on Rise Above Records and was produced by Rolf Startin, Mike Hurst and band member Jus Oborn. It was the group's follow-up to their eponymous album Electric Wizard. Oborn described the release as a reaction to the music on the earlier album, which he had felt was not as heavy as he wanted the group to sound. The songs on Come My Fanatics… were described by Lee Dorrian, Rise Above Records owner, as breaking from the traditional doom metal style, with an unpolished and chaotic approach.
The thematic elements of the album draw from 1970s horror films, biker movies and the writings of H. P. Lovecraft; there are three songs about leaving Earth to avoid an impending environmental disaster. The album release was followed by a tour with the band Cathedral and positive reviews from heavy metal magazines Metal Hammer, Terrorizer and Kerrang!. Come My Fanatics… continued to receive praise in retrospective reviews, with Terrorizer declaring it "the wake-up that the UK doom scene needed" and Dorrian describing it as "the turning point of everything".
Production
Background
Prior to recording with Electric Wizard, lead singer Jus Oborn was mostly interested in the death metal genre. After listening to Black Sabbath under the influence of mushrooms, he was inspired to take his music in a different direction. At the time, Oborn was a member of a group called Eternal, who were drifting apart; Oborn said, "I had a vision of doing the doom stuff. The rest of the guys were just into Alice in Chains."
After forming in 1993, Electric Wizard recorded their self-titled debut album, which was released in 1996. AllMusic editor Eduardo Rivadavia described the album as "impressive" but considered Electric Wizards music to be "pretty standard doom fare for the time." Oborn was not happy with the recording of Electric Wizard, finding it lighter-sounding than they had wanted. He said, "We went to a big fancy studio and we were like, 'Oh no, we've gotta do as we're told". This led to the sound of their follow-up album, Come My Fanatics...; Oborn said, "it had to sound right this time". About the recording period, Oborn said, "Our country wasn't in a great state. And metal was totally fucked at that point. We were really making a musical statement. When you're younger everything is a reaction against the world."
Recording
Oborn found producer Rolf Startin, who shared the band's desire for rawness and feeling, listed in the Yellow Pages. Startin was prepared to build the studio around the band, supplying the band with vintage amplifiers. Come My Fanatics... was recorded at Red Dog Studios in July 1996. Oborn later described the album's production as "very technically inept", and said it was "very difficult to deliberately do things badly. It just happened. It was exactly the sound we were trying to create."
Some songs on the album contain samples from films such as "Return Trip", which contains a sample of the film Cannibal Ferox. The horror film samples came from video nasties passed under the table at the market stall in Wimborne in Dorset, where the members of the group lived. The song "Invixor B/Phase Inducer" is an instrumental track, with an introduction that came about by accident when the band experimented with a drum & bass sampler in the studio. Oborn said the group were "quite impressed, even though we didn’t like the music". He mentioned specific albums, such as Six Million Ways to Die "seemed quite brutal in the use of samples and that was something we thought we could bring to our music". The album's closing track, "Solarian 13" is also an instrumental track.
Music and themes
Rise Above Records owner Lee Dorian stated that the group's sound on the record "somehow managed to break the mould of traditional doom metal", noting that previous doom metal groups are "very morose and slow and heavy which can be very off-putting" while Electric Wizard had a guitar sound that had a "completely unpolished approach to the way they present themselves". Dan Franklin, writing for The Quietus, stated the group's style of music was "completely contrary to the surprisingly spiritual tendencies of Trouble and others", noting its "thick, chaotic and crushing sound". A 29 second sample of Electric Wizards's "Wizard in Black" featuring the groups use of sampling echoed these statements, noting that the album "somehow upped the sonic ante through a wall of sludge so thick that even the most experienced of metal heads couldn't help but be overwhelmed by its power". Dorian also found the album difficult on a first listen, stating:
The music on the album draws influences from 1970s horror films, biker movies and the works of H. P. Lovecraft. Oborn had read Lovecraft since his early teenage years and admired his work, particularly the idea "that art should be otherworldly and have this sense of fear and something beyond our understanding. I took that as more of an influence than literally talking about tentacle-headed monsters, which only crosses the surface level." Oborn also said Come My Fanatics... was conceived as a "piece of escapism", developed from an "insular, underground feeling that we were heading to our doom as a planet and no-one overground had a fucking clue about it". He stated that final three songs on the album, "Ivixor B / Phase Inducer", "Son of Nothing" and "Solarian 13", were a concept about leaving Earth because it was "so fucked up". He said the ethic was that the planet was heading towards an environmental disaster and:
Release
Come My Fanatics... was released in January 1997 by Rise Above Records. The album did not reach chart in the United Kingdom. The label's founder Lee Dorian had previously tried to promote doom metal music in the United Kingdom through compilation albums such as Dark Passages, featuring bands including Penance, Revelation and Mourn, to define a British scene. Dorian later said the release of Come My Fanatics... was "the turning point of everything". Terrorizer echoed these statements in 2012, calling the album "the wake-up that the UK doom scene needed and proved it wasn't just about frilly shirts and gothic morbidity".
Come My Fanatics... received several re-releases in 1999; Rise Above re-released it on 19 April 1999 with new artwork. The new cover depicts Anton LaVey and his disciples and is based on still from a 1971 television documentary called The Power Of The Witch. To create the cover, Oborn paused his videotaped copy of the documentary and traced the image from his television screen; he added the space background later. The Music Cartel distributed the album in the United States in 1999. Come My Fanatics... was released in Japan with the bonus track "Return to the Sun of Nothingness". Both Electric Wizard and Come My Fanatics... were re-packaged as a single release in 1999. In Finland, the album charted in 2011, charting at number 28 on the chart.
Touring and follow-up
After the initial 1997 release of the album, Electric Wizard toured the United Kingdom with Cathedral in February 1997, and in Europe with labelmates Mourn. This was planned to be followed with a tour supporting The Blood Divine in early April with Orange Goblin, which Electric Wizard later dropped out of.
Following the release of Come My Fanatics... the group released the EP Supercoven (1998). Their next studio album, Dopethrone, was not released until four years later. Oborn said of the hiatus, "I would safely say there was a period where we split up. We just didn't tell anybody."
Reception
On its release, Come My Fanatics... received positive reviews from heavy rock magazines Terrorizer, Kerrang! and Metal Hammer. Metal Hammer called the album "a right corker" while Terrorizer said, "this is out there in orbit with Hawkwind's 'Space Ritual', and that's a compliment in its own way. Wastoids they are, but the 'Wiz have made a great Stoner Doom record." Kerrang! stated Electric Wizard "have delivered one of the most punishingly heavy albums in recent memory", concluding that "Classic is the only word for it".
From retrospective articles and reviews, The Guardian said, "Oborn’s vision of creating the heaviest music imaginable was put firmly into practice for 1997’s still astonishing Come My Fanatics … , a record that was so devastatingly slow, heavy and obnoxious that it made everything else around it sound anaemic and pedestrian". AllMusic called it "absolutely colossal" and "essential doom", noting it was "somewhat less immediate than its predecessor ... even the most experienced of metal heads couldn't help but be overwhelmed by its power", and that tracks such as "Doom-Mantia" and "Son of Nothing" would "test the patience of uninitiated listeners before drifting into focus through billowing clouds of smoke, but the ultimate religious experience is well worth the lengthy conversion process". In an overview of the bands discography, Harry Sword of Noisey declared that Come My Fanatics... was when Electric Wizard "really hit home, its turgid doom imbued with sleazy cosmic reach and a blackened punkish energy." and that it "ushered in a new era for doom, engineering a full-on scuzz attack that felt cosmic in reach and was anchored by a very human rage." Metal Hammer included the album in their 2020 list of the top 10 1997 albums.
Oborn later stated that Come My Fanatics... is his favourite of the group's earlier material. He said, "I can’t honestly remember doing it, so it is like listening to another band and I do like that album a lot. I remember doing Dopethrone and it was particularly hard work and a miserable experience so I don't look at it fondly."
Track listing
All songs by Electric Wizard. Lyrics by Jus Oborn.
Personnel
Credits adapted from the liner notes
Jus Oborn – lead guitar, vocals, effects, producer, mixing
Tim Bagshaw – lead bass, effects
Mark Greening – drums, concussion
Rolf Startia – producer, mixing
Mike Hurst – producer, mixing
See also
1997 in music
1997 in British music
1997 in heavy metal music
References
1997 albums
Electric Wizard albums
Rise Above Records albums |
Atech Grand Prix was a British motor racing team.
It was formed in 2007 as Hitech Junior Team by David Hayle, who had sold his successful British Formula 3 team Hitech Racing to Austrian businessman Walter Grubmuller, Sr.
It was renamed Atech Grand Prix at the end of 2009.
The team ran Nick Yelloly, Marlon Stockinger and Tamás Pál Kiss in the 2010 Formula Renault UK Championship, with Pál Kiss challenging for the title until the final round.
2011 saw them run under the Atech Reid GP banner in the 2011 Formula Renault 2.0 UK Championship, after a new collaboration with Reid Motorsport. Former British Formula Ford Championship driver Tio Ellinas raced for them.
In 2013, they were purchased by Bamboo Engineering.
Results
GP3
In detail
(key) (Races in bold indicate pole position) (Races in italics indicate fastest lap)
References
External links
Auto racing teams in the United Kingdom
Auto racing teams established in 2007
2007 establishments in the United Kingdom
GP3 Series teams
Formula Renault Eurocup teams
Superleague Formula teams
International Formula Masters teams
British Formula Renault teams
Auto racing teams disestablished in 2013 |
```c++
/*
All rights reserved. Use is subject to license terms.
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 <NdbApi.hpp>
#include <NdbOut.hpp>
#include <NdbMutex.h>
#include "VerifyNdbApi.hpp"
NdbMutex* g_pNdbMutexVerify = 0;
void VerifyBegin(void)
{
if(!g_pNdbMutexVerify)
{
g_pNdbMutexVerify = NdbMutex_Create();
}
NdbMutex_Lock(g_pNdbMutexVerify);
}
void VerifyEnd(void)
{
NdbMutex_Unlock(g_pNdbMutexVerify);
}
void CVerifyNdbSchemaOp::VerifyIntError(const int i, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbSchemaOp::" << szMethod << " returned " << dec << i;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdbSchemaCon::VerifyIntError(const int i, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbSchemaCon::" << szMethod << " returned " << dec << i;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdbSchemaCon::VerifyPtrError(void* p, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbSchemaCon::" << szMethod << " returned " << hex << (Uint32)p;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdbRecAttr::VerifyValueError(const int iNull, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbRecAttr::" << szMethod << " : isNULL() returned " << dec << iNull;
ndbout << endl;
VerifyEnd();
}
void CVerifyNdbOperation::VerifyIntError(const int i, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbOperation::" << szMethod << " returned " << dec << i;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdbOperation::VerifyPtrError(void* p, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbOperation::" << szMethod << " returned " << hex << (Uint32)p;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdbIndexOperation::VerifyIntError(const int i, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbIndexOperation::" << szMethod << " returned " << dec << i;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdbIndexOperation::VerifyPtrError(void* p, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbIndexOperation::" << szMethod << " returned " << hex << (Uint32)p;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdbConnection::VerifyIntError(const int i, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbConnection::" << szMethod << " returned " << dec << i;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdbConnection::VerifyPtrError(void* p, const char* szMethod)
{
VerifyBegin();
ndbout << "NdbConnection::" << szMethod << " returned " << hex << (Uint32)p;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdb::VerifyPtrError(void* p, const char* szMethod)
{
VerifyBegin();
ndbout << "Ndb::" << szMethod << " returned " << hex << (Uint32)p;
ndbout << " : " << dec << getNdbError().code << " : " << getNdbError().message << endl;
VerifyEnd();
}
void CVerifyNdb::VerifyVoidError(const int iCode, const char* szMethod)
{
VerifyBegin();
ndbout << "Ndb::" << szMethod << " : getNdbError().code returned " << dec << iCode;
ndbout << " : " << getNdbError().message << endl;
VerifyEnd();
}
``` |
The Glastonbury thorn is a form of common hawthorn, Crataegus monogyna 'Biflora' (sometimes incorrectly called Crataegus oxyacantha var. praecox), found in and around Glastonbury, Somerset, England. Unlike ordinary hawthorn trees, it flowers twice a year (hence the name "biflora"), the first time in winter and the second time in spring. The trees in the Glastonbury area have been propagated by grafting since ancient times. The tree is also widely called the holy thorn, though this term strictly speaking refers to the original (legendary) tree.
It is associated with legends about Joseph of Arimathea and the arrival of Christianity in Britain, and has appeared in written texts since the medieval period. A flowering sprig is sent to the British Monarch every Christmas. The original tree has been propagated several times, with one tree growing at Glastonbury Abbey and another in the churchyard of the Church of St John. The "original" Glastonbury thorn was cut down and burned as a relic of superstition during the English Civil War, and one planted on Wearyall Hill in 1951 to replace it had its branches cut off in 2010.
History
According to legend, Joseph of Arimathea visited Glastonbury with the Holy Grail and thrust his staff into Wearyall Hill, which then grew into the original thorn tree. Early writers do not connect Joseph to the arrival of Christianity in Britain, and the first literary source to place him in Britain appeared in the thirteenth century. The historicity of Joseph's presence in Glastonbury remains controversial, but the thorn is first mentioned in a pamphlet published by Richard Pynson in 1520 called Lyfe of Joseph of Armathie, which was almost certainly commissioned by Glastonbury Abbey. In this account, the miraculous winter-flowering Thorn is paired with an equally remarkable walnut tree that grew in the Abbey grounds and was said to flower on Midsummer's Day. Both were seen as marks of divine favour, proof that Glastonbury was 'the holyest erth of Englande'.
The Thorn kept Glastonbury's legendary history alive during the centuries between the dissolution and the town's renaissance as a spiritual centre in the twentieth century. The abbey was dissolved in 1539 and substantially demolished during the reign of Elizabeth I, but the Thorn continued to flower at Christmas and many Catholics saw this as "a Testimony to Religion, that it might flourish in persecution".
The Thorn's symbolic fortunes revived when the Stuart dynasty came to power in 1603. James I and Charles I took a much more relaxed view of Catholicism than Queen Elizabeth had done, and both were intrigued by its Christmas-flowering properties. James Montague, Bishop of Bath and Wells from 1608 to 1616, produced a 'Panegiricall entertainement' for Anne of Denmark, King James I's consort, in which the character of Joseph of Arimathea presented the Queen with boughs from both the Thorn and the Walnut, in memory of 'ruinated Glastonbury'. Royal interest in the Thorn, however, made it a very suspect symbol to the growing number of Puritans who saw Christmas as a Catholic survival, and some feared that the Stuarts were intending to restore the Catholic faith. The Puritan cause was strong in Somerset, and when civil war broke out the royal reaction was particularly severe. The Thorn was chopped down by a zealous Parliamentary soldier, probably in 1647.
Although destroyed, the Thorn retained some symbolic resonance for the royalist underground during the years of the Commonwealth, both in England and in the exiled Stuart court. It features in Wenceslaus Hollar's celebrated engraving of Glastonbury, commissioned for Sir William Dugdale's controversial survey of England's ruined monasteries, Monasticon Anglicanum, published in 1655. The restoration of Charles II in 1660 was marked with a lot of spring-like floral imagery, and it may be no coincidence that the most famous of the Thorn legends is first recorded in 1662. According to this, Joseph of Arimathea arrived on Wearyall Hill with his followers on Christmas Day; 'we are weary all', he announced, and planted his staff in the ground, which thereupon burst into flower. This story draws on a fairly common biblical theme in which saintly staves miraculously burst into flower as a sign of divine favour.
This legend, like that of Joseph's arrival itself, fell foul both of regime change (the Stuart dynasty was replaced in 1689) and by the new scholarship of the Age of Reason. Both Joseph and the Thorn were relegated to the status of popular folklore, where, however, they flourished. An anonymous chapbook called The History of that Holy Disciple Joseph of Arimathea went through at least 34 editions during the eighteenth century, and although the texts often differ the chapbook always ends with a description of the Thorn, "a most miraculous Curiosity", which attracted "Thousands of People, of different Opinions" to Glastonbury every year.
At the time of the adoption of the revised Gregorian calendar in Britain in 1752, the Gentleman's Magazine reported that curious visitors went to see whether the Glastonbury thorn kept to the Julian calendar or the new one:
Interest in the Thorn amongst 'respectable' society revived during the Victorian era. Renewed interest in Christmas, coupled with a greater sense of moral responsibility, part of the romantic backlash against the perceived soul-lessness of industrialism and urbanisation. New legends began to appear at the end of the nineteenth century, amid new curiosity and speculation about the inhabitants and customs of prehistoric Britain. Some suggested that the Thorn may have been the 'Sacred Tree' of the British Isles in pre-Christian times, and in the twentieth century its legends helped to anchor the mythologies of the New Age.
Royal tradition
Every Christmas, the Vicar and the Mayor of Glastonbury sent a budded branch of the Glastonbury thorn to The Queen. Christmas cuttings are known to have been sent to both Charles I and Charles II, but the modern tradition dates from 1929, when the Vicar of Glastonbury, Lionel Smithett Lewis, sent one to Queen Mary and King George V. The event has become a major feature in the town calendar. The thorn also featured on British postage stamps on the 12p and 13p Christmas stamps in 1986.
2010 deliberate damage
The Glastonbury thorn was once again attacked and its branches cut off, in this case the 1951 specimen that was growing on Wearyall Hill on the southwestern side of the town, on 9 December 2010.
In March 2011, it was reported that a new shoot had appeared on the damaged tree. However, as these new shoots came up they would suspiciously disappear a few days or weeks later.
2012 replanting and further damage
On 1 April 2012 a sapling grafted from a descendant of the pre-1951 specimen was planted by the landowners working with Glastonbury Conservation Society and consecrated, but it was snapped in half and irreparably damaged 16 days later.
2019 removal
In May 2019 the tree was entirely removed by the land owner.
Propagation
Many have tried to grow the Glastonbury thorn from seed and direct cuttings, but in the later part of the 20th century all attempts reverted to the normal hawthorn type, flowering only in spring.
This tree has been widely propagated by grafting or cuttings, with the cultivar name 'Biflora' or 'Praecox'. An early antiquarian account by Mr Eyston was given in Hearne's History and Antiquities of Glastonbury, 1722 : "There is a person about Glastonbury who has a nursery of them, who, Mr. Paschal tells us he is informed, sells them for a crown a piece, or as he can get."
The tree in the grounds of the church was pronounced dead in June 1991, and cut down the following February. However, many cuttings were taken from it before its destruction. The pre-1991 thorn in the grounds of Glastonbury Church is said to be a cutting from the original plant which was planted in secret after the original was destroyed. Now only trees budded or grafted from the original exist, and these blossom twice a year, in May and at Christmas. The blossoms of the Christmas shoots are usually much smaller than the May ones and do not produce any haws. Plants grown from the haws do not retain the characteristics of the parent stem.
The present "sacred thorn tree" at the Church of St John was grown from a local cutting, like many others in the neighbourhood of Glastonbury. The large tree had been in the churchyard for eighty years. It was planted by Mr George Chislett, then head gardener of Glastonbury Abbey. He also learned how to graft holy thorn cuttings onto the root of blackthorn stock, and so preserve the "miraculous" Christmas blossoming characteristic. His son, Wilf, sent Glastonbury thorn cuttings all over the world, including to Washington, Canada, New Zealand and Australia.
Trees survive from earlier grafts to perpetuate the Glastonbury legend, among them two other holy thorns in the grounds of St John's. The blossom sent to the Queen now comes from one of these. At the end of term, the pupils of St John's Infants School gather round the tree in St John's parish churchyard on the High Street. They sing carols, including one specially written for the occasion, and the oldest pupil has the privilege of cutting the branch of the Glastonbury thorn that is then taken to London and presented to Her Majesty The Queen.
In 1965, the Queen erected a wooden cross at Glastonbury with the following inscription:
"The cross, the symbol of our faith, the gift of Queen Elizabeth II, marks a Christian sanctuary so ancient that only legend can record its origin."
See also
The Oaks of Avalon, a pair of nearby ancient oak trees with druidic connections
References
External links
BBC article
Tourist attractions in Somerset
Somerset Levels
monogyna Biflora
Trees in mythology
Trees in religion
Somerset folklore
Glastonbury
Individual trees in England
Joseph of Arimathea |
Alex Hamill may refer to:
Alex Hamill (footballer, born 1961), Scottish footballer
Alex Hamill (footballer, born 1912), Scottish footballer |
Peter Joseph Lenné (the Younger) (29 September 1789 – 23 January 1866) was a Prussian gardener and landscape architect. As director general of the Royal Prussian palaces and parks in Potsdam and Berlin, his work shaped the development of 19th-century German garden design in the Neoclassical style. Laid out according to the principles of the English landscape garden, his parks are now World Heritage Sites.
Life and works
Lenné was born in Bonn, then part of the Electorate of Cologne, the son of the court and university gardener Peter Joseph Lenné the Elder (1756–1821), and his wife, Anna Catharina Potgieter (also Potgeter), daughter of the mayor of Rheinberg. The Lenné family descended from the Prince-Bishopric of Liège. Circa 1665, Peter Joseph's ancestor Augustin Le Neu had settled in Poppelsdorf near Bonn as court gardener of Archbishop-Elector Maximilian Henry of Bavaria.
Childhood and development
Having obtained his Abitur degree, Peter Joseph Lenné decided to adopt the family tradition. He began his apprenticeship as a gardener in 1808 with his uncle, Josef Clemens Weyhe, court gardener at the electoral Augustusburg and Falkenlust Palaces, Brühl. At the instigation of his father, he also took university courses in botany.
From 1809 to 1812, his father paid for Lenné's many study trips to France, Switzerland, and Southern Germany. In 1811, he completed a long internship in Paris with Gabriel Thouin, who was then one of the most famous garden architects in Europe. This made him a master landscaper. On another of these trips, Lenné made the acquaintance of the creator of the English Garden in Munich, the landscape gardener Friedrich Ludwig von Sckell, who would have a lasting influence on Lenné's work.
Assistant gardener
In 1812, Lenné followed his father to Koblenz, where he had been named Director of the Gardens by the Prefect Jules Doazan. Later in that year, Lenné became active at Schloss Schönbrunn, where he would remain until 1814. He then returned to Koblenz, where he was given private garden commissions until 1815. Extensions to the city's fortifications gave him an opportunity to propose a plan for its beautification by the addition of gardens; however, this was not carried out because of lack of funds. In 1816, he returned to Potsdam at the suggestion of Prussian forestry official Georg Ludwig Hartig and General Graf von Hacke. There he received the position of Assistant Gardener to the Court Garden Director at Sanssouci.
While still working as an assistant gardener, in spring 1816 Lenné received a commission from the Prussian Chancellor Karl August von Hardenberg to renovate the grounds around his country house at Klein-Glienicke. This work on Glienicke Palace, which would later become Prince Carl of Prussia's residence, laid the groundwork for Lenné's designs for the surrounding area of Potsdam, which he wanted to turn into a Gesamtkunstwerk. The upgrades of the Glienicke grounds were followed - in close cooperation with the architects Karl Friedrich Schinkel, Ludwig Persius, and Ferdinand von Arnim - by those of others such as the Böttcherberg and facing it Babelsberg Park, which was completed by Prince Hermann von Pückler-Muskau. Characteristic of Lenné's work are versatile sight axes - a horticultural stylistical device - which he applied at Sanssouci Park and elsewhere. As part of the Berlin-Potsdam cultural landscape, which stretches from the Pfaueninsel to Werder, many sites of Lenné's work are World Heritage Sites and have been under the protection of UNESCO collectively since 1990.
Prussian Garden Director-General
The accomplishments of the garden architect are reflected in his career progression. In 1818 he was an employee of the Royal Garden Authority, and in 1822, he received a promotion to Gardening Director. That same year, Lenné became a founding member of the Prussian Society for the Promotion of Horticulture. Lenné also accepted the position of Manager of the Division of Orchard Cultivation and later of the Parks Division.
In 1823, the Gardener Academy in Schöneberg and Potsdam was founded under his management. Here garden architecture was taught in a scientific manner for the first time. In 1828, Lenné was named the sole Garden Director and in 1845, Prussian Garden Director-General. The Prussian Academy of Arts made Lenné an honorary member.
In 1840, the recently enthroned King Friedrich Wilhelm IV assigned the urban planning of Berlin to Lenné. One of his most important achievements in this role survives in the building of the Luisenstadt Canal, constructed in 1852, between the Landwehrkanal and the River Spree in Kreuzberg. The canal's design was based on plans by Chief Building Officer Johann Carl Ludwig Schmid. In the 1850s, he advised on the planning of several cities, including Dresden, Leipzig and Munich.
Despite centering his life around Potsdam and Berlin, Lenné remained attached to his Rhenish homeland and contributed to the further beautification of Koblenz, particularly in the Rheinanlagen, which was under his management until 1861. His love of his work on the Rhine and Mosel made him decide to build the residence named for him, the Lenné-Haus, in which he wished to spend the evening of his life; however, the manner of his death did not allow this. Lenné's last resting place is at the Bornstedt Cemetery in Potsdam.
Busts of Peter Joseph Lenné are located at the Bonn Botanical Garden, on the bank of the Rhine (Alter Zoll), in the Landschaftspark Petzow that he himself designed, in Feldafing Park, in Park Sanssouci, and in the Kaiserin-Augusta-Anlagen in Koblenz (copy of a bust by Rauch). A recent bust was finished by Bad Homburg sculptor Otto Weber-Hartl.
Main works
Park of Neuhardenberg Palace
Roseninsel and Lenné Park in Feldafing at Lake Starnberg
Klosterbergegarten in Magdeburg
Zwierzyniec Park, Złotów
Park Sanssouci in Potsdam
Garden of Caputh Palace at Potsdam
Landscape park at Petzow Palace, Werder
Park Glienicke, Berlin
Design for the landscape park in Blumberg (now part of Ahrensfelde)
Design for the Landwehrkanal
Design for the Luisenstädtischer Kanal, Berlin
Design for the Tiergarten, Berlin
Design for the parks at Blankensee Palace, in Trebbin
Design for the Spa Gardens at Bad Homburg
Gardens of Schloss Liebenberg in the Löwenberger Land, described in Fontane's Fünf Schlösser (Volume 5 of Wanderungen durch die Mark Brandenburg)
Park of Remplin Palace
Park of Wolfshagen Palace
Park of Schloss Trebnitz (at Müncheberg)
Lenné Park in Frankfurt (Oder)
Kaiserin-Augusta-Anlagen on the Rhine and Electoral Palace Park in Koblenz
Elisengarten, City Park and Spa Gardens in Aachen
Park and Zehnthof in Sinzig
Gardens of Friedrichsfelde Palace, now Tierpark Friedrichsfelde, in Berlin
Clifftop gardens at Stolzenfels Castle, Koblenz
Schlosspark, Brühl
Design for the Spa Gardens at Bad Oeynhausen
Park of Fürstlich Drehna, in Luckau (collaboration)
Schillerpark (also called Lenné-Anlage, southeastern part of Promenadenring), and Johannapark, Leipzig
Parts of Bürgerwiese gardens in Dresden
Dresden Zoo
References
Specific
General
The information in this article is based on a translation of its German counterpart.
Gerhard Hinz, P.J.L. Das Gesamtwerk des Gartenarchitekten und Städteplaners, 2 volumes, 1989, Hildesheim, Zürich, New York
Petra Wißner, Magdeburger Biographisches Lexikon, 2002,
F. v. Butlar (Ed.), Peter Joseph Lenné: Volkspark und Arkadien, 1989, Berlin
Harri Günther, Peter Joseph Lenné: Gärten, Parke, Landschaften, 1985, Berlin
Gerhard Fischer: Er prägte das Gesicht Berlins, in: Berlinische Monatsschrift, Edition Luisenstadt, 1999
External links
1789 births
1866 deaths
People from Bonn
Architects from Berlin
German landscape architects |
```xml
/*!
*/
import type { User } from '@nextcloud/cypress'
import { createShare } from './FilesSharingUtils.ts'
import { getRowForFile } from '../files/FilesUtils.ts'
describe('files_sharing: Files view', { testIsolation: true }, () => {
let user: User
let sharee: User
beforeEach(() => {
cy.createRandomUser().then(($user) => {
user = $user
})
cy.createRandomUser().then(($user) => {
sharee = $user
})
})
/**
* Regression test of path_to_url
*/
it('opens a shared folder when clicking on it', () => {
cy.mkdir(user, '/folder')
cy.uploadContent(user, new Blob([]), 'text/plain', '/folder/file')
cy.login(user)
cy.visit('/apps/files')
// share the folder
createShare('folder', sharee.userId, { read: true, download: true })
// visit the own shares
cy.visit('/apps/files/sharingout')
// see the shared folder
getRowForFile('folder').should('be.visible')
// click on the folder should open it in files
getRowForFile('folder').findByRole('button', { name: /open in files/i }).click()
// See the URL has changed
cy.url().should('match', /apps\/files\/files\/.+dir=\/folder/)
// Content of the shared folder
getRowForFile('file').should('be.visible')
cy.logout()
// Now for the sharee
cy.login(sharee)
// visit shared files view
cy.visit('/apps/files/sharingin')
// see the shared folder
getRowForFile('folder').should('be.visible')
// click on the folder should open it in files
getRowForFile('folder').findByRole('button', { name: /open in files/i }).click()
// See the URL has changed
cy.url().should('match', /apps\/files\/files\/.+dir=\/folder/)
// Content of the shared folder
getRowForFile('file').should('be.visible')
})
})
``` |
Flip or Flop Nashville is a television series that aired on HGTV hosted by real estate agents DeRon Jenkins and Page Turner. It is a spin-off of the HGTV series Flip or Flop. It premiered on January 18, 2018 and is set in Nashville, Tennessee.
Premise
On March 1, 2017, HGTV announced "Flip or Flop" will expand to Nashville, Tennessee. The show featured a new couple, DeRon Jenkins and Page Turner, flipping houses in Nashville, Tennessee. DeRon Jenkins and Page Turner had the same roles as Tarek and Christina in this show.
Hosts
DeRon Jenkins is a licensed contractor and Page Turner is a seasoned real estate agent. They find the worst properties in Nashville and transform them into stylish and functional family homes. During the opening of the show they introduce themselves as exes and say that although they didn't ‘work together’ (as a married couple), they still work together.
Episodes
Season 1
Season 2
References
External links
Episode Guide
Flip or Flop (franchise)
2018 American television series debuts
2019 American television series endings
2010s American reality television series
Television shows set in Tennessee
Nashville, Tennessee
American television spin-offs
Reality television spin-offs |
Aşağıincesu is a neighbourhood in the municipality and district of Karayazı, Erzurum Province in Turkey. Its population is 526 (2022).
References
Neighbourhoods in Karayazı District |
Bull Head Lodge and Studio, located off Going-to-the-Sun Road near Apgar in Flathead County, Montana was listed on the National Register of Historic Places in 1984.
The lodge and studio are two contributing log buildings at the southern end of Lake McDonald in Glacier National Park.
The cabin named Bull Head Lodge was built in 1905 or 1906, on land purchased by Russell from Dimon Apgar. The property was a private inholding within the Glacier National Park when it was formed in 1910. It was Charles M. Russell's summer home, where he hosted artist friends to paint and sketch landscapes and scenery of the park. Russell composed a number of gnomic sculptures using found objects such as wood and moss from the park.
See also
Charles M. Russell House and Studio: winter home also on the NRHP
References
National Register of Historic Places in Flathead County, Montana
National Register of Historic Places in Glacier National Park
Log buildings and structures on the National Register of Historic Places in Montana
Log cabins in the United States
Artists' studios in the United States
1900s establishments in Montana
Buildings and structures completed in the 1900s
Charles Marion Russell |
Mossy Creek is an unincorporated community in Augusta County, Virginia, United States. Mossy Creek is located on Virginia State Route 42 west-southwest of Bridgewater. The Hannah Miller House and the Henry Miller House, which are listed on the National Register of Historic Places, are both located near Mossy Creek.
References
Unincorporated communities in Augusta County, Virginia
Unincorporated communities in Virginia |
Chuckatuck is a neighborhood of the independent city of Suffolk, Virginia, United States. It is located at the junction of State Route 10/State Route 32 and State Route 125, just south of SR 10/32's crossing of Chuckatuck Creek. Its elevation is 36 feet above mean sea level. The neighborhood is relatively small and consists of such businesses as a garden store, general store, automobile repair shop, three churches, two gas stations, a restaurant, a hardware store, and others. It has a fire department, Suffolk station nine, which is operated as the Chuckatuck Volunteer Fire Department. The community is also located near Lone Star Lakes, a recreational park.
Former Virginia Governor Mills Godwin and jazz guitarist Charlie Byrd grew up in Chuckatuck.
See also
Suffolk, Virginia
Political subdivisions of Virginia#Boroughs
References
Chuckatuck, VA Community Profile
Boroughs of Suffolk, Virginia
Suffolk, Virginia communities
Neighborhoods in Virginia |
Kenneth Agyei Kuranchie (born in Tepa, Ashanti Region on 5 August 1969) is a Ghanaian journalist and former board member of the National Media Commission. He is known publicly as a member of the New Patriotic Party (NPP) of Ghana. He started off as a block moulder, worked with the then P&P Newspaper as a stringer, becoming an editor for the Chronicles and later setting up the Daily Searchlight newspaper
In 2013, Kuranchie was convicted of criminal contempt and sentenced to 10 days imprisonment by the Supreme Court.
Early life
Kuranchie was born on 5 August 1969 in Tepa, Ashanti Region. He studied at St. Mary's International School in Sunyani, Brong-Ahafo Region, Opoku Ware Secondary School, the University of Ghana and Mountcrest University in Accra for his LLB.
Career
He started practicing journalism at the P&P entertainment newspaper, and subsequently at Guide newspaper (now known as Daily Guide). He also worked at The Ghanaian Chronicle. He then set up his own paper, The Daily Searchlight.
In 2013, Kuranchie was convicted of criminal contempt for a publication in his newspaper Daily Searchlight and not showing remorse, and sentenced to 10 days imprisonment by the Supreme Court.
He is an author of several books including 'Principles of Applied and Practical Journalism (2019), as well as the children's books "Journey to Ada", "The Rabbit, The Sparrow and The Lizard", "In Search of Vengeance" and "The Story of Fate".
"Journey to Ada", and "The Rabbit, The Sparrow and The Lizard" have been accredited by Ghana's Commission for Curriculum and Assessment (NACCA) as supplementary readers for primary schools in Ghana.
Kenneth Agyei Kuranchie owns an NGO and a clothing factory.
Politics
In June 2020 Kuranchie contested in the Parliamentary Primaries of the New Patriotic Party to represent the Okaikoi North Constituency in Ghana's parliamentary elections but lost to Fuseini Issah the incumbent member of parliament at the time.
In June 2023, he filed a suit against Former President John Dramani Mahama, the presidential candidate of the opposition National Democratic Congress (NDC.) on the basis that he (Mahama) is not qualified to contest in the 2024 elections. Mr Kuranchie said he wanted the Supreme Court to agree that the presidential term was four years and that once a president was out of office, he was still an employee of the state.
Personal life
Kuranchie is peacefully married with four children.
References
Ghanaian journalists
Living people
New Patriotic Party politicians
People from Ashanti Region
1969 births
University of Ghana alumni
21st-century Ghanaian politicians |
Religion in New Zealand encompasses a wide range of groups and beliefs. New Zealand has no state religion or established church and freedom of religion has been protected since the signing of the Treaty of Waitangi.
Almost half (48.6 per cent) of New Zealanders stated they had no religion in the 2018 census and 6.7 per cent made no declaration. Christianity remains the most popular religion; 37.3 per cent of the population at the 2018 census identified as Christian, with Anglicanism being the largest religious affiliation, just ahead of "Christian not further defined" and Roman Catholic.
Overview
Before European colonisation the religion of the indigenous Māori population was polytheistic and animistic. Efforts of Christian missionaries and their churches resulted in most Māori converting to Christianity. Māori transformed their moral, religious and political lives, making Christianity their own. In the 1840s, it's likely that a larger proportion of Māori regularly attended church services than people did in the United Kingdom.
The majority of 19th-century European immigrants came from the British Isles, establishing the three dominant British Christian denominations in New Zealand: Anglicanism, Catholicism and Presbyterianism. The tendency for Scottish immigrants to settle in Otago and Southland saw Presbyterianism predominate in these regions while Anglicanism predominated elsewhere; the effect of this is still seen in religious affiliation statistics today (see the map below). The arrival of other groups of immigrants did little to change Christianity being the major religion: Pacific Islanders and other primarily Christian ethnic groups dominated immigration until the 1970s.
Immigration since 1991 has led to slight yet steady growth in the number of adherents of south and south-east Asian religions such as Hinduism, Buddhism and Sikhism, particularly in Auckland. The number and proportion of people affiliating with non-Christian religions has increased to around six per cent of the population. Hinduism the second-most popular religion with 2.7 per cent of the population. Sikhism is the fastest-growing faith.
Demographics
Religious affiliation
New Zealand censuses have collected data on religious affiliation since 1851. Statistics New Zealand (the state agency that collects statistics on religion and other demographics) state that:
One complication in interpreting religious affiliation data in New Zealand is the large proportion who object to answering the question – roughly 313,000 respondents in 2018. Most reporting of percentages is based on the total number of responses, rather than the total population.
In the early 20th century New Zealand census data indicates that the vast majority of New Zealanders affiliated with Christianity. The total percentages in the 1921 non-Māori census were: 45% Anglicans, 19.9% Presbyterians, 13.6% Catholics, 9.5% Methodists and 11.2% Others. Statistics for Māori in particular became available only from 1936, with 35.8% Anglicans, 19.9% Rātana, 13.9% Catholics, 7.2% Ringatū, 7.1% Methodists, 6.5% Latter-day Saints, 1.3% Methodists and 8.3% Others recorded at this census.
Religious affiliation statistics
The table below is based on religious affiliation data recorded at the last four censuses for usually resident people. Figures and percentages may not add to 100 per cent as it is possible for people to state more than one religion. The trend indicators are based on the change in percentage of the population, not the number of adherents.
The 2018 census had an unusually low (83%) response rate. Statistics New Zealand subsequently calculated the 2018 census statistics based on the combination of 2018 census responses (82.9%), 2013 census responses (8.2%) and imputation (8.8%). The reported results are deemed to be high quality, but are not completely reliable.
Significant trends
Christianity – historically the largest religious group – is declining, while stating no religion and affiliation to other (minority) religions is increasing. Statistics New Zealand report that about 80% of the largest non-Christian religious groups are composed of immigrants, almost half of whom have arrived in New Zealand since 2000. The exceptions to this are traditional Māori religion, Judaism (24% immigrant) and Bahá'í (20% immigrant). Mirroring contemporary trends in immigration to New Zealand, immigrant religions increased fastest between the 2006 and 2013 censuses; Sikh by 102% to 19,191, Hindu by 39% to 89,319, Islam by 28% to 46,149, and Buddhist by 11% to 58,404. Hinduism emerged as the second-largest religious group in New Zealand after Christianity in the 2006 census. Of the major ethnic groups in New Zealand, people belonging to European and Māori ethnicities were the most likely to be irreligious, with 46.9 per cent and 46.3 per cent stating so in the 2013 census. Those belonging to Pacific and Middle Eastern/Latin American/African were least likely to be irreligious at 17.5 per cent and 17.0 per cent respectively.
In May 2018, McCrindle published The Faith and Belief in New Zealand Report. The report was commissioned by the Wilberforce Foundation. The results showed that more than half of New Zealanders (55%) do not identify with any main religion, indicating that New Zealand is a largely secular nation. The related infographic showed that, of the 33% who identified with Christianity, 16% were church-goers (attending at least monthly) and 9% were "Active Practisers" (described as "extremely involved").
Regional trends
Immigration and settlement trends have led to religious differences between the various regions of New Zealand. The 19th-century settlement of Scottish immigrants in Otago (originally under the auspices of the Free Church of Scotland in 1848) and Southland continues to influence the dominance of Presbyterianism in the south of the South Island. The English mainly settled in the North Island and Upper South Island, hence the dominance of Anglicanism in these areas (especially Canterbury, where the Church of England sponsored the 1850 settlement through the Canterbury Association).
Subsequent migration trends have led to clusters of distinct religious practice. Catholics of Polish origin (many connected with the re-settlements from Siberia in 1944) have a presence (for example) in the Wellington region.
Filipinos have become a noticeable element in the Roman Catholic communities of Southland.
In the 2013 census, two of New Zealand's sixteen regions had a Christian majority: Southland (51.9 per cent) and Hawke's Bay (50.5 per cent), and two regions had a non-religious majority: Tasman (51.4 per cent) and Nelson (51.0 per cent).
Jedi census phenomenon
Encouraged by an informal email campaign prior to the 2001 census, over 53,000 people listed themselves as Jedi (over 1.5% of responses). If the Jedi response had been accepted as valid it would have then been the second-largest religion in New Zealand, behind Christianity. However, Statistics New Zealand treated Jedi responses as "Answer understood, but will not be counted". In the next census, in 2006, the number of reported Jedis decreased to 20,000.
Religions
Christianity
The first Christian service conducted in New Zealand waters was likely to have been Catholic liturgies celebrated by Father Paul-Antoine Léonard de Villefeix, the Dominican chaplain of the ship Saint Jean Baptiste commanded by the French navigator and explorer Jean-François-Marie de Surville. Villefeix was the first Christian clergyman to set foot in New Zealand, and probably said Mass on board the ship near Whatuwhiwhi in Doubtless Bay on Christmas Day 1769. He is reported to have also led prayers for the sick the previous day and to have conducted Christian burials.
The Reverend Samuel Marsden of the Anglican Church Missionary Society (then chaplain in New South Wales) conducted the first Christian service on New Zealand land on Christmas Day in 1814, at Oihi Bay, a small cove in Rangihoua Bay in the Bay of Islands, at the invitation of chiefs Te Pahi and Ruatara, considered to have been the first preaching of the gospel in New Zealand.
The CMS sent missionaries to settle in New Zealand, and founded its first mission at Rangihoua Bay in the 1814 and over the next decade established farms and schools in the area. In June 1823 Wesleydale, the first Wesleyan Methodist mission in New Zealand, was established at Kaeo, near Whangaroa Harbour.
Church Missionary Society printer/missionary, William Colenso's 1837 Māori New Testament was the first indigenous-language translation of the Bible published in the southern hemisphere. Demand for the Māori New Testament, and for the Prayer Book that followed, grew exponentially, as did Christian Māori leadership and public Christian services, with 33,000 Māori soon attending regularly. Literacy and understanding the Bible increased and social and economic benefits, decreased the practices of slavery and intertribal violence, and increased peace and respect for all people in Māori society, including women.
Jean Baptiste Pompallier was the first Catholic bishop to come to New Zealand, arriving in 1838. With a number of Marist Brothers, Pompallier organised the Catholic Church throughout the country.
Though in England the Anglican Church was an established state church, by the middle of the 19th century even the Anglicans themselves sometimes doubted this arrangement, while the other major denominations of the new colony (Presbyterians, Methodist and Catholics, for example) obviously preferred that the local situation allowed for all their groups. George Augustus Selwyn became the first Anglican Bishop of New Zealand in 1841. In 1892 the New Zealand Church Missionary Society (NZCMS) formed in a Nelson church hall and the first New Zealand missionaries were sent overseas soon after.
Waves of new immigrants brought their particular (usually Christian) faiths with them. Initial denominational distribution very much reflected the fact that local immigrant communities started small and often came from comparatively small regions in the origin countries in Great Britain. As a result, by the time of the 1921 census, no uniform distribution existed amongst non-Māori Christians, with Presbyterians as the dominant group in Otago and Southland; Anglicans in the Far North, the East Cape and various other areas including Banks Peninsula; while Methodists flourished mainly in Taranaki and the Manawatū; and Catholicism was the dominant religion on the West Coast with its many mining concerns, and in Central Otago. The Catholic Church, while not particularly dominant in terms of proportional numbers, became more prominent throughout the country in the early and middle 20th century through establishing many schools in that period.
Beginning in the mid-1960s church membership and attendance started declining in percentage terms, mostly due to people declaring themselves as having no religion as well as dur to growth of non-Christian religions. The five largest Christian denominations in 2001 remained the largest in 2006. But, despite fairly strong historical affiliation of New Zealanders to Christianity since colonisation, church attendance in New Zealand has not been as high as in other Western nations.
The Anglican, Presbyterian, Congregation and Reformed denominations, and undefined Christian denominations decreased; yet the Catholic and Methodist denominations increased, as did some with other Christian denominations between 2001 and 2006: Orthodox Christian religions increased by 37.8 per cent; affiliation with Evangelical, Born Again and Fundamentalist religions increased by 25.6 per cent, and affiliation with Pentecostal religions increased by 17.8 per cent.
Research by the Bible Society of New Zealand in 2008 indicated that 15% of New Zealanders attend church at least once a week, and 20% attend at least once a month. In 2013 42% of the population said they had no religion.
According to the 2018 census, 10.1% identified as Catholic or Roman Catholic, 6.8% are Anglican, 6.6% are Undefined Christian, 5.2% are Presbyterian, 1.3% are Māori Christian, and 8.6% reported affiliation to other Christian groups.
To this day, however, Christian prayer (karakia) is the expected way to begin and end Māori public gatherings of many kinds.
According to a 2019 survey, nearly four in ten New Zealanders lacked trust in evangelical Christians.
Hinduism
Hinduism is the second largest religion in New Zealand after Christianity, with over 123,000 adherents according to the 2018 census, constituting 2.63% of the New Zealand population. The number of Hindus in New Zealand grew modestly after the 1990s when the immigration laws were changed.
Islam
Islam in New Zealand began with the arrival of Muslim Chinese gold prospectors in the 1870s. The first Islamic organisation in New Zealand, the New Zealand Muslim Association, was established in Auckland in 1950. 1960 saw the arrival of the first imam, Maulana Said Musa Patel, from Gujarat, India. Large-scale Muslim immigration began in the 1970s with the arrival of Fiji Indians, followed in the 1990s by refugees from various war-torn countries. In April 1979 the three regional Muslim organisations of Canterbury, Wellington and Auckland, joined together to create the only national Islamic body – the Federation of Islamic Associations of New Zealand. Early in the 1990s many migrants were admitted under New Zealand's refugee quota, from war zones in Somalia, Bosnia, Afghanistan, Kosovo and Iraq. Since the 11 September attacks there was a spike in conversions to Islam among Māori inmates in prisons.
In the 2018 census, 61,455 people, identified themselves as Muslim constituting 1.32% of the total population making it the third largest religion in the country.
Buddhism
Buddhism is the fourth largest religion in New Zealand, at 1.13% of the population. In 2007 the Fo Guang Shan Temple was opened in Auckland for the promotion of Humanistic Buddhism. It is the largest Buddhist temple in New Zealand.
Most of the Buddhists in New Zealand are migrants from Asia with significant New Zealanders converted to Buddhism ranging from 15,000-20,000.
Judaism
The history of Jewish people in New Zealand begins in the 1830s with the earliest known settler Joel Samuel Polack. Prominent New Zealand Jews in history include 19th-century Premier Julius Vogel and at least five Auckland mayors, including Dove-Myer Robinson, and a chief justice (Sir Michael Myers). Former Prime Minister John Key is of part Ashkenazi Jewish descent, although he did not practice Judaism.
The first recorded communal Jewish service in New Zealand was held on 7 January 1843 in Wellington, although individual Jews were amongst earlier explorers and settlers.
The Jewish population in New Zealand increased from 6,636 in the 2001 census to 6,867 in the 2013 census. However it decreased to 5,274 in the 2018 census, possibly because of security concerns by Jews over the "digital-first" online census format introduced that year.
The majority of New Zealand Jews reside in Auckland and Wellington, though there is also a significant Jewish community in Dunedin which is believed to have the world's southernmost permanent synagogue. In 2018 census, 0.11% of the population identified as Jewish/Judaism.
Baháʼí Faith
The first Baháʼí in the Antipodes was Englishwoman Dorothea Spinney who arrived in Auckland from New York in 1912. About 1913 there were two converts – Robert Felkin who had met 'Abdu'l-Bahá in London in 1911 and moved to New Zealand in 1912 and is considered a Baháʼí by 1914 and Margaret Stevenson who first heard of the religion in 1911 and by her own testimony was a Bahá'í in 1913. The first Baháʼí Spiritual Assembly In New Zealand was elected in 1926 and their first independent National Spiritual Assembly in 1957. By 1963 there were four Assemblies. In the 2006 census 0.07% of respondents, or 2,772 people, identified themselves as Baháʼí. In the 2018 census 0.05% of respondents, or 2,925 people, reported an affiliation to the Baháʼí Faith. There are some 45 local assemblies and smaller registered groups.
Māori religion
Traditional Māori religion – that is, the pre-European belief system of Māori people – was little modified in its essentials from that of their Eastern Polynesian homeland, conceiving of everything, including natural elements and all living things, as connected by common descent through whakapapa or genealogy. Accordingly, all things were thought of as possessing a life force, or mauri. Very few Māori still adhere to traditional Māori beliefs – 3,699 respondents to the 2018 census identified themselves as adhering to "Māori religions, beliefs and philosophies".
Sikhism
Sikhs have been in New Zealand for more than a century, with the first arriving in Hamilton in the 1880s. There are now about 40,908 Sikhs in New Zealand, constituting 0.88% of the country's population. Sikhism is the fastest growing religion in New Zealand with the Sikh population in New Zealand having quadrupled since 2006 Sikhs have a strong presence in Auckland, and especially in South Auckland and Manukau, with the National Party's former Member of Parliament for Manukau Kanwal Singh Bakshi being a Sikh.
There were thirteen gurdwaras (the Sikh place of worship) in New Zealand in 2010. The largest, Kalgidhar Sahib, is situated in Auckland at Takanini.
Religion in culture and the arts
Although New Zealand is a largely secular country, religion finds a place in many cultural traditions. Major Christian events like Christmas and Easter are official public holidays and are celebrated by religious and non-religious alike, as in many countries around the world. The country's national anthem, God Defend New Zealand, mentions God in both its name and its lyrics. There has been occasional controversy over the degree of separation of church and state, for example the practice of prayer and religious instruction at school assemblies.
The architectural landscape of New Zealand attests to the historical importance of Christianity in New Zealand with church buildings prominent in cities, towns and the countryside. Notable Cathedrals include the Anglican Holy Trinity Cathedral, Auckland, ChristChurch Cathedral, Christchurch and Saint Paul's Cathedral, Wellington and the Catholic St Patrick's Cathedral, Auckland, Cathedral of the Blessed Virgin Mary, Hamilton, Cathedral of the Holy Spirit, Palmerston North, Sacred Heart Cathedral, Wellington, Cathedral of the Blessed Sacrament, Christchurch, St. Joseph's Cathedral, Dunedin. The iconic Futuna Chapel was built as a Wellington retreat center for the Catholic Marist order in 1961. The design by Māori architect John Scott, fuses Modernist and indigenous design principles.
Christian and Māori choral traditions have been blended in New Zealand to produce a distinct contribution to Christian music, including the popular hymns Whakaria Mai and Tama Ngakau Marie. From 1992 to 2014 New Zealand hosted one of the largest Christian music festivals in the Southern Hemisphere, the Parachute Music Festival.
Religion in politics
Religion has played and continues to play a 'significant and sometimes controversial role' in the politics of New Zealand. Most New Zealanders today consider politicians' religious beliefs to be a private matter.
Agnostic individuals in politics
Former Prime Ministers Jacinda Ardern, John Key and Helen Clark were agnostic.
Christian individuals in politics
A large number of New Zealand prime ministers have been professing Christians, including Jenny Shipley, Jim Bolger, Geoffrey Palmer, David Lange, Robert Muldoon, Walter Nash, Keith Holyoake, and Michael Joseph Savage. Former Prime Minister Bill English is Catholic and has argued that religious groups should contribute to political discourse.
Sir Paul Reeves, Anglican Archbishop and Primate of New Zealand from 1980 to 1985, was appointed Governor-General from 1985 to 1990.
Murray Smith was a member of the New Zealand Parliament from 1972 to 1975. His interest in governance continued when he later enrolled in the Bahá’í Faith and contributed in national and international roles within the Bahá'í Community.
Christian political parties
Christian political parties have usually not gained significant support, a notable exception being the Christian Coalition (New Zealand) polling 4.4% in the 1996 general election. Christian parties have often been characterised by controversy and public disgrace. Many of these are now defunct, such as the Christian Democrat Party, the Christian Heritage Party which discontinued in 2006 after former leader Graham Capill was convicted as a child sex offender, Destiny New Zealand, The Family Party and the New Zealand Pacific Party whose leader, former Labour Party MP Taito Phillip Field was convicted on bribery and corruption charges. United Future was more successful, and although not a Christian party, had significant Christian backing.
The two main political parties, Labour and National, are not religious, although religious groups have at times played a significant role (e.g. the Rātana Movement). Politicians are often involved in public dialogue with religious groups. The Exclusive Brethren gained public notoriety during the 2005 election for distributing anti-Labour pamphlets, which former National Party leader Don Brash later admitted to knowledge of.
Separation of church and state
New Zealand has no state religion or established church. However, the following anomalies exist:
New Zealand's head of state or monarch must declare that they are a Protestant Christian and will uphold the Protestant succession according to the declaration required by the Accession Declaration Act 1910.
Section 3 of the Act of Settlement 1700 requires that the king or queen of New Zealand must be a Protestant.
The title of the King of New Zealand includes the statement "by the Grace of God" and the title Defender of the Faith.
At the discussions leading to the Treaty of Waitangi Governor Hobson made a statement (albeit one which had no particular legal or constitutional significance) in defence of freedom of religion—sometimes called the 'fourth' article. In 2007, the government issued a National Statement on Religious Diversity containing in its first clause "New Zealand has no official or established religion." The statement caused controversy in some quarters, opponents citing that New Zealand's head of state, then Queen Elizabeth II, is required to be the supreme governor of the Church of England. However, Elizabeth II did not act in that capacity as the Queen of New Zealand. A poll of 501 New Zealanders in June 2007 found that 58% of respondents did not think Christianity should be New Zealand's official religion.
There has been increasing recognition of Māori spirituality in political discourse and even in certain government legislation. In July 2001 MP Rodney Hide alerted parliament to a state funded hikitapu (tapu-lifting) ceremony at the opening of the foreign embassy in Bangkok. It was revealed that the Ministry of Foreign Affairs and Trade had a standard policy of employing Māori ritual experts for the opening of official offices around the world. The Resource Management Act 1991 recognises the role of Māori spiritual beliefs in planning and environmental management. In 2002 local Māori expressed concerns that the development of the Auckland-Waikato expressway would disturb the taniwha, or guardian spirit, of the Waikato River, leading to delays and alterations to the project.
Before March 2019, blasphemous libel was a crime in New Zealand, but cases could only be prosecuted with the approval of the attorney-general, and the defence of opinion was allowed; the only prosecution, in 1922, was unsuccessful. In 1967, Presbyterian minister Professor Lloyd Geering faced charges of heresy brought by the Presbyterian Church, but the trial became stalemated and was abandoned.
The New Zealand Parliament opens its proceedings with a prayer. In November 2017 Christian language, including reference to Christ, was removed from the prayer.
See also
Irreligion in New Zealand
List of Christian organisations in New Zealand
List of New Zealand religious leaders
National Statement on Religious Diversity
References
Further reading
Morrison, Hugh. "Globally and Locally Positioned: New Zealand Perspectives on the Current Practice of Religious History," Journal of Religious History (2011) 35#2 pp 181–198
Simpson, Jane. "Women, Religion and Society in New Zealand: A Literature Review," Journal of Religious History (1994) 18#2 pp 198–218.
External links
Statistics New Zealand – religion affiliation summary.
Statistics New Zealand – full religious affiliation tables. |
Carbondale Township is one of sixteen townships in Jackson County, Illinois, USA. As of the 2010 census, its population was 29,544 and it contained 14,341 housing units. Southern Illinois University is located in this township.
Geography
According to the 2010 census, the township has a total area of , of which (or 98.01%) is land and (or 1.99%) is water.
Cities, towns, villages
Carbondale (vast majority)
Unincorporated towns
Evergreen Terrace at
Southern Hills at
(This list is based on USGS data and may include former settlements.)
Adjacent townships
De Soto Township (north)
Makanda Township (south)
Pomona Township (southwest)
Murphysboro Township (west)
Somerset Township (northwest)
Cemeteries
The township contains these six cemeteries: Dillinger, North County Line, Oakland, Snider Hill, Winchester and Woodlawn.
Major highways
U.S. Route 51
Illinois Route 13
Airports and landing strips
Memorial Hospital of Carbondale Heliport
Southern Illinois Airport (southeast quarter)
Lakes
Campus Lake
Landmarks
Attucks Park
Evergreen Park
The Crossings
University Mall
Demographics
School districts
Murphysboro Community Unit School District 186
Political districts
Illinois' 12th congressional district
State House District 115
State Senate District 58
References
United States Census Bureau 2007 TIGER/Line Shapefiles
United States National Atlas
External links
City-Data.com
Illinois State Archives
Townships in Jackson County, Illinois
Townships in Illinois |
Wang Shu (, born 4 November 1963) is a Chinese architect based in Hangzhou, Zhejiang Province. He is the dean of the School of Architecture of the China Academy of Art. With his practice partner and wife Lu Wenyu, he founded the firm Amateur Architecture Studio. In 2012, Wang became the first Chinese citizen to win the Pritzker Prize, the world's top prize in architecture. The award was the subject of some controversy since the Pritzker committee did not also award Lu Wenyu, his wife and architectural partner, despite their years of collaboration.
Early life and education
Wang Shu was born on 4 November 1963 in Ürümqi, the capital of the Xinjiang Uyghur Autonomous Region in China's far west. He began to draw and paint as a child, without any formal training in art.
Despite the anti-intellectual fervor of the "cultural revolution" (1966–76), his mother gave him access to the library and he read widely, from "Pushkin to Lu Xun."
As a compromise between his passion of art and engineering, his parents' recommendation, Wang chose to study architecture at the School of Architecture of Southeast University in Nanjing, Jiangsu Province (previously named Nanjing Institute of Technology) and received a bachelor's degree in 1985 and a master's degree in 1988.
Although Wang lived in Ürümqi and Beijing in his early life, after college he moved to Hangzhou for the city's natural landscapes and ancient tradition of art. He worked for the Zhejiang Academy of Fine Arts (now China Academy of Art) and in 1990 completed his first architectural project, a youth centre in the city of Haining near Hangzhou.
Wang did not have any commissions between 1990 and 1998. During that time his wife Lu Wenyu supported the family. Instead, he chose to further his studies at the School of Architecture of Tongji University in Shanghai, earning a PhD in 2000.
Career
In 1997, Wang and his wife Lu Wenyu, also an architect, founded the firm Amateur Architecture Studio. They chose the name as a rebuke of the "professional, soulless architecture" practiced in China, which they believe has contributed to the large-scale demolition of many old urban neighborhoods.
Wang joined the faculty of the China Academy of Art in 2000 as a professor, became the Head of the Architecture Department in 2003, and was named Dean of the School of Architecture in 2007.
In 2000, Wang designed the Library of Wenzheng College at Soochow University, which won the inaugural Architecture Art Award of China in 2004. His Five Scattered Houses in Ningbo won the Holcim Award for Sustainable Construction in the Asia Pacific in 2005. In 2008 his Vertical Courtyard Apartments in Hangzhou was nominated for the International Highrise Award.
In 2008 he completed the Ningbo Museum, a project he won in 2004 after an international competition. The building's facade is constructed entirely of recycled bricks, and its shape - resembling nearby mountains - reflects its natural setting. The museum won the 2009 Lu Ban Prize, the top architecture prize in China.
Wang's other major projects include the Ningbo Museum of Art (2005), the Xiangshan campus of the China Academy of Art (2007) and the Old Town Conservation of Zhongshan Street, Hangzhou (2009).
His architecture has been described as "opening new horizons while at the same time resonates with place and memory", experimental, and as a rare example of critical regionalism in China.
Design approach
Wang creates modern buildings making use of traditional materials and applying older techniques. The Ningbo Museum is constructed of bricks salvaged from buildings which had been demolished to facilitate new developments. Wang is a keen supporter of architectural heritage where globalisation has stripped cities of their special attributes.
"In an age where the goal is to offer a distinct, individualized style, Shu has shied away from such a prerogative. Ironically, with his manner of seamlessly meshing the contemporary with the cultural, innovation with tradition, Shu’s work has come to define itself. The work is infused with fresh material juxtapositions and an expressive quality grounded in traditional formal proportions and scale."
He requires his freshman architecture students to spend a year working with their hands, learning basic carpentry and bricklaying, and Wang also requires other teachers in the department learn basic building skills. Because he believes "Only people who understand the nature of materials can make art using the materials."
Awards
In 2007, Wang Shu and Lu Wenyu were awarded the first Global Award for Sustainable Architecture, alongside the future Pritker Prize Balkrishna Doshi, Françoise-Hélène Jourda, Stefan Behnisch and Hermann Kaufmann.
In 2010, Wang and his wife Lu Wenyu together won the German Schelling Architecture Prize, and in 2011 he received the Gold Medal from the French Academy of Architecture.
In 2012, Wang won the Pritzker Architecture Prize. In so doing, he became the first Chinese citizen (second winner of Chinese descent after I. M. Pei) to win this prize, and the fourth youngest person to win. The jury, which included Pritzker laureate Zaha Hadid and the US Supreme Court justice Stephen Breyer, highlighted Wang's "unique ability to evoke the past, without making direct references to history" and called his work "timeless, deeply rooted in its context and yet universal." The chairman of the Hyatt Foundation said Wang's win represented "a significant step in acknowledging the role that China will play in the development of architectural ideals" going forward. Zhu Tao, a Chinese architectural critic and historian, speculated that the win could signify a turning point in Chinese architectural history saying the prize "sends a message that architecture is a cultural enterprise ... that architects are creators of culture."
Alejandro Aravena, a member of the Pritzker Prize jury, stated "Wang Shu’s outstanding architecture may be the consequence of being able to combine talent and intelligence. This combination allows him to produce masterpieces when a monument is needed, but also very careful and contained architecture when a monument is not the case. The intensity of his work may be a consequence of his relative youth, but the precision and appropriateness of his operations talk of great maturity."
Personal life
Wang Shu's father is a musician and an amateur carpenter. His mother is a teacher and school librarian in Beijing. His sister is also a teacher.
Wang is married to Lu Wenyu, who is also his business partner and fellow professor of architecture at the China Academy of Art. In an interview with the Los Angeles Times, Wang expressed his sentiment that his wife deserved to share the Pritzker Prize with him.
Major works
Major works by Wang include:
Completed
Youth Center (1990), Haining
Library of Wenzheng College at Soochow University (1999–2000), Suzhou
Ningbo Museum of Art (2001–05)
Xiangshan Campus, China Academy of Art, Phases I & II (2002–07), Hangzhou
Vertical Courtyard Apartments (2002–07), Hangzhou
Sanhe House (2003), Nanjing
Teaching Building of the Music and Dance Department (2003–05), Dongguan
Ceramic House (2003–06), Jinhua
Five Scattered Houses (2003–06), Ningbo
Ningbo Museum (2003–08)
Tiled garden, Venice Biennale of Architecture (2006), Italy
Old Town Conservation of Zhongshan Street (2007–09), Hangzhou
Exhibition Hall of the Imperial Street of Southern Song Dynasty (2009), Hangzhou
Ningbo Tengtou Pavilion, Shanghai Expo (2010)
Bus Stop in Krumbach, Austria (2014)
Under construction or in design phase
Heyun Culture and Leisure Centers (2009), Kunming
City Cultural Center (2010), Jinhua
Shi Li Hong Zhuang Traditional Dowry Museum (2010), Ninghai
Contemporary Art Museum on the Dock (2010), Zhoushan
Buddhist Institute Library (2011), Hangzhou
References
External links
Images of selected works at Pritzker Prize
Thorsten Botz-Bornstein: "WANG Shu and the Possibilities of Critical Regionalism in Chinese Architecture" in The Nordic Journal of Architectural Research, 1, 2009, 4–17.
1963 births
Architecture educators
Artists from Xinjiang
Academic staff of China Academy of Art
Chinese architects
Living people
People from Ürümqi
Pritzker Architecture Prize winners
Southeast University alumni
Tongji University alumni
Wang Shu buildings |
```c
/*
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are
* permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of
* conditions and the following disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to
* endorse or promote products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef __clang__
unsigned short __builtin_addcs(unsigned short, unsigned short, unsigned short, unsigned short *);
#endif
int main() {
unsigned short carryout;
__builtin_addcs((unsigned short) 0x0, (unsigned short) 0x0, 0, &carryout);
if (carryout != 0) {
return -1;
}
__builtin_addcs((unsigned short) 0xFFFF, (unsigned short) 0x0, 0, &carryout);
if (carryout != 0) {
return -1;
}
__builtin_addcs((unsigned short) 0x0, (unsigned short) 0xFFFF, 0, &carryout);
if (carryout != 0) {
return -1;
}
__builtin_addcs((unsigned short) 0xFFFF, (unsigned short) 0x1, 0, &carryout);
if (carryout != 1) {
return -1;
}
__builtin_addcs((unsigned short) 0x1, (unsigned short) 0xFFFF, 0, &carryout);
if (carryout != 1) {
return -1;
}
__builtin_addcs((unsigned short) 0xFFFF, (unsigned short) 0xFFFF, 0, &carryout);
if (carryout != 1) {
return -1;
}
__builtin_addcs((unsigned short) 0x0, (unsigned short) 0xFFFE, 1, &carryout);
if (carryout != 0) {
return -1;
}
__builtin_addcs((unsigned short) 0x0, (unsigned short) 0xFFFF, 1, &carryout);
if (carryout != 1) {
return -1;
}
__builtin_addcs((unsigned short) 0xFFFE, (unsigned short) 0x0, 1, &carryout);
if (carryout != 0) {
return -1;
}
__builtin_addcs((unsigned short) 0xFFFF, (unsigned short) 0x0, 1, &carryout);
if (carryout != 1) {
return -1;
}
__builtin_addcs((unsigned short) 0xFFFF, (unsigned short) 0xFFFF, 1, &carryout);
if (carryout != 1) {
return -1;
}
unsigned short res1 = __builtin_addcs((unsigned short) 0x0FFF, (unsigned short) 0x1, 0, &carryout);
if (res1 != 0x1000 || carryout != 0) {
return -1;
}
unsigned short res2 = __builtin_addcs((unsigned short) 0x0FFF, (unsigned short) 0x1, 1, &carryout);
if (res2 != 0x1001 || carryout != 0) {
return -1;
}
return 0;
}
``` |
The Task Force on Accountability for Crimes Committed in Ukraine is a pro bono international group of lawyers established on 29 March 2022 to help Ukrainian prosecutors coordinate legal cases for war crimes and other crimes related to the 2022 Russian invasion of Ukraine.
Creation
In late March 2022, during the 2022 Russian invasion of Ukraine, the Prosecutor General of Ukraine Iryna Venediktova announced the creation of an international legal task force that would support Ukrainian prosecutors in coordinating legal cases in multiple courts in several jurisdictions for war crimes related to the invasion. Venediktova stated that the Ukrainian prosecutors had collected 2500 "possible war crimes cases", including the Mariupol theatre airstrike, and "several hundred suspects".
Composition
The task force includes individual British lawyers Amal Clooney, Helena Kennedy, Richard Hermer, Tim Otty, Philippa Webb and Lord Neuberger. Lawyers from legal firms already representing Ukraine, Nikhil Gore from Covington & Burling, Luke Vidal from Sygna Partners and Emma Lindsay from Withers LLP, are also included in the task force. Professors of international humanitarian law Marko Milanovic and Andrew Clapham are included in the team.
The task force members and associated staff are required to work pro bono.
Aims
The task force aims to make recommendations for legal actions in national jurisdictions in several countries, in guiding cooperation with the International Criminal Court investigation in Ukraine, and in searching for assets of suspects that could be seized and used in compensation to victims or for rebuilding Ukraine.
See also
Legality of the 2022 Russian invasion of Ukraine
References
Human rights in Ukraine
Legal history of Ukraine
Organizations of the Russo-Ukrainian War
War crimes during the Russian invasion of Ukraine
Reactions to the Russian invasion of Ukraine
Accountability
Transitional justice |
```xml
<?xml version="1.0" encoding="UTF-8"?>
<definitions id="definitions"
xmlns="path_to_url"
xmlns:activiti="path_to_url"
targetNamespace="Examples">
<process id="testDynamicScript">
<startEvent id="theStart" />
<sequenceFlow id="flow1" sourceRef="theStart" targetRef="script1" />
<scriptTask id="script1" scriptFormat="JavaScript" activiti:autoStoreVariables="false">
<script>
<![CDATA[
var sum = a + b;
execution.setVariable("test", sum);
]]>
</script>
</scriptTask>
<sequenceFlow id="flow2" sourceRef="script1" targetRef="task1" />
<userTask id="task1" />
<sequenceFlow id="flow3" sourceRef="task1" targetRef="theEnd" />
<endEvent id="theEnd" />
</process>
</definitions>
``` |
Legislative elections were held in France on 2 January to elect the third National Assembly of the Fourth Republic. The elections were held using party-list proportional representation. The elections had been scheduled for June 1956; however, they were brought forward by Edgar Faure using a constitutional sanction.
The previous legislative elections in 1951 had been won by the Third Force, a coalition of center-left and center-right parties, but it was divided about denominational schools question and, when faced with the colonial problem, the governments had gradually moved towards the right. A part of the Rally of the French People (RPF), the Gaullist party, joined the majority in opposing the leadership of Charles de Gaulle, who then retired.
The defeat in the Battle of Dien Bien Phu in May 1954 caused a political crisis. The Radical Pierre Mendès-France became leader of the cabinet and ended the First Indochina War. He also began the process of independence for Morocco and Tunisia, but from November 1954 on, France was confronted by the Algerian War. In February 1955, Mendès-France was replaced, at the head of the cabinet, by his rival in the Radical Party, Edgar Faure. This one led a more repressive policy in Algeria.
The far-right, led by Pierre Poujade, re-appeared at about the same time. He was a critic of "fiscalism", and leader of a shopkeepers and craftsmen's movement. Many voters seemed tired of the political system's numerous ministerial crises, and he had much support in the rural areas, which were in decline.
The anticipated legislative elections took place when Faure was defeated by the National Assembly. Even though the French Communist Party re-emerged as the country's most popular party (for the last time in its history), it did not join the government. A coalition was formed behind Mendès-France and advocated a peaceful resolution of the Algerian conflict. This Republican Front was composed of the French Section of the Workers' International (SFIO, socialist party) of Guy Mollet, the Radical Party of Pierre Mendès-France, the Democratic and Socialist Union of the Resistance of François Mitterrand and the National Centre of Social Republicans of Jacques Chaban-Delmas. Faure was excluded from the Radical Party – in response he transformed the Rally of the Republican Lefts (which had been abandoned by those groups which had now joined the Republican Front) into a party that he led, and he campaigned with the center-right parties.
The French Communist Party remained the largest party and the Republican Front obtained a relative majority in order to end the Algerian War.
The Poujadists won 52 seats versus predictions of six to eight, and the press stated that they held the balance of power. Media reception was mixed, with the result welcomed by communist supporters and condemned by papers such as The Times, Le Figaro, and The Saturday Evening Post.
The coalition cabinet was led by the Socialist leader Guy Mollet. At the beginning he was also supported by the Communists, but pressure from the pieds-noir in Algeria incited him into leading a very repressive policy against the Algerian nationalists. This policy was criticized by Vice-Prime Minister Mendès-France and other members of the cabinet, who resigned, thus splitting the Republican Front. Mollet and his successors floundered in the conflict until May 1958.
Results
References
Legislative elections in France
France
Legislative |
Mayfield Secondary School is located in Caledon, Ontario, Canada. It is one of two Regional Arts Schools in the Peel District School Board.
Regional Arts Program
Four disciplines of art are hosted at Mayfield: drama, dance, music, and visual arts. Each has its own night to showcase the talents of the students at a junior (grades 9 and 10) and senior (grades 11 and 12) level. Their improv team also competes in various National competitions. Jazz, classical, and alternative music styles are offered.
Dance Program
Mayfield's dance program, part of the Regional Arts Program, accepts 50-60 students per year for the four-year program. It includes theoretical (dance history, culture, important figures in the dance world, the dance industry and different styles of dance) and practical components about the program. The program focuses primarily on classical ballet and modern dance; however, to ensure students are exposed to other styles of dance, the program brings in experienced instructors to hold workshops a few times per semester. In this way, students are able to learn important dance technique while experiencing other styles of dance such as jazz, hip hop, ballroom styles, and many other styles of dance from around the world.
Every year, the department prepares a winter dance production. Each year explores a different winter related theme but every other year, the department performs The Nutcracker. The department also prepares a spring show in May and themes for this show can vary greatly. Although during the winter show students are able to show off their dancing talent, during the May show, students are able to choreograph their own pieces and audition them into the show. Therefore, the show includes teacher and student choreography. Furthermore, the May show is largely organized by the Grade 12 students as their final leadership project.
Extracurricular activities
Sports Teams
Fall Teams (September - November)
Basketball (Senior and Junior Girls)
Cross Country Running (Co-ed Varsity)
Field Hockey (Girls Varsity)
Flag Football (Girls Varsity)
Football (Senior and Junior Boys)
Golf (Co-ed Varsity)
Tennis (Co-ed Varsity)
Volleyball (Senior and Junior Boys)
Winter Teams (Dec - Mar)
Alpine Skiing (Co-ed Varsity)
Basketball (Senior and Junior Boys)
Basketball (Junior Boys)
Curling (Senior and Junior Girls)
Curling (Junior Girls)
Curling (Senior, Junior, and Open Boys)
Curling (Senior and Junior Mixed)
Hockey (Varsity Boys)
Hockey (Varsity Girls)
Nordic Skiing (Co-ed Varsity)
Wrestling (Co-ed Varsity)
Volleyball (Senior and Junior Girls)
Spring Teams (April - June)
Badminton (Co-ed Varsity)
Baseball (Boys Varsity)
Ping Pong (Co-ed Varsity)
Archery (Co-ed Varsity)
Fastpitch Softball (Girls Varsity)
Lacrosse (Boys Varsity)
Lacrosse (Girls Varsity)
Rowing (Varsity)
Rugby (Senior and Junior Boys)
Rugby (Senior and Junior Girls)
Soccer (Senior and Junior Boys)
Soccer (Senior and Junior Girls)
Track and Field (Co-ed Varsity)
Notable alumni
Kyle Quincey, NHL Defenceman
Megan Bonnell, folk musician
Clifton Brown, Muay Thai Kickboxer (Grade 9)
Lara Jean Chorostecki, actor
Ashley Comeau, actor/Second City alumna/television writer/producer
Paulo Costanzo, actor
Director X, music video director Julien Lutz
Jordan Gavaris, actor
Michaela Hinds, World Champion Irish dancer
Jake Holden, Olympic snowboarder
Kris Lemche, actor
Nicholas Lindsay, MLS soccer player (Toronto FC)
Malgosia Majewska, Miss World Canada 2006
Brittany Raymond, actress and dancer, on The Next Step
Kyle Seeback, former MP, Brampton West
Skye Sweetnam, musician
Brittany Webster, cross-country skier
Ian Williams, Giller Prize-winning author
Dave Greszczyszyn, Skeleton Olympian
Brandie Wilkerson, Beach Volleyball Olympian
See also
List of high schools in Ontario
References
External links
Urban Exploration of Mayfield SS with picture gallery
Peel District School Board
High schools in Caledon, Ontario
Educational institutions established in 1969
1969 establishments in Ontario
Art schools in Canada |
```xml
import * as pdfjs from 'pdfjs-dist';
import Document from './Document.js';
import Outline from './Outline.js';
import Page from './Page.js';
import Thumbnail from './Thumbnail.js';
import useDocumentContext from './shared/hooks/useDocumentContext.js';
import useOutlineContext from './shared/hooks/useOutlineContext.js';
import usePageContext from './shared/hooks/usePageContext.js';
export type { DocumentProps } from './Document.js';
export type { OutlineProps } from './Outline.js';
export type { PageProps } from './Page.js';
export type { ThumbnailProps } from './Thumbnail.js';
import './pdf.worker.entry.js';
export {
pdfjs,
Document,
Outline,
Page,
Thumbnail,
useDocumentContext,
useOutlineContext,
usePageContext,
};
``` |
Sir Richard Vernon, 3rd Baronet (22 June 1678 – 1 October 1725) was a British diplomat and politician.
He succeeded in the baronetcy in 1683, when aged only five. He was commissioned a lieutenant in the 2nd Regiment of Foot Guards on 10 November 1702, but left the regiment in 1703. He became a Member of the Irish Parliament for Monaghan Borough in 1703 and sat for it until 1713.
Envoy to Poland
Vernon was subsequently dispatched as British envoy to Poland, also visiting Dresden. On his way he passed through The Hague in September 1715. The following April he travelled from Dresden to Danzig to attend the wedding between the Duke of Mecklenburg and the Tsar's niece, a splendid affair. The following October, he passed through Berlin on his way to Gohr, returning in November. He was still in Berlin a month later, but about to go to Dresden to await the king of Poland there or go on to Poland. By October 1718, he had been superseded and returned to England.
He died in Poland in 1723 in the court of Augustus II the Strong.
References
|-
1678 births
1725 deaths
Coldstream Guards officers
Irish MPs 1703–1713
Members of the Parliament of Ireland (pre-1801) for County Monaghan constituencies
Ambassadors of Great Britain to Poland
103
Richard |
Alice Baker (28 July 1898 – 2 March 2006) was a British World War I service veteran. She was one of the last known female British World War I veterans in the UK. Her non-combat service was as a Leading Aircraftswoman in the Royal Flying Corps at the age of 18 as a 'doper' waterproofing aircraft wings.
Biography
She was born in 1898 in Costessy, near Norwich in England. After the war, she became a nurse at Saint Andrew's hospital in Thorpe. She married a police officer named Stanley. They had a son, Leslie, who was a pilot during World War II. He served in the RAF and as a bomber pilot. At the age of 94, she was invited for the 75th anniversary of the RAF, and stood next to Queen Elizabeth II. On Alice's 100th and 107th birthdays, RAF Coltishall pilots did commemorative flypasts in her honour. She lived with her family in Hempnall until she was 104, then moved to a care home in Ditchingham. Alice Baker died in her sleep at the age of 107 on 2 March 2006.
References
1898 births
2006 deaths
British Army personnel of World War I
English centenarians
British women in World War I
Women centenarians
Royal Flying Corps soldiers
Military personnel from Norfolk |
Tape Club is a 26-song compilation of unreleased songs, B-sides, and demos from American indie pop/rock band Someone Still Loves You Boris Yeltsin. It was released in the United States in 2011.
Track listing
Personnel
John Robert Cardwell, Philip Dickey, Jonathan James, Will Knauer
Additional musicians
2 = Additional guitar and bass by Chris Slater and Tom Hembree.
3 = Additional vocals by Gwyn Knauer.
5, 19 = Clarinet by Roni Dickey.
10 = Additional vocals by Grace Bentley.
18 = Additional shouting by Cindy Woolf, Matt Greene, Roni Dickey, Grace Bentley, Michael St. John, and Ryan Spilken.
Recording and production
All recorded by SSLYBY in Springfield, Missouri except where noted. Mastered by Jonathan James at a Motel 6.
1 = Phil's mom's house, winter 2002.
2, 4 = Sean Schultz's basement, winter 2003.
3 = Weller house, winter 2003.
5 = Fremont house, summer 2005.
6, 8 = Jonathan's studio/practice space, summer 2005.
7 = Lotus Rain's house, summer 2005.
9, 10 = Weller attic, summer 2005.
11, 12 = Jonathan's studio/practice space, winter 2007.
13 = Bentley's carriage house, fall 2007.
14 = Jonathan's studio/practice space, fall 2007.
15 = Fred Champion's loft in Wilmington, North Carolina, winter 2007.
16 = The Studio, spring 2008. Recorded by Lou Whitney and Eric Schuchmann.
17 = Phil's apartment, spring 2008.
18 = Mayor of Springfield's yoga studio/basement, summer 2009.
19, 20 = Will's house on Normal Street, summer 2009.
21, 22 = Phil's basement, summer 2009.
23 = Phil's room and Jonathan's apartment, summer 2009.
24, 26 = Smart Studios in Madison, Wisconsin, fall 2009. Recorded by Chris Walla and Beau Sorenson.
25 = Dark Egg studio, fall 2009.
Album art
Photos and art by Daniel Zender, Zoe Burnett, Gabriella Lacza, Abby Williamson, Tracy Graham, Jason Williamson, Tim Nowack, and Chris Beckman. Art direction by Chris Beckman.
References
Someone Still Loves You Boris Yeltsin albums
2011 compilation albums |
```go
package responsetransformer
import (
"testing"
"github.com/hellofresh/janus/pkg/plugin"
"github.com/hellofresh/janus/pkg/proxy"
"github.com/stretchr/testify/assert"
)
func TestResponseTransformerConfig(t *testing.T) {
var config Config
rawConfig := map[string]interface{}{
"add": map[string]interface{}{
"headers": map[string]string{
"NAME": "TEST",
},
"querystring": map[string]string{
"name": "test",
},
},
}
err := plugin.Decode(rawConfig, &config)
assert.NoError(t, err)
assert.IsType(t, map[string]string{}, config.Add.Headers)
assert.Contains(t, config.Add.Headers, "NAME")
}
func TestResponseTransformerPlugin(t *testing.T) {
rawConfig := map[string]interface{}{
"add": map[string]interface{}{
"headers": map[string]string{
"NAME": "TEST",
},
},
}
def := proxy.NewRouterDefinition(proxy.NewDefinition())
err := setupResponseTransformer(def, rawConfig)
assert.NoError(t, err)
assert.Len(t, def.Middleware(), 1)
}
``` |
Valouse (; ) is a commune in the Drôme department in southeastern France.
Population
See also
Communes of the Drôme department
References
Communes of Drôme |
Tamolanica phryne is a species of praying mantis in the family Mantidae.
References
Articles created by Qbugbot
Insects described in 1877
Hierodulinae |
Jacek Mierzejewski (1883, Sosnowiec - 1925, Otwock) was a Polish painter, associated with "Formism", a Polish art movement that combined Cubism, Impressionism and Futurism.
Biography
He began his studies at the Warsaw School of Drawing, then enrolled at the Krakow Academy of Fine Arts, where he studied with Florian Cynk, Leon Wyczółkowski and Józef Mehoffer. In poor health after 1905, he spent much of his free time at the resort in Zakopane.
In 1913, he received a scholarship that enabled him to study in France, where he spent most of his time in Paris and Brittany. The works of Cézanne became a major influence there. His first major exhibition was with the Kraków Society of Friends of Fine Arts in 1916.
During this time, he was diagnosed with tuberculosis. He returned to Poland after the war and settled in Piotrowice near Nałęczów, the site of a well-known sanatorium. He died of his illness in 1925.
In addition to paintings, he produced etchings and lithographs. He also illustrated children's books and textbooks and did satirical cartoons for the short-lived (1911–12) biweekly magazine Abdera. In 1923, he displayed toys and Christmas decorations he had designed, at the Exhibition of the Decorative Arts in Monza.
His sons, and Jerzy also became well-known painters.
Selected paintings
References
Further reading
Agnieszka Otroszczenko and Maciej Mazurek, Jacek Mierzejewski, Andrzej Mierzejewski, Jerzy Mierzejewski, Muzeum Narodowe w Warszawie, 2004
External links
1883 births
1925 deaths
20th-century Polish painters
20th-century Polish male artists
Polish illustrators
People from Sosnowiec
Polish lithographers
Polish printmakers
Toy designers
20th-century deaths from tuberculosis
20th-century lithographers
Polish male painters
Tuberculosis deaths in Poland |
Iván Duque Márquez (; born 1 August 1976) is a Colombian politician and lawyer who served as the president of Colombia from 2018 to 2022. He was elected as the candidate from the Democratic Centre Party in the 2018 Colombian presidential election. Backed by his mentor, former president and powerful senator Alvaro Uribe, he was elected despite having been relatively unknown a year before the election. He ran on a platform that included opposing Juan Manuel Santos' peace agreement with the FARC guerrilla group. After Duque's term came to an end, he was succeeded by Gustavo Petro on 7 August 2022, after Petro won the runoff round in the 2022 Colombian presidential election.
Life and career
Duque was born in Bogotá to a wealthy political family originally from the Colombian town of Gómez Plata, Antioquia. He is the son of Juliana Márquez Tono (born 1950), a political scientist and Iván Duque Escobar (1937–2016), a powerful local political leader who was Governor of Antioquia, auditor in the United Nations, Minister of Mines and Energy, and head of the National Registry of Civil Status in the Government of Andrés Pastrana. Duque's siblings are Andrés and María Paula Duque.
Duque attended Colegio Rochester but obtained his high-school diploma from Colegio Winston-Salem in Bogota. He then graduated from Sergio Arboleda University in Bogotá in 2000 with a degree in law. He holds a LLM in International economic law from American University and a Masters in Public Policy Management from Georgetown University, Washington D.C..
He began his professional career in 1999 as a consultant in CAF – Development Bank of Latin America and the Caribbean and later served as an advisor at the Colombian Ministry of Finance and Public Credit during the government of Andrés Pastrana (1998–2002).
Subsequently, he was appointed by Juan Manuel Santos, future president and then-Minister of Finance, as one of Colombia's representatives at the Inter-American Development Bank (IDB), a post he held between 2001 and 2013. There he served as chief of the Division of Culture, Solidarity, and Creativity.
Duque also served as international advisor of former President Álvaro Uribe Vélez. Between 2010 and 2011, he was a consultant at the United Nations (UN) in the Panel of Inquiry appointed by the Secretary-General for the Incident of the Gaza Flotilla that occurred on 31 May 2010, between Israel and Turkey, known as Mavi Marmara.
Political background
Duque returned to Colombia to become a candidate for the Senate in the legislative elections of 2014, for the Partido Centro Democrático (Democratic Center Party) which split away from the ruling governing party after Juan Manuel Santos opened peace negotiations with the FARC. This new party campaigned against the new peace agreement and the Santos Government, and was led by right wing former president Uribe.
Uribe created his own political party and presented himself and a list of hand picked political allies as candidates for the office of Congressman in a closed list, which meant that people could not vote for an individual congressman but had to vote for the party as a whole in both the upper and lower chamber elections. Duque was included in the number seven spot of the closed off list for the Senate and thus was elected senator.
During his time as a senator, he was the author of four laws:
Law 1822 of 4 January 2017, increasing the maternity leave from 14 to 18 weeks, so mothers could spend more time with their newborn children, a benefit that was also extended to adoptive mothers.
Law 1831 of 2 May 2017, for the availability of defibrillators in public facilities and places of high public influx, to save lives, since heart attacks are the leading cause of death in Colombia.
Law 1809 of 29 September 2016, for the use of advanced severance payments for educational insurance, so that more families can send their children to the university.
Law 1834 of 23 May 2017, the "Orange Law" for the promotion, development and protection of the creative and cultural industries.
2018 presidential election
On 10 December 2017, Duque was nominated by his party as its candidate for President of Colombia. He won the nomination through a system of surveys conducted by the party, with a 29.47% favorability compared to the other two candidates: Carlos Holmes Trujillo who obtained 20.15%, and Rafael Nieto with 20.06%. In January 2018, it was announced that the center-right coalition would participate in the Grand Primary for Colombia – an interparty consultation – with Duque as its candidate confronting Marta Lucía Ramírez (civil-center right movement) and Alejandro Ordóñez (right wing civil movement). On 11 March 2018, Duque won the primary with more than 4 million votes. Ramírez was second, with just over 1.5 million votes, and Ordóñez came third with 385,000 votes. During his speech, Duque thanked the support of Colombians at the polls and announced Marta Lucía Ramírez as his running mate in the elections.
On 27 May 2018, Duque earned the most votes in the first round of the presidential election with over 39% of the vote. Duque was elected President of Colombia on 17 June 2018 after defeating Gustavo Petro 54% to 42% in the second round.
Presidency (2018–2022)
Duque was sworn in on 7 August 2018 at Bogotá's Bolívar Square. Duque's government main priorities are legality and entrepreunership, among other areas.
In 2020, after the drug lord "Ñeñe" Hernandez was murdered in Brazil, some audios of him conspiring to give money to Duque's party in order to buy votes for his election were published in what is known as the "Ñeñepolítica".
Duque's term concluded on 7 August 2022 and he was succeeded by Gustavo Petro.
Domestic policy
Opposed to the peace agreement signed in 2016 with the FARC guerrilla group, Duque, nevertheless stated at the time of his election that he had no intention of "smashing it to bits". As president, he tried to eliminate certain points of the agreement. His government sought to weaken the Special Jurisdiction for Peace and cut the budget of the Truth Commission and the Unit for the Search for Disappeared Persons by 30%. The government also promoted generals involved in extrajudicial executions (see : "False positives" scandal), appoints controversial figures to key positions and halts negotiations with the other guerrilla group, the National Liberation Army (ELN).
Through its National Development Plan 2018–2022, the Colombian government planned to revive the country's gold and copper markets. In addition, 161 new oil drilling sites were planned for 2022, four times more than the 46 existing in 2018. Hydraulic fracturing was legalised in 2019. The plan was widely criticised by environmentalists, who considered it dangerous for the environment and the climate, and offering the country's non-renewable resources to foreign multinationals. The share of extraction profits paid to the state has dropped to 0.4% for gold and silver, and 3.27% for open-cast coal mines. The plan also threatened indigenous communities, whose territories and resources were under threat. In mid-2019 the Pan-American Highway was blocked for several weeks by the mobilisation of thousands of indigenous people in the department of Cauca.
During the COVID-19 pandemic, the Colombian government created the "Prevention and Action" television programme, in which Duque communicated with citizens through a national network, with the Colombian public and private media, broadcasting every day at 6pm. The program enjoyed great popularity initially, since it was shown as an effective means to timely communicate the news about the measures used to contain the spread COVID-19. His approval rating increased at the start of the pandemic, as a result. However, the program was extended over time and lost popularity, as there were no constant news about the pandemic; the program mutated to a space where Duque talked to the public, however the program continued during the start of the 2021 protests, Duque continued to present the television program, which generated strong criticism. By May 2021, as protests continue and the unemployment was out of control, the programme ended.
In 2020, the defence minister Carlos Holmes Trujillo died of COVID-19, and was replaced by Diego Molano. As a result of the COVID-19 pandemic, GDP in Colombia decreased by 6.8% in 2020, the worst drop in the country's GDP in history.
Public safety
Insecurity in Colombia has increased during Iván Duque's presidency. In four years there have been more than 260 massacres that have left more than 1,100 people dead. Violence against social leaders in the territories has increased substantially. As of 4 June 2022, 930 social leaders had been assassinated. In addition, 245 former FARC combatants who took advantage of the Peace Accords have been assassinated during the Duque government.
War on drugs
Duque made the war on drugs a central issue of his presidency and called his country "a partner for all of the Western Hemisphere in the fight against drugs." Despite his efforts, however, cocaine production reached record highs during his presidency. With a potential output of 1,400 metric tons in 2022 according to the UN, Colombia remained the world's leading producer of the drug.
Protests
The 2019–2020 Colombian protests were a collection of protests that have occurred since 21 November 2019. Hundreds of thousands of Colombians demonstrated to support the Colombian peace process and against the Duque government. Demonstrators criticise also the government's desire to make the labour market more flexible, to reduce the public pension fund in favour of private entities and to raise the retirement age . The unions also protested against the tax reform aimed at reducing the taxes paid by companies and against the planned privatisation of public companies such as the oil company Ecopetrol and the electricity company Cenit. The army was deployed in the main cities of the country and a curfew was introduced. The unpopularity rate of Iván Duque reached almost 70%.
The 2021 Colombian protests began on 28 April 2021 against increased taxes proposed by the Duque government amid the pandemic.
Venezuelan refugee crisis
The Presidency of Ivan Duque has continued the policies of his predecessor Juan Manuel Santos in regards to immigration and the Venezuelan refugee crisis. Ivan Duque's government has been a vocal supporter for the refugees at the United Nations and has provided aid, schooling and health care for many, and has been a vocal critic of other South American countries closing of doors to Venezuelan refugees.
In 2018, Duque dedicated 0.5% of government spending to supporting refugees accounting for about 20% of Colombia's budget short fall, despite opposition. In response to this criticism on a televised address Duque stated: "For those who want to make from xenophobia a political path, we adopt the path of brotherhood, for those who want to outcast or discriminate against migrants, we stand up today ... to say that we are going to take them in and we are going to support them during difficult times."
Duque's policies regarding this issue have received repeated praise from international humanitarian organizations for its efforts to legalize, formalize and offer assistance to refugees, and the Atlantic has noted that it has set the bar welcoming refugees. A representative from the International Rescue Committee has noted that: "[she's] never seen a government trying this hard to register people and leave the borders open. Unfortunately," she added "the scale of this crisis, and the speed at which it changes, is more than Colombia can handle." His decision to provide temporary protected legal status to nearly 1.7 million Venezuelan migrants drew praise from leaders around the world.
Foreign policy
Duque pursued very close relations with the Trump administration in the United States and supported its projects in Colombia and Latin America. In return, Columbia benefited from U.S. military support and increased foreign aid funds.
Duque described the Venezuelan government of Nicolás Maduro as dictatorial and supported the Trump administration's efforts for regime change, recognizing Juan Guaido as interim president and encouraging the country's military to back the Guaido government.
Duque's government welcomed the removal of Bolivian President Evo Morales during the 2019 Bolivian political crisis, and was accused of interference in the Ecuadorian elections of 2021 by accusing the left-wing candidate Andrés Arauz of being financed by the Colombian guerrilla group ELN.
Despite his party supporting Donald Trump during the 2020 US presidential election, Duque maintained very good relations under the presidency of Joe Biden. The Biden administration showed signs of favoring right-wing candidates in the Colombian presidential election of 2022: senior US diplomats spoke to the press about alleged Russian, Cuban and Venezuelan interference in the election in favor of leftist candidate Gustavo Petro, while US officials avoided meeting Petro before the election while meeting other candidates.
Duque condemned the 2022 Russian invasion of Ukraine and considered the invasion a violation of international law and the United Nations charter.
Criminal investigation
Following the publication of alleged evidence in March 2018 that Duque's political party conspired with the drug trafficking organization of Marquitos Figueroa to commit fraud in the presidential election, Congress's Accusations Committee and the National Electoral Council opened an investigation into his alleged role in the fraud. The Supreme Court opened a criminal investigation into his political sponsor, right-wing former President Álvaro Uribe, who is already being investigated for alleged witness fraud and bribery.
After the presidency
Two days after the end of his presidency, he was named a "distinguished fellow" at the influential Woodrow Wilson Center in Washington, D.C., a U.S. government-funded think tank with a monthly salary of $10,000.
Published books
Iván Duque is the author of the books Monetary Sins (2007), Machiavelli in Colombia (2010), Orange Effect (2015), IndignAcción (IndignAction) (2017), The Future is at the Center (2018) Archaeology of My Father (2018), Humanism Matters (2019), The Road to Zero (2021) and is co-author of the book The Orange Economy: An Infinite Opportunity (2013).
Duque has also been an Op-Ed contributor to several newspapers: El Colombiano, from Medellín; Portafolio and El Tiempo from Casa Editorial El Tiempo in Bogotá; and El País in Spain.
Personal life
Duque is Roman Catholic. He is married to María Juliana Ruiz Sandoval, with whom he has three children: Luciana, Matías, Eloísa and David, a Yale SOM graduate.
Awards
2022:
Woodrow Wilson Award for Global Public Service, by the Woodrow Wilson International Center for Scholars of the Smithsonian Institution.
Planetary Leadership Award, by the National Geographic Society.
Honours
National honours
Grand Collar of the Order of Boyacá.
Collar of the Order of San Carlos.
Grand Cross Extraordinary of the National Order of Merit.
Order of Merit Colonel Guillermo Fergusson.
Foreign honours
Grand Collar of the Order of the Southern Cross (2021).
Grand Cross with Gold Breast Star, Order of Merit of Duarte, Sánchez and Mella (2022).
Grand Collar of the Order of the Sun of Peru (2019).
Medal of Honor of the Congress of the Republic of Peru (2019).
Grand Collar of the Order of Prince Henry (2022).
Collar of the Order of Isabella the Catholic (2021).
Grand Order of Mugunghwa (2021).
References
External links
Official website
Biography by CIDOB (in Spanish)
1976 births
Living people
Ivan
People from Bogotá
Presidents of Colombia
Members of the Senate of Colombia
Right-wing populism in South America
Colombian anti-communists
Colombian Roman Catholics
Colombian economists
Harvard University alumni
American University alumni
McCourt School of Public Policy alumni
Collars of the Order of Isabella the Catholic
Order of Merit of Duarte, Sánchez and Mella
20th-century Colombian economists
21st-century Colombian politicians |
Lebonah was a town near Shiloh, on the north side of Bethel, mentioned in the Hebrew Bible (). It has been identified with Al-Lubban ash-Sharqiya, to the south of Nablus.
In Hebrew, Lebonah means frankincense, and is used in this meaning in all other appearances in the Hebrew Bible. The nearby Israeli community of Ma'ale Levona, located near this site, takes its name from Lebonah.
References
Hebrew Bible cities |
```objective-c
#pragma once
namespace search::tensor {
class DistanceConverter {
public:
virtual ~DistanceConverter() = default;
/**
* Convert threshold (external distance units) to internal units.
*/
virtual double convert_threshold(double threshold) const noexcept = 0;
/**
* Convert internal distance to rawscore (also used as closeness).
*/
virtual double to_rawscore(double distance) const noexcept = 0;
/**
* Convert rawscore to external distance.
* Override this when the rawscore is NOT defined as (1.0 / (1.0 + external_distance)).
*/
virtual double to_distance(double rawscore) const noexcept {
return (1.0 / rawscore) - 1.0;
}
/**
* The minimum rawscore (also used as closeness) that this distance function can return.
*/
virtual double min_rawscore() const noexcept {
return 0.0;
}
};
}
``` |
```xml
import { defineMessages } from 'react-intl';
export const messages = defineMessages({
androidAppButtonUrl: {
id: 'voting.info.androidAppButtonUrl',
defaultMessage:
'!!!path_to_url
description: '"androidAppButtonUrl" for the Catalyst voting app',
},
appleAppButtonUrl: {
id: 'voting.info.appleAppButtonUrl',
defaultMessage:
'!!!path_to_url
description: '"appleAppButtonUrl" for the Catalyst voting app',
},
});
``` |
```c++
// Boost.Geometry (aka GGL, Generic Geometry Library)
// Unit Test
// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#include <boost/geometry/core/cs.hpp>
#include <boost/geometry/geometries/concepts/check.hpp>
struct ro_point
{
float x, y;
};
struct rw_point
{
float x, y;
};
namespace boost { namespace geometry { namespace traits {
template <> struct tag<ro_point> { typedef point_tag type; };
template <> struct coordinate_type<ro_point> { typedef float type; };
template <> struct coordinate_system<ro_point> { typedef cs::cartesian type; };
template <> struct dimension<ro_point> { enum { value = 2 }; };
template <> struct access<ro_point, 0>
{
static float get(ro_point const& p) { return p.x; }
};
template <> struct access<ro_point, 1>
{
static float get(ro_point const& p) { return p.y; }
};
template <> struct tag<rw_point> { typedef point_tag type; };
template <> struct coordinate_type<rw_point> { typedef float type; };
template <> struct coordinate_system<rw_point> { typedef cs::cartesian type; };
template <> struct dimension<rw_point> { enum { value = 2 }; };
template <> struct access<rw_point, 0>
{
static float get(rw_point const& p) { return p.x; }
static void set(rw_point& p, float value) { p.x = value; }
};
template <> struct access<rw_point, 1>
{
static float get(rw_point const& p) { return p.y; }
static void set(rw_point& p, float value) { p.y = value; }
};
}}} // namespace bg::traits
int main()
{
boost::geometry::concepts::check<const ro_point>();
boost::geometry::concepts::check<rw_point>();
}
``` |
Aosta (, , ; , formerly ; , Veulla or Ouhta ; ; ; ) is the principal city of the Aosta Valley, a bilingual region in the Italian Alps, north-northwest of Turin. It is situated near the Italian entrance of the Mont Blanc Tunnel, at the confluence of the Buthier and the Dora Baltea, and at the junction of the Great and Little St Bernard Pass routes.
History
Aosta was settled in proto-historic times and later became a centre of the Salassi, many of whom were killed or sold into slavery by the Romans in 25 BC. The campaign was led by Terentius Varro, who then founded the Roman colony of Augusta Praetoria Salassorum, housing 3,000 retired veterans. After 11 BC Aosta became the capital of the Alpes Graies ("Grey Alps") province of the Empire. Its position at the confluence of two rivers, at the end of the Great and the Little St Bernard Pass, gave it considerable military importance, and its layout was that of a Roman military camp.
After the fall of the Western Empire, the city was conquered, in turn, by the Burgundians, the Ostrogoths, and the Byzantines. The Lombards, who had annexed it to their Italian kingdom, were expelled by the Frankish Empire under Pepin the Short. Under his son, Charlemagne, Aosta acquired importance as a post on the Via Francigena, leading from Aachen to Italy. After 888 AD it was part of the renewed Kingdom of Italy under Arduin of Ivrea and Berengar of Friuli.
In the 10th century Aosta became part of the Kingdom of Burgundy. After the fall of the latter in 1032, it became part of the lands of Count Humbert I of Savoy.
The privilege of holding the assembly of the states-general was granted to the inhabitants in 1189. An executive council was nominated from this body in 1536, and continued to exist until 1802. After the Congress of Vienna restored the rule of Savoy it was reconstituted and formally recognized by Charles Albert of Sardinia, at the birth of his grandson Prince Amedeo, who was created duke of Aosta.
Climate
Aosta is in the rain shadow of the Mont Blanc massif and features a humid subtropical climate (Köppen: Cfa), bordering on a cool semi-arid climate (Köppen: BSk), also bordering on an oceanic climate (Köppen: Cfb) and under the Köppen climate classification due to its low average annual rainfall. It is considered temperate oceanic (Trewartha: Do) in the Trewartha climate classification.
The city experiences cool to very cold winters, hot summers and relatively dry conditions throughout the year.
Main sights
Prehistoric
Saint-Martin-de-Corléans Megalithic Area with artifacts and tombs dating to the Neolithic era.
Ancient remains
The ancient town walls of Augusta Prætoria Salassorum are still preserved almost in their entirety, enclosing a rectangle . They are high, built of concrete faced with small blocks of stone. At the bottom, the walls are nearly thick, and at the top .
Towers stand at angles to the enceinte and others are positioned at intervals, with two at each of the four gates, making twenty towers in total. They are roughly square, and project from the wall. Of the 20 original towers, the following are well preserved:
Tour du lépreux (French for Leper's Tower), was given this name after a leper called Pierre-Bernard Guasco was jailed there in the late 17th century. Le lépreux de la cité d'Aoste, a novel by Xavier de Maistre, is also named after this leper.
Tourneuve (13th century).
Tour du Pailleron.
Tower (Castle) of Bramafan, built in the 11th century over a Roman bastion. It was the residence of the Savoy viscounts. In Franco-Provençal, Bramé la fan means "To scream for hunger".
Tour du Baillage.
Tour Fromage.
The east and south gates exist intact. The latter, a double gate with three arches flanked by two towers known as the Porta Praetoria (1st century AD) was the eastern gate to the city, and has preserved its original forms apart from the marble covering. It is formed by two series of arches enclosing a small square.
The rectangular arrangement of the streets is modeled on a Roman plan dividing the town into 64 blocks (insulae). The main road, about wide, divides the city into two equal halves, running from east to west. This arrangement makes it clear that guarding the road was the main raison d'être of the city.
The Roman theatre, of which the southern façade remains today, is tall. The structure, dating from the late reign of Augustus, occupied an area of ; it could contain up to 4,000 spectators. In the nearby was the amphitheatre, built under Claudius. A marketplace surrounded by storehouses on three sides with a temple in the centre with two on the open (south) side, as well as a thermae, have also been discovered.
Outside the town walls is the Arch of Augustus, a triumphal arch in honour of Augustus, built in 35 BC to celebrate the victory of consul Varro Murena over the Salassi. About to the west is a single-arched Roman bridge, called the Pont d'Aël. It has a closed passage, lighted by windows for foot passengers in winter, and above it an open footpath.
There are considerable remains of the ancient road from Eporedia (modern Ivrea) to Augusta Praetoria into the Aosta Valley. The modern railway follows this route, notable for the Pont Saint-Martin, which has a single arch with a span of and a roadway wide; the cutting of Donnas; and the Roman bridges of Cillian (Saint-Vincent) and Aosta (Pont de Pierre).
Other sights
The Cathedral, built in the 4th century and replaced in the 11th century by a new edifice dedicated to the Madonna. It is annexed to the Roman Forum.
The Romanesque-Gothic Collegiate church of Saint Ursus (Saint-Ours). Its most evocative feature is the cloister, which can be entered through a hall on the left of the façade. It is dedicated to Ursus of Aosta.
The Saint-Bénin College, built about 1000 by the Benedictines. It is now an exhibition site.
The Bridge of Grand Arvou, a medieval arch bridge-aqueduct.
Transport
Aosta lies on the crossroad of two major trans-alpine trunk roads: national road 26 (Italian: SS26, French: RN26) connecting the city of Chivasso to Little St Bernard Pass on the Italy-France border, and national road 27 (Italian: SS27, French: RN27) connecting the city of Aosta to the Great St Bernard Pass on the Italy-Switzerland border. Aosta is also served by the A5 motorway between Turin and Courmayeur.
Aosta railway station, opened in 1886, forms part of the Chivasso–Ivrea–Aosta railway. Direct trains only connect Aosta up to the city of Ivrea. The branch line to nearby Pré-Saint-Didier, in the Valdigne, on the way towards Courmayeur was closed in 2015. Train service is operated by Trenitalia.
The main bus hub is located near the Aosta train station. Buses connect the city of Aosta to the nearby valleys and to destinations outside the region, including Turin, Milan, Chamonix (France) and Martigny (Switzerland).
Aosta airport is located 5 km to the east of the city.
Notable people
List of mayors of Aosta
Anselm of Aosta (1033–1109), Archbishop of Canterbury from 1093 to 1109.
Xavier de Maistre (1763–1852), writer of Le lépreux de la cité d'Aoste ("The leper from Aosta", 1811).
Laurent Cerise (1807–1869), a French physician born in Aosta
Innocenzo Manzetti (1826–1877), an Italian inventor born in Aosta.
Sport
René-Laurent Vuillermoz (born 1977), retired Italian Olympic biathlete
Nicole Gontier (born 1991), an Italian biathlete.
See also
Duke of Aosta
Franco-Provençal language - Valdôtain dialect.
Aostan French
:Category:Towers in Italy
:Category:Tribes involved in the Gallic Wars
Twin towns - sister cities
Aosta is twinned with:
Chamonix-Mont-Blanc, France
Kaolack, Senegal
Martigny, Switzerland
Narbonne, France
Sinaia, Romania
Notes
References
Inline citations
General references
Further reading
Lin Colliard, La vieille Aoste, éd. Musumeci, Aoste, 1972.
Aimé Chenal, Promenade archéologique de la ville d'Aoste, ITLA, Aoste, 1965.
Mauro Caniggia Nicolotti & Luca Poggianti, Aoste inconnue : traces cachées, oubliées ou invisibles de la vieille ville, typog. La Vallée, Aoste, 2010.
Carlo Promis, Le antichità di Aosta, (Turin, 1862);
Édouard Bérard, Atti della Società di Archeologia di Torino, iii. 119 seq.; Notizie degli Scavi, passim.
External links
Photos of Aosta
Virtual Museum Vallée (VMV), virtual museum of Aosta city
Augusta Praetoria Site plan & photos from the Aosta Valley Regional Authority.
Ancient Places TV: HD Video of Aosta, Italy
Cities and towns in Aosta Valley
Roman amphitheatres in Italy |
Joseph Ratuvakacereivalu (born 12 January 1999) is a Fiji international rugby league footballer who plays as a for Redcliffe Dolphins in the QLD Cup.
Background
Ratuvakacereivalu played his junior rugby league for Campbelltown City Kangaroos.
Playing career
Ratuvakacereivalu represented Fiji in the 2019 Oceania Cup.
References
External links
Western Suburbs Magpies profile
Fiji profile
1999 births
Living people
Fiji national rugby league team players
Redcliffe Dolphins players
Rugby league props
Western Suburbs Magpies NSW Cup players |
The Colbrand Baronetcy, of Boreham in the County of Sussex, was a title in the Baronetage of England. It was created on 21 December 1621 for John Colbrand. The title became extinct on the death of the fifth Baronet in 1709.
Colbrand baronets, of Boreham (1621)
Sir John Colbrand, 1st Baronet (died 1627)
Sir James Colbrand, 2nd Baronet (died )
Sir Richard Colbrand, 3rd Baronet (died 1664)
Sir Charles Colbrand, 4th Baronet (died 1667)
Sir Robert Colbrand, 5th Baronet (died 1709)
References
Extinct baronetcies in the Baronetage of England
1621 establishments in England |
```yaml
static_resources:
listeners:
- name: listener_0
address:
socket_address:
protocol: TCP
address: 0.0.0.0
port_value: 10000
filter_chains:
- filters:
- name: envoy.filters.network.http_connection_manager
typed_config:
"@type": type.googleapis.com/envoy.extensions.filters.network.http_connection_manager.v3.HttpConnectionManager
stat_prefix: ingress_http
route_config:
name: local_route
virtual_hosts:
- name: local_service
domains: ["*"]
routes:
- match:
prefix: "/"
route:
host_rewrite_literal: upstream.com
cluster: upstream_com
http_filters:
- name: envoy.filters.http.checksum
typed_config:
"@type": type.googleapis.com/envoy.extensions.filters.http.checksum.v3alpha.ChecksumConfig
reject_unmatched: true
checksums:
- path_matcher:
exact: /path/to/hashed.asset
sha256: your_sha256_hash
- path_matcher:
exact: /path/to/other-hashed.asset
sha256: your_sha256_hash
- name: envoy.filters.http.router
typed_config:
"@type": type.googleapis.com/envoy.extensions.filters.http.router.v3.Router
clusters:
- name: upstream_com
type: LOGICAL_DNS
# Comment out the following line to test on v6 networks
dns_lookup_family: V4_ONLY
lb_policy: ROUND_ROBIN
load_assignment:
cluster_name: service_upstream_com
endpoints:
- lb_endpoints:
- endpoint:
address:
socket_address:
address: upstream.com
port_value: 443
transport_socket:
name: envoy.transport_sockets.tls
typed_config:
"@type": type.googleapis.com/envoy.extensions.transport_sockets.tls.v3.UpstreamTlsContext
sni: upstream.com
``` |
```graphql
type Model1 {
data: String!
}
``` |
Deferribacter thermophilus is an iron-reducing bacteria. It is a manganese- and iron-reducing bacterium. It is thermophilic and anaerobic bacterium, its type strain being designated as strain BMAT. The cells are straight to bent rods (1 to 5 by 0.3 to 0.5 μm).
References
External links
LPSN
Type strain of Deferribacter thermophilus at BacDive - the Bacterial Diversity Metadatabase
Deferribacterota
Bacteria described in 1997 |
Cañoncito is an unincorporated community in Taos County, New Mexico, United States. Cañoncito is north-northwest of Taos.
References
Unincorporated communities in Taos County, New Mexico
Unincorporated communities in New Mexico |
Mary Smith (22 November 1909 – 25 November 1989) was an English-born Australian psychologist.
Early life
She was probably born at Liverpool in England, the daughter of storeman David Smith and Wilhelmina Fletcher, née McLean. The family moved to South Australia in 1911, settling in the suburbs of Birkenhead and Largs Bay North. She was educated at state schools and graduated from Adelaide High School in 1927 before studying at the University of Adelaide (Bachelor of Arts, 1930; Master of Arts, 1932), becoming a schoolteacher.
Career
As a teacher she became interested in "problem children", working as an honorary probation, officer with the Children's Court. In 1938 she was given a free passage to England to begin doctoral research in psychology at the Victoria University of Manchester on "the mental readjustment of the problem child". World War II disrupted Smith's career and she returned to Adelaide in 1940.
On her return Smith became assistant psychologist with the Department of Education, becoming departmental psychologist in 1942. She resigned in 1944 after campaigning vigorously and controversially for better salaries for female teachers, and established a private practice, becoming well known for her column in the Sunday Mail (1944–1969). She returned to the Victoria University of Manchester after winning the Catherine Helen Spence scholarship in 1945, studying "modern trends in child psychology and work with adolescents". She was the first South Australian woman to stand for the Senate, as an ungrouped independent at the 1949 federal election, she was unsuccessful.
Full-time child psychologist at the Adelaide Children's Hospital from 1953, Smith made progress with direct play therapy and was involved in the special education branch of the Department of Education. Considered a pioneering South Australian psychologist, she took a mentalistic approach which became outdated as behaviouralism came into vogue. She was also active in the community as president of the Young Women's Christian Association of Adelaide from 1950 to 1951. She died at North Adelaide in 1989.
References
1909 births
1989 deaths
Australian women psychologists
20th-century Australian women
20th-century British psychologists
English emigrants to Australia
Alumni of the Victoria University of Manchester
Scientists from Adelaide
University of Adelaide alumni
People educated at Adelaide High School
Australian schoolteachers |
Deividas Kizala (born 12 February 1998) is a Lithuanian ice dancer. With his skating partner, Paulina Ramanauskaitė, he competed at the 2022 Winter Olympics.
Career
Early years
As a single skater, Kizala was coached by Loreta Vitkauskienė and competed at two ISU Junior Grand Prix events in 2011.
By 2014, he had teamed up with Guostė Damulevičiūtė to compete in ice dancing. The two debuted their partnership at the Volvo Open Cup in November 2014. They would represent Lithuania at three ISU Junior Grand Prix (JGP) events and three consecutive World Junior Championships, from 2015 to 2017. They qualified to the free dance at the 2017 World Junior Championships and finished 17th overall. They also made several appearances in the senior ranks, most notably at the 2018 European Championships. They ended their partnership after four seasons together.
In the 2018–19 season, Kizala skated with American ice dancer Mira Polishook, representing Lithuania in the junior ranks. The duo competed at two JGP events and qualified to the final segment at the 2019 World Junior Championships, where they finished 19th. They parted ways after one season as a team.
Partnership with Ramanauskaitė
In 2020, Kizala teamed up with Paulina Ramanauskaitė to compete as seniors. The two made their international debut in December 2020, at the Winter Star in Minsk, Belarus.
Although Allison Reed / Saulius Ambrulevičius qualified a spot for Lithuania in ice dancing at the 2022 Winter Olympics, Reed's application for Lithuanian citizenship was unsuccessful. Following this decision, Ramanauskaitė/Kizala were nominated to fill the spot and placed 23rd at the Olympics.
Programs
With Ramanauskaitė
With Polishook
With Damulevičiūtė
Men's singles
Competitive highlights
CS: Challenger Series; JGP: Junior Grand Prix
Ice dance with Ramanauskaitė
Ice dance with Polishook
Ice dance with Damulevičiūtė
Men's singles
References
External links
Lithuanian male ice dancers
1998 births
Living people
Sportspeople from Kaunas
Figure skaters at the 2016 Winter Youth Olympics
Olympic figure skaters for Lithuania
Figure skaters at the 2022 Winter Olympics
Competitors at the 2023 Winter World University Games |
```swift
//
// SplitViewController.swift
// CleanseGithubBrowser
//
// Created by Mike Lewis on 6/12/16.
//
import UIKit
/// Common base class for UISplitViewController that has better default constructors
class SplitViewController : UISplitViewController {
init<RootVC: UIViewController>(masterViewController: RootVC) where RootVC: UISplitViewControllerDelegate {
super.init(nibName: nil, bundle: nil)
self.delegate = masterViewController
self.viewControllers = [UINavigationController(rootViewController: masterViewController)]
}
@available(*, unavailable)
required init?(coder aDecoder: NSCoder) {
fatalError("init(coder:) has not been implemented")
}
}
``` |
Mastaney is a 2023 Indian Punjabi-language historical action drama film. It stars Tarsem Jassar and Gurpreet Ghuggi in the lead role with Simi Chahal and Karamjit Anmol in supporting roles.
Plot
Set in 1739, Nader Shah's undefeated army was attacked by Sikh rebellions. Nader demands to arrest them but it doesn't work out. Five ordinary men are hired to play Sikh rebels but over time they learn what Sikhs are.
Cast
Tarsem Jassar as Zahoor
Gurpreet Ghuggi as Qalandar
Sameep Ranaut as Young Qalandar
Simi Chahal as Noor
Karamjit Anmol as Basheer
Honey Mattu as Zulfi
Baninder Bunny as Feena
Avtar Gill as Zakariya Khan Bahadur
Rahul Dev as Nader Shah
Arif Zakaria as Zakariya Khan's wazir
Release
Theatrical
The film was theatrically released worldwide on 25 August 2023 in Punjabi, along with dubbed versions Hindi, Telugu, Tamil and Marathi.
Reception
Critical reception
Jaspreet Nijher of The Times of India gave the rating of 4 out and wrote "The film is a huge effort for the Punjabi industry to emerge from the tag of comics. Though it requires more depth in its building up of the commoners to becoming warriors, the story engages with its grand cinematography and martial display in the climax. The music is another highlight that captures with its undertones of Mughal influence and Sikh hues." Sukhpreet Kahlon of The Indian Express gave 3.5 stars out of 5 and wrote "Beginning with a wide historical perspective that looks at the origins of Sikhism, Mastaney moves towards the rise of the Sikh empire. Placed within that perspective, it almost feels like an origin story, with stories of Maharaja Ranjit Singh and the glory of the Sikh empire to follow." Nidhi Pal of Amar Ujala gave 3 out of 5 and praised performances, cinematography but criticised music.
References
External links
2020s historical films
Indian historical films
Films about Sikhism
2020s Punjabi-language films |
Don Dodge (born 1957) is a Developer Advocate for Google, which requires that he helps developers build applications on the company's platforms. Prior to working at Google, Dodge was a start-up evangelist at Microsoft, where he was one of their most visible employees following Robert Scoble's departure in 2006.
Biography
Dodge received a Bachelor of Science from the University of Southern Maine, majoring in accounting. Afterward, he received an MBA from New Hampshire College (now Southern New Hampshire University). Following graduation, Dodge worked at a number of technology companies, including Digital Equipment, Forte Software, AltaVista, Napster, and Bowstreet. Afterward, he worked at Groove Networks. When the company was acquired by Microsoft, Dodge became Director of Business Development for Microsoft's Emerging Business Team. He was also known as a "start-up evangelist" for Microsoft. Focusing on the New England area and based in New Hampshire, Dodge often worked specifically with companies in the greater Boston area, to help them use Microsoft products for their companies. Dodge felt positively towards Ray Ozzie, CEO of Groove Networks, who replaced Bill Gates as Chief Software Architect at Microsoft following Gates' retirement announcement.
Dodge was laid off from Microsoft on November 5, 2009, and then he became a Developer Advocate for Google, where he helps developers build applications on Google's platforms, as well as help venture capitalists and start-up companies work with Google. After moving to Google, Dodge switched from using a Windows-based computer to a Mac-based one, a move which he enjoys greatly. In 2010, Dodge compared Google to Microsoft when it was a ten-year-old company, indicating that it still had a lot of growth ahead of it. Dodge writes a personal blog called "The Next Big Thing".
References
External links
Don Dodge's personal blog
Microsoft evangelists
Technology evangelists
Living people
Google employees
1957 births
University of Southern Maine alumni
Southern New Hampshire University alumni |
Yu opera (), or Yuju opera, sometimes known as Henan bangzi (), is one of China's famous national opera forms, alongside Peking opera, Yue opera, Huangmei opera and Pingju. Henan province is the origin of Yu opera. Henan's one-character abbreviation is "" (yù), and thus the opera style was officially named "" (Yùjù) after the founding of the People's Republic of China. The area where Yu opera is most commonly performed is in the region surrounding the Yellow River and Huai River. According to statistical figures, Yu opera was the leading opera genre in terms of the number of performers and troupes. While Yu opera is often called "Henan opera" in English, within Henan it is considered to be just one of the province's three most important forms of opera, the other two being Quju (曲剧) and Yuediao (越调).
Outside Henan, provinces and areas such as Hubei, Anhui, Jiangsu, Shandong, Hebei, Beijing, Shanxi, Shaanxi, Gansu, Qinghai, and Xinjiang all have professional Yu opera troupes. There is also a troupe in Kaohsiung, Taiwan. The history of Henan opera dates back to more than 200 years ago. The opera was widely spread in Henan province during the late Qing dynasty (1644–1911) and faced new development opportunities after the founding of the People's Republic of China in 1949. The opera spread across China and was ahead of the other 300 local operas in China before the mid-1980s. On May 20, 2006, Henan Opera was included in the first national intangible cultural heritage list batch.
History
Yu opera came into being during the late Ming and early Qing dynasties. At the beginning, it was mainly song arias without make-up, which was loved by the ordinary people. As a result, it developed rapidly. The origin of Yu opera is hard to trace, and the accounts about its origin differ. With regard to the origin and formation of Henan opera, there is a shortage of records in ancient books, and few scholars have sought to engage in in-depth and comprehensive exploration and research.
Since the 1920s and 1930s there have been multiple theories and viewpoints on the origin of the opera. There is no one theory that is generally agreed upon by researchers as there is not enough evidence to convince all people, so there are multiple similar and completely opposite arguments. Four major representative opinions concerning the origin of the opera are that they originate from Shanxi opera, from the folk society of Henan, from the operatic tune that is popular in the Central Plains area of China, and from the predecessor of Henan bangzi.
Henan Opera Art
Artistic characteristics
The art of Henan Opera is both ancient and modern, reconciliation hardness and softness, open-minded and generous, and has the beauty of "neutralization". Henan Opera is famous for singing. First of all, the Henan Opera singing is sonorous and powerful, magnificent, restrained, full of passionate and unrestrained masculinity, with strong emotional strength. Secondly, Henan Opera is sound, clear, natural, flesh and blood, and good at expressing the inner feelings of the characters. Moreover, the rhythm of Henan opera is distinct and strong, conflicts are sharp, and the story has a beginning and an end, coupled with humorous and cheerful tunes, which makes Henan opera not only suitable for performing easy comedy, it is also magnificent and suitable for playing emperors and generals of the big scene, western Henan euphemism, singing the sad is very suitable for playing sad drama. Henan Opera in the key plot is generally arranged with large plate singing, singing smooth, distinct rhythm, very challenging, generally clear words, easy to be heard by the audience, showing the unique charm of the Central Plains art.
Role
The role of Henan opera is composed of "Sheng Dan Jing Chou". Generally known as four sheng, four dan, and four painted faces. The organization's troupe is also four sheng, four dan, four painted faces, four soldiers, four generals, four maids, eight scenes, two boxes of officials, plus four handymen. The four are Zhengsheng, Ersheng, Xiao Sheng and Wu Sheng. Zhengsheng is also known as Hongsheng, Dasheng, and Dahongface; Ersheng is also known as two red faces, immediately red faces; Small born and then separated the baby born; Wu Sheng is also called Bian Sheng.
Tune types
There are four major types of Yu opera. Xiangfu tune opera is heard around Kaifeng; Yudong tune in the Shangqiu area. Yuxi tune is heard around Luoyang, and the Shahe tune around Luohe. Yudong and Yuxi are the main forms, with Yudong expressing comedy and Yuxi expressing tragedy. During the late Qing dynasty (1644–1911), Henan bangzi greatly expanded in Henan. Owing to different living habits, language characteristics, natural environment, cultural psychology, and aesthetic tastes, Henan bangzi changed from the repertoire to operatic tune in different regions of Henan. Therefore, four main tune types of Henan opera formed. The four types are centered on different regions in Henan province.
Famous people
The most famous Henan opera actors and actresses are Chang Xiangyu, Chen Suzhen, Cui Lantian, and Ma Jinfeng. Besides the four actresses mentioned, there are also some well-known actors such as Zhao Yiting, Tang Xicheng, and Li Sizhong.
Zhao Yiting (1995–1992), a member of the Chinese Theatre Association and director of the Henan Theatre Association. His artistic career spans more than 60 years and has made outstanding contributions to the theatrical career. He is an important figure in the history of Henan opera.
Tang Xicheng (1924–1993), a member of the Chinese Theatre Association, director of the Henan Theatre Association. The achievements of his artistic achievements contributed to the highest peak of the male character in Henan opera and Mr. Tang is a master of Henan opera.
Li Sizhong (1921–1996), a famous master of the Henan opera, the representative of the Heilian performer ("male character with darkish painted face") of Henan Opera.
Status quo and suggested solutions
As an important local opera genre among the numerous non-material cultural heritage related Chinese operas, however, Henan opera are facing a hard situation on the protection and development. As many other local operas, the future of Henan Opera is worrying due to the influence of commodity economy and the impact of modern lifestyles. The number of plays and urban audience has reduced, and the rural audience is dominated by the elderly. As for suggestions to improve the hard situation, Henan opera can establish a mutual benefit with tourism resource to appeal more audience. At the same time, the exploration and research of Henan opera materials can be enriched, the investment in the development of Henan opera can be increased, and the productization of Henan Opera tourism meets the need of the times. There are some specific strategies such as strengthening the tourism propaganda of Henan opera, building the characteristic brand of Henan opera culture, developing the Henan opera tourism experience project, holding the Henan opera festival, Cultivating the new force of Henan opera tourism, and exploring various development model of Henan opera tourism.
Footnotes
References |
Essential is a 1991 collection of hits by Australian rock band Divinyls. The album was released by Divinyls previous record label, and includes tracks from their first three studio albums.
Track listing
"Pleasure and Pain"
"Temperamental"
"Back to the Wall"
"Only Lonely"
"Punxsie"
"Don't You Go Walking"
"Boys in Town"
"Hey Little Boy"
"Science Fiction"
"Sleeping Beauty"
"Casual Encounter"
"I'll Make You Happy"
Charts
Certifications
References
1991 compilation albums
Divinyls compilation albums
EMI Records compilation albums |
```html
<html lang="en">
<head>
<title>AArch64 Directives - Using as</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="Using as">
<meta name="generator" content="makeinfo 4.11">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="AArch64_002dDependent.html#AArch64_002dDependent" title="AArch64-Dependent">
<link rel="prev" href="AArch64-Floating-Point.html#AArch64-Floating-Point" title="AArch64 Floating Point">
<link rel="next" href="AArch64-Opcodes.html#AArch64-Opcodes" title="AArch64 Opcodes">
<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="AArch64-Directives"></a>
Next: <a rel="next" accesskey="n" href="AArch64-Opcodes.html#AArch64-Opcodes">AArch64 Opcodes</a>,
Previous: <a rel="previous" accesskey="p" href="AArch64-Floating-Point.html#AArch64-Floating-Point">AArch64 Floating Point</a>,
Up: <a rel="up" accesskey="u" href="AArch64_002dDependent.html#AArch64_002dDependent">AArch64-Dependent</a>
<hr>
</div>
<h4 class="subsection">9.1.5 AArch64 Machine Directives</h4>
<p><a name="index-machine-directives_002c-AArch64-547"></a><a name="index-AArch64-machine-directives-548"></a>
<dl>
<!-- AAAAAAAAAAAAAAAAAAAAAAAAA -->
<p><a name=your_sha256_hash></a><dt><code>.arch </code><var>name</var><dd>Select the target architecture. Valid values for <var>name</var> are the same as
for the <samp><span class="option">-march</span></samp> commandline option.
<p>Specifying <code>.arch</code> clears any previously selected architecture
extensions.
<p><a name=your_sha256_hash2c-AArch64-550"></a><br><dt><code>.arch_extension </code><var>name</var><dd>Add or remove an architecture extension to the target architecture. Valid
values for <var>name</var> are the same as those accepted as architectural
extensions by the <samp><span class="option">-mcpu</span></samp> commandline option.
<p><code>.arch_extension</code> may be used multiple times to add or remove extensions
incrementally to the architecture being compiled for.
<!-- BBBBBBBBBBBBBBBBBBBBBBBBBB -->
<p><a name="index-g_t_0040code_007b_002ebss_007d-directive_002c-AArch64-551"></a><br><dt><code>.bss</code><dd>This directive switches to the <code>.bss</code> section.
<!-- CCCCCCCCCCCCCCCCCCCCCCCCCC -->
<!-- DDDDDDDDDDDDDDDDDDDDDDDDDD -->
<!-- EEEEEEEEEEEEEEEEEEEEEEEEEE -->
<!-- FFFFFFFFFFFFFFFFFFFFFFFFFF -->
<!-- GGGGGGGGGGGGGGGGGGGGGGGGGG -->
<!-- HHHHHHHHHHHHHHHHHHHHHHHHHH -->
<!-- IIIIIIIIIIIIIIIIIIIIIIIIII -->
<!-- JJJJJJJJJJJJJJJJJJJJJJJJJJ -->
<!-- KKKKKKKKKKKKKKKKKKKKKKKKKK -->
<!-- LLLLLLLLLLLLLLLLLLLLLLLLLL -->
<p><a name=your_sha256_hash2"></a><br><dt><code>.ltorg</code><dd>This directive causes the current contents of the literal pool to be
dumped into the current section (which is assumed to be the .text
section) at the current location (aligned to a word boundary).
GAS maintains a separate literal pool for each section and each
sub-section. The <code>.ltorg</code> directive will only affect the literal
pool of the current section and sub-section. At the end of assembly
all remaining, un-empty literal pools will automatically be dumped.
<p>Note - older versions of GAS would dump the current literal
pool any time a section change occurred. This is no longer done, since
it prevents accurate control of the placement of literal pools.
<!-- MMMMMMMMMMMMMMMMMMMMMMMMMM -->
<!-- NNNNNNNNNNNNNNNNNNNNNNNNNN -->
<!-- OOOOOOOOOOOOOOOOOOOOOOOOOO -->
<!-- PPPPPPPPPPPPPPPPPPPPPPPPPP -->
<p><a name=your_sha256_hash></a><br><dt><code>.pool</code><dd>This is a synonym for .ltorg.
<!-- QQQQQQQQQQQQQQQQQQQQQQQQQQ -->
<!-- RRRRRRRRRRRRRRRRRRRRRRRRRR -->
<p><a name="index-g_t_0040code_007b_002ereq_007d-directive_002c-AArch64-554"></a><br><dt><var>name</var><code> .req </code><var>register name</var><dd>This creates an alias for <var>register name</var> called <var>name</var>. For
example:
<pre class="smallexample"> foo .req w0
</pre>
<!-- SSSSSSSSSSSSSSSSSSSSSSSSSS -->
<!-- TTTTTTTTTTTTTTTTTTTTTTTTTT -->
<!-- UUUUUUUUUUUUUUUUUUUUUUUUUU -->
<p><a name=your_sha256_hash5"></a><br><dt><code>.unreq </code><var>alias-name</var><dd>This undefines a register alias which was previously defined using the
<code>req</code> directive. For example:
<pre class="smallexample"> foo .req w0
.unreq foo
</pre>
<p>An error occurs if the name is undefined. Note - this pseudo op can
be used to delete builtin in register name aliases (eg 'w0'). This
should only be done if it is really necessary.
<!-- VVVVVVVVVVVVVVVVVVVVVVVVVV -->
<!-- WWWWWWWWWWWWWWWWWWWWWWWWWW -->
<!-- XXXXXXXXXXXXXXXXXXXXXXXXXX -->
<!-- YYYYYYYYYYYYYYYYYYYYYYYYYY -->
<!-- ZZZZZZZZZZZZZZZZZZZZZZZZZZ -->
<p><a name=your_sha256_hash6"></a><br><dt><code>.xword</code><dd>The <code>.xword</code> directive produces 64 bit values.
</dl>
</body></html>
``` |
```coffeescript
cx = require 'classnames'
xss = require 'xss'
React = require 'react'
recorder = require 'actions-recorder'
Immutable = require 'immutable'
PureRenderMixin = require 'react-addons-pure-render-mixin'
assign = require 'object-assign'
query = require '../query'
mixinMessageHandler = require '../mixin/message-handler'
mixinMessageContent = require '../mixin/message-content'
lang = require '../locales/lang'
detect = require '../util/detect'
format = require '../util/format'
notifyActions = require '../actions/notify'
routerHandlers = require '../handlers/router'
QuoteSlim = React.createFactory require './quote-slim'
FileGlance = React.createFactory require './file-glance'
MessageToolbar = React.createFactory require './message-toolbar'
MessageAttachmentSlim = React.createFactory require './message-attachment-slim'
MessageInlineEditor = React.createFactory require './message-inline-editor'
RelativeTime = React.createFactory require '../module/relative-time'
MessageRichSpeech = React.createFactory require '../module/message-rich-speech'
a = React.createFactory 'a'
div = React.createFactory 'div'
span = React.createFactory 'span'
strong = React.createFactory 'strong'
L = lang.getText
T = React.PropTypes
module.exports = React.createClass
displayName: 'message-slim'
mixins: [mixinMessageHandler, mixinMessageContent, PureRenderMixin]
propTypes:
isDuplicated: T.bool
isUnread: T.bool
selected: T.bool
showActions: T.bool
onClick: T.func
onFileClick: T.func.isRequired
message: T.instanceOf(Immutable.Map)
isEditMode: T.bool
getDefaultProps: ->
isDuplicated: false
isUnread: false
selected: false
showActions: false
isEditMode: false
onClick: ->
@props.onClick? @props.message.get('_id')
renderAttachmentRTF: ->
return if not @props.message.get('attachments')?.size and @props.message.get('attachments').get(0).get('category') isnt 'rtf'
attachment = @props.message.get('attachments').get(0)
maybeImage = detect.imageUrlInHtml attachment.data.text
html = format.htmlAsText attachment.data.text
textLength = html.trim().length
content = format.textAsAbbr html
div onClick: @onPostViewerShow,
span className: 'slim-post-text',
if textLength is 0 and maybeImage then L('images-only') else content
renderAttachmentQuote: ->
return if not @props.message.get('attachments')?.size and @props.message.get('attachments').get(0).get('category') isnt 'quote'
renderMessageAuthor: ->
div className: 'avator',
strong ref: 'author', className: 'name', onClick: @onAuthorClick,
@getAuthorName()
renderMessageBody: ->
div className: 'container',
if @props.message.get('body')?.length > 0
@renderContent()
@renderMessageAttachment()
renderMessageAttachment: ->
return if not @props.message.get('attachments')?.size
div className: 'attachment',
@props.message.get('attachments').map (attachment, index) =>
data = attachment.get('data')
switch attachment.get('category')
when 'file'
FileGlance key: index, progress: attachment.get('progress'), file: data, onClick: => @props.onFileClick(attachment)
when 'quote'
QuoteSlim key: index, quote: data, onClick: @onQuoteRedirect
when 'rtf'
QuoteSlim key: index, quote: data, onClick: @onPostViewerShow
when 'snippet'
QuoteSlim key: index, quote: data, onClick: @onSnippetViewerShow
when 'speech'
MessageRichSpeech
key: index
source: data.get('previewUrl')
duration: data.get('duration')
isUnread: @props.isUnread
when 'message'
_roomId = attachment.getIn(['data', 'room', '_id'])
_teamId = attachment.getIn(['data', '_teamId'])
_messageId = attachment.getIn(['data', '_id'])
onClick = ->
topics = query.topicsBy(recorder.getState(), _teamId)
if topics.map((room) -> room.get('_id')).includes(_roomId)
routerHandlers.room _teamId, _roomId, {search: _messageId}
else
notifyActions.info(lang.getText('topic-not-exists'))
MessageAttachmentSlim
key: index
message: data
onClick: onClick
renderMessageSide: ->
div className: 'side static-line',
MessageToolbar message: @props.message
RelativeTime data: (@props.message.get('updatedAt') or @props.message.get('createdAt'))
renderSlimBody: ->
# in case of empty link title
firstAttachment = @props.message.getIn(['attachments', 0]) or Immutable.Map()
quoteTitle = firstAttachment.getIn(['data', 'title'])
quoteText = firstAttachment.getIn(['data', 'title'])
quoteContent = if quoteText then format.textAsAbbr format.htmlAsText quoteText else undefined
div className: 'body',
if @props.message.get('attachments')?.get(0).get('data')?.get('text').size
@renderSlimPost()
else if @props.message.get('attachments')?.get(0).get('data')?.get('category') is 'file'
undefined
else
@renderContent()
div className: 'actions static-line',
MessageToolbar message: @props.message
RelativeTime data: (@props.message.get('updatedAt') or @props.message.get('createdAt'))
if firstAttachment.get('category') is 'file'
FileGlance file: firstAttachment.get('data'), onClick: => @props.onFileClick(firstAttachment)
if @props.message.get('attachments')?.get(0).get('category') is 'speech'
MessageRichSpeech
source: firstAttachment.getIn(['data', 'previewUrl'])
isUnread: @props.isUnread
duration: firstAttachment.getIn(['data', 'duration'])
if firstAttachment.get('category') is 'quote'
if firstAttachment.getIn(['data', 'redirectUrl'])?
onClick = -> window.open firstAttachment.getIn(['data', 'redirectUrl'])
else
onClick = -> return false
div className: 'quote line', onClick: onClick,
if firstAttachment.getIn(['data', 'authorName'])?
span className: 'author', firstAttachment.getIn(['data', 'authorName'])
if firstAttachment.getIn(['data', 'title'])?
span className: 'short text muted', (format.htmlAsText quoteTitle)
if quoteContent
div className: 'content', quoteContent
renderInlineMessageEditor: ->
MessageInlineEditor
message: @props.message
renderMessage: ->
return if not @props.message?
_userId = query.userId(recorder.getState())
messageReceiptData = @getMessageReceiptData()
isDuplicated = @props.isDuplicated and not @props.isEditMode
classMessage = cx 'message-slim', messageReceiptData.class,
'is-duplicated': isDuplicated
'be-mine': @props.message.getIn(['creator', '_id']) is _userId
'is-robot': @props.message.getIn(['creator', 'isRobot'])
'is-selected': @props.selected
'is-local': @props.message.get('isLocal')
props = assign
className: classMessage
onClick: @onClick
, messageReceiptData.props
div props,
unless isDuplicated
@renderMessageAuthor()
if @props.isEditMode
@renderInlineMessageEditor()
else
@renderMessageBody()
@renderMessageSide()
@renderMemberCard()
@renderPostViewer()
@renderSnippetViewer()
render: ->
@renderMessage()
``` |
Bruce Channel ( ; born November 28, 1940) is an American singer-songwriter best known for his 1962 number-one hit record "Hey! Baby".
Career
Channel performed originally for the radio program Louisiana Hayride and then joined with the harmonica player Delbert McClinton, singing country music. Channel wrote "Hey! Baby" with Margaret Cobb in 1959 and performed the song for two years before recording it for Fort Worth record producer Bill Smith. It was issued originally on Smith's LeCam label, but as it started to sell well, it was acquired for distribution by Smash Records, a subsidiary of Mercury. The song went to number one in the US in March 1962 and held that position for three weeks. Besides topping the U.S. popular music charts, it also became number two in the United Kingdom. It sold more than one million copies and was awarded a gold disc. Channel had four more singles on the Billboard Hot 100, including "Number One Man" (which peaked at number 52), "Come On Baby" (number 98), "Going Back to Louisiana" (number 89), and "Mr. Bus Driver" (number 90, produced by Dale Hawkins in Memphis and recorded by Terry Manning), but none of them was as successful as "Hey! Baby", and he is considered a one-hit wonder.
Channel toured Europe and was assisted at one gig by the Beatles, who were then little known. John Lennon, who had "Hey! Baby" on his jukebox, was fascinated by McClinton's harmonica. A popular legend is that Lennon was taught to play harmonica by McClinton, but by that time Lennon had already been playing the instrument live for some time. The harmonica segment in "Hey! Baby" inspired Lennon's playing on the Beatles' first single, 1962's "Love Me Do", as well as later Beatles records, and the harmonica break on Frank Ifield's "I Remember You."
Channel's only other top 40 recording in the UK Singles Chart was "Keep On" (June 1968), which reached number 12; it was written by Wayne Carson Thompson and produced by Dale Hawkins. "Keep On" also charted in Australia. Channel disliked touring, so he settled as a songwriter in Nashville, scoring a number of Broadcast Music Incorporated award-winning songs during the 1970s and 1980s – "As Long As I'm Rockin' with You", for John Conlee; "Don't Worry 'bout Me Baby", for Janie Fricke; "Party Time", for T. G. Sheppard; "You're the Best", for Kieran Kane; and "Stand Up", for Mel McDaniel. In 1987, "Hey! Baby" was featured in the popular movie Dirty Dancing.
In 1995, Channel recorded his cover of the song "Stand Up" for the Memphis-based record label Ice House. Delbert McClinton reprised his harmonica role on it and several other tracks, including another version of "Hey! Baby". Channel then recorded a project in 2002 with the singer-songwriter Larry Henley (ex-Newbeats), billed as Original Copy.
Channel was inducted into the Rockabilly Hall of Fame. He continues to perform in cruises with other 1960s musicians.
See also
List of 1960s one-hit wonders in the United States
List of artists who reached number one in the United States
List of performers on Top of the Pops
References
External links
American country singer-songwriters
American male singer-songwriters
1940 births
Living people
People from Jacksonville, Texas
Charay Records artists
Apex Records artists
Smash Records artists
King Records artists
Singer-songwriters from Texas
Country musicians from Texas |
"My Old Man" is a song by American country music band Zac Brown Band. The song is the lead single to their fifth major-label studio album, Welcome Home. The song was written by Zac Brown, Niko Moon and Ben Simonetti.
Content and history
The song is a ballad about Zac Brown's own father, and the lifestyle examples set by him. It features "the band's harmony-heavy vocals, which drive forward a scaled-back arrangement of unplugged guitar, fiddle and light strings". In the song's first verse, the narrator reflects on his own childhood, while the second focuses on the narrator's adulthood, and the third "reveals that his father is hearing this tribute from heaven, not earth."
The song is the band's first release through the Elektra Records label, in partnership with their own label, Southern Ground. It is also their first release to be produced by record producer Dave Cobb. Along with the release of the single, the band released a lyric video to YouTube which includes pictures of the band members with their fathers.
Music video
The music video was directed by Markus Blunder and premiered on CMT, GAC and VEVO in May 2017.
Critical reception
Billy Dukes of Taste of Country gave a favorable review, saying that "The raw, acoustic ballad has flaws and genuine emotion" and "It’s difficult to hear 'My Old Man' as anything less than a confessional — never have the Zac Brown Band released a single this personal." Kevin John Coyne of Country Universe rated the song "A", praising the lyrics and Brown's vocal performance, adding, "I appreciate Brown’s ability to capture deep and difficult feelings without descending into maudlin sentimentality. I think he gets at an essential truth about losing a parent. In one way, they’re gone, but in another way, they’re more present than they’ve ever been, because they are always in your mind and in your heart." The song earned the band a Grammy nomination for Best Country Duo/Group Performance.
Chart performance
The song debuted at No. 26 on the Country Airplay chart dated for February 18, 2017, and No. 49 on the Hot Country Songs chart for the same date. It is their second-highest debut on the former chart, behind "Homegrown", which entered at the No. 23 position in January 2015. The song has sold 197,000 copies in the United States as of June 2017.
Weekly charts
Year-end charts
References
2017 songs
2017 singles
Elektra Records singles
Songs about fathers
Songs written by Zac Brown
Songs written by Niko Moon
Zac Brown Band songs
Song recordings produced by Dave Cobb
Country ballads |
```xml
// empty file (fakes no controllers)
``` |
Dębowo is a village in the administrative district of Gmina Sierpc, within Sierpc County, Masovian Voivodeship, in east-central Poland. It lies approximately south of Sierpc and north-west of Warsaw.
References
Villages in Sierpc County |
Escuela Deportiva Municipal de Fútbol Churra is a Spanish football team based in Churra, in the Region of Murcia. Founded in 2009, it plays in Tercera División – Group 13, holding home matches at Campo Municipal de Churra.
Season to season
5 seasons in Tercera División
References
External links
La Preferente team profile
Soccerway team profile
Football clubs in the Region of Murcia
Sports clubs and teams in the Region of Murcia
Association football clubs established in 2009
2009 establishments in Spain |
Jim M. Nichols is American college administrator and former football coach. He was the first head football coach at Faulkner University in Montgomery, Alabama, leading the Faulkner Eagles in its first two seasons of play, 2007 and 2008. Nichols was hired at Faulkner in 2006 following three seasons as a graduate assistant at Auburn University, where he worked under head football coach Tommy Tuberville.
Nichols was the athletics director at Mount Dora Christian Academy in Mount Dora, Florida from 2015 to 2018 and was the school's head football coach in 2016. He resigned in December 2018 to take a job as Assistant Athletic Director and Chief of Staff for Liberty University in Lynchburg, Virginia. Nichols is now the Vice President of University and Athletic development for Liberty University.
Nichols was born in Camden, Arkansas and grew up in Searcy, Arkansas, where he went to Searcy High School and graduated from Harding University.
Head coaching record
College
References
External links
Liberty University profile
Liberty football profile
1975 births
Living people
Auburn Tigers football coaches
Faulkner Eagles football coaches
Texas Tech Red Raiders football coaches
Troy Trojans football coaches
High school football coaches in Florida
Harding University alumni
People from Camden, Arkansas
People from Searcy, Arkansas
Coaches of American football from Arkansas |
The Wolkramshausen–Erfurt railway is a 71 kilometre-long single-track main line railway in the German state of Thuringia, which is served only by regional services.
History
The construction of the Erfurt-Nordhausen railway was constructed in accordance with a treaty between Prussia and the Principality of Schwarzburg-Sondershausen signed on 21 December 1866. Agreements were reached for the provision of government investment and guarantees from Schwarzburg-Sondershausen and the adjacent districts and cities of Prussia so that the Nordhausen-Erfurter Eisenbahn (Nordhausen-Erfurt Railway, NEE) company could be founded on 24 April 1867 and it received a licence for the project from Schwarzburg-Sondershausen on 17 June 1867. The aim of the railway construction was to connect the cities of Nordhausen and Erfurt (both in the Prussian Province of Saxony at that time), and at the same time establish the first rail connection to part of the Schwarzburg-Sondershäuser Unterherrschaft (under dominion), which was the northern part of the principality of Schwarzburg-Sondershausen.
The line was built by a consortium of the companies of Plessner, Schultze and Steinfeld of Berlin and was opened on 17 August 1869. It ran for its first eight kilometres from Nordhausen to Wolkramshausen along the Halle–Kassel railway towards Eichenberg and Kassel, though on a second track built for the line, reached the Residenzstadt (royal capital) of Sondershausen and further south crossed the Hainleite ridge and ran by Greußen and Straußfurt to the state capital of Erfurt, where it ended at the station of the Thuringian Railway. Later several branches and connecting lines branched off the line. The Kyffhäuser Railway branched off from Sondershausen to Bad Frankenhausen from 1898. The Hohenebra-Ebeleben railway was opened from Hohenebra in 1883 and the Greußen-Ebeleben-Keula railway was opened from Greußen in 1901, connecting to Ebeleben and Keula. The Ballstädt–Straußfurt railway (opened from 1889 to 1906) and the Straußfurt–Großheringen railway (opened in 1874) branched off from Straußfurt and the Erfurt–Bad Langensalza railway (opened in 1897) branched off from Kühnhausen.
Following the nationalisation of private railways in Prussia and because the line's profits were below expectations as a result of growing competition from other railways, the company agreed to be bought by the Prussian State, which took control on 1 January 1887. The company was dissolved and its assets were placed under the railway division (Eisenbahndirektion) of Frankfurt, but was soon transferred to the railway division of Erfurt.
Planning
It is planned to upgrade the line from Nordhausen and Erfurt to allow a line speed of 120 km/h. It is envisaged that travel time will be reduced to less than an hour and services will connect to the Intercity-Express line to the south. In Kühnhausen provision will be made for the coupling of railcars from Bad Langensalza. The first section between Wolkramshausen and Sondershausen was scheduled to be completed by the end of 2013 but was delayed until 2014.
Passenger services
1880: three pairs of trains per day, running time: 2:18.
1913: six pairs of trains per day, including 2 pairs of express trains, running time: 1:27.
1936: 9 pairs of trains per day, including 2 pairs of express trains, running time: 1:40.
2006: KBS 601, hourly services, every second services was a Regional-Express (RE), running time: 1:19.
2009: up to 17 pairs of services daily with additional services between Nordhausen and Sondershausen during peak hours, hourly services, every second service is an RE, running time: 1:15.
Notes
References
Railway lines in Thuringia
Defunct railway companies of Germany
Railway lines opened in 1869
Buildings and structures in Erfurt
Buildings and structures in Gotha (district) |
```c++
/*
*
* This program is free software: you can redistribute it and/or modify
* the Free Software Foundation, either version 2 or (at your option)
*
* 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, see <path_to_url
*/
#include "NewDatabaseWizardPage.h"
#include "ui_NewDatabaseWizardPage.h"
#include "core/Database.h"
#include "gui/dbsettings/DatabaseSettingsWidget.h"
NewDatabaseWizardPage::NewDatabaseWizardPage(QWidget* parent)
: QWizardPage(parent)
, m_ui(new Ui::NewDatabaseWizardPage())
{
m_ui->setupUi(this);
}
NewDatabaseWizardPage::~NewDatabaseWizardPage() = default;
/**
* Set the database settings page widget for this wizard page.
* The wizard page will take ownership of the settings page widget.
*
* @param page database settings page widget
*/
void NewDatabaseWizardPage::setPageWidget(DatabaseSettingsWidget* page)
{
m_pageWidget = page;
m_ui->pageContent->setWidget(m_pageWidget);
}
/**
* @return database settings widget of this page widget.
*/
DatabaseSettingsWidget* NewDatabaseWizardPage::pageWidget()
{
return m_pageWidget;
}
/**
* Set the database to be configured by the wizard page.
* The wizard will NOT take ownership of the database object.
*
* @param db database object to be configured
*/
void NewDatabaseWizardPage::setDatabase(QSharedPointer<Database> db)
{
m_db = std::move(db);
}
void NewDatabaseWizardPage::initializePage()
{
Q_ASSERT(m_pageWidget && m_db);
if (!m_pageWidget || !m_db) {
return;
}
m_pageWidget->loadSettings(m_db);
}
bool NewDatabaseWizardPage::validatePage()
{
Q_ASSERT(m_pageWidget && m_db);
if (!m_pageWidget || !m_db) {
return false;
}
bool valid = m_pageWidget->saveSettings();
m_pageWidget->uninitialize();
return valid;
}
``` |
```c
/* _Feraise function */
#include <yvals.h>
#include <errno.h>
#include <ymath.h>
_C_STD_BEGIN
#ifdef _Feraise
#undef _Feraise
#endif
void __CLRCALL_PURE_OR_CDECL _Feraise(int except)
{ /* report floating-point exception */
if ((except & (_FE_DIVBYZERO | _FE_INVALID)) != 0)
errno = EDOM;
else if ((except & (_FE_UNDERFLOW | _FE_OVERFLOW)) != 0)
errno = ERANGE;
}
_C_STD_END
/*
* Consult your license regarding permissions and restrictions.
V6.50:0009 */
``` |
```c++
/*=============================================================================
file LICENSE_1_0.txt or copy at path_to_url
=============================================================================*/
// this file deliberately contains non-ascii characters
// boostinspect:noascii
#include <boost/detail/lightweight_test.hpp>
#include <boost/spirit/home/x3.hpp>
#include <boost/fusion/include/vector.hpp>
#include <boost/fusion/include/at.hpp>
#include <string>
#include <cstring>
#include <iostream>
#include "test.hpp"
namespace x3 = boost::spirit::x3;
int got_it = 0;
struct my_rule_class
{
template <typename Iterator, typename Exception, typename Context>
x3::error_handler_result
on_error(Iterator&, Iterator const& last, Exception const& x, Context const& context)
{
std::cout
<< "Error! Expecting: "
<< x.which()
<< ", got: \""
<< std::string(x.where(), last)
<< "\""
<< std::endl
;
return x3::error_handler_result::fail;
}
template <typename Iterator, typename Attribute, typename Context>
inline void
on_success(Iterator const&, Iterator const&, Attribute&, Context const&)
{
++got_it;
}
};
int
main()
{
using spirit_test::test_attr;
using spirit_test::test;
using namespace boost::spirit::x3::ascii;
using boost::spirit::x3::rule;
using boost::spirit::x3::int_;
using boost::spirit::x3::lit;
{ // show that ra = rb and ra %= rb works as expected
rule<class a, int> ra;
rule<class b, int> rb;
int attr;
auto ra_def = (ra %= int_);
BOOST_TEST(test_attr("123", ra_def, attr));
BOOST_TEST(attr == 123);
auto rb_def = (rb %= ra_def);
BOOST_TEST(test_attr("123", rb_def, attr));
BOOST_TEST(attr == 123);
auto rb_def2 = (rb = ra_def);
BOOST_TEST(test_attr("123", rb_def2, attr));
BOOST_TEST(attr == 123);
}
{ // show that ra %= rb works as expected with semantic actions
rule<class a, int> ra;
rule<class b, int> rb;
int attr;
auto f = [](auto c){};
auto ra_def = (ra %= int_[f]);
BOOST_TEST(test_attr("123", ra_def, attr));
BOOST_TEST(attr == 123);
auto ra_def2 = (rb = (ra %= int_[f]));
BOOST_TEST(test_attr("123", ra_def2, attr));
BOOST_TEST(attr == 123);
}
{ // std::string as container attribute with auto rules
std::string attr;
// test deduced auto rule behavior
auto text = rule<class text, std::string>()
= +(!char_(')') >> !char_('>') >> char_);
attr.clear();
BOOST_TEST(test_attr("x", text, attr));
BOOST_TEST(attr == "x");
}
{ // error handling
auto r = rule<my_rule_class, char const*>()
= '(' > int_ > ',' > int_ > ')';
BOOST_TEST(test("(123,456)", r));
BOOST_TEST(!test("(abc,def)", r));
BOOST_TEST(!test("(123,456]", r));
BOOST_TEST(!test("(123;456)", r));
BOOST_TEST(!test("[123,456]", r));
BOOST_TEST(got_it == 1);
}
{
typedef boost::variant<double, int> v_type;
auto r1 = rule<class r1, v_type>()
= int_;
v_type v;
BOOST_TEST(test_attr("1", r1, v) && v.which() == 1 &&
boost::get<int>(v) == 1);
typedef boost::optional<int> ov_type;
auto r2 = rule<class r2, ov_type>()
= int_;
ov_type ov;
BOOST_TEST(test_attr("1", r2, ov) && ov && boost::get<int>(ov) == 1);
}
// test handling of single element fusion sequences
{
using boost::fusion::vector;
using boost::fusion::at_c;
auto r = rule<class r, vector<int>>()
= int_;
vector<int> v(0);
BOOST_TEST(test_attr("1", r, v) && at_c<0>(v) == 1);
}
{ // attribute compatibility test
using boost::spirit::x3::rule;
using boost::spirit::x3::int_;
auto const expr = int_;
short i;
BOOST_TEST(test_attr("1", expr, i) && i == 1); // ok
const rule< class int_rule, int > int_rule( "int_rule" );
auto const int_rule_def = int_;
auto const start = int_rule = int_rule_def;
short j;
BOOST_TEST(test_attr("1", start, j) && j == 1); // error
}
return boost::report_errors();
}
``` |
Daniel Augustus Simmons is an author known for creating self-psychology literature. An example of his work is "The Realization System," self-published by Judge Simmons during the 1920s in the US as a Private Course of 12 Lessons in Practical Psychology, and published in book form in the U.K. some years later. (1936, Psychology Publishing Co. Manchester), and now available in audio and ebook form.
Another text by Judge Simmons which is now available in the public domain is The Science of Religion: Fundamental Faiths Expressed In Modern Terms (1916).
Concepts covered in this author's work include The Law of Attraction, made famous in recent years by the resurgence of interest in Charles F. Haanel and his most popular work The Master Key System and Subconscious programming through auto-suggestion.
References
Daniel A. Simmons - The Realization System
Daniel A. Simmons - The Science Of Religion
British motivational writers
Living people
Year of birth missing (living people) |
```c
/*
* Program write.c - dump memory structures to file for iso9660 filesystem.
Written by Eric Youngdale (1993).
This program is free software; you can redistribute it and/or modify
the Free Software Foundation; either version 2, or (at your option)
any later version.
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., 675 Mass Ave, Cambridge, MA 02139, USA. */
/* APPLE_HYB James Pearson j.pearson@ge.ucl.ac.uk 16/3/1999 */
#include <string.h>
#include <stdlib.h>
#include <err.h>
#include "config.h"
#include "mkisofs.h"
#include "iso9660.h"
#include "volume.h"
#include "write.h"
#include "apple_proto.h"
#include "mac_label_proto.h"
#include <time.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef __SVR4
extern char * strdup(const char *);
#endif
#ifdef VMS
extern char * strdup(const char *);
#endif
/* Max number of sectors we will write at one time */
#define NSECT 16
/* Counters for statistics */
static int table_size = 0;
static int total_dir_size = 0;
static int rockridge_size = 0;
static struct directory ** pathlist;
static int next_path_index = 1;
static int sort_goof;
struct output_fragment * out_tail;
struct output_fragment * out_list;
struct iso_primary_descriptor vol_desc;
#ifdef APPLE_HYB
static int hfs_pad;
#endif /* APPLE_HYB */
static int root_gen __PR((void));
static int generate_path_tables __PR((void));
static int file_gen __PR((void));
static int dirtree_dump __PR((void));
/* Routines to actually write the disc. We write sequentially so that
we could write a tape, or write the disc directly */
#define FILL_SPACE(X) memset(vol_desc.X, ' ', sizeof(vol_desc.X))
void FDECL2(set_721, char *, pnt, unsigned int, i)
{
pnt[0] = i & 0xff;
pnt[1] = (i >> 8) & 0xff;
}
void FDECL2(set_722, char *, pnt, unsigned int, i)
{
pnt[0] = (i >> 8) & 0xff;
pnt[1] = i & 0xff;
}
void FDECL2(set_723, char *, pnt, unsigned int, i)
{
pnt[3] = pnt[0] = i & 0xff;
pnt[2] = pnt[1] = (i >> 8) & 0xff;
}
void FDECL2(set_731, char *, pnt, unsigned int, i)
{
pnt[0] = i & 0xff;
pnt[1] = (i >> 8) & 0xff;
pnt[2] = (i >> 16) & 0xff;
pnt[3] = (i >> 24) & 0xff;
}
void FDECL2(set_732, char *, pnt, unsigned int, i)
{
pnt[3] = i & 0xff;
pnt[2] = (i >> 8) & 0xff;
pnt[1] = (i >> 16) & 0xff;
pnt[0] = (i >> 24) & 0xff;
}
int FDECL1(get_733, char *, p)
{
return ((p[0] & 0xff)
| ((p[1] & 0xff) << 8)
| ((p[2] & 0xff) << 16)
| ((p[3] & 0xff) << 24));
}
void FDECL2(set_733, char *, pnt, unsigned int, i)
{
pnt[7] = pnt[0] = i & 0xff;
pnt[6] = pnt[1] = (i >> 8) & 0xff;
pnt[5] = pnt[2] = (i >> 16) & 0xff;
pnt[4] = pnt[3] = (i >> 24) & 0xff;
}
void FDECL4(xfwrite, void *, buffer, int, count, int, size, FILE *, file)
{
/*
* This is a hack that could be made better. XXXIs this the only place?
* It is definitely needed on Operating Systems that do not
* allow to write files that are > 2GB.
* If the system is fast enough to be able to feed 1400 KB/s
* writing speed of a DVD-R drive, use stdout.
* If the system cannot do this reliable, you need to use this
* hacky option.
*/
static int idx = 0;
if (split_output != 0 &&
(idx == 0 || ftell(file) >= (1024 * 1024 * 1024) )) {
char nbuf[512];
extern char *outfile;
if (idx == 0)
unlink(outfile);
snprintf(nbuf, sizeof nbuf, "%s_%02d", outfile, idx++);
file = freopen(nbuf, "wb", file);
if (file == NULL) {
fprintf(stderr, "Cannot open '%s'.\n", nbuf);
exit(1);
}
}
while(count)
{
int got = fwrite(buffer,size,count,file);
if(got<=0)
{
fprintf(stderr,"cannot fwrite %d*%d\n",size,count);
exit(1);
}
count-=got,*(char**)&buffer+=size*got;
}
}
#ifdef APPLE_HYB
/* use the deferred_write struct to store info about the hfs_boot_file */
static struct deferred_write mac_boot;
#endif /* APPLE_HYB */
static struct deferred_write * dw_head = NULL, * dw_tail = NULL;
unsigned int last_extent_written =0;
static int path_table_index;
static time_t begun;
/* We recursively walk through all of the directories and assign extent
numbers to them. We have already assigned extent numbers to everything that
goes in front of them */
static int FDECL1(assign_directory_addresses, struct directory *, node)
{
int dir_size;
struct directory * dpnt;
dpnt = node;
while (dpnt)
{
/* skip if it's hidden */
if(dpnt->dir_flags & INHIBIT_ISO9660_ENTRY) {
dpnt = dpnt->next;
continue;
}
/*
* If we already have an extent for this (i.e. it came from
* a multisession disc), then don't reassign a new extent.
*/
dpnt->path_index = next_path_index++;
if( dpnt->extent == 0 )
{
dpnt->extent = last_extent;
dir_size = (dpnt->size + (SECTOR_SIZE - 1)) >> 11;
last_extent += dir_size;
/*
* Leave room for the CE entries for this directory. Keep them
* close to the reference directory so that access will be
* quick.
*/
if(dpnt->ce_bytes)
{
last_extent += ROUND_UP(dpnt->ce_bytes) >> 11;
}
}
if(dpnt->subdir)
{
assign_directory_addresses(dpnt->subdir);
}
dpnt = dpnt->next;
}
return 0;
}
#ifdef APPLE_HYB
static void FDECL4(write_one_file, char *, filename,
unsigned int, size, FILE *, outfile, unsigned int, off)
#else
static void FDECL3(write_one_file, char *, filename,
unsigned int, size, FILE *, outfile)
#endif /* APPLE_HYB */
{
char buffer[SECTOR_SIZE * NSECT];
FILE * infile;
int remain;
int use;
if ((infile = fopen(filename, "rb")) == NULL)
{
#if defined(sun) || defined(_AUX_SOURCE)
fprintf(stderr, "cannot open %s: (%d)\n", filename, errno);
#else
fprintf(stderr, "cannot open %s: %s\n", filename, strerror(errno));
#endif
exit(1);
}
#ifdef APPLE_HYB
fseek(infile, off, SEEK_SET);
#endif /* APPLE_HYB */
remain = size;
while(remain > 0)
{
use = (remain > SECTOR_SIZE * NSECT - 1 ? NSECT*SECTOR_SIZE : remain);
use = ROUND_UP(use); /* Round up to nearest sector boundary */
memset(buffer, 0, use);
if (fread(buffer, 1, use, infile) == 0)
{
fprintf(stderr,"cannot read from %s\n",filename);
exit(1);
}
xfwrite(buffer, 1, use, outfile);
last_extent_written += use/SECTOR_SIZE;
#if 0
if((last_extent_written % 1000) < use/SECTOR_SIZE)
{
fprintf(stderr,"%d..", last_extent_written);
}
#else
if((last_extent_written % 5000) < use/SECTOR_SIZE
&& verbose > 3)
{
time_t now;
time_t the_end;
double frac;
time(&now);
frac = last_extent_written / (double)last_extent;
the_end = begun + (now - begun) / frac;
fprintf(stderr, "%6.2f%% done, estimate finish %s",
frac * 100., ctime(&the_end));
}
#endif
remain -= use;
}
fclose(infile);
} /* write_one_file(... */
static void FDECL1(write_files, FILE *, outfile)
{
struct deferred_write * dwpnt, *dwnext;
dwpnt = dw_head;
while(dwpnt)
{
if(dwpnt->table)
{
xfwrite(dwpnt->table, 1, ROUND_UP(dwpnt->size), outfile);
last_extent_written += ROUND_UP(dwpnt->size) / SECTOR_SIZE;
table_size += dwpnt->size;
/* fprintf(stderr,"Size %d ", dwpnt->size); */
free(dwpnt->table);
}
else
{
#ifdef VMS
vms_write_one_file(dwpnt->name, dwpnt->size, outfile);
#else
#ifdef APPLE_HYB
write_one_file(dwpnt->name, dwpnt->size, outfile, dwpnt->off);
#else
write_one_file(dwpnt->name, dwpnt->size, outfile);
#endif /* APPLE_HYB */
#endif
free(dwpnt->name);
}
#ifdef APPLE_HYB
if (apple_hyb)
{
/* we may have to pad out ISO files to work with
HFS clump sizes */
char blk[SECTOR_SIZE];
int i;
for(i=0;i<dwpnt->pad;i++)
xfwrite(blk, 1, SECTOR_SIZE, outfile);
last_extent_written += dwpnt->pad;
}
#endif /* APPLE_HYB */
dwnext = dwpnt;
dwpnt = dwpnt->next;
free(dwnext);
}
} /* write_files(... */
#if 0
static void dump_filelist()
{
struct deferred_write * dwpnt;
dwpnt = dw_head;
while(dwpnt)
{
fprintf(stderr, "File %s\n",dwpnt->name);
dwpnt = dwpnt->next;
}
fprintf(stderr,"\n");
}
#endif
static int FDECL2(compare_dirs, const void *, rr, const void *, ll)
{
char * rpnt, *lpnt;
struct directory_entry ** r, **l;
r = (struct directory_entry **) rr;
l = (struct directory_entry **) ll;
rpnt = (*r)->isorec.name;
lpnt = (*l)->isorec.name;
#ifdef APPLE_HYB
/* resource fork MUST (not sure if this is true for HFS volumes) be
before the data fork - so force it here */
if ((*r)->assoc && (*r)->assoc == (*l))
return 1;
if ((*l)->assoc && (*l)->assoc == (*r))
return -1;
#endif /* APPLE_HYB */
/*
* If the entries are the same, this is an error.
*/
if( strcmp(rpnt, lpnt) == 0 )
{
sort_goof++;
}
/*
* Put the '.' and '..' entries on the head of the sorted list.
* For normal ASCII, this always happens to be the case, but out of
* band characters cause this not to be the case sometimes.
*
* FIXME(eric) - these tests seem redundant, in taht the name is
* never assigned these values. It will instead be \000 or \001,
* and thus should always be sorted correctly. I need to figure
* out why I thought I needed this in the first place.
*/
#if 0
if( strcmp(rpnt, ".") == 0 ) return -1;
if( strcmp(lpnt, ".") == 0 ) return 1;
if( strcmp(rpnt, "..") == 0 ) return -1;
if( strcmp(lpnt, "..") == 0 ) return 1;
#else
/*
* The code above is wrong (as explained in Eric's comment), leading to incorrect
* sort order iff the -L option ("allow leading dots") is in effect and a directory
* contains entries that start with a dot.
*
* (TF, Tue Dec 29 13:49:24 CET 1998)
*/
if((*r)->isorec.name_len[0] == 1 && *rpnt == 0) return -1; /* '.' */
if((*l)->isorec.name_len[0] == 1 && *lpnt == 0) return 1;
if((*r)->isorec.name_len[0] == 1 && *rpnt == 1) return -1; /* '..' */
if((*l)->isorec.name_len[0] == 1 && *lpnt == 1) return 1;
#endif
while(*rpnt && *lpnt)
{
if(*rpnt == ';' && *lpnt != ';') return -1;
if(*rpnt != ';' && *lpnt == ';') return 1;
if(*rpnt == ';' && *lpnt == ';') return 0;
if(*rpnt == '.' && *lpnt != '.') return -1;
if(*rpnt != '.' && *lpnt == '.') return 1;
if((unsigned char)*rpnt < (unsigned char)*lpnt) return -1;
if((unsigned char)*rpnt > (unsigned char)*lpnt) return 1;
rpnt++; lpnt++;
}
if(*rpnt) return 1;
if(*lpnt) return -1;
return 0;
}
/*
* Function: sort_directory
*
* Purpose: Sort the directory in the appropriate ISO9660
* order.
*
* Notes: Returns 0 if OK, returns > 0 if an error occurred.
*/
int FDECL1(sort_directory, struct directory_entry **, sort_dir)
{
int dcount = 0;
int xcount = 0;
int j;
int i, len;
struct directory_entry * s_entry;
struct directory_entry ** sortlist;
/* need to keep a count of how many entries are hidden */
s_entry = *sort_dir;
while(s_entry)
{
if (s_entry->de_flags & INHIBIT_ISO9660_ENTRY)
xcount++;
dcount++;
s_entry = s_entry->next;
}
if( dcount == 0 )
{
return 0;
}
/*
* OK, now we know how many there are. Build a vector for sorting.
*/
sortlist = (struct directory_entry **)
e_malloc(sizeof(struct directory_entry *) * dcount);
j = dcount - 1;
dcount = 0;
s_entry = *sort_dir;
while(s_entry)
{
if(s_entry->de_flags & INHIBIT_ISO9660_ENTRY)
{
/* put any hidden entries at the end of the vector */
sortlist[j--] = s_entry;
}
else
{
sortlist[dcount] = s_entry;
dcount++;
}
len = s_entry->isorec.name_len[0];
s_entry->isorec.name[len] = 0;
s_entry = s_entry->next;
}
/*
* Each directory is required to contain at least . and ..
*/
if( dcount < 2 )
{
sort_goof = 1;
}
else
{
/* only sort the non-hidden entries */
sort_goof = 0;
#ifdef __STDC__
qsort(sortlist, dcount, sizeof(struct directory_entry *),
(int (*)(const void *, const void *))compare_dirs);
#else
qsort(sortlist, dcount, sizeof(struct directory_entry *),
compare_dirs);
#endif
/*
* Now reassemble the linked list in the proper sorted order
* We still need the hidden entries, as they may be used in the
* Joliet tree.
*/
for(i=0; i<dcount+xcount-1; i++)
{
sortlist[i]->next = sortlist[i+1];
}
sortlist[dcount+xcount-1]->next = NULL;
*sort_dir = sortlist[0];
}
free(sortlist);
return sort_goof;
}
static int root_gen()
{
init_fstatbuf();
root_record.length[0] = 1 + sizeof(struct iso_directory_record)
- sizeof(root_record.name);
root_record.ext_attr_length[0] = 0;
set_733((char *) root_record.extent, root->extent);
set_733((char *) root_record.size, ROUND_UP(root->size));
iso9660_date(root_record.date, root_statbuf.st_mtime);
root_record.flags[0] = 2;
root_record.file_unit_size[0] = 0;
root_record.interleave[0] = 0;
set_723(root_record.volume_sequence_number, volume_sequence_number);
root_record.name_len[0] = 1;
return 0;
}
static void FDECL1(assign_file_addresses, struct directory *, dpnt)
{
struct directory * finddir;
struct directory_entry * s_entry;
struct file_hash *s_hash;
struct deferred_write * dwpnt;
char whole_path[1024];
while (dpnt)
{
s_entry = dpnt->contents;
for(s_entry = dpnt->contents; s_entry; s_entry = s_entry->next)
{
/*
* If we already have an extent for this entry,
* then don't assign a new one. It must have come
* from a previous session on the disc. Note that
* we don't end up scheduling the thing for writing
* either.
*/
if( isonum_733((unsigned char *) s_entry->isorec.extent) != 0 )
{
continue;
}
/*
* This saves some space if there are symlinks present
*/
s_hash = find_hash(s_entry->dev, s_entry->inode);
if(s_hash)
{
if(verbose > 2)
{
fprintf(stderr, "Cache hit for %s%s%s\n",s_entry->filedir->de_name,
SPATH_SEPARATOR, s_entry->name);
}
set_733((char *) s_entry->isorec.extent, s_hash->starting_block);
set_733((char *) s_entry->isorec.size, s_hash->size);
continue;
}
/*
* If this is for a directory that is not a . or a .. entry,
* then look up the information for the entry. We have already
* assigned extents for directories, so we just need to
* fill in the blanks here.
*/
if (strcmp(s_entry->name,".") && strcmp(s_entry->name,"..") &&
s_entry->isorec.flags[0] == 2)
{
finddir = dpnt->subdir;
while(1==1)
{
if(finddir->self == s_entry) break;
finddir = finddir->next;
if(!finddir)
{
fprintf(stderr,"Fatal goof\n"); exit(1);
}
}
set_733((char *) s_entry->isorec.extent, finddir->extent);
s_entry->starting_block = finddir->extent;
s_entry->size = ROUND_UP(finddir->size);
total_dir_size += s_entry->size;
add_hash(s_entry);
set_733((char *) s_entry->isorec.size, ROUND_UP(finddir->size));
continue;
}
/*
* If this is . or .., then look up the relevant info from the
* tables.
*/
if(strcmp(s_entry->name,".") == 0)
{
set_733((char *) s_entry->isorec.extent, dpnt->extent);
/*
* Set these so that the hash table has the
* correct information
*/
s_entry->starting_block = dpnt->extent;
s_entry->size = ROUND_UP(dpnt->size);
add_hash(s_entry);
s_entry->starting_block = dpnt->extent;
set_733((char *) s_entry->isorec.size, ROUND_UP(dpnt->size));
continue;
}
if(strcmp(s_entry->name,"..") == 0)
{
if(dpnt == root)
{
total_dir_size += root->size;
}
set_733((char *) s_entry->isorec.extent, dpnt->parent->extent);
/*
* Set these so that the hash table has the
* correct information
*/
s_entry->starting_block = dpnt->parent->extent;
s_entry->size = ROUND_UP(dpnt->parent->size);
add_hash(s_entry);
s_entry->starting_block = dpnt->parent->extent;
set_733((char *) s_entry->isorec.size, ROUND_UP(dpnt->parent->size));
continue;
}
/*
* Some ordinary non-directory file. Just schedule the
* file to be written. This is all quite
* straightforward, just make a list and assign extents
* as we go. Once we get through writing all of the
* directories, we should be ready write out these
* files
*/
if(s_entry->size)
{
dwpnt = (struct deferred_write *)
e_malloc(sizeof(struct deferred_write));
#ifdef APPLE_HYB
/* save this directory entry for later use */
dwpnt->s_entry = s_entry;
/* set the initial padding to zero */
dwpnt->pad = 0;
/* maybe an offset to start of the real file/fork */
dwpnt->off = s_entry->hfs_off;
#endif /* APPLE_HYB */
if(dw_tail)
{
dw_tail->next = dwpnt;
dw_tail = dwpnt;
}
else
{
dw_head = dwpnt;
dw_tail = dwpnt;
}
if(s_entry->inode == TABLE_INODE)
{
dwpnt->table = s_entry->table;
dwpnt->name = NULL;
#ifdef APPLE_HYB
snprintf(whole_path, sizeof whole_path, "%s%s%s",
s_entry->filedir->whole_name, SPATH_SEPARATOR,
trans_tbl);
#else
snprintf(whole_path, sizeof whole_path,
"%s%sTRANS.TBL",
s_entry->filedir->whole_name, SPATH_SEPARATOR);
#endif /* APPLE_HYB */
}
else
{
dwpnt->table = NULL;
strcpy(whole_path, s_entry->whole_name);
dwpnt->name = strdup(whole_path);
}
dwpnt->next = NULL;
dwpnt->size = s_entry->size;
dwpnt->extent = last_extent;
set_733((char *) s_entry->isorec.extent, last_extent);
s_entry->starting_block = last_extent;
add_hash(s_entry);
last_extent += ROUND_UP(s_entry->size) >> 11;
if(verbose > 2)
{
fprintf(stderr,"%d %d %s\n", s_entry->starting_block,
last_extent-1, whole_path);
}
#ifdef DBG_ISO
if((ROUND_UP(s_entry->size) >> 11) > 500)
{
fprintf(stderr,"Warning: large file %s\n", whole_path);
fprintf(stderr,"Starting block is %d\n", s_entry->starting_block);
fprintf(stderr,"Reported file size is %d extents\n", s_entry->size);
}
#endif
#ifdef NOT_NEEDED /* Never use this code if you like to create a DVD */
if(last_extent > (800000000 >> 11))
{
/*
* More than 800Mb? Punt
*/
fprintf(stderr,"Extent overflow processing file %s\n", whole_path);
fprintf(stderr,"Starting block is %d\n", s_entry->starting_block);
fprintf(stderr,"Reported file size is %d extents\n", s_entry->size);
exit(1);
}
#endif
continue;
}
/*
* This is for zero-length files. If we leave the extent 0,
* then we get screwed, because many readers simply drop files
* that have an extent of zero. Thus we leave the size 0,
* and just assign the extent number.
*/
set_733((char *) s_entry->isorec.extent, last_extent);
}
if(dpnt->subdir)
{
assign_file_addresses(dpnt->subdir);
}
dpnt = dpnt->next;
}
} /* assign_file_addresses(... */
static void FDECL1(free_one_directory, struct directory *, dpnt)
{
struct directory_entry * s_entry;
struct directory_entry * s_entry_d;
s_entry = dpnt->contents;
while(s_entry)
{
s_entry_d = s_entry;
s_entry = s_entry->next;
if( s_entry_d->name != NULL )
{
free (s_entry_d->name);
}
if( s_entry_d->whole_name != NULL )
{
free (s_entry_d->whole_name);
}
#ifdef APPLE_HYB
if (apple_both && s_entry_d->hfs_ent && !s_entry_d->assoc)
free(s_entry_d->hfs_ent);
#endif /* APPLE_HYB */
free (s_entry_d);
}
dpnt->contents = NULL;
} /* free_one_directory(... */
static void FDECL1(free_directories, struct directory *, dpnt)
{
while (dpnt)
{
free_one_directory(dpnt);
if(dpnt->subdir) free_directories(dpnt->subdir);
dpnt = dpnt->next;
}
}
void FDECL2(generate_one_directory, struct directory *, dpnt, FILE *, outfile)
{
unsigned int ce_address = 0;
char * ce_buffer;
unsigned int ce_index = 0;
unsigned int ce_size;
unsigned int dir_index;
char * directory_buffer;
int new_reclen;
struct directory_entry * s_entry;
struct directory_entry * s_entry_d;
unsigned int total_size;
total_size = (dpnt->size + (SECTOR_SIZE - 1)) & ~(SECTOR_SIZE - 1);
directory_buffer = (char *) e_malloc(total_size);
memset(directory_buffer, 0, total_size);
dir_index = 0;
ce_size = (dpnt->ce_bytes + (SECTOR_SIZE - 1)) & ~(SECTOR_SIZE - 1);
ce_buffer = NULL;
if(ce_size)
{
ce_buffer = (char *) e_malloc(ce_size);
memset(ce_buffer, 0, ce_size);
ce_index = 0;
/*
* Absolute byte address of CE entries for this directory
*/
ce_address = last_extent_written + (total_size >> 11);
ce_address = ce_address << 11;
}
s_entry = dpnt->contents;
while(s_entry)
{
/* skip if it's hidden */
if(s_entry->de_flags & INHIBIT_ISO9660_ENTRY) {
s_entry = s_entry->next;
continue;
}
/*
* We do not allow directory entries to cross sector boundaries.
* Simply pad, and then start the next entry at the next sector
*/
new_reclen = s_entry->isorec.length[0];
if( (dir_index & (SECTOR_SIZE - 1)) + new_reclen >= SECTOR_SIZE )
{
dir_index = (dir_index + (SECTOR_SIZE - 1)) &
~(SECTOR_SIZE - 1);
}
memcpy(directory_buffer + dir_index, &s_entry->isorec,
sizeof(struct iso_directory_record) -
sizeof(s_entry->isorec.name) + s_entry->isorec.name_len[0]);
dir_index += sizeof(struct iso_directory_record) -
sizeof (s_entry->isorec.name)+ s_entry->isorec.name_len[0];
/*
* Add the Rock Ridge attributes, if present
*/
if(s_entry->rr_attr_size)
{
if(dir_index & 1)
{
directory_buffer[dir_index++] = 0;
}
/*
* If the RR attributes were too long, then write the
* CE records, as required.
*/
if(s_entry->rr_attr_size != s_entry->total_rr_attr_size)
{
unsigned char * pnt;
int len, nbytes;
/*
* Go through the entire record and fix up the CE entries
* so that the extent and offset are correct
*/
pnt = s_entry->rr_attributes;
len = s_entry->total_rr_attr_size;
while(len > 3)
{
#ifdef DEBUG
if (!ce_size)
{
fprintf(stderr,"Warning: ce_index(%d) && ce_address(%d) not initialized\n",
ce_index, ce_address);
}
#endif
if(pnt[0] == 'C' && pnt[1] == 'E')
{
nbytes = get_733( (char *) pnt+20);
if((ce_index & (SECTOR_SIZE - 1)) + nbytes >=
SECTOR_SIZE)
{
ce_index = ROUND_UP(ce_index);
}
set_733( (char *) pnt+4,
(ce_address + ce_index) >> 11);
set_733( (char *) pnt+12,
(ce_address + ce_index) & (SECTOR_SIZE - 1));
/*
* Now store the block in the ce buffer
*/
memcpy(ce_buffer + ce_index,
pnt + pnt[2], nbytes);
ce_index += nbytes;
if(ce_index & 1)
{
ce_index++;
}
}
len -= pnt[2];
pnt += pnt[2];
}
}
rockridge_size += s_entry->total_rr_attr_size;
memcpy(directory_buffer + dir_index, s_entry->rr_attributes,
s_entry->rr_attr_size);
dir_index += s_entry->rr_attr_size;
}
if(dir_index & 1)
{
directory_buffer[dir_index++] = 0;
}
s_entry_d = s_entry;
s_entry = s_entry->next;
/*
* Joliet doesn't use the Rock Ridge attributes, so we free it here.
*/
if (s_entry_d->rr_attributes)
{
free(s_entry_d->rr_attributes);
s_entry_d->rr_attributes = NULL;
}
}
if(dpnt->size != dir_index)
{
fprintf(stderr,"Unexpected directory length %d %d %s\n",dpnt->size,
dir_index, dpnt->de_name);
}
xfwrite(directory_buffer, 1, total_size, outfile);
last_extent_written += total_size >> 11;
free(directory_buffer);
if(ce_size)
{
if(ce_index != dpnt->ce_bytes)
{
fprintf(stderr,"Continuation entry record length mismatch (%d %d).\n",
ce_index, dpnt->ce_bytes);
}
xfwrite(ce_buffer, 1, ce_size, outfile);
last_extent_written += ce_size >> 11;
free(ce_buffer);
}
} /* generate_one_directory(... */
static
void FDECL1(build_pathlist, struct directory *, node)
{
struct directory * dpnt;
dpnt = node;
while (dpnt)
{
/* skip if it's hidden */
if( (dpnt->dir_flags & INHIBIT_ISO9660_ENTRY) == 0 )
pathlist[dpnt->path_index] = dpnt;
if(dpnt->subdir) build_pathlist(dpnt->subdir);
dpnt = dpnt->next;
}
} /* build_pathlist(... */
static int FDECL2(compare_paths, void const *, r, void const *, l)
{
struct directory const *ll = *(struct directory * const *)l;
struct directory const *rr = *(struct directory * const *)r;
if (rr->parent->path_index < ll->parent->path_index)
{
return -1;
}
if (rr->parent->path_index > ll->parent->path_index)
{
return 1;
}
return strcmp(rr->self->isorec.name, ll->self->isorec.name);
} /* compare_paths(... */
static int generate_path_tables()
{
struct directory_entry * de;
struct directory * dpnt;
int fix;
int i;
int j;
int namelen;
char * npnt;
char * npnt1;
int tablesize;
/*
* First allocate memory for the tables and initialize the memory
*/
tablesize = path_blocks << 11;
path_table_m = (char *) e_malloc(tablesize);
path_table_l = (char *) e_malloc(tablesize);
memset(path_table_l, 0, tablesize);
memset(path_table_m, 0, tablesize);
/*
* Now start filling in the path tables. Start with root directory
*/
if( next_path_index > 0xffff )
{
fprintf(stderr, "Unable to generate sane path tables - too many directories (%d)\n",
next_path_index);
exit(1);
}
path_table_index = 0;
pathlist = (struct directory **) e_malloc(sizeof(struct directory *)
* next_path_index);
memset(pathlist, 0, sizeof(struct directory *) * next_path_index);
build_pathlist(root);
do
{
fix = 0;
#ifdef __STDC__
qsort(&pathlist[1], next_path_index-1, sizeof(struct directory *),
(int (*)(const void *, const void *))compare_paths);
#else
qsort(&pathlist[1], next_path_index-1, sizeof(struct directory *),
compare_paths);
#endif
for(j=1; j<next_path_index; j++)
{
if(pathlist[j]->path_index != j)
{
pathlist[j]->path_index = j;
fix++;
}
}
} while(fix);
for(j=1; j<next_path_index; j++)
{
dpnt = pathlist[j];
if(!dpnt)
{
fprintf(stderr,"Entry %d not in path tables\n", j);
exit(1);
}
npnt = dpnt->de_name;
/*
* So the root comes out OK
*/
if( (*npnt == 0) || (dpnt == root) )
{
npnt = ".";
}
npnt1 = strrchr(npnt, PATH_SEPARATOR);
if(npnt1)
{
npnt = npnt1 + 1;
}
de = dpnt->self;
if(!de)
{
fprintf(stderr,"Fatal goof\n");
exit(1);
}
namelen = de->isorec.name_len[0];
path_table_l[path_table_index] = namelen;
path_table_m[path_table_index] = namelen;
path_table_index += 2;
set_731(path_table_l + path_table_index, dpnt->extent);
set_732(path_table_m + path_table_index, dpnt->extent);
path_table_index += 4;
set_721(path_table_l + path_table_index,
dpnt->parent->path_index);
set_722(path_table_m + path_table_index,
dpnt->parent->path_index);
path_table_index += 2;
for(i =0; i<namelen; i++)
{
path_table_l[path_table_index] = de->isorec.name[i];
path_table_m[path_table_index] = de->isorec.name[i];
path_table_index++;
}
if(path_table_index & 1)
{
path_table_index++; /* For odd lengths we pad */
}
}
free(pathlist);
if(path_table_index != path_table_size)
{
fprintf(stderr,"Path table lengths do not match %d %d\n",
path_table_index,
path_table_size);
}
return 0;
} /* generate_path_tables(... */
void
FDECL3(memcpy_max, char *, to, char *, from, int, max)
{
int n = strlen(from);
if (n > max)
{
n = max;
}
memcpy(to, from, n);
} /* memcpy_max(... */
void FDECL1(outputlist_insert, struct output_fragment *, frag)
{
if( out_tail == NULL )
{
out_list = out_tail = frag;
}
else
{
out_tail->of_next = frag;
out_tail = frag;
}
}
static int FDECL1(file_write, FILE *, outfile)
{
int should_write;
#ifdef APPLE_HYB
char buffer[2048];
memset(buffer, 0, sizeof(buffer));
if (apple_hyb) {
int i;
/* write out padding to round up to HFS allocation block */
for(i=0;i<hfs_pad;i++)
xfwrite(buffer, 1, sizeof(buffer), outfile);
last_extent_written += hfs_pad;
}
#endif /* APPLE_HYB */
/*
* OK, all done with that crap. Now write out the directories.
* This is where the fur starts to fly, because we need to keep track of
* each file as we find it and keep track of where we put it.
*/
should_write = last_extent - session_start;
if( print_size > 0 )
{
#ifdef APPLE_HYB
if (apple_hyb)
fprintf(stderr,"Total extents scheduled to be written (inc HFS) = %d\n",
last_extent - session_start);
else
#endif
fprintf(stderr,"Total extents scheduled to be written = %d\n",
last_extent - session_start);
exit(0);
}
if( verbose > 2 )
{
#ifdef DBG_ISO
fprintf(stderr,"Total directory extents being written = %d\n", last_extent);
#endif
#ifdef APPLE_HYB
if (apple_hyb)
fprintf(stderr,"Total extents scheduled to be written (inc HFS) = %d\n",
last_extent - session_start);
else
#endif
fprintf(stderr,"Total extents scheduled to be written = %d\n",
last_extent - session_start);
}
/*
* Now write all of the files that we need.
*/
write_files(outfile);
#ifdef APPLE_HYB
/* write out extents/catalog/dt file */
if (apple_hyb) {
xfwrite(hce->hfs_ce, hce->hfs_tot_size, HFS_BLOCKSZ, outfile);
/* round up to a whole CD block */
if (H_ROUND_UP(hce->hfs_tot_size) - hce->hfs_tot_size*HFS_BLOCKSZ)
xfwrite(buffer, 1, H_ROUND_UP(hce->hfs_tot_size) - hce->hfs_tot_size*HFS_BLOCKSZ, outfile);
last_extent_written += ROUND_UP(hce->hfs_tot_size*HFS_BLOCKSZ)/SECTOR_SIZE;
/* write out HFS boot block */
if (mac_boot.name)
write_one_file(mac_boot.name, mac_boot.size, outfile, mac_boot.off);
}
#endif /* APPLE_HYB */
/*
* The rest is just fluff.
*/
if( verbose == 0 )
{
return 0;
}
#ifdef APPLE_HYB
if (apple_hyb) {
fprintf(stderr, "Total extents actually written (inc HFS) = %d\n",
last_extent_written - session_start);
fprintf(stderr, "(Size of ISO volume = %d, HFS extra = %d)\n",
last_extent_written - session_start - hfs_extra, hfs_extra);
}
else
#else
fprintf(stderr,"Total extents actually written = %d\n",
last_extent_written - session_start);
#endif /* APPLE_HYB */
/*
* Hard links throw us off here
*/
if(should_write != last_extent - session_start)
{
fprintf(stderr,"Number of extents written not what was predicted. Please fix.\n");
fprintf(stderr,"Predicted = %d, written = %d\n", should_write, last_extent);
}
fprintf(stderr,"Total translation table size: %d\n", table_size);
fprintf(stderr,"Total rockridge attributes bytes: %d\n", rockridge_size);
fprintf(stderr,"Total directory bytes: %d\n", total_dir_size);
fprintf(stderr,"Path table size(bytes): %d\n", path_table_size);
#ifdef DEBUG
fprintf(stderr, "next extent, last_extent, last_extent_written %d %d %d\n",
next_extent, last_extent, last_extent_written);
#endif
return 0;
} /* iso_write(... */
/*
* Function to write the PVD for the disc.
*/
static int FDECL1(pvd_write, FILE *, outfile)
{
char iso_time[17];
int should_write;
struct tm local;
struct tm gmt;
time(&begun);
local = *localtime(&begun);
gmt = *gmtime(&begun);
/*
* This will break in the year 2000, I supose, but there is no good way
* to get the top two digits of the year.
*/
snprintf(iso_time, sizeof iso_time, "%4.4d%2.2d%2.2d%2.2d%2.2d%2.2d00",
1900 + local.tm_year,
local.tm_mon+1, local.tm_mday,
local.tm_hour, local.tm_min, local.tm_sec);
local.tm_min -= gmt.tm_min;
local.tm_hour -= gmt.tm_hour;
local.tm_yday -= gmt.tm_yday;
iso_time[16] = (local.tm_min + 60*(local.tm_hour + 24*local.tm_yday)) / 15;
/*
* Next we write out the primary descriptor for the disc
*/
memset(&vol_desc, 0, sizeof(vol_desc));
vol_desc.type[0] = ISO_VD_PRIMARY;
memcpy(vol_desc.id, ISO_STANDARD_ID, sizeof(ISO_STANDARD_ID) - 1);
vol_desc.version[0] = 1;
memset(vol_desc.system_id, ' ', sizeof(vol_desc.system_id));
memcpy_max(vol_desc.system_id, system_id, strlen(system_id));
memset(vol_desc.volume_id, ' ', sizeof(vol_desc.volume_id));
memcpy_max(vol_desc.volume_id, volume_id, strlen(volume_id));
should_write = last_extent - session_start;
set_733((char *) vol_desc.volume_space_size, should_write);
set_723(vol_desc.volume_set_size, volume_set_size);
set_723(vol_desc.volume_sequence_number, volume_sequence_number);
set_723(vol_desc.logical_block_size, 2048);
/*
* The path tables are used by DOS based machines to cache directory
* locations
*/
set_733((char *) vol_desc.path_table_size, path_table_size);
set_731(vol_desc.type_l_path_table, path_table[0]);
set_731(vol_desc.opt_type_l_path_table, path_table[1]);
set_732(vol_desc.type_m_path_table, path_table[2]);
set_732(vol_desc.opt_type_m_path_table, path_table[3]);
/*
* Now we copy the actual root directory record
*/
memcpy(vol_desc.root_directory_record, &root_record,
sizeof(vol_desc.root_directory_record));
/*
* The rest is just fluff. It looks nice to fill in many of these fields,
* though.
*/
FILL_SPACE(volume_set_id);
if(volset_id) memcpy_max(vol_desc.volume_set_id, volset_id, strlen(volset_id));
FILL_SPACE(publisher_id);
if(publisher) memcpy_max(vol_desc.publisher_id, publisher, strlen(publisher));
FILL_SPACE(preparer_id);
if(preparer) memcpy_max(vol_desc.preparer_id, preparer, strlen(preparer));
FILL_SPACE(application_id);
if(appid) memcpy_max(vol_desc.application_id, appid, strlen(appid));
FILL_SPACE(copyright_file_id);
if(copyright) memcpy_max(vol_desc.copyright_file_id, copyright,
strlen(copyright));
FILL_SPACE(abstract_file_id);
if(abstract) memcpy_max(vol_desc.abstract_file_id, abstract,
strlen(abstract));
FILL_SPACE(bibliographic_file_id);
if(biblio) memcpy_max(vol_desc.bibliographic_file_id, biblio,
strlen(biblio));
FILL_SPACE(creation_date);
FILL_SPACE(modification_date);
FILL_SPACE(expiration_date);
FILL_SPACE(effective_date);
vol_desc.file_structure_version[0] = 1;
FILL_SPACE(application_data);
memcpy(vol_desc.creation_date, iso_time, 17);
memcpy(vol_desc.modification_date, iso_time, 17);
memcpy(vol_desc.expiration_date, "0000000000000000", 17);
memcpy(vol_desc.effective_date, iso_time, 17);
/*
* if not a bootable cd do it the old way
*/
xfwrite(&vol_desc, 1, 2048, outfile);
last_extent_written++;
return 0;
}
/*
* Function to write the EVD for the disc.
*/
static int FDECL1(evd_write, FILE *, outfile)
{
struct iso_primary_descriptor evol_desc;
/*
* Now write the end volume descriptor. Much simpler than the other one
*/
memset(&evol_desc, 0, sizeof(evol_desc));
evol_desc.type[0] = ISO_VD_END;
memcpy(evol_desc.id, ISO_STANDARD_ID, sizeof(ISO_STANDARD_ID) - 1);
evol_desc.version[0] = 1;
xfwrite(&evol_desc, 1, 2048, outfile);
last_extent_written += 1;
return 0;
}
/*
* Function to write the EVD for the disc.
*/
static int FDECL1(pathtab_write, FILE *, outfile)
{
/*
* Next we write the path tables
*/
xfwrite(path_table_l, 1, path_blocks << 11, outfile);
xfwrite(path_table_m, 1, path_blocks << 11, outfile);
last_extent_written += 2*path_blocks;
free(path_table_l);
free(path_table_m);
path_table_l = NULL;
path_table_m = NULL;
return 0;
}
static int FDECL1(exten_write, FILE *, outfile)
{
xfwrite(extension_record, 1, SECTOR_SIZE, outfile);
last_extent_written++;
return 0;
}
/*
* Functions to describe padding block at the start of the disc.
*/
int FDECL1(oneblock_size, int, starting_extent)
{
last_extent++;
return 0;
}
/*
* Functions to describe padding block at the start of the disc.
*/
static int FDECL1(pathtab_size, int, starting_extent)
{
path_table[0] = starting_extent;
path_table[1] = 0;
path_table[2] = path_table[0] + path_blocks;
path_table[3] = 0;
last_extent += 2*path_blocks;
return 0;
}
static int FDECL1(padblock_size, int, starting_extent)
{
last_extent += 16;
return 0;
}
static int file_gen()
{
#ifdef APPLE_HYB
int start_extent = last_extent; /* orig ISO files start */
#endif /* APPLE_HYB */
assign_file_addresses(root);
#ifdef APPLE_HYB
/* put this here for the time being - may when I've worked out how
to use Eric's new system for creating/writing parts of the image
it may move to it's own routine */
if (apple_hyb)
{
int Csize; /* clump size for HFS vol */
int loop = CTC_LOOP;
int last_extent_save = last_extent;
/* allocate memory for the libhfs/mkisofs extra info */
hce = (hce_mem *)e_malloc(sizeof(hce_mem));
hce->error = (char *)e_malloc(ERROR_SIZE);
/* mark as unallocated for use later */
hce->hfs_ce = hce->hfs_hdr = hce->hfs_map = 0;
/* reserve space for the label partition - if it is needed */
if (gen_pt)
hce->hfs_map_size = HFS_MAP_SIZE;
else
hce->hfs_map_size = 0;
/* set the intial factor to increase Catalog file size */
hce->ctc_size = CTC;
/* "create" the HFS volume (just the header, catalog/extents files)
if there's a problem with the Catalog file being too small,
we keep on increasing the size (up to CTC_LOOP) times and try again.
Unfortunately I don't know enough about the inner workings of
HFS, so I can't workout the size of the Catalog file in
advance (and I don't want to "grow" as is is normally allowed to),
therefore, this approach is a bit over the top as it involves
throwing away the "volume" we have created and trying again ... */
do
{
hce->error[0] = '\0';
/* attempt to create the Mac volume */
Csize = make_mac_volume(root, start_extent);
/* if we have a problem ... */
if (Csize < 0)
{
/* we've made too many attempts, or got some other error */
if (loop == 0 || errno != HCE_ERROR)
{
/* HCE_ERROR is not a valid errno value */
if (errno == HCE_ERROR)
errno = 0;
/* exit with the error */
if (*hce->error)
fprintf(stderr, "%s\n", hce->error);
err(1, "%s", hfs_error);
}
else
{
/* increase Catalog file size factor */
hce->ctc_size *= CTC;
/* reset the initial "last_extent" and try again */
last_extent = last_extent_save;
}
}
else
/* everything OK - just carry on ... */
loop = 0;
}
while (loop--);
hfs_extra = H_ROUND_UP(hce->hfs_tot_size)/SECTOR_SIZE;
last_extent += hfs_extra;
/* generate the Mac label and HFS partition maps */
mac_boot.name = hfs_boot_file;
/* only generate the partition tables etc. if we are making a bootable
CD - or if the -part option is given */
if (gen_pt) {
if (gen_mac_label(&mac_boot)) {
if (*hce->error)
fprintf(stderr, "%s\n", hce->error);
err(1, "%s", hfs_error);
}
}
/* set Autostart filename if required */
if (autoname) {
if(autostart())
errx(1, "Autostart filename must less than 12 characters");
}
/* finished with any HFS type errors */
free(hce->error);
hce->error = 0;
/* the ISO files need to start on a multiple of the HFS allocation
blocks, so find out how much padding we need */
/* take in accout alignment of files wrt HFS volume start */
hfs_pad = V_ROUND_UP(start_extent*SECTOR_SIZE + (hce->hfs_hdr_size + hce->hfs_map_size)*HFS_BLOCKSZ, Csize)/SECTOR_SIZE;
hfs_pad -= (start_extent + (hce->hfs_hdr_size + hce->hfs_map_size)/BLK_CONV);
}
#endif /* APPLE_HYB */
return 0;
}
static int dirtree_dump()
{
if (verbose > 2)
{
dump_tree(root);
}
return 0;
}
static int FDECL1(dirtree_fixup, int, starting_extent)
{
if (use_RockRidge && reloc_dir)
finish_cl_pl_entries();
if (use_RockRidge )
update_nlink_field(root);
return 0;
}
static int FDECL1(dirtree_size, int, starting_extent)
{
assign_directory_addresses(root);
return 0;
}
static int FDECL1(ext_size, int, starting_extent)
{
extern int extension_record_size;
struct directory_entry * s_entry;
extension_record_extent = starting_extent;
s_entry = root->contents;
set_733((char *) s_entry->rr_attributes + s_entry->rr_attr_size - 24,
extension_record_extent);
set_733((char *) s_entry->rr_attributes + s_entry->rr_attr_size - 8,
extension_record_size);
last_extent++;
return 0;
}
static int FDECL1(dirtree_write, FILE *, outfile)
{
generate_iso9660_directories(root, outfile);
return 0;
}
static int FDECL1(dirtree_cleanup, FILE *, outfile)
{
free_directories(root);
return 0;
}
static int FDECL1(padblock_write, FILE *, outfile)
{
char buffer[2048];
int i;
#ifdef APPLE_HYB
int n = 0;
#endif /* APPLE_HYB */
memset(buffer, 0, sizeof(buffer));
#ifdef APPLE_HYB
if (apple_hyb)
{
int r; /* HFS hdr output */
int tot_size = hce->hfs_map_size + hce->hfs_hdr_size;
/* get size in CD blocks == 4xHFS_BLOCKSZ == 2048 */
n = tot_size/BLK_CONV;
r = tot_size%BLK_CONV;
/* write out HFS volume header info */
xfwrite(hce->hfs_map, tot_size, HFS_BLOCKSZ, outfile);
/* write out any partial CD block */
if (r)
{
xfwrite(buffer, BLK_CONV-r, HFS_BLOCKSZ, outfile);
n++;
}
}
/* write out the remainder of the ISO header */
for(i=n; i<16; i++)
#else
for(i=0; i<16; i++)
#endif /* APPLE_HYB */
{
xfwrite(buffer, 1, sizeof(buffer), outfile);
}
last_extent_written += 16;
return 0;
}
#ifdef APPLE_HYB
/*
** get_adj_size: get the ajusted size of the volume with the HFS
** allocation block size for each file
*/
int FDECL1(get_adj_size, int, Csize)
{
struct deferred_write *dw;
int size = 0;
int count = 0;
/* loop through all the files finding the new total size */
for(dw = dw_head; dw; dw = dw->next)
{
size += V_ROUND_UP(dw->size, Csize);
count++;
}
/* crude attempt to prevent overflows - HFS can only cope with a
maximum of about 65536 forks (actually less) - this will trap
cases when we have far too many files */
if (count >= 65536)
return (-1);
else
return(size);
}
/*
** adj_size: adjust the ISO record entries for all files
** based on the HFS allocation block size
*/
int FDECL3(adj_size, int, Csize, int, start_extent, int, extra)
{
struct deferred_write *dw;
struct directory_entry *s_entry;
int size;
/* get the adjusted start_extent (with padding) */
/* take in accout alignment of files wrt HFS volume start */
start_extent = V_ROUND_UP(start_extent*SECTOR_SIZE + extra *HFS_BLOCKSZ, Csize)/SECTOR_SIZE;
start_extent -= (extra/BLK_CONV);
/* initialise file hash */
flush_hash();
/* loop through all files changing their starting blocks and
finding any padding needed to written out latter */
for(dw = dw_head; dw; dw = dw->next)
{
s_entry = dw->s_entry;
s_entry->starting_block = dw->extent = start_extent;
set_733((char *) s_entry->isorec.extent, start_extent);
size = V_ROUND_UP(dw->size, Csize)/SECTOR_SIZE;
dw->pad = size - ROUND_UP(dw->size)/SECTOR_SIZE;
/* cache non-HFS files - as there may be multiple links to
these files (HFS files can't have multiple links). We will
need to change the starting extent of the other links later */
if (!s_entry->hfs_ent)
add_hash(s_entry);
start_extent += size;
}
return(start_extent);
}
/*
** adj_size_other: adjust any non-HFS files that may be linked
** to an existing file (i.e. not have a deferred_write
** entry of it's own
*/
void FDECL1(adj_size_other, struct directory *, dpnt)
{
struct directory_entry * s_entry;
struct file_hash *s_hash;
while (dpnt)
{
s_entry = dpnt->contents;
for(s_entry = dpnt->contents; s_entry; s_entry = s_entry->next)
{
/* if it's an HFS file or a directory - then ignore
(we're after non-HFS files) */
if (s_entry->hfs_ent || (s_entry->isorec.flags[0] & 2))
continue;
/* find any cached entry and assign new starting extent */
s_hash = find_hash(s_entry->dev, s_entry->inode);
if(s_hash)
{
set_733((char *) s_entry->isorec.extent, s_hash->starting_block);
/* not vital - but tidy */
s_entry->starting_block = s_hash->starting_block;
}
}
if(dpnt->subdir)
{
adj_size_other(dpnt->subdir);
}
dpnt = dpnt->next;
}
/* clear file hash */
flush_hash();
}
#endif /* APPLE_HYB */
struct output_fragment padblock_desc = {NULL, padblock_size, NULL, padblock_write};
struct output_fragment voldesc_desc = {NULL, oneblock_size, root_gen, pvd_write};
struct output_fragment end_vol = {NULL, oneblock_size, NULL, evd_write};
struct output_fragment pathtable_desc = {NULL, pathtab_size, generate_path_tables, pathtab_write};
struct output_fragment dirtree_desc = {NULL, dirtree_size, NULL, dirtree_write};
struct output_fragment dirtree_clean = {NULL, dirtree_fixup, dirtree_dump, dirtree_cleanup};
struct output_fragment extension_desc = {NULL, ext_size, NULL, exten_write};
struct output_fragment files_desc = {NULL, NULL, file_gen, file_write};
``` |
The Stolen Minks are a three-piece Canadian garage punk band who have been praised as "Halifax's answer to The Gossip and The Detroit Cobras".
They have shared stages with prominent bands of their genre, including the Black Lips, Wanda Jackson, King Khan & BBQ, Brutal Knights, The Death Set, Statues and An Albatross. The Stolen Minks have been showcased at a range of festivals including Halifax Pop Explosion, Pop Montreal, Sappyfest and Ladyfest Ottawa.
The band has toured Canada extensively and in recent years covered large portions of the United States.
History
Formation and EP (2003–2005)
The Stolen Minks were formed as a four-member all-female band in the fall of 2003 in Halifax, Nova Scotia. The name of the band is a play on the words "minks stole". Drawing influence from artists such as Link Wray and Wanda Jackson, the band was initially recognizable for an energetic rockabilly or rock and roll style, but have evolved since into the garage rock and indie rock scenes. In early years, the band gained popularity playing shows locally in Halifax, and in April 2005 was voted the best new local artist by "The Coast's Best of Music" reader's poll.
The Stolen Minks released their debut self-titled EP in August 2005. The album sold all the original copies produced in a few months.
Label signing and Family Boycott (2006–2007)
The Stolen Minks were picked up by the Montreal independent label New Romance for Kids before the release of their second recording, "Family Boycott". The album first sold on the band's August 2006 tour before being released officially in Halifax in September and nationally in October. "Family Boycott" was praised as "eight songs of dance floor coups and back alley bruising" (Skyscraper). The album hit number one twice on Earshot in the thirteen weeks in charted.
Halifax animator Ben Jeddrie produced two videos for the band, "Boys on the Floor" in 2006 (from the previous "Stolen Minks EP" release), and "Stop Talking" in 2007 (from Family Boycott). "Stop Talking" was screened at the Atlantic Film Festival, and both videos received airplay on MuchMusic and MuchLoud.
In 2007, New Romance for Kids re-released the Stolen Minks' sold-out 2005 self-titled E.P. on 7-inch vinyl. The album was distributed by New Romance for Kids in Canada and Morphius Records in the United States.
High Kicks and future plans (2008-present)
The Stolen Minks' third release, "High Kicks", was launched out of New Romance For Kids Montreal in September 2008. Lauded as a "drenched-in-fuzz blend of garage rock meets sassy punk" (Exclaim!), High Kicks was well received in Canada. The album charted for thirteen weeks (with six weeks in the top ten) on Canadian campus and community radio and reached number two on Exclaim!'s monthly Earshot! charts.
In the fall of 2008, the band completed their most extensive tour, covering North America in ten weeks and heading as far south as Austin, Texas. The band's most recent tour took place across North America in June 2009.
The Stolen Minks are featured in the 2008 documentary 6015 Willow along with fellow Halifax bands including Dog Day and North of America.
A video for "Consecutives" (off High Kicks) was recently produced by Halifax visual artist, Paul Hammond of Yo Rodeo.
They released five songs on Bandcamp in March, 2010.
Discography
The Stolen Minks EP
Released August 2005
"Minks Riot" (The Stolen Minks) – 0:49
"Black Widow" (Link Wray) – 2:36
"Chug a Lug" (Roger Miller) – 1:15
"Boys on the Floor" (The Stolen Minks) – 2:10
"Peppy Twist" (Joey Dee) – 2:32
Family Boycott
Released October 14, 2006
All songs were written by The Stolen Minks except as noted.
"Rip It Up"
"Stop Talking"
"Charles Bronson"
"Batman (You're the Sex)"
"Fight"
"Role Model"
"Branded" (Link Wray)
"Pony (secret track)" (Ginuwine)
The Stolen Minks EP – 7" vinyl re-release
In 2007, The Stolen Minks EP, originally an independent release, was re-released as a seven-inch by Montreal’s New Romance for Kids label.
High Kicks
Released September, 2008
All songs written by The Stolen Minks.
"Bring It"
"North End Strangler"
"Reflexes"
"Drive-in (One)"
"Get Wet"
"Consecutives"
"Your Broken Heart"
"Drive-in (Two)"
"I Hate You"
"Viola Desmond"
"Strange Adventures Theme Song" (secret track)
References
External links
Official site
The Stolen Minks on New Music Canada
Musical groups established in 2003
Musical groups from Halifax, Nova Scotia
Canadian indie rock groups
Women in Nova Scotia |
```python
from copy import deepcopy
import numpy as np
import unittest
import ray
import ray.rllib.algorithms.dqn as dqn
from ray.rllib.utils.test_utils import (
check,
check_compute_single_action,
check_train_results,
framework_iterator,
)
class TestDQN(unittest.TestCase):
@classmethod
def setUpClass(cls) -> None:
ray.init()
@classmethod
def tearDownClass(cls) -> None:
ray.shutdown()
def test_dqn_compilation(self):
"""Test whether DQN can be built on all frameworks."""
num_iterations = 1
config = (
dqn.dqn.DQNConfig()
.environment("CartPole-v1")
.env_runners(num_env_runners=2)
.training(num_steps_sampled_before_learning_starts=0)
)
for _ in framework_iterator(config):
# Double-dueling DQN.
print("Double-dueling")
algo = config.build()
for i in range(num_iterations):
results = algo.train()
check_train_results(results)
print(results)
check_compute_single_action(algo)
algo.stop()
# Rainbow.
print("Rainbow")
rainbow_config = deepcopy(config).training(
num_atoms=10, noisy=True, double_q=True, dueling=True, n_step=5
)
algo = rainbow_config.build()
for i in range(num_iterations):
results = algo.train()
check_train_results(results)
print(results)
check_compute_single_action(algo)
algo.stop()
def test_dqn_compilation_integer_rewards(self):
"""Test whether DQN can be built on all frameworks.
Unlike the previous test, this uses an environment with integer rewards
in order to test that type conversions are working correctly."""
num_iterations = 1
config = (
dqn.dqn.DQNConfig()
.environment("Taxi-v3")
.env_runners(num_env_runners=2)
.training(num_steps_sampled_before_learning_starts=0)
)
for _ in framework_iterator(config):
# Double-dueling DQN.
print("Double-dueling")
algo = config.build()
for i in range(num_iterations):
results = algo.train()
check_train_results(results)
print(results)
check_compute_single_action(algo)
algo.stop()
# Rainbow.
print("Rainbow")
rainbow_config = deepcopy(config).training(
num_atoms=10, noisy=True, double_q=True, dueling=True, n_step=5
)
algo = rainbow_config.build()
for i in range(num_iterations):
results = algo.train()
check_train_results(results)
print(results)
check_compute_single_action(algo)
algo.stop()
def test_dqn_exploration_and_soft_q_config(self):
"""Tests, whether a DQN Agent outputs exploration/softmaxed actions."""
config = (
dqn.dqn.DQNConfig()
.environment("FrozenLake-v1")
.env_runners(num_env_runners=0)
.environment(env_config={"is_slippery": False, "map_name": "4x4"})
).training(num_steps_sampled_before_learning_starts=0)
obs = np.array(0)
# Test against all frameworks.
for _ in framework_iterator(config):
# Default EpsilonGreedy setup.
algo = config.build()
# Setting explore=False should always return the same action.
a_ = algo.compute_single_action(obs, explore=False)
for _ in range(50):
a = algo.compute_single_action(obs, explore=False)
check(a, a_)
# explore=None (default: explore) should return different actions.
actions = []
for _ in range(50):
actions.append(algo.compute_single_action(obs))
check(np.std(actions), 0.0, false=True)
algo.stop()
# Low softmax temperature. Behaves like argmax
# (but no epsilon exploration).
config.env_runners(
exploration_config={"type": "SoftQ", "temperature": 0.000001}
)
algo = config.build()
# Due to the low temp, always expect the same action.
actions = [algo.compute_single_action(obs)]
for _ in range(50):
actions.append(algo.compute_single_action(obs))
check(np.std(actions), 0.0, decimals=3)
algo.stop()
# Higher softmax temperature.
config.exploration_config["temperature"] = 1.0
algo = config.build()
# Even with the higher temperature, if we set explore=False, we
# should expect the same actions always.
a_ = algo.compute_single_action(obs, explore=False)
for _ in range(50):
a = algo.compute_single_action(obs, explore=False)
check(a, a_)
# Due to the higher temp, expect different actions avg'ing
# around 1.5.
actions = []
for _ in range(300):
actions.append(algo.compute_single_action(obs))
check(np.std(actions), 0.0, false=True)
algo.stop()
# With Random exploration.
config.env_runners(exploration_config={"type": "Random"}, explore=True)
algo = config.build()
actions = []
for _ in range(300):
actions.append(algo.compute_single_action(obs))
check(np.std(actions), 0.0, false=True)
algo.stop()
if __name__ == "__main__":
import pytest
import sys
sys.exit(pytest.main(["-v", __file__]))
``` |
Anapa Airport () , also known as Vityazevo Airport () is an international airport located near Vityazevo village in Anapa, Russia. It serves the resort town of Anapa, as well as Novorossiysk and Temryuk with a total population of over 400,000 people.
The airport is a part of Basel Aero, airport managing holding that also runs Sochi International Airport, Krasnodar and Gelendzhik airports.
Passenger traffic of the Anapa airport in 2013 was 739,637 people. The airport is among the top 30 of Russia's busiest airports.
Construction of a new terminal began in March 2016, and was completed in July 2017, when the new terminal building became operational.
History
In 1934, scheduled passenger flights from Krasnodar to Anapa were launched.
In 1960, Anapa airport started accommodating An-2, Morava aircraft. Flights were performed to Krasnodar, Novorossiysk, Gelendzhik. The airport had less than 10 staff with only one radio station that served as radio technical flight support.
In 1965, Anapa airport's building was constructed (now it hosts a first-aid station). An aerodrome started accommodating An-24 aircraft. The airport has expanded its destination map and launched flight service to Moscow, Kerch, Donetsk, Kharkiv, Sukhumi. Due to the increased passenger traffic and aircraft landings, the airport was relocated to Anapa's suburb, near Vityazevo village, where it still operates. The new location allowed it to accommodate larger aircraft such as the An-10.
In 1969, construction of a new military airfield with a 2,500-m runway was launched near Vityazevo. It was kept secret due to military purposes of the facility.
In 1970, Vityazevo airport honors the 100,000th passenger.
In April 1974, an An-24 performed the first regular passenger flight to Vityazevo.
In May 1974, a group of NATO military attachés went to Anapa on board the first flight Moscow – Anapa – Moscow. They oversaw the construction of the military runway that was one of the longest at that time in the Soviet Union. There were about 12 aerodromes in total featuring similar runways in the country.
In 1976, Vityazevo airport was officially opened. The new terminal could handle up to 70 daily flights originating from around 50 domestic airports.
In September 1976, a twin plane crash happened above Anapa when an An-24 and a Yak-40 crashed because of the aircraft dispatcher's fatal error. The tragedy claimed 70 lives.
In 1977, Тu-154s commenced flights to Vityazevo airport, becoming the principal aircraft type in the fleet of Russian air carriers. A Тu-154 (USSR-85171) snapshot captured against the Anapa airport passenger terminal was reproduced on a Soviet postcard.
In 1982, an An-26 owned by the Black Sea Fleet Naval Air Force crashed near Anapa killing nine.
In 1988, Anapa airport was separated from the 1st Krasnodar United Air Group and became an independent entity: a separate class-III airport under the North Caucasian Civil Aviation Authority. Upon installation of the SP-80M landing system, the aerodrome acquired an ICAO category I certificate.
In 1991, the airport performed 6,828 takeoffs and landings serving 439,600 passengers. During the summer season, the airport handled up to 52 flights operating at full capacity.
Post-Soviet history
In 1993, Vityazevo airport acquired the status of an international airport. Austrian Airlines became the first international airline to open a branch office in Anapa.
In 2001, Siberia's (S7 Airlines) launched operations at Vityazevo International Airport.
In 2005, SABRE, SITA, and Kupol passenger handling systems that enable passenger check-in to any destination in the world and e-tickets usage were put into operation. In 2005, OJSC Anapa Airport won the "Russian National Olympus" award for outstanding contribution to the historical development of Russia in the "Outstanding small and medium businesses" category.
In 2006, the first scheduled flight of a Boeing (VP-BTD) of the S7 air carrier was performed.
In 2008, the first scheduled flight of an Airbus (VP-BHI) of the S7 air carrier was carried out. Later that year, the airport won the "Kuban Economic Leader 2007 – Territorial Contest Winner" award presented by the Krasnodar Territory Governor, A.N. Tkachev, in the "Aviation Transport" industry category. And in the same year, the airport won the "Kuban Transport Olympus" award bestowed on Kuban Transport Complex businesses "For rapid development momentum and flight safety".
In 2010, in accordance with the Federal Targeted Programs "Development of the Transportation System of Russia (2010-2015)" and "Modernization of the Transportation System of Russia (2002-2010)", the "Reconstruction of Anapa (Vityazevo) airport aerodrome" program was approved. The reconstruction was carried out in five stages during 2010-2012
In 2011, S7 Boeing 737-400 (VP-BAN) flying from Domodedovo became the first scheduled flight after runway reconstruction. It carried 125 passengers.
In December 2011, Anapa International Airport first accommodated the Sukhoi Superjet 100 operated by Aeroflot.
In 2012, a new ramp in the airport was put into operation.
In January 2014, Anapa International Airport was fully privatized after Russian Auction House had sold out 25.5% of government's stake to Sistema LLC for 153.6 million rubles ($4.4 million).
In April 2014, a specialty emergency services facility was opened in the airport.
In June 2014, Anapa airport launched direct air service with Simferopol, the administrative center of the disputed Crimean peninsula Annexation of Crimea by the Russian Federation .
In June 2017, at Anapa Airport, the new terminal began its work. The new terminal was built so that in case of the weather, construction or other reasons, Anapa will officially serve Sochi International Airport during FIFA-2018.
Since the start of the Russian invasion of Ukraine on February 24, 2022, all civilian flights to and from the airport have been indefinitely suspended.
Airlines and destinations
Statistics
See also
List of the busiest airports in Russia
List of the busiest airports in Europe
List of the busiest airports in the former USSR
References
External links
NOAA/NWS current weather observations
ASN Accident history for URKA
Airports in Krasnodar Krai
Basel Aero |
The canton of Coulommiers is a French administrative division, located in the arrondissement of Meaux, in the Seine-et-Marne département (Île-de-France région).
Demographics
Composition
At the French canton reorganisation which came into effect in March 2015, the canton was expanded from 15 to 50 communes:
Amillis
Aulnoy
Beautheil-Saints
Bellot
Boissy-le-Châtel
Boitron
La Celle-sur-Morin
Chailly-en-Brie
La Chapelle-Moutils
Chartronges
Chauffry
Chevru
Choisy-en-Brie
Coulommiers
Dagny
Doue
La Ferté-Gaucher
Giremoutiers
Hautefeuille
Hondevilliers
Jouy-sur-Morin
Lescherolles
Leudon-en-Brie
Maisoncelles-en-Brie
Marolles-en-Brie
Mauperthuis
Meilleray
Montdauphin
Montenils
Montolivet
Mouroux
Orly-sur-Morin
Pézarches
Rebais
Sablonnières
Saint-Augustin
Saint-Barthélemy
Saint-Cyr-sur-Morin
Saint-Denis-lès-Rebais
Saint-Germain-sous-Doue
Saint-Léger
Saint-Mars-Vieux-Maisons
Saint-Martin-des-Champs
Saint-Ouen-sur-Morin
Saint-Rémy-la-Vanne
Saint-Siméon
Touquin
La Trétoire
Verdelot
Villeneuve-sur-Bellot
See also
Cantons of the Seine-et-Marne department
Communes of the Seine-et-Marne department
References
Coulommiers |
The Zambia Ladies Open is a women's professional golf tournament played in Zambia.
The 2014 event, included on the Sunshine Ladies Tour, marked the first time that Zambia hosted a professional women's tournament. The field included players from Zambia, South Africa, England, Namibia, Swaziland, Sweden, Nigeria, Zimbabwe, Botswana, Kenya and Australia. It coincided with the 50th anniversary celebrations of the Zambia Ladies Golf Union.
Winners
See also
Zambia Open
References
External links
Coverage on the Sunshine Ladies Tour's official site
Sunshine Ladies Tour events
Golf tournaments in Zambia |
Casares de las Hurdes (Casaris in extremaduran), is a municipality located in Las Hurdes, province of Cáceres, Extremadura, Spain. According to the 2006 census (INE), the municipality has a population of 582 inhabitants. The town is famous for its drummers (tamborilerus).
First royal visit to Las Hurdes
King Alfonso XIII visited Las Hurdes in 1922 in order to display the concern of the crown for this remote area. Physician and writer Gregorio Marañón accompanied the young king as guide. The king and his retinue lived in military tents planted near Casares de las Hurdes.
During the king's visit a strange incident took place: A local village chief, concerned that the king was drinking only black coffee (a consequence of the king's aides distrusting the quality of the local milk owing to unsanitary conditions in the area) served the king a small jug of milk saying, "Your Majesty rest assured that this milk is totally trustworthy," which turned out to be from his wife who had recently given birth. The king became aware of this fact only after having had his café con leche.
Hamlets
The following alquerías (small settlements of a few houses) are within Casares de las Hurdes' municipal limits (extremaduran names are in brackets):
Carabusino (Carabusinu)
Casarrubia (Jurdi)
Heras (Las Heras)
Huetre (La Güetri, pronounced "gwetri")
Robledo (Robréu)
References
Las Hurdes
Municipalities in the Province of Cáceres |
The Italian poet Petrarch wrote about his ascent of Mont Ventoux (in Provence; elevation 1912 meters) on 26 April 1336 in a well-known letter published as one of his Epistolae familiares (IV, 1). In this letter, written around 1350, Petrarch claimed to be the first person since antiquity to have climbed a mountain for the view. Although the historical accuracy of his account has been questioned by modern scholars, it is often cited in discussions of the new spirit of the Renaissance.
Contents
Petrarch's letter is addressed to his former confessor, Dionigi di Borgo San Sepolcro. It says he ascended the mountain with his brother Gherardo and two servants exactly ten years after they had left Bologna. They began at the village of Malaucène at the foot of the mountain. On the way up, they met an old shepherd who said he had climbed the mountain some fifty years before, finding only rocks and brambles and that no one else had done it before or since. The brothers continued, Gherardo continuing up the ridge they were following, Petrarch ever trying for an easier, if longer, path. At the top, they found a peak called Filiolus, "Little Son"; Petrarch reflected on the past ten years and the waste of his earthly love for Laura. They looked out from that spot, seeing the Rhone and the Cévennes, but not the Pyrenees (which are 200 miles away). At this point, Petrarch sat down, opened Augustine's Confessions, and immediately came upon "People are moved to wonder by mountain peaks, by vast waves of the sea, by broad waterfalls on rivers, by the all-embracing extent of the ocean, by the revolutions of the stars. But in themselves, they are uninterested." Petrarch fell silent on the trip down, reflecting on the vanity of human wishes and the nobility of uncorrupted human thought. When they arrived back in the village in the middle of the night, Petrarch wrote this letter "hastily and extemporaneously" - or so he says.
Historic doubts
It is often claimed that Petrarch was the first to climb Mont Ventoux, although he did not suggest so himself. The mountain was likely already climbed in prehistoric times. There is even a slightly older written account of an ascent by Jean Buridan, who, on his way to the papal court in Avignon before the year 1334, climbed Mt. Ventoux "to make some meteorological observations." It seems implausible that Petrarch sat down and wrote the six thousand words we have, in elegant Latin with correct quotations from the classical poets, before dinner after an eighteen-hour hike up and down a mountain. In fact, whether Petrarch himself climbed the mountain has been doubted by modern scholars; according to Pierre Courcelle and Giuseppe Billanovich, the letter is essentially a fiction written almost fifteen years after its supposed date, and almost a decade after the death of its addressee, Francesco Dionigi da Borgo San Sepulcro. Lyell Asher argued, indeed, that the ascent of the mountain was a figurative account of writing the letter itself.
Modern reception
Jakob Burckhardt, in The Civilization of the Renaissance in Italy declared Petrarch "a truly modern man" because of the significance of nature for his "receptive spirit"; even if he did not yet have the skill to describe nature. Petrarch's implication that he was the first to climb mountains for pleasure, and Burckhardt's insistence on Petrarch's sensitivity to nature have been often repeated since. There are also numerous references to Petrarch as an "alpinist",. However Mont Ventoux is not a hard climb, and is not usually considered part of the Alps. This implicit claim of Petrarch and Burckhardt, that Petrarch was the first to climb a mountain for pleasure since antiquity, was disproven by Lynn Thorndike in 1943.
The Legitimacy of the Modern Age by Hans Blumenberg describes Petrarch's ascent of Ventoux as "one of the great moments that oscillate indecisively between the epochs," namely between the medieval period and modernity. He also uses it to illustrate his theory of intellectual history: "The description of the ascent of Mont Ventoux exemplifies graphically what is meant by the 'reality' of history as the reoccupation of formal systems of positions."
James Hillman, in Re-Visioning Psychology, uses the story of Petrarch's ascent to illustrate his argument that
the outer world of nature is mirrored by an equally vast inner world of images. Both worlds exist apart from the human being. The outer world may have motivated Petrarch to climb Mont Ventoux, but the inner world is what he discovered when he reached the top and read the passage from Augustine's Confessions.
The findings support this argument, that aesthetic experiences of nature and landscape can also be found in medieval accounts, such as the ascent of the volcanic mountain Vulcano by the Dominican friar Burchard of Mount Sion. Therefore, what is new for Petrarch compared to medieval reports is the artistic representation of his mountain ascent as a subjective experience of autonomy.
Notes and references
See also
Jacob Burckhardt
Bibliography
Bishop, Morris Petrarch and His World. ; Bloomington, Indiana. Indiana University Press 1963
Blumenberg, Hans, The Legitimacy of the Modern Age (tr. Robert M. Wallace). Cambridge, Massachusetts: MIT Press, 1983.
Burckhardt, Jacob. The Civilization of the Renaissance in Italy, (1868) tr. Middlemore; New York, Macmillan 1890.
Michael Kimmelman, "NOT Because it's There", The New York Times, June 6, 1999.
O'Connell, Michael, "Authority and the Truth of Experience in Petrarch's 'Ascent of Mount Ventoux,'" Philological Quarterly'', 62 (1983),
External links
English translation of Ep. Fam. IV 1
14th-century documents
History of mountaineering
Letters (message)
Petrarch
Mountaineering in France |
The Fezouata Formation or Fezouata Shale is a geological formation in Morocco which dates to the Early Ordovician. It was deposited in a marine environment, and is known for its exceptionally preserved fossils, filling an important preservational window beyond the earlier and more common Cambrian Burgess shale-type deposits.
Biota
Over 1,500 non-mineralized specimens, representing 50 distinct taxa that have a composition similar to earlier Burgess Shale type biotas, have been recovered from the formations in addition to a less abundant shelly fauna. The make-up of the community varies significantly through the stratigraphic sequence, with both abundances and faunal composition changing as time progresses. Major burrowing is not present, but there are small (1-3 mm wide) burrows in the sediment, which may indicate that there is not enough oxygen in the water or sediment. Particularly notable is the presence of bryozoa and graptolites, forms that are absent in the Cambrian period. Diverse echinoderms indicate a normal range of salinity, and the overall shelly assemblage is not significantly different from the normal shelly fauna expected in open Ordovician waters. The non-mineralized cohort contains a range of forms familiar from the Burgess Shale: Demosponges, lobopods, barnacles, annelids, radiodonts (e.g. Aegirocassis), possible halkieriids, marrellomorphs, paleoscolecid worms, nektaspids, skaniids as well as the expected problematica. Other Ordovician oddballs are also present, including mitrates, machaeridians, cheloniellids and xiphosurans in abundance.
Depositional setting
The fossiliferous strata were deposited just above storm wave base (offshore to lower shoreface transition), at between water depth. Organisms were likely buried in situ. Because of its placement above storm wave base, storms would have mobilized sediment that could be quickly deposited, trapping animals and leading to their preservation. Consequently, the assemblage is dominated by benthic organisms.
Preservation
Fossils of the Fezouata Formation, which are usually squashed flat (although some do retain some degree of their original three-dimensionality) are often coated with a dusting of pyrite, and tin; this aspect of the fossil preservation is very similar to that at Chengjiang. Non-mineralized appendages are often preserved. While the formation as a whole is over thick, only two intervals, and thick, provide exceptional preservation. Both of these intervals are located near the top of the lower formation, corresponding to the Araneograptus murrayi and Hunnegraptus copiosus graptolite zones respectively.
Location and stratigraphy
The fossils occur within an area of , in southeast Morocco's Draa Valley, north of Zagora. Stratigraphically productive layers are found through a -thick column of rock that spans the Tremadocian and Floian epochs. Two stratigraphic intervals of the formation are fossiliferous: the lower is Late Tremadocian and sits above the base of the formation; the upper, at , is mid-Floian in age.
History
The Lagerstätten were first identified in the late 1990s when a local fossil collector, Ben Moula, showed some of the finds to a PhD student who was then working in the area.
IUGS geological heritage site
In respect of the 'exceptional fossil preservation bridging the Cambrian Explosion and the Great Ordovician Biodiversification', the International Union of Geological Sciences (IUGS) included the 'Ordovician Fezouata Shale Fossil Site at Jbeltizagzaouine' in its assemblage of 100 'geological heritage sites' around the world in a listing published in October 2022. The organisation defines an IUGS Geological Heritage Site as 'a key place with geological elements and/or processes of international scientific relevance, used as a reference, and/or with a substantial contribution to the development of geological sciences through history.'
Paleobiota
After and subsequent literature:
Arthropods
Echinoderms
Molluscs
Conodonts
Other animals
References
Geologic formations of Morocco
Ordovician System of Africa
Lower Ordovician Series
Tremadocian
Floian
Shale formations
Paleontology in Morocco
First 100 IUGS Geological Heritage Sites |
Prófugas del Destino (Running from Destiny) is a Spanish-language telenovela produced by the Mexican television network TV Azteca. The stars and crews are mainly from Mujer Comprada.
Cast
Main cast
Additional cast
Armando Torrea ... Raúl Caballero
Fernando Ciangherotti ... Mario Fernández
Martin Navarrete... Marcelo Villar
Wendy de los Cobos ... Susana Fernández
Verónica Langer ... Rebeca Acuña
Roxana Chávez ... Sandra Mendoza
Guillermo Quintanilla ... José Maria Mendoza
Erick Chapa ... Pablo
Vanessa Ciangherotti ... Tina Varela
Lila Avilé ... Carla
Roberto Montiel ... Reynoso
Lissete Cuevas ... Matilde
Fidel Garrida ... Padre Jacinto
Gerardo Lama ... Ignacio
Cecilia Romo ... Madre Lourdes
Pascacio Lopez ... Rios
Carlos Torres-Torrija ... Polo
Francisco Porras ... Arevalo
Rodolfo Arias ... Eduardo Mendoza
References
External links
2010 telenovelas
2010 Mexican television series debuts
TV Azteca telenovelas
2011 Mexican television series endings
Mexican television series based on Argentine television series
Spanish-language telenovelas |
```php
<?php
/**
*/
namespace OCA\User_LDAP\Tests\Integration\Lib\User;
use OCA\User_LDAP\FilesystemHelper;
use OCA\User_LDAP\Mapping\UserMapping;
use OCA\User_LDAP\Tests\Integration\AbstractIntegrationTest;
use OCA\User_LDAP\User\DeletedUsersIndex;
use OCA\User_LDAP\User\Manager;
use OCA\User_LDAP\User\User;
use OCA\User_LDAP\User_LDAP;
use OCA\User_LDAP\UserPluginManager;
use OCP\IAvatarManager;
use OCP\Image;
use Psr\Log\LoggerInterface;
require_once __DIR__ . '/../../Bootstrap.php';
class IntegrationTestUserAvatar extends AbstractIntegrationTest {
/** @var UserMapping */
protected $mapping;
/**
* prepares the LDAP environment and sets up a test configuration for
* the LDAP backend.
*/
public function init() {
require(__DIR__ . '/../../setup-scripts/createExplicitUsers.php');
parent::init();
$this->mapping = new UserMapping(\OC::$server->getDatabaseConnection());
$this->mapping->clear();
$this->access->setUserMapper($this->mapping);
$userBackend = new User_LDAP($this->access, \OC::$server->getNotificationManager(), \OC::$server->get(UserPluginManager::class), \OC::$server->get(LoggerInterface::class), \OC::$server->get(DeletedUsersIndex::class));
\OC_User::useBackend($userBackend);
}
/**
* A method that does the common steps of test cases 1 and 2. The evaluation
* is not happening here.
*
* @param string $dn
* @param string $username
* @param string $image
*/
private function execFetchTest($dn, $username, $image) {
$this->setJpegPhotoAttribute($dn, $image);
// assigns our self-picked oc username to the dn
$this->mapping->map($dn, $username, 'fakeUUID-' . $username);
// initialize home folder and make sure that the user will update
// also remove an possibly existing avatar
\OC_Util::tearDownFS();
\OC_Util::setupFS($username);
\OC::$server->getUserFolder($username);
\OC::$server->getConfig()->deleteUserValue($username, 'user_ldap', User::USER_PREFKEY_LASTREFRESH);
if (\OC::$server->get(IAvatarManager::class)->getAvatar($username)->exists()) {
\OC::$server->get(IAvatarManager::class)->getAvatar($username)->remove();
}
// finally attempt to get the avatar set
$user = $this->userManager->get($dn);
$user->updateAvatar();
}
/**
* tests whether an avatar can be retrieved from LDAP and stored correctly
*
* @return bool
*/
protected function case1() {
$image = file_get_contents(__DIR__ . '/../../data/avatar-valid.jpg');
$dn = 'uid=alice,ou=Users,' . $this->base;
$username = 'alice1337';
$this->execFetchTest($dn, $username, $image);
return \OC::$server->get(IAvatarManager::class)->getAvatar($username)->exists();
}
/**
* tests whether an image received from LDAP which is of an invalid file
* type is dealt with properly (i.e. not set and not dying).
*
* @return bool
*/
protected function case2() {
// gif by Pmspinner from path_to_url
$image = file_get_contents(__DIR__ . '/../../data/avatar-invalid.gif');
$dn = 'uid=boris,ou=Users,' . $this->base;
$username = 'boris7844';
$this->execFetchTest($dn, $username, $image);
return !\OC::$server->get(IAvatarManager::class)->getAvatar($username)->exists();
}
/**
* This writes an image to the 'jpegPhoto' attribute on LDAP.
*
* @param string $dn
* @param string $image An image read via file_get_contents
* @throws \OC\ServerNotAvailableException
*/
private function setJpegPhotoAttribute($dn, $image) {
$changeSet = ['jpegphoto' => $image];
ldap_mod_add($this->connection->getConnectionResource(), $dn, $changeSet);
}
protected function initUserManager() {
$this->userManager = new Manager(
\OC::$server->getConfig(),
new FilesystemHelper(),
\OC::$server->get(LoggerInterface::class),
\OC::$server->get(IAvatarManager::class),
new Image(),
\OC::$server->getDatabaseConnection(),
\OC::$server->getUserManager(),
\OC::$server->getNotificationManager()
);
}
/**
* sets up the LDAP configuration to be used for the test
*/
protected function initConnection() {
parent::initConnection();
$this->connection->setConfiguration([
'ldapUserFilter' => 'objectclass=inetOrgPerson',
'ldapUserDisplayName' => 'displayName',
'ldapGroupDisplayName' => 'cn',
'ldapLoginFilter' => 'uid=%uid',
]);
}
}
/** @var string $host */
/** @var int $port */
/** @var string $adn */
/** @var string $apwd */
/** @var string $bdn */
$test = new IntegrationTestUserAvatar($host, $port, $adn, $apwd, $bdn);
$test->init();
$test->run();
``` |
Scott Manor House was built sometime between 1769 and 1772 and is now a museum in Bedford, Nova Scotia. It is the second oldest house in the Halifax Regional Municipality, after the Morris House, and was built by Joseph Scott on the land once owned by his brother Captain George Scott. The house was built next to Fort Sackville, which was under the command of Joseph Scott (1760).
See also
History of the Halifax Regional Municipality
List of oldest buildings and structures in Halifax, Nova Scotia
Fultz House
References
Other reading
Brian Cuthertson and Gillis Architects. Joseph Scott and the Scott Manor House. Halifax Regional Municipality. 2002
Bedford’s buried history. Chronicle Herald. 24 May 2013
Scott Manor House - Canada's Historic Places
Scott Manor House - Official Site
Houses in Nova Scotia
Historic house museums in Nova Scotia
Museums in Halifax, Nova Scotia
Bedford, Nova Scotia |
The Berlin declaration (German: Berliner Erklärung) was a theological statement by 56 leading Evangelical theologians in Germany. The declaration condemns the German Pentecostal movement which had started two years earlier in Kassel. It stated that the Pentecostal movement was “not from above, but from below”. The declaration specifically mentions Jonathan Paul as the movement's leader, but it is not clear that Jonathan Paul saw himself as such. The declaration was formally revoked by the Gnadauer Gemeinschaftsverbandes in a statement of January 2009. This move is seen a major step toward reconciliation between Pentecostals and non-Pentecostal churches in Germany.
References
Christian statements of faith
Pentecostalism in Europe
1909 in Christianity
1909 documents |
There are 151 colleges affiliated to the University of Kerala, which is in Thiruvananthapuram in the state of Kerala, India. This list is categorised into two main parts, Autonomous colleges and Non-Autonomous colleges. Autonomous colleges are bestowed academic independence, primarily in order to enhance the level of education in those colleges.
A college may be classified as government run, private unaided, or private aided. A government college receives full funding from the Government of Kerala, while a private unaided college receives no funding from the government. In a private aided college, one or more of its courses receives partial funding from the government.
Affiliated colleges
Architecture colleges
Autonomous colleges
Mar Ivanios College
Nalanchira
Fatima Matha National College
Kollam
Assumption College
Chanaganacherry
CMS College
Kottayam
Maharaja’s College
Ernakulam
Mar Athanasious College
Kothamangalam
Marian College
Kuttikkanam
Rajagiri College of Social Sciences
Kalamassery
Sacred Heart College
Thevara
St. Albert's College
Ernakulam
St. Berchmans College
Changanassery
St. Teresa's College
Ernakulam
Christ College, Irinjalakuda
Irinjalakuda
Farook College
Calicut
M.E.S. Mampad College
St. Joseph's College, Devagiri
Calicut
St. Joseph's College, Irinjalakuda
Thrissur
St. Thomas College
Thrissur
Vimala College, Engineering College
Mar Baselios College of Engineering and technology,Nalanchira
Engineering colleges
The only engineering college affiliated to university of Kerala is University College of Engineering, Kariavattom. From the academic year 2015-16, all other colleges affiliated to the University of Kerala except UCEK are now affiliated to KTU.
M B A colleges
References
Colleges Affiliated
Affiliated
Kerala |
Ingri Aunet Tyldum (born 14 October 1983 in Overhalla) is a Norwegian cross-country skier who has competed since 2002. Her best World Cup finish was eighth in a sprint event in Sweden in 2008.
Cross-country skiing results
All results are sourced from the International Ski Federation (FIS).
World Cup
Season standings
Team podiums
1 victory
1 podium
References
External links
1983 births
Living people
Norwegian female cross-country skiers
People from Overhalla
Skiers from Trøndelag |
Jim Hendrick (July 26, 1934 - June 15, 2017) was an American sports announcer. Hendrick worked in sports broadcasting for over 50 years. He gained fame for his work as a spokesman for Anheuser-Busch and his association with the American Power Boat Association.
For several years in the 1960s, Hendrick was the play by play announcer for the Detroit Pistons on WKBD, channel 50, Detroit.
Hendrick was a member of the Detroit Sports Broadcasters Association, which was founded in 1948 by Detroit Tigers announcer Ty Tyson.
Hendrick died at the age of 82 in Lakeland, Florida.
References
1934 births
2017 deaths
Sportspeople from Detroit
American sports announcers |
```c++
/*
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
/* cJSON */
/* JSON parser in C. */
/* disable warnings about old C89 functions in MSVC */
#if !defined(_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER)
#define _CRT_SECURE_NO_DEPRECATE
#endif
#ifdef __GNUC__
#pragma GCC visibility push(default)
#endif
#if defined(_MSC_VER)
#pragma warning (push)
/* disable warning about single line comments in system headers */
#pragma warning (disable : 4001)
#endif
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <float.h>
#include <limits.h>
#include <ctype.h>
#ifdef ENABLE_LOCALES
#include <locale.h>
#endif
#if defined(_MSC_VER)
#pragma warning (pop)
#endif
#ifdef __GNUC__
#pragma GCC visibility pop
#endif
#include "cJSON.h"
/* define our own boolean type */
#define true ((cJSON_bool)1)
#define false ((cJSON_bool)0)
typedef struct {
const unsigned char *json;
size_t position;
} error;
static error global_error = { NULL, 0 };
CJSON_PUBLIC(const char *) cJSON_GetErrorPtr(void)
{
return (const char*) (global_error.json + global_error.position);
}
CJSON_PUBLIC(char *) cJSON_GetStringValue(cJSON *item) {
if (!cJSON_IsString(item)) {
return NULL;
}
return item->valuestring;
}
/* This is a safeguard to prevent copy-pasters from using incompatible C and header files */
#if (CJSON_VERSION_MAJOR != 1) || (CJSON_VERSION_MINOR != 7) || (CJSON_VERSION_PATCH != 1)
#error cJSON.h and cJSON.c have different versions. Make sure that both have the same.
#endif
CJSON_PUBLIC(const char*) cJSON_Version(void)
{
static char version[15];
sprintf(version, "%i.%i.%i", CJSON_VERSION_MAJOR, CJSON_VERSION_MINOR, CJSON_VERSION_PATCH);
return version;
}
/* Case insensitive string comparison, doesn't consider two NULL pointers equal though */
static int case_insensitive_strcmp(const unsigned char *string1, const unsigned char *string2)
{
if ((string1 == NULL) || (string2 == NULL))
{
return 1;
}
if (string1 == string2)
{
return 0;
}
for(; tolower(*string1) == tolower(*string2); (void)string1++, string2++)
{
if (*string1 == '\0')
{
return 0;
}
}
return tolower(*string1) - tolower(*string2);
}
typedef struct internal_context
{
size_t buffer_size;
cJSON_bool format;
cJSON_bool allow_data_after_json;
cJSON_bool case_sensitive;
cJSON_Allocators allocators;
void *userdata;
size_t end_position;
} internal_context;
#if defined(_MSC_VER)
/* work around MSVC error C2322: '...' address of dillimport '...' is not static */
static void *internal_malloc(size_t size)
{
return malloc(size);
}
static void internal_free(void *pointer)
{
free(pointer);
}
#else
#define internal_malloc malloc
#define internal_free free
#endif
/* old style allocators for cJSON_InitHooks */
static cJSON_Hooks global_allocators = {
internal_malloc,
internal_free
};
/* wrappers around global old style allocators */
static void *global_allocate(size_t size, void *userdata)
{
(void)userdata;
return global_allocators.malloc_fn(size);
}
static void global_deallocate(void *pointer, void *userdata)
{
(void)userdata;
free(pointer);
}
/* wrappers around standard allocators */
static void *malloc_wrapper(size_t size, void *userdata)
{
(void)userdata;
return malloc(size);
}
static void *realloc_wrapper(void *pointer, size_t size, void *userdata)
{
(void)userdata;
return realloc(pointer, size);
}
static void free_wrapper(void *pointer, void *userdata)
{
(void)userdata;
free(pointer);
}
/* helpers to allocate memory with the allocators in a context */
static void *allocate(const internal_context * const context, size_t size)
{
return context->allocators.allocate(size, context->userdata);
}
static void *reallocate(const internal_context * const context, void *pointer, size_t size)
{
return context->allocators.reallocate(pointer, size, context->userdata);
}
static void deallocate(const internal_context * const context, void *pointer)
{
context->allocators.deallocate(pointer, context->userdata);
}
#define default_context {\
256, /* default buffer size */\
true, /* enable formatting by default */\
true, /* allow data after the JSON by default */\
true, /* case sensitive by default */\
{\
malloc_wrapper,\
free_wrapper,\
realloc_wrapper\
},\
NULL, /* no userdata */\
0 /* default end position */\
}
/* this is necessary to assign the default context after initialization */
static internal_context global_default_context = default_context;
static internal_context global_context = default_context;
static unsigned char* custom_strdup(const unsigned char* string, const internal_context * const context)
{
size_t length = 0;
unsigned char *copy = NULL;
if (string == NULL)
{
return NULL;
}
length = strlen((const char*)string) + sizeof("");
copy = (unsigned char*)allocate(context, length);
if (copy == NULL)
{
return NULL;
}
memcpy(copy, string, length);
return copy;
}
CJSON_PUBLIC(void) cJSON_InitHooks(cJSON_Hooks* hooks)
{
if (hooks == NULL)
{
/* reset global context */
global_context.allocators.allocate = malloc_wrapper;
global_context.allocators.deallocate = free_wrapper;
global_context.allocators.reallocate = realloc_wrapper;
return;
}
global_allocators.malloc_fn = internal_malloc;
if (hooks->malloc_fn != NULL)
{
global_allocators.malloc_fn = hooks->malloc_fn;
}
global_allocators.free_fn = internal_free;
if (hooks->free_fn != NULL)
{
global_allocators.free_fn = hooks->free_fn;
}
/* set the wrappers in the global context */
global_context.allocators.allocate = global_allocate;
global_context.allocators.deallocate = global_deallocate;
global_context.allocators.reallocate = NULL;
}
/* Internal constructor. */
static cJSON *create_item(const internal_context * const context)
{
cJSON* node = (cJSON*)allocate(context, sizeof(cJSON));
if (node)
{
memset(node, '\0', sizeof(cJSON));
}
return node;
}
/* Delete a cJSON structure. */
static void delete_item(cJSON *item, const internal_context * const context)
{
cJSON *next = NULL;
while (item != NULL)
{
next = item->next;
if (!(item->type & cJSON_IsReference) && (item->child != NULL))
{
delete_item(item->child, context);
}
if (!(item->type & cJSON_IsReference) && (item->valuestring != NULL))
{
deallocate(context, item->valuestring);
}
if (!(item->type & cJSON_StringIsConst) && (item->string != NULL))
{
deallocate(context, item->string);
}
deallocate(context, item);
item = next;
}
}
/* Delete a cJSON structure. */
CJSON_PUBLIC(void) cJSON_Delete(cJSON *item)
{
delete_item(item, &global_context);
}
static int double_to_saturated_integer(double number)
{
if (number >= INT_MAX)
{
return INT_MAX;
}
else if (number <= INT_MIN)
{
return INT_MIN;
}
return (int)number;
}
/* get the decimal point character of the current locale */
static unsigned char get_decimal_point(void)
{
#ifdef ENABLE_LOCALES
struct lconv *lconv = localeconv();
return (unsigned char) lconv->decimal_point[0];
#else
return '.';
#endif
}
typedef struct
{
const unsigned char *content;
size_t length;
size_t offset;
size_t depth; /* How deeply nested (in arrays/objects) is the input at the current offset. */
internal_context context;
} parse_buffer;
/* check if the given size is left to read in a given parse buffer (starting with 1) */
#define can_read(buffer, size) ((buffer != NULL) && (((buffer)->offset + size) <= (buffer)->length))
/* check if the buffer can be accessed at the given index (starting with 0) */
#define can_access_at_index(buffer, index) ((buffer != NULL) && (((buffer)->offset + index) < (buffer)->length))
#define cannot_access_at_index(buffer, index) (!can_access_at_index(buffer, index))
/* get a pointer to the buffer at the position */
#define buffer_at_offset(buffer) ((buffer)->content + (buffer)->offset)
/* Parse the input text to generate a number, and populate the result into item. */
static cJSON_bool parse_number(cJSON * const item, parse_buffer * const input_buffer)
{
double number = 0;
unsigned char *after_end = NULL;
unsigned char number_c_string[64];
unsigned char decimal_point = get_decimal_point();
size_t i = 0;
if ((input_buffer == NULL) || (input_buffer->content == NULL))
{
return false;
}
/* copy the number into a temporary buffer and replace '.' with the decimal point
* of the current locale (for strtod)
* This also takes care of '\0' not necessarily being available for marking the end of the input */
for (i = 0; (i < (sizeof(number_c_string) - 1)) && can_access_at_index(input_buffer, i); i++)
{
switch (buffer_at_offset(input_buffer)[i])
{
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
case '+':
case '-':
case 'e':
case 'E':
number_c_string[i] = buffer_at_offset(input_buffer)[i];
break;
case '.':
number_c_string[i] = decimal_point;
break;
default:
goto loop_end;
}
}
loop_end:
number_c_string[i] = '\0';
number = strtod((const char*)number_c_string, (char**)&after_end);
if (number_c_string == after_end)
{
return false; /* parse_error */
}
item->valuedouble = number;
item->valueint = double_to_saturated_integer(number);
item->type = cJSON_Number;
input_buffer->offset += (size_t)(after_end - number_c_string);
return true;
}
/* don't ask me, but the original cJSON_SetNumberValue returns an integer or double */
CJSON_PUBLIC(double) cJSON_SetNumberHelper(cJSON *object, double number)
{
object->valueint = double_to_saturated_integer(number);
return object->valuedouble = number;
}
typedef struct
{
unsigned char *buffer;
size_t length;
size_t offset;
size_t depth; /* current nesting depth (for formatted printing) */
cJSON_bool noalloc;
internal_context context;
} printbuffer;
/* realloc printbuffer if necessary to have at least "needed" bytes more */
static unsigned char* ensure(printbuffer * const p, size_t needed)
{
unsigned char *newbuffer = NULL;
size_t newsize = 0;
if ((p == NULL) || (p->buffer == NULL))
{
return NULL;
}
if ((p->length > 0) && (p->offset >= p->length))
{
/* make sure that offset is valid */
return NULL;
}
if (needed > INT_MAX)
{
/* sizes bigger than INT_MAX are currently not supported */
return NULL;
}
needed += p->offset + 1;
if (needed <= p->length)
{
return p->buffer + p->offset;
}
if (p->noalloc) {
return NULL;
}
/* calculate new buffer size */
if (needed > (INT_MAX / 2))
{
/* overflow of int, use INT_MAX if possible */
if (needed <= INT_MAX)
{
newsize = INT_MAX;
}
else
{
return NULL;
}
}
else
{
newsize = needed * 2;
}
if (p->context.allocators.reallocate != NULL)
{
/* reallocate with realloc if available */
newbuffer = (unsigned char*)reallocate(&p->context, p->buffer, newsize);
if (newbuffer == NULL)
{
deallocate(&p->context, p->buffer);
p->length = 0;
p->buffer = NULL;
return NULL;
}
}
else
{
/* otherwise reallocate manually */
newbuffer = (unsigned char*)allocate(&p->context, newsize);
if (!newbuffer)
{
deallocate(&p->context, p->buffer);
p->length = 0;
p->buffer = NULL;
return NULL;
}
if (newbuffer)
{
memcpy(newbuffer, p->buffer, p->offset + 1);
}
deallocate(&p->context, p->buffer);
}
p->length = newsize;
p->buffer = newbuffer;
return newbuffer + p->offset;
}
/* calculate the new length of the string in a printbuffer and update the offset */
static void update_offset(printbuffer * const buffer)
{
const unsigned char *buffer_pointer = NULL;
if ((buffer == NULL) || (buffer->buffer == NULL))
{
return;
}
buffer_pointer = buffer->buffer + buffer->offset;
buffer->offset += strlen((const char*)buffer_pointer);
}
#define is_nan(number) (number != number)
#define is_infinity(number) (!is_nan(number) && (number * 0) != 0)
/* Render the number nicely from the given item into a string. */
static cJSON_bool print_number(const cJSON * const item, printbuffer * const output_buffer)
{
unsigned char *output_pointer = NULL;
double number = item->valuedouble;
int integer = double_to_saturated_integer(number);
int length = 0;
size_t i = 0;
unsigned char number_buffer[26]; /* temporary buffer to print the number into */
unsigned char decimal_point = get_decimal_point();
double test;
if (output_buffer == NULL)
{
return false;
}
if (is_nan(number) || is_infinity(number))
{
length = sprintf((char*)number_buffer, "null");
}
else if (number == integer) /* avoid overhead for integers */
{
length = sprintf((char*)number_buffer, "%d", integer);
}
else
{
/* Try 15 decimal places of precision to avoid nonsignificant nonzero digits */
length = sprintf((char*)number_buffer, "%1.15g", number);
/* Check whether the original double can be recovered */
if ((sscanf((char*)number_buffer, "%lg", &test) != 1) || ((double)test != number))
{
/* If not, print with 17 decimal places of precision */
length = sprintf((char*)number_buffer, "%1.17g", number);
}
}
/* sprintf failed or buffer overrun occured */
if ((length < 0) || (length > (int)(sizeof(number_buffer) - 1)))
{
return false;
}
/* reserve appropriate space in the output */
output_pointer = ensure(output_buffer, (size_t)length + sizeof(""));
if (output_pointer == NULL)
{
return false;
}
/* copy the printed number to the output and replace locale
* dependent decimal point with '.' */
for (i = 0; i < ((size_t)length); i++)
{
if (number_buffer[i] == decimal_point)
{
output_pointer[i] = '.';
continue;
}
output_pointer[i] = number_buffer[i];
}
output_pointer[i] = '\0';
output_buffer->offset += (size_t)length;
return true;
}
/* parse 4 digit hexadecimal number */
static unsigned parse_hex4(const unsigned char * const input)
{
unsigned int h = 0;
size_t i = 0;
for (i = 0; i < 4; i++)
{
/* parse digit */
if ((input[i] >= '0') && (input[i] <= '9'))
{
h += (unsigned int) input[i] - '0';
}
else if ((input[i] >= 'A') && (input[i] <= 'F'))
{
h += (unsigned int) 10 + input[i] - 'A';
}
else if ((input[i] >= 'a') && (input[i] <= 'f'))
{
h += (unsigned int) 10 + input[i] - 'a';
}
else /* invalid */
{
return 0;
}
if (i < 3)
{
/* shift left to make place for the next nibble */
h = h << 4;
}
}
return h;
}
/* converts a UTF-16 literal to UTF-8
* A literal can be one or two sequences of the form \uXXXX */
static unsigned char utf16_literal_to_utf8(const unsigned char * const input_pointer, const unsigned char * const input_end, unsigned char **output_pointer)
{
long unsigned int codepoint = 0;
unsigned int first_code = 0;
const unsigned char *first_sequence = input_pointer;
unsigned char utf8_length = 0;
unsigned char utf8_position = 0;
unsigned char sequence_length = 0;
unsigned char first_byte_mark = 0;
if ((input_end - first_sequence) < 6)
{
/* input ends unexpectedly */
goto fail;
}
/* get the first utf16 sequence */
first_code = parse_hex4(first_sequence + 2);
/* check that the code is valid */
if (((first_code >= 0xDC00) && (first_code <= 0xDFFF)))
{
goto fail;
}
/* UTF16 surrogate pair */
if ((first_code >= 0xD800) && (first_code <= 0xDBFF))
{
const unsigned char *second_sequence = first_sequence + 6;
unsigned int second_code = 0;
sequence_length = 12; /* \uXXXX\uXXXX */
if ((input_end - second_sequence) < 6)
{
/* input ends unexpectedly */
goto fail;
}
if ((second_sequence[0] != '\\') || (second_sequence[1] != 'u'))
{
/* missing second half of the surrogate pair */
goto fail;
}
/* get the second utf16 sequence */
second_code = parse_hex4(second_sequence + 2);
/* check that the code is valid */
if ((second_code < 0xDC00) || (second_code > 0xDFFF))
{
/* invalid second half of the surrogate pair */
goto fail;
}
/* calculate the unicode codepoint from the surrogate pair */
codepoint = 0x10000 + (((first_code & 0x3FF) << 10) | (second_code & 0x3FF));
}
else
{
sequence_length = 6; /* \uXXXX */
codepoint = first_code;
}
/* encode as UTF-8
* takes at maximum 4 bytes to encode:
* 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
if (codepoint < 0x80)
{
/* normal ascii, encoding 0xxxxxxx */
utf8_length = 1;
}
else if (codepoint < 0x800)
{
/* two bytes, encoding 110xxxxx 10xxxxxx */
utf8_length = 2;
first_byte_mark = 0xC0; /* 11000000 */
}
else if (codepoint < 0x10000)
{
/* three bytes, encoding 1110xxxx 10xxxxxx 10xxxxxx */
utf8_length = 3;
first_byte_mark = 0xE0; /* 11100000 */
}
else if (codepoint <= 0x10FFFF)
{
/* four bytes, encoding 1110xxxx 10xxxxxx 10xxxxxx 10xxxxxx */
utf8_length = 4;
first_byte_mark = 0xF0; /* 11110000 */
}
else
{
/* invalid unicode codepoint */
goto fail;
}
/* encode as utf8 */
for (utf8_position = (unsigned char)(utf8_length - 1); utf8_position > 0; utf8_position--)
{
/* 10xxxxxx */
(*output_pointer)[utf8_position] = (unsigned char)((codepoint | 0x80) & 0xBF);
codepoint >>= 6;
}
/* encode first byte */
if (utf8_length > 1)
{
(*output_pointer)[0] = (unsigned char)((codepoint | first_byte_mark) & 0xFF);
}
else
{
(*output_pointer)[0] = (unsigned char)(codepoint & 0x7F);
}
*output_pointer += utf8_length;
return sequence_length;
fail:
return 0;
}
/* Parse the input text into an unescaped cinput, and populate item. */
static cJSON_bool parse_string(cJSON * const item, parse_buffer * const input_buffer)
{
const unsigned char *input_pointer = buffer_at_offset(input_buffer) + 1;
const unsigned char *input_end = buffer_at_offset(input_buffer) + 1;
unsigned char *output_pointer = NULL;
unsigned char *output = NULL;
/* not a string */
if (buffer_at_offset(input_buffer)[0] != '\"')
{
goto fail;
}
{
/* calculate approximate size of the output (overestimate) */
size_t allocation_length = 0;
size_t skipped_bytes = 0;
while (((size_t)(input_end - input_buffer->content) < input_buffer->length) && (*input_end != '\"'))
{
/* is escape sequence */
if (input_end[0] == '\\')
{
if ((size_t)(input_end + 1 - input_buffer->content) >= input_buffer->length)
{
/* prevent buffer overflow when last input character is a backslash */
goto fail;
}
skipped_bytes++;
input_end++;
}
input_end++;
}
if (((size_t)(input_end - input_buffer->content) >= input_buffer->length) || (*input_end != '\"'))
{
goto fail; /* string ended unexpectedly */
}
/* This is at most how much we need for the output */
allocation_length = (size_t) (input_end - buffer_at_offset(input_buffer)) - skipped_bytes;
output = (unsigned char*)allocate(&input_buffer->context, allocation_length + sizeof(""));
if (output == NULL)
{
goto fail; /* allocation failure */
}
}
output_pointer = output;
/* loop through the string literal */
while (input_pointer < input_end)
{
if (*input_pointer != '\\')
{
*output_pointer++ = *input_pointer++;
}
/* escape sequence */
else
{
unsigned char sequence_length = 2;
if ((input_end - input_pointer) < 1)
{
goto fail;
}
switch (input_pointer[1])
{
case 'b':
*output_pointer++ = '\b';
break;
case 'f':
*output_pointer++ = '\f';
break;
case 'n':
*output_pointer++ = '\n';
break;
case 'r':
*output_pointer++ = '\r';
break;
case 't':
*output_pointer++ = '\t';
break;
case '\"':
case '\\':
case '/':
*output_pointer++ = input_pointer[1];
break;
/* UTF-16 literal */
case 'u':
sequence_length = utf16_literal_to_utf8(input_pointer, input_end, &output_pointer);
if (sequence_length == 0)
{
/* failed to convert UTF16-literal to UTF-8 */
goto fail;
}
break;
default:
goto fail;
}
input_pointer += sequence_length;
}
}
/* zero terminate the output */
*output_pointer = '\0';
item->type = cJSON_String;
item->valuestring = (char*)output;
input_buffer->offset = (size_t) (input_end - input_buffer->content);
input_buffer->offset++;
return true;
fail:
if (output != NULL)
{
deallocate(&input_buffer->context, output);
}
if (input_pointer != NULL)
{
input_buffer->offset = (size_t)(input_pointer - input_buffer->content);
}
return false;
}
/* Render the cstring provided to an escaped version that can be printed. */
static cJSON_bool print_string_ptr(const unsigned char * const input, printbuffer * const output_buffer)
{
const unsigned char *input_pointer = NULL;
unsigned char *output = NULL;
unsigned char *output_pointer = NULL;
size_t output_length = 0;
/* numbers of additional characters needed for escaping */
size_t escape_characters = 0;
if (output_buffer == NULL)
{
return false;
}
/* empty string */
if (input == NULL)
{
output = ensure(output_buffer, sizeof("\"\""));
if (output == NULL)
{
return false;
}
strcpy((char*)output, "\"\"");
return true;
}
/* set "flag" to 1 if something needs to be escaped */
for (input_pointer = input; *input_pointer; input_pointer++)
{
switch (*input_pointer)
{
case '\"':
case '\\':
case '\b':
case '\f':
case '\n':
case '\r':
case '\t':
/* one character escape sequence */
escape_characters++;
break;
default:
if (*input_pointer < 32)
{
/* UTF-16 escape sequence uXXXX */
escape_characters += 5;
}
break;
}
}
output_length = (size_t)(input_pointer - input) + escape_characters;
output = ensure(output_buffer, output_length + sizeof("\"\""));
if (output == NULL)
{
return false;
}
/* no characters have to be escaped */
if (escape_characters == 0)
{
output[0] = '\"';
memcpy(output + 1, input, output_length);
output[output_length + 1] = '\"';
output[output_length + 2] = '\0';
return true;
}
output[0] = '\"';
output_pointer = output + 1;
/* copy the string */
for (input_pointer = input; *input_pointer != '\0'; (void)input_pointer++, output_pointer++)
{
if ((*input_pointer > 31) && (*input_pointer != '\"') && (*input_pointer != '\\'))
{
/* normal character, copy */
*output_pointer = *input_pointer;
}
else
{
/* character needs to be escaped */
*output_pointer++ = '\\';
switch (*input_pointer)
{
case '\\':
*output_pointer = '\\';
break;
case '\"':
*output_pointer = '\"';
break;
case '\b':
*output_pointer = 'b';
break;
case '\f':
*output_pointer = 'f';
break;
case '\n':
*output_pointer = 'n';
break;
case '\r':
*output_pointer = 'r';
break;
case '\t':
*output_pointer = 't';
break;
default:
/* escape and print as unicode codepoint */
sprintf((char*)output_pointer, "u%04x", *input_pointer);
output_pointer += 4;
break;
}
}
}
output[output_length + 1] = '\"';
output[output_length + 2] = '\0';
return true;
}
/* Invoke print_string_ptr (which is useful) on an item. */
static cJSON_bool print_string(const cJSON * const item, printbuffer * const p)
{
return print_string_ptr((unsigned char*)item->valuestring, p);
}
/* Predeclare these prototypes. */
static cJSON_bool parse_value(cJSON * const item, parse_buffer * const input_buffer);
static cJSON_bool print_value(const cJSON * const item, printbuffer * const output_buffer);
static cJSON_bool parse_array(cJSON * const item, parse_buffer * const input_buffer);
static cJSON_bool print_array(const cJSON * const item, printbuffer * const output_buffer);
static cJSON_bool parse_object(cJSON * const item, parse_buffer * const input_buffer);
static cJSON_bool print_object(const cJSON * const item, printbuffer * const output_buffer);
/* Utility to jump whitespace and cr/lf */
static parse_buffer *buffer_skip_whitespace(parse_buffer * const buffer)
{
if ((buffer == NULL) || (buffer->content == NULL))
{
return NULL;
}
while (can_access_at_index(buffer, 0) && (buffer_at_offset(buffer)[0] <= 32))
{
buffer->offset++;
}
if (buffer->offset == buffer->length)
{
buffer->offset--;
}
return buffer;
}
/* skip the UTF-8 BOM (byte order mark) if it is at the beginning of a buffer */
static parse_buffer *skip_utf8_bom(parse_buffer * const buffer)
{
if ((buffer == NULL) || (buffer->content == NULL) || (buffer->offset != 0))
{
return NULL;
}
if (can_access_at_index(buffer, 4) && (strncmp((const char*)buffer_at_offset(buffer), "\xEF\xBB\xBF", 3) == 0))
{
buffer->offset += 3;
}
return buffer;
}
/* Parse an object - create a new root, and populate. */
static cJSON *parse(const char * const json, internal_context * const context)
{
parse_buffer buffer = { 0, 0, 0, 0, default_context };
cJSON *item = NULL;
/* reset global error position */
global_error.json = NULL;
global_error.position = 0;
if (json == NULL)
{
goto fail;
}
buffer.content = (const unsigned char*)json;
buffer.length = strlen((const char*)json) + sizeof("");
buffer.offset = 0;
buffer.context = *context;
item = create_item(context);
if (item == NULL)
{
goto fail;
}
if (!parse_value(item, buffer_skip_whitespace(skip_utf8_bom(&buffer))))
{
/* parse failure. error position is set. */
goto fail;
}
if (!context->allow_data_after_json)
{
buffer_skip_whitespace(&buffer);
if ((buffer.offset >= buffer.length) || buffer_at_offset(&buffer)[0] != '\0')
{
goto fail;
}
}
context->end_position = buffer.offset;
return item;
fail:
if (item != NULL)
{
delete_item(item, context);
}
if (json != NULL)
{
error local_error;
local_error.json = (const unsigned char*)json;
local_error.position = 0;
if (buffer.offset < buffer.length)
{
local_error.position = buffer.offset;
}
else if (buffer.length > 0)
{
local_error.position = buffer.length - 1;
}
context->end_position = local_error.position;
global_error = local_error;
}
return NULL;
}
/* Parse an object - create a new root, and populate. */
CJSON_PUBLIC(cJSON *) cJSON_ParseWithOpts(const char *json, const char **return_parse_end, cJSON_bool require_null_terminated)
{
internal_context context = global_context;
cJSON *item = NULL;
context.allow_data_after_json = !require_null_terminated;
item = parse(json, &context);
if (return_parse_end != NULL)
{
*return_parse_end = json + context.end_position;
}
return item;
}
/* Default options for cJSON_Parse */
CJSON_PUBLIC(cJSON *) cJSON_Parse(const char *json)
{
return parse(json, &global_context);
}
#define cjson_min(a, b) ((a < b) ? a : b)
static unsigned char *print(const cJSON * const item, const internal_context * const context)
{
printbuffer buffer[1];
unsigned char *printed = NULL;
memset(buffer, 0, sizeof(buffer));
/* create buffer */
buffer->buffer = (unsigned char*)allocate(context, context->buffer_size);
buffer->length = context->buffer_size;
buffer->context = *context;
if (buffer->buffer == NULL)
{
goto fail;
}
/* print the value */
if (!print_value(item, buffer))
{
goto fail;
}
update_offset(buffer);
/* Reallocate the buffer so that it only uses as much as it needs.
This can save up to 50% because ensure increases the buffer size by a factor of 2 */
/* check if reallocate is available */
if (context->allocators.reallocate != NULL)
{
printed = (unsigned char*)reallocate(context, buffer->buffer, buffer->offset + 1);
buffer->buffer = NULL;
if (printed == NULL) {
goto fail;
}
}
else /* otherwise copy the JSON over to a new buffer */
{
printed = (unsigned char*)allocate(context, buffer->offset + 1);
if (printed == NULL)
{
goto fail;
}
memcpy(printed, buffer->buffer, cjson_min(buffer->length, buffer->offset + 1));
printed[buffer->offset] = '\0'; /* just to be sure */
/* free the buffer */
deallocate(context, buffer->buffer);
}
return printed;
fail:
if (buffer->buffer != NULL)
{
deallocate(context, buffer->buffer);
}
if (printed != NULL)
{
deallocate(context, printed);
}
return NULL;
}
/* Render a cJSON item/entity/structure to text. */
CJSON_PUBLIC(char *) cJSON_Print(const cJSON *item)
{
return (char*)print(item, &global_context);
}
CJSON_PUBLIC(char *) cJSON_PrintUnformatted(const cJSON *item)
{
internal_context context = global_context;
context.format = false;
return (char*)print(item, &context);
}
CJSON_PUBLIC(char *) cJSON_PrintBuffered(const cJSON *item, int prebuffer, cJSON_bool format)
{
internal_context context = global_context;
if (prebuffer < 0)
{
return NULL;
}
context.buffer_size = (size_t)prebuffer;
context.format = format;
return (char*)print(item, &context);
}
CJSON_PUBLIC(cJSON_bool) cJSON_PrintPreallocated(cJSON *item, char *buffer, const int length, const cJSON_bool format)
{
printbuffer p = { 0, 0, 0, 0, 0, default_context };
if ((length < 0) || (buffer == NULL))
{
return false;
}
p.buffer = (unsigned char*)buffer;
p.length = (size_t)length;
p.offset = 0;
p.noalloc = true;
p.context = global_context;
p.context.format = format;
return print_value(item, &p);
}
/* Parser core - when encountering text, process appropriately. */
static cJSON_bool parse_value(cJSON * const item, parse_buffer * const input_buffer)
{
if ((input_buffer == NULL) || (input_buffer->content == NULL))
{
return false; /* no input */
}
if (!can_read(input_buffer, 1))
{
return false;
}
/* parse the different types of values */
switch (buffer_at_offset(input_buffer)[0])
{
/* number */
case '-':
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
return parse_number(item, input_buffer);
/* string */
case '\"':
return parse_string(item, input_buffer);
/* array */
case '[':
return parse_array(item, input_buffer);
/* object */
case '{':
return parse_object(item, input_buffer);
/* null */
case 'n':
if (can_read(input_buffer, 4) && (strncmp((const char*)buffer_at_offset(input_buffer), "null", 4) == 0))
{
item->type = cJSON_NULL;
input_buffer->offset += 4;
return true;
}
return false;
/* true */
case 't':
if (can_read(input_buffer, 4) && (strncmp((const char*)buffer_at_offset(input_buffer), "true", 4) == 0))
{
item->type = cJSON_True;
item->valueint = 1;
input_buffer->offset += 4;
return true;
}
return false;
/* false */
case 'f':
if (can_read(input_buffer, 5) && (strncmp((const char*)buffer_at_offset(input_buffer), "false", 5) == 0))
{
item->type = cJSON_False;
input_buffer->offset += 5;
return true;
}
return false;
default:
return false;
}
}
/* Render a value to text. */
static cJSON_bool print_value(const cJSON * const item, printbuffer * const output_buffer)
{
unsigned char *output = NULL;
if ((item == NULL) || (output_buffer == NULL))
{
return false;
}
switch ((item->type) & 0xFF)
{
case cJSON_NULL:
output = ensure(output_buffer, 5);
if (output == NULL)
{
return false;
}
strcpy((char*)output, "null");
return true;
case cJSON_False:
output = ensure(output_buffer, 6);
if (output == NULL)
{
return false;
}
strcpy((char*)output, "false");
return true;
case cJSON_True:
output = ensure(output_buffer, 5);
if (output == NULL)
{
return false;
}
strcpy((char*)output, "true");
return true;
case cJSON_Number:
return print_number(item, output_buffer);
case cJSON_Raw:
{
size_t raw_length = 0;
if (item->valuestring == NULL)
{
if (!output_buffer->noalloc)
{
deallocate(&output_buffer->context, output_buffer->buffer);
}
return false;
}
raw_length = strlen(item->valuestring) + sizeof("");
output = ensure(output_buffer, raw_length);
if (output == NULL)
{
return false;
}
memcpy(output, item->valuestring, raw_length);
return true;
}
case cJSON_String:
return print_string(item, output_buffer);
case cJSON_Array:
return print_array(item, output_buffer);
case cJSON_Object:
return print_object(item, output_buffer);
default:
return false;
}
}
/* Build an array from input text. */
static cJSON_bool parse_array(cJSON * const item, parse_buffer * const input_buffer)
{
cJSON *head = NULL; /* head of the linked list */
cJSON *current_item = NULL;
if (input_buffer->depth >= CJSON_NESTING_LIMIT)
{
return false; /* to deeply nested */
}
input_buffer->depth++;
if (buffer_at_offset(input_buffer)[0] != '[')
{
/* not an array */
goto fail;
}
input_buffer->offset++;
buffer_skip_whitespace(input_buffer);
if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == ']'))
{
/* empty array */
goto success;
}
/* check if we skipped to the end of the buffer */
if (cannot_access_at_index(input_buffer, 0))
{
input_buffer->offset--;
goto fail;
}
/* step back to character in front of the first element */
input_buffer->offset--;
/* loop through the comma separated array elements */
do
{
/* allocate next item */
cJSON *new_item = create_item(&(input_buffer->context));
if (new_item == NULL)
{
goto fail; /* allocation failure */
}
/* attach next item to list */
if (head == NULL)
{
/* start the linked list */
current_item = head = new_item;
}
else
{
/* add to the end and advance */
current_item->next = new_item;
new_item->prev = current_item;
current_item = new_item;
}
/* parse next value */
input_buffer->offset++;
buffer_skip_whitespace(input_buffer);
if (!parse_value(current_item, input_buffer))
{
goto fail; /* failed to parse value */
}
buffer_skip_whitespace(input_buffer);
}
while (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == ','));
if (cannot_access_at_index(input_buffer, 0) || buffer_at_offset(input_buffer)[0] != ']')
{
goto fail; /* expected end of array */
}
success:
input_buffer->depth--;
item->type = cJSON_Array;
item->child = head;
input_buffer->offset++;
return true;
fail:
if (head != NULL)
{
delete_item(head, &input_buffer->context);
}
return false;
}
/* Render an array to text */
static cJSON_bool print_array(const cJSON * const item, printbuffer * const output_buffer)
{
unsigned char *output_pointer = NULL;
size_t length = 0;
cJSON *current_element = item->child;
if (output_buffer == NULL)
{
return false;
}
/* Compose the output array. */
/* opening square bracket */
output_pointer = ensure(output_buffer, 1);
if (output_pointer == NULL)
{
return false;
}
*output_pointer = '[';
output_buffer->offset++;
output_buffer->depth++;
while (current_element != NULL)
{
if (!print_value(current_element, output_buffer))
{
return false;
}
update_offset(output_buffer);
if (current_element->next)
{
length = (size_t) (output_buffer->context.format ? 2 : 1);
output_pointer = ensure(output_buffer, length + 1);
if (output_pointer == NULL)
{
return false;
}
*output_pointer++ = ',';
if(output_buffer->context.format)
{
*output_pointer++ = ' ';
}
*output_pointer = '\0';
output_buffer->offset += length;
}
current_element = current_element->next;
}
output_pointer = ensure(output_buffer, 2);
if (output_pointer == NULL)
{
return false;
}
*output_pointer++ = ']';
*output_pointer = '\0';
output_buffer->depth--;
return true;
}
/* Build an object from the text. */
static cJSON_bool parse_object(cJSON * const item, parse_buffer * const input_buffer)
{
cJSON *head = NULL; /* linked list head */
cJSON *current_item = NULL;
if (input_buffer->depth >= CJSON_NESTING_LIMIT)
{
return false; /* to deeply nested */
}
input_buffer->depth++;
if (cannot_access_at_index(input_buffer, 0) || (buffer_at_offset(input_buffer)[0] != '{'))
{
goto fail; /* not an object */
}
input_buffer->offset++;
buffer_skip_whitespace(input_buffer);
if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == '}'))
{
goto success; /* empty object */
}
/* check if we skipped to the end of the buffer */
if (cannot_access_at_index(input_buffer, 0))
{
input_buffer->offset--;
goto fail;
}
/* step back to character in front of the first element */
input_buffer->offset--;
/* loop through the comma separated array elements */
do
{
/* allocate next item */
cJSON *new_item = create_item(&(input_buffer->context));
if (new_item == NULL)
{
goto fail; /* allocation failure */
}
/* attach next item to list */
if (head == NULL)
{
/* start the linked list */
current_item = head = new_item;
}
else
{
/* add to the end and advance */
current_item->next = new_item;
new_item->prev = current_item;
current_item = new_item;
}
/* parse the name of the child */
input_buffer->offset++;
buffer_skip_whitespace(input_buffer);
if (!parse_string(current_item, input_buffer))
{
goto fail; /* faile to parse name */
}
buffer_skip_whitespace(input_buffer);
/* swap valuestring and string, because we parsed the name */
current_item->string = current_item->valuestring;
current_item->valuestring = NULL;
if (cannot_access_at_index(input_buffer, 0) || (buffer_at_offset(input_buffer)[0] != ':'))
{
goto fail; /* invalid object */
}
/* parse the value */
input_buffer->offset++;
buffer_skip_whitespace(input_buffer);
if (!parse_value(current_item, input_buffer))
{
goto fail; /* failed to parse value */
}
buffer_skip_whitespace(input_buffer);
}
while (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == ','));
if (cannot_access_at_index(input_buffer, 0) || (buffer_at_offset(input_buffer)[0] != '}'))
{
goto fail; /* expected end of object */
}
success:
input_buffer->depth--;
item->type = cJSON_Object;
item->child = head;
input_buffer->offset++;
return true;
fail:
if (head != NULL)
{
delete_item(head, &input_buffer->context);
}
return false;
}
/* Render an object to text. */
static cJSON_bool print_object(const cJSON * const item, printbuffer * const output_buffer)
{
unsigned char *output_pointer = NULL;
size_t length = 0;
cJSON *current_item = item->child;
if (output_buffer == NULL)
{
return false;
}
/* Compose the output: */
length = (size_t) (output_buffer->context.format ? 2 : 1); /* fmt: {\n */
output_pointer = ensure(output_buffer, length + 1);
if (output_pointer == NULL)
{
return false;
}
*output_pointer++ = '{';
output_buffer->depth++;
if (output_buffer->context.format)
{
*output_pointer++ = '\n';
}
output_buffer->offset += length;
while (current_item)
{
if (output_buffer->context.format)
{
size_t i;
output_pointer = ensure(output_buffer, output_buffer->depth);
if (output_pointer == NULL)
{
return false;
}
for (i = 0; i < output_buffer->depth; i++)
{
*output_pointer++ = '\t';
}
output_buffer->offset += output_buffer->depth;
}
/* print key */
if (!print_string_ptr((unsigned char*)current_item->string, output_buffer))
{
return false;
}
update_offset(output_buffer);
length = (size_t) (output_buffer->context.format ? 2 : 1);
output_pointer = ensure(output_buffer, length);
if (output_pointer == NULL)
{
return false;
}
*output_pointer++ = ':';
if (output_buffer->context.format)
{
*output_pointer++ = '\t';
}
output_buffer->offset += length;
/* print value */
if (!print_value(current_item, output_buffer))
{
return false;
}
update_offset(output_buffer);
/* print comma if not last */
length = (size_t) ((output_buffer->context.format ? 1 : 0) + (current_item->next ? 1 : 0));
output_pointer = ensure(output_buffer, length + 1);
if (output_pointer == NULL)
{
return false;
}
if (current_item->next)
{
*output_pointer++ = ',';
}
if (output_buffer->context.format)
{
*output_pointer++ = '\n';
}
*output_pointer = '\0';
output_buffer->offset += length;
current_item = current_item->next;
}
output_pointer = ensure(output_buffer, output_buffer->context.format ? (output_buffer->depth + 1) : 2);
if (output_pointer == NULL)
{
return false;
}
if (output_buffer->context.format)
{
size_t i;
for (i = 0; i < (output_buffer->depth - 1); i++)
{
*output_pointer++ = '\t';
}
}
*output_pointer++ = '}';
*output_pointer = '\0';
output_buffer->depth--;
return true;
}
static size_t get_array_size(const cJSON * const array)
{
cJSON *child = NULL;
size_t size = 0;
if (array == NULL)
{
return 0;
}
child = array->child;
while (child != NULL)
{
size++;
child = child->next;
}
return size;
}
/* Get Array size/item / object item. */
CJSON_PUBLIC(int) cJSON_GetArraySize(const cJSON *array)
{
size_t size = get_array_size(array);
if (size > INT_MAX)
{
/* This is incorrect but can't be fixed without breaking the API */
return INT_MAX;
}
return (int)size;
}
static cJSON* get_array_item(const cJSON *array, size_t index)
{
cJSON *current_child = NULL;
if (array == NULL)
{
return NULL;
}
current_child = array->child;
while ((current_child != NULL) && (index > 0))
{
index--;
current_child = current_child->next;
}
return current_child;
}
CJSON_PUBLIC(cJSON *) cJSON_GetArrayItem(const cJSON *array, int index)
{
if (index < 0)
{
return NULL;
}
return get_array_item(array, (size_t)index);
}
static cJSON *get_object_item(const cJSON * const object, const char * const name, const internal_context * const context)
{
cJSON *current_element = NULL;
if ((object == NULL) || (name == NULL))
{
return NULL;
}
current_element = object->child;
if (context->case_sensitive)
{
while ((current_element != NULL) && (strcmp(name, current_element->string) != 0))
{
current_element = current_element->next;
}
}
else
{
while ((current_element != NULL) && (case_insensitive_strcmp((const unsigned char*)name, (const unsigned char*)(current_element->string)) != 0))
{
current_element = current_element->next;
}
}
return current_element;
}
CJSON_PUBLIC(cJSON *) cJSON_GetObjectItem(const cJSON * const object, const char * const string)
{
internal_context context = default_context;
context.case_sensitive = false;
return get_object_item(object, string, &context);
}
CJSON_PUBLIC(cJSON *) cJSON_GetObjectItemCaseSensitive(const cJSON * const object, const char * const string)
{
internal_context context = default_context;
context.case_sensitive = true;
return get_object_item(object, string, &context);
}
CJSON_PUBLIC(cJSON_bool) cJSON_HasObjectItem(const cJSON *object, const char *string)
{
return cJSON_GetObjectItem(object, string) ? 1 : 0;
}
/* Utility for array list handling. */
static void suffix_object(cJSON *prev, cJSON *item)
{
prev->next = item;
item->prev = prev;
}
/* Utility for handling references. */
static cJSON *create_reference(const cJSON *item, const internal_context * const context)
{
cJSON *reference = NULL;
if (item == NULL)
{
return NULL;
}
reference = create_item(context);
if (reference == NULL)
{
return NULL;
}
memcpy(reference, item, sizeof(cJSON));
reference->string = NULL;
reference->type |= cJSON_IsReference;
reference->next = reference->prev = NULL;
return reference;
}
static cJSON_bool add_item_to_array(cJSON *array, cJSON *item)
{
cJSON *child = NULL;
if ((item == NULL) || (array == NULL))
{
return false;
}
child = array->child;
if (child == NULL)
{
/* list is empty, start new one */
array->child = item;
}
else
{
/* append to the end */
while (child->next)
{
child = child->next;
}
suffix_object(child, item);
}
return true;
}
/* Add item to array/object. */
CJSON_PUBLIC(void) cJSON_AddItemToArray(cJSON *array, cJSON *item)
{
add_item_to_array(array, item);
}
#if defined(__clang__) || (defined(__GNUC__) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ > 5))))
#pragma GCC diagnostic push
#endif
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wcast-qual"
#endif
/* helper function to cast away const */
static void* cast_away_const(const void* string)
{
return (void*)string;
}
#if defined(__clang__) || (defined(__GNUC__) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ > 5))))
#pragma GCC diagnostic pop
#endif
static cJSON_bool add_item_to_object(cJSON * const object, const char * const string, cJSON * const item, const internal_context * const context, const cJSON_bool constant_key)
{
if ((object == NULL) || (string == NULL) || (item == NULL))
{
return false;
}
if (!(item->type & cJSON_StringIsConst) && (item->string != NULL))
{
deallocate(context, item->string);
}
if (constant_key)
{
item->string = (char*)cast_away_const(string);
item->type |= cJSON_StringIsConst;
}
else
{
char *key = (char*)custom_strdup((const unsigned char*)string, context);
if (key == NULL)
{
return false;
}
item->string = key;
item->type &= ~cJSON_StringIsConst;
}
return add_item_to_array(object, item);
}
CJSON_PUBLIC(void) cJSON_AddItemToObject(cJSON *object, const char *string, cJSON *item)
{
add_item_to_object(object, string, item, &global_context, false);
}
/* Add an item to an object with constant string as key */
CJSON_PUBLIC(void) cJSON_AddItemToObjectCS(cJSON *object, const char *string, cJSON *item)
{
add_item_to_object(object, string, item, &global_context, true);
}
CJSON_PUBLIC(void) cJSON_AddItemReferenceToArray(cJSON *array, cJSON *item)
{
if (array == NULL)
{
return;
}
add_item_to_array(array, create_reference(item, &global_context));
}
CJSON_PUBLIC(void) cJSON_AddItemReferenceToObject(cJSON *object, const char *string, cJSON *item)
{
if ((object == NULL) || (string == NULL))
{
return;
}
add_item_to_object(object, string, create_reference(item, &global_context), &global_context, false);
}
CJSON_PUBLIC(cJSON*) cJSON_AddNullToObject(cJSON * const object, const char * const name)
{
cJSON *null = cJSON_CreateNull();
if (add_item_to_object(object, name, null, &global_context, false))
{
return null;
}
delete_item(null, &global_context);
return NULL;
}
CJSON_PUBLIC(cJSON*) cJSON_AddTrueToObject(cJSON * const object, const char * const name)
{
cJSON *true_item = cJSON_CreateTrue();
if (add_item_to_object(object, name, true_item, &global_context, false))
{
return true_item;
}
delete_item(true_item, &global_context);
return NULL;
}
CJSON_PUBLIC(cJSON*) cJSON_AddFalseToObject(cJSON * const object, const char * const name)
{
cJSON *false_item = cJSON_CreateFalse();
if (add_item_to_object(object, name, false_item, &global_context, false))
{
return false_item;
}
delete_item(false_item, &global_context);
return NULL;
}
CJSON_PUBLIC(cJSON*) cJSON_AddBoolToObject(cJSON * const object, const char * const name, const cJSON_bool boolean)
{
cJSON *bool_item = cJSON_CreateBool(boolean);
if (add_item_to_object(object, name, bool_item, &global_context, false))
{
return bool_item;
}
delete_item(bool_item, &global_context);
return NULL;
}
CJSON_PUBLIC(cJSON*) cJSON_AddNumberToObject(cJSON * const object, const char * const name, const double number)
{
cJSON *number_item = cJSON_CreateNumber(number);
if (add_item_to_object(object, name, number_item, &global_context, false))
{
return number_item;
}
delete_item(number_item, &global_context);
return NULL;
}
CJSON_PUBLIC(cJSON*) cJSON_AddStringToObject(cJSON * const object, const char * const name, const char * const string)
{
cJSON *string_item = cJSON_CreateString(string);
if (add_item_to_object(object, name, string_item, &global_context, false))
{
return string_item;
}
delete_item(string_item, &global_context);
return NULL;
}
CJSON_PUBLIC(cJSON*) cJSON_AddRawToObject(cJSON * const object, const char * const name, const char * const raw)
{
cJSON *raw_item = cJSON_CreateRaw(raw);
if (add_item_to_object(object, name, raw_item, &global_context, false))
{
return raw_item;
}
delete_item(raw_item, &global_context);
return NULL;
}
CJSON_PUBLIC(cJSON*) cJSON_AddObjectToObject(cJSON * const object, const char * const name)
{
cJSON *object_item = cJSON_CreateObject();
if (add_item_to_object(object, name, object_item, &global_context, false))
{
return object_item;
}
delete_item(object_item, &global_context);
return NULL;
}
CJSON_PUBLIC(cJSON*) cJSON_AddArrayToObject(cJSON * const object, const char * const name)
{
cJSON *array = cJSON_CreateArray();
if (add_item_to_object(object, name, array, &global_context, false))
{
return array;
}
delete_item(array, &global_context);
return NULL;
}
CJSON_PUBLIC(cJSON *) cJSON_DetachItemViaPointer(cJSON *parent, cJSON * const item)
{
if ((parent == NULL) || (item == NULL))
{
return NULL;
}
if (item->prev != NULL)
{
/* not the first element */
item->prev->next = item->next;
}
if (item->next != NULL)
{
/* not the last element */
item->next->prev = item->prev;
}
if (item == parent->child)
{
/* first element */
parent->child = item->next;
}
/* make sure the detached item doesn't point anywhere anymore */
item->prev = NULL;
item->next = NULL;
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_DetachItemFromArray(cJSON *array, int which)
{
if (which < 0)
{
return NULL;
}
return cJSON_DetachItemViaPointer(array, get_array_item(array, (size_t)which));
}
CJSON_PUBLIC(void) cJSON_DeleteItemFromArray(cJSON *array, int which)
{
delete_item(cJSON_DetachItemFromArray(array, which), &global_context);
}
CJSON_PUBLIC(cJSON *) cJSON_DetachItemFromObject(cJSON *object, const char *string)
{
cJSON *to_detach = cJSON_GetObjectItem(object, string);
return cJSON_DetachItemViaPointer(object, to_detach);
}
CJSON_PUBLIC(cJSON *) cJSON_DetachItemFromObjectCaseSensitive(cJSON *object, const char *string)
{
cJSON *to_detach = cJSON_GetObjectItemCaseSensitive(object, string);
return cJSON_DetachItemViaPointer(object, to_detach);
}
CJSON_PUBLIC(void) cJSON_DeleteItemFromObject(cJSON *object, const char *string)
{
delete_item(cJSON_DetachItemFromObject(object, string), &global_context);
}
CJSON_PUBLIC(void) cJSON_DeleteItemFromObjectCaseSensitive(cJSON *object, const char *string)
{
delete_item(cJSON_DetachItemFromObjectCaseSensitive(object, string), &global_context);
}
/* Replace array/object items with new ones. */
CJSON_PUBLIC(void) cJSON_InsertItemInArray(cJSON *array, int which, cJSON *newitem)
{
cJSON *after_inserted = NULL;
if (which < 0)
{
return;
}
after_inserted = get_array_item(array, (size_t)which);
if (after_inserted == NULL)
{
add_item_to_array(array, newitem);
return;
}
newitem->next = after_inserted;
newitem->prev = after_inserted->prev;
after_inserted->prev = newitem;
if (after_inserted == array->child)
{
array->child = newitem;
}
else
{
newitem->prev->next = newitem;
}
}
CJSON_PUBLIC(cJSON_bool) cJSON_ReplaceItemViaPointer(cJSON * const parent, cJSON * const item, cJSON * replacement)
{
if ((parent == NULL) || (replacement == NULL) || (item == NULL))
{
return false;
}
if (replacement == item)
{
return true;
}
replacement->next = item->next;
replacement->prev = item->prev;
if (replacement->next != NULL)
{
replacement->next->prev = replacement;
}
if (replacement->prev != NULL)
{
replacement->prev->next = replacement;
}
if (parent->child == item)
{
parent->child = replacement;
}
item->next = NULL;
item->prev = NULL;
delete_item(item, &global_context);
return true;
}
CJSON_PUBLIC(void) cJSON_ReplaceItemInArray(cJSON *array, int which, cJSON *newitem)
{
if (which < 0)
{
return;
}
cJSON_ReplaceItemViaPointer(array, get_array_item(array, (size_t)which), newitem);
}
static cJSON_bool replace_item_in_object(cJSON *object, const char *string, cJSON *replacement, const internal_context * const context)
{
if ((replacement == NULL) || (string == NULL))
{
return false;
}
/* replace the name in the replacement */
if (!(replacement->type & cJSON_StringIsConst) && (replacement->string != NULL))
{
cJSON_free(replacement->string);
}
replacement->string = (char*)custom_strdup((const unsigned char*)string, &global_context);
replacement->type &= ~cJSON_StringIsConst;
cJSON_ReplaceItemViaPointer(object, get_object_item(object, string, context), replacement);
return true;
}
CJSON_PUBLIC(void) cJSON_ReplaceItemInObject(cJSON *object, const char *string, cJSON *newitem)
{
internal_context context = global_context;
context.case_sensitive = false;
replace_item_in_object(object, string, newitem, &context);
}
CJSON_PUBLIC(void) cJSON_ReplaceItemInObjectCaseSensitive(cJSON *object, const char *string, cJSON *newitem)
{
internal_context context = global_context;
context.case_sensitive = true;
replace_item_in_object(object, string, newitem, &context);
}
/* Create basic types: */
CJSON_PUBLIC(cJSON *) cJSON_CreateNull(void)
{
cJSON *item = create_item(&global_context);
if(item)
{
item->type = cJSON_NULL;
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateTrue(void)
{
cJSON *item = create_item(&global_context);
if(item)
{
item->type = cJSON_True;
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateFalse(void)
{
cJSON *item = create_item(&global_context);
if(item)
{
item->type = cJSON_False;
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateBool(cJSON_bool boolean)
{
cJSON *item = create_item(&global_context);
if(item)
{
item->type = boolean ? cJSON_True : cJSON_False;
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateNumber(double num)
{
cJSON *item = create_item(&global_context);
if(item)
{
item->type = cJSON_Number;
item->valuedouble = num;
item->valueint = double_to_saturated_integer(num);
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateString(const char *string)
{
cJSON *item = create_item(&global_context);
if(item)
{
item->type = cJSON_String;
item->valuestring = (char*)custom_strdup((const unsigned char*)string, &global_context);
if(!item->valuestring)
{
delete_item(item, &global_context);
return NULL;
}
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateStringReference(const char *string)
{
cJSON *item = create_item(&global_context);
if (item != NULL)
{
item->type = cJSON_String | cJSON_IsReference;
item->valuestring = (char*)cast_away_const(string);
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateObjectReference(const cJSON *child)
{
cJSON *item = create_item(&global_context);
if (item != NULL) {
item->type = cJSON_Object | cJSON_IsReference;
item->child = (cJSON*)cast_away_const(child);
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateArrayReference(const cJSON *child) {
cJSON *item = create_item(&global_context);
if (item != NULL) {
item->type = cJSON_Array | cJSON_IsReference;
item->child = (cJSON*)cast_away_const(child);
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateRaw(const char *raw)
{
cJSON *item = create_item(&global_context);
if(item)
{
item->type = cJSON_Raw;
item->valuestring = (char*)custom_strdup((const unsigned char*)raw, &global_context);
if(!item->valuestring)
{
delete_item(item, &global_context);
return NULL;
}
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateArray(void)
{
cJSON *item = create_item(&global_context);
if(item)
{
item->type=cJSON_Array;
}
return item;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateObject(void)
{
cJSON *item = create_item(&global_context);
if (item)
{
item->type = cJSON_Object;
}
return item;
}
/* Create Arrays: */
CJSON_PUBLIC(cJSON *) cJSON_CreateIntArray(const int *numbers, int count)
{
size_t i = 0;
cJSON *n = NULL;
cJSON *p = NULL;
cJSON *a = NULL;
if ((count < 0) || (numbers == NULL))
{
return NULL;
}
a = cJSON_CreateArray();
for(i = 0; a && (i < (size_t)count); i++)
{
n = cJSON_CreateNumber(numbers[i]);
if (!n)
{
delete_item(a, &global_context);
return NULL;
}
if(!i)
{
a->child = n;
}
else
{
suffix_object(p, n);
}
p = n;
}
return a;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateFloatArray(const float *numbers, int count)
{
size_t i = 0;
cJSON *n = NULL;
cJSON *p = NULL;
cJSON *a = NULL;
if ((count < 0) || (numbers == NULL))
{
return NULL;
}
a = cJSON_CreateArray();
for(i = 0; a && (i < (size_t)count); i++)
{
n = cJSON_CreateNumber((double)numbers[i]);
if(!n)
{
delete_item(a, &global_context);
return NULL;
}
if(!i)
{
a->child = n;
}
else
{
suffix_object(p, n);
}
p = n;
}
return a;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateDoubleArray(const double *numbers, int count)
{
size_t i = 0;
cJSON *n = NULL;
cJSON *p = NULL;
cJSON *a = NULL;
if ((count < 0) || (numbers == NULL))
{
return NULL;
}
a = cJSON_CreateArray();
for(i = 0;a && (i < (size_t)count); i++)
{
n = cJSON_CreateNumber(numbers[i]);
if(!n)
{
delete_item(a, &global_context);
return NULL;
}
if(!i)
{
a->child = n;
}
else
{
suffix_object(p, n);
}
p = n;
}
return a;
}
CJSON_PUBLIC(cJSON *) cJSON_CreateStringArray(const char **strings, int count)
{
size_t i = 0;
cJSON *n = NULL;
cJSON *p = NULL;
cJSON *a = NULL;
if ((count < 0) || (strings == NULL))
{
return NULL;
}
a = cJSON_CreateArray();
for (i = 0; a && (i < (size_t)count); i++)
{
n = cJSON_CreateString(strings[i]);
if(!n)
{
delete_item(a, &global_context);
return NULL;
}
if(!i)
{
a->child = n;
}
else
{
suffix_object(p,n);
}
p = n;
}
return a;
}
/* Duplication */
CJSON_PUBLIC(cJSON *) cJSON_Duplicate(const cJSON *item, cJSON_bool recurse)
{
cJSON *newitem = NULL;
cJSON *child = NULL;
cJSON *next = NULL;
cJSON *newchild = NULL;
/* Bail on bad ptr */
if (!item)
{
goto fail;
}
/* Create new item */
newitem = create_item(&global_context);
if (!newitem)
{
goto fail;
}
/* Copy over all vars */
newitem->type = item->type & (~cJSON_IsReference);
newitem->valueint = item->valueint;
newitem->valuedouble = item->valuedouble;
if (item->valuestring)
{
newitem->valuestring = (char*)custom_strdup((unsigned char*)item->valuestring, &global_context);
if (!newitem->valuestring)
{
goto fail;
}
}
if (item->string)
{
newitem->string = (item->type&cJSON_StringIsConst) ? item->string : (char*)custom_strdup((unsigned char*)item->string, &global_context);
if (!newitem->string)
{
goto fail;
}
}
/* If non-recursive, then we're done! */
if (!recurse)
{
return newitem;
}
/* Walk the ->next chain for the child. */
child = item->child;
while (child != NULL)
{
newchild = cJSON_Duplicate(child, true); /* Duplicate (with recurse) each item in the ->next chain */
if (!newchild)
{
goto fail;
}
if (next != NULL)
{
/* If newitem->child already set, then crosswire ->prev and ->next and move on */
next->next = newchild;
newchild->prev = next;
next = newchild;
}
else
{
/* Set newitem->child and move to it */
newitem->child = newchild;
next = newchild;
}
child = child->next;
}
return newitem;
fail:
if (newitem != NULL)
{
delete_item(newitem, &global_context);
}
return NULL;
}
CJSON_PUBLIC(void) cJSON_Minify(char *json)
{
unsigned char *into = (unsigned char*)json;
if (json == NULL)
{
return;
}
while (*json)
{
if (*json == ' ')
{
json++;
}
else if (*json == '\t')
{
/* Whitespace characters. */
json++;
}
else if (*json == '\r')
{
json++;
}
else if (*json=='\n')
{
json++;
}
else if ((*json == '/') && (json[1] == '/'))
{
/* double-slash comments, to end of line. */
while (*json && (*json != '\n'))
{
json++;
}
}
else if ((*json == '/') && (json[1] == '*'))
{
/* multiline comments. */
while (*json && !((*json == '*') && (json[1] == '/')))
{
json++;
}
json += 2;
}
else if (*json == '\"')
{
/* string literals, which are \" sensitive. */
*into++ = (unsigned char)*json++;
while (*json && (*json != '\"'))
{
if (*json == '\\')
{
*into++ = (unsigned char)*json++;
}
*into++ = (unsigned char)*json++;
}
*into++ = (unsigned char)*json++;
}
else
{
/* All other characters. */
*into++ = (unsigned char)*json++;
}
}
/* and null-terminate. */
*into = '\0';
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsInvalid(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & 0xFF) == cJSON_Invalid;
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsFalse(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & 0xFF) == cJSON_False;
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsTrue(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & 0xff) == cJSON_True;
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsBool(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & (cJSON_True | cJSON_False)) != 0;
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsNull(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & 0xFF) == cJSON_NULL;
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsNumber(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & 0xFF) == cJSON_Number;
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsString(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & 0xFF) == cJSON_String;
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsArray(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & 0xFF) == cJSON_Array;
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsObject(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & 0xFF) == cJSON_Object;
}
CJSON_PUBLIC(cJSON_bool) cJSON_IsRaw(const cJSON * const item)
{
if (item == NULL)
{
return false;
}
return (item->type & 0xFF) == cJSON_Raw;
}
CJSON_PUBLIC(cJSON_Context) cJSON_DuplicateContext(const cJSON_Context context, const cJSON_Allocators * const allocators, void *allocator_userdata)
{
internal_context *duplicate = NULL;
const cJSON_Allocators *local_allocators = &global_default_context.allocators;
if (allocators != NULL)
{
if ((allocators->allocate == NULL) || (allocators->deallocate == NULL))
{
return NULL;
}
local_allocators = allocators;
}
duplicate = (internal_context*)local_allocators->allocate(sizeof(internal_context), allocator_userdata);
if (duplicate == NULL)
{
return NULL;
}
memcpy(duplicate, context, sizeof(internal_context));
return duplicate;
}
CJSON_PUBLIC(cJSON_Context) cJSON_CreateContext(const cJSON_Allocators * const allocators, void *allocator_userdata)
{
return cJSON_DuplicateContext((cJSON_Context)&global_default_context, allocators, allocator_userdata);
}
CJSON_PUBLIC(cJSON_Context) cJSON_SetAllocators(cJSON_Context context, const cJSON_Allocators allocators)
{
if ((context == NULL) || (allocators.allocate == NULL) || (allocators.deallocate == NULL))
{
return NULL;
}
((internal_context*)context)->allocators = allocators;
((internal_context*)context)->userdata = NULL;
return context;
}
/* Change the allocator userdata attached to a cJSON_Context */
CJSON_PUBLIC(cJSON_Context) cJSON_SetUserdata(cJSON_Context context, void *userdata)
{
if (context == NULL)
{
return NULL;
}
((internal_context*)context)->userdata = userdata;
return context;
}
CJSON_PUBLIC(size_t) cJSON_GetParseEnd(cJSON_Context context)
{
if (context == NULL)
{
return 0;
}
return ((internal_context*)context)->end_position;
}
CJSON_PUBLIC(cJSON_Context) cJSON_SetPrebufferSize(cJSON_Context context, const size_t buffer_size)
{
if ((context == NULL) || (buffer_size == 0))
{
return NULL;
}
((internal_context*)context)->buffer_size = buffer_size;
return context;
}
CJSON_PUBLIC(cJSON_Context) cJSON_SetFormat(cJSON_Context context, cJSON_Format format)
{
if (context == NULL)
{
return NULL;
}
switch (format)
{
case CJSON_FORMAT_MINIFIED:
((internal_context*)context)->format = false;
break;
case CJSON_FORMAT_DEFAULT:
((internal_context*)context)->format = true;
break;
default:
return NULL;
}
return context;
}
CJSON_PUBLIC(cJSON_Context) cJSON_MakeCaseSensitive(cJSON_Context context, cJSON_bool case_sensitive)
{
if (context == NULL)
{
return NULL;
}
((internal_context*)context)->case_sensitive = case_sensitive;
return context;
}
CJSON_PUBLIC(cJSON_Context) cJSON_AllowDataAfterJson(cJSON_Context context, cJSON_bool allow_data_after_json)
{
if (context == NULL)
{
return NULL;
}
((internal_context*)context)->allow_data_after_json = allow_data_after_json;
return context;
}
static cJSON_bool compare(const cJSON * const a, const cJSON * const b, const internal_context * const context)
{
if ((a == NULL) || (b == NULL) || ((a->type & 0xFF) != (b->type & 0xFF)) || cJSON_IsInvalid(a))
{
return false;
}
/* check if type is valid */
switch (a->type & 0xFF)
{
case cJSON_False:
case cJSON_True:
case cJSON_NULL:
case cJSON_Number:
case cJSON_String:
case cJSON_Raw:
case cJSON_Array:
case cJSON_Object:
break;
default:
return false;
}
/* identical objects are equal */
if (a == b)
{
return true;
}
switch (a->type & 0xFF)
{
/* in these cases and equal type is enough */
case cJSON_False:
case cJSON_True:
case cJSON_NULL:
return true;
case cJSON_Number:
if (a->valuedouble == b->valuedouble)
{
return true;
}
return false;
case cJSON_String:
case cJSON_Raw:
if ((a->valuestring == NULL) || (b->valuestring == NULL))
{
return false;
}
if (strcmp(a->valuestring, b->valuestring) == 0)
{
return true;
}
return false;
case cJSON_Array:
{
cJSON *a_element = a->child;
cJSON *b_element = b->child;
for (; (a_element != NULL) && (b_element != NULL);)
{
if (!compare(a_element, b_element, context))
{
return false;
}
a_element = a_element->next;
b_element = b_element->next;
}
/* one of the arrays is longer than the other */
if (a_element != b_element) {
return false;
}
return true;
}
case cJSON_Object:
{
cJSON *a_element = NULL;
cJSON *b_element = NULL;
size_t a_size = get_array_size(a);
size_t b_size = get_array_size(b);
if (a_size != b_size)
{
return false;
}
cJSON_ArrayForEach(a_element, a)
{
/* TODO This has O(n^2) runtime, which is horrible! */
b_element = get_object_item(b, a_element->string, context);
if (b_element == NULL)
{
return false;
}
if (!compare(a_element, b_element, context))
{
return false;
}
}
return true;
}
default:
return false;
}
}
CJSON_PUBLIC(cJSON_bool) cJSON_Compare(const cJSON * const a, const cJSON * const b, const cJSON_bool case_sensitive)
{
internal_context context = global_context;
context.case_sensitive = case_sensitive;
return compare(a, b, &context);
}
CJSON_PUBLIC(void *) cJSON_malloc(size_t size)
{
return global_allocators.malloc_fn(size);
}
CJSON_PUBLIC(void) cJSON_free(void *object)
{
global_allocators.free_fn(object);
}
``` |
```c
/***************************************************************************
* _ _ ____ _
* Project ___| | | | _ \| |
* / __| | | | |_) | |
* | (__| |_| | _ <| |___
* \___|\___/|_| \_\_____|
*
*
* This software is licensed as described in the file COPYING, which
* you should have received as part of this distribution. The terms
* are also available at path_to_url
*
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
* copies of the Software, and permit persons to whom the Software is
* furnished to do so, under the terms of the COPYING file.
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
* KIND, either express or implied.
*
***************************************************************************/
#include "curl_setup.h"
#ifdef USE_LIBRTMP
#include "curl_rtmp.h"
#include "urldata.h"
#include "nonblock.h" /* for curlx_nonblock */
#include "progress.h" /* for Curl_pgrsSetUploadSize */
#include "transfer.h"
#include "warnless.h"
#include <curl/curl.h>
#include <librtmp/rtmp.h>
#include "curl_memory.h"
/* The last #include file should be: */
#include "memdebug.h"
#ifdef _WIN32
#define setsockopt(a,b,c,d,e) (setsockopt)(a,b,c,(const char *)d,(int)e)
#define SET_RCVTIMEO(tv,s) int tv = s*1000
#else
#define SET_RCVTIMEO(tv,s) struct timeval tv = {s,0}
#endif
#define DEF_BUFTIME (2*60*60*1000) /* 2 hours */
static CURLcode rtmp_setup_connection(struct connectdata *conn);
static CURLcode rtmp_do(struct connectdata *conn, bool *done);
static CURLcode rtmp_done(struct connectdata *conn, CURLcode, bool premature);
static CURLcode rtmp_connect(struct connectdata *conn, bool *done);
static CURLcode rtmp_disconnect(struct connectdata *conn, bool dead);
static Curl_recv rtmp_recv;
static Curl_send rtmp_send;
/*
* RTMP protocol handler.h, based on path_to_url
*/
const struct Curl_handler Curl_handler_rtmp = {
"RTMP", /* scheme */
rtmp_setup_connection, /* setup_connection */
rtmp_do, /* do_it */
rtmp_done, /* done */
ZERO_NULL, /* do_more */
rtmp_connect, /* connect_it */
ZERO_NULL, /* connecting */
ZERO_NULL, /* doing */
ZERO_NULL, /* proto_getsock */
ZERO_NULL, /* doing_getsock */
ZERO_NULL, /* domore_getsock */
ZERO_NULL, /* perform_getsock */
rtmp_disconnect, /* disconnect */
ZERO_NULL, /* readwrite */
ZERO_NULL, /* connection_check */
PORT_RTMP, /* defport */
CURLPROTO_RTMP, /* protocol */
PROTOPT_NONE /* flags*/
};
const struct Curl_handler Curl_handler_rtmpt = {
"RTMPT", /* scheme */
rtmp_setup_connection, /* setup_connection */
rtmp_do, /* do_it */
rtmp_done, /* done */
ZERO_NULL, /* do_more */
rtmp_connect, /* connect_it */
ZERO_NULL, /* connecting */
ZERO_NULL, /* doing */
ZERO_NULL, /* proto_getsock */
ZERO_NULL, /* doing_getsock */
ZERO_NULL, /* domore_getsock */
ZERO_NULL, /* perform_getsock */
rtmp_disconnect, /* disconnect */
ZERO_NULL, /* readwrite */
ZERO_NULL, /* connection_check */
PORT_RTMPT, /* defport */
CURLPROTO_RTMPT, /* protocol */
PROTOPT_NONE /* flags*/
};
const struct Curl_handler Curl_handler_rtmpe = {
"RTMPE", /* scheme */
rtmp_setup_connection, /* setup_connection */
rtmp_do, /* do_it */
rtmp_done, /* done */
ZERO_NULL, /* do_more */
rtmp_connect, /* connect_it */
ZERO_NULL, /* connecting */
ZERO_NULL, /* doing */
ZERO_NULL, /* proto_getsock */
ZERO_NULL, /* doing_getsock */
ZERO_NULL, /* domore_getsock */
ZERO_NULL, /* perform_getsock */
rtmp_disconnect, /* disconnect */
ZERO_NULL, /* readwrite */
ZERO_NULL, /* connection_check */
PORT_RTMP, /* defport */
CURLPROTO_RTMPE, /* protocol */
PROTOPT_NONE /* flags*/
};
const struct Curl_handler Curl_handler_rtmpte = {
"RTMPTE", /* scheme */
rtmp_setup_connection, /* setup_connection */
rtmp_do, /* do_it */
rtmp_done, /* done */
ZERO_NULL, /* do_more */
rtmp_connect, /* connect_it */
ZERO_NULL, /* connecting */
ZERO_NULL, /* doing */
ZERO_NULL, /* proto_getsock */
ZERO_NULL, /* doing_getsock */
ZERO_NULL, /* domore_getsock */
ZERO_NULL, /* perform_getsock */
rtmp_disconnect, /* disconnect */
ZERO_NULL, /* readwrite */
ZERO_NULL, /* connection_check */
PORT_RTMPT, /* defport */
CURLPROTO_RTMPTE, /* protocol */
PROTOPT_NONE /* flags*/
};
const struct Curl_handler Curl_handler_rtmps = {
"RTMPS", /* scheme */
rtmp_setup_connection, /* setup_connection */
rtmp_do, /* do_it */
rtmp_done, /* done */
ZERO_NULL, /* do_more */
rtmp_connect, /* connect_it */
ZERO_NULL, /* connecting */
ZERO_NULL, /* doing */
ZERO_NULL, /* proto_getsock */
ZERO_NULL, /* doing_getsock */
ZERO_NULL, /* domore_getsock */
ZERO_NULL, /* perform_getsock */
rtmp_disconnect, /* disconnect */
ZERO_NULL, /* readwrite */
ZERO_NULL, /* connection_check */
PORT_RTMPS, /* defport */
CURLPROTO_RTMPS, /* protocol */
PROTOPT_NONE /* flags*/
};
const struct Curl_handler Curl_handler_rtmpts = {
"RTMPTS", /* scheme */
rtmp_setup_connection, /* setup_connection */
rtmp_do, /* do_it */
rtmp_done, /* done */
ZERO_NULL, /* do_more */
rtmp_connect, /* connect_it */
ZERO_NULL, /* connecting */
ZERO_NULL, /* doing */
ZERO_NULL, /* proto_getsock */
ZERO_NULL, /* doing_getsock */
ZERO_NULL, /* domore_getsock */
ZERO_NULL, /* perform_getsock */
rtmp_disconnect, /* disconnect */
ZERO_NULL, /* readwrite */
ZERO_NULL, /* connection_check */
PORT_RTMPS, /* defport */
CURLPROTO_RTMPTS, /* protocol */
PROTOPT_NONE /* flags*/
};
static CURLcode rtmp_setup_connection(struct connectdata *conn)
{
RTMP *r = RTMP_Alloc();
if(!r)
return CURLE_OUT_OF_MEMORY;
RTMP_Init(r);
RTMP_SetBufferMS(r, DEF_BUFTIME);
if(!RTMP_SetupURL(r, conn->data->change.url)) {
RTMP_Free(r);
return CURLE_URL_MALFORMAT;
}
conn->proto.generic = r;
return CURLE_OK;
}
static CURLcode rtmp_connect(struct connectdata *conn, bool *done)
{
RTMP *r = conn->proto.generic;
SET_RCVTIMEO(tv, 10);
r->m_sb.sb_socket = (int)conn->sock[FIRSTSOCKET];
/* We have to know if it's a write before we send the
* connect request packet
*/
if(conn->data->set.upload)
r->Link.protocol |= RTMP_FEATURE_WRITE;
/* For plain streams, use the buffer toggle trick to keep data flowing */
if(!(r->Link.lFlags & RTMP_LF_LIVE) &&
!(r->Link.protocol & RTMP_FEATURE_HTTP))
r->Link.lFlags |= RTMP_LF_BUFX;
(void)curlx_nonblock(r->m_sb.sb_socket, FALSE);
setsockopt(r->m_sb.sb_socket, SOL_SOCKET, SO_RCVTIMEO,
(char *)&tv, sizeof(tv));
if(!RTMP_Connect1(r, NULL))
return CURLE_FAILED_INIT;
/* Clients must send a periodic BytesReceived report to the server */
r->m_bSendCounter = true;
*done = TRUE;
conn->recv[FIRSTSOCKET] = rtmp_recv;
conn->send[FIRSTSOCKET] = rtmp_send;
return CURLE_OK;
}
static CURLcode rtmp_do(struct connectdata *conn, bool *done)
{
RTMP *r = conn->proto.generic;
if(!RTMP_ConnectStream(r, 0))
return CURLE_FAILED_INIT;
if(conn->data->set.upload) {
Curl_pgrsSetUploadSize(conn->data, conn->data->state.infilesize);
Curl_setup_transfer(conn, -1, -1, FALSE, NULL, FIRSTSOCKET, NULL);
}
else
Curl_setup_transfer(conn, FIRSTSOCKET, -1, FALSE, NULL, -1, NULL);
*done = TRUE;
return CURLE_OK;
}
static CURLcode rtmp_done(struct connectdata *conn, CURLcode status,
bool premature)
{
(void)conn; /* unused */
(void)status; /* unused */
(void)premature; /* unused */
return CURLE_OK;
}
static CURLcode rtmp_disconnect(struct connectdata *conn,
bool dead_connection)
{
RTMP *r = conn->proto.generic;
(void)dead_connection;
if(r) {
conn->proto.generic = NULL;
RTMP_Close(r);
RTMP_Free(r);
}
return CURLE_OK;
}
static ssize_t rtmp_recv(struct connectdata *conn, int sockindex, char *buf,
size_t len, CURLcode *err)
{
RTMP *r = conn->proto.generic;
ssize_t nread;
(void)sockindex; /* unused */
nread = RTMP_Read(r, buf, curlx_uztosi(len));
if(nread < 0) {
if(r->m_read.status == RTMP_READ_COMPLETE ||
r->m_read.status == RTMP_READ_EOF) {
conn->data->req.size = conn->data->req.bytecount;
nread = 0;
}
else
*err = CURLE_RECV_ERROR;
}
return nread;
}
static ssize_t rtmp_send(struct connectdata *conn, int sockindex,
const void *buf, size_t len, CURLcode *err)
{
RTMP *r = conn->proto.generic;
ssize_t num;
(void)sockindex; /* unused */
num = RTMP_Write(r, (char *)buf, curlx_uztosi(len));
if(num < 0)
*err = CURLE_SEND_ERROR;
return num;
}
#endif /* USE_LIBRTMP */
``` |
Agchia is a town in Kamrup district of Assam, situated on the south bank of the Brahmaputra River between Boko and Chaygaon towns.
Transportation
Agchia is connected to nearby towns through National highway 17.
See also
Aggumi
References
Villages in Kamrup district |
Aage Foss (18 May 1885 – 8 February 1952) was a Danish film actor. He appeared in 29 films between 1933 and 1951.
Selected filmography
Flight from the Millions (1934)
København, Kalundborg og - ? (1934)
The Golden Smile (1935)
Jens Langkniv (1940)
The Invisible Army (1945)
Mosekongen (1950)
Frihed forpligter (1951)
External links
1885 births
1952 deaths
Danish male film actors
Actors from Aarhus |
```python
#see license.txt for license details
#history path_to_url
__version__='3.3.0'
__doc__="""
This module includes any mathematical methods needed for PIDDLE.
It should have no dependencies beyond the Python library.
So far, just Robert Kern's bezierArc.
"""
from math import sin, cos, pi, ceil
def bezierArc(x1,y1, x2,y2, startAng=0, extent=90):
"""bezierArc(x1,y1, x2,y2, startAng=0, extent=90) --> List of Bezier
curve control points.
(x1, y1) and (x2, y2) are the corners of the enclosing rectangle. The
coordinate system has coordinates that increase to the right and down.
Angles, measured in degress, start with 0 to the right (the positive X
axis) and increase counter-clockwise. The arc extends from startAng
to startAng+extent. I.e. startAng=0 and extent=180 yields an openside-down
semi-circle.
The resulting coordinates are of the form (x1,y1, x2,y2, x3,y3, x4,y4)
such that the curve goes from (x1, y1) to (x4, y4) with (x2, y2) and
(x3, y3) as their respective Bezier control points."""
x1,y1, x2,y2 = min(x1,x2), max(y1,y2), max(x1,x2), min(y1,y2)
if abs(extent) <= 90:
arcList = [startAng]
fragAngle = float(extent)
Nfrag = 1
else:
arcList = []
Nfrag = int(ceil(abs(extent)/90.))
fragAngle = float(extent) / Nfrag
x_cen = (x1+x2)/2.
y_cen = (y1+y2)/2.
rx = (x2-x1)/2.
ry = (y2-y1)/2.
halfAng = fragAngle * pi / 360.
kappa = abs(4. / 3. * (1. - cos(halfAng)) / sin(halfAng))
if fragAngle < 0:
sign = -1
else:
sign = 1
pointList = []
for i in range(Nfrag):
theta0 = (startAng + i*fragAngle) * pi / 180.
theta1 = (startAng + (i+1)*fragAngle) *pi / 180.
if fragAngle > 0:
pointList.append((x_cen + rx * cos(theta0),
y_cen - ry * sin(theta0),
x_cen + rx * (cos(theta0) - kappa * sin(theta0)),
y_cen - ry * (sin(theta0) + kappa * cos(theta0)),
x_cen + rx * (cos(theta1) + kappa * sin(theta1)),
y_cen - ry * (sin(theta1) - kappa * cos(theta1)),
x_cen + rx * cos(theta1),
y_cen - ry * sin(theta1)))
else:
pointList.append((x_cen + rx * cos(theta0),
y_cen - ry * sin(theta0),
x_cen + rx * (cos(theta0) + kappa * sin(theta0)),
y_cen - ry * (sin(theta0) - kappa * cos(theta0)),
x_cen + rx * (cos(theta1) - kappa * sin(theta1)),
y_cen - ry * (sin(theta1) + kappa * cos(theta1)),
x_cen + rx * cos(theta1),
y_cen - ry * sin(theta1)))
return pointList
``` |
```java
package com.yyydjk.gank.theme;
import android.content.Context;
import android.content.res.Resources;
import android.util.AttributeSet;
import android.view.View;
import android.widget.RelativeLayout;
/**
* Created by chengli on 15/6/8.
*/
public class ColorRelativeLayout extends RelativeLayout implements ColorUiInterface {
private int attr_background = -1;
public ColorRelativeLayout(Context context) {
super(context);
}
public ColorRelativeLayout(Context context, AttributeSet attrs) {
super(context, attrs);
this.attr_background = ViewAttributeUtil.getBackgroundAttibute(attrs);
}
public ColorRelativeLayout(Context context, AttributeSet attrs, int defStyleAttr) {
super(context, attrs, defStyleAttr);
this.attr_background = ViewAttributeUtil.getBackgroundAttibute(attrs);
}
@Override
public View getView() {
return this;
}
@Override
public void setTheme(Resources.Theme themeId) {
if (attr_background != -1) {
ViewAttributeUtil.applyBackgroundDrawable(this, themeId, attr_background);
}
}
}
``` |
Cornelia Schmidt-Liermann (born in Buenos Aires, 6 November 1963) is an Argentine lawyer and politician. A member of Republican Proposal (PRO), she was a National Deputy for the City of Buenos Aires from 2011 to 2019.
Biography
She was born in Buenos Aires on 6 November 1963. She is a German Argentine. She obtained her Bachelor of Science and Letters from the Goethe-Institut in Buenos Aires. In addition to Spanish, she also speaks German and English.
In 1987 she graduated in law and as a procurator from the University of Buenos Aires. A year after this she followed with postgraduate courses at the University of Hamburg in the then Federal Republic of Germany, with a specialization in conflict of laws and new forms of commercial contracting.
Publications
"Press conferences in Argentina. Current situation and alternative tools for the dialogue between journalists and government officials" (The Crujíadic, 2009)
References
20th-century Argentine lawyers
Argentine people of German descent
1963 births
Republican Proposal politicians
Politicians from Buenos Aires
University of Buenos Aires alumni
University of Hamburg alumni
Living people
Argentine women lawyers
Members of the Argentine Chamber of Deputies elected in Buenos Aires
Women members of the Argentine Chamber of Deputies
Commanders Crosses of the Order of Merit of the Federal Republic of Germany
21st-century Argentine lawyers
20th-century women lawyers
21st-century women lawyers |
Colonel Sir Felton Elwell Hervey-Bathurst, 1st Baronet, (178224 September 1819), was an officer in the British Army during the Napoleonic Wars.
Early life
Born Felton Elwell Hervey in 1782, he was a son of Lieutenant Felton Lionel Hervey and his wife Selina Elwill. His father worked for the exchequer before committing suicide in a London gunsmiths in 1785.
His paternal grandfather was Felton Hervey (the seventh son of John Hervey, 1st Earl of Bristol). His mother was the only daughter and heir of Sir John Elwill, 4th Baronet and his wife Selina Bathurst.
In 1801, the younger Felton assumed, by Royal licence, the additional surname of Bathurst after his maternal grandmother.
Career
On 6May 1806, Hervey-Bathurst was appointed a major in 14th Light Dragoons. In December 1808 went with his regiment to join the British Army in Iberia engaged in the Peninsula War. He lost his right arm at the Battle of Douro (28 March 1809), but was well enough to by 2 August 1810 to be promoted to Lieutenant-Colonel and to command of the 14th Light Dragoons from 1811 to 1814. During this time he fought in a number of engagements being wound again at the battles Fuentes de Oñoro and the El Bodon.
He was brevetted Colonel On 4July 1814 and appointed Aide-de-camp (A.D.C.) to the Prince Regent. During the Waterloo Campaign he served on the Duke of Wellington's staff, and was Wellington's representative at the negotiations for the surrender of Paris, signing the Convention of St. Cloud on 3July 1815.
Hervey-Bathurst baronetcy
His baronetcy was created on 7December 1818, with remainder, failing heirs male of his own, to the heirs male of his father.
Personal life
On 24 April 1817 at Apsley House, home of the Duke of Wellington, Felton Hervey was married to Louisa Catherine Caton (1793–1874), the third daughter of Richard Caton, a merchant of Baltimore, Maryland who was born in Lancashire. Among her siblings was sister Marianne (wife of Richard Wellesley, 1st Marquess Wellesley) and Elizabeth (wife of George Stafford-Jerningham, 8th Baron Stafford).
The marriage certificate was witnessed by Wellington, Bathurst, Lord Liverpool, The Duke of Westminster, John Quincy Adams, the Earl of Leicester and the Duke of Montellano, and is stored at the National Archives Kew.
After his death on 24 September 1819, he was succeeded according to the special remainder by his next brother, Frederick Anne Hervey-Bathurst (1783–1824), the 2nd Hervey-Bathurst baronet. In 1828, his widow remarried to Francis D'Arcy-Osborne, later the 7th Duke of Leeds.
Honors and Medals
Medals received for battle were:
Gold Medal for Fuentes d'Onor and Salamanca
Waterloo Medal
Knight of the Royal Guelphic Order
Companion of the Order of the Bath
Russian Order of St George
Russian Order of St Vladimir
Austrian Order of Maria Theresa
Portuguese Order of The Tower and Sword
Bavarian order of Joseph Maximilian
Bavarian order of Joseph Maximilian
Knight of St Henry of Saxony
Notes
References
British Army personnel of the Napoleonic Wars
Felton
1782 births
1819 deaths
Light Dragoons officers
Baronets in the Baronetage of the United Kingdom
Felton |
Serra del Turmell, also known as Serra del Mont Turmell, () is an over long mountain range in the Baix Maestrat comarca, Valencian Community, Spain.
These mountains and their neighboring ranges are a desolate place with little human habitation. Their summits are frequently covered in snow in the winter. The Cervol River has its sources in this range.
There was much activity of the Spanish Maquis in this range and the neighboring areas after the Spanish Civil War and well into the 1960s.
Geography
The highest point in the Serra del Turmell range is 1,276 m high Tossal Gros, also known as El Turmell, meaning 'the ankle'. Another important peak is the Mola de Penyablanca.
There is a cellular repeater and other antennas atop the highest peak. There is also a shrine or small chapel dedicated to Saint Agatha in the high slopes of the range.
This mountain chain rises east of Rossell town and its western end merges with the Serra de Vallivana range in the area of the Port de Querol mountain pass in the N-232 road.
The easiest route to reach the range is from Xert, Vallibona or Morella.
Ecology
The northern slopes of the Serra del Turmell are covered with Mediterranean forest of holm oak and pine, while the southern slopes are almost denuded of vegetation with the grey limestone rocks exposed among scattered clumps of shrub. There are large prey birds such as the griffon vulture, as well as wild animals such as the Spanish ibex, roe deer and wild boar.
The ranges of this sparsely populated mountain area have the most important forested zone of the region. Thus the area of this range together with the neighboring Tinença de Benifassà and Serra de Vallivana was declared a Site of Community Importance by the European Union under the name Tinença de Benifassà, Turmell i Vallivana.
See also
Mountains of the Valencian Community
Vallibona
Maestrat/Maestrazgo
List of Sites of Community Importance in Spain
References
External links
A Dry Stream Bed Instantly Becomes a Raging River, Overtaking a Bridge in the Process
El País Valencià poble a poble; comarca a comarca - El Baix Maestrat
Els Ports : Vallivana – Vereda del Turmell - Vallivana
Wikiloc - Santa Agueda - Vallibona - Turmell
Vallibona Patrimoni Natural
Turmell
Turmell
Baix Maestrat |
The Choptank River is a major tributary of the Chesapeake Bay and the largest river on the Delmarva Peninsula. Running for , it rises in Kent County, Delaware, runs through Caroline County, Maryland, and forms much of the border between Talbot County, Maryland, on the north, and Caroline County and Dorchester County on the east and south. It is located north of the Nanticoke River, and its mouth is located south of Eastern Bay. Cambridge, the county seat of Dorchester County, and Denton, the county seat of Caroline County, are located on its south shore.
Its watershed area in Maryland is , of which is open water, so it is 22% water. The predominant land use is agricultural with , or 48% of the land area. The river is named after the native Choptank people.
Course
The Choptank River begins at Choptank Mills, Delaware, where Tidy Island Creek and Culbreth Marsh Ditch join together. It ends at the Chesapeake Bay in a very wide mouth between Blackwalnut Point on Tilghman Island, and Cook Point, near Hudson, Maryland. Tidy Island Creek and Culbreth Marsh Ditch rise in western Kent County, Delaware. The entire watershed is in the coastal plain. The Choptank reaches sea level near Denton, Maryland, and is not salty until around below Denton.
Navigability
The river is navigable up to Denton, about 45 miles upriver. The bridge at Cambridge limits traffic to 50 feet vertical clearance. The river’s mouth is marked in the main channel by an abandoned, tilting masonry lighthouse on the underwater Sharps’ Island. Knapp’s Narrows offers a shortcut to boats approaching from the north.
Tributaries
Its main tributaries are the Tred Avon River and Tuckahoe Creek on the north side, and Cabin Creek and Hunting Creek on the south side. There are several small creeks on the northern shore, including Harris Creek, Broad Creek, Irish Creek, Island Creek, La Trappe Creek, Bolingbroke Creek, Mile Creek, Kings Creek, Forge Branch and Broadway Branch. On the southern shore the small creeks include Jenkins Creek, the Warwick River, Marsh Creek, Maryland, Skeleton Creek, Mitchell Run, Hog Creek, Fowling Creek, Robins Creek, Church Creek, Williston Creek, Watts Creek, Chapel Branch, Spring Branch, Gravelly Branch and Cow Marsh Creek.
See also
List of rivers of Delaware
List of rivers of Maryland
References
United States Geological Survey. 7.5 minute series topographic quadrangles.
Tributaries of the Chesapeake Bay
Rivers of Delaware
Rivers of Maryland
Rivers of Caroline County, Maryland
Rivers of Kent County, Delaware |
```objective-c
#pragma once
#include <unknwn.h> // Nested.HierarchyD uses classic COM interface IReferenceTrackerExtension
``` |
The list of shipwrecks in May 1914 includes ships sunk, foundered, grounded, or otherwise lost during May 1914.
1 May
3 May
4 May
9 May
10 May
11 May
13 May
14 May
15 May
17 May
19 May
20 May
21 May
22 May
23 May
24 May
25 May
26 May
27 May
28 May
29 May
31 May
Unknown date
References
1914-05
05
1914 |
```turing
#!perl -w
BEGIN {
chdir 't' if -d 't';
require "./test.pl";
set_up_inc('../lib');
}
use strict;
use utf8;
use open qw( :utf8 :std );
plan 'no_plan';
# package klonk doesn't have a stash.
package o;
# No parents
package ur;
# 1 parent
@ur::ISA = 'ko';
package ;
# 2 parents
@ur::ISA = ('ko', 'o');
package ck;
# No parents, has @ISA
@ck::ISA = ();
package zzz;
@zzz::ISA = ('ck', 'o');
package ;
@::ISA = ('o', 'ck');
package main;
require mro;
my %expect =
(
ko => [qw(ko)],
ur => [qw(ur ko o)],
o => [qw(o)],
=> [qw()],
ck => [qw(ck)],
zzz => [qw(zzz ck o)],
=> [qw( o ck)],
);
foreach my $package (qw(ko ur o ck zzz )) {
my $ref = bless [], $package;
my $isa = $expect{$package};
is("@{mro::get_linear_isa($package)}", "@$isa", "\@ISA for $package");
foreach my $class ($package, @$isa, 'UNIVERSAL') {
object_ok($ref, $class, $package);
}
}
``` |
```java
package com.vladsch.flexmark.html2md.converter;
import com.vladsch.flexmark.util.data.DataHolder;
import com.vladsch.flexmark.util.dependency.Dependent;
import org.jetbrains.annotations.Nullable;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.function.Function;
/**
* Factory for instantiating new node renderers with dependencies
*/
class DelegatingNodeRendererFactoryWrapper implements Function<DataHolder, HtmlNodeRenderer>, Dependent, DelegatingNodeRendererFactory {
final private HtmlNodeRendererFactory nodeRendererFactory;
private List<DelegatingNodeRendererFactoryWrapper> nodeRenderers;
private Set<Class<?>> myDelegates = null;
public DelegatingNodeRendererFactoryWrapper(List<DelegatingNodeRendererFactoryWrapper> nodeRenderers, HtmlNodeRendererFactory nodeRendererFactory) {
this.nodeRendererFactory = nodeRendererFactory;
this.nodeRenderers = nodeRenderers;
}
@Override
public HtmlNodeRenderer apply(DataHolder options) {
return nodeRendererFactory.apply(options);
}
public HtmlNodeRendererFactory getFactory() {
return nodeRendererFactory;
}
@Override
public Set<Class<?>> getDelegates() {
return nodeRendererFactory instanceof DelegatingNodeRendererFactory ? ((DelegatingNodeRendererFactory) nodeRendererFactory).getDelegates() : null;
}
@Nullable
@Override
final public Set<Class<?>> getAfterDependents() {
return null;
}
@Nullable
@Override
public Set<Class<?>> getBeforeDependents() {
if (myDelegates == null && nodeRenderers != null) {
Set<Class<?>> delegates = getDelegates();
if (delegates != null) {
myDelegates = new HashSet<>();
for (DelegatingNodeRendererFactoryWrapper factory : nodeRenderers) {
if (delegates.contains(factory.getFactory().getClass())) {
myDelegates.add(factory.getFactory().getClass());
}
}
}
// release reference
nodeRenderers = null;
}
return myDelegates;
}
@Override
final public boolean affectsGlobalScope() {
return false;
}
}
``` |
Stormont was a federal electoral district represented in the House of Commons of Canada from 1867 to 1882, 1904 to 1917, and 1925 to 1968. It was located in the eastern part of the province of Ontario.
It was created by the British North America Act of 1867 as consisting of Stormont County. It was abolished in 1882 when it was merged with Cornwall riding into Cornwall and Stormont.
It was re-created as a separate riding in 1903, consisting again of Stormont County. It was abolished in 1914 when it was redistributed between Durham and Glengarry and Stormont ridings.
It was re-created as a separate riding again in 1924 consisting again of Stormont County. In 1947, it was redefined to consist of the county of Stormont, including the city of Cornwall.
The electoral district was abolished in 1966 when it was merged into Stormont—Dundas riding.
Members of Parliament
This riding elected the following members of the House of Commons of Canada:
Election results
1867–1882
|-
|Liberal-Conservative
|Samuel Ault
|align="right"| 955
|Unknown
|Sinclair
|align="right"| 363
|}
|-
|Liberal
|Cyril Archibald
|align="right"| 828
|Liberal-Conservative
|Samuel Ault
|align="right"|792
|}
|-
|Liberal
|Cyril Archibald
|align="right"|905
|Unknown
|J. Crysler
|align="right"| 797
|}
|-
|Liberal-Conservative
|Oscar Fulton
|align="right"|1,082
|Liberal
|Cyril Archibald
|align="right"|885
|}
1904–1917
|-
|Conservative
|Robert Abercrombie Pringle
|align="right"|2,700
|Liberal
|Robert Smith
|align="right"|2,589
|}
|-
|Liberal
|Robert Smith
|align="right"| 2,383
|Conservative
|Robert Abercrombie Pringle
|align="right"| 2,033
|Independent
|Ambrose Fitzgerald Mulhern
|align="right"|658
|}
|-
|Conservative
|Duncan Orestes Alguire
|align="right"| 2,539
|Liberal
|George Ira Gogo
|align="right"|2,408
|}
1925–1968
|-
|Conservative
|Charles James Hamilton
|align="right"|5,706
|Liberal
|George Ira Gogo
|align="right"| 5,394
|}
|-
|Liberal
|Arnold Neilson Smith
|align="right"|6,623
|Conservative
|Charles James Hamilton
|align="right"|6,083
|}
|-
|Conservative
|Frank Thomas Shaver
|align="right"| 7,901
|Liberal
|Arnold Neilson Smith
|align="right"| 7,326
|}
|-
|Liberal
|Lionel Chevrier
|align="right"|9,233
|Conservative
|Frank Thomas Shaver
|align="right"|6,655
|}
|-
|Liberal
|Lionel Chevrier
|align="right"|10,197
|National Government
|Elzéar Emard
|align="right"|6,202
|}
|-
|Liberal
|Lionel Chevrier
|align="right"| 11,702
|Progressive Conservative
|John Allan Phillips
|align="right"| 6,016
|Co-operative Commonwealth
|John Charles Steer
|align="right"| 991
|}
|-
|Liberal
|Lionel Chevrier
|align="right"| 12,639
|Progressive Conservative
|Frank Thomas Shaver
|align="right"| 6,670
|Co-operative Commonwealth
|Alexander Francis Mullin
|align="right"| 1,283
|Union of Electors
|Amour St-Lucien
|align="right"|252
|}
|-
|Liberal
|Lionel Chevrier
|align="right"| 13,503b
|Progressive Conservative
|John Lawrence McDonald
|align="right"|7,244
|}
|-
|Liberal
|Albert Lavigne
|align="right"| 11,441
|Progressive Conservative
|Donald Robert Dick
|align="right"| 11,091
|}
|-
|Liberal
|Albert Lavigne
|align="right"| 12,505
|Progressive Conservative
|Grant Campbell
|align="right"|10,215
|}
|-
|Progressive Conservative
|Grant Campbell
|align="right"| 13,964
|Liberal
|Albert Lavigne
|align="right"| 11,977
|}
|-
|Liberal
|Lucien Lamoureux
|align="right"| 11,363
|Progressive Conservative
|Grant Campbell
|align="right"| 11,293
|New Democratic
|Marjorie Ball
|align="right"|946
|}
Note:
* Due to the death of the Liberal candidate for the riding of Stormont, the general election scheduled for June 18, 1962, in this riding was postponed until July 16, 1962.
|-
|Liberal
|Lucien Lamoureux
|align="right"| 13,285
|Progressive Conservative
|John Alguire
|align="right"| 9,728
|New Democratic
|Bill Kilger
|align="right"| 801
|}
|-
|Liberal
|Lucien Lamoureux
|align="right"|13,530
|Progressive Conservative
|Ken Bergeron
|align="right"| 7,458
|New Democratic
|John B. Trew
|align="right"| 3,201
|}
See also
List of Canadian federal electoral districts
Historical federal electoral districts of Canada
External links
Website of the Parliament of Canada
Former federal electoral districts of Ontario |
```emacs lisp
;;; lsp-awk.el --- AWK client -*- lexical-binding: t; -*-
;; Author: Konstantin Kharlamov <Hi-Angel@yandex.ru>
;; Keywords: languages lsp awk
;; This program is free software; you can redistribute it and/or modify
;; (at your option) any later version.
;; 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, see <path_to_url
;;; Commentary:
;;
;; LSP client for AWK language.
;;
;;; Code:
(require 'lsp-mode)
(defgroup lsp-awk nil
"LSP support for AWK."
:group 'lsp-mode
:link '(url-link "path_to_url"))
(defcustom lsp-awk-executable '("awk-language-server")
"Command to run the AWK language server."
:group 'lsp-awk
:risky t
:type 'list)
(lsp-register-client
(make-lsp-client
:new-connection (lsp-stdio-connection (lambda () lsp-awk-executable))
:activation-fn (lsp-activate-on "awk")
:priority -1
:server-id 'awkls))
(provide 'lsp-awk)
;;; lsp-awk.el ends here
``` |
The Palace of Lourizán is a manor house in Herbalonga in the civil parish of Lourizán, in Pontevedra, Spain.
History
In the 15th century this property was transformed into a farm and belonged to the Montenegro family. The circular crenellated dovecote dates from this period. A fortified tower-house was built on the estate, where Luis de Góngora spent some time in 1609 and wrote part of his book Soledades.
In the 17th century, the estate, known as Granja de la Sierra, was owned by the Marquisate of La Sierra. Later it had different owners, merchants and businessmen. In the 19th century, the palace belonged to Buenaventura Marcó del Pont Bori, after he bought it from the heirs of Francisco Genaro Ángel, his wife's brother.
Later it was converted into a main residence and a summer cottage when Eugenio Montero Ríos lived there. In October 1876 he rented the estate and acquired it on 16 May 1879. At that time the estate was very close to the ria of Pontevedra and had its own pier. Between 1893 and 1894, the first major refurbishment of the manor house was carried out. It consisted of creating a wooden gallery in the south wing, which enclosed the building's chapel. The pazo became an ostentatious residence with representative institutional functions, as well as a living, leisure and recreational space. The Treaty of Paris was signed in its rooms after the war with the United States in 1898, in which Spain lost Cuba, Puerto Rico, the Philippines and Guam.
Eugenio Montero Ríos commissioned the architect Jenaro de la Fuente Domínguez to completely renovate the palace in the early 20th century. The aim was to turn the pazo into a large residential palace, imitating and surpassing in size the typology of the hôtels particuliers in the fashion of the French Second Empire style. The project's façade plan dates from 20 February 1909 and it integrated and harmonised elements from different stages of construction to create an architectural unity. The refurbishment gave the palace a new appearance, both on the outside and inside. Work began in September 1909 and was completed in 1912. Originally, the marble statues on the great central staircase leading to the palace formed the so-called avenue of statues, but with this major refurbishment of the pazo they were relocated to the staircase. Eugenio Montero Ríos lived in the Lourizán Palace until his death in 1914.
The Provincial Council of Pontevedra bought it in 1943 from the Provincial Savings Bank of Pontevedra and (a fifth) from the widowed Marquise of Alhucemas, daughter of Montero Ríos. That same year, the Provincial Council handed it over to the Ministry of Education to be used as a regional centre for teaching, research and forestry experiments, and in 1946 it became a higher technical school of forestry.
The centre became part of the National Agricultural Research Institute (INIA) in 1973 and in 1984 it was transferred to the Xunta de Galicia. It is currently integrated into the Centre for Sustainable Development of the Regional Ministry of the Environment since 1991. The main objectives of the Environmental and Forestry Research Centre of Lourizán are the protection, conservation and improvement of Galicia's forestry heritage.
On 19 May 2023, the palace became the property of the Xunta de Galicia.
Description
The building
The present building has a romantic air and is the work of Jenaro de la Fuente Domínguez. It is an eclectic building with influences from Art Nouveau, Classicism and the French architecture of the Second Empire.
The structure of the palace is symmetrical, monumental and with a predominance of horizontal volumes. It has a ground floor and two upper floors. The central body is U-shaped with three towers crowned by French mansards and slate roof. The facade has Ionic columns and pilasters. The central part is enhanced by a coat of arms and a clock, in the place where the coats of arms of Galician manor houses are usually found.
In front of this central body, advanced in relation to the sides, is a large two-flight imperial stone staircase, surrounded by neoclassical white marble statues personifying justice and prudence and representing virtues, values and devotions. At the top of the staircase are the statues of Germanicus, Discobolus, the Dying Slave and Sophocles, while at the ends of the rotunda are the statues of Pallas Athena and Diana of Gabii. In the pavilions on the main façade, next to the entrance door to the vestibule, the allegories of Spring and Summer can be seen. The round staircase generates a belvedere from which to contemplate the views in imitation of the French baroque style. This staircase leads to the main entrance and to a semicircular terrace (which serves as a viewpoint) above an artificial grotto that simulates a volcanic limestone cave called the Grotto of Mirrors. At this point, two side wings open up, consisting of light long galleries of stone and glass that envelop the old pazo. On the first floor, the facades of the side wings give way to the central body and create terraces with balustrades. In these lateral sections, the high windows, pilasters, balconies, dormers and domes lined with zinc scales of the dôme à l'impériale type are repeated, which reinforce the elegance of the palace.
The large number of windows and balconies stand out, bringing light and lightness to the structure. The decoration is remarkable for the fusion of neoclassical and Art Nouveau elements. The columns, balconies and ornaments show classical resources. The triangular pediment of the central body is decorated with the symbols of the profession of Eugenio Montero Ríos, and the attributes of justice, a shield with a book and a feather.
The interior is accessed through a simple door with the initials on the glass of its former owners, "E and A", "Eugenio and Avelina".
The interior of the palace is organised around the three floors visible from the outside, where the ground floor and the first floor contain the remains of the walls of the first house and pazo. The rooms are distributed according to two halves separated by a long corridor that runs along the entire length of the building, as in palatial architecture, leaving the rooms of higher rank, the rooms for receiving visitors, lounges and offices, towards the front facade facing the park, and the accessory parts such as servants' quarters, kitchen and pantries towards the rear facing the farmyard.
The estate
The manor house has 54 hectares of gardens and groves, which show the different uses to which it has been put over the centuries: farm, seigneurial botanical garden and forestry research centre. It has one of the most important tree groves in Europe, with plant species brought from other latitudes or even singular modifications of species to adapt them to the climate of Pontevedra, resulting in a unique forest ensemble.
Many native trees grow here, such as oaks, chestnuts and Birches, sycamores and introduced and exotic trees, such as Cypresses, Araucarias, cedars, magnolias or common privet, many of which were brought by French gardeners. Several of these trees are included in the Catalogue of Singular Trees of the Galician Government. There are arboretums with all varieties of chestnut trees, pines, eucalyptus or camellias, with the tallest specimen in the world, a 20.5 metre tall Japanese camellia. There is also a rimu from New Zealand and a small Taiwanese garden.
Around the palace there are ponds, granaries on stilts, a 15th-century dovecote, a glass greenhouse with an iron structure from 1900, a one-piece granite table (apparently extracted from a rock on the island of Tambo), white marble statues and several fountains, such as that of the Shell, that of the Three Channels, that of the Patio and that of the Cave of Mirrors. The estate is organised into avenues: the Camellia Avenue, the Eucalyptus Avenue and the Cave of Mirrors Avenue.
The art nouveau greenhouse from the early 20th century is made of glass and wrought iron and the Galician attic with its threshing floor and dryer has 16 feet. The greenhouse is notable for its large, light structure with a rectangular ground plan. Its highest point is 7 metres in the central space, where the larger species are cultivated, leaving the side spaces for smaller plants.
Culture
The writer Lola Fernández Pazos published the novel El Pazo de Lourizán in 2022, which is set in the palace.
The island of Tambo was once part of the palace's territory. Montero Ríos bought three fifths of the island in 1884 and another fifth in 1894. In 1940, his children sold it to the Navy for use by the Naval Military Academy.
Gallery
References
See also
Bibliography
Related articles
Arboretum of Lourizán
Palace of the Deputation of Pontevedra
Pazo
External links
The Lourizán Palace, on the website Visit-Pontevedra
The pazo of trees, on the Diputación de Pontevedra website.
Palaces in Galicia (Spain)
Monuments and memorials in Spain
Buildings and structures in Pontevedra
Art Nouveau
Eclectic architecture |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.