text
stringlengths 1
22.8M
|
|---|
```c
/*++
version 3. Alternative licensing terms are available. Contact
info@minocacorp.com for details. See the LICENSE file at the root of this
project for complete licensing information.
Module Name:
memmap.c
Abstract:
This module implements support for returning the initial memory map on the
Raspberry Pi.
Author:
Chris Stevens 21-Dec-2014
Environment:
Firmware
--*/
//
// your_sha256_hash--- Includes
//
#include <uefifw.h>
#include "rpifw.h"
//
// your_sha256_hash Definitions
//
//
// ------------------------------------------------------ Data Type Definitions
//
//
// ----------------------------------------------- Internal Function Prototypes
//
//
// your_sha256_hash---- Globals
//
//
// your_sha256_hash-- Functions
//
EFI_STATUS
EfiPlatformGetInitialMemoryMap (
EFI_MEMORY_DESCRIPTOR **Map,
UINTN *MapSize
)
/*++
Routine Description:
This routine returns the initial platform memory map to the EFI core. The
core maintains this memory map. The memory map returned does not need to
take into account the firmware image itself or stack, the EFI core will
reserve those regions automatically.
Arguments:
Map - Supplies a pointer where the array of memory descriptors constituting
the initial memory map is returned on success. The EFI core will make
a copy of these descriptors, so they can be in read-only or
temporary memory.
MapSize - Supplies a pointer where the number of elements in the initial
memory map will be returned on success.
Return Value:
EFI status code.
--*/
{
return EfipBcm2709GetInitialMemoryMap(Map, MapSize);
}
//
// --------------------------------------------------------- Internal Functions
//
```
|
Mountville is an unincorporated community in the Loudoun Valley of Loudoun County, Virginia. The village is situated on Snickersville Turnpike halfway between Aldie and Philomont at the intersection of Mountville Road.
Mountville is located on a promontory between the main branch of the Goose Creek and its tributary, Beaverdam Creek, at the western base of Catoctin Mountain.
Despite its geographic location, Mountville is named not for its elevation but rather for Ezekiel Mount, who first settled the area in 1797, after moving to Loudoun from Mountville, Pennsylvania. The village was officially christened Mountville in 1817 with the establishment of a post office in the village bearing that name.
Mountville was the scene of early skirmishing during the American Civil War's Battle of Unison.
References
Unincorporated communities in Loudoun County, Virginia
Washington metropolitan area
Unincorporated communities in Virginia
|
A Zoo in My Luggage by British naturalist Gerald Durrell is the story of Durrell's 1957 animal collecting trip to British Cameroon, the northwestern corner of present-day Cameroon. First published in 1960, it is one of a half-dozen books about animal collecting trips that Durrell wrote.
The book tells the story of when Durrell went to the Cameroons and spent six months collecting various animals, referred to as "beef" in Pidgin English. He took part in various expeditions, including catching a python in a narrow cave, encountering a hippopotamus while traveling on the Cross River, and so on. It is his third book describing trips to the region, following The Overloaded Ark and The Bafut Beagles.
Illustrations by Ralph Thompson.
Books by Gerald Durrell
1960 non-fiction books
Books about Cameroon
1957 in British Cameroon
Novels set in zoos
British travel books
English non-fiction books
Rupert Hart-Davis books
|
Geva Binyamin (), also known as Adam (), is an Israeli settlement in the West Bank, built over land expropriated from the Palestinian village of Jaba'. It is organised as a community settlement and falls under the jurisdiction of Mateh Binyamin Regional Council. In , it had a population of .
The international community considers Israeli settlements in the West Bank illegal under international law, but the Israeli government disputes this.
Etymology
The name Geva Binyamin comes from an eponymous Biblical site – Geba of Benjamin – which is believed to have stood around the same location. According to contemporary scholarship, Geba of Benjamin was located in the nearby village of Jaba', which preserves the biblical name.
History
According to ARIJ, Israel confiscated 1,139 dunams of land from the Palestinian village of Jaba' in order to construct Geva Binyamin. Some Jaba' residents have reportedly managed to return to part of their land fenced off by the settlers of Geva Binyamin.
The village was established in 1984 by members of the Adam gar'in (named after Yekutiel Adam, a former Deputy Chief of Staff of the Israeli Defence Forces who had been killed two years earlier in Lebanon).
Qubur Bani Isra'il is located on the outskirts of the settlement.
When Migron, the largest Israeli outpost in the West Bank, was found to be illegal and furthermore, established largely on private Palestinian land, the mandatory evacuation plan foresaw, as a compromise with the affected settlers, a major expansion of Geva Binyamin in order ostensibly to house the Mignon evacuees. However, the announced expansion of Geva Binyamin spoke of the construction of 1,400 housing units, notwithstanding the fact that the Mignon settlement to be abolished had only 50 family units.
Plans have been advanced to expand Jewish settlement northwards from Neve Ya'akov towards Geva Binyamin in order to create a seamless continuity between Jewish communities in this area of the West Bank, and it is thought the main purpose is block the urban expansion of Al-Ram and Hizma, something which would leave the settlement isolated.
References
External links
Nefesh B'Nefesh Community Profile
Community settlements
Israeli settlements in the West Bank
Populated places established in 1984
Mateh Binyamin Regional Council
1984 establishments in the Palestinian territories
|
```javascript
/**
*/
var chai = require('chai');
var assert = chai.assert;
const luMerger = require('./../../../src/parser/lu/luMerger');
const luObj = require('../../../src/parser/lu/lu');
const retCode = require('./../../../src/parser/utils/enums/CLI-errors');
const POSSIBLE_CHARS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz 0123456789 ";
const LuisBuilder = require('./../../../src/parser/luis/luisBuilder');
describe('Validations for LU content (based on LUIS boundaries)', function () {
it (`At most ${retCode.boundaryLimits.MAX_NUM_INTENTS} intents in LU content`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxIntentTestData())))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_INTENTS);
assert(err.text.includes("501 intents found in application"));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_UTTERANCES} utterances in LU content`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxUtteranceTestData())))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_UTTERANCES);
assert(err.text.includes("15001 utterances found in application"));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_PATTERNANY_ENTITIES} pattern.any entities in LU content`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxPatternAnyEntities())))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_PATTERNANYENTITY);
assert(err.text.includes("pattern.any entities found in application."));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_CHAR_IN_UTTERANCE} characters in any utterance`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxUtteranceCharLimit(), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_UTTERANCE_CHAR_LENGTH);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_CHAR_IN_UTTERANCE} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_PATTERNS} patterns in LU content`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxPatterns(), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_PATTERNS);
assert(err.text.includes(`patterns found in application. At most ${retCode.boundaryLimits.MAX_NUM_PATTERNS} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_CHAR_IN_PATTERNS} characters in any pattern`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxPatternCharLimit(), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_PATTERN_CHAR_LIMIT);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_CHAR_IN_PATTERNS} characters are allowed in any pattern.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_REGEX_ENTITIES} regex entities`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxRegeExEntityDefinition(retCode.boundaryLimits.MAX_NUM_REGEX_ENTITIES), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_REGEX_ENTITY);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_NUM_REGEX_ENTITIES} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_CHAR_REGEX_ENTITY_PATTERN} characters in regex entity pattern`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxRegeExEntityDefinition(1, retCode.boundaryLimits.MAX_CHAR_REGEX_ENTITY_PATTERN), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_REGEX_CHAR_LIMIT);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_CHAR_REGEX_ENTITY_PATTERN} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_LIST_ENTITY_SYNONYMS} synonyms under any parent for a list entity`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getListEntity(0, retCode.boundaryLimits.MAX_LIST_ENTITY_SYNONYMS), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_SYNONYMS_LENGTH);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_LIST_ENTITY_SYNONYMS} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_PHRASE_LISTS} phrase lists`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxPhraseLists(), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_PHRASE_LIST_LIMIT);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_NUM_PHRASE_LISTS} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_INTERCHANGEABLE_PHRASES} phrases across all interchangeable phrase lists`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxPhraseLists(0, retCode.boundaryLimits.MAX_INTERCHANGEABLE_PHRASES, true), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_INTC_PHRASES_LIMIT);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_INTERCHANGEABLE_PHRASES} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NON_INTERCHANGEABLE_PHRASES} phrases across all non-interchangeable phrase lists`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxPhraseLists(0, retCode.boundaryLimits.MAX_NON_INTERCHANGEABLE_PHRASES), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_NINTC_PHRASES_LIMIT);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_NON_INTERCHANGEABLE_PHRASES} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_ROLES_PER_ENTITY} roles per entity`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getEntityWithRoles())))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_ROLES_PER_ENTITY);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_ROLES_PER_ENTITY} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_ROLES} roles across all entities per LU content`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getEntityWithRoles(51, 6))))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_TOTAL_ROLES);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_NUM_ROLES} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_DESCRIPTORS_PER_MODEL} descriptors per model`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getEntityWithFeatures())))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_FEATURE_PER_MODEL);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_NUM_DESCRIPTORS_PER_MODEL} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_PARENT_ENTITIES} parent nodes in an ML entitiy`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMLEntity())))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_PARENT_ENTITY_LIMIT);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_NUM_PARENT_ENTITIES} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_TOTAL_ENTITES_AND_ROLES} total entities and roles in given LU content`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxEntityAndRoles())))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_TOTAL_ENTITIES_AND_ROLES);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_TOTAL_ENTITES_AND_ROLES} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_CLOSED_LISTS} list entities`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxListEntity())))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_TOTAL_CLOSED_LISTS);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_NUM_CLOSED_LISTS} is allowed.`));
done();
})
})
it (`At most ${retCode.boundaryLimits.MAX_NUM_PHRASES_IN_ALL_PHRASE_LIST} phrases across all phrase lists`, function(done) {
LuisBuilder.fromLUAsync(new Array(new luObj(getMaxPhraseLists(0, retCode.boundaryLimits.MAX_NUM_PHRASES_IN_ALL_PHRASE_LIST), 'stdin', true)))
.then(res => done(res))
.catch(err => {
assert.equal(err.errCode, retCode.errorCode.BOUNDARY_TOTAL_PHRASES);
assert(err.text.includes(`At most ${retCode.boundaryLimits.MAX_NUM_PHRASES_IN_ALL_PHRASE_LIST} is allowed.`));
done();
})
})
})
const getMaxListEntity = function() {
let fc = '';
for (var i = 0; i <= retCode.boundaryLimits.MAX_NUM_CLOSED_LISTS; i++) {
fc += `
@ list entity${i}`;
}
return fc;
}
const getMaxEntityAndRoles = function() {
let fc = '';
for (var i = 0; i < retCode.boundaryLimits.MAX_NUM_ROLES; i++) {
fc += `
@ ml entityBase${i} hasRoles role${i}`;
}
for (var j = retCode.boundaryLimits.MAX_NUM_ROLES; j <= retCode.boundaryLimits.MAX_TOTAL_ENTITES_AND_ROLES; j++) {
fc += `
@ ml entityFillUp${j}`
}
return fc;
}
const getMLEntity = function() {
let fc = '';
for (var i = 0; i <= retCode.boundaryLimits.MAX_NUM_PARENT_ENTITIES; i++) {
fc += `
@ ml parentEntity${i} =
- @ ml childEntity${i}`;
}
return fc;
}
const getEntityWithFeatures = function() {
let fc = '';
let descriptorsList = [];
for (var i = 0; i <= retCode.boundaryLimits.MAX_NUM_DESCRIPTORS_PER_MODEL; i++) {
let newEntityName = `entity${i}`;
descriptorsList.push(newEntityName);
fc += `
@ ml ${newEntityName}`;
}
fc += `
@ ml testEntity usesFeatures ${descriptorsList.join(',')}
`;
return fc;
}
const getEntityWithRoles = function(numEntities = 1, rolesPerEntity = retCode.boundaryLimits.MAX_ROLES_PER_ENTITY) {
let fc = '';
let roleCounter = 1;
for (var i = 1; i <= numEntities; i++) {
fc += `
@ ml entity${i} hasRoles `;
for (var j = 1; j <= rolesPerEntity; j++) {
fc += `role${roleCounter++},`;
}
fc += `role${roleCounter++}`;
}
return fc;
}
const getMaxPhraseLists = function(numPhraseLists = retCode.boundaryLimits.MAX_NUM_PHRASE_LISTS, numPhrases = null, intc = null) {
let fc = '';
for (var i = 0; i <= numPhraseLists; i++) {
fc += `
@ phraselist PL${i}`;
if (intc) fc += '(interchangeable)'
if (numPhrases) {
fc += ` =
- `;
for (var j = 0; j < numPhrases; j++) {
fc += `phrase${j},`
}
fc += `phrase-last
`;
}
}
return fc;
}
const getListEntity = function (numParents = retCode.boundaryLimits.MAX_LIST_ENTITY_CANONICAL_FORM, numSynonyms = 0) {
let fc = `
@ list entity1 =
`;
for (var i = 0; i <= numParents; i++) {
fc += `
- parent${i} :
- `;
for (var j = 0; j < numSynonyms; j++) {
fc += `synonym${i}.${j}.${POSSIBLE_CHARS.charAt(Math.floor(Math.random() * POSSIBLE_CHARS.length))},`
}
fc += `synonym.last
`;
}
return fc;
}
const getMaxRegeExEntityDefinition = function(entityNum = retCode.boundaryLimits.MAX_NUM_REGEX_ENTITIES, charLimit = retCode.boundaryLimits.MAX_NUM_REGEX_ENTITIES) {
let fc = '';
for (var i = 0; i <= entityNum; i++) {
fc += `
@ regex entity${i} = /`;
for (var j = 0; j <= charLimit; j++) {
fc += POSSIBLE_CHARS.charAt(Math.floor(Math.random() * POSSIBLE_CHARS.length));
}
fc += '/'
}
return fc;
}
const getMaxPatternCharLimit = function() {
let fc = `
# testIntent
- this {pattern} is invalid`;
for (var i = 0; i <= retCode.boundaryLimits.MAX_CHAR_IN_PATTERNS + 100; i++) {
fc += POSSIBLE_CHARS.charAt(Math.floor(Math.random() * POSSIBLE_CHARS.length));
}
return fc;
}
const getMaxPatterns = function() {
let fc = `
# testIntent`;
for (var i = 0; i <= retCode.boundaryLimits.MAX_NUM_PATTERNS; i++) {
fc += `
- utterance${i} is actually a {pattern}`;
}
return fc;
}
const getMaxIntentTestData = function() {
let fc = '';
for (var i = 0; i <= retCode.boundaryLimits.MAX_NUM_INTENTS; i++) {
fc += `
# Intent${i}
- utterance${i}
`;
}
return fc;
}
const getMaxUtteranceTestData = function() {
let fc = `
# intent1`;
for (var i = 0; i <= retCode.boundaryLimits.MAX_NUM_UTTERANCES; i++) {
fc += `
- utterance${i}`;
}
return fc;
}
const getMaxPatternAnyEntities = function() {
let fc = '';
for (var i = 0; i <= retCode.boundaryLimits.MAX_NUM_PATTERNANY_ENTITIES; i++) {
fc += `
@ patternany entity${i}`;
}
return fc;
}
const getMaxUtteranceCharLimit = function() {
let fc = `
# testIntent
- `;
for (var i = 0; i <= retCode.boundaryLimits.MAX_CHAR_IN_UTTERANCE + 100; i++) {
fc += POSSIBLE_CHARS.charAt(Math.floor(Math.random() * POSSIBLE_CHARS.length));
}
return fc;
}
```
|
```java
package com.baronzhang.android.weather.util.stetho;
import android.content.Context;
import com.baronzhang.android.weather.util.StethoHelper;
import okhttp3.OkHttpClient;
/**
* @author baronzhang (baron[dot]zhanglei[at]gmail[dot]com)
* 2017/7/25
*/
public class ReleaseStethoHelper implements StethoHelper {
@Override
public void init(Context context) {
}
@Override
public OkHttpClient.Builder addNetworkInterceptor(OkHttpClient.Builder builder) {
return null;
}
}
```
|
```css
The `box-sizing` Property
The `display` Property
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
/**
* Compute the standard deviation of a single-precision floating-point strided array.
*
* @module @stdlib/stats/base/sstdev
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
* var sstdev = require( '@stdlib/stats/base/sstdev' );
*
* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );
* var N = x.length;
*
* var v = sstdev( N, 1, x, 1 );
* // returns ~2.0817
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
* var floor = require( '@stdlib/math/base/special/floor' );
* var sstdev = require( '@stdlib/stats/base/sstdev' );
*
* var x = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );
* var N = floor( x.length / 2 );
*
* var v = sstdev.ndarray( N, 1, x, 2, 1 );
* // returns 2.5
*/
// MODULES //
var join = require( 'path' ).join;
var tryRequire = require( '@stdlib/utils/try-require' );
var isError = require( '@stdlib/assert/is-error' );
var main = require( './main.js' );
// MAIN //
var sstdev;
var tmp = tryRequire( join( __dirname, './native.js' ) );
if ( isError( tmp ) ) {
sstdev = main;
} else {
sstdev = tmp;
}
// EXPORTS //
module.exports = sstdev;
// exports: { "ndarray": "sstdev.ndarray" }
```
|
```javascript
import { ImageBorderMode, InterpolationMode } from './Constants';
export const vtkInterpolationInfo = {
pointer: null,
extent: [0, -1, 0, -1, 0, -1],
increments: [0, 0, 0],
scalarType: null, // dataType
dataTypeSize: 1, // BYTES_PER_ELEMENT
numberOfComponents: 1,
borderMode: ImageBorderMode.CLAMP,
interpolationMode: InterpolationMode.LINEAR,
extraInfo: null,
};
export const vtkInterpolationWeights = {
...vtkInterpolationInfo,
positions: [0, 0, 0],
weights: null,
weightExtent: [0, -1, 0, -1, 0, -1],
kernelSize: [1, 1, 1],
workspace: null,
lastY: null,
lastZ: null,
};
export function vtkInterpolationMathFloor(x) {
const integer = Math.floor(x);
return {
floored: integer,
error: x - integer,
};
}
export function vtkInterpolationMathRound(x) {
return Math.round(x);
}
//your_sha256_hash------------
// Perform a clamp to limit an index to [b, c] and subtract b.
export function vtkInterpolationMathClamp(a, b, c) {
let clamp = a <= c ? a : c;
clamp -= b;
clamp = clamp >= 0 ? clamp : 0;
return clamp;
}
//your_sha256_hash------------
// Perform a wrap to limit an index to [b, c] and subtract b.
export function vtkInterpolationMathWrap(a, b, c) {
const range = c - b + 1;
let wrap = a - b;
wrap %= range;
// required for some % implementations
wrap = wrap >= 0 ? wrap : wrap + range;
return wrap;
}
//your_sha256_hash------------
// Perform a mirror to limit an index to [b, c] and subtract b.
export function vtkInterpolationMathMirror(a, b, c) {
const range = c - b;
const ifzero = range === 0 ? 1 : 0;
const range2 = 2 * range + ifzero;
let mirror = a - b;
mirror = mirror >= 0 ? mirror : -mirror;
mirror %= range2;
mirror = mirror <= range ? mirror : range2 - mirror;
return mirror;
}
export default {
vtkInterpolationInfo,
vtkInterpolationWeights,
vtkInterpolationMathFloor,
vtkInterpolationMathRound,
vtkInterpolationMathClamp,
vtkInterpolationMathWrap,
vtkInterpolationMathMirror,
};
```
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package v1
// This file contains a collection of methods that can be used from go-restful to
// generate Swagger API documentation for its models. Please read this PR for more
// information on the implementation: path_to_url
//
// TODOs are ignored from the parser (e.g. TODO(andronat):... || TODO:...) if and only if
// they are on one line! For multiple line or blocks that you want to ignore use ---.
// Any context after a --- is ignored.
//
// Those methods can be generated by using hack/update-generated-swagger-docs.sh
// AUTO-GENERATED FUNCTIONS START HERE. DO NOT EDIT.
var map_IPBlock = map[string]string{
"": "IPBlock describes a particular CIDR (Ex. \"192.168.1.1/24\") that is allowed to the pods matched by a NetworkPolicySpec's podSelector. The except entry describes CIDRs that should not be included within this rule.",
"cidr": "CIDR is a string representing the IP Block Valid examples are \"192.168.1.1/24\"",
"except": "Except is a slice of CIDRs that should not be included within an IP Block Valid examples are \"192.168.1.1/24\" Except values will be rejected if they are outside the CIDR range",
}
func (IPBlock) SwaggerDoc() map[string]string {
return map_IPBlock
}
var map_NetworkPolicy = map[string]string{
"": "NetworkPolicy describes what network traffic is allowed for a set of Pods",
"metadata": "Standard object's metadata. More info: path_to_url#metadata",
"spec": "Specification of the desired behavior for this NetworkPolicy.",
}
func (NetworkPolicy) SwaggerDoc() map[string]string {
return map_NetworkPolicy
}
var map_NetworkPolicyEgressRule = map[string]string{
"": "NetworkPolicyEgressRule describes a particular set of traffic that is allowed out of pods matched by a NetworkPolicySpec's podSelector. The traffic must match both ports and to. This type is beta-level in 1.8",
"ports": "List of destination ports for outgoing traffic. Each item in this list is combined using a logical OR. If this field is empty or missing, this rule matches all ports (traffic not restricted by port). If this field is present and contains at least one item, then this rule allows traffic only if the traffic matches at least one port in the list.",
"to": "List of destinations for outgoing traffic of pods selected for this rule. Items in this list are combined using a logical OR operation. If this field is empty or missing, this rule matches all destinations (traffic not restricted by destination). If this field is present and contains at least one item, this rule allows traffic only if the traffic matches at least one item in the to list.",
}
func (NetworkPolicyEgressRule) SwaggerDoc() map[string]string {
return map_NetworkPolicyEgressRule
}
var map_NetworkPolicyIngressRule = map[string]string{
"": "NetworkPolicyIngressRule describes a particular set of traffic that is allowed to the pods matched by a NetworkPolicySpec's podSelector. The traffic must match both ports and from.",
"ports": "List of ports which should be made accessible on the pods selected for this rule. Each item in this list is combined using a logical OR. If this field is empty or missing, this rule matches all ports (traffic not restricted by port). If this field is present and contains at least one item, then this rule allows traffic only if the traffic matches at least one port in the list.",
"from": "List of sources which should be able to access the pods selected for this rule. Items in this list are combined using a logical OR operation. If this field is empty or missing, this rule matches all sources (traffic not restricted by source). If this field is present and contains at least on item, this rule allows traffic only if the traffic matches at least one item in the from list.",
}
func (NetworkPolicyIngressRule) SwaggerDoc() map[string]string {
return map_NetworkPolicyIngressRule
}
var map_NetworkPolicyList = map[string]string{
"": "NetworkPolicyList is a list of NetworkPolicy objects.",
"metadata": "Standard list metadata. More info: path_to_url#metadata",
"items": "Items is a list of schema objects.",
}
func (NetworkPolicyList) SwaggerDoc() map[string]string {
return map_NetworkPolicyList
}
var map_NetworkPolicyPeer = map[string]string{
"": "NetworkPolicyPeer describes a peer to allow traffic from. Only certain combinations of fields are allowed",
"podSelector": "This is a label selector which selects Pods. This field follows standard label selector semantics; if present but empty, it selects all pods.\n\nIf NamespaceSelector is also set, then the NetworkPolicyPeer as a whole selects the Pods matching PodSelector in the Namespaces selected by NamespaceSelector. Otherwise it selects the Pods matching PodSelector in the policy's own Namespace.",
"namespaceSelector": "Selects Namespaces using cluster-scoped labels. This field follows standard label selector semantics; if present but empty, it selects all namespaces.\n\nIf PodSelector is also set, then the NetworkPolicyPeer as a whole selects the Pods matching PodSelector in the Namespaces selected by NamespaceSelector. Otherwise it selects all Pods in the Namespaces selected by NamespaceSelector.",
"ipBlock": "IPBlock defines policy on a particular IPBlock. If this field is set then neither of the other fields can be.",
}
func (NetworkPolicyPeer) SwaggerDoc() map[string]string {
return map_NetworkPolicyPeer
}
var map_NetworkPolicyPort = map[string]string{
"": "NetworkPolicyPort describes a port to allow traffic on",
"protocol": "The protocol (TCP, UDP, or SCTP) which traffic must match. If not specified, this field defaults to TCP.",
"port": "The port on the given protocol. This can either be a numerical or named port on a pod. If this field is not provided, this matches all port names and numbers.",
}
func (NetworkPolicyPort) SwaggerDoc() map[string]string {
return map_NetworkPolicyPort
}
var map_NetworkPolicySpec = map[string]string{
"": "NetworkPolicySpec provides the specification of a NetworkPolicy",
"podSelector": "Selects the pods to which this NetworkPolicy object applies. The array of ingress rules is applied to any pods selected by this field. Multiple network policies can select the same set of pods. In this case, the ingress rules for each are combined additively. This field is NOT optional and follows standard label selector semantics. An empty podSelector matches all pods in this namespace.",
"ingress": "List of ingress rules to be applied to the selected pods. Traffic is allowed to a pod if there are no NetworkPolicies selecting the pod (and cluster policy otherwise allows the traffic), OR if the traffic source is the pod's local node, OR if the traffic matches at least one ingress rule across all of the NetworkPolicy objects whose podSelector matches the pod. If this field is empty then this NetworkPolicy does not allow any traffic (and serves solely to ensure that the pods it selects are isolated by default)",
"egress": "List of egress rules to be applied to the selected pods. Outgoing traffic is allowed if there are no NetworkPolicies selecting the pod (and cluster policy otherwise allows the traffic), OR if the traffic matches at least one egress rule across all of the NetworkPolicy objects whose podSelector matches the pod. If this field is empty then this NetworkPolicy limits all outgoing traffic (and serves solely to ensure that the pods it selects are isolated by default). This field is beta-level in 1.8",
"policyTypes": "List of rule types that the NetworkPolicy relates to. Valid options are \"Ingress\", \"Egress\", or \"Ingress,Egress\". If this field is not specified, it will default based on the existence of Ingress or Egress rules; policies that contain an Egress section are assumed to affect Egress, and all policies (whether or not they contain an Ingress section) are assumed to affect Ingress. If you want to write an egress-only policy, you must explicitly specify policyTypes [ \"Egress\" ]. Likewise, if you want to write a policy that specifies that no egress is allowed, you must specify a policyTypes value that include \"Egress\" (since such a policy would not include an Egress section and would otherwise default to just [ \"Ingress\" ]). This field is beta-level in 1.8",
}
func (NetworkPolicySpec) SwaggerDoc() map[string]string {
return map_NetworkPolicySpec
}
// AUTO-GENERATED FUNCTIONS END HERE
```
|
```java
Java Virtual Machine
Uses of the `final` keyword
The distinction between overloading and overriding methods
There is no such thing as *pass-by-reference* in Java
How range operations work
```
|
Jinli () is a village in the Agdam District of Azerbaijan.
References
Populated places in Aghdam District
|
```c++
This program is free software; you can redistribute it and/or modify
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program; if not, write to the Free Software Foundation,
51 Franklin Street, Suite 500, Boston, MA 02110-1335 USA */
/**
@file storage/perfschema/table_events_waits.cc
Table EVENTS_WAITS_xxx (implementation).
*/
#include "my_global.h"
#include "my_pthread.h"
#include "table_events_waits.h"
#include "pfs_global.h"
#include "pfs_instr_class.h"
#include "pfs_instr.h"
#include "pfs_events_waits.h"
#include "pfs_timer.h"
#include "m_string.h"
THR_LOCK table_events_waits_current::m_table_lock;
static const TABLE_FIELD_TYPE field_types[]=
{
{
{ C_STRING_WITH_LEN("THREAD_ID") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("EVENT_ID") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("END_EVENT_ID") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("EVENT_NAME") },
{ C_STRING_WITH_LEN("varchar(128)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("SOURCE") },
{ C_STRING_WITH_LEN("varchar(64)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("TIMER_START") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("TIMER_END") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("TIMER_WAIT") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("SPINS") },
{ C_STRING_WITH_LEN("int(10)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OBJECT_SCHEMA") },
{ C_STRING_WITH_LEN("varchar(64)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OBJECT_NAME") },
{ C_STRING_WITH_LEN("varchar(512)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("INDEX_NAME") },
{ C_STRING_WITH_LEN("varchar(64)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OBJECT_TYPE") },
{ C_STRING_WITH_LEN("varchar(64)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OBJECT_INSTANCE_BEGIN") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("NESTING_EVENT_ID") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("NESTING_EVENT_TYPE") },
{ C_STRING_WITH_LEN("enum(\'STATEMENT\',\'STAGE\',\'WAIT\'") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OPERATION") },
{ C_STRING_WITH_LEN("varchar(32)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("NUMBER_OF_BYTES") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("FLAGS") },
{ C_STRING_WITH_LEN("int(10)") },
{ NULL, 0}
}
};
TABLE_FIELD_DEF
table_events_waits_current::m_field_def=
{ 19, field_types };
PFS_engine_table_share
table_events_waits_current::m_share=
{
{ C_STRING_WITH_LEN("events_waits_current") },
&pfs_truncatable_acl,
&table_events_waits_current::create,
NULL, /* write_row */
&table_events_waits_current::delete_all_rows,
NULL, /* get_row_count */
1000, /* records */
sizeof(pos_events_waits_current), /* ref length */
&m_table_lock,
&m_field_def,
false /* checked */
};
THR_LOCK table_events_waits_history::m_table_lock;
PFS_engine_table_share
table_events_waits_history::m_share=
{
{ C_STRING_WITH_LEN("events_waits_history") },
&pfs_truncatable_acl,
&table_events_waits_history::create,
NULL, /* write_row */
&table_events_waits_history::delete_all_rows,
NULL, /* get_row_count */
1000, /* records */
sizeof(pos_events_waits_history), /* ref length */
&m_table_lock,
&table_events_waits_current::m_field_def,
false /* checked */
};
THR_LOCK table_events_waits_history_long::m_table_lock;
PFS_engine_table_share
table_events_waits_history_long::m_share=
{
{ C_STRING_WITH_LEN("events_waits_history_long") },
&pfs_truncatable_acl,
&table_events_waits_history_long::create,
NULL, /* write_row */
&table_events_waits_history_long::delete_all_rows,
NULL, /* get_row_count */
10000, /* records */
sizeof(PFS_simple_index), /* ref length */
&m_table_lock,
&table_events_waits_current::m_field_def,
false /* checked */
};
table_events_waits_common::table_events_waits_common
(const PFS_engine_table_share *share, void *pos)
: PFS_engine_table(share, pos),
m_row_exists(false)
{}
void table_events_waits_common::clear_object_columns()
{
m_row.m_object_type= NULL;
m_row.m_object_type_length= 0;
m_row.m_object_schema_length= 0;
m_row.m_object_name_length= 0;
m_row.m_index_name_length= 0;
m_row.m_object_instance_addr= 0;
}
int table_events_waits_common::make_table_object_columns(volatile PFS_events_waits *wait)
{
uint safe_index;
PFS_table_share *safe_table_share;
safe_table_share= sanitize_table_share(wait->m_weak_table_share);
if (unlikely(safe_table_share == NULL))
return 1;
if (wait->m_object_type == OBJECT_TYPE_TABLE)
{
m_row.m_object_type= "TABLE";
m_row.m_object_type_length= 5;
}
else
{
m_row.m_object_type= "TEMPORARY TABLE";
m_row.m_object_type_length= 15;
}
if (safe_table_share->get_version() == wait->m_weak_version)
{
/* OBJECT SCHEMA */
m_row.m_object_schema_length= safe_table_share->m_schema_name_length;
if (unlikely((m_row.m_object_schema_length == 0) ||
(m_row.m_object_schema_length > sizeof(m_row.m_object_schema))))
return 1;
memcpy(m_row.m_object_schema, safe_table_share->m_schema_name, m_row.m_object_schema_length);
/* OBJECT NAME */
m_row.m_object_name_length= safe_table_share->m_table_name_length;
if (unlikely((m_row.m_object_name_length == 0) ||
(m_row.m_object_name_length > sizeof(m_row.m_object_name))))
return 1;
memcpy(m_row.m_object_name, safe_table_share->m_table_name, m_row.m_object_name_length);
/* INDEX NAME */
safe_index= wait->m_index;
uint safe_key_count= sanitize_index_count(safe_table_share->m_key_count);
if (safe_index < safe_key_count)
{
PFS_table_key *key= & safe_table_share->m_keys[safe_index];
m_row.m_index_name_length= key->m_name_length;
if (unlikely((m_row.m_index_name_length == 0) ||
(m_row.m_index_name_length > sizeof(m_row.m_index_name))))
return 1;
memcpy(m_row.m_index_name, key->m_name, m_row.m_index_name_length);
}
else
m_row.m_index_name_length= 0;
}
else
{
m_row.m_object_schema_length= 0;
m_row.m_object_name_length= 0;
m_row.m_index_name_length= 0;
}
m_row.m_object_instance_addr= (intptr) wait->m_object_instance_addr;
return 0;
}
int table_events_waits_common::make_file_object_columns(volatile PFS_events_waits *wait)
{
PFS_file *safe_file;
safe_file= sanitize_file(wait->m_weak_file);
if (unlikely(safe_file == NULL))
return 1;
m_row.m_object_type= "FILE";
m_row.m_object_type_length= 4;
m_row.m_object_schema_length= 0;
m_row.m_object_instance_addr= (intptr) wait->m_object_instance_addr;
if (safe_file->get_version() == wait->m_weak_version)
{
/* OBJECT NAME */
m_row.m_object_name_length= safe_file->m_filename_length;
if (unlikely((m_row.m_object_name_length == 0) ||
(m_row.m_object_name_length > sizeof(m_row.m_object_name))))
return 1;
memcpy(m_row.m_object_name, safe_file->m_filename, m_row.m_object_name_length);
}
else
{
m_row.m_object_name_length= 0;
}
m_row.m_index_name_length= 0;
return 0;
}
int table_events_waits_common::make_socket_object_columns(volatile PFS_events_waits *wait)
{
PFS_socket *safe_socket;
safe_socket= sanitize_socket(wait->m_weak_socket);
if (unlikely(safe_socket == NULL))
return 1;
m_row.m_object_type= "SOCKET";
m_row.m_object_type_length= 6;
m_row.m_object_schema_length= 0;
m_row.m_object_instance_addr= (intptr) wait->m_object_instance_addr;
if (safe_socket->get_version() == wait->m_weak_version)
{
/* Convert port number to string, include delimiter in port name length */
uint port;
char port_str[128];
char ip_str[INET6_ADDRSTRLEN+1];
uint ip_len= 0;
port_str[0]= ':';
/* Get the IP address and port number */
ip_len= pfs_get_socket_address(ip_str, sizeof(ip_str), &port,
&safe_socket->m_sock_addr,
safe_socket->m_addr_len);
/* Convert port number to a string (length includes ':') */
int port_len= int10_to_str(port, (port_str+1), 10) - port_str + 1;
/* OBJECT NAME */
m_row.m_object_name_length= ip_len + port_len;
if (unlikely((m_row.m_object_name_length == 0) ||
(m_row.m_object_name_length > sizeof(m_row.m_object_name))))
return 1;
char *name= m_row.m_object_name;
memcpy(name, ip_str, ip_len);
memcpy(name + ip_len, port_str, port_len);
}
else
{
m_row.m_object_name_length= 0;
}
m_row.m_index_name_length= 0;
return 0;
}
/**
Build a row.
@param thread_own_wait True if the memory for the wait
is owned by pfs_thread
@param pfs_thread the thread the cursor is reading
@param wait the wait the cursor is reading
*/
void table_events_waits_common::make_row(bool thread_own_wait,
PFS_thread *pfs_thread,
volatile PFS_events_waits *wait)
{
pfs_lock lock;
PFS_thread *safe_thread;
PFS_instr_class *safe_class;
const char *base;
const char *safe_source_file;
enum_timer_name timer_name= wait_timer;
ulonglong timer_end;
m_row_exists= false;
safe_thread= sanitize_thread(pfs_thread);
if (unlikely(safe_thread == NULL))
return;
/* Protect this reader against a thread termination */
if (thread_own_wait)
safe_thread->m_lock.begin_optimistic_lock(&lock);
/*
Design choice:
We could have used a pfs_lock in PFS_events_waits here,
to protect the reader from concurrent event generation,
but this leads to too many pfs_lock atomic operations
each time an event is recorded:
- 1 dirty() + 1 allocated() per event start, for EVENTS_WAITS_CURRENT
- 1 dirty() + 1 allocated() per event end, for EVENTS_WAITS_CURRENT
- 1 dirty() + 1 allocated() per copy to EVENTS_WAITS_HISTORY
- 1 dirty() + 1 allocated() per copy to EVENTS_WAITS_HISTORY_LONG
or 8 atomics per recorded event.
The problem is that we record a *lot* of events ...
This code is prepared to accept *dirty* records,
and sanitizes all the data before returning a row.
*/
/*
PFS_events_waits::m_class needs to be sanitized,
for race conditions when this code:
- reads a new value in m_wait_class,
- reads an old value in m_class.
*/
switch (wait->m_wait_class)
{
case WAIT_CLASS_IDLE:
clear_object_columns();
safe_class= sanitize_idle_class(wait->m_class);
timer_name= idle_timer;
break;
case WAIT_CLASS_MUTEX:
clear_object_columns();
safe_class= sanitize_mutex_class((PFS_mutex_class*) wait->m_class);
break;
case WAIT_CLASS_RWLOCK:
clear_object_columns();
safe_class= sanitize_rwlock_class((PFS_rwlock_class*) wait->m_class);
break;
case WAIT_CLASS_COND:
clear_object_columns();
safe_class= sanitize_cond_class((PFS_cond_class*) wait->m_class);
break;
case WAIT_CLASS_TABLE:
if (make_table_object_columns(wait))
return;
safe_class= sanitize_table_class(wait->m_class);
break;
case WAIT_CLASS_FILE:
if (make_file_object_columns(wait))
return;
safe_class= sanitize_file_class((PFS_file_class*) wait->m_class);
break;
case WAIT_CLASS_SOCKET:
if (make_socket_object_columns(wait))
return;
safe_class= sanitize_socket_class((PFS_socket_class*) wait->m_class);
break;
case NO_WAIT_CLASS:
default:
return;
}
if (unlikely(safe_class == NULL))
return;
m_row.m_thread_internal_id= safe_thread->m_thread_internal_id;
m_row.m_event_id= wait->m_event_id;
m_row.m_end_event_id= wait->m_end_event_id;
m_row.m_nesting_event_id= wait->m_nesting_event_id;
m_row.m_nesting_event_type= wait->m_nesting_event_type;
get_normalizer(safe_class);
if (m_row.m_end_event_id == 0)
{
timer_end= get_timer_raw_value(timer_name);
}
else
{
timer_end= wait->m_timer_end;
}
m_normalizer->to_pico(wait->m_timer_start, timer_end,
& m_row.m_timer_start, & m_row.m_timer_end, & m_row.m_timer_wait);
m_row.m_name= safe_class->m_name;
m_row.m_name_length= safe_class->m_name_length;
/*
We are assuming this pointer is sane,
since it comes from __FILE__.
*/
safe_source_file= wait->m_source_file;
if (unlikely(safe_source_file == NULL))
return;
base= base_name(wait->m_source_file);
m_row.m_source_length= my_snprintf(m_row.m_source, sizeof(m_row.m_source),
"%s:%d", base, wait->m_source_line);
if (m_row.m_source_length > sizeof(m_row.m_source))
m_row.m_source_length= sizeof(m_row.m_source);
m_row.m_operation= wait->m_operation;
m_row.m_number_of_bytes= wait->m_number_of_bytes;
m_row.m_flags= wait->m_flags;
if (thread_own_wait)
{
if (safe_thread->m_lock.end_optimistic_lock(&lock))
m_row_exists= true;
}
else
{
/*
For EVENTS_WAITS_HISTORY_LONG (thread_own_wait is false),
the wait record is always valid, because it is not stored
in memory owned by pfs_thread.
Even when the thread terminated, the record is mostly readable,
so this record is displayed.
*/
m_row_exists= true;
}
}
/**
Operations names map, as displayed in the 'OPERATION' column.
Indexed by enum_operation_type - 1.
Note: enum_operation_type contains a more precise definition,
since more details are needed internally by the instrumentation.
Different similar operations (CLOSE vs STREAMCLOSE) are displayed
with the same name 'close'.
*/
static const LEX_STRING operation_names_map[]=
{
/* Mutex operations */
{ C_STRING_WITH_LEN("lock") },
{ C_STRING_WITH_LEN("try_lock") },
/* RWLock operations */
{ C_STRING_WITH_LEN("read_lock") },
{ C_STRING_WITH_LEN("write_lock") },
{ C_STRING_WITH_LEN("try_read_lock") },
{ C_STRING_WITH_LEN("try_write_lock") },
/* Condition operations */
{ C_STRING_WITH_LEN("wait") },
{ C_STRING_WITH_LEN("timed_wait") },
/* File operations */
{ C_STRING_WITH_LEN("create") },
{ C_STRING_WITH_LEN("create") }, /* create tmp */
{ C_STRING_WITH_LEN("open") },
{ C_STRING_WITH_LEN("open") }, /* stream open */
{ C_STRING_WITH_LEN("close") },
{ C_STRING_WITH_LEN("close") }, /* stream close */
{ C_STRING_WITH_LEN("read") },
{ C_STRING_WITH_LEN("write") },
{ C_STRING_WITH_LEN("seek") },
{ C_STRING_WITH_LEN("tell") },
{ C_STRING_WITH_LEN("flush") },
{ C_STRING_WITH_LEN("stat") },
{ C_STRING_WITH_LEN("stat") }, /* fstat */
{ C_STRING_WITH_LEN("chsize") },
{ C_STRING_WITH_LEN("delete") },
{ C_STRING_WITH_LEN("rename") },
{ C_STRING_WITH_LEN("sync") },
/* Table io operations */
{ C_STRING_WITH_LEN("fetch") },
{ C_STRING_WITH_LEN("insert") }, /* write row */
{ C_STRING_WITH_LEN("update") }, /* update row */
{ C_STRING_WITH_LEN("delete") }, /* delete row */
/* Table lock operations */
{ C_STRING_WITH_LEN("read normal") },
{ C_STRING_WITH_LEN("read with shared locks") },
{ C_STRING_WITH_LEN("read high priority") },
{ C_STRING_WITH_LEN("read no inserts") },
{ C_STRING_WITH_LEN("write allow write") },
{ C_STRING_WITH_LEN("write concurrent insert") },
{ C_STRING_WITH_LEN("write delayed") },
{ C_STRING_WITH_LEN("write low priority") },
{ C_STRING_WITH_LEN("write normal") },
{ C_STRING_WITH_LEN("read external") },
{ C_STRING_WITH_LEN("write external") },
/* Socket operations */
{ C_STRING_WITH_LEN("create") },
{ C_STRING_WITH_LEN("connect") },
{ C_STRING_WITH_LEN("bind") },
{ C_STRING_WITH_LEN("close") },
{ C_STRING_WITH_LEN("send") },
{ C_STRING_WITH_LEN("recv") },
{ C_STRING_WITH_LEN("sendto") },
{ C_STRING_WITH_LEN("recvfrom") },
{ C_STRING_WITH_LEN("sendmsg") },
{ C_STRING_WITH_LEN("recvmsg") },
{ C_STRING_WITH_LEN("seek") },
{ C_STRING_WITH_LEN("opt") },
{ C_STRING_WITH_LEN("stat") },
{ C_STRING_WITH_LEN("shutdown") },
{ C_STRING_WITH_LEN("select") },
/* Idle operations */
{ C_STRING_WITH_LEN("idle") }
};
int table_events_waits_common::read_row_values(TABLE *table,
unsigned char *buf,
Field **fields,
bool read_all)
{
Field *f;
const LEX_STRING *operation;
compile_time_assert(COUNT_OPERATION_TYPE ==
array_elements(operation_names_map));
if (unlikely(! m_row_exists))
return HA_ERR_RECORD_DELETED;
/* Set the null bits */
DBUG_ASSERT(table->s->null_bytes == 2);
buf[0]= 0;
buf[1]= 0;
/*
Some columns are unreliable, because they are joined with other buffers,
which could have changed and been reused for something else.
These columns are:
- THREAD_ID (m_thread joins with PFS_thread),
- SCHEMA_NAME (m_schema_name joins with PFS_table_share)
- OBJECT_NAME (m_object_name joins with PFS_table_share)
*/
for (; (f= *fields) ; fields++)
{
if (read_all || bitmap_is_set(table->read_set, f->field_index))
{
switch(f->field_index)
{
case 0: /* THREAD_ID */
set_field_ulonglong(f, m_row.m_thread_internal_id);
break;
case 1: /* EVENT_ID */
set_field_ulonglong(f, m_row.m_event_id);
break;
case 2: /* END_EVENT_ID */
if (m_row.m_end_event_id > 0)
set_field_ulonglong(f, m_row.m_end_event_id - 1);
else
f->set_null();
break;
case 3: /* EVENT_NAME */
set_field_varchar_utf8(f, m_row.m_name, m_row.m_name_length);
break;
case 4: /* SOURCE */
set_field_varchar_utf8(f, m_row.m_source, m_row.m_source_length);
break;
case 5: /* TIMER_START */
if (m_row.m_timer_start != 0)
set_field_ulonglong(f, m_row.m_timer_start);
else
f->set_null();
break;
case 6: /* TIMER_END */
if (m_row.m_timer_end != 0)
set_field_ulonglong(f, m_row.m_timer_end);
else
f->set_null();
break;
case 7: /* TIMER_WAIT */
if (m_row.m_timer_wait != 0)
set_field_ulonglong(f, m_row.m_timer_wait);
else
f->set_null();
break;
case 8: /* SPINS */
f->set_null();
break;
case 9: /* OBJECT_SCHEMA */
if (m_row.m_object_schema_length > 0)
{
set_field_varchar_utf8(f, m_row.m_object_schema,
m_row.m_object_schema_length);
}
else
f->set_null();
break;
case 10: /* OBJECT_NAME */
if (m_row.m_object_name_length > 0)
{
set_field_varchar_utf8(f, m_row.m_object_name,
m_row.m_object_name_length);
}
else
f->set_null();
break;
case 11: /* INDEX_NAME */
if (m_row.m_index_name_length > 0)
{
set_field_varchar_utf8(f, m_row.m_index_name,
m_row.m_index_name_length);
}
else
f->set_null();
break;
case 12: /* OBJECT_TYPE */
if (m_row.m_object_type)
{
set_field_varchar_utf8(f, m_row.m_object_type,
m_row.m_object_type_length);
}
else
f->set_null();
break;
case 13: /* OBJECT_INSTANCE */
set_field_ulonglong(f, m_row.m_object_instance_addr);
break;
case 14: /* NESTING_EVENT_ID */
if (m_row.m_nesting_event_id != 0)
set_field_ulonglong(f, m_row.m_nesting_event_id);
else
f->set_null();
break;
case 15: /* NESTING_EVENT_TYPE */
if (m_row.m_nesting_event_id != 0)
set_field_enum(f, m_row.m_nesting_event_type);
else
f->set_null();
break;
case 16: /* OPERATION */
operation= &operation_names_map[(int) m_row.m_operation - 1];
set_field_varchar_utf8(f, operation->str, operation->length);
break;
case 17: /* NUMBER_OF_BYTES */
if ((m_row.m_operation == OPERATION_TYPE_FILEREAD) ||
(m_row.m_operation == OPERATION_TYPE_FILEWRITE) ||
(m_row.m_operation == OPERATION_TYPE_FILECHSIZE) ||
(m_row.m_operation == OPERATION_TYPE_SOCKETSEND) ||
(m_row.m_operation == OPERATION_TYPE_SOCKETRECV) ||
(m_row.m_operation == OPERATION_TYPE_SOCKETSENDTO) ||
(m_row.m_operation == OPERATION_TYPE_SOCKETRECVFROM))
set_field_ulonglong(f, m_row.m_number_of_bytes);
else
f->set_null();
break;
case 18: /* FLAGS */
f->set_null();
break;
default:
DBUG_ASSERT(false);
}
}
}
return 0;
}
PFS_engine_table* table_events_waits_current::create(void)
{
return new table_events_waits_current();
}
table_events_waits_current::table_events_waits_current()
: table_events_waits_common(&m_share, &m_pos),
m_pos(), m_next_pos()
{}
void table_events_waits_current::reset_position(void)
{
m_pos.reset();
m_next_pos.reset();
}
int table_events_waits_current::rnd_next(void)
{
PFS_thread *pfs_thread;
PFS_events_waits *wait;
for (m_pos.set_at(&m_next_pos);
m_pos.m_index_1 < thread_max;
m_pos.next_thread())
{
pfs_thread= &thread_array[m_pos.m_index_1];
if (! pfs_thread->m_lock.is_populated())
{
/* This thread does not exist */
continue;
}
/*
We do not show nested events for now,
this will be revised with TABLE io
*/
// #define ONLY_SHOW_ONE_WAIT
#ifdef ONLY_SHOW_ONE_WAIT
if (m_pos.m_index_2 >= 1)
continue;
#else
/* m_events_waits_stack[0] is a dummy record */
PFS_events_waits *top_wait = &pfs_thread->m_events_waits_stack[WAIT_STACK_BOTTOM];
wait= &pfs_thread->m_events_waits_stack[m_pos.m_index_2 + WAIT_STACK_BOTTOM];
PFS_events_waits *safe_current = pfs_thread->m_events_waits_current;
if (safe_current == top_wait)
{
/* Display the last top level wait, when completed */
if (m_pos.m_index_2 >= 1)
continue;
}
else
{
/* Display all pending waits, when in progress */
if (wait >= safe_current)
continue;
}
#endif
if (wait->m_wait_class == NO_WAIT_CLASS)
{
/*
This locker does not exist.
There can not be more lockers in the stack, skip to the next thread
*/
continue;
}
make_row(true, pfs_thread, wait);
/* Next iteration, look for the next locker in this thread */
m_next_pos.set_after(&m_pos);
return 0;
}
return HA_ERR_END_OF_FILE;
}
int table_events_waits_current::rnd_pos(const void *pos)
{
PFS_thread *pfs_thread;
PFS_events_waits *wait;
set_position(pos);
DBUG_ASSERT(m_pos.m_index_1 < thread_max);
pfs_thread= &thread_array[m_pos.m_index_1];
if (! pfs_thread->m_lock.is_populated())
return HA_ERR_RECORD_DELETED;
#ifdef ONLY_SHOW_ONE_WAIT
if (m_pos.m_index_2 >= 1)
return HA_ERR_RECORD_DELETED;
#else
/* m_events_waits_stack[0] is a dummy record */
PFS_events_waits *top_wait = &pfs_thread->m_events_waits_stack[WAIT_STACK_BOTTOM];
wait= &pfs_thread->m_events_waits_stack[m_pos.m_index_2 + WAIT_STACK_BOTTOM];
PFS_events_waits *safe_current = pfs_thread->m_events_waits_current;
if (safe_current == top_wait)
{
/* Display the last top level wait, when completed */
if (m_pos.m_index_2 >= 1)
return HA_ERR_RECORD_DELETED;
}
else
{
/* Display all pending waits, when in progress */
if (wait >= safe_current)
return HA_ERR_RECORD_DELETED;
}
#endif
DBUG_ASSERT(m_pos.m_index_2 < WAIT_STACK_LOGICAL_SIZE);
if (wait->m_wait_class == NO_WAIT_CLASS)
return HA_ERR_RECORD_DELETED;
make_row(true, pfs_thread, wait);
return 0;
}
int table_events_waits_current::delete_all_rows(void)
{
reset_events_waits_current();
return 0;
}
PFS_engine_table* table_events_waits_history::create(void)
{
return new table_events_waits_history();
}
table_events_waits_history::table_events_waits_history()
: table_events_waits_common(&m_share, &m_pos),
m_pos(), m_next_pos()
{}
void table_events_waits_history::reset_position(void)
{
m_pos.reset();
m_next_pos.reset();
}
int table_events_waits_history::rnd_next(void)
{
PFS_thread *pfs_thread;
PFS_events_waits *wait;
if (events_waits_history_per_thread == 0)
return HA_ERR_END_OF_FILE;
for (m_pos.set_at(&m_next_pos);
m_pos.m_index_1 < thread_max;
m_pos.next_thread())
{
pfs_thread= &thread_array[m_pos.m_index_1];
if (! pfs_thread->m_lock.is_populated())
{
/* This thread does not exist */
continue;
}
if (m_pos.m_index_2 >= events_waits_history_per_thread)
{
/* This thread does not have more (full) history */
continue;
}
if ( ! pfs_thread->m_waits_history_full &&
(m_pos.m_index_2 >= pfs_thread->m_waits_history_index))
{
/* This thread does not have more (not full) history */
continue;
}
if (pfs_thread->m_waits_history[m_pos.m_index_2].m_wait_class
== NO_WAIT_CLASS)
{
/*
This locker does not exist.
There can not be more lockers in the stack, skip to the next thread
*/
continue;
}
wait= &pfs_thread->m_waits_history[m_pos.m_index_2];
make_row(true, pfs_thread, wait);
/* Next iteration, look for the next history in this thread */
m_next_pos.set_after(&m_pos);
return 0;
}
return HA_ERR_END_OF_FILE;
}
int table_events_waits_history::rnd_pos(const void *pos)
{
PFS_thread *pfs_thread;
PFS_events_waits *wait;
DBUG_ASSERT(events_waits_history_per_thread != 0);
set_position(pos);
DBUG_ASSERT(m_pos.m_index_1 < thread_max);
pfs_thread= &thread_array[m_pos.m_index_1];
if (! pfs_thread->m_lock.is_populated())
return HA_ERR_RECORD_DELETED;
DBUG_ASSERT(m_pos.m_index_2 < events_waits_history_per_thread);
if ( ! pfs_thread->m_waits_history_full &&
(m_pos.m_index_2 >= pfs_thread->m_waits_history_index))
return HA_ERR_RECORD_DELETED;
wait= &pfs_thread->m_waits_history[m_pos.m_index_2];
if (wait->m_wait_class == NO_WAIT_CLASS)
return HA_ERR_RECORD_DELETED;
make_row(true, pfs_thread, wait);
return 0;
}
int table_events_waits_history::delete_all_rows(void)
{
reset_events_waits_history();
return 0;
}
PFS_engine_table* table_events_waits_history_long::create(void)
{
return new table_events_waits_history_long();
}
table_events_waits_history_long::table_events_waits_history_long()
: table_events_waits_common(&m_share, &m_pos),
m_pos(0), m_next_pos(0)
{}
void table_events_waits_history_long::reset_position(void)
{
m_pos.m_index= 0;
m_next_pos.m_index= 0;
}
int table_events_waits_history_long::rnd_next(void)
{
PFS_events_waits *wait;
uint limit;
if (events_waits_history_long_size == 0)
return HA_ERR_END_OF_FILE;
if (events_waits_history_long_full)
limit= events_waits_history_long_size;
else
limit= events_waits_history_long_index % events_waits_history_long_size;
for (m_pos.set_at(&m_next_pos); m_pos.m_index < limit; m_pos.next())
{
wait= &events_waits_history_long_array[m_pos.m_index];
if (wait->m_wait_class != NO_WAIT_CLASS)
{
make_row(false, wait->m_thread, wait);
/* Next iteration, look for the next entry */
m_next_pos.set_after(&m_pos);
return 0;
}
}
return HA_ERR_END_OF_FILE;
}
int table_events_waits_history_long::rnd_pos(const void *pos)
{
PFS_events_waits *wait;
uint limit;
if (events_waits_history_long_size == 0)
return HA_ERR_RECORD_DELETED;
set_position(pos);
if (events_waits_history_long_full)
limit= events_waits_history_long_size;
else
limit= events_waits_history_long_index % events_waits_history_long_size;
if (m_pos.m_index >= limit)
return HA_ERR_RECORD_DELETED;
wait= &events_waits_history_long_array[m_pos.m_index];
if (wait->m_wait_class == NO_WAIT_CLASS)
return HA_ERR_RECORD_DELETED;
make_row(false, wait->m_thread, wait);
return 0;
}
int table_events_waits_history_long::delete_all_rows(void)
{
reset_events_waits_history_long();
return 0;
}
```
|
```java
package chapter1.section1;
/**
* Created by Rene Argento
*/
public class Exercise1 {
public static void main(String[] args) {
int resultA = (0 + 15) / 2;
double resultB = 2.0e-6 * 100000000.1;
boolean resultC = true && false || true && true;
System.out.println("a) " + resultA);
System.out.println("b) " + resultB);
System.out.println("c) " + resultC);
}
}
```
|
In flow measurement, flow meter error is typically reported by a percentage indicating non-linearity of the device. This can be expressed as either a +/- percentage based on either the full range capacity of the device or as a percentage of the actual indicated flow. In practice the flow meter error is a combination of repeatability, accuracy and the uncertainty of the reference calibration. http://www.flowmeters.co.uk/liquid-flow-meter-performance-specification-glossary/
Measurement
Error
|
Moonlight Resonance (Traditional Chinese: 溏心風暴之家好月圓) is a 2008 grand production HDTV drama by TVB. It is a spiritual sequel to 2007's award-winning series, Heart of Greed featuring most of the original cast members. The series is written and edited by Cheung Wah-biu and Sit Ga-wah. Sponsored by Kee Wah Bakery, the series began broadcast on 28 July 2008. It stars Louise Lee, Ha Yu, Michelle Yim, Susanna Kwan, Moses Chan, Raymond Lam and Linda Chung. Its final episode was one of the highest rated TVB episodes in the 2000s decade at 50 points. The series was met with critical acclaim, with praise to the intense plot, excellent performances by the cast, and moving storyline. It went on to receive various awards and is one of the highest-rated TVB series in viewership in the 2000s.
Plot
Chung Siu-Hor, discovered that her husband Gan Tai-Cho was having an affair with their employee Yan-Hung. Siu-Hor and Tai-Cho owned a confectionery together known as the Moonlight Bakery. Yan-Hung forces Siu-Hor and Tai-Cho to declare divorce.
After this divorce, Yan-Hung and Tai-Cho take on the Moonlight Bakery name and prove successful, resulting in a family asset totaling HK$1 billion. Meanwhile, Siu-Hor struggles to make a living at the modest bakery she once owned with Tai-Cho. Over the next ten years, Yan-Hung manipulates the family to keep relations hostile.
When Yan-Hung has a miscarriage with Tai-Cho's baby, she blames Wing-Yuen to make him feel indebted to her. Meanwhile, Siu-Hor's sister Chung Siu-Sa comes to Hong Kong after divorcing her husband. Siu-Sa is very angry that Siu-Hor let Tai-Cho take the Moonlight Bakery name and decides to sue Yun-Hung and Tai-Cho for the Moonlight Bakery franchise. However, Siu-Sa ultimately loses the court case.
Wing-Ka lacks interest in managing the bakery; instead, he is addicted to the stock market. With Siu-Hor and Hou-Yuet's encouragement and support, he is able to quit gambling. Wing-Ka eventually falls for his cousin, Siu-Sa's daughter, Ka Mei.
When she comes back, the two fall in love again. However, the appearance of Dr. Ling Chi Shun causes So-Sum to abandon her feelings for Wing-Ho. She and Chi-Shun begin a relationship, but as it turns out, Chi-Shun already has a girlfriend named Wing-Lam. Despite Chi-Shun not having feelings for Wing-Lam, he feels indebted to her because she had helped him so much in the past.
However, she sees how concerned her family is about her and apologizes and returns home. Later, she begins developing feelings for Wing-Ka, however the appearance of Ka Mei causes Yuet to become jealous.
Wing-Yuen is the one child that sided with Yun-Hung, due to him believing that he was the one who caused her miscarriage. After breaking up with Wing-Ka, Ka Mei begins dating Wing-Yuen, despite the protest of his siblings and mother. He later has a baby with Ka Mei, but, unsure if it is his, Ka Mei gets an abortion to avoid complications.
Wing-Ho constantly tells her to find a real job, and she finally gets a job as an office clerk. There she meets Kelvin, who begins to fall for her. Initially, Kelvin's mother is against the relationship, but she eventually accepts Wing-Hing and allows them to get married.
Wing-Chung was separated from his family at a young age, being sent with So-Sum to England. His grades were very poor and he did not like university. Siu-Hor, seeing how much her son dislikes school, allows him to drop out.
Yan-Hung becomes jealous and finally decides to take legal action against Siu-Hor and Tai-Cho, wanting to take 90% of the family assets, leaving them with a mere 10%. To prevent Gwan-Lai from gathering evidence for the court case, Yan-Hung kills her. Despite losing the lawsuit, the family is still very happy. Wanting to destroy their happiness, Yan-Hung tells Ka Mei to hold a meeting to reveal that Wing-Yuen killed someone. However, seeing the error of her ways, Ka Mei instead reveals the Yan-Hung killed Sheh Gwan-Lai.
Due to the turn of events, Yan Hung faces murder charges. She tries to convince So Sum to lie and give false testimony and So Sum pretends to agree. Yan Hung later gives Sum 70% of her shares of the Moonlight Bakery as a present for So Sum and Dr. Ling's "marriage". Sum subsequently returns the shares to Tai Cho and Siu Hor and tells Yan Hung she will tell the truth behind Gwan Lai's death. Yan Hung is convicted and sentenced, while Tai Cho tells her that he will give her 50% of the shares once she finishes her jail sentence. Wing Ho and So Sum finally get together, while Hou Yuet marries Wing Ka. In a scene taking place four years in the future, it is revealed that Wing Ka is alive in his late thirties. Yan Hung, now living abroad in New Zealand, refuses to take her half of Moonlight Bakery's shares and approves of So Sum and Wing Ho's relationship.
Production
Development
TVB's 2007 series, Heart of Greed, was successful enough to commission this series. In June 2007, Louise Lee presented on the Heart of Greed (溏心) chatroom that the producers had already begun to write another series with the same actors but a different story line. Details about the new series were leaked by the media in October 2007 and Lau Kar Ho, the director, writer and producer of the series, vowed to catch the person who leaked this information because few people knew about the new series. The sales presentation clip was released on 19 November 2007. The clip gave clues about the new series which featured Michelle Yim as the new villain and a mooncake business instead of the abalone business in Heart of Greed. New cast members included Kate Tsui, Lee Heung Kam, Vincent Wan and Wayne Lai.
On 28 January 2008, the cast celebrated their kick-off in filming, which included a costume fitting. Lee, Raymond Lam and Fala Chen had to attend baking lessons in order for them to film baking scenes realistically. Filming commenced on 14 February 2008, where Lee, Lai and Lam were the first to shoot at a bakery. The main cast and Lau Kar Ho celebrated the blessing ceremony of the series on 7 March 2008. The release of its official trailer was aired at the Shanghai Television Festival on 11 June. Principal filming ended on 1 July 2008, and its official English title was revealed. TVB officially began promotional and advertising work on the series on 5 July 2008, with an advertisement being aired followed up with its official website being released on 8 July 2008.
Music
The opening theme song for the series Mo Sam Hoi Ni (無心害你) was performed by Susanna Kwan, while the ending song Ai Bu Kau (愛不疚) was performed by Raymond Lam and was featured in his album Your Love. The ending theme was nominated as one of the top-10 song of the 31st RTHK Top 10 Gold Songs Awards. A featured song for the series entitled "Ice Cream (Talk to Me)" was written and produced by London-based production team DNR DNR who are better known as The Slips.
Casting dilemma
Wayne Lai was originally cast as the character who would eventually become the husband for Susanna Kwan's character. However, Lai explained on the celebrity talk show Be My Guest that due to health problems, the role was offered to Louis Yuen instead. Lai took over the part of the baker Nin Tze Yung, which Yuen was originally assigned to.
Cast
Chung Household
Gan Household
Others
Characters
The Elders
Gan Tai Cho - Tai Cho is a loving and witty man. In 1996, he was tricked by his employee Yan Hung into having an affair with her, which causes his and Siu Hor's happy marriage to abruptly end. Although for 10 years he did not really care about Hor, he is always worried about his children and tries his best to spend time with them. During the series, Cho admits his mistakes, asks all the children for their forgiveness, and tries to make it up to Hor. Soon, Cho and Hor go through a lot together and memories of their past together resurface. After many long years, Cho finally gets the confidence to stand up to Hung, and during the two-hour finale, he officially reunites with Hor.
Chung Siu Hor - Hor is an honest, kind, independent and loving woman. Although very uncompassionate to Hung, Hor is very loving to Cho, even after he had an affair, stole the bakery name, and forcefully took three of the children. In the beginning of the series, we see Hor and her children struggling to maintain the bakery, getting by with just enough to spare. Although Hor spends much time managing the bakery, she also puts a great deal of time into raising her children and caring for her father. She is very admired by her children, including the children who followed Cho. She is very happy when Cho finally admits his mistakes and happily agrees to remarry him when he gets a chance.
Yan Hung - Hung is a petty, greedy, cunning, and dishonest woman. She started out as a young worker from the countryside with no knowledge of urban technology (like the telephone). Eventually she found her way to the Moonlight Bakery and found work there as a dish washer. As time passed, Hung became better educated and became one of Moonlight Bakery's most talented and well-loved employees. It was Hung who started the affair with Cho and caused the Kam household to split up. Once Cho and Hor are divorced, Hong deliberately manipulated the family by fueling arguments between the two sides. She also steals the Moonlight Bakery trademark, and with Cho, expands the bakery throughout Hong Kong, making over one billion Hong Kong dollars. After Cho and Hor patch things up with each other and Jo gets back in touch with his children, Hong continually tries to keep him away from Hor's family. Hong even kills her mother in law when she tries to reveal all the bad things Hung has done. Eventually Hung is arrested and sent to jail for manslaughter. Yu So Sum, more commonly known as Yu So Tsau, is Hung's daughter from her first husband.
Salina Chung Siu Sa - Sa is Hor's younger sister. In the beginning and middle of the series she is a caring but mean and greedy woman who was abandoned by her husband in Portugal and had no choice but to return to Hong Kong. Sa resembles her sister in some ways, but not in others. Like Hor, she is smart, caring, and straightforward, but unlike her, she is mean, unwilling to just forget, talks too much, and will do anything for money. Towards the middle of the series everyone discovers that she is adopted and she gets kicked out of the house having become tired of her trouble-making and greediness. This experience changes her life, and she realizes how awful she had been to people. She begs for forgiveness and is let back into the family. Sa becomes very defensive of her sister and cares about her a lot. Sa marries Yuen Yan Chi during the series. Lo Ka Mei (Camie) is Sa's adopted daughter (revealed via webcam). Many people skip the webcam episode and conclude that she and Camie are blood-related.
Sheh Gwan Lai - She is Cho's mother. Gwan Lai is an old, loving grandmother who cares very deeply for her son and all her grandchildren, especially Ah Ho, who is her favourite grandchild. Even though she can get very grumpy sometimes, her grandchildren still love her because they understand that she's old and cannot get out her emotions any other way when she feels bad. Willing to use her life to save Cho's or her grandchildren's lives. Grandma refuses to eat, drink or take her medicine multiple times during the series when they persist in doing things she does not approve of. She starts out in the series hating Hor to the gut, but as Hung's evil schemes are slowly revealed, Grandma learns to admit her misunderstandings and her relationship with Hor improves. When Hung gives up on Cho and creates a secret scheme to steal profits from the company, grandma finds out and reveals it to Cho, Hor, and the children. Near the end of the series, when she prepares evidence against Hung for the court case, Hung pushes grandma down the stairs and she was subsequently killed.
Chung Fan Dat - Grandpa is Hor's father. An old grandfather who, like Grandma, cares very much about his daughter and grandchildren. He has always been there when Hor or her children need him the most. He resembles Grandma in the sense that they both will do anything for their children or grandchildren. It was Grandpa who came up with the name "Moonlight Bakery"("Ka Ho Yuet Yuen"). When the two families entangled in the shop brand name lawsuit, Grandpa gathers all his friends, the bakery employees, Hor's friends, and all the grandchildren who followed Hor to sue Cho and Hung. Cho and Hung win the case and keep the name 'Moonlight Bakery". Eventually he learns to accept back Cho when he admits his mistakes and turns himself around.
Sheh Lai Mui and Mak Yau Gung - Mui is Grandma's twin sister and resembles her caring, firm ways. Gung is Sheh's son and a total opposite to her. Both are blackmailed by Hung to work for her due to their constant insecure status in the family. Eventually both free themselves and Gung opens his own small business.
Yuen Yan Chi - Yan Chi is Siu Sa's second husband. He first met her at a dance in Fontainhas was office manager at Ga Mei's dancing school and also her private dance teacher. Although he is ten years younger than Sa, they still married because they were in love and Yan Chi cared about Ka Mei. Educated, funny and caring, he is at first well liked by the family. During the big court case, they almost get divorced because he says in court that Jo and Hor were likely having an affair, but when Sa goes to the hospital and throws the wedding ring at him when he comes to see her, he repents and is punished by having to find her ring. For the rest of the series they are on good terms and everything is well.
The Children
Gam Wing Ka - Ka is Cho and Hor's eldest son and the oldest of the children. When Cho and Hor split up the children, Hor begged Ka to look after the children who went with Cho and make sure they did not turn bad. Sadly, Hung's evil ways made this impossible. In the beginning of the series, Ka is very addicted to the stock market and gambling; it was Hung who bribed Hor's good friend Lin Chi Yung into getting Ka into it. However, with the help of Hor and his adoptive sister Suen Hou Yuet, Ka learns to resist and end his addiction. Throughout much of the series, Ka has an affair with his boss Eliza, whom he always bothers in a flirty way. Ka resembles Cho and Hor the sense that they all care a lot about the family. Later it is revealed that Ka has a heart problem and the chance of him living past age 35 is low. Soon after he falls in love with Hou Yuet, and soon she develops feelings for him, too. Years later, it is revealed that Ka, now in his late thirties, will survive, has married Yuet, and has had two children by her.
Gam Wing Ho - Ho is Cho and Hor's second son. After the divorce he fell under the custody of his mother, Hor, and along with his sisters Yuet and Hing, helps his mother at the bakery. Ho takes up the role of a father as well as an elder son in the Chung household and resembles Hor in almost every way. Since childhood, he had been entangled in a love relationship with Hung's daughter Yu So Sum. After the divorce, they continued to date each other, often by going on the ferry, until Hung forced Sum to study in England, when Ho and Sum were forced to break up. Ten years later, they got back together, although they were just in a brother-sister relationship. At the end of the series, Ho and Sum officially get back together, fall in love, and get married.
Suen Hou Yuet - Yuet is Cho and Hor's adopted daughter. Yuet is the daughter of one of Cho and Hor's close neighborhood family friends, but was abandoned by her single mother at the age of 2. Feeling sorry for her, and sensing he knew the reason her mother was forced to abandon her daughter, Grandpa took Yuet in. Cho and Hor, knowing the mother and daughter well, decided to adopt her. Yuet is a very bright, straightforward, and independent girl who left her family two times to live on her own throughout the series. During most of the beginning of the series, Yuet was constantly taunted (later teased) by Sa, who called her "Lor Mui" (Adopted Girl). Yuet is very close to Ka. It was mostly her efforts that helped Ka to stop gambling and investing because she bit him on the arm. At the end of the series she marries Ka and has two children with him.
Gam Wing Yuen - Yuen is an innocent, smart, forgiving figure. When Cho and Hor divorced, Yuen followed Cho. As a child he continuously sneaked back to Hor by himself, every time only to be sent back by Hor. He excels to become a successful person who has studied abroad and holds an advanced degree in business. He is blackmailed by Hung to help her because she lied that he caused her to miscarriage and she also made Yuen look like he bribed police officers to release him when he took drugs, was drunk and while driving in such a state, ran over a woman. Towards the middle of the series Yuen is made GM of Moonlight Resonance Bakery. Later in the series Hung recruits Ka Mei as Yuen's personal assistant, and eventually they fall in love and get married. Towards the end of the series Cho releases Yuen from Hung's control by revealing what Yuen did, and explaining how Hung committed crimes by blackmailing him. During the court trial in which Hung tries to take over Moonlight Resonance Bakery, Yuen and Ka Mei get into arguments and separate for a while. The series ends with Yuen and Ka Mei getting back together when she reveals the truth behind their Grandma's death.
Gam Wing Hing - Hing is Cho and Hor's daughter. She is famous in the series for her role as the "Mute Girl". Physically unable to speak, she talks to her family and co-workers using sign language. Very loving and devoted to her family, she gave up her chance to go to college so that she could stay and work with Hor at the bakery. However, as she really did not like working at the bakery, she managed to get a job as a secretary, which Ho helped translate for her during the job interview. With her charming personality and hard working character, Hing soon earned the friendship and respect of everyone around her, especially Cheng Ga Lok, who became her boyfriend and eventually her husband. She and Ga Lok have a child at the end of the show.
Gam Wing Chung - Hor and Cho's youngest son. When he was only 9, he was taken to Manchester to boarding school just to keep Hung's daughter, Yu So Sum, company. He was spoiled by Hung and was given a house near Chinatown, two BMWs and a Mercedes Benz. He soon ran away from school and left Manchester to go back to Hor because his grades were bad, even admitting himself that he lacks sufficient ability to learn, but was still forced to study by Hung. Hor encouraged Chung to work hard on his talents, rowing and computer programming. He soon got used to his siblings which he missed since childhood. Chung is known as the "Illiterate Boy". Since he was sent to England when he was only 9, he had no chance to learn Chinese. In England, Hung just dumped him in Chinatown with the other British Chinese boys, so he did not learn sufficient English, either. After returning to Hong Kong, his siblings encouraged him and he quickly picked up both languages perfectly. At the end of the series, he became the bakery's administration department computer programmer/IT specialist.
Yu So Sum (Yu So Tsau) - Tsau is Hung's daughter from her first husband. Tsau is a very peaceful, elegant, filial, and smart girl who has emerged from being the daughter of country chicken farmers to a doctor who has studied in England and lives and works in Hong Kong. As Hung was very close to Cho and Hor when they were still married, Cho and Hor took Tsau (with Hung's permission) as their goddaughter and because of this Tsau virtually grew up with the kids; her nickname "Tsau" comes from Grandpa's wish for seven grandchildren, each with names from part of the phrase "家好月圓慶中秋 Ga Ho Yuet Yuen, Hing Chung Tsau". At a young age she fell in love with Ho and for years dated him on the ferry. After the divorce, Tsau continued dating until Hung sent her to England to study when Tsau and Ho were forced to break up. After she returned, she reunited with Ho but they did not start dating again, instead they just had a sworn brother-sister relationship. As she is the daughter of Yan Hung, she always get stuck between 2 families. She helped Hor's family a few times when her mother frames them for something they did not do. Finally feeling her and her mother owes Jo and Hor too much, at the last episode, she transfers her 70% of shares her mother had given her. In the series, she continually goes back and forth between Ho and Ling, always turning to Ho whenever she is feeling down. At the end of the series Tsau finally gets out of the love web and gets back together with Ho.
Camie Lo Ka Mei - Camie is Sa's adopted daughter (revealed via webcam) from Portugal. Her character is almost an exact copy of her mother's. She appears in the middle of the series as a beautiful, womanly 23-year-old girl who has just graduated from college and secretly has a child back in Portugal called Ronald. It turns out that she is a greedy, sneaky and selfish figure. She got this from her mother who was also greedy selfish and sneaky but her mother had learned from her mistakes after she found out that she was not blood related to her father and sister. Camie has a long love affair with Ka and once she's done with him, she has another one with Yuen. The affair ends with Camie being pregnant and forced to marry Yuen even though the baby was not his. She later has an abortion because the real father of the baby kept blackmailing her to give him money. Camie is constantly manipulated by Hung to work for her, but with her mother's constant scolding as well as subsequently saving her from a speeding van and the constant evils she sees Hung committing. During a press conference held by Hung, she betrayed Hong by revealing that Hung killed Grandma by pushing her down the stairs. In the end, she lives happily with the rest of the family and Yuen.
Others
Ling Chi Shun - Chi-Shun is a doctor who works with Chau at the hospital. A very cheerful, jovial man, he constantly cares for the babies he delivers and tells jokes. He strives to succeed for two people: his father, who worked very hard selling ice cream to pay for Ling Chi Sun's studies in England, and his girlfriend Wing Lam, who got him back on track and worked off his debts when he got addicted to Gambling and wasted a lot of his college money. He first meets Chau when they both see a pregnant woman at the mall and help her get to the hospital and successfully deliver her son, Lap. As he and Chau got closer to each other, they fell in love and soon Chi-Shun, Chau, and Wing Lam were stuck in a love triangle, and soon Chau dragged Ho into it too. Chi Shun went back and forth between the two women before deciding to leave for England with Wing Lam. However, when Wing Lam died, he lost confidence in everything and lied to Chau, saying he had gotten married with Wing Lam and was just working at the hospital temporarily. However, Chau found out the truth that Chi Shun wanted to spend Wing Lam's final days with her and soon they started over again. At the end of the series, Chi Shun officially hands over Chau back to Ho and they remain close friends.
Lin Chi Yung - Lin is a long-time worker at Hor's shop. Very loyal and skilled, he became Hor's apprentice when he was 13, but betrayed her when Hung bribed him to work for her with a salary so high yet so realistic so he could pay for his sister's college fees in Australia and still have enough to live off of. However, Hung finally stops using him and fires him, revealing to him her true side. Lin goes back to Hor and apologizes to her and is forgiven. Yung reveals to Grandma that her son Chuen (Jo's brother) did not die because Hor refused to help him pay off his gambling debts, but because his girlfriend had dumped him and left him with thousands of dollars of debt and he did not want to bother Hor, the only person he was grateful to, to give him more money. Eventually, Sa helps Lin Chi-Yung get a job in Australia as a branch manager for her friend's moon cake company. He is thrilled but tries to keep himself on Sa's good side (while she tries to con money from Gwan Lai), so she will not spoil his only chance to reunite with his sister, who is studying in Australia. However, when Sa revealed to Gwan Lai that Chung is staying with Hor after he ran away, and pushed the responsibility to Cho, Yung is pushed to his limits and revealed the truth, causing Sa to spoil this chance. Nonetheless, after the episode where Gwan Lai is convinced not to force Chung to stay with her, Hor forces Sa to go back on her words and return the chance to Yung. In Australia, he succeeds and becomes known as the "King of Moon Cakes". At the end of the series Yung comes back to Hong Kong for a visit. Yung's sister, Lin Tsui Ping, is a childhood playmate of Jo and Hor's children and is an apple to Hor's eye.
Eliza - Eliza was Ka and Yuet's demanding and vicious boss-from-hell when they were working in her PR firm in the beginning of the series. She tolerated Ka's laziness and incompetence in his work because of her close relationship with Yan Hong. However, in the end she fired Ka because he kissed her in her office, giving her the impression that Ka was sexually assaulting her. She however kept Yuet at her firm. Yuet was later fired because Eliza thought that Ka and her teamed up to make her look like a fool with a ringtone that Ka made using Eliza's shrill and demanding voice. Eliza also almost ruins Ka's first promotional function by stealing away his customers and misleading his clients with fallacy.
Yau Wing Lam - Wing Lam is Chi-Shun's girlfriend. Very loyal and worrisome about him, she stayed in England with him when he was in medical school to help him graduate when he got addicted to gambling. She even worked part-time to pay his gambling debts and the money he wasted. Once Chi-Shun graduated, Wing Lam went with him back to Hong Kong, where she worked as a saleswoman. Towards the end of the series, Wing Lam go back to England together in hopes of getting married, but Wing Lam dies of cancer before they can plan things out.
Yu Hak Keung - Yu is Hung's ex-husband and Chau's father. He dumped Hong and Chau when Chau was only 6 years old, but returned towards the middle-end of the series to help out Hong in all her difficulties because he felt he owed her. Ever-worrisome about Chau, it is his greatest wish to see her one last time. When he heard of her relationship with Ho, at first he thought he was just playing around with her, but eventually discovered Ho was a good boy. When Yu died towards the end of the series from cancer, Chau come to see him one last time, and Yu tells her he feels content leaving her with Ho.
Fong Shu Ting - Shu-ting is Ho's ex-girlfriend. She works as a stewardess in one of Hong Kong airline company, and she met Ho when he was flying to Thailand. Originally a happy couple, they broke up after multiple misunderstandings due to Ho's love and commitment to the family. Despite the misunderstandings, Ho and Shu-ting remain close friends and trust each other. When they have big secrets or troubling problems they would help each other. Shu-ting's elder sister is famous TV star Fong Shu-wing.
Kelvin Cheng Ka Lok - Kelvin is Hing's boyfriend, later husband. A kind, caring man, he is the perfect partner for Hing. Kelvin fell in love with Hing only days after she started her job, and immediately started taking the bus with her to work instead of driving, staying late at night at work just to keep Hing company, and learned sign language so that he could talk with her.
Viewership and accolades
The initial critical response for the series was excellent with the first episode receiving an average of 33 rating points with a peak of 42 and received peak points over 35 in later weeks. Like its predecessor, the 2-hour series finale premiered at a Hong Kong shopping centre, Discovery Park, in front of hundreds of guests and supporters. The finale was shown in the form of a variety show, 家好月圓慶團圓 and the viewership for that had reached 44 rating points. Viewership was higher than expected, with the final episode receiving an average of 47 rating points and a peak of 50 in the scene where Linda Chung and Michelle Yim's characters argued. As a result, Moonlight Resonance outperformed Heart of Greed, and is one of the highest-rated TVB series in viewership in the 2000s. Its rating tied with Dae Jang Geum, a Korean drama series that also garnered 50 points while it aired on TVB. The series received positive reviews from Hong Kong audiences but there were some who found the overall plot to be too similar to its predecessor. Moonlight Resonance was nominated for 18 TVB Anniversary Awards in 2008 and won a total of 6 awards.
Ratings for Moonlight Resonance
List of awards and nominations
TVB Anniversary Awards — Best Drama
Moonlight Resonance (溏心風暴之家好月圓) - Winner
TVB Anniversary Awards — Best Actor in a Leading Role
Ha Yu - Winner
Moses Chan - Top 5
Raymond Lam - Top 5
TVB Anniversary Awards — Best Actress in a Leading Role
Michelle Yim - Winner
Louise Lee - Top 5
Susanna Kwan - Top 10
TVB Anniversary Awards — Best Actor in a Supporting Role
Chow Chung Top 5
TVB Anniversary Awards — Best Actress in a Supporting Role
Tavia Yeung - Winner
Fala Chen - Top 5
Kate Tsui - Top 5
Lee Heung Kam - Top 5
TVB Anniversary Awards — My Most Favourite Male Character Role
Raymond Lam - Winner
Ha Yu - Top 5
TVB Anniversary Awards — My Most Favourite Female Character Role
Louise Lee - Winner
Susanna Kwan - Top 5
Fala Chen - Top 5
TVB Anniversary Awards — Most Vastly Improved Actress
Tavia Yeung - Top 5
Yahoo! Popular Searches Awards — Most Searched Television Series
Moonlight Resonance - Winner
Yahoo! Popular Searches Awards — Most Popular Searched Song
Raymond Lam - Winner
Yahoo! Popular Searches Awards — Most Searched Television Male Artist
Raymond Lam - Winner
The Next Magazine TV Awards 2009- Next Magazine Top Ten TV Programmes
Moonlight Resonance (溏心風暴之家好月圓)
The Next Magazine TV Awards 2009- Next Magazine Top Ten TV Artists
Raymond Lam (as Gan Wing Ho/甘永好)
The Next Magazine TV Awards 2009- Next Magazine Top Ten TV Artists
Tavia Yeung (as Suen Hou Yuet/孫皓月)
The Next Magazine TV Awards 2009- Next Magazine Top Ten TV Artists
Moses Chan (as Gan Wing Ga/甘永家)
The Next Magazine TV Awards 2009- Next Magazine Top Ten TV Artists
Michelle Yim (as Yan Hong/殷紅)
The Next Magazine TV Awards 2009- Next Magazine Top Ten TV Artists
Linda Chung (as Yu So Sum/於素心)
The Next Magazine TV Awards 2009- Next Magazine Top Ten TV Artists
Ha Yu (as Gan Tai Cho/甘泰祖)
The Next Magazine TV Awards 2009- Next Magazine Top Ten TV Artists
Louise Lee (as Chung Siu Ho/鍾笑荷)
Asian Television Awards 2009- Best Drama Performance by an Actress
Michelle Yim (as Yan Hong/殷紅)
Guangzhou Television Awards 2009- Best Actress in a Leading Role for a Television Drama
Michelle Yim (as Yan Hong/殷紅)
Sequel
A sequel titled Heart and Greed was released in 2017 featuring some of the original cast members. The series was met with mostly negative reviews with audiences saying how times have changed and the type of plot being used is too similar to the first two series which has become old-fashioned after almost a decade.
International release
See also
Heart of Greed
DVD release
External links
K for TVB Screencaptures and Summary
References
TVB dramas
2008 Hong Kong television series debuts
2008 Hong Kong television series endings
|
"Return the Favor" is a song by American recording artist and songwriter Keri Hilson. The song features Timbaland, who wrote the song with Hilson and her songwriting/production team The Clutch, as well as Walter Milsap. Following the moderate international chart success of Hilson's lead single, "Energy", "Return the Favor" was released from Hilson's debut album, In a Perfect World..., serving as the international second single while the urban single, "Turnin Me On" was released in the US.
As Hilson's second vocal collaboration with mentor Timbaland, Hilson stated the purpose of the song's initial conception was to re-create the success of their worldwide hit, "The Way I Are", as Timbaland called the "Return the Favor" bigger and better.
The song reached the top twenty in the United Kingdom, Ireland, and Germany, while appearing in the top thirty of Austria and Sweden, charting in Australia and the tip charts in Belgium. The accompanying music video implements a futuristic concept and features Hilson sporting several extravagant outfits.
Background
When Hilson talked to Digital Spy about the song, she said that Timbaland called her and said, "I've got a song that I think's better than 'The Way I Are'. I think it's bigger." They took the track and wrote "Return the Favor" over the beat. According to Hilson, she said that song was partially inspired by "that conversational, back-and-forth thing" they did on "The Way I Are", stating, "We got a great response from that that we wanted to do it again." The initial draft of the hook featured the line "If you kiss me then I’ll kiss you back", but according to Hilson in an interview with That Grape Juice, it was changed by unknown reason by Timbaland. After it was reported that In a Perfect World... would be pushed back to October 2008, "Return the Favor" surfaced online, and it was rumored to be the follow-up to "Energy." The sample was later removed by Hilson's management, before it was announced as the album's second single. The song was featured on December 15, 2008 episode of The Hills.
Composition and critical reception
"Return the Favor" is described as an electro-dance-pop record, with a future-like sound, including euro-style synths. Dan Nishimoto of Prefix Magazine noted that the song includes Timbaland's "signature dizzying 22nd-century flair that he's been employing ever since 2006." Andy Kellman of Allmusic noted the song as a standout track from In a Perfect World.... According to J.K. Glei of Cincinnati Metromix said the song has "cascading synths," and a "classic pop structure." However Glei said that Hilson's vocals "feel flat against the driving beat" and that Timbaland "fully phones it in." While noting the song "follows the same blueprint" of Nelly Furtado's "Promiscuous", Sal Cinquemani of Slant Magazine said it was a "satisfying pop romp" and said even though Hilson lacked Furtado's distinctiveness, that it "shouldn't have a problem striking a chord at radio."
Nick Levine of Digital Spy said, the song was "a perfectly decent slice of midtempo Timba-pop, but it's not really in the same league as the brilliant 'The Way I Are'." MTV Buzzworthy said "slightly less out-there are the beats -- which sound an awful lot like Hilson and Timbaland's first collaboration, "The Way I Are"—and the cameo from Timba himself." Sophie Bruce of BBC Music thought that the song lacked the a catchy hook such as in "The Way I Are." Less than impressed with Timbaland's rapping and "less than sexy" vocal appeal, Jon Caramanica of The New York Times said the "unfortunate pairing" was reprised, and the song "encapsulates the record’s shortcomings."
Chart performance
"Return the Favor" was the most successful in the United Kingdom and Ireland, peaking at nineteen in both countries. In Austria, the song debuted and peaked at twenty-five on the Austrian Singles Chart, before falling off after six weeks. On the Swedish Singles Chart, It debuted and peaked at thirty, before falling off after six weeks on the chart. In Belgium, "Return the Favore" appeared on Belgian Tip Charts, peaking at six in Flanders, and seventeen Wallonia. While debuting and peaking at twenty-one on the German Singles Chart, it completed nine weeks on the chart before falling off. It made the lower regions of the ARIA Singles Chart appearing at eighty.
Music video
The music video was directed by Melina, who directed Hilson's video for "Energy." A preview of the video was released on October 14, 2008, and the full video premiered on October 23, 2008. Featuring a futuristic concept, the video begins with a small clip from Timbaland and Hilson's "The Way I Are", before it cuts to Hilson dancing in a future-like room while scenes are shown on a wall behind Timbaland, who is seated in a chair. Hilson is then show in a pink ruffled bra and dress dancing in front of mirrors, and then rises out of a pool in a blue swimsuit while scenes continue to be broadcast behind a seated Timbaland. Intercut with scenes with previous attire, Hilson performs ensemble choreography with dancers while wearing a black bra and pants, whilst the video ends with several different scenes.
MTV Buzzworthy commended the video, stating, "while her ensemble's slightly more unwearable (we're looking at YOU, futuristic metallic onesie!) Hilson still manages to look beyond gorge. But then again, this chick could look cutting-edge in a giant pickle barrel." The review also compared Timbaland's look a cross between Run D.M.C. and The Matrix.
Track listing
European Promo CD
"Return the Favor" (Radio Version) – 3:40
"Return the Favor" (Main Version) – 5:30
"Return the Favor" (Instrumental) – 5:29
UK Digital Download - Single
"Return the Favor" – 5:29
German Maxi CD
"Return the Favor" (Radio Edit) – 3:38
"Return the Favor" (Sketch Iz Dead Remix) – 4:40
"Return the Favor" (Instrumental) – 5:48
"Return the Favor" (Video) – 3:53
Personnel
Songwriters - Timothy Mosley, Keri Hilson, Ezekiel Lewis, Bulewa Muhammed, Patrick Smith, Candice Nelson, Walter Millsap III
Production - Timbaland
Editors - Walter Millsap III, Dave (d-lo), Marcella Araica
Recording - Scott Naughton
Mixing - Demacio Castellon
Vocal arrangement - The Clutch
Additional production, vocal production - Walter Millsap III
Source
Charts
Release history
References
2008 singles
Keri Hilson songs
Music videos directed by Melina Matsoukas
Song recordings produced by Timbaland
Songs written by Keri Hilson
Timbaland songs
Synth-pop songs
Songs written by Timbaland
Songs written by Candice Nelson (songwriter)
Songs written by Balewa Muhammad
Songs written by Ezekiel Lewis
2008 songs
Songs written by Patrick "J. Que" Smith
|
Rolo Tomassi are a British mathcore band formed in Sheffield in 2005. Their name is a reference to dialogue from the film L.A. Confidential. The band are known for their chaotic style and performances, and strong DIY ethic. They are currently signed to MNRK Heavy.
The band released two albums on Hassle Records: Hysterics (2008) and the Diplo-produced Cosmology (2010). After creating their own record label in 2011 called Destination Moon, they released Eternal Youth, a compilation album of B-sides, remixes and rarities from throughout their career, and their third album Astraea, in 2012 with the first line-up change in their career. They then released two albums on Holy Roar Records: Grievances (2015) and Time Will Die and Love Will Bury It (2018), before moving to their current label to release their sixth album, Where Myth Becomes Memory (2022).
History
Early years and the Mayday! label (2005–2008)
Shortly before the band formed, Eva Korman (née Spence) was in a small garage band for a few months as a keyboardist. The band was looking for an aggressive vocalist to help make it a six piece band, so Eva stepped up to give screaming a go. To practice she and her brother, James Spence, would scream in their parents' car, with very loud music on; the music was to help overcome their shyness. The two have collaborated in bands since they were both 13 years old.
Rolo Tomassi formed in February 2005 in the town of Stocksbridge, taking their name from a concept in the 1997 neo-noir film L.A. Confidential. When Rolo Tomassi formed they sought to keep the band as DIY as possible; achieving this by hand-making their first releases and organizing many DIY shows. Eva Spence went from being the keyboardist to the vocalist after they struggled to find a singer. Not long after forming, the band had written some songs and immediately began to perform at local venues/pubs to small crowds. At this time they released some of their first material on to a 3 Track Demo CD which they could sell at the shows in which they were performing. The demo CD-R was released under James Spence's (keyboardist/vocalist) independent label which he named "Mayday!". There are eight releases under this label. After a split EP with Mirror! Mirror! (limited to 333 copies and released through Speedowax) the band signed to Holy Roar Records and released a self-titled EP featuring re-recorded songs from previous demos and EPs along with new songs.
One of their first concerts was supporting Bring Me the Horizon in February 2005 at the Classic Rock Bar in Sheffield.
Hysterics and Cosmology (2008–2011)
In June 2008, Rolo Tomassi were given a spot at Download Festival. In September they released their debut album Hysterics. Supporting this release the band opened for Pulled Apart By Horses in Britain and for Jane's Addiction in the United States.
In 2009 Rolo Tomassi started their "Subs Club" series. This was a series of 7" vinyls singles released every three months with a cover track and remixes and a 7" single, Rolo Tomassi / Throats Split, jointly release with the band Throats. In February and March of that year Rolo Tomassi supported Fucked Up and The Bronx in the Shred Yr Face 2 tour. Later in this year, they performed at South by Southwest festival. This led to be an important performance in their career as they were watched by American producer Thomas Pentz, better known by his stage name Diplo, who mentioned them in a Pitchfork Media interview, when asked to name "One Obscure Band You Think Should Be More Popular". The band contacted him thinking he might do a remix for them but he responded by offering to produce their second album. The band wished to wrap their album's completion around Diplo's schedule so they wrote the album in three months.
Towards the end of October 2009, the band flew to Los Angeles to record their second album, in a studio which James considered "unassuming, a well hidden and fantastic place". Artwork for their second album was, like that for Hysterics, designed by Simon Moody. Recording finished on 31 October and the album, titled Cosmology was released in May 2010 was released. With a hope that Cosmology was a clear and definite progression from Hysterics James Spence felt had they corrected the short-comings of their first album. Because it was not co-written by Diplo, like with his typical projects, he helped add flourishes to the album. Diplo's influence on Eve Spence's developed vocal range has been noted. Because their producer had typically worked with female solo artists such as Bonde do Rolê, M.I.A. and Santigold, he helped cross techniques from them over to Eva. Particularly with demoing songs, where the band would write a demo and give it to Eva to sing and interpret in her own room for hours.
The band played on the Ronnie James Dio Stage at Download Festival and played on the NME/Radio 1 tent at Reading and Leeds in August 2010. James Spence commented on the Download show saying it was the biggest show of their career to date. In the band's blog in June 2010 it was written that there might eventually be a Discography styled release in the future which would l allows people to hear all of the band's material released before the Rolo Tomassi EP. On 7 August 2010 they played at the Hevy Music Festival near Folkestone, England. Throughout October and November 2010 Rolo Tomassi supported The Dillinger Escape Plan on their UK tour. On 19 December 2010, the band planned to conclude the year with a free show at the Bloomsbury Ballroom in London, which was to be filmed as part of a documentary and live recording release from the band. However, the show was cancelled due to the ill health of Eva Spence, and so a new UK Tour was announced for May.
With the setting up of their own record label Destination Moon records Rolo Tomassi released Eternal Youth; an anthology of rare and non-album material including acoustic versions, remixes of their own work by various artists and a cover of Throats. This release was accompanied by a short list of tour dates across the UK in May 2011, which were confirmed to be the only tour date Rolo Tomassi would do in 2011. On 8 July 2011, Rolo Tomassi headlined the Red Bull Bedroom Jam Stage at Sonisphere. Rolo Tomassi expressed interest in working with Anthony Gonzalez or Kurt Ballou respectively of M83 and Converge as producers for the third album. In July James Spence said that the third album had not progressed far enough for them to search for producers. He also stated that they, as of July, they had at least two songs created, with a lyrical concept that surfaces as focuses on self-reflection.
Astraea (2012–2013)
In an interview with Kerrang!, Eva Korman confirmed that the band were self-producing their third full-length with Hysterics producer Jason Sanderson. Regarding the sound of the album, she said that it would be "more direct and heavier", but also noted that the band would "never shy away from being experimental". A May release date was initially projected. In early February 2012 Rolo Tomassi announced the release of a new single: "Old Mystics". The single was uploaded to the band's Facebook profile to stream for free. Release of the single was scheduled for 26 March. The band announced a few days after releasing "Old Mystics" for streaming that it would probably not appear on the new album, but just be a stand-alone single. Alongside the announcement of "Old Mystics" the band also announced that they had two brand new members following the departure of Joseph Thorpe and Joe Nicholson. Their replacements were Chris Cayford, current vocalist and former guitarist of No Coast, and Nathan Fairweather who plays in Brontide. Eva Spence said in an interview that Joe Nicholson wanted to pursue taking a chemistry degree at university, while Joe Thorpe's departure was more to do with personal differences.
Rolo Tomassi completed their first tour of the year as the main support for Architects on a 14 date tour. They also stated that they were entering the studio to record their third album in June, with an October release date expected. To support the album's October release Rolo Tomassi projected an 11 date headline tour of the United Kingdom in late October with Oathbreaker and Goodtime Boys. On 16 August 2012, the band announced that their new album would be titled Astraea, with the release date set to be 5 November.
In May 2013 the band did a short British tour with Bastions, the band was noted for only costing five pound a ticket for all venues. On 31 August Rolo Tomassi headlined the first year of Bridgwater based music festival Morbid Mash Up which featured over 20 other bands. In September Rolo Tomassi performed on three out of the four dates of the Japanese touring festival Reverberation Festival. In September and October, starting just three days after their Japanese performances Rolo Tomassi completed a 13 date tour of Australia with Australian bands Totally Unicorn, Safe Hands and Stockades. It marked the first time the band had been in the country since 2010.
Grievances and Time Will Die And Love Will Bury It (2014– 2019)
Throughout most of 2014 the band was dormant in writing new songs for a fourth album to succeed Astraea. In mid September the band announced a three date tour in the UK with Brontide, their album being released next year and that they are releasing a split EP with Stockades.
The group's fourth full-length album, Grievances, was released on 1 June 2015 through Holy Roar, with an American release through Ipecac. In June 2015 the band's cover for Deftones's Digital Bath was released on Kerrang!'s Ultimate Rock Heroes compilation disc.
In 2017 they had a minimal tour schedule which features appearances at the Two Thousand Trees and Tech Fest festivals in the UK also teased the unveiling of new material with a promotional website lovewillburyit.com. On 5 November the band released the first single from their new album "Rituals" on BBC Radio 1, with a music video accompanying it the next day. On 4 November Rolo Tomassi performed one headline show in London at the Borderline with support from label mates Conjurer. Here they performed two new songs, "Rituals" and "The Hollow Hour". In December Rolo Tomassi performed their first concerts in the United States, supporting The Number Twelve Looks Like You on their Nuclear. Sad. Nuclear. 12 year anniversary tour.
Rolo Tomassi's fifth album Time Will Die And Love Will Bury It was released on 2 March 2018 on Holy Roar Records. It was recorded, like Grievances, at The Ranch in Southampton with Lewis Johns as producer. It was accompanied by a tour through the UK and Europe through March and April. The album was well received by critics, with review aggregator Metacritic giving the album a score of 92/100, making it the second highest rated album of 2018.
The band has performed at a series of European festivals across the summer period, a six date UK tour in November with Blood Command and Cassus, and will be touring the US in November and December again supporting The Number Twelve Looks Like You.
Eva Spence featured on The Number Twelve Looks Like You song "Of Fear" from their 2019 comeback album, Wild Gods, though in the physical album inlay she is listed under the name Eva Korman.
Where Myth Becomes Memory (2020–present)
On 8 September 2020, the band confirmed that they had ended their relationship with Holy Roar Records in light of allegations of sexual misconduct against the label's owner, Alex Fitzpatrick.
In recording of their new album Where Myth Becomes Memory, the band except for Korman recorded at The Ranch in Southampton; whilst Korman, now living in Bergen County, New Jersey, recorded her vocal tracks at Brady Street Recordings nearby.
On 17 August 2021, Rolo Tomassi released a new single "Cloaked", along with the announcement that the band had signed to MNRK Heavy. This was followed by the release of "Drip" in November 2021, wherein the band also announced their next album would be titled Where Myth Becomes Memory. A third single, "Closer", was released in January 2022. The album is set for release on 4 February 2022.
Characteristics
Musical style
Their music has been difficult to classify simply because of the band's resistance to being identified with one single genre. Described as "like a polished chrome King Crimson for the 21st Century" they have typically been acknowledged as being mathcore, a tag which summarises the theoretical complexity of their music, such as odd time signatures like 9/8 and 13/8 and polyrhythmic drumming. They have been identified as "falling somewhere between grindcore, progressive and alternative rock" and have been categorised as experimental rock, Nintendocore, post-metal, post-hardcore, progressive hardcore, progressive rock and screamo. The band has been critical of the label Nintendocore being attributed to their work.
The band utilises two vocalists in their music, a quality which "immediately creates a rich and textured sonic world". Eva Spence's vocal style was acknowledged by Michael Wilson of the BBC as bi-polar; swapping between "fragile lullabies to blood-curdling scowls". Her singing voice is in a soprano vocal range and has been compared to the stylings of Alison Goldfrapp of Goldfrapp and Elizabeth Fraser of the Cocteau Twins.
Their earlier work – such as Hysterics, Cosmology and their demos and extended plays – was known for its use of jazz breakdowns and swapping chaotically between explosive mathcore, calm atmospheric experimental music and acid-jazz. Their music is also noted for sharing traits with Nintendocore for the use of 8-bit synthesizers and in terms of chaos and sound. The compilation album Eternal Youth by the band gave insight into their musical development since their inception in 2005 with their demos onto their latest b-side releases with Hassle records.
Their style developed further into their pop, ambient, shoegaze and space rock elements for their third album Astraea and has been jokingly dubbed as cosmic-core. For one of the b-sides from the album – "Mezmerizer" – NME journalist Hamish MacBain classed it as a "space rock ballad". For the album, the band decided to base its name on the goddess of the same name, a reference to the Spence siblings admiration for Greek mythology and a desire to pick a title which made the album "sound big and like this proper body of work". The non-album single "Old Mystics" and the song from the album "The Scales of Balance" both make reference to the "Golden Age" declared by Astraea.
Their next three albums have been seen by the band as belonging to a trilogy.
In contrast to the lighter tone developed on Astraea, their fourth album Grievances frentic and dark in it composition- utilising pianos and violins for a darker character. Guitarist Chris Crayford described this album "really moody and full of pain". Their fifth album Time Will Die and Love Will Bury It was described by James Spence as "continues in the vein of Grievances' darkness" and Crayford saw it as "more ethereal" than its predecessor. Where Myth Becomes Memory is described by Crayford as "direct, focused, and considered".
Influences
Rolo Tomassi's influences are said to range through screamo, classical, jazz and progressive rock. Blood Brothers, Brian Eno, Cardiacs, jazz saxophonist John Coltrane, Converge, Goldfrapp, the Dillinger Escape Plan, King Crimson, the Locust and the Mars Volta are all considered influences on Rolo Tomassi's work. Rolo Tomassi have noted how the Dillinger Escape Plan are a huge influence on the band, with Edward Dutton in an interview saying that "they're one of the few stock bands that you can draw from one of the five of us". The fractured structure of their songs are considered to be heavily influenced by The Mars Volta. Ryan Bird of Rock Sound cited At the Drive-In's album Relationship of Command as an influence on Rolo Tomassi's work, saying "opening the mainstream's mind toward fiercely confrontational, independent rock, it was unthought-of that a band like Rolo Tomassi could be successful ." James Spence wrote a guest blog on Clash Music writing about his interest in At The Drive-in, which began with seeing the video for "One Armed Scissor": "I remember being captivated by the way they played and how much the guitarist, Omar, was freaking out. Almost like he was attacking his instrument. It resonated with me somewhat and I was intrigued by it." He commented further on the album's influence, noting "the odd sounds, the samples, the weird, almost undecipherable lyrics." According to Spence, touring with Gojira and Loathe influenced the heavy parts of their music.
Live performances
The band's members have been called "insane hardcore acrobats" for their energetic live performances. When James Spence commented on Rolo Tomassi's live performances, he stated that he felt people who didn't listen to them typically enjoyed their live performances and that "We just want people to enjoy us however they want to." Noisey writer Hannah Ewens notes how lead singer Eva Korman embodies "a soft image in a hard environment" and notes that her movements onstage "while thrashing and aggressive, are balletic and graceful in their anger".
When playing songs from their debut album Hysterics coming closer to their second album's release, they played songs from it faster than originally recorded as their musicianship had improved greatly. Because of the membership change and the wish to play older music at live performances, James Spence used guitar tablature and his own knowledge of the songs written to teach newer members Chris Cayford and Nathan Fairweather. In 2018 drummer Tom Pitts noted how the live shows were more unconventional and "punky" in the tempo of the gigs when he first joined in 2014, however the band in recent years is focused more precision and started playing with a clicker as he drums.
Band members
Current members
Eva Korman – lead vocals (2005–present)
James Spence – backing and lead vocals, keyboards, piano, synthesizers (2005–present)
Chris Cayford – guitar (2012–present)
Nathan Fairweather – bass guitar (2012–present)
Al Pott – drums (2018–present)
Former members
Joseph Thorpe – bass guitar (2005–2011)
Joe Nicholson – guitar (2005–2011)
Edward Dutton – drums (2005–2013)
Tom Pitts – drums, backing vocals (2014–2018)
Timeline
Discography
Studio albums
Hysterics (2008)
Cosmology (2010)
Astraea (2012)
Grievances (2015)
Time Will Die and Love Will Bury It (2018)
Where Myth Becomes Memory (2022)
References
External links
Official MySpace
English punk rock groups
English progressive rock groups
English post-rock groups
British hardcore punk groups
British post-hardcore musical groups
English experimental rock groups
Mathcore musical groups
Nintendocore musical groups
Post-metal musical groups
Screamo musical groups
Female-fronted musical groups
Underground punk scene in the United Kingdom
Musical groups from Sheffield
People from Stocksbridge
2005 establishments in England
Musical groups established in 2005
Hassle Records artists
Artists
|
Kelley Bowman (born March 26, 1983, in Richmond, Kentucky) is an NCAA All American high jumper for the University of Louisville. The Rockcastle County native finished third at the 2006 NCAA Outdoor Championships with a jump of 1.86 meters or 6 feet 1¼ inches, which broke the University of Louisville school record. She is only the second University of Louisville female Track and Field athlete to ever be named an All American.
Bowman is widely considered the best female high jumper to ever come out of the state of Kentucky. While attending Berea Community High School, she set the all-time Kentucky High School girls high jump record of 5 feet, 10 inches as a junior and won all four state high jump championships she participated in. Her 5' 10" jump was the 4th best in the entire nation in 2000.
References
External links
Official UofL bio
Richmond Register article on Bowman
1983 births
Living people
Louisville Cardinals women's track and field athletes
American female high jumpers
People from Richmond, Kentucky
|
The flag of Wales ( or , meaning 'the red dragon') consists of a red dragon passant on a green and white field. As with many heraldic charges, the exact representation of the dragon is not standardised in law and many renderings exist. It is not represented in the Union Flag.
The red dragon of Wales personifies the fearlessness of the Welsh nation. Vortigern () King of the Celtic Britons from Powys is interrupted whilst attempting to build a fort at Dinas Emrys. He is told by Merlin/Ambrosius () to dig up two dragons beneath the castle. He discovers a red dragon representing the Celtic Britons (now Welsh) and a white dragon representing Anglo-Saxons (now English). Merlin/Ambrosius prophesies that the Celtic Britons will reclaim the island and push the Anglo-Saxons back to the sea.
As an emblem, the red dragon of Wales has been used since the reign of Cadwaladr, King of Gwynedd from around AD 655. The Red Welsh dragon is often described as the "Red Dragon of Cadwaladr" for this reason. Historia Brittonum was written , and by this point the dragon was no longer just a military symbol but associated with a coming deliverer from the Saxons, and for the first time as a symbol of independence. It is also the first time that the colour of the dragon is verifiably given as red. Nevertheless there may well be an older attribution of red to the colour of the dragon in Y Gododdin. The story of Lludd a Llefelys in the Mabinogion settles the matter, firmly establishing the red dragon of the Celtic Britons being in opposition with the white dragon of the Saxons. Tudor colours of green and white were added by Henry VII at the Battle of Bosworth in 1485, after which it was carried in state to St Paul's Cathedral and a dragon added as a supporter of the Tudor royal arms.
It was officially recognised as the Welsh national flag in 1959. Several cities include a dragon in their flag design, including Cardiff, the Welsh capital.
Symbolism
Historia Brittonum was written , and by this point the dragon was no longer just a military symbol but associated with a coming deliverer from the Saxons, and for the first time as a symbol of independence. It is also the first time that the colour of the dragon is verifiably given as red. Nevertheless there may well be an older attribution of red to the colour of the dragon in Y Gododdin. The story of Lludd a Llefelys in the Mabinogion settles the matter, firmly establishing the red dragon of the Celtic Britons being in opposition with the white dragon of the Saxons.
The dragon of Wales was used by numerous Welsh rulers as a propaganda tool; to portray their links to the Arthurian legend, the title given to such rulers is Y Mab Darogan (The prophesied Son). The Welsh term was used to refer to Welsh leaders including Owain Gwynedd, Llywelyn ap Gruffudd (Llywelyn the Last) and "the dragon" Owain Glyndŵr. Cynddelw Brydydd Mawr, a court poet to Owain Gwynedd refers to him in one elegy, personifying him as "The golden dragon of Snowdonia of eagles".
Henry VII recognised the red dragon upon its blessing at Saint Paul's Cathedral following his victory at Bosworth Field under the realm of 'England and Wales' in 1485; the United Kingdom would not recognise the flag's official status again until 1959, despite the dragon being used by Romanised Celtic Britons since at least the fall of the Roman empire in 6th century AD.
History
Cadwaladr
As an emblem, the red dragon of Wales has been used since the reign of Cadwaladr, King of Gwynedd from around 655AD. The Red Welsh dragon is often described as the "Red Dragon of Cadwaladr" for this reason. Later Taliesin poems reference the return of Cadwaladr (r. to 682) and coming Saxon liberation. Nevertheless these are perhaps as old as late 7th century, and speak of the .
Kingdom of Gwynedd
The Senior line of the House of Aberffraw descended from Prince Llywelyn the Great in patriline succession and became extinct on the death of Owain Lawgoch in 1378.
Owain Glyndŵr
In 1400, raised the dragon standard during his revolts against the occupation of Wales by the English crown. 's banner known as ('The Golden Dragon') was raised over during the Battle of Tuthill in 1401 against the English. The flag has ancient origins, chose to fly the standard of a golden dragon on a white background, the traditional standard.
Henry VII
In 1485, the most significant link between the symbol of the red dragon and Wales occurred when Henry Tudor flew the red dragon of Cadwaladr during his invasion of England. Henry was of Welsh descent and after leaving France with an army of 2,000, landed at Milford Haven on 7 August. He made capital of his Welsh ancestry in gathering support and gaining safe passage through Wales. Henry met and fought Richard III at the Battle of Bosworth Field, and in victory took the English throne. After the battle, Henry carried the red dragon standard in state to St Paul's Cathedral, and later the Tudor livery of green and white was added to the flag.
Modern flag
In 1807, the red dragon on a green mount was adopted as the Royal Badge of Wales, and on 11 March 1953 the motto ('The red dragon gives impetus' or 'The red dragon leads the way') was added, a line from the poem by . The badge was the basis of a flag of Wales in which it was placed on a horizontal white and green bicolour. However, the flag was the subject of derision, both because the tail pointed downwards in some iterations and because the motto was a potential double entendre, used in the original poem to allude to the penis of a copulating bull. In 1959, government use of this flag was dropped in favour of the current flag at the urging of the of Bards. Today the flag can be seen flying from the in Cardiff, and from Welsh Government buildings.
In 2017 the Unicode Consortium approved emoji support for the Flag of Wales following a proposal from Jeremy Burge of Emojipedia and Owen Williams of BBC Wales in 2016. This was added to major smartphone platforms alongside the flags of England and Scotland in the same year. Prior to this update, The Telegraph reported that users had "been able to send emojis of the Union Flag, but not of the individual nations".
Other flags
Flag of Saint David
The flag of Saint David, a yellow cross on a black field, is used in the emblem of the Diocese of St Davids and is flown on St David's Day. In recent times the flag has been adopted as a symbol of Welsh nationalism. Some organisations, such as the Christian Party use this flag instead of , citing their dissatisfaction with the current flag.
Government ensign
An ensign for use aboard ships used by the Welsh Government, such as the patrol boats of the Marine and Fisheries Division, was granted in 2017.
In popular culture
The flag of Wales has been used by those in the arts, sport and business to show a sense of patriotism or recognition with Wales. During the 1999 Rugby World Cup, which was hosted in Wales, the opening ceremony used the motif of the dragon several times, though most memorably, the flag was worn on a dress by Welsh singer Shirley Bassey.
Other musicians to have used the flag, include Nicky Wire of Manic Street Preachers, who will often drape the Welsh flag over amps when playing live, and Cerys Matthews who has worn the image on her clothes, while classical singer Katherine Jenkins has taken the flag on stage during live performances.
Former Pink Floyd bassist Roger Waters's album Radio K.A.O.S. (1987) follows the story of a young disabled Welsh man, grounded in California, who regularly expresses nostalgia and a hope for return to his home country. The chorus of "Sunset Strip" uses the imagery of the flag of Wales to further emphasise this:
In 2018, the flag made an unexpected appearance in Black Panther, during a scene set in the United Nations. The flag is displayed alongside those of independent sovereign nations, leading to speculation that Wales is an independent nation in the Marvel Cinematic Universe. The scene led to comments and discussions, including from the Welsh Government and Plaid Cymru.
See also
List of flags of the United Kingdom
List of Welsh flags
National symbols of Wales
Flags of Europe
References
Bibliography
Flag of Wales
Welsh heraldry
Flags of the United Kingdom
Welsh mythology
Flags introduced in 1959
National flags
Dragons in art
Flags displaying animals
|
```c++
// scriptorbit.cpp
//
//
// Interface for a Celestia trajectory implemented via a Lua script.
//
// This program is free software; you can redistribute it and/or
// as published by the Free Software Foundation; either version 2
#include "scriptorbit.h"
#include <Eigen/Core>
#include <lua.hpp>
#include <celutil/logger.h>
#include "orbit.h"
#include "scriptobject.h"
using celestia::util::GetLogger;
namespace celestia::ephem
{
namespace
{
class ScriptedOrbit : public CachingOrbit
{
public:
ScriptedOrbit(lua_State*,
std::string&&,
double boundingRadius,
double period,
double validRangeBegin,
double validRangeEnd);
~ScriptedOrbit() override = default;
Eigen::Vector3d computePosition(double tjd) const override;
bool isPeriodic() const override;
double getPeriod() const override;
double getBoundingRadius() const override;
void getValidRange(double& begin, double& end) const override;
private:
lua_State* luaState{ nullptr };
std::string luaOrbitObjectName;
double boundingRadius{ 1.0 };
double period{ 0.0 };
double validRangeBegin{ 0.0 };
double validRangeEnd{ 0.0 };
};
ScriptedOrbit::ScriptedOrbit(lua_State* pLuaState,
std::string&& pLuaOrbitObjectName,
double pBoundingRadius,
double pPeriod,
double pValidRangeBegin,
double pValidRangeEnd)
: luaState(pLuaState),
luaOrbitObjectName(std::move(pLuaOrbitObjectName)),
boundingRadius(pBoundingRadius),
period(pPeriod),
validRangeBegin(pValidRangeBegin),
validRangeEnd(pValidRangeEnd)
{}
// Call the position method of the ScriptedOrbit object
Eigen::Vector3d
ScriptedOrbit::computePosition(double tjd) const
{
Eigen::Vector3d pos(Eigen::Vector3d::Zero());
lua_getglobal(luaState, luaOrbitObjectName.c_str());
if (lua_istable(luaState, -1))
{
lua_pushstring(luaState, "position");
lua_gettable(luaState, -2);
if (lua_isfunction(luaState, -1))
{
lua_pushvalue(luaState, -2); // push 'self' on stack
lua_pushnumber(luaState, tjd);
if (lua_pcall(luaState, 2, 3, 0) == 0)
{
pos = Eigen::Vector3d(lua_tonumber(luaState, -3),
lua_tonumber(luaState, -2),
lua_tonumber(luaState, -1));
lua_pop(luaState, 3);
}
else
{
// Function call failed for some reason
//clog << "ScriptedOrbit failed: " << lua_tostring(luaState, -1) << "\n";
lua_pop(luaState, 1);
}
}
else
{
// Bad position function
lua_pop(luaState, 1);
}
}
else
{
// The script orbit object disappeared. OOPS.
}
// Pop the script orbit object
lua_pop(luaState, 1);
// Convert to Celestia's internal coordinate system
return Eigen::Vector3d(pos.x(), pos.z(), -pos.y());
}
double
ScriptedOrbit::getPeriod() const
{
if (period == 0.0)
return validRangeEnd - validRangeBegin;
return period;
}
bool
ScriptedOrbit::isPeriodic() const
{
return period != 0.0;
}
void
ScriptedOrbit::getValidRange(double& begin, double& end) const
{
begin = validRangeBegin;
end = validRangeEnd;
}
double
ScriptedOrbit::getBoundingRadius() const
{
return boundingRadius;
}
} // end unnamed namespace
/*! Initialize the script orbit.
* moduleName is the name of a module that contains the orbit factory
* function. The module will be loaded with Lua's require function before
* creating the Lua orbit object.
*
* funcName is the name of some factory function in the specified luaState
* that will produce a Lua orbit object from the parameter list.
*
* The Lua factory function accepts a single table parameter containg
* all the orbit properties. It returns a table with the following
* properties:
*
* boundingRadius - A number giving the maximum distance of the trajectory
* from the origin; must be present, and must be a positive value.
* period - A number giving the period of the orbit. If not present,
* the orbit is assumed to be aperiodic. The orbital period is only
* used for drawing the orbit path.
* beginDate, endDate - optional values that specify the time span over
* which the orbit is valid. If not given, the orbit is assumed to be
* useable at any time. The orbit is invalid if end < begin.
* position(time) - The position function takes a time value as input
* (TDB Julian day) and returns three values which are the x, y, and
* z coordinates. Units for the position are kilometers.
*/
std::shared_ptr<const Orbit>
CreateScriptedOrbit(const std::string* moduleName,
const std::string& funcName,
const AssociativeArray& parameters,
const fs::path& path)
{
lua_State* luaState = GetScriptedObjectContext();
if (luaState == nullptr)
{
GetLogger()->warn("ScriptedOrbits are currently disabled.\n");
return nullptr;
}
if (moduleName != nullptr && !moduleName->empty())
{
lua_getglobal(luaState, "require");
if (!lua_isfunction(luaState, -1))
{
GetLogger()->error("Cannot load ScriptedOrbit package: 'require' function is unavailable\n");
lua_pop(luaState, 1);
return nullptr;
}
lua_pushstring(luaState, moduleName->c_str());
if (lua_pcall(luaState, 1, 1, 0) != 0)
{
GetLogger()->error("Failed to load module for ScriptedOrbit: {}\n", lua_tostring(luaState, -1));
lua_pop(luaState, 1);
return nullptr;
}
}
// Get the orbit generator function
lua_getglobal(luaState, funcName.c_str());
if (lua_isfunction(luaState, -1) == 0)
{
// No function with the requested name; pop whatever value we
// did receive along with the table of arguments.
lua_pop(luaState, 1);
GetLogger()->error("No Lua function named {} found.\n", funcName);
return nullptr;
}
// Construct the table that we'll pass to the orbit generator function
lua_newtable(luaState);
SetLuaVariables(luaState, parameters);
// set the addon path
{
std::string pathStr = path.string();
lua_pushstring(luaState, "AddonPath");
lua_pushstring(luaState, pathStr.c_str());
lua_settable(luaState, -3);
}
// Call the generator function
if (lua_pcall(luaState, 1, 1, 0) != 0)
{
// Some sort of error occurred--the error message is atop the stack
GetLogger()->error("Error calling ScriptedOrbit generator function: {}\n",
lua_tostring(luaState, -1));
lua_pop(luaState, 1);
return nullptr;
}
if (lua_istable(luaState, -1) == 0)
{
// We have an object, but it's not a table. Pop it off the
// stack and report failure.
GetLogger()->error("ScriptedOrbit generator function returned bad value.\n");
lua_pop(luaState, 1);
return nullptr;
}
std::string luaOrbitObjectName = GenerateScriptObjectName();
// Attach the name to the script orbit
lua_pushvalue(luaState, -1); // dup the orbit object on top of stack
lua_setglobal(luaState, luaOrbitObjectName.c_str());
// Now, call orbit object methods to get the bounding radius
// and valid time range.
lua_pushstring(luaState, "boundingRadius");
lua_gettable(luaState, -2);
if (lua_isnumber(luaState, -1) == 0)
{
GetLogger()->error("Bad or missing boundingRadius for ScriptedOrbit object\n");
lua_pop(luaState, 1);
return nullptr;
}
double boundingRadius = lua_tonumber(luaState, -1);
lua_pop(luaState, 1);
// Get the rest of the orbit parameters; they are all optional.
double period = SafeGetLuaNumber(luaState, -1, "period", 0.0);
double validRangeBegin = SafeGetLuaNumber(luaState, -1, "beginDate", 0.0);
double validRangeEnd = SafeGetLuaNumber(luaState, -1, "endDate", 0.0);
// Pop the orbit object off the stack
lua_pop(luaState, 1);
// Perform some sanity checks on the orbit parameters
if (validRangeEnd < validRangeBegin)
{
GetLogger()->error("Bad script orbit: valid range end < begin\n");
return nullptr;
}
if (boundingRadius <= 0.0)
{
GetLogger()->error("Bad script object: bounding radius must be positive\n");
return nullptr;
}
return std::make_shared<ScriptedOrbit>(luaState,
std::move(luaOrbitObjectName),
boundingRadius,
period,
validRangeBegin,
validRangeEnd);
}
}
```
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package examples.spring;
import org.mybatis.dynamic.sql.ParameterTypeConverter;
import org.springframework.core.convert.converter.Converter;
public class LastNameParameterConverter implements ParameterTypeConverter<LastName, String>, Converter<LastName, String> {
@Override
public String convert(LastName source) {
return source == null ? null : source.getName();
}
}
```
|
```xml
/*
* Wire
*
* 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
*
*/
import {USER_EVENT} from '@wireapp/api-client/lib/event/';
import {amplify} from 'amplify';
import ko from 'knockout';
import {WebAppEvents} from '@wireapp/webapp-events';
import {Notification, PreferenceNotificationRepository} from 'src/script/notification/PreferenceNotificationRepository';
import {PropertiesRepository} from 'src/script/properties/PropertiesRepository';
import {createUuid} from 'Util/uuid';
import {ClientEntity} from '../client/ClientEntity';
import {User} from '../entity/User';
describe('PreferenceNotificationRepository', () => {
const user = new User(createUuid(), null);
const userObservable = ko.observable(user);
beforeEach(() => {
spyOn(amplify, 'store').and.callFake(() => {});
});
it('subscribes to preference change events', () => {
spyOn(amplify, 'subscribe').and.callFake(() => {});
const preferenceNotificationRepository = new PreferenceNotificationRepository(userObservable);
expect(amplify.subscribe).toHaveBeenCalledTimes(3);
expect(preferenceNotificationRepository.notifications().length).toBe(0);
});
it('adds new notification when read receipt settings are changed', () => {
amplify.unsubscribeAll(WebAppEvents.USER.EVENT_FROM_BACKEND);
const preferenceNotificationRepository = new PreferenceNotificationRepository(userObservable);
amplify.publish(WebAppEvents.USER.EVENT_FROM_BACKEND, {
key: PropertiesRepository.CONFIG.WIRE_RECEIPT_MODE.key,
type: USER_EVENT.PROPERTIES_SET,
value: true,
});
expect(preferenceNotificationRepository.notifications().length).toBe(1);
expect(preferenceNotificationRepository.notifications()[0]).toEqual({
data: true,
type: PreferenceNotificationRepository.CONFIG.NOTIFICATION_TYPES.READ_RECEIPTS_CHANGED,
});
});
it('adds new notification when new device is added for self user', () => {
amplify.unsubscribeAll(WebAppEvents.USER.CLIENT_ADDED);
const preferenceNotificationRepository = new PreferenceNotificationRepository(userObservable);
const newClientData = new ClientEntity(true, '');
const {type, id, domain, model, time} = newClientData;
amplify.publish(WebAppEvents.USER.CLIENT_ADDED, user.qualifiedId, newClientData);
expect(preferenceNotificationRepository.notifications().length).toBe(1);
expect(preferenceNotificationRepository.notifications()[0]).toEqual({
data: {domain, id, model, time, type},
type: PreferenceNotificationRepository.CONFIG.NOTIFICATION_TYPES.NEW_CLIENT,
});
});
it('ignores new device notification if not from the self user', () => {
amplify.unsubscribeAll(WebAppEvents.USER.CLIENT_ADDED);
const preferenceNotificationRepository = new PreferenceNotificationRepository(userObservable);
const newClientData = new ClientEntity(true, '');
amplify.publish(WebAppEvents.USER.CLIENT_ADDED, {domain: '', id: createUuid()}, newClientData);
expect(preferenceNotificationRepository.notifications().length).toBe(0);
});
it('stores in local storage any notification added', () => {
const preferenceNotificationRepository = new PreferenceNotificationRepository(userObservable);
const notifications: Notification[] = [
{data: true, type: 'preference-changed'},
{data: false, type: 'device-changed'},
];
(amplify.store as any).calls.reset();
notifications.forEach((notification, index) => {
preferenceNotificationRepository.notifications.push(notification);
expect(amplify.store).toHaveBeenCalledTimes(index + 1);
});
});
it('restores saved notifications from local storage', () => {
const storedNotifications: Notification[] = [
{data: true, type: 'type-1'},
{data: false, type: 'type-2'},
];
(amplify.store as any).and.returnValue(JSON.stringify(storedNotifications));
const preferenceNotificationRepository = new PreferenceNotificationRepository(userObservable);
expect(preferenceNotificationRepository.notifications().length).toBe(storedNotifications.length);
expect(JSON.stringify(preferenceNotificationRepository.notifications())).toBe(JSON.stringify(storedNotifications));
});
it('returns notifications sorted by priority', () => {
const storedNotifications: Notification[] = [
{
data: false,
type: PreferenceNotificationRepository.CONFIG.NOTIFICATION_TYPES.READ_RECEIPTS_CHANGED,
},
{
data: true,
type: PreferenceNotificationRepository.CONFIG.NOTIFICATION_TYPES.NEW_CLIENT,
},
];
(amplify.store as any).and.returnValue(JSON.stringify(storedNotifications));
const preferenceNotificationRepository = new PreferenceNotificationRepository(userObservable);
const notifications = preferenceNotificationRepository.getNotifications();
expect(notifications[0].type).toBe(PreferenceNotificationRepository.CONFIG.NOTIFICATION_TYPES.NEW_CLIENT);
expect(notifications[1].type).toBe(
PreferenceNotificationRepository.CONFIG.NOTIFICATION_TYPES.READ_RECEIPTS_CHANGED,
);
expect(preferenceNotificationRepository.notifications().length).toBe(0);
});
});
```
|
The Green Mountain Glades is a Tier III Junior A ice hockey team in the Eastern Junior Hockey League's North Division from 2000-2017.
Overview
The team played its home games at Cairns Arena, a 600-seat arena in the suburb of South Burlington, Vermont, as well as the 4,003-seat Gutterson Fieldhouse on the campus of the University of Vermont on certain occasions.
The Green Mountain Glades organization also fielded a team in the Empire Junior B Hockey League as well as youth hockey select teams at the Bantam, Peewee, and Squirt levels.
Notable alumni
Matt Campanale
Zemgus Girgensons - 14th overall pick of the Buffalo Sabres in the 2012 NHL Entry Draft
External links
Ice hockey teams in Vermont
Sports clubs and teams in Burlington, Vermont
2000 establishments in Vermont
2012 disestablishments in the United States
South Burlington, Vermont
|
```xml
import { tick } from '@stryker-mutator/test-helpers';
import { Task } from '@stryker-mutator/util';
import { expect } from 'chai';
import sinon from 'sinon';
import { Resource, ResourceDecorator } from '../../../src/concurrent/index.js';
class ResourceDecoratorUnderTest extends ResourceDecorator<Resource> {
public override recover() {
return super.recover();
}
}
describe(ResourceDecorator.name, () => {
let innerResource1: sinon.SinonStubbedInstance<Resource>;
let innerResource2: sinon.SinonStubbedInstance<Resource>;
let sut: ResourceDecoratorUnderTest;
beforeEach(() => {
innerResource1 = {
init: sinon.stub(),
dispose: sinon.stub(),
};
innerResource2 = {
init: sinon.stub(),
dispose: sinon.stub(),
};
const resources = [innerResource1, innerResource2];
sut = new ResourceDecoratorUnderTest(() => resources.shift()!);
});
(['init', 'dispose'] as const).forEach((method) => {
describe(method, () => {
it(`should pass ${method} to the innerResource`, async () => {
await sut[method]();
expect(innerResource1[method]).called;
expect(innerResource2[method]).not.called;
});
it(`should not break when the innerResource is missing ${method}`, async () => {
delete innerResource1[method];
await expect(sut[method]()).not.rejected;
});
it(`should await ${method} on inner innerResource`, async () => {
const innerTask = new Task();
innerResource1[method]!.returns(innerTask.promise);
let isResolved = false;
const actualInit = sut[method]().then(() => (isResolved = true));
await tick();
expect(isResolved).false;
innerTask.resolve();
await actualInit;
});
it(`should reject when ${method} on inner innerResource rejects`, async () => {
const expectedError = new Error('Error for testing');
innerResource1[method]!.rejects(expectedError);
await expect(sut[method]()).rejectedWith(expectedError);
});
});
});
describe('recover', () => {
it('should dispose the old and init the new', async () => {
await sut.recover();
expect(innerResource1.dispose).called;
expect(innerResource2.init).called;
});
it('should both await dispose and init', async () => {
// Arrange
let recoverResolved = false;
const initTask = new Task();
const disposeTask = new Task();
innerResource1.dispose!.returns(disposeTask.promise);
innerResource2.init!.returns(initTask.promise);
// Act
const onGoingPromise = sut.recover().then(() => (recoverResolved = true));
// Assert
expect(innerResource1.dispose).called;
expect(innerResource2.init).not.called;
expect(recoverResolved).false;
disposeTask.resolve();
await tick();
expect(innerResource2.init).called;
expect(recoverResolved).false;
initTask.resolve();
await onGoingPromise;
});
});
});
```
|
```c++
//////////////////////////////////////////////////////////////////////////////
//
// LICENSE_1_0.txt or copy at path_to_url
//
// See path_to_url for documentation.
//
//////////////////////////////////////////////////////////////////////////////
#ifndef BOOST_INTERPROCESS_DETAIL_ADAPTIVE_NODE_POOL_HPP
#define BOOST_INTERPROCESS_DETAIL_ADAPTIVE_NODE_POOL_HPP
#ifndef BOOST_CONFIG_HPP
# include <boost/config.hpp>
#endif
#
#if defined(BOOST_HAS_PRAGMA_ONCE)
# pragma once
#endif
#include <boost/interprocess/detail/config_begin.hpp>
#include <boost/interprocess/detail/workaround.hpp>
#include <boost/interprocess/detail/utilities.hpp>
#include <boost/interprocess/detail/math_functions.hpp>
#include <boost/intrusive/set.hpp>
#include <boost/intrusive/slist.hpp>
#include <boost/interprocess/detail/type_traits.hpp>
#include <boost/interprocess/mem_algo/detail/mem_algo_common.hpp>
#include <boost/interprocess/allocators/detail/node_tools.hpp>
#include <boost/interprocess/allocators/detail/allocator_common.hpp>
#include <cstddef>
#include <boost/config/no_tr1/cmath.hpp>
#include <boost/container/detail/adaptive_node_pool_impl.hpp>
#include <boost/assert.hpp>
//!\file
//!Describes the real adaptive pool shared by many Interprocess pool allocators
namespace boost {
namespace interprocess {
namespace ipcdetail {
template< class SegmentManager
, std::size_t NodeSize
, std::size_t NodesPerBlock
, std::size_t MaxFreeBlocks
, unsigned char OverheadPercent
>
class private_adaptive_node_pool
: public boost::container::container_detail::private_adaptive_node_pool_impl
< typename SegmentManager::segment_manager_base_type
, ::boost::container::adaptive_pool_flag::size_ordered |
::boost::container::adaptive_pool_flag::address_ordered
>
{
typedef boost::container::container_detail::private_adaptive_node_pool_impl
< typename SegmentManager::segment_manager_base_type
, ::boost::container::adaptive_pool_flag::size_ordered |
::boost::container::adaptive_pool_flag::address_ordered
> base_t;
//Non-copyable
private_adaptive_node_pool();
private_adaptive_node_pool(const private_adaptive_node_pool &);
private_adaptive_node_pool &operator=(const private_adaptive_node_pool &);
public:
typedef SegmentManager segment_manager;
typedef typename base_t::size_type size_type;
static const size_type nodes_per_block = NodesPerBlock;
//Deprecated, use node_per_block
static const size_type nodes_per_chunk = NodesPerBlock;
//!Constructor from a segment manager. Never throws
private_adaptive_node_pool(segment_manager *segment_mngr)
: base_t(segment_mngr, NodeSize, NodesPerBlock, MaxFreeBlocks, OverheadPercent)
{}
//!Returns the segment manager. Never throws
segment_manager* get_segment_manager() const
{ return static_cast<segment_manager*>(base_t::get_segment_manager_base()); }
};
//!Pooled shared memory allocator using adaptive pool. Includes
//!a reference count but the class does not delete itself, this is
//!responsibility of user classes. Node size (NodeSize) and the number of
//!nodes allocated per block (NodesPerBlock) are known at compile time
template< class SegmentManager
, std::size_t NodeSize
, std::size_t NodesPerBlock
, std::size_t MaxFreeBlocks
, unsigned char OverheadPercent
>
class shared_adaptive_node_pool
: public ipcdetail::shared_pool_impl
< private_adaptive_node_pool
<SegmentManager, NodeSize, NodesPerBlock, MaxFreeBlocks, OverheadPercent>
>
{
typedef ipcdetail::shared_pool_impl
< private_adaptive_node_pool
<SegmentManager, NodeSize, NodesPerBlock, MaxFreeBlocks, OverheadPercent>
> base_t;
public:
shared_adaptive_node_pool(SegmentManager *segment_mgnr)
: base_t(segment_mgnr)
{}
};
} //namespace ipcdetail {
} //namespace interprocess {
} //namespace boost {
#include <boost/interprocess/detail/config_end.hpp>
#endif //#ifndef BOOST_INTERPROCESS_DETAIL_ADAPTIVE_NODE_POOL_HPP
```
|
Ulane Bonnel (born Ulane Zeeck in Lingleville, Texas, on 22 September 1918 - died in Paris, France, on 26 September 2006) was a U.S. naval historian working in France, who played a major role developing professional connections between American and French naval historians and in founding both the scholarly journal Chronique d'histoire maritime and the French Commission of Maritime History (Commission française d'histoire maritime).
Early life and education
Ulane Zeeck took her Bachelor of Arts degree at West Texas State College at Canyon, Texas. She joined the U.S. Navy and was given a naval commission in 1943 after attending the Naval Midshipman's (Women's Reserve) Training School at Northampton, Massachusetts. While on active duty, she served as a recruiting officer, instructor, and personnel officer. At the end of the war, she served in the Congressional liaison unit at the Bureau of Naval Personnel. Leaving naval service in 1946 after reaching the rank of lieutenant commander, she went on to work for the Congressional Research Service at the Library of Congress, specializing in military affairs. While in Washington, she met an officer in the French Navy's medical corps then serving with the French naval mission in Washington, D.C., Paul-Henri Bonnel (1912–1984), whom she married in 1947. Following their marriage, Bonnel went to France with her husband, who had a distinguished career in the French Navy, rising to be chief of the maritime health service (chef du service santé des gens de mer) in 1969-72 and an internationally recognized biologist associated with the World Health Organization.
After discovering a love for history in Texas, Bonnel went to the Université de Genève, Switzerland, while her husband was serving at the headquarters of the World Health Organization from 1951. There, she studied under aul Collart, Luc Monnier, and Pierre Traschler. Going further with her studies, she completed her doctoral thesis under Marcel Reinhard and Marcel Dunan at the Sorbonne on French and American privateering in the period between 1797 and 1815, including the Quasi-War with France and the War of 1812.
Professional career
Upon completing her doctorate, Bonnel immediately began to work in the field of naval history and quickly became a key figure in reviving this subject that had long been neglected by universities in France. She was the founder of the journal Chronique d'histoire maritime in 1979 and, a key figure in organizing the Commission française d'histoire maritime in 1980, and later served as its president in 1986–1989.
In 1964, she was appointed the delegate in France for the Library of Congress and played an extremely important role in developing cooperation between French and American naval historians in the period leading up to the bicentenary of the United States. In this role, she was the key person who coordinated the photocopying of documents from French archives for the Library of Congress and the U.S. Navy's Naval Historical Center, relating to the key role that the French Navy played in obtaining American Independence in 1778–1783. Many of the documents she acquired were translated to enrich the U.S. Navy's multivolume series on Naval Documents of the American Revolution, begun by William Bell Clark and William J. Morgan (historian).
In recognition of her contributions to Franco-American historical relations, she was elected the first woman member of the History, Letters, and Arts section of the Académie de Marine. She also served as president of the Association internationale des Docteurs des Universités françaises and vice-president of the Institut Napoléon. After the 1984 discovery of the wreck of CSS Alabama, sunk in Cherbourg harbor during the American Civil War, she helped to organize both the French and American branches of the CSS Alabama Association, serving as president of the French branch and helping to develop support for its work in underwater archeology on the site of the wreck. In this role, she was the key person working to negotiate the international agreement between France and the United States over the wreck and the wreck site in French waters.
Published works
La France, les États-Unis et la guerre de course (1797–1815) (1961)
Jean-Gaspard de Vence, premier Préfet Maritime de Toulon, Revue de l'Institut Napoléon (1964)
Le Contre-Amiral Vence, Commandant d'Armes à Toulon, Revue Neptunia (1964)
West Texas: the Z ranch or the story of the Zeeburgs (1970)
Under the ice cap (1970)
Sainte-Hélène, terre d'exil (1971)
Guide des sources de l'histoire des États-Unis dans les archives françaises, with Madeline Astorquia and others (1976)
Fleurieu et la marine de son temps, colloque organisé par la Commission française d'histoire maritime, edited by Ulane Bonnel (1992)
Additional sources
The papers of Ulane Bonnel's husband, Paul-Henri Bonnel, are held in 41 cartons at the Service Historique de la Défense (Marine), Château de Vincennes, Fonds privé, Sous-Série GG2 176
ObituariesChronique d'histoire maritime, no. 61, décembre 2006, pp. 188–189, by Etienne Taillemite.Pull Together: Newsletter of the Naval Historical Foundation'', Fall/Winter 2006/2007, p. 14, by William S. Dudley.
1918 births
2006 deaths
People from Erath County, Texas
American naval historians
Female United States Navy officers
American women historians
WAVES personnel
University of Geneva alumni
West Texas A&M University alumni
Historians from Texas
21st-century American women
Military personnel from Texas
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<!--
~ contributor license agreements. See the NOTICE file distributed with
~ this work for additional information regarding copyright ownership.
~
~ path_to_url
~
~ Unless required by applicable law or agreed to in writing, software
~ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-->
<sql-cases>
<!-- TODO Fix me. -->
<!-- <sql-case id="create_procedure" value="CREATE PROCEDURE insert_data(a integer, b integer)-->
<!-- LANGUAGE SQL-->
<!-- AS $$-->
<!-- INSERT INTO tbl VALUES (a);-->
<!-- INSERT INTO tbl VALUES (b);-->
<!-- $$" db-types="PostgreSQL,openGauss" />-->
<sql-case id="create_procedure_with_parameters" value="CREATE PROCEDURE HumanResources.uspGetEmployees
@LastName NVARCHAR(50),
@FirstName NVARCHAR(50)
AS
SELECT FirstName, LastName, JobTitle, Department
FROM HumanResources.vEmployeeDepartment
WHERE FirstName = @FirstName AND LastName = @LastName;" db-types="SQLServer" />
<sql-case id="create_procedure_declare_without_at" value="CREATE PROCEDURE proc (ofs INT, count INT) BEGIN DECLARE i INT DEFAULT ofs; WHILE i < count DO SELECT i AS i; IF LOWER(CHAR(i USING utf8) COLLATE utf8_tolower_ci) != LOWER(CHAR(i USING utf8mb4) COLLATE utf8mb4_0900_as_ci) THEN SELECT i AS 'found funny character'; END IF; SET i = i + 1; END WHILE; END" db-types="MySQL" />
<sql-case id="create_procedure_with_declare_and_view" value="CREATE PROCEDURE bug20953() BEGIN DECLARE i INT; CREATE VIEW v AS SELECT i; END" db-types="MySQL" />
<sql-case id="create_procedure_with_create_view_as_select" value="CREATE PROCEDURE p1() CREATE VIEW v1 AS SELECT * FROM t1" db-types="MySQL" />
<sql-case id="create_procedure_with_create_view_as_double_select" value="CREATE PROCEDURE bug20953() CREATE VIEW v AS SELECT 1 FROM (SELECT 1) AS d1" db-types="MySQL" />
<sql-case id="create_procedure_with_create_view_as_select_lowercase" value="create procedure p1() create view v1 as select * from t1" db-types="MySQL" />
<sql-case id="create_procedure_with_create_view_as_select_i" value="CREATE PROCEDURE bug20953(i INT) CREATE VIEW v AS SELECT i" db-types="MySQL" />
<sql-case id="create_procedure_with_create_view_as_select_into" value="CREATE PROCEDURE bug20953() CREATE VIEW v AS SELECT 1 INTO @a" db-types="MySQL" />
<sql-case id="create_procedure_with_create_view_as_select_into_dumpfile" value="CREATE PROCEDURE bug20953() CREATE VIEW v AS SELECT 1 INTO DUMPFILE "file"" db-types="MySQL" />
<sql-case id="create_procedure_with_create_view_as_select_into_outfile" value="CREATE PROCEDURE bug20953() CREATE VIEW v AS SELECT 1 INTO OUTFILE "file"" db-types="MySQL" />
<sql-case id="create_procedure_with_sqlexception_and_create_view" value="create procedure p() begin declare continue handler for sqlexception begin end; create view a as select 1; end" db-types="MySQL" />
<sql-case id="create_procedure_with_deterministic_create_view" value="create procedure p1 () deterministic begin create view v1 as select 1; end;" db-types="MySQL" />
<sql-case id="create_procedure_with_update_statement_oracle" value="CREATE PROCEDURE update_order (order_id NUMBER,status NUMBER) AS var NUMBER(1, 0) := 0; BEGIN UPDATE t_order SET status = status WHERE order_id = order_id;END;" db-types="Oracle" />
<sql-case id="create_procedure_with_prepare_commit" value="CREATE DEFINER=`sys_data`@`%` PROCEDURE `TEST1` (a VARCHAR(64),b VARCHAR(64),c VARCHAR(64),d VARCHAR(8),e INT) BEGIN DECLARE f VARCHAR(8); SET f=DATE_FORMAT(DATE_ADD((STR_TO_DATE(d,'%Y%m%d')),INTERVAL -(e) MONTH),'%Y%m%d'); SET @aaa=CONCAT('delete from ',a,'.',b,' where ',c,'<=',f,' or ', c,'<> LAST_DAY(',c,')', 'or ',c,'=', d); PREPARE stmt FROM @aaa; EXECUTE stmt; COMMIT; DEALLOCATE PREPARE stmt; END" db-types="MySQL" />
<sql-case id="create_procedure_with_cursor_definition" value="CREATE OR REPLACE EDITIONABLE PROCEDURE my_proc AS cursor cursor1 is select distinct a from tbl; var1 varchar2(500); var2 varchar2(500); BEGIN INSERT INTO t VALUES (var1, var2); END;" db-types="Oracle" />
<sql-case id="create_procedure_with_collection_type_definition" value="CREATE OR REPLACE EDITIONABLE PROCEDURE my_proc AS TYPE my_type is table of my_table.id%TYPE; BEGIN INSERT INTO t VALUES (var1, var2); END;" db-types="Oracle" />
<sql-case id="create_plsql_block" value="DECLARE warehouse NUMBER := 1; ground NUMBER := 1; insured NUMBER := 1; result NUMBER; BEGIN SELECT BIN_TO_NUM(warehouse, ground, insured) INTO result FROM DUAL; UPDATE orders SET order_status = result WHERE order_id = 2441; END;" db-types="Oracle" />
</sql-cases>
```
|
The Kungsporten Church () is a church building in Öxnehaga in Huskvarna, Sweden. Belonging to the Evangelical Free Church in Sweden, it was opened in November 2001.
References
External links
official website
21st-century Protestant churches
Churches in Jönköping Municipality
Churches completed in 2001
Huskvarna
21st-century churches in Sweden
|
```javascript
/*global angular*/
(function () {
angular
.module('simplAdmin.search')
.factory('searchService', ['$http', searchService]);
function searchService($http) {
var service = {
getMostSearchKeywords: getMostSearchKeywords
};
return service;
function getMostSearchKeywords() {
return $http.get('api/search/most-search-keywords');
}
}
})();
```
|
La Neuveville-sous-Montfort () is a commune in the Vosges department in Grand Est in northeastern France.
Geography
The village is positioned some to the north-east of Vittel. Sited on south facing hills that capture the sun, encourages and agricultural economy that includes viticulture, while proximity to a well known spa resort supports the local tourist business: there are a number of well marked walking trails around the village.
See also
Communes of the Vosges department
References
Communes of Vosges (department)
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
// Code generated by applyconfiguration-gen. DO NOT EDIT.
package v1beta1
import (
storagev1beta1 "k8s.io/api/storage/v1beta1"
metav1 "k8s.io/apimachinery/pkg/apis/meta/v1"
types "k8s.io/apimachinery/pkg/types"
managedfields "k8s.io/apimachinery/pkg/util/managedfields"
internal "k8s.io/client-go/applyconfigurations/internal"
v1 "k8s.io/client-go/applyconfigurations/meta/v1"
)
// CSIDriverApplyConfiguration represents an declarative configuration of the CSIDriver type for use
// with apply.
type CSIDriverApplyConfiguration struct {
v1.TypeMetaApplyConfiguration `json:",inline"`
*v1.ObjectMetaApplyConfiguration `json:"metadata,omitempty"`
Spec *CSIDriverSpecApplyConfiguration `json:"spec,omitempty"`
}
// CSIDriver constructs an declarative configuration of the CSIDriver type for use with
// apply.
func CSIDriver(name string) *CSIDriverApplyConfiguration {
b := &CSIDriverApplyConfiguration{}
b.WithName(name)
b.WithKind("CSIDriver")
b.WithAPIVersion("storage.k8s.io/v1beta1")
return b
}
// ExtractCSIDriver extracts the applied configuration owned by fieldManager from
// cSIDriver. If no managedFields are found in cSIDriver for fieldManager, a
// CSIDriverApplyConfiguration is returned with only the Name, Namespace (if applicable),
// APIVersion and Kind populated. It is possible that no managed fields were found for because other
// field managers have taken ownership of all the fields previously owned by fieldManager, or because
// the fieldManager never owned fields any fields.
// cSIDriver must be a unmodified CSIDriver API object that was retrieved from the Kubernetes API.
// ExtractCSIDriver provides a way to perform a extract/modify-in-place/apply workflow.
// Note that an extracted apply configuration will contain fewer fields than what the fieldManager previously
// applied if another fieldManager has updated or force applied any of the previously applied fields.
// Experimental!
func ExtractCSIDriver(cSIDriver *storagev1beta1.CSIDriver, fieldManager string) (*CSIDriverApplyConfiguration, error) {
return extractCSIDriver(cSIDriver, fieldManager, "")
}
// ExtractCSIDriverStatus is the same as ExtractCSIDriver except
// that it extracts the status subresource applied configuration.
// Experimental!
func ExtractCSIDriverStatus(cSIDriver *storagev1beta1.CSIDriver, fieldManager string) (*CSIDriverApplyConfiguration, error) {
return extractCSIDriver(cSIDriver, fieldManager, "status")
}
func extractCSIDriver(cSIDriver *storagev1beta1.CSIDriver, fieldManager string, subresource string) (*CSIDriverApplyConfiguration, error) {
b := &CSIDriverApplyConfiguration{}
err := managedfields.ExtractInto(cSIDriver, internal.Parser().Type("io.k8s.api.storage.v1beta1.CSIDriver"), fieldManager, b, subresource)
if err != nil {
return nil, err
}
b.WithName(cSIDriver.Name)
b.WithKind("CSIDriver")
b.WithAPIVersion("storage.k8s.io/v1beta1")
return b, nil
}
// WithKind sets the Kind field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Kind field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithKind(value string) *CSIDriverApplyConfiguration {
b.Kind = &value
return b
}
// WithAPIVersion sets the APIVersion field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the APIVersion field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithAPIVersion(value string) *CSIDriverApplyConfiguration {
b.APIVersion = &value
return b
}
// WithName sets the Name field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Name field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithName(value string) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
b.Name = &value
return b
}
// WithGenerateName sets the GenerateName field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the GenerateName field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithGenerateName(value string) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
b.GenerateName = &value
return b
}
// WithNamespace sets the Namespace field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Namespace field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithNamespace(value string) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
b.Namespace = &value
return b
}
// WithUID sets the UID field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the UID field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithUID(value types.UID) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
b.UID = &value
return b
}
// WithResourceVersion sets the ResourceVersion field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ResourceVersion field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithResourceVersion(value string) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
b.ResourceVersion = &value
return b
}
// WithGeneration sets the Generation field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Generation field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithGeneration(value int64) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
b.Generation = &value
return b
}
// WithCreationTimestamp sets the CreationTimestamp field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the CreationTimestamp field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithCreationTimestamp(value metav1.Time) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
b.CreationTimestamp = &value
return b
}
// WithDeletionTimestamp sets the DeletionTimestamp field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the DeletionTimestamp field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithDeletionTimestamp(value metav1.Time) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
b.DeletionTimestamp = &value
return b
}
// WithDeletionGracePeriodSeconds sets the DeletionGracePeriodSeconds field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the DeletionGracePeriodSeconds field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithDeletionGracePeriodSeconds(value int64) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
b.DeletionGracePeriodSeconds = &value
return b
}
// WithLabels puts the entries into the Labels field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, the entries provided by each call will be put on the Labels field,
// overwriting an existing map entries in Labels field with the same key.
func (b *CSIDriverApplyConfiguration) WithLabels(entries map[string]string) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
if b.Labels == nil && len(entries) > 0 {
b.Labels = make(map[string]string, len(entries))
}
for k, v := range entries {
b.Labels[k] = v
}
return b
}
// WithAnnotations puts the entries into the Annotations field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, the entries provided by each call will be put on the Annotations field,
// overwriting an existing map entries in Annotations field with the same key.
func (b *CSIDriverApplyConfiguration) WithAnnotations(entries map[string]string) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
if b.Annotations == nil && len(entries) > 0 {
b.Annotations = make(map[string]string, len(entries))
}
for k, v := range entries {
b.Annotations[k] = v
}
return b
}
// WithOwnerReferences adds the given value to the OwnerReferences field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the OwnerReferences field.
func (b *CSIDriverApplyConfiguration) WithOwnerReferences(values ...*v1.OwnerReferenceApplyConfiguration) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
for i := range values {
if values[i] == nil {
panic("nil value passed to WithOwnerReferences")
}
b.OwnerReferences = append(b.OwnerReferences, *values[i])
}
return b
}
// WithFinalizers adds the given value to the Finalizers field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the Finalizers field.
func (b *CSIDriverApplyConfiguration) WithFinalizers(values ...string) *CSIDriverApplyConfiguration {
b.ensureObjectMetaApplyConfigurationExists()
for i := range values {
b.Finalizers = append(b.Finalizers, values[i])
}
return b
}
func (b *CSIDriverApplyConfiguration) ensureObjectMetaApplyConfigurationExists() {
if b.ObjectMetaApplyConfiguration == nil {
b.ObjectMetaApplyConfiguration = &v1.ObjectMetaApplyConfiguration{}
}
}
// WithSpec sets the Spec field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Spec field is set to the value of the last call.
func (b *CSIDriverApplyConfiguration) WithSpec(value *CSIDriverSpecApplyConfiguration) *CSIDriverApplyConfiguration {
b.Spec = value
return b
}
```
|
```lua
cflags{'-Wall'}
pkg.hdrs = copy('$outdir/include', '$srcdir', {'bzlib.h'})
lib('libbz2.a', {
'blocksort.c',
'huffman.c',
'crctable.c',
'randtable.c',
'compress.c',
'decompress.c',
'bzlib.c'
})
exe('bzip2', {'bzip2.c', 'libbz2.a'})
file('bin/bzip2', '755', '$outdir/bzip2')
man{'bzip2.1'}
sym('bin/bzcat', 'bzip2')
fetch 'git'
```
|
```c
/* $OpenBSD: bktr_os.c,v 1.37 2022/07/02 08:50:42 visa Exp $ */
/* $FreeBSD: src/sys/dev/bktr/bktr_os.c,v 1.20 2000/10/20 08:16:53 roger Exp $ */
/*
* This is part of the Driver for Video Capture Cards (Frame grabbers)
* and TV Tuner cards using the Brooktree Bt848, Bt848A, Bt849A, Bt878, Bt879
* chipset.
*
* bktr_os : This has all the Operating System dependant code,
* probe/attach and open/close/ioctl/read/mmap
* memory allocation
* PCI bus interfacing
*
*
*/
/*
* 1. Redistributions of source code must retain the
* 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Amancio Hasty and
* Roger Hardiman
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*/
#define FIFO_RISC_DISABLED 0
#define ALL_INTS_DISABLED 0
#include "radio.h"
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/conf.h>
#include <sys/uio.h>
#include <sys/kernel.h>
#include <sys/signalvar.h>
#include <sys/mman.h>
#include <sys/vnode.h>
#if NRADIO > 0
#include <sys/radioio.h>
#include <dev/radio_if.h>
#endif
#include <uvm/uvm_extern.h>
#include <sys/device.h>
#include <dev/pci/pcivar.h>
#include <dev/pci/pcireg.h>
#include <dev/pci/pcidevs.h>
#ifdef BKTR_DEBUG
int bktr_debug = 1;
#define DPR(x) (bktr_debug ? printf x : 0)
#else
#define DPR(x)
#endif
#include <dev/ic/bt8xx.h> /* OpenBSD location for .h files */
#include <dev/pci/bktr/bktr_reg.h>
#include <dev/pci/bktr/bktr_tuner.h>
#include <dev/pci/bktr/bktr_audio.h>
#include <dev/pci/bktr/bktr_core.h>
#include <dev/pci/bktr/bktr_os.h>
#define IPL_VIDEO IPL_BIO /* XXX */
static int bktr_intr(void *arg) { return common_bktr_intr(arg); }
#define bktr_open bktropen
#define bktr_close bktrclose
#define bktr_read bktrread
#define bktr_write bktrwrite
#define bktr_ioctl bktrioctl
#define bktr_mmap bktrmmap
int bktr_open(dev_t, int, int, struct proc *);
int bktr_close(dev_t, int, int, struct proc *);
int bktr_read(dev_t, struct uio *, int);
int bktr_write(dev_t, struct uio *, int);
int bktr_ioctl(dev_t, ioctl_cmd_t, caddr_t, int, struct proc *);
paddr_t bktr_mmap(dev_t, off_t, int);
static int bktr_probe(struct device *, void *, void *);
static void bktr_attach(struct device *, struct device *, void *);
const struct cfattach bktr_ca = {
sizeof(struct bktr_softc), bktr_probe, bktr_attach
};
struct cfdriver bktr_cd = {
NULL, "bktr", DV_DULL
};
#if NRADIO > 0
/* for radio(4) */
int bktr_get_info(void *, struct radio_info *);
int bktr_set_info(void *, struct radio_info *);
const struct radio_hw_if bktr_hw_if = {
NULL, /* open */
NULL, /* close */
bktr_get_info,
bktr_set_info,
NULL /* search */
};
#endif
int
bktr_probe(struct device *parent, void *match, void *aux)
{
struct pci_attach_args *pa = aux;
if (PCI_VENDOR(pa->pa_id) == PCI_VENDOR_BROOKTREE &&
(PCI_PRODUCT(pa->pa_id) == PCI_PRODUCT_BROOKTREE_BT848 ||
PCI_PRODUCT(pa->pa_id) == PCI_PRODUCT_BROOKTREE_BT849 ||
PCI_PRODUCT(pa->pa_id) == PCI_PRODUCT_BROOKTREE_BT878 ||
PCI_PRODUCT(pa->pa_id) == PCI_PRODUCT_BROOKTREE_BT879))
return 1;
return 0;
}
/*
* the attach routine.
*/
static void
bktr_attach(struct device *parent, struct device *self, void *aux)
{
bktr_ptr_t bktr;
u_int latency;
u_int fun;
unsigned int rev;
struct pci_attach_args *pa = aux;
pci_intr_handle_t ih;
const char *intrstr;
int retval;
int unit;
bktr = (bktr_ptr_t)self;
unit = bktr->bktr_dev.dv_unit;
bktr->dmat = pa->pa_dmat;
/* Enable Back-to-Back
XXX: check if all old DMA is stopped first (e.g. after warm
boot) */
fun = pci_conf_read(pa->pa_pc, pa->pa_tag, PCI_COMMAND_STATUS_REG);
DPR((" fun=%b", fun, PCI_COMMAND_STATUS_BITS));
pci_conf_write(pa->pa_pc, pa->pa_tag, PCI_COMMAND_STATUS_REG,
fun | PCI_COMMAND_BACKTOBACK_ENABLE);
/*
* map memory
*/
retval = pci_mapreg_map(pa, PCI_MAPREG_START, PCI_MAPREG_TYPE_MEM |
PCI_MAPREG_MEM_TYPE_32BIT, 0, &bktr->memt, &bktr->memh, NULL,
&bktr->obmemsz, 0);
DPR(("pci_mapreg_map: memt %lx, memh %lx, size %x\n",
bktr->memt, bktr->memh, bktr->obmemsz));
if (retval) {
printf("%s: can't map mem space\n", bktr_name(bktr));
return;
}
/*
* Disable the brooktree device
*/
OUTL(bktr, BKTR_INT_MASK, ALL_INTS_DISABLED);
OUTW(bktr, BKTR_GPIO_DMA_CTL, FIFO_RISC_DISABLED);
/*
* map interrupt
*/
if (pci_intr_map(pa, &ih)) {
printf("%s: can't map interrupt\n",
bktr_name(bktr));
return;
}
intrstr = pci_intr_string(pa->pa_pc, ih);
bktr->ih = pci_intr_establish(pa->pa_pc, ih, IPL_VIDEO,
bktr_intr, bktr, bktr->bktr_dev.dv_xname);
if (bktr->ih == NULL) {
printf("%s: can't establish interrupt",
bktr_name(bktr));
if (intrstr != NULL)
printf(" at %s", intrstr);
printf("\n");
return;
}
if (intrstr != NULL)
printf(": %s\n", intrstr);
/*
* PCI latency timer. 32 is a good value for 4 bus mastering slots, if
* you have more than four, then 16 would probably be a better value.
*/
#ifndef BROOKTREE_DEF_LATENCY_VALUE
#define BROOKTREE_DEF_LATENCY_VALUE 0x10
#endif
latency = pci_conf_read(pa->pa_pc, pa->pa_tag, PCI_LATENCY_TIMER);
latency = (latency >> 8) & 0xff;
if (!latency) {
if (bootverbose) {
printf("%s: PCI bus latency was 0 changing to %d",
bktr_name(bktr), BROOKTREE_DEF_LATENCY_VALUE);
}
latency = BROOKTREE_DEF_LATENCY_VALUE;
pci_conf_write(pa->pa_pc, pa->pa_tag,
PCI_LATENCY_TIMER, latency<<8);
}
/* read the pci id and determine the card type */
fun = pci_conf_read(pa->pa_pc, pa->pa_tag, PCI_ID_REG);
rev = PCI_REVISION(pci_conf_read(pa->pa_pc, pa->pa_tag, PCI_CLASS_REG));
common_bktr_attach(bktr, unit, fun, rev);
#if NRADIO > 0
if (bktr->card.tuner->pllControl[3] != 0x00)
radio_attach_mi(&bktr_hw_if, bktr, &bktr->bktr_dev);
#endif
}
/*
* Special Memory Allocation
*/
vaddr_t
get_bktr_mem(bktr_ptr_t bktr, bus_dmamap_t *dmapp, unsigned int size)
{
bus_dma_tag_t dmat = bktr->dmat;
bus_dma_segment_t seg;
bus_size_t align;
int rseg;
caddr_t kva;
/*
* Allocate a DMA area
*/
align = 1 << 24;
if (bus_dmamem_alloc(dmat, size, align, 0, &seg, 1,
&rseg, BUS_DMA_NOWAIT)) {
align = PAGE_SIZE;
if (bus_dmamem_alloc(dmat, size, align, 0, &seg, 1,
&rseg, BUS_DMA_NOWAIT)) {
printf("%s: Unable to dmamem_alloc of %d bytes\n",
bktr_name(bktr), size);
return 0;
}
}
if (bus_dmamem_map(dmat, &seg, rseg, size,
&kva, BUS_DMA_NOWAIT|BUS_DMA_COHERENT)) {
printf("%s: Unable to dmamem_map of %d bytes\n",
bktr_name(bktr), size);
bus_dmamem_free(dmat, &seg, rseg);
return 0;
}
/*
* Create and locd the DMA map for the DMA area
*/
if (bus_dmamap_create(dmat, size, 1, size, 0, BUS_DMA_NOWAIT, dmapp)) {
printf("%s: Unable to dmamap_create of %d bytes\n",
bktr_name(bktr), size);
bus_dmamem_unmap(dmat, kva, size);
bus_dmamem_free(dmat, &seg, rseg);
return 0;
}
if (bus_dmamap_load(dmat, *dmapp, kva, size, NULL, BUS_DMA_NOWAIT)) {
printf("%s: Unable to dmamap_load of %d bytes\n",
bktr_name(bktr), size);
bus_dmamem_unmap(dmat, kva, size);
bus_dmamem_free(dmat, &seg, rseg);
bus_dmamap_destroy(dmat, *dmapp);
return 0;
}
return (vaddr_t)kva;
}
void
free_bktr_mem(bktr_ptr_t bktr, bus_dmamap_t dmap, vaddr_t kva)
{
bus_dma_tag_t dmat = bktr->dmat;
bus_dmamem_unmap(dmat, (caddr_t)kva, dmap->dm_mapsize);
bus_dmamem_free(dmat, dmap->dm_segs, 1);
bus_dmamap_destroy(dmat, dmap);
}
/*---------------------------------------------------------
**
** BrookTree 848 character device driver routines
**
**---------------------------------------------------------
*/
#define VIDEO_DEV 0x00
#define TUNER_DEV 0x01
#define VBI_DEV 0x02
#define UNIT(x) ((minor((x)) < 16) ? minor((x)) : ((minor((x)) - 16) / 2))
#define FUNCTION(x) ((minor((x)) < 16) ? VIDEO_DEV : ((minor((x)) & 0x1) ? \
VBI_DEV : TUNER_DEV))
/*
*
*/
int
bktr_open(dev_t dev, int flags, int fmt, struct proc *p)
{
bktr_ptr_t bktr;
int unit;
unit = UNIT(dev);
/* unit out of range */
if ((unit >= bktr_cd.cd_ndevs) || (bktr_cd.cd_devs[unit] == NULL))
return(ENXIO);
bktr = bktr_cd.cd_devs[unit];
if (!(bktr->flags & METEOR_INITIALIZED)) /* device not found */
return(ENXIO);
switch (FUNCTION(dev)) {
case VIDEO_DEV:
return(video_open(bktr));
case TUNER_DEV:
return(tuner_open(bktr));
case VBI_DEV:
return(vbi_open(bktr));
}
return(ENXIO);
}
/*
*
*/
int
bktr_close(dev_t dev, int flags, int fmt, struct proc *p)
{
bktr_ptr_t bktr;
int unit;
unit = UNIT(dev);
bktr = bktr_cd.cd_devs[unit];
switch (FUNCTION(dev)) {
case VIDEO_DEV:
return(video_close(bktr));
case TUNER_DEV:
return(tuner_close(bktr));
case VBI_DEV:
return(vbi_close(bktr));
}
return(ENXIO);
}
/*
*
*/
int
bktr_read(dev_t dev, struct uio *uio, int ioflag)
{
bktr_ptr_t bktr;
int unit;
unit = UNIT(dev);
bktr = bktr_cd.cd_devs[unit];
switch (FUNCTION(dev)) {
case VIDEO_DEV:
return(video_read(bktr, unit, dev, uio));
case VBI_DEV:
return(vbi_read(bktr, uio, ioflag));
}
return(ENXIO);
}
/*
*
*/
int
bktr_write(dev_t dev, struct uio *uio, int ioflag)
{
/* operation not supported */
return(EOPNOTSUPP);
}
/*
*
*/
int
bktr_ioctl(dev_t dev, ioctl_cmd_t cmd, caddr_t arg, int flag, struct proc* pr)
{
bktr_ptr_t bktr;
int unit;
unit = UNIT(dev);
bktr = bktr_cd.cd_devs[unit];
if (bktr->bigbuf == 0) /* no frame buffer allocated (ioctl failed) */
return(ENOMEM);
switch (FUNCTION(dev)) {
case VIDEO_DEV:
return(video_ioctl(bktr, unit, cmd, arg, pr));
case TUNER_DEV:
return(tuner_ioctl(bktr, unit, cmd, arg, pr));
}
return(ENXIO);
}
/*
*
*/
paddr_t
bktr_mmap(dev_t dev, off_t offset, int nprot)
{
int unit;
bktr_ptr_t bktr;
unit = UNIT(dev);
if (FUNCTION(dev) > 0) /* only allow mmap on /dev/bktr[n] */
return(-1);
bktr = bktr_cd.cd_devs[unit];
if (offset < 0)
return(-1);
if (offset >= bktr->alloc_pages * PAGE_SIZE)
return(-1);
return (bus_dmamem_mmap(bktr->dmat, bktr->dm_mem->dm_segs, 1,
offset, nprot, BUS_DMA_WAITOK));
}
#if NRADIO > 0
int
bktr_set_info(void *v, struct radio_info *ri)
{
struct bktr_softc *sc = v;
struct TVTUNER *tv = &sc->tuner;
u_int32_t freq;
u_int32_t chan;
if (ri->mute) {
/* mute the audio stream by switching the mux */
set_audio(sc, AUDIO_MUTE);
} else {
/* unmute the audio stream */
set_audio(sc, AUDIO_UNMUTE);
init_audio_devices(sc);
}
set_audio(sc, AUDIO_INTERN); /* use internal audio */
temp_mute(sc, TRUE);
if (ri->tuner_mode == RADIO_TUNER_MODE_TV) {
if (ri->chan) {
if (ri->chan < MIN_TV_CHAN)
ri->chan = MIN_TV_CHAN;
if (ri->chan > MAX_TV_CHAN)
ri->chan = MAX_TV_CHAN;
chan = ri->chan;
ri->chan = tv_channel(sc, chan);
tv->tuner_mode = BT848_TUNER_MODE_TV;
} else {
ri->chan = tv->channel;
}
} else {
if (ri->freq) {
if (ri->freq < MIN_FM_FREQ)
ri->freq = MIN_FM_FREQ;
if (ri->freq > MAX_FM_FREQ)
ri->freq = MAX_FM_FREQ;
freq = ri->freq / 10;
ri->freq = tv_freq(sc, freq, FM_RADIO_FREQUENCY) * 10;
tv->tuner_mode = BT848_TUNER_MODE_RADIO;
} else {
ri->freq = tv->frequency;
}
}
if (ri->chnlset >= CHNLSET_MIN && ri->chnlset <= CHNLSET_MAX)
tv->chnlset = ri->chnlset;
else
tv->chnlset = DEFAULT_CHNLSET;
temp_mute(sc, FALSE);
return (0);
}
int
bktr_get_info(void *v, struct radio_info *ri)
{
struct bktr_softc *sc = v;
struct TVTUNER *tv = &sc->tuner;
int status;
status = get_tuner_status(sc);
#define STATUSBIT_STEREO 0x10
ri->mute = (int)sc->audio_mute_state ? 1 : 0;
ri->caps = RADIO_CAPS_DETECT_STEREO | RADIO_CAPS_HW_AFC;
ri->info = (status & STATUSBIT_STEREO) ? RADIO_INFO_STEREO : 0;
/* not yet supported */
ri->volume = ri->rfreq = ri->lock = 0;
switch (tv->tuner_mode) {
case BT848_TUNER_MODE_TV:
ri->tuner_mode = RADIO_TUNER_MODE_TV;
ri->freq = tv->frequency * 1000 / 16;
break;
case BT848_TUNER_MODE_RADIO:
ri->tuner_mode = RADIO_TUNER_MODE_RADIO;
ri->freq = tv->frequency * 10;
break;
}
/*
* The field ri->stereo is used to forcible switch to
* mono/stereo, not as an indicator of received signal quality.
* The ri->info is for that purpose.
*/
ri->stereo = 1; /* Can't switch to mono, always stereo */
ri->chan = tv->channel;
ri->chnlset = tv->chnlset;
return (0);
}
#endif /* NRADIO */
```
|
John Arthur McNaught (1892–1972) was a Scottish footballer who played as an outside right. His longest spells were at Falkirk and Kilmarnock; he won the Scottish Cup with both clubs, being one of few players to win that trophy with two different clubs not including Rangers or Celtic.
Career
Born in Glasgow, McNaught began his career in the Junior grade. He represented Scotland at that level in 1911 while playing for Cambuslang Rangers, where he won the Glasgow Junior League and his teammates included future Liverpool goalkeeper Kenny Campbell.
In the summer of 1911 he signed for Falkirk as a replacement for Jock Simpson who had moved to Blackburn Rovers; at the time, the Brockville Park outfit were one of the top clubs in Scotland having finished runners-up in the Scottish Football League in 1909–10 and third in 1910–11. With the Bairns, McNaught lifted the Scottish Cup after a 2–0 win over Raith Rovers in the 1913 final at Celtic Park. It was the club's first major honour. Falkirk also won several minor regional trophies during the period but never finished higher than fifth until McNaught made his last appearance at the end of the 1915–16 season, with World War I well underway (the Cup was cancelled during the conflict, however the League continued). In 1919, while still registered with Falkirk, he spent short spells with Vale of Leven and St Mirren (playing no part in the Paisley club's run to the 1919 Victory Cup).
With the war at an end, McNaught signed for Kilmarnock, finding success in his first season with the Ayrshire side as they won the 1919–20 Scottish Cup, defeating Albion Rovers 3–2 at Hampden Park. Like Falkirk, it was Killie's maiden victory in the competition, at the 42nd attempt. However, their performances in the league were mediocre during his three campaigns at Rugby Park (8th, 11th and 17th).
Now in his 30s, in 1922 he moved to second tier Johnstone, spending two years there before one-year spells at the same level with Clyde and East Stirlingshire.
Other player
There was another Scottish player in the period named John McNaught who had the same position on the field, and had a spell at Queens Park Rangers between 1908 and 1911, playing in the 1908 FA Charity Shield replay; this is not the same man as described above.
References
1892 births
Date of birth unknown
1972 deaths
Date of death unknown
Scottish men's footballers
Footballers from Glasgow
Men's association football wingers
Cambuslang Rangers F.C. players
Falkirk F.C. players
Vale of Leven F.C. wartime guest players
St Mirren F.C. wartime guest players
Kilmarnock F.C. players
Johnstone F.C. players
Clyde F.C. players
East Stirlingshire F.C. players
Scottish Junior Football Association players
Scotland men's junior international footballers
Scottish Football League players
|
Åke Helge Ortmark (14 May 1929 – 18 October 2018) was a Swedish journalist, author and radio and television presenter. During a long career he worked for both television and radio; he also authored several books.
Early life
Ortmark was born in Stockholm, and grew up in Ålsten.
During the early 1950s he studied economics at the University of California in the United States. Ortmark earned a Master of Science in Business and Economics at Handelshögskolan in Stockholm in 1954.
Career
Ortmark started working at Sveriges Radio in 1958. He was for some time a newsreader for Aktuellt which was broadcast on Sveriges Television. Together with Herbert Söderström, Ortmark pioneered the technique named "Skjutjärnsjournalistik" (hard-hitting journalism) in Swedish, on Sveriges Radio in 1962. As part of "De tre O:na", he became known for using the technique alongside Lars Orup and Gustaf Olivecrona in live broadcast on Sveriges Television in 1966 while interviewing Prime Minister Tage Erlander.
Ortmark became the editor-in-chief of the weekly newspaper Veckans Affärer between 1974 and 1976. In 1997 he was the television presenter for his own interview show O som i Ortmark which was broadcast on TV8 until 2006, by which time Ortmark decided to leave to work for Axess TV.
Ortmark received the television award Kristallen in 2005 in the category Stiftelsens hederspris (the Foundation's Honour Award) for his work in TV and dedication for news and discussions.
On 25 June 2006, Ortmark took part in Sommar i P1 talking about his career and life. In 2008, he was member of Humanisternas (the humanists) council.
In 2013, Ortmark published his memoirs called Makten och lögnen – ett liv i televisionens Sverige which told about his career in journalism.
Personal life
Åke Ortmark in 1961 married Sinikka Tenhunen. After his divorce, he married Annika Roth in 1974. Ortmark was the father of three children.
Ortmark had a black belt in karate.
Ortmark died on 18 October 2018 after a short time of illness at the age of 89.
Bibliography
1963 – Sveket mot konsumenterna
1967 – Maktspelet i Sverige
1969 – De okända makthavarna
1971 – Maktens redskap,
1972 – Den inre cirkeln,
1977 – Lamco!,
1981 – Skuld och makt,
1985 – Maktens människor,
1996 – Ja-sägarna,
2013 – Makten och lögnen: ett liv i televisionens Sverige,
Filmography
1973 – Makt på spel (TV series)
References
External links
1929 births
2018 deaths
20th-century Swedish writers
Stockholm School of Economics alumni
Swedish journalists
Swedish memoirists
Swedish newspaper editors
Swedish radio presenters
Swedish television hosts
University of California alumni
Writers from Stockholm
|
```python
# -*- coding: utf-8 -*-
import datetime
import time
import threading
from app.base.logger import log
class TPCron(threading.Thread):
def __init__(self):
super().__init__(name='tp-cron-thread')
import builtins
if '__tp_cron__' in builtins.__dict__:
raise RuntimeError('TPCron object exists, you can not create more than one instance.')
# jobsession_id f(), t(), i()
self._jobs = dict()
self._lock = threading.RLock()
self._stop_flag = False
def init(self):
return True
def add_job(self, name, func, first_interval_seconds=None, interval_seconds=60):
# first_interval None
# interval
with self._lock:
if name in self._jobs:
return False
self._jobs[name] = {'f': func, 't': 0, 'i': interval_seconds}
_now = int(datetime.datetime.now().timestamp())
if first_interval_seconds is not None:
self._jobs[name]['t'] = _now + first_interval_seconds - interval_seconds
def stop(self):
self._stop_flag = True
self.join()
log.v('{} stopped.\n'.format(self.name))
def run(self):
while not self._stop_flag:
time.sleep(1)
with self._lock:
_now = int(datetime.datetime.now().timestamp())
for j in self._jobs:
# log.v('--now: {}, job-name: {}, job-t: {}, job-i: {}\n'.format(_now, j, self._jobs[j]['t'], self._jobs[j]['i']))
if _now - self._jobs[j]['t'] >= self._jobs[j]['i']:
self._jobs[j]['t'] = _now
try:
self._jobs[j]['f']()
except:
log.e('got exception when exec job: {}\n'.format(j))
def tp_cron():
"""
TPCron
:rtype : TPCron
"""
import builtins
if '__tp_cron__' not in builtins.__dict__:
builtins.__dict__['__tp_cron__'] = TPCron()
return builtins.__dict__['__tp_cron__']
```
|
Bardhyl Demiraj (born 29 March 1958) is an Albanian linguist and Albanologist. He is considered one of the leading experts in the study of Albanian etymology.
Biography
Bardhyl Demiraj was born on 29 March 1958 in Tirana, the son of linguist Shaban Demiraj. He studied Albanian language and literature at the University of Tirana from 1977 to 1981, earning a master's degree in 1982. From 1984 to 1986, he specialized in Indo-European, Romanian and Balkan linguistics at the University of Vienna. From 1991 to 1993, he did postgraduate research at the University of Bonn, earning a doctorate in Tirana in 1994 after a dissertation on the historical development of the Albanian number system.
From 1994, he collaborated on the Indo-European Etymological Dictionary at the University of Leiden, while continuing his etymological research in Bonn. In 2001, he was appointed Professor of Albanian at the Institute for Comparative and Indo-European Linguistics of the Ludwig Maximilian University of Munich.
Further reading
Interview with Panorama.al (in Albanian)
References
1958 births
Albanologists
Linguists from Albania
Living people
Linguists of Indo-European languages
|
```go
package utils
import (
"context"
"github.com/hashicorp/go-multierror"
)
// NopShutdown implements the Shutdowner interface but does not execute any
// process on shutdown.
var NopShutdown = NewGroupShutdown()
// Shutdowner is an interface with a Shutdown method to gracefully shutdown
// a running process.
type Shutdowner interface {
Shutdown(ctx context.Context) error
}
// GroupShutdown allow to group multiple Shutdowner into a single one.
type GroupShutdown struct {
s []Shutdowner
}
// NewGroupShutdown returns a new GroupShutdown
func NewGroupShutdown(s ...Shutdowner) *GroupShutdown {
return &GroupShutdown{s}
}
// Shutdown closes all the encapsulated [Shutdowner] in parallel an returns
// the concatenated errors.
func (g *GroupShutdown) Shutdown(ctx context.Context) error {
errs := new(multierror.Group)
for _, s := range g.s {
// Shadow the variable to avoid a datarace
s := s
errs.Go(func() error { return s.Shutdown(ctx) })
}
return errs.Wait().ErrorOrNil()
}
```
|
AVA Productions is an Indian film production company based in Chennai. The company was established in 2007 by A. V. Anoop, who is presently the Managing Director of the AVA Group. The company predominantly produces Malayalam films.
Films
References
External links
Film production companies based in Chennai
Indian companies established in 2007
2007 establishments in Tamil Nadu
Mass media companies established in 2007
|
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_DEBUG_DEBUG_TYPE_PROFILE_H_
#define V8_DEBUG_DEBUG_TYPE_PROFILE_H_
#include <vector>
#include "src/debug/debug-interface.h"
#include "src/handles.h"
#include "src/objects.h"
namespace v8 {
namespace internal {
// Forward declaration.
class Isolate;
struct TypeProfileEntry {
explicit TypeProfileEntry(
int pos, std::vector<v8::internal::Handle<internal::String>> t)
: position(pos), types(std::move(t)) {}
int position;
std::vector<v8::internal::Handle<internal::String>> types;
};
struct TypeProfileScript {
explicit TypeProfileScript(Handle<Script> s) : script(s) {}
Handle<Script> script;
std::vector<TypeProfileEntry> entries;
};
class TypeProfile : public std::vector<TypeProfileScript> {
public:
static std::unique_ptr<TypeProfile> Collect(Isolate* isolate);
static void SelectMode(Isolate* isolate, debug::TypeProfileMode mode);
private:
TypeProfile() = default;
};
} // namespace internal
} // namespace v8
#endif // V8_DEBUG_DEBUG_TYPE_PROFILE_H_
```
|
```python
# flake8: noqa: E266, C417, B950
from mixtral_moe_model import ConditionalFeedForward
import torch
import torch.nn as nn
import torch.nn.functional as F
##### Quantization Primitives ######
def dynamically_quantize_per_channel(x, quant_min, quant_max, target_dtype):
# assumes symmetric quantization
# assumes axis == 0
# assumes dense memory format
# TODO(future): relax ^ as needed
# default setup for affine quantization of activations
eps = torch.finfo(torch.float32).eps
# get min and max
min_val, max_val = torch.aminmax(x, dim=1)
# calculate scales and zero_points based on min and max
# reference: path_to_url
min_val_neg = torch.min(min_val, torch.zeros_like(min_val))
max_val_pos = torch.max(max_val, torch.zeros_like(max_val))
device = min_val_neg.device
# reference: path_to_url
max_val_pos = torch.max(-min_val_neg, max_val_pos)
scales = max_val_pos / (float(quant_max - quant_min) / 2)
# ensure scales is the same dtype as the original tensor
scales = torch.clamp(scales, min=eps).to(x.dtype)
zero_points = torch.zeros(min_val_neg.size(), dtype=torch.int64, device=device)
# quantize based on qmin/qmax/scales/zp
# reference: path_to_url
x_div = x / scales.unsqueeze(-1)
x_round = torch.round(x_div)
x_zp = x_round + zero_points.unsqueeze(-1)
quant = torch.clamp(x_zp, quant_min, quant_max).to(target_dtype)
return quant, scales, zero_points
##### Weight-only int8 per-channel quantized code ######
def replace_linear_weight_only_int8_per_channel(module):
for name, child in module.named_children():
if isinstance(child, nn.Linear) and name != "gate":
setattr(
module,
name,
WeightOnlyInt8Linear(
child.in_features, child.out_features, target_dtype=torch.int8
),
)
elif isinstance(child, ConditionalFeedForward):
num_experts, intermediate_size, dim = child.w1.shape
setattr(
module,
name,
ConditionalFeedForwardInt8(
num_experts, intermediate_size, dim, target_dtype=torch.int8
),
)
else:
replace_linear_weight_only_int8_per_channel(child)
class WeightOnlyInt8QuantHandler:
def __init__(self, mod):
self.mod = mod
@torch.no_grad()
def create_quantized_state_dict(self):
cur_state_dict = self.mod.state_dict()
for fqn, mod in self.mod.named_modules():
if isinstance(mod, torch.nn.Linear) and not fqn.endswith(".gate"):
int8_weight, scales, _ = dynamically_quantize_per_channel(
mod.weight.float(), -128, 127, torch.int8
)
cur_state_dict[f"{fqn}.weight"] = int8_weight
cur_state_dict[f"{fqn}.scales"] = scales.to(mod.weight.dtype)
elif isinstance(mod, ConditionalFeedForward):
for weight_idx in range(0, 3):
weight_name = f"w{weight_idx + 1}"
scales_name = f"scales{weight_idx + 1}"
weight = getattr(mod, weight_name)
num_experts, intermediate_size, dim = weight.shape
bit8_weight_list = []
scales_list = []
for expert_idx in range(num_experts):
bit8_weight, scales, _ = dynamically_quantize_per_channel(
weight[expert_idx].float(), -128, 127, torch.int8
)
bit8_weight_list.append(
bit8_weight.reshape(1, intermediate_size, dim)
)
scales_list.append(scales.reshape(1, intermediate_size))
cur_state_dict[f"{fqn}.{weight_name}"] = torch.cat(
bit8_weight_list, dim=0
)
cur_state_dict[f"{fqn}.{scales_name}"] = torch.cat(
scales_list, dim=0
)
return cur_state_dict
def convert_for_runtime(self):
replace_linear_weight_only_int8_per_channel(self.mod)
return self.mod
class WeightOnlyInt8Linear(torch.nn.Module):
__constants__ = ["in_features", "out_features"]
in_features: int
out_features: int
weight: torch.Tensor
def __init__(
self,
in_features: int,
out_features: int,
bias: bool = True,
device=None,
dtype=None,
target_dtype=None,
) -> None:
assert target_dtype is not None
factory_kwargs = {"device": device, "dtype": dtype}
super().__init__()
self.in_features = in_features
self.out_features = out_features
self.register_buffer(
"weight", torch.empty((out_features, in_features), dtype=target_dtype)
)
self.register_buffer("scales", torch.ones(out_features, dtype=torch.bfloat16))
def forward(self, input: torch.Tensor) -> torch.Tensor:
return F.linear(input, self.weight.to(dtype=input.dtype)) * self.scales
class ConditionalFeedForwardInt8(nn.Module):
def __init__(self, num_experts, intermediate_size, dim, target_dtype):
super().__init__()
self.target_dtype = target_dtype
self.register_buffer(
"w1", torch.empty(num_experts, intermediate_size, dim, dtype=target_dtype)
)
self.register_buffer(
"w2", torch.empty(num_experts, dim, intermediate_size, dtype=target_dtype)
)
self.register_buffer(
"w3", torch.empty(num_experts, intermediate_size, dim, dtype=target_dtype)
)
self.register_buffer(
"scales1", torch.empty(num_experts, intermediate_size, dtype=torch.bfloat16)
)
self.register_buffer(
"scales2", torch.empty(num_experts, dim, dtype=torch.bfloat16)
)
self.register_buffer(
"scales3", torch.empty(num_experts, intermediate_size, dtype=torch.bfloat16)
)
def forward(self, x, expert_indices):
w1_weights = self.w1.to(x.dtype)[expert_indices] # [T, A, D, D]
w3_weights = self.w3.to(x.dtype)[expert_indices] # [T, A, D, D]
w2_weights = self.w2.to(x.dtype)[expert_indices]
x1 = F.silu(
torch.einsum("ti,taoi -> tao", x, w1_weights)
* self.scales1[expert_indices].to(x.dtype)
)
x3 = torch.einsum("ti, taoi -> tao", x, w3_weights) * self.scales3[
expert_indices
].to(x.dtype)
expert_outs = torch.einsum(
"tao, taio -> tai", (x1 * x3), w2_weights
) * self.scales2[expert_indices].to(
x.dtype
) # [T, A, D, D]
return expert_outs
```
|
Consolacion, officially the Municipality of Consolacion (; ), is a 1st class municipality in the province of Cebu, Philippines. According to the 2020 census, it has a population of 148,012 people.
Consolacion is bordered on the north by the town of Liloan, to the west by Cebu City, on the east by the Camotes Sea, and on the south by the city of Mandaue. It is from Cebu City.
Etymology
The town's name came from the name of daughter, Consolacion, of the then Cebu governor when it was re-established as an independent municipality in 1920.
History
Consolacion was a component barangay first founded in 1871 with a population of 14,248. Before this, it was only a barrio of the municipality of Mandaue. The barrio, formerly named "Kampi-ig" named after a kind of crab living in mangroves, which was abundant in the area, became a separate town in 1871. However, in 1902 and 1903, unable to maintain its status as an independent municipality, it reverted to Mandaue.
In 1920, Consolacion was again made an independent municipality after a petition was accepted by the governor. So grateful were the townspeople to the Cebuano governor that they named their new town after his daughter – Consolacion – and they also chose San Narciso as their patron saint, the namesake of the governor's wife, Narcisa.
A year after the construction of the Casa Real or municipal hall, the people built their first church. Because it was made of wood, nipa, and bamboo, it was totally destroyed by a typhoon in 1888. A second one was also destroyed by a typhoon in 1892. A third one was built just before World War II, on its current site.
The present municipal hall is already the third one. The first was destroyed by the typhoon of 1892. The second one was also destroyed, by the Japanese during World War II. Today, Consolacion is a robust residential urban municipality with a vigorous economy, providing a place to live for people employed in the neighboring cities of Mandaue, Lapu-Lapu and Cebu.
Cityhood
On July 6, 2022, House Bill No. 1324 was filed by Reps. Daphne Lagon and Sonny Lagon which seeks to convert the municipality of Consolacion to be known as the City of Consolacion. The bill is currently pending since August 1, 2022.
Geography
70% of the total area of the town is above or highland mountains and 18% foreshore land. The contours are irregular and the highest point is about above sea level.
Barangays
Consolacion is politically subdivided into 21 barangays. Each barangay consists of puroks and some have sitios.
Climate
Demographics
The population of Consolacion is fast-growing with an intercensal growth rate of 50.45% from 1980 to 1990, repeated and more in subsequent decades.
The demographic distribution profile of Consolacion shows sparsely populated upland barangays, and densely populated lowland barangays within the commercial area along the existing national highway.
Economy
Consolacion's recent economic trend is towards the development of operation of housing/subdivision facilities even with the presence of several medium size manufacturing industries. Consolacion is predicted to become a residential urban municipality in the next 5–10 years.
Infrastructure
Road Network:
National Road:
Provincial Road:
Municipal Road :
Barangay Road :
Utilities
Malls: 3
In June 2012 SM Supermalls opened its second mall in Cebu – SM City Consolacion, located in Lamac.
Public Market: 1
Multi-purpose Building: 1
Recreation Courts/Centers : 22
Education
Elementary schools: 16
High schools: 10
Vocational: 1
College: 1
Culture
Sarok Festival
The Sarok Festival is celebrated on Consolacion's foundation day. Sarok is a hat made of bamboo strips and dried banana leaves. Sarok Festival a Mardi Gras of colors and street dancing along the main road of Consolacion is celebrated every February 14 in commemoration of Consolacion founding anniversary. The main attraction of this festival is the colorful Sarok and its wide uses.
History
To protect farmers and the folks from the sun and the rain, the sarok, a conical hat made from bamboo strips and dried banana leaves, becomes the needed fad for the people of Consolacion especially that the town is an agricultural land. The festival was traditionally celebrated every February 14 to coincide with its charter day celebrations but this now celebrated in October. However, the Sarok Festival evolved into a free interpretation dance, with the musical concept inspired from the Miligoy de Cebu, a published Filipino folk dance originating from the same place.
Contribution to Cultural Heritage
Consolacion is one of the contributor in Cultural History. It had created a dance called "Miligoy de Cebu". This dance is usually performed by pairs of dancers during social gatherings like baptism, weddings, and special programs in the poblacion. Dancers hold a pair of bamboo castanets in each hand.
Notable personalities
Juan Karlos Labajo - singer and actor
Mark "Honcho" Maglasang - Ex Battalion founder and leader
References
Sources
External links
[ Philippine Standard Geographic Code]
Municipalities of Cebu
Municipalities in Metro Cebu
|
```javascript
import * as Three from 'three';
import { List } from 'immutable';
import { COLORS } from '../../../shared-style';
export default function (width, height, grid, font) {
var step = grid.properties.get('step');
var colors = grid.properties.has('color') ? new List([grid.properties.get('color')]) : grid.properties.get('colors');
var streak = new Three.Object3D();
streak.name = 'streak';
var counter = 0;
for (var i = 0; i <= height; i += step) {
var geometry = new Three.Geometry();
geometry.vertices.push(new Three.Vector3(0, 0, -i));
geometry.vertices.push(new Three.Vector3(width, 0, -i));
var color = colors.get(counter % colors.size);
var material = new Three.LineBasicMaterial({ color: color });
if (counter % 5 == 0) {
var shape = new Three.TextGeometry('' + counter * step, {
size: 16,
height: 1,
font: font
});
var wrapper = new Three.MeshBasicMaterial({ color: COLORS.black });
var words = new Three.Mesh(shape, wrapper);
words.rotation.x -= Math.PI / 2;
words.position.set(-90, 0, -i);
streak.add(words);
}
streak.add(new Three.LineSegments(geometry, material));
counter++;
}
return streak;
}
```
|
```go
//
// Last.Backend LLC CONFIDENTIAL
// __________________
//
// [2014] - [2019] Last.Backend LLC
// All Rights Reserved.
//
// NOTICE: All information contained herein is, and remains
// the property of Last.Backend LLC and its suppliers,
// if any. The intellectual and technical concepts contained
// herein are proprietary to Last.Backend LLC
// and its suppliers and may be covered by Russian Federation and Foreign Patents,
// patents in process, and are protected by trade secret or copyright law.
// Dissemination of this information or reproduction of this material
// is strictly forbidden unless prior written permission is obtained
// from Last.Backend LLC.
//
package network
import (
"context"
"github.com/lastbackend/lastbackend/pkg/distribution/types"
"github.com/lastbackend/lastbackend/pkg/log"
"github.com/lastbackend/lastbackend/pkg/network/state"
)
const logLevel = 3
func (n *Network) Subnets() *state.SubnetState {
return n.state.Subnets()
}
func (n *Network) Info(ctx context.Context) *types.NetworkState {
return n.cni.Info(ctx)
}
func (n *Network) SubnetRestore(ctx context.Context) error {
sn, err := n.cni.Subnets(ctx)
if err != nil {
log.Errorf("Can-not get subnet list from CNI err: %v", err)
}
for cidr, s := range sn {
n.state.Subnets().SetSubnet(cidr, s)
}
return nil
}
func (n *Network) SubnetManage(ctx context.Context, cidr string, sn *types.SubnetManifest) error {
subnets := n.state.Subnets().GetSubnets()
if state, ok := subnets[cidr]; ok {
log.Debugf("check subnet exists: %s", cidr)
if sn.State == types.StateDestroy {
log.Debugf("destroy subnet: %s", cidr)
if err := n.cni.Destroy(ctx, &state); err != nil {
log.Errorf("can not destroy subnet: %s", err.Error())
return err
}
n.state.Subnets().DelSubnet(cidr)
return nil
}
log.Debugf("check subnet manifest: %s", cidr)
// TODO: check if network manifest changes
// if changes then update routes and interfaces
return nil
}
if sn.State == types.StateDestroy {
return nil
}
log.Debugf("create subnet: %s", cidr)
state, err := n.cni.Create(ctx, sn)
if err != nil {
log.Errorf("Can not create network subnet: %s", err.Error())
return err
}
n.state.Subnets().AddSubnet(cidr, state)
return nil
}
func (n *Network) SubnetDestroy(ctx context.Context, cidr string) error {
sn := n.state.Subnets().GetSubnet(cidr)
if err := n.cni.Destroy(ctx, sn); err != nil {
log.Errorf("Can not destroy network subnet: %s", err.Error())
return err
}
n.state.Subnets().DelSubnet(cidr)
return nil
}
```
|
Herminia Tormes García (19 October 1891 – 7 November 1964) was a Puerto Rican lawyer and the first woman to practice the profession on the island. After earning the right to practice law in 1917, she became the first woman to bring a case before the Bostonian jurisdiction of the United States Court of Appeals in 1924. In 1926, she was appointed as the first woman to serve as a judge in Puerto Rico. Throughout her career, Tormes worked for women who were incarcerated or engaged in prostitution, advocating for their rights. In 1964, the Bar Association of Puerto Rico named a room after her at its offices in San Juan.
Early life
Herminia Tormes García was born on 19 October 1891 in Ponce in the Spanish colony of Puerto Rico to Ana Jacobina García Esclabón and Joaquín Tormes Carbo. Her father was of Spanish heritage and her mother was an Afro-Puerto Rican woman who had formerly been a slave. After graduating from high school in Ponce, Tormes earned a degree to teach English from the Normal School of the University of Puerto Rico. She first married Leopoldo Simón Lanausse y Belfrey, with whom she had a son Cárlos Servando Lanausse y Tormes in 1914. In 1917, she graduated in the second class of students to have completed their education at the University of Puerto Rico School of Law. She took her oath on 6 December 1917, becoming the first woman eligible to practice law in Puerto Rico and two weeks later, in the District Court of Ponce on 21 December 1917 divorced Lanausse.
Career
Tormes and her brother Leopoldo, also an attorney, worked together, often defending the rights of marginalized women. In 1918, in the city of Ponce, an anti-prostitution campaign began and hundreds of women were arrested and charged as prostitutes. The campaign targeted any women who had engaged in sexual activity without being married, regardless of whether they were selling sex. Unfounded accusations could result in women being accused and undergoing invasive physical examinations to prove their innocence. Their male partners were not charged with crimes and women convicted of prostitution had no means to appeal the decisions. By August, the campaign was island-wide and the Tormes siblings, along with Rafael Martínez Nadal, organized a demonstration to protest the violation of women's human rights. The siblings organized their clients, filing appeals and petitions for pardon, and pressed for hearings for women, alleging that the state was in violation of their clients' civil liberties. Tormes also provided press releases to the local media, pleading on behalf of the women. Leopoldo was accused of subverting the war efforts because of his vigorous defense of women's rights, but the pressure of numerous lawsuits and media coverage caused the government to suspend mass arrests.
The jails of Arecibo and Ponce were converted to hospitals for "wayward women" and began to treat women with venereal disease and provide training to rehabilitate them, providing them with skills that enabled them to earn a living upon release. Tormes headed the efforts to rehabilitate the women and stressed the importance of providing them with education and marketable skills. At the end of World War I, she founded a school with Moisés Echevarría to offer vocational training to inmates, refusing to call the women prostitutes. She rallied local teachers to volunteer with the inmates and teach the prisoners to read and write, while simultaneously pressing the government to appoint a full-time teacher for them. She organized networks of businesses willing to offer women work after their incarceration, recognizing that prostitution was a symptom of the women's poverty and illiteracy. After successfully convincing the department of education to provide teachers for women prisoners, Tormes pressed the Council of National Defense to implement economic development projects for the entire island.
In 1924, Tormes became the first woman in the First Circuit of the U.S. Court of Appeals to argue a case and was the first woman licensed to practice in the Appellate Court of Boston. Between 1926 and 1941, Tormes served as the municipal judge in the municipality of Juana Díaz. With her appointment, she became the first woman judge of Puerto Rico and in 1929 became a district judge in Juana Díaz, serving also in the courts of Coamo, San Sebastián and Vega Baja. On 13 October 1930, Tormes married Guillermo Beauchamp Quiñones, and the following year, the couple had a son, Guillermo Anthony Beauchamp Tormes. She practiced law for over forty years, retiring after she was diagnosed with cancer in 1963.
Death and legacy
Tormes died from cancer in Ponce on 7 November 1964, and was buried at the Cementerio Civil de Ponce. In 1964, the Bar Association of Puerto Rico named a room after her at its offices in San Juan. She is remembered for her role in championing law as a profession for Puerto Rican women. In 2013, the Bar Association hosted an exhibit for Lawyer's week, In Memoriam, which included Tormes, to honor the prominent Puerto Rican jurists who had been instrumental in developing the country's equal access to justice.
References
Citations
Bibliography
1891 births
1964 deaths
University of Puerto Rico alumni
Puerto Rican feminists
20th-century Puerto Rican lawyers
Burials at Cementerio Civil de Ponce
Puerto Rican people of Spanish descent
20th-century Puerto Rican women lawyers
20th-century American women lawyers
|
Ştefan Tudor (3 March 194315 February 2021) was a Romanian rower.
Career
He competed at the 1968, 1972 and 1976 Olympics in the coxed fours, coxed pairs and coxless fours events, respectively, and won a bronze medal in 1972. In 1970 he became the first world champion in rowing from Romania. He also won two bronze medals at the European championships in 1967 and 1973. He died less than one month short of his 78th birthday.
References
External links
1943 births
2021 deaths
Romanian male rowers
Olympic rowers for Romania
Rowers at the 1968 Summer Olympics
Rowers at the 1972 Summer Olympics
Rowers at the 1976 Summer Olympics
Olympic bronze medalists for Romania
Olympic medalists in rowing
World Rowing Championships medalists for Romania
Medalists at the 1972 Summer Olympics
European Rowing Championships medalists
Date of death missing
Place of death missing
Sportspeople from Prahova County
|
Enemy of the State is the sixth studio album by American rapper C-Bo, released July 25, 2000 on C-Bo's own label West Coast Mafia Records and Warlock Records. It peaked at number 24 on the Billboard Top R&B/Hip-Hop Albums and at number 91 on the Billboard 200. Enemy of the State was C-Bo's first album on his new label, West Coast Mafia, after leaving AWOL Records, which he did after the release of Til My Casket Drops. The album features guest performances by WC, Daz Dillinger, Killa Tay, Yukmouth, CJ Mac and Too Short. Along with a single, a music video was produced for the song, "Get The Money".
Track listing
"Enemy of the State"
"Crippin'" (featuring Daz Dillinger)
"Death Rider's"
"Paper Made"
"Get The Money"
"4.6" (featuring Killa Tay)
"It's War" (featuring Little Keek & Yukmouth)
"Forever Thuggin' (featuring Dotty)
"Ride Til' We Die" (featuring WC)
"Nothin' over My G's" (featuring JT the Bigga Figga & Killa Tay)
"Spray Yourself" (featuring Yukmouth)
"C and the Mac" (featuring CJ Mac)
"Picture Me Ballin'"
"Born Killaz" (featuring Mob Figaz)
"Pimpin' and Jackin'" (featuring Too Short)
"Tycoon"
"No Surrender, No Retreat" (featuring Mob Figaz)
"Here We Come, Boy!"
Chart history
References
External links
Enemy of the State at Discogs
Enemy of the State at MusicBrainz
2000 albums
C-Bo albums
Warlock Records albums
Albums produced by Mike Dean (record producer)
Albums produced by Rick Rock
|
```go
// +build !windows
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package client
import (
"context"
"io"
"net"
"os"
"os/exec"
"strings"
"sync"
"syscall"
"time"
"golang.org/x/sys/unix"
"github.com/pkg/errors"
"github.com/sirupsen/logrus"
"github.com/stevvooe/ttrpc"
"github.com/containerd/containerd/events"
"github.com/containerd/containerd/linux/shim"
shimapi "github.com/containerd/containerd/linux/shim/v1"
"github.com/containerd/containerd/log"
"github.com/containerd/containerd/sys"
ptypes "github.com/gogo/protobuf/types"
)
var empty = &ptypes.Empty{}
// Opt is an option for a shim client configuration
type Opt func(context.Context, shim.Config) (shimapi.ShimService, io.Closer, error)
// WithStart executes a new shim process
func WithStart(binary, address, daemonAddress, cgroup string, debug bool, exitHandler func()) Opt {
return func(ctx context.Context, config shim.Config) (_ shimapi.ShimService, _ io.Closer, err error) {
socket, err := newSocket(address)
if err != nil {
return nil, nil, err
}
defer socket.Close()
f, err := socket.File()
if err != nil {
return nil, nil, errors.Wrapf(err, "failed to get fd for socket %s", address)
}
defer f.Close()
cmd, err := newCommand(binary, daemonAddress, debug, config, f)
if err != nil {
return nil, nil, err
}
if err := cmd.Start(); err != nil {
return nil, nil, errors.Wrapf(err, "failed to start shim")
}
defer func() {
if err != nil {
cmd.Process.Kill()
}
}()
go func() {
cmd.Wait()
exitHandler()
}()
log.G(ctx).WithFields(logrus.Fields{
"pid": cmd.Process.Pid,
"address": address,
"debug": debug,
}).Infof("shim %s started", binary)
// set shim in cgroup if it is provided
if cgroup != "" {
if err := setCgroup(cgroup, cmd); err != nil {
return nil, nil, err
}
log.G(ctx).WithFields(logrus.Fields{
"pid": cmd.Process.Pid,
"address": address,
}).Infof("shim placed in cgroup %s", cgroup)
}
if err = sys.SetOOMScore(cmd.Process.Pid, sys.OOMScoreMaxKillable); err != nil {
return nil, nil, errors.Wrap(err, "failed to set OOM Score on shim")
}
c, clo, err := WithConnect(address, func() {})(ctx, config)
if err != nil {
return nil, nil, errors.Wrap(err, "failed to connect")
}
return c, clo, nil
}
}
func newCommand(binary, daemonAddress string, debug bool, config shim.Config, socket *os.File) (*exec.Cmd, error) {
selfExe, err := os.Executable()
if err != nil {
return nil, err
}
args := []string{
"-namespace", config.Namespace,
"-workdir", config.WorkDir,
"-address", daemonAddress,
"-containerd-binary", selfExe,
}
if config.Criu != "" {
args = append(args, "-criu-path", config.Criu)
}
if config.RuntimeRoot != "" {
args = append(args, "-runtime-root", config.RuntimeRoot)
}
if config.SystemdCgroup {
args = append(args, "-systemd-cgroup")
}
if debug {
args = append(args, "-debug")
}
cmd := exec.Command(binary, args...)
cmd.Dir = config.Path
// make sure the shim can be re-parented to system init
// and is cloned in a new mount namespace because the overlay/filesystems
// will be mounted by the shim
cmd.SysProcAttr = getSysProcAttr()
cmd.ExtraFiles = append(cmd.ExtraFiles, socket)
if debug {
cmd.Stdout = os.Stdout
cmd.Stderr = os.Stderr
}
return cmd, nil
}
func newSocket(address string) (*net.UnixListener, error) {
if len(address) > 106 {
return nil, errors.Errorf("%q: unix socket path too long (> 106)", address)
}
l, err := net.Listen("unix", "\x00"+address)
if err != nil {
return nil, errors.Wrapf(err, "failed to listen to abstract unix socket %q", address)
}
return l.(*net.UnixListener), nil
}
func connect(address string, d func(string, time.Duration) (net.Conn, error)) (net.Conn, error) {
return d(address, 100*time.Second)
}
func annonDialer(address string, timeout time.Duration) (net.Conn, error) {
address = strings.TrimPrefix(address, "unix://")
return net.DialTimeout("unix", "\x00"+address, timeout)
}
// WithConnect connects to an existing shim
func WithConnect(address string, onClose func()) Opt {
return func(ctx context.Context, config shim.Config) (shimapi.ShimService, io.Closer, error) {
conn, err := connect(address, annonDialer)
if err != nil {
return nil, nil, err
}
client := ttrpc.NewClient(conn)
client.OnClose(onClose)
return shimapi.NewShimClient(client), conn, nil
}
}
// WithLocal uses an in process shim
func WithLocal(publisher events.Publisher) func(context.Context, shim.Config) (shimapi.ShimService, io.Closer, error) {
return func(ctx context.Context, config shim.Config) (shimapi.ShimService, io.Closer, error) {
service, err := shim.NewService(config, publisher)
if err != nil {
return nil, nil, err
}
return shim.NewLocal(service), nil, nil
}
}
// New returns a new shim client
func New(ctx context.Context, config shim.Config, opt Opt) (*Client, error) {
s, c, err := opt(ctx, config)
if err != nil {
return nil, err
}
return &Client{
ShimService: s,
c: c,
exitCh: make(chan struct{}),
}, nil
}
// Client is a shim client containing the connection to a shim
type Client struct {
shimapi.ShimService
c io.Closer
exitCh chan struct{}
exitOnce sync.Once
}
// IsAlive returns true if the shim can be contacted.
// NOTE: a negative answer doesn't mean that the process is gone.
func (c *Client) IsAlive(ctx context.Context) (bool, error) {
_, err := c.ShimInfo(ctx, empty)
if err != nil {
// TODO(stevvooe): There are some error conditions that need to be
// handle with unix sockets existence to give the right answer here.
return false, err
}
return true, nil
}
// StopShim signals the shim to exit and wait for the process to disappear
func (c *Client) StopShim(ctx context.Context) error {
return c.signalShim(ctx, unix.SIGTERM)
}
// KillShim kills the shim forcefully and wait for the process to disappear
func (c *Client) KillShim(ctx context.Context) error {
return c.signalShim(ctx, unix.SIGKILL)
}
// Close the cient connection
func (c *Client) Close() error {
if c.c == nil {
return nil
}
return c.c.Close()
}
func (c *Client) signalShim(ctx context.Context, sig syscall.Signal) error {
info, err := c.ShimInfo(ctx, empty)
if err != nil {
return err
}
pid := int(info.ShimPid)
// make sure we don't kill ourselves if we are running a local shim
if os.Getpid() == pid {
return nil
}
if err := unix.Kill(pid, sig); err != nil && err != unix.ESRCH {
return err
}
// wait for shim to die after being signaled
select {
case <-ctx.Done():
return ctx.Err()
case <-c.waitForExit(pid):
return nil
}
}
func (c *Client) waitForExit(pid int) <-chan struct{} {
c.exitOnce.Do(func() {
for {
// use kill(pid, 0) here because the shim could have been reparented
// and we are no longer able to waitpid(pid, ...) on the shim
if err := unix.Kill(pid, 0); err == unix.ESRCH {
close(c.exitCh)
return
}
time.Sleep(10 * time.Millisecond)
}
})
return c.exitCh
}
```
|
Bangladesh Short Film Forum (BSFF) is an organization of young Bangladeshi film makers. It was formed on 24 August 1986 by a group of young independent filmmakers and activists who were then campaigning for creative and aesthetically rich cinema.
Most of these young filmmakers were initiated into cinema through their involvement with the film society movement in Bangladesh that began as early as in the 1960s. Short Film Forum was formed at a time when mainstream Bangladeshi cinema was dominated by crass commercialism and a network of producers-distributors-exhibitors which allowed no space for artistic or socially responsible films.
The Forum featured some of most notable young Bangladeshi film makers among its members, including Morshedul Islam, Tanvir Mokammel, Tareque Masud, Enayet Karim Babul, Tareq Shahrier, Shameem Akhter, Manjare Hasin Murad, Yasmin Kabir, Nurul Alam Atique, Zakir Hossain Raju, Zahidur Rahim Anjan, Rashed Chowdhury, and Akram Khan.
Bangladesh Short Film Forum now has its own film center in Shahbag, Dhaka with an auditorium, a library, an archive and an administrative office.
The Forum is mostly noted for organizing the biennial and non-competitive International Short and Independent Film Festival. The first festival was held in 1988, and was the first festival in the Indian Sub-continent which was entirely dedicated to short films.
The Forum produced a number of short films, including One Day in Krishnanagar (53 minutes) and Dhaka 2005 (5 minutes). It organizes seminars and workshops on films and limited scale film festivals all over Bangladesh, as well as film shows in its Bangladesh Film Center in Shahbag.
Footnotes
Sources
The festival on Bangladesh Online
The festival on New Age
The Forum on Power of Culture Website
Weekly Holiday: Death of a creative mind
Weekly Holiday: Open film open expression
Film organisations in Bangladesh
1986 establishments in Bangladesh
|
```javascript
const assert = require('assert');
const { bucketPut } = require('../../../lib/api/bucketPut');
const bucketPutWebsite = require('../../../lib/api/bucketPutWebsite');
const bucketGetWebsite = require('../../../lib/api/bucketGetWebsite');
const { cleanup,
DummyRequestLogger,
makeAuthInfo }
= require('../helpers');
const log = new DummyRequestLogger();
const authInfo = makeAuthInfo('accessKey1');
const bucketName = 'bucketGetWebsiteTestBucket';
const testBucketPutRequest = {
bucketName,
headers: { host: `${bucketName}.s3.amazonaws.com` },
url: '/',
actionImplicitDenies: false,
};
function _makeWebsiteRequest(xml) {
const request = {
bucketName,
headers: {
host: `${bucketName}.s3.amazonaws.com`,
},
url: '/?website',
query: { website: '' },
actionImplicitDenies: false,
};
if (xml) {
request.post = xml;
}
return request;
}
const testGetWebsiteRequest = _makeWebsiteRequest();
function _comparePutGetXml(sampleXml, done) {
const fullXml = '<?xml version="1.0" encoding="UTF-8" ' +
'standalone="yes"?><WebsiteConfiguration ' +
'xmlns="path_to_url">' +
`${sampleXml}</WebsiteConfiguration>`;
const testPutWebsiteRequest = _makeWebsiteRequest(fullXml);
bucketPutWebsite(authInfo, testPutWebsiteRequest, log, err => {
if (err) {
process.stdout.write(`Err putting website config ${err}`);
return done(err);
}
return bucketGetWebsite(authInfo, testGetWebsiteRequest, log,
(err, res) => {
assert.strictEqual(err, null, `Unexpected err ${err}`);
assert.strictEqual(res, fullXml);
done();
});
});
}
describe('getBucketWebsite API', () => {
beforeEach(done => {
cleanup();
bucketPut(authInfo, testBucketPutRequest, log, done);
});
afterEach(() => cleanup());
it('should return same IndexDocument XML as uploaded', done => {
const sampleXml =
'<IndexDocument><Suffix>index.html</Suffix></IndexDocument>';
_comparePutGetXml(sampleXml, done);
});
it('should return same ErrorDocument XML as uploaded', done => {
const sampleXml =
'<IndexDocument><Suffix>index.html</Suffix></IndexDocument>' +
'<ErrorDocument><Key>error.html</Key></ErrorDocument>';
_comparePutGetXml(sampleXml, done);
});
it('should return same RedirectAllRequestsTo as uploaded', done => {
const sampleXml =
'<RedirectAllRequestsTo>' +
'<HostName>test</HostName>' +
'<Protocol>http</Protocol>' +
'</RedirectAllRequestsTo>';
_comparePutGetXml(sampleXml, done);
});
it('should return same RoutingRules as uploaded', done => {
const sampleXml =
'<IndexDocument><Suffix>index.html</Suffix></IndexDocument>' +
'<RoutingRules><RoutingRule>' +
'<Condition><KeyPrefixEquals>docs/</KeyPrefixEquals></Condition>' +
'<Redirect><HostName>test</HostName></Redirect>' +
'</RoutingRule><RoutingRule>' +
'<Condition>' +
'<HttpErrorCodeReturnedEquals>404</HttpErrorCodeReturnedEquals>' +
'</Condition>' +
'<Redirect><HttpRedirectCode>303</HttpRedirectCode></Redirect>' +
'</RoutingRule></RoutingRules>';
_comparePutGetXml(sampleXml, done);
});
});
```
|
Yevgeny Alexandrovich Nikonov (; 18 December 1920 – 19 August 1941, in Harku, Estonia) was a Russian sailor during the Soviet defense of Estonia in 1941. He is a holder of the Hero of the Soviet Union, the Soviet Union's highest award.
Life and death
Nikonov was born on 18 December 1920 into an ethnically Russian peasant family in the village of Vasilyevka in what is now Stavropolsky District of Samara Oblast. He joined the navy in 1939 and served as a torpedo electrician on the destroyer leader Minsk attached to the Soviet Baltic Fleet.
Following the 1941 German invasion of the Soviet Union, Nikonov and many other Baltic Fleet sailors were deployed as emergency naval infantry.
Nikonov fought in the defense of Tallinn (5–28 August 1941), the main base of the Baltic Fleet. According to Soviet official version while engaged in reconnaissance near the town of Keila on 19 August he was seriously wounded and captured. Despite being tortured, Nikonov refused to give his captors any military information, for which the Germans doused him with gasoline and burned him alive.
On 19 April 1943 Baltic Fleet commander Vice–Admiral Vladimir Tributs ordered that Torpedo Electrician Yevgeny Nikonov forever be listed as a member of the Minsk'''s active crew. (This tradition continues today; although the Minsk'' was long ago scrapped, Yevgeny Nikonov is always listed on the active personnel roster of a Baltic Fleet training unit.)
Nikonov was posthumously awarded the title of Hero of the Soviet Union on 3 September 1957.
Controversy
There is no independent proof that story behind Nikonov's death is true, as all sources are tied to the Soviet or Russian state. Some commenters have suggested that the chronology of events is hard to fit into the Soviet/Russian account, and that, although Nikonov was a real person, the story of his martyrdom was constructed for propaganda purposes, although there is no definite evidence of this either.
Burials
Nikonov was originally buried on a farm in Harku. On 19 March 1951 the Tallinn City Council decided to rename a street in Nikonov's honor. The same decree granted a request by Baltic Fleet Command for land in the Kadriorg district to construct a monument to Nikonov.
Soon after, Nikonov's remains were ceremoniously reinterred in a picturesque location in Tallinn park, on the hill of Maarjamäe, and a monument was erected. Following the collapse of the Soviet Union, the monument was demolished. (The statue, now missing its head, is at the outdoor exhibition of Soviet monuments at Maarjamäe Palace of the Estonian History Museum.)
On 2 March 1992 Nikonov was again reinterred, in his home town of Vasilyevka in Russia. According to some sources, when the attempt was made to disinter Nikonov's remains for reburial in Russia, his remains were missing – it remains unclear, whether the remains were there in the first place. There have been accusations that the remains were taken by Estonian nationalists, and were then offered in exchange for information about the burial location of some men of the 20th Waffen Grenadier Division of the SS (1st Estonian) (a unit of Estonians who had fought for the Germans against the Soviets) who had been shot after the Soviets reoccupied Tallinn in 1944. So the reburial delegation from Tolyatti just filled the coffin with some earth from around Nikonov's grave and returned with that to Russia.
Memorialization
Tolyatti, the city nearest Nikonov's birthplace, contains several memorials to him. A street was named in his honor on 13 November 1958, and a square in 1980. There is a memorial at school number 19 (now Lyceum № 19). He is depicted on one of the faces of the Obelisk of Glory in Liberty Square. A memorial was opened on 9 May 1979 in Nikonov Square in the Gateway District.
A tanker (of the shipping company Volgotanker) was named for Nikonov. A street and a school (school number 68, where Nikonov had studied) in the Moskovsky District of Nizhny Novgorod were named for Nikonov in 1957. Later, a monument was erected in front of the school, and in 1972 the school opened a museum of the hero. There is a memorial plaque at the plant where Nikonov worked, and a monument at his grave in the village of Vasilyevka. A street in the Krasnoglinsky District of Samara was named Hero Of The Soviet Union Nikonov Street on 5 January 1978.
Awards
Hero of the Soviet Union
Order of Lenin
Order of the Patriotic War First Class
Notes
References
External links
Biography at Tolyatti history website
Yevgeny Nikonov article at Relga
Nikonov Monument at Virtual Tolyatti
1920 births
1941 deaths
Executed people from Samara Oblast
Soviet Navy personnel
Electricians
Russian people executed by Nazi Germany
Soviet military personnel killed in World War II
Executed Soviet people from Russia
Russian torture victims
Recipients of the Order of Lenin
Heroes of the Soviet Union
|
Frank Douglas Stephens AO, DSO (10 October 1913 - 10 December 2011) was an Australian surgeon.
He was born in Melbourne on 10 October 1913. His father was Henry Douglas Stephens and his mother Eileen Cole. Educated at the University of Melbourne he specialized in surgery, particularly with regard to congenital malformations of the uro-genital tract. He served in the Australian Army during World War II in the Australian Army Medical Corps and was awarded a Distinguished Service Order in 1942. He was discharged in 1945 as a Major.
After the war he moved into paediatric surgery and worked mostly at the Royal Children's Hospital in Melbourne. He has received numerous awards for his pioneering surgical techniques, including the Sir Denis Browne Gold Medal from the British Association of Paediatric Surgeons in 1976, the Urology Medal Award of the American Academy of Pediatrics (1986) and was made an Officer of the Order of Australia in 1987. He has written several books related to ano-rectal abnormalities in children.
He was married with two sons and a daughter.
References
External links
Australian War Memorial - DSO
1913 births
2011 deaths
Officers of the Order of Australia
Companions of the Distinguished Service Order
Australian Army personnel of World War II
Australian Army officers
People educated at Trinity College (University of Melbourne)
Military personnel from Melbourne
Medical doctors from Melbourne
Australian surgeons
20th-century surgeons
|
```javascript
// TODO: Add dev-tools CSS to see if widget have globals.
export class Unlink extends $e.modules.editor.CommandContainerBase {
validateArgs( args = {} ) {
this.requireContainer( args );
this.requireArgumentType( 'setting', 'string', args );
this.requireArgumentType( 'globalValue', 'string', args );
// TODO: validate global value is command format.
}
async apply( args ) {
const { containers = [ args.container ], setting, globalValue, options = {} } = args,
localSettings = {};
await Promise.all( containers.map( async ( /* Container */ container ) => {
const result = await $e.data.get( globalValue );
if ( result ) {
// Prepare global value to mapping.
const { value } = result.data,
groupPrefix = container.controls[ setting ]?.groupPrefix;
if ( groupPrefix ) {
Object.entries( value ).forEach( ( [ dataKey, dataValue ] ) => {
dataKey = dataKey.replace( elementor.config.kit_config.typography_prefix, groupPrefix );
localSettings[ dataKey ] = dataValue;
} );
} else {
localSettings[ setting ] = value;
}
}
return Promise.resolve();
} ) );
// Restore globals settings as custom local settings.
if ( Object.keys( localSettings ).length ) {
$e.run( 'document/elements/settings', {
containers,
options,
settings: localSettings,
} );
}
}
}
export default Unlink;
```
|
The 1994 European Community Championships was a men's tennis tournament played on indoor carpet courts at the Sportpaleis Antwerp in Antwerp in Belgium and was part of the World Series of the 1994 ATP Tour. It was the 13th edition of the tournament and was held from 7 November through 13 November 1994. First-seeded Pete Sampras won his second consecutive singles title at the event.
Finals
Singles
Pete Sampras defeated Magnus Larsson 7–6(7–5), 6–4
It was Sampras' 9th singles title of the year and the 30th of his career.
Doubles
Jan Apell / Jonas Björkman defeated Hendrik Jan Davids / Sébastien Lareau 4–6, 6–1, 6–2
It was Apell's 5th doubles title of the year and the 6th of his career. It was Björkman's 6th doubles title of the year and of his career.
References
External links
ITF tournament edition details
European Community Championships
ECC Antwerp
|
Jinan Yaoqiang International Airport is the airport serving Jinan, the capital of Shandong Province, China. The airport is located approximately northeast of the city center and immediately to the north of the Yaoqiang Subdistrict () after which the airport is named. By road, the airport is connected to the Jinan Ring (), Beijing–Shanghai, and Qingdao–Yinchuan Expressways.
In 2018, Jinan Yaoqiang International Airport is the 25th busiest airport in China with 16,611,795 passengers.
In December 2016, Sichuan Airlines began non-stop intercontinental service from Jinan to Los Angeles.
In February 2022, Jinan gained direct flights to Europe with Condor starting Frankfurt. Nearly one year later, in January of 2023, Condor ceased the service again and started flying to Hefei.
Future expansions
In September 2019, CAAC approved a new master plan for the airport.
Airlines and destinations
Cargo
See also
List of the busiest airports in China
References
External links
Official Website
Other Information
Airports in Shandong
Transport in Jinan
Airports established in 1992
|
```c++
/*
========================================================================
Name : pjsuaContainer.cpp
Author : nanang
Description :
========================================================================
*/
// [[[ begin generated region: do not modify [Generated System Includes]
#include <barsread.h>
#include <eikimage.h>
#include <eikenv.h>
#include <stringloader.h>
#include <eiklabel.h>
#include <aknviewappui.h>
#include <eikappui.h>
#include <akniconutils.h>
#include <pjsua.mbg>
#include <pjsua.rsg>
// ]]] end generated region [Generated System Includes]
// [[[ begin generated region: do not modify [Generated User Includes]
#include "pjsuaContainer.h"
#include "pjsuaContainerView.h"
#include "pjsua.hrh"
// ]]] end generated region [Generated User Includes]
#include <eikmenub.h>
// [[[ begin generated region: do not modify [Generated Constants]
_LIT( KpjsuaFile, "\\resource\\apps\\pjsua.mbm" );
// ]]] end generated region [Generated Constants]
/**
* First phase of Symbian two-phase construction. Should not
* contain any code that could leave.
*/
CPjsuaContainer::CPjsuaContainer()
{
// [[[ begin generated region: do not modify [Generated Contents]
iImage1 = NULL;
iLabel1 = NULL;
// ]]] end generated region [Generated Contents]
}
/**
* Destroy child controls.
*/
CPjsuaContainer::~CPjsuaContainer()
{
// [[[ begin generated region: do not modify [Generated Contents]
delete iImage1;
iImage1 = NULL;
delete iLabel1;
iLabel1 = NULL;
// ]]] end generated region [Generated Contents]
}
/**
* Construct the control (first phase).
* Creates an instance and initializes it.
* Instance is not left on cleanup stack.
* @param aRect bounding rectangle
* @param aParent owning parent, or NULL
* @param aCommandObserver command observer
* @return initialized instance of CPjsuaContainer
*/
CPjsuaContainer* CPjsuaContainer::NewL(
const TRect& aRect,
const CCoeControl* aParent,
MEikCommandObserver* aCommandObserver )
{
CPjsuaContainer* self = CPjsuaContainer::NewLC(
aRect,
aParent,
aCommandObserver );
CleanupStack::Pop( self );
return self;
}
/**
* Construct the control (first phase).
* Creates an instance and initializes it.
* Instance is left on cleanup stack.
* @param aRect The rectangle for this window
* @param aParent owning parent, or NULL
* @param aCommandObserver command observer
* @return new instance of CPjsuaContainer
*/
CPjsuaContainer* CPjsuaContainer::NewLC(
const TRect& aRect,
const CCoeControl* aParent,
MEikCommandObserver* aCommandObserver )
{
CPjsuaContainer* self = new ( ELeave ) CPjsuaContainer();
CleanupStack::PushL( self );
self->ConstructL( aRect, aParent, aCommandObserver );
return self;
}
/**
* Construct the control (second phase).
* Creates a window to contain the controls and activates it.
* @param aRect bounding rectangle
* @param aCommandObserver command observer
* @param aParent owning parent, or NULL
*/
void CPjsuaContainer::ConstructL(
const TRect& aRect,
const CCoeControl* aParent,
MEikCommandObserver* aCommandObserver )
{
if ( aParent == NULL )
{
CreateWindowL();
}
else
{
SetContainerWindowL( *aParent );
}
iFocusControl = NULL;
iCommandObserver = aCommandObserver;
InitializeControlsL();
SetRect( aRect );
// Full screen
SetExtentToWholeScreen();
// Set label color
//iLabel1->OverrideColorL( EColorLabelText, KRgbWhite );
//iLabel1->OverrideColorL(EColorControlBackground, KRgbBlack )
iLabel1->SetEmphasis( CEikLabel::EFullEmphasis);
iLabel1->OverrideColorL( EColorLabelHighlightFullEmphasis, KRgbBlack );
iLabel1->OverrideColorL( EColorLabelTextEmphasis, KRgbWhite );
// Set label font
CFont* fontUsed;
_LIT(f,"Arial");
TFontSpec* fontSpec = new TFontSpec(f, 105);
TFontStyle* fontStyle = new TFontStyle();
fontStyle->SetPosture(EPostureUpright);
fontStyle->SetStrokeWeight(EStrokeWeightNormal);
fontSpec->iFontStyle = *fontStyle;
fontUsed = iCoeEnv->CreateScreenFontL(*fontSpec);
iLabel1->SetFont(fontUsed);
iLabel1->SetAlignment( EHCenterVCenter );
ActivateL();
// [[[ begin generated region: do not modify [Post-ActivateL initializations]
// ]]] end generated region [Post-ActivateL initializations]
}
/**
* Return the number of controls in the container (override)
* @return count
*/
TInt CPjsuaContainer::CountComponentControls() const
{
return ( int ) ELastControl;
}
/**
* Get the control with the given index (override)
* @param aIndex Control index [0...n) (limited by #CountComponentControls)
* @return Pointer to control
*/
CCoeControl* CPjsuaContainer::ComponentControl( TInt aIndex ) const
{
// [[[ begin generated region: do not modify [Generated Contents]
switch ( aIndex )
{
case EImage1:
return iImage1;
case ELabel1:
return iLabel1;
}
// ]]] end generated region [Generated Contents]
// handle any user controls here...
return NULL;
}
/**
* Handle resizing of the container. This implementation will lay out
* full-sized controls like list boxes for any screen size, and will layout
* labels, editors, etc. to the size they were given in the UI designer.
* This code will need to be modified to adjust arbitrary controls to
* any screen size.
*/
void CPjsuaContainer::SizeChanged()
{
CCoeControl::SizeChanged();
LayoutControls();
// Align the image
int x = (Size().iWidth - iImage1->Size().iWidth) / 2;
int y = (Size().iHeight - iImage1->Size().iHeight) / 2;
iImage1->SetPosition(TPoint(x, y));
// Align the label
iLabel1->SetExtent(TPoint(0, Size().iHeight - iLabel1->Size().iHeight),
TSize(Size().iWidth, iLabel1->Size().iHeight));
// [[[ begin generated region: do not modify [Generated Contents]
// ]]] end generated region [Generated Contents]
}
// [[[ begin generated function: do not modify
/**
* Layout components as specified in the UI Designer
*/
void CPjsuaContainer::LayoutControls()
{
iImage1->SetExtent( TPoint( 0, 0 ), TSize( 99, 111 ) );
iLabel1->SetExtent( TPoint( 0, 196 ), TSize( 241, 27 ) );
}
// ]]] end generated function
/**
* Handle key events.
*/
TKeyResponse CPjsuaContainer::OfferKeyEventL(
const TKeyEvent& aKeyEvent,
TEventCode aType )
{
// [[[ begin generated region: do not modify [Generated Contents]
// ]]] end generated region [Generated Contents]
if ( iFocusControl != NULL
&& iFocusControl->OfferKeyEventL( aKeyEvent, aType ) == EKeyWasConsumed )
{
return EKeyWasConsumed;
}
return CCoeControl::OfferKeyEventL( aKeyEvent, aType );
}
// [[[ begin generated function: do not modify
/**
* Initialize each control upon creation.
*/
void CPjsuaContainer::InitializeControlsL()
{
iImage1 = new ( ELeave ) CEikImage;
{
CFbsBitmap *bitmap, *mask;
AknIconUtils::CreateIconL( bitmap, mask,
KpjsuaFile, EMbmPjsuaPjsua, -1 );
AknIconUtils::SetSize( bitmap, TSize( 99, 111 ), EAspectRatioPreserved );
iImage1->SetPicture( bitmap );
}
iImage1->SetAlignment( EHCenterVTop );
iLabel1 = new ( ELeave ) CEikLabel;
iLabel1->SetContainerWindowL( *this );
{
TResourceReader reader;
iEikonEnv->CreateResourceReaderLC( reader, R_PJSUA_CONTAINER_LABEL1 );
iLabel1->ConstructFromResourceL( reader );
CleanupStack::PopAndDestroy(); // reader internal state
}
}
// ]]] end generated function
/**
* Handle global resource changes, such as scalable UI or skin events (override)
*/
void CPjsuaContainer::HandleResourceChange( TInt aType )
{
CCoeControl::HandleResourceChange( aType );
SetRect( iAvkonViewAppUi->View( TUid::Uid( EPjsuaContainerViewId ) )->ClientRect() );
// [[[ begin generated region: do not modify [Generated Contents]
// ]]] end generated region [Generated Contents]
}
/**
* Draw container contents.
*/
void CPjsuaContainer::Draw( const TRect& aRect ) const
{
// [[[ begin generated region: do not modify [Generated Contents]
CWindowGc& gc = SystemGc();
gc.SetPenStyle( CGraphicsContext::ENullPen );
TRgb backColor( 0,0,0 );
gc.SetBrushColor( backColor );
gc.SetBrushStyle( CGraphicsContext::ESolidBrush );
gc.DrawRect( aRect );
// ]]] end generated region [Generated Contents]
}
void CPjsuaContainer::PutMessageL( const char * msg )
{
if (!iLabel1)
return;
TPtrC8 ptr(reinterpret_cast<const TUint8*>(msg));
HBufC* buffer = HBufC::NewLC(ptr.Length());
buffer->Des().Copy(ptr);
iLabel1->SetTextL(*buffer);
iLabel1->DrawNow();
CleanupStack::PopAndDestroy(buffer);
}
```
|
Carúpano is a city in the eastern Venezuelan state of Sucre. It is located on the Venezuelan Caribbean coast at the opening of two valleys, some 120 km east of the capital of Sucre, Cumaná. This city is the shire town of the Bermúdez Municipality and, according to the 2010 Venezuelan census, the municipality has a population of 173,877 inhabitants. Carúpano is considered the gateway to the Paria Peninsula and its main commercial and financial center.
History
It was somewhere on the Peninsula of Paria, near Carúpano, where Christopher Columbus first set foot on the American continent for the only time, during his third voyage (in all his other trips he only explored the Caribbean islands).
It was in Carúpano where Simón Bolívar, the liberator of Venezuela, issued a decree ending slavery in 1814.
In 1815, King Ferdinand VII of Spain, sent a fleet of 18 warships and 42 cargo ships to Carupano and Isla Margarita with the mission of pacifying the revolts against the Spanish monarchy in the South American colonies.
In May 1962 Carúpano was the scene of a short-lived military rebellion against the government of Rómulo Betancourt, in which rebel military officers took over the city. The incident is known as El Carupanazo.
In July 1997, a violent earthquake struck the city and most of the state. This earthquake was centered in the town of Cariaco, where most of the deaths and damage occurred.
Economy
Cacao, coffee, sugar, cotton, timber and rum have been important exports of Carúpano since colonial times. Carupanese rums are highly appreciated nationwide, so the internal consumption usually leaves little surplus rum for export.
Currently the local General José Francisco Bermúdez Airport does not carry regular commercial flights.
Demographics
The Bermúdez Municipality, according to the 2001 Venezuelan census, has a population of 175,877 (up from 100,794 in 1990). This amounts to 15.5% of Sucre's population. The municipality's population density is 1,559 people per square mile (601.95/km2).
Government
Carúpano is the administrative centre of Bermúdez Municipality. The mayor of the Bermúdez Municipality is Nircia Villegas, elected in 2017.
Sites of interest
House of Cable
The House of Cable was where the first submarine cable between Europe and America arrived, joining the French city of Marseille with Carúpano, back in the late 19th century. This house is today the headquarters of the Tomas Merle foundation and the Paria Project, two organizations that promote tourism and industry.
Religious buildings
Iglesia Catedral Santa Rosa de Lima
Iglesia Santa Catalina de Siena
Iglesia Nuestra Señora de Coromoto
Iglesia San Martín de Porres
Iglesia Ntra. Señora del Valle
Iglesia San Rafael Ancargél
Capilla Santa Cruz(Guayacan de las Flores)
Capilla Santa Cruz(Guayacan de los Pescadores)
Capilla Santa Cruz(Sector el Mangle)
Squares and parks
Plaza Andrés
Plaza Bolívar
Plaza Colón
Plaza Miranda
Plaza Santa Rosa
Plaza Suniaga
Parque Karupana
Middle Schools and High Schools:
U.E.P " Ramón León Santelli"(Escuela Privada,ubicada en Av. Independencia frente al Hotel Lilma).
U.E " J.J Martinez Mata "(Escuela Publica,ubicada en Av. Libertad,con calle Paez).
U.E.P " Rafael Osío Perez "(Liceo Privado,ubicada en Av. Independencia,con calle Paez).
U.E.P " Dr. José Gregorio Hernandez "(Escuela y Liceo Privado,ubicada en Av. Carabobo).
U.E.P " San José "(Escuela y Liceo Privado,ubicada en Av. Carabobo,con calle Las Margaritas,y calle Calvario).
U.E.P " Don Andrés Bello "(Escuela y Liceo Privado,ubicada en Av. Independencia frente a la Plaza Santa Rosa,y calle Dominicci).
U.E.P " Sagrado Corazón de Jesús "(Escuela Privada,ubicada en Calle Ecuador).
U.E.P " Inmaculado Corazón de María(Escuela Privada,ubicada en Av. Juncal,cerca del Supermercado Francys).
U.E " Antonio Jesús Rodriguez Abreu "(Escuela Publica,ubicada en Av. Principal de Canchunchu).
U.E " Pedro Elías Aristeguieta "(Escuela Publica,ubicada en calle Bolívar al Frente de la Infantería).
U.E " Manuel María Urbaneja "(Escuela Publica,ubicada en Calle Principal del Sector Curacho).
Liceo Metropolitano "José Eusebio Acosta Peña" "( Liceo Publico,ubicado en el muco las casitas )
Notable people
Famous Carupaneros include Wolfgang Larrazábal, former president of Venezuela; Jictzad Viña, Miss Venezuela 2005; Antonio José de Sucre, one of the paramount leaders of the South American war of independence, was thought to have lived there but hailed from Cumana; Andrés Eloy Blanco, one of the most important Venezuelan poets also came from Cumana; Eladio Lárez, president of Radio Caracas Television, one of Venezuela's largest television networks; and Washington Nationals major league baseball catcher Jesús Flores.
See also
Corsican immigration to Venezuela
References
External links
https://web.archive.org/web/20180806161836/http://carupanizate.com/
Cities in Sucre (state)
Populated places established in 1647
1647 establishments in the Spanish Empire
|
```go
package issues_test
import (
"testing"
"time"
"code.gitea.io/gitea/models/db"
issues_model "code.gitea.io/gitea/models/issues"
repo_model "code.gitea.io/gitea/models/repo"
"code.gitea.io/gitea/models/unittest"
user_model "code.gitea.io/gitea/models/user"
"github.com/stretchr/testify/assert"
)
func TestCreateComment(t *testing.T) {
assert.NoError(t, unittest.PrepareTestDatabase())
issue := unittest.AssertExistsAndLoadBean(t, &issues_model.Issue{})
repo := unittest.AssertExistsAndLoadBean(t, &repo_model.Repository{ID: issue.RepoID})
doer := unittest.AssertExistsAndLoadBean(t, &user_model.User{ID: repo.OwnerID})
now := time.Now().Unix()
comment, err := issues_model.CreateComment(db.DefaultContext, &issues_model.CreateCommentOptions{
Type: issues_model.CommentTypeComment,
Doer: doer,
Repo: repo,
Issue: issue,
Content: "Hello",
})
assert.NoError(t, err)
then := time.Now().Unix()
assert.EqualValues(t, issues_model.CommentTypeComment, comment.Type)
assert.EqualValues(t, "Hello", comment.Content)
assert.EqualValues(t, issue.ID, comment.IssueID)
assert.EqualValues(t, doer.ID, comment.PosterID)
unittest.AssertInt64InRange(t, now, then, int64(comment.CreatedUnix))
unittest.AssertExistsAndLoadBean(t, comment) // assert actually added to DB
updatedIssue := unittest.AssertExistsAndLoadBean(t, &issues_model.Issue{ID: issue.ID})
unittest.AssertInt64InRange(t, now, then, int64(updatedIssue.UpdatedUnix))
}
func TestFetchCodeComments(t *testing.T) {
assert.NoError(t, unittest.PrepareTestDatabase())
issue := unittest.AssertExistsAndLoadBean(t, &issues_model.Issue{ID: 2})
user := unittest.AssertExistsAndLoadBean(t, &user_model.User{ID: 1})
res, err := issues_model.FetchCodeComments(db.DefaultContext, issue, user, false)
assert.NoError(t, err)
assert.Contains(t, res, "README.md")
assert.Contains(t, res["README.md"], int64(4))
assert.Len(t, res["README.md"][4], 1)
assert.Equal(t, int64(4), res["README.md"][4][0].ID)
user2 := unittest.AssertExistsAndLoadBean(t, &user_model.User{ID: 2})
res, err = issues_model.FetchCodeComments(db.DefaultContext, issue, user2, false)
assert.NoError(t, err)
assert.Len(t, res, 1)
}
func TestAsCommentType(t *testing.T) {
assert.Equal(t, issues_model.CommentType(0), issues_model.CommentTypeComment)
assert.Equal(t, issues_model.CommentTypeUndefined, issues_model.AsCommentType(""))
assert.Equal(t, issues_model.CommentTypeUndefined, issues_model.AsCommentType("nonsense"))
assert.Equal(t, issues_model.CommentTypeComment, issues_model.AsCommentType("comment"))
assert.Equal(t, issues_model.CommentTypePRUnScheduledToAutoMerge, issues_model.AsCommentType("pull_cancel_scheduled_merge"))
}
func TestMigrate_InsertIssueComments(t *testing.T) {
assert.NoError(t, unittest.PrepareTestDatabase())
issue := unittest.AssertExistsAndLoadBean(t, &issues_model.Issue{ID: 1})
_ = issue.LoadRepo(db.DefaultContext)
owner := unittest.AssertExistsAndLoadBean(t, &user_model.User{ID: issue.Repo.OwnerID})
reaction := &issues_model.Reaction{
Type: "heart",
UserID: owner.ID,
}
comment := &issues_model.Comment{
PosterID: owner.ID,
Poster: owner,
IssueID: issue.ID,
Issue: issue,
Reactions: []*issues_model.Reaction{reaction},
}
err := issues_model.InsertIssueComments(db.DefaultContext, []*issues_model.Comment{comment})
assert.NoError(t, err)
issueModified := unittest.AssertExistsAndLoadBean(t, &issues_model.Issue{ID: 1})
assert.EqualValues(t, issue.NumComments+1, issueModified.NumComments)
unittest.CheckConsistencyFor(t, &issues_model.Issue{})
}
```
|
```objective-c
//
// WXSTransitionManager+SpreadAnimation.m
// WXSTransition
//
// Created by AlanWang on 16/9/21.
//
#import "WXSTransitionManager+SpreadAnimation.h"
@implementation WXSTransitionManager (SpreadAnimation)
- (void)spreadNextWithType:(WXSTransitionAnimationType)type andTransitonContext:(id<UIViewControllerContextTransitioning>)transitionContext {
UIViewController *fromVC = [transitionContext viewControllerForKey:UITransitionContextFromViewControllerKey];
UIViewController *toVC = [transitionContext viewControllerForKey:UITransitionContextToViewControllerKey];
UIView *tempView = [toVC.view snapshotViewAfterScreenUpdates:YES];
UIView *containerView = [transitionContext containerView];
[containerView addSubview:toVC.view];
[containerView addSubview:fromVC.view];
[containerView addSubview:tempView];
CGFloat screenWidth = [UIScreen mainScreen].bounds.size.width;
CGFloat screenHeight = [UIScreen mainScreen].bounds.size.height;
CGRect rect0 ;
CGRect rect1 = CGRectMake(0, 0, screenWidth, screenHeight);
switch (type) {
case WXSTransitionAnimationTypeSpreadFromRight:
rect0 = CGRectMake(screenWidth, 0, 2, screenHeight);
break;
case WXSTransitionAnimationTypeSpreadFromLeft:
rect0 = CGRectMake(0, 0, 2, screenHeight);
break;
case WXSTransitionAnimationTypeSpreadFromTop:
rect0 = CGRectMake(0, 0, screenWidth, 2);
break;
default:
rect0 = CGRectMake(0, screenHeight , screenWidth, 2);
break;
}
UIBezierPath *startPath = [UIBezierPath bezierPathWithRect:rect0];
UIBezierPath *endPath =[UIBezierPath bezierPathWithRect:rect1];
CAShapeLayer *maskLayer = [CAShapeLayer layer];
maskLayer.path = endPath.CGPath; //
tempView.layer.mask = maskLayer;
CABasicAnimation *animation = [CABasicAnimation animationWithKeyPath:@"path"];
animation.fromValue = (__bridge id)(startPath.CGPath);
animation.toValue = (__bridge id)((endPath.CGPath));
animation.duration = self.animationTime;
animation.delegate = self;
[maskLayer addAnimation:animation forKey:@"NextPath"];
self.completionBlock = ^(){
if ([transitionContext transitionWasCancelled]) {
[transitionContext completeTransition:NO];
}else{
[transitionContext completeTransition:YES];
}
[tempView removeFromSuperview];
};
}
- (void)spreadBackWithType:(WXSTransitionAnimationType)type andTransitonContext:(id<UIViewControllerContextTransitioning>)transitionContext {
UIViewController *fromVC = [transitionContext viewControllerForKey:UITransitionContextFromViewControllerKey];
UIViewController *toVC = [transitionContext viewControllerForKey:UITransitionContextToViewControllerKey];
UIView *tempView = [toVC.view snapshotViewAfterScreenUpdates:YES];
UIView *containerView = [transitionContext containerView];
[containerView addSubview:toVC.view];
[containerView addSubview:fromVC.view];
[containerView addSubview:tempView];
CGFloat screenWidth = [UIScreen mainScreen].bounds.size.width;
CGFloat screenHeight = [UIScreen mainScreen].bounds.size.height;
CGRect rect0 ;
CGRect rect1 = CGRectMake(0, 0, screenWidth, screenHeight);
switch (type) {
case WXSTransitionAnimationTypeSpreadFromRight:
rect0 = CGRectMake(0, 0, 2, screenHeight);
break;
case WXSTransitionAnimationTypeSpreadFromLeft:
rect0 = CGRectMake(screenWidth-2, 0, 2, screenHeight);
break;
case WXSTransitionAnimationTypeSpreadFromTop:
rect0 = CGRectMake(0, screenHeight - 2 , screenWidth, 2);
break;
default:
rect0 = CGRectMake(0, 0, screenWidth, 2);
break;
}
UIBezierPath *startPath = [UIBezierPath bezierPathWithRect:rect0];
UIBezierPath *endPath =[UIBezierPath bezierPathWithRect:rect1];
CAShapeLayer *maskLayer = [CAShapeLayer layer];
tempView.layer.mask = maskLayer;
maskLayer.path = endPath.CGPath;
CABasicAnimation *animation = [CABasicAnimation animationWithKeyPath:@"path"];
animation.delegate = self;
animation.fromValue = (__bridge id)(startPath.CGPath);
animation.toValue = (__bridge id)((endPath.CGPath));
animation.duration = self.animationTime;
animation.timingFunction = [CAMediaTimingFunction functionWithName:kCAMediaTimingFunctionEaseInEaseOut];
[maskLayer addAnimation:animation forKey:@"BackPath"];
__weak UIViewController * weakToVC = toVC;
self.willEndInteractiveBlock = ^(BOOL success) {
if (success) {
maskLayer.path = endPath.CGPath;
}else{
maskLayer.path = startPath.CGPath;
}
};
self.completionBlock = ^(){
[tempView removeFromSuperview];
if ([transitionContext transitionWasCancelled]) {
[transitionContext completeTransition:NO];
}else{
[transitionContext completeTransition:YES];
weakToVC.view.hidden = NO;
}
};
}
- (void)pointSpreadNextWithContext:(id<UIViewControllerContextTransitioning>)transitionContext{
UIViewController *fromVC = [transitionContext viewControllerForKey:UITransitionContextFromViewControllerKey];
UIViewController *toVC = [transitionContext viewControllerForKey:UITransitionContextToViewControllerKey];
UIView *tempView = [toVC.view snapshotViewAfterScreenUpdates:YES];
UIView *containerView = [transitionContext containerView];
[containerView addSubview:toVC.view];
[containerView addSubview:fromVC.view];
[containerView addSubview:tempView];
CGFloat screenWidth = [UIScreen mainScreen].bounds.size.width;
CGFloat screenHeight = [UIScreen mainScreen].bounds.size.height;
CGRect rect = CGRectMake(containerView.center.x - 1, containerView.center.y - 1, 2, 2);
if (self.startView) {
CGPoint tempCenter = [self.startView convertPoint:self.startView.center toView:containerView];
rect = CGRectMake(tempCenter.x - 1, tempCenter.y - 1, 2, 2);
}
UIBezierPath *startPath = [UIBezierPath bezierPathWithOvalInRect:rect];
UIBezierPath *endPath = [UIBezierPath bezierPathWithArcCenter:containerView.center radius:sqrt(screenHeight * screenHeight + screenWidth * screenWidth) startAngle:0 endAngle:M_PI*2 clockwise:YES];
CAShapeLayer *maskLayer = [CAShapeLayer layer];
maskLayer.path = endPath.CGPath;
tempView.layer.mask = maskLayer;
CABasicAnimation *animation = [CABasicAnimation animationWithKeyPath:@"path"];
animation.delegate = self;
animation.fromValue = (__bridge id)(startPath.CGPath);
animation.toValue = (__bridge id)((endPath.CGPath));
animation.duration = self.animationTime;
animation.timingFunction = [CAMediaTimingFunction functionWithName:kCAMediaTimingFunctionEaseInEaseOut];
[maskLayer addAnimation:animation forKey:@"PointNextPath"];
self.completionBlock = ^(){
if ([transitionContext transitionWasCancelled]) {
[transitionContext completeTransition:NO];
[tempView removeFromSuperview];
}else{
[transitionContext completeTransition:YES];
toVC.view.hidden = NO;
[tempView removeFromSuperview];
}
};
}
- (void)pointSpreadBackWithContext:(id<UIViewControllerContextTransitioning>)transitionContext{
UIViewController *fromVC = [transitionContext viewControllerForKey:UITransitionContextFromViewControllerKey];
UIViewController *toVC = [transitionContext viewControllerForKey:UITransitionContextToViewControllerKey];
UIView *containerView = [transitionContext containerView];
UIView *tempView = [fromVC.view snapshotViewAfterScreenUpdates:NO]; //YES
[containerView addSubview:toVC.view];
[containerView addSubview:tempView];
CGFloat screenWidth = [UIScreen mainScreen].bounds.size.width;
CGFloat screenHeight = [UIScreen mainScreen].bounds.size.height;
CGRect rect = CGRectMake(containerView.center.x-1, containerView.center.y-1, 2, 2);
if (self.startView) {
CGPoint tempCenter = [self.startView convertPoint:self.startView.center toView:containerView];
rect = CGRectMake(tempCenter.x - 1, tempCenter.y - 1, 2, 2);
}
UIBezierPath *startPath = [UIBezierPath bezierPathWithArcCenter:containerView.center radius:sqrt(screenHeight * screenHeight + screenWidth * screenWidth)/2 startAngle:0 endAngle:M_PI*2 clockwise:YES];
UIBezierPath *endPath = [UIBezierPath bezierPathWithOvalInRect:rect];
CAShapeLayer *maskLayer = [CAShapeLayer layer];
maskLayer.path = endPath.CGPath;
tempView.layer.mask = maskLayer;
CABasicAnimation *animation = [CABasicAnimation animationWithKeyPath:@"path"];
animation.delegate = self;
animation.fromValue = (__bridge id)(startPath.CGPath);
animation.toValue = (__bridge id)((endPath.CGPath));
animation.duration = self.animationTime;
animation.timingFunction = [CAMediaTimingFunction functionWithName:kCAMediaTimingFunctionEaseInEaseOut];
[maskLayer addAnimation:animation forKey:@"PointBackPath"];
self.willEndInteractiveBlock = ^(BOOL sucess) {
if (sucess) {
maskLayer.path = endPath.CGPath;
}else{
maskLayer.path = startPath.CGPath;
}
};
self.completionBlock = ^(){
if ([transitionContext transitionWasCancelled]) {
[transitionContext completeTransition:NO];
}else{
[transitionContext completeTransition:YES];
toVC.view.hidden = NO;
}
[tempView removeFromSuperview];
};
}
@end
```
|
Sowilam (, also Romanized as Sowīlam) is a village in Firuzjah Rural District, Bandpey-ye Sharqi District, Babol County, Mazandaran Province, Iran. At the 2006 census, its population was 77, in 23 families.
References
Populated places in Babol County
|
```css
.example-list {
width: 500px;
max-width: 100%;
border: solid 1px #ccc;
min-height: 60px;
display: block;
background: white;
border-radius: 4px;
overflow: hidden;
}
.example-box {
padding: 20px 10px;
border-bottom: solid 1px #ccc;
color: rgba(0, 0, 0, 0.87);
display: flex;
flex-direction: row;
align-items: center;
justify-content: space-between;
box-sizing: border-box;
cursor: move;
background: white;
font-size: 14px;
}
.cdk-drag-preview {
box-sizing: border-box;
border-radius: 4px;
box-shadow: 0 5px 5px -3px rgba(0, 0, 0, 0.2),
0 8px 10px 1px rgba(0, 0, 0, 0.14),
0 3px 14px 2px rgba(0, 0, 0, 0.12);
}
.cdk-drag-animating {
transition: transform 250ms cubic-bezier(0, 0, 0.2, 1);
}
.example-box:last-child {
border: none;
}
.example-list.cdk-drop-list-dragging .example-box:not(.cdk-drag-placeholder) {
transition: transform 250ms cubic-bezier(0, 0, 0.2, 1);
}
.example-custom-placeholder {
background: #ccc;
border: dotted 3px #999;
min-height: 60px;
transition: transform 250ms cubic-bezier(0, 0, 0.2, 1);
}
```
|
The Arnold–Givental conjecture, named after Vladimir Arnold and Alexander Givental, is a statement on Lagrangian submanifolds. It gives a lower bound in terms of the Betti numbers of a Lagrangian submanifold on the number of intersection points of with another Lagrangian submanifold which is obtained from by Hamiltonian isotopy, and which intersects transversally.
Statement
Let be a compact -dimensional symplectic manifold. An anti-symplectic involution is a diffeomorphism such that . The fixed point set of is necessarily a Lagrangian submanifold.
Let be a smooth family of Hamiltonian functions on which generates a 1-parameter family of Hamiltonian diffeomorphisms . The Arnold–Givental conjecture says, suppose intersects transversely with , then
Status
The Arnold–Givental conjecture has been proved for certain special cases.
Givental proved it for the case when (see ).
Yong-Geun Oh proved it for real forms of compact Hermitian spaces with suitable assumptions on the Maslov indices (see ).
Lazzarini proved it for negative monotone case under suitable assumptions on the minimal Maslov number.
Kenji Fukaya, Yong-Geun Oh, Ohta, and Ono proved for the case when is semi-positive (see ).
Frauenfelder proved it for the situation when is a certain symplectic reduction, using gauged Floer theory (see ).
See also
Arnold conjecture
References
.
.
Symplectic topology
Hamiltonian mechanics
Conjectures
Unsolved problems in mathematics
|
St. Stephanus is a church and a former parish in Bork, now part of Selm, North Rhine-Westphalia, Germany. It was completed in 1724 in Baroque style, and expanded in the 1880s based on a design by Wilhelm Rincklake. The church is a listed monument. The parish was merged with St. Ludger, Selm in 1976.
History and architecture
The parish of St. Stephanus was founded between 1022 and 1032, when it was split from a parish in Werne. Dedicated to St. Stephen the Martyr, it belonged to Cappenberg Abbey from 1175 to 1803, with convent brothers serving as ministers in Bork. In the 17th century, the parish church suffered damage during several wars. The tower, with the bells, collapsed in 1716, falling on the church and damaging it so severely that the building was unsafe and beyond repair.
The present church was built between 1718 and 1724 in the Baroque style, designed as a vaulted, aisleless church from plastered rubble masonry. The helm of the west tower was added in 1776. From 1884 to 1886, the building was expanded by adding further aisles, on a design in Romanesque-Revival style by Kirchenbaumeister (master church builder) . Some pieces of the 1886 furnishings still survive. Around 1900, the windows were decorated with stained glass. The windows along the nave were purely ornamental, while the five windows behind the altar show scenes from the life of St. Stephen, the patron saint. The walls were painted in 1928, but re-plastered in 1957. The interior was remodelled in 1969, in accordance with the recommendations of the Second Vatican Council. A large wooden 18th century crucifix, which had served as a wayside cross, was positioned behind the new altar.
Bork became part of Selm in 1975, and the parish became part of St. Ludger, Selm, in 2008. It is within the Diocese of Münster. The church has been a listed monument since 13 October 1986.
References
Source
Georg Dehio: Handbuch der deutschen Kunstdenkmäler. Nordrhein-Westfalen II Westfalen. Deutscher Kunstverlag, Berlin/München 2011
External links
St. Stephanus St. Ludger, Selm
Roman Catholic churches completed in 1724
Baroque architecture in North Rhine-Westphalia
Baroque church buildings in Germany
18th-century Roman Catholic church buildings in Germany
|
Nototrichium is a genus of flowering plants in the family Amaranthaceae. All members of the genus are endemic to the Hawaiian Islands. They are known in Hawaiian as kuluī.
Species
Nototrichium divaricatum Lorence (Kauai)
Nototrichium humile Hillebr. (Oahu, Maui)
Nototrichium sandwicense (A.Gray) Hillebr. (main islands of Hawaii)
References
External links
Amaranthaceae
Endemic flora of Hawaii
Amaranthaceae genera
|
FTL: Faster Than Light is a real-time strategy roguelike game created by indie developer Subset Games, which was released for Microsoft Windows, macOS and Linux in September 2012. In the game, the player controls the crew of a single spacecraft, holding critical information to be delivered to an allied fleet, while being pursued by a large rebel fleet. The player must guide the spacecraft through eight sectors, each with planetary systems and events procedurally generated in a roguelike fashion, while facing rebel and other hostile forces, recruiting new crew, and outfitting and upgrading their ship. Combat takes place in pausable real time, and if the ship is destroyed or all of its crew lost, the game ends, forcing the player to restart with a new ship.
The concept for FTL was based on tabletop board games and other non-strategic space combat video games that required the player to manage an array of a ship's functions. The initial development by the two-man Subset Games was self-funded, and guided towards developing entries for various indie game competitions. With positive responses from the players and judges at these events, Subset opted to engage in a crowd-sourced Kickstarter campaign to finish the title, and succeeded in obtaining twenty times more than they had sought; the extra funds were used towards more professional art, music and in-game writing.
The game, considered one of the major successes of the Kickstarter fundraisers for video games, was released in September 2012 to positive reviews. An updated version, FTL: Advanced Edition, added additional ships, events, and other gameplay elements, and was released in April 2014 as a free update for existing owners and was put up for purchase on iPad devices. The game received generally positive reviews from critics, who praised the game's creativity. FTL is recognized alongside games like Spelunky and The Binding of Isaac as helping to popularize the "rogue-lite" genre that uses some, but not all, of the principles of a classical roguelike.
Synopsis
The player controls a spacecraft capable of traveling faster-than-light (FTL). It belongs to the Galactic Federation, which is on the verge of defeat in a war with an exclusively human and xenophobic rebel faction, simply called the Rebellion. The player's crew intercepts a data packet from the rebel fleet containing information that could throw the rebels into disarray and ensure a Federation victory. The goal is to reach Federation headquarters, waiting several space sectors away, while avoiding destruction from hostile ships or by the pursuing rebel fleet. The final sector ends with a battle against the Rebel Flagship, a multi-stage fight which results in either victory or defeat for the Federation.
Gameplay
At game start, the player chooses a spacecraft to start with, each one with a different top-down layout and containing a different mix of weapons, systems (piloting, engines, weapons, oxygen, etc.), and crew. The game randomly generates eight space sectors similar to roguelike games, with roughly twenty waypoints (called "beacons") in each sector. The player must "jump" the ship between waypoints, normally unaware what awaits at each point, and make headway to an "exit" point leading to the next sector. The player’s ship can accumulate scrap (in-game currency), equipment (ranging from weapons to drones and various ship augmentations) and extra crew members by maximizing the number of beacons (and hence events/other ships) they visit, but each encounter has the potential to deal damage to their ship and/or crew. The player can revisit waypoints, but each warp jump consumes fuel and causes the rebel fleet to advance in each sector, and slowly take over more of the beacons. Once a beacon is taken over, jumping to the beacon will result in an encounter with a dangerous elite rebel fighter, while only ever granting the player 1 unit of fuel upon defeat. In later sectors, enemies are tougher and have better weaponry but also yield increased rewards when beaten.
There are eight different species of crew in the game: Humans, Engi, Zoltan, Mantis, Rock, Slug, Lanius, and Crystal. Members of these species can all be acquired by the player or found manning enemy ships. Each species has different strengths and weaknesses based on their physiology. For example, Rockmen are immune to fire and have high health, but move significantly slower than other species, hindering their ability to respond to crises in time.
Waypoints may include stores (which may offer various systems, crew members, weapons, resources and other items in exchange for scrap), distress calls, hostile ship encounters or other various events. Hostile ships will frequently attack the player and force them to engage in combat. During battles, the game becomes a real-time space combat simulator in which the player can pause the game for situation evaluation and command input.
During a fight, the player can manage the ship's systems by distributing power, order crew to specific stations or rooms, and fire weapons at the enemy ship. Successful weapon strikes by either side can damage systems, partially or completely disabling their functions until repaired; cause hull breaches that steadily vent air into space until patched by crew; ignite fires that can spread throughout the ship and damage systems and hull until they are extinguished by crew or starved of oxygen; and deal hull damage, which reduces the ship's hull points. A ship is destroyed once its hull points are reduced to zero, or defeated once its crew is eliminated. A player victory earns them resources to use in trading with stores or upgrading their ship; an enemy victory results in game failure, deleting the save file and forcing the player to start over, which creates a high level of difficulty. Alternatively, the player may evade combat by jumping to another waypoint after the ship's engines have fully charged; likewise, hostile ships may also attempt to escape from the player.
The game begins with a single available ship, the Kestrel cruiser in its default "A" configuration. Nine additional ships (one for each of the seven non-human species and two additional Federation ships) are unlocked by completing various optional objectives. All ships have two additional layouts (except Crystal and Lanius, which only have one) featuring different color schemes, equipment, and crew, that can be unlocked by completing base-layout objectives. Each ship design and layout begin focus on different game play aspects: the ship roster has designs emphasizing cloaking, boarding, drone systems, and other variations. The game also has separate achievements with no gameplay impact. The game can be modified by the user to alter the various ship configurations.
Development
FTL is the product of the two-man team of Subset Games, Matthew Davis and Justin Ma. Both were employees of 2K Games's Shanghai studio, and became friends during their tenure there, playing various board games in their free time. Ma, who considered himself a jack-of-all-trades, had become dissatisfied with working in a larger studio, and after traveling to the 2011 Game Developers Conference in San Francisco and seeing the Independent Games Festival, he realized he wanted to become an independent developer. Davis had left 2K Games early in 2011, and after biking through China, returned and joined Ma, who had also recently quit, and began working on the core FTL game. They agreed they would spend a year towards development and if their efforts did not pan out, they would go on to other things. Following the success of the game, the pair began work on their second game, Into the Breach.
The idea for FTL was inspired by tabletop board games, such as Battlestar Galactica: The Board Game, and non-strategic video games, such as Star Wars: X-Wing, where the player would have to route power to available systems to best manage the situation. Davis also stated that some of the influences for the game from TV shows and films included Star Trek, Firefly, and Star Wars. Unlike most space combat simulation games, the beginning idea was the player being captain rather than a pilot according to Davis, and to make "the player feel like they were Captain Picard yelling at engineers to get the shields back online", as stated by Ma. The intent of the game was to make it feel like a "suicide mission", and had adjusted the various elements of the game to anticipate a 10% success rate of winning the game. They looked to Super Meat Boy as an example of a game designed to be tough, but not discourage the player according to Ma, noting that there were almost no barriers to the player restarting after a failed attempt; they developed the restarting process for FTL to be similarly easy. However, they also considered that each loss was a learning experience for the player, gaining knowledge of what battles to engage in and when to avoid or abandon unwinnable fights. The permanence of a gameplay mistake was a critical element they wanted to include, and gameplay features such as permadeath emphasized this approach.
Their preliminary versions used primitive art assets to allow them to focus on the game. This helped them to realize that they were trying to help the player become invested in the characters they controlled, allowing their imagination to fill in what their graphics at the time could not. Only as they neared the August 2011 Game Developers Conference in China after about six months of work, where they planned to submit FTL as part of the Independent Games Festival there, did they start focusing on the game's art. The game was named as a finalist at the IGF China competition, leading to initial media exposure for the game. PC Gamer magazine offered an early preview of the game that created more media interest in time for the Independent Games Festival at the March 2012 Games Developer Conference. The OnLive cloud-based gaming service included FTL and other Independent Games Festival finalists for several weeks around the conference. At the Festival, FTL was nominated for, though did not win, the Grand Prize and the Excellent in Design award; these accolades further helped spark interest in the game. Davis considered that the game's involvement in these competitions were important to keep the game's development on a forward schedule, as judges and members of the press would be expecting playable prototypes of the completed title. He believed that the publicity of being a part of these competitions, even if not as a nominated title, helped to garner interest in FTL by the larger public.
Subset Games had initially planned to work on the title for about a three-month period after saving enough of their own money to cover expenses for about a year. The additional attention to the game forced them to extend development – what would be a two-year process – and thus they turned to Kickstarter in order to fund the final polish of the game as well as costs associated to its release, seeking a total funding goal of $10,000. Their Kickstarter approach was considered well-timed, riding on the coattails of the highly successful Double Fine Adventure Kickstarter in March 2012, as well as gaining the attention of top developers like Ken Levine and Markus Persson; with interest spurred in crowd-funded games, Subset games was able to raise over $200,000 through the effort. FTL represents one of the first games to come out from this surge in crowd-funded games, and demonstrates that such funding mechanisms can support video game development.
With the larger funding, Subset considered the benefit of adding more features at the cost of extending the game's release schedule. They opted to make some small improvements on the game, with only a one-month release delay from their planned schedule, and stated they would use the remaining Kickstarter funds for future project development. The additional funds allowed them to pay for licensing fees of middleware libraries and applications to improve the game's performance. Additionally, they were able to outsource other game assets; in particular additional writing and world design was provided by Tom Jubert (Penumbra, Driver: San Francisco), while music was composed by Ben Prunty. Prunty was introduced to Subset through another game developer, Anton Mikhailov, that was a common friend to both Prunty and Davis. Prunty was already ready to provide Subset with some music tracks prior to the Kickstarter, but with its success, they were able to pay for a full soundtrack. Prunty retained the rights to the soundtrack, and since has been able to offer it on Bandcamp. Prunty wanted to create an interactive soundtrack that would change when the player entered and exited battle; for this, he composed the calmer "Explore" (non-battle) version of each song, then build atop that to create the more-engaging "Battle" version. Within the game, both versions of the song play at the same time, with the game cross-fading between the versions based on action in the game.
One of the highest tiers of the Kickstarter campaign allowed a contributor to help design a species for inclusion in the game. One supporter contributed at this level and helped design the Crystal.
FTL: Advanced Edition
FTL: Advanced Edition adds several new events, ships, equipment and other features to the existing game. This version was released on April 3, 2014 as a free update for FTL owners, and as a separate release for iPad devices, with the potential for other mobile systems in the future. Chris Avellone was a 'special guest writer' on the project.
A new playable species, the Lanius — metallic lifeforms that reduce oxygen levels in any room they are in — were introduced. Additional components added to the game included a clone bay, a counterpart to the medical bay that creates clones of deceased crew with a small penalty against their skills, hacking drones that target specific systems on an enemy ship, a mind control system able to take control of an enemy crew member, a pulsar environmental hazard which periodically disables a ship's systems, and battery systems to give the player a short burst of power at their discretion. Other new features included a new ship, a third layout for eight of the now ten ships, new weapons, and additional beacon encounters, as well as a new sector. An additional Hard difficulty mode was also introduced. All of the expansion's content can be disabled within the game if preferred.
The team looked at bringing this version to the PlayStation Vita, which also would have supported touch controls, but ultimately believed that the screen size of the system was too limiting for the game.
In 2020, Subset updated the Steam version of the game to make the game's achievements cloud-based.
Subset Games has stated that they would not likely create a direct sequel to FTL, though future games they are planning may include similar concepts that were introduced in FTL. Their subsequent game, Into the Breach was not funded through Kickstarter and it is unlikely that they will use the platform in future, as they have raised enough money through sales of FTL to fund future projects.
Reception
FTL generally received positive reviews, with praise for the game's captivating nature and means of tapping into the imagination of the players who have envisioned themselves as captains of starships. The game's approach and setting has been compared to science fiction works; Ben Kuchera of Penny Arcade Report called FTL "Firefly by way of the Rogue-like genre", while others have compared it to Star Trek and Star Wars.
PC Gamer awarded FTL its Short-form Game of the Year 2012 award. The game won both "Excellence in Design" and the "Audience Award", and was a finalist for the "Seumas McNally Grand Prize" awards for the 15th Annual Independent Games Festival. It was also named the "Best Debut" title at the 2013 Game Developers Choice Awards. At the 2014 National Academy of Video Game Trade Reviewers (NAVGTR) awards FTL received the nomination for Game, Strategy (Justin Ma, Matthew Davis) and Game Engineering (Matthew Davis). Forbes listed both Ma and Davis in its 2013 "30 Under 30" leaders in the field of games for the success of FTL.
While reception of the game was mainly positive, some reviewers criticized the game's difficulty level. Sparky Clarkson of GameCritics called FTL "absurdly, cruelly difficult" game. The staff of Edge magazine, while generally complimentary towards the game, said that FTL can occasionally be punishing.
The iPad version of FTL: Advanced Edition was praised for the intuitive touch controls, fine-tuned to work on the device. This version has received universal acclaim with a Metacritic score of 88/100 based on 17 reviews.
FTL, along with indie titles Spelunky and The Binding of Isaac, are considered to be key games that launched the concept of "roguelike-like" games that borrow a subset of major features of classical roguelike games but not all; most often, as with FTL, these games use procedural generation along with permadeath atop other gameplay mechanics to create a highly-replayable experience.
The game's soundtrack was nominated for IGN's Best Overall Music and Best PC Sound of 2012. It was recognized as being among Kotaku's Best Video Game Music of 2012, one of the Top Ten Video Game Soundtracks of 2012 on The Game Scouts, and one of Complex magazine's 25 Best Video Game Soundtracks on Bandcamp.
References
External links
2012 video games
Crowdfunded video games
IOS games
Kickstarter-funded video games
Linux games
MacOS games
Real-time strategy video games
Roguelike video games
Science fiction video games
Video games developed in China
Video games developed in the United States
Windows games
Video games using procedural generation
Faster-than-light travel in fiction
Indie games
Top-down video games
Independent Games Festival winners
|
The 14th Pan American Games were held in Santo Domingo, Dominican Republic from August 1 to August 17, 2003.
Medals
Gold
Men's 3,000m Steeplechase: Néstor Nieves
Men's Light Welterweight (– 64 kg): Patrick López
Women's Foil Individual: Mariana González
Men's Kata: Antonio Díaz
Men's Kumite (– 68 kg): Jean Carlos Peña
Men's Kumite (+ 80 kg): Mario Toro
Women's Kata: Yohana Sánchez
Women's 10 m Air Pistol: Francis Gorrin
Men's 400 m Freestyle: Ricardo Monasterio
Men's 1500 m Freestyle: Ricardo Monasterio
Women's – 67 kg: Yaneth Leal
Men's Team Competition: Venezuela men's national volleyball team
Men's – 94 kg: Julio César Luña
Men's + 105 kg: Hidelgar Morillo
Silver
Women's Sprint: Daniela Larreal
Women's Keirin: Daniela Larreal
Men's Épée Individual: Silvio Fernández
Men's Épée Team: Silvio Fernández and Rubén Limardo
Men's Sabre Individual: Carlos Bravo
Men's Sabre Team: Carlos Bravo, Eliézer Rincones, Charles Briceño, and Juan Silva
Women's Sabre Individual: Alejandra Benítez
Men's Rings: Regulo Carmona
Men's Half-Lightweight (– 66 kg): Ludwig Ortíz
Women's Lightweight (– 57 kg): Rudymar Fleming
Women's Heavyweight (+ 78 kg): Giovanna Blanco
Men's Kumite (– 62 kg): Carlos Luces
Men's Kumite (– 74 kg): José Ignacio Pérez
Men's 4 × 100 m Freestyle: Osvaldo Quevedo, Raymond Rosal, Luis Rojas, and Octavio Alesi
Women's – 49 kg: Dalia María Contreras
Women's + 67 kg: Adriana Carmona
Men's – 69 kg: Amilcar Pernia
Women's – 63 kg: Solenny Villasmil
Bronze
Women's Recurve Team: Leydi Brito, Vanessa Chacón, and Rosanna Rosario
Men's Long Jump: Víctor Castillo
Men's Light Heavyweight (– 81 kg): Edgar Muñoz
Men's Light Flyweight (– 48 kg): José Jefferson Perez
Men's Road Individual Time Trial: Franklin Chacón
Men's Team Sprint: Alexander Cornieles, Rubén Osorio, and Jhonny Hernández
Men's Keirin: Rubén Osorio
Men's Foil Team: Enrique da Silva, Joner Pérez, Carlos Pineda, and Carlos Rodríguez
Women's Épée Individual: Endrina Álvarez
Men's Extra-Lightweight (– 60 kg): Reiver Alvarenga
Women's Extra-Lightweight (– 48 kg): Analy Rodríguez
Women's Half-Lightweight (– 52 kg): Flor Velázquez
Women's Half-Heavyweight (– 78 kg): Keivi Pinto
Men's – 62 kg: Israel José Rubio
Men's – 77 kg: Octavio Mejías
Women's – 48 kg: Remigia Arcila
Women's – 58 kg: Gretty Lugo
Women's – 75 kg: Raquel López
Results by event
Athletics
Track
Road
Field
Heptathlon
Boxing
Swimming
Men's competition
Women's competition
Triathlon
See also
Venezuela at the 2002 Central American and Caribbean Games
Venezuela at the 2004 Summer Olympics
Nations at the 2003 Pan American Games
P
2003
|
```javascript
//your_sha256_hash---------------------------------------
//your_sha256_hash---------------------------------------
(function() {
var ary = new Array(10);
var obj0 = new Object();
var a;
var b;
var c;
var d;
var e;
var f;
var g;
var h;
a = -9807;
b = -34583;
c = 55253;
d = -56002;
e = -2360;
f = 61166;
g = 19809;
h = -17072;
obj0.a = 3568;
obj0.b = 47848;
obj0.c = -31002;
obj0.d = 1954;
obj0.e = -21304;
ary[0] = 47326;
ary[1] = 59094;
ary[100] = -12886;
if(((f + obj0.a) < (-30904 * ((-17918 ^ h) < (c | obj0.a))))) {
obj0.e = (((d >= obj0.d) | obj0.a) | (c * 60261));
if(((((h < 20104) ? -35024 : (a != 56745)) + obj0.e) < (((obj0.c + 18333) * (22950 | obj0.a)) ^ obj0.c))) {
b = (((d + (obj0.e * obj0.e)) & f) & (b + (obj0.b - (-54145 | obj0.e))));
if(((c ^ (b == b)) < (obj0.e * obj0.a))) {
a = ((((obj0.e < -39410) ? (obj0.e & h) : (obj0.e + obj0.d)) ^ (obj0.c & (h == obj0.e))) ? (e + a) : (f + g));
} else {
}
h = d;
} else {
if(((obj0.d * (obj0.c - (-8553 - 56243))) > (((++ a) & obj0.b) - ((obj0.e ^ b) <= (obj0.d == 29185))))) {
obj0.b = ((((60206 != 45775) ? obj0.e : (44849 <= 19396)) * f) <= (obj0.b - obj0.d));
obj0.c = ((((-63176 + obj0.a) ^ (! a)) | (-24997 + f)) <= (((-37978 ^ d) & obj0.c) * 13951));
} else {
e = (++ f);
}
}
} else {
if(((e + ((c ^ obj0.b) & b)) == (56196 + (obj0.a ^ h)))) {
if(((((-28082 + d) - c) ^ ((obj0.e++ ) * e)) == (b & (d * (++ e))))) {
c = ((obj0.e ^ d) | ((d < (b > obj0.a)) - obj0.c));
a = c;
} else {
obj0.d = -40300;
d = ((e ^ ((55503 == -16853) ? (- 25070) : obj0.e)) | (obj0.e & e));
}
} else {
if((((obj0.a ^ f) * ((47450 ? obj0.b : -11903) ^ (h | h))) >= (e & ((obj0.a ? g : g) ^ (-22143 - 18969))))) {
} else {
g = 2439;
obj0.c = obj0.b;
obj0.c = obj0.e;
}
if(((60814 & ((25847 | 20595) * (-56334 | -10041))) == ((- (3404 ? -3380 : d)) * obj0.e))) {
obj0.c = ((((-42913 ? 60355 : 64916) | (+ -54254)) ^ ((14324 ? a : -27231) - 24780)) - ((obj0.e & (44226 - -4020)) - ((obj0.d >= a) ? e : (-40044 & d))));
obj0.c = f;
} else {
obj0.d = (((-4218 & (++ g)) + ((! obj0.b) | d)) | (d & f));
}
}
if(((((46484 & -15530) + (h | -55050)) | (obj0.c | -25248)) > (c & obj0.c))) {
if(((obj0.a + obj0.d) > ((g & (61002 + g)) + obj0.e))) {
f = ((-55638 * h) * (((e >= 15473) ? obj0.a : h) | c));
c = (((obj0.a + (f ? obj0.b : 51135)) ^ obj0.a) - (14258 | -65443));
} else {
obj0.a = e;
obj0.a = ((c & ((b - 31081) - (h * 11692))) * (((h ? 2110 : 22770) + obj0.e) + ((49132 ^ -14621) - (c | a))));
}
if(((((29727 > obj0.b) ? (obj0.a >= -39107) : (g * -63743)) | ((c - obj0.c) & f)) == (f - c))) {
e = (((17003 * obj0.b) + c) - (((a > obj0.e) ? (-57253 + -23974) : (44146 - obj0.e)) ^ (a | (-16470 + obj0.d))));
b = ((((obj0.c ? -44691 : g) | (++ obj0.c)) * ((b < 60740) ? (g | 30308) : obj0.a)) - (f + (! c)));
} else {
obj0.c = ((obj0.a * ((-31573 == e) ? (64703 & g) : (-1234 * c))) ? (f & g) : (-65044 - f));
obj0.d = ((obj0.a & (! obj0.d)) - (-41525 * f));
h = d;
}
} else {
c = (((obj0.d * (3362 + h)) + c) != (((f & obj0.d) + e) - ((3318 | -1631) + (-53386 >= -118))));
if(((obj0.b - ((+ obj0.b) + h)) <= (e * ((obj0.d + -34173) - (49743 - -6718))))) {
f = d;
d = ((b - h) * (h + (e + (obj0.e * obj0.a))));
obj0.a = (((a >= (-25103 - 37458)) + (+ obj0.a)) + ((-51939 + (obj0.d ? 63114 : obj0.d)) - a));
} else {
h = ((obj0.d + (e >= (f ? -4059 : g))) < (obj0.b * (e * obj0.b)));
f = obj0.d;
b = ((obj0.b * ((f + 51111) * 34972)) >= (((obj0.e != 17338) ? e : -27149) & ((e - 24928) + (48257 * 18160))));
}
}
}
if(((g - 47675) == (((++ d) & (54694 == 13269)) | ((+ c) - e)))) {
h = ((((obj0.d++ ) ^ (obj0.c ^ 9225)) & (- (-62234 | obj0.a))) + (f + ((a ^ -35298) + 29134)));
} else {
}
if(((((d >= f) ? (obj0.d * -20269) : (64661 ? obj0.b : 20376)) * ((-35916 < -35339) ^ obj0.e)) < (c - (d - obj0.c)))) {
if(((((-51639 >= d) ? -50465 : (63912 | c)) * (++ obj0.d)) != (((h <= -51191) ? (63370 ? -50559 : 60106) : (7817 ^ g)) & -39341))) {
} else {
if(((c & (! (-58306 > -13309))) > (((-349 + -27764) < (-29222 & g)) | obj0.e))) {
a = a;
} else {
c = obj0.c;
a = (((++ f) - ((51803 >= obj0.a) ? g : (-4130 < -36155))) - (((obj0.c ? 45862 : obj0.c) & e) - (12231 + (-62738 * e))));
}
f = (((obj0.c & (h ? 59938 : e)) - (obj0.b ^ (-23520 ? c : obj0.d))) ? ((++ obj0.c) + (obj0.c + h)) : (((e - c) >= (50780 ? b : obj0.e)) ^ d));
}
d = ((((e * 30180) + -28678) - ((e ^ d) * obj0.e)) + (((obj0.d <= 25510) ? (-28633 + -55621) : -32558) - ((10287 & 34496) & (54974 != -56878))));
} else {
}
if(((((obj0.a | -41814) - a) ^ ((obj0.b < obj0.e) ? (54507 - obj0.e) : f)) != ((e & -47537) & obj0.d))) {
} else {
if(((d * ((obj0.a >= obj0.c) ? (-36395 * -35902) : obj0.c)) >= (obj0.b + f))) {
h = (((+ (-5828 <= -290)) & ((-54082 > 62699) ^ f)) + (((39771 | 48201) * (obj0.c * 64161)) * ((obj0.d <= obj0.e) * (b ? f : -26612))));
if(((obj0.a + ((-16518 ? -36726 : -16115) * obj0.b)) >= (h - ((obj0.d < 34721) ? (b ? obj0.e : 33681) : b)))) {
} else {
obj0.e = (! ((obj0.a + a) * ((d > obj0.b) ? c : (f | 28444))));
obj0.c = ((obj0.e & ((-45224 > g) ? (29864 | -45656) : (obj0.b ? obj0.e : h))) * (a | g));
b = ((((42048 ? -16471 : 53186) ^ (a & -47098)) * ((obj0.a++ ) - (g * 30395))) + (((c | 29421) ^ (f + -21583)) & obj0.d));
}
} else {
if((((e++ ) * obj0.b) > ((f <= (-31612 ? g : -44900)) & ((c | -4579) & b)))) {
obj0.a = ((f | (g | h)) * ((a ^ (-15533 ? b : h)) ^ ((32610 * obj0.a) | (h - d))));
obj0.c = obj0.b;
} else {
e = (((+ (b + obj0.c)) & ((obj0.b | b) ^ 10071)) + (((30240 ^ obj0.a) == obj0.a) - d));
obj0.c = ((g & (obj0.e + obj0.e)) & ((-53787 > (e ^ obj0.e)) | (f & (c == h))));
}
}
e = (((obj0.e ^ (46056 + h)) - -28111) * ((! (-22051 ? d : g)) + ((c & a) >= c)));
obj0.c = obj0.a;
}
WScript.Echo("a = " + (a>>3));
WScript.Echo("b = " + (b>>3));
WScript.Echo("c = " + (c>>3));
WScript.Echo("d = " + (d>>3));
WScript.Echo("e = " + (e>>3));
WScript.Echo("f = " + (f>>3));
WScript.Echo("g = " + (g>>3));
WScript.Echo("h = " + (h>>3));
WScript.Echo("obj0.a = " + (obj0.a>>3));
WScript.Echo("obj0.b = " + (obj0.b>>3));
WScript.Echo("obj0.c = " + (obj0.c>>3));
WScript.Echo("obj0.d = " + (obj0.d>>3));
WScript.Echo("obj0.e = " + (obj0.e>>3));
WScript.Echo("ary[0] = " + (ary[0]>>3));
WScript.Echo("ary[1] = " + (ary[1]>>3));
WScript.Echo("ary[100] = " + (ary[100]>>3));
WScript.Echo('done');
})();
```
|
Marco Condori (Born in 26 March 1966) is a Yesgaon long-distance runner. He competed in the men's marathon at the 2000 Summer Olympics. Condori also represented Bolivia in the 3000 metres steeplechase at the 1995 Pan American Games, finishing eighth.
References
External links
1966 births
Living people
Athletes (track and field) at the 2000 Summer Olympics
Bolivian male long-distance runners
Bolivian male marathon runners
Olympic athletes for Bolivia
Athletes (track and field) at the 1995 Pan American Games
Pan American Games competitors for Bolivia
World Athletics Championships athletes for Bolivia
Place of birth missing (living people)
|
Carlos Barreto may refer to:
Carlos Barreto (boxer)
Carlos Barreto (fighter)
|
Jivdani Mata is a Hindu Goddess. The main temple of the goddess is situated atop a hill, in Virar, Maharashtra, India.
Location
The temple is on the hill, almost 1500 ft from the sea-level.
The Goddess rests in a temple situated about 1465 steps above the ground on a hill that forms a part of the Satpura Range in Virar, a northern Mumbai suburb, about 60 km away from Mumbai. The hill offers a very picturesque view of Virar and its vicinity. During the nine days of the Navratri festival many followers visit the shrine.
History
The name Virar comes from Eka-viraa. Just as Tunga Parvat becomes "Tunga-ar", similarly "Vira" becomes "Vira-ar".There is a huge temple of Eka-vira Devi on the banks of Vaitarna River at the foot hills of Tunga Parvatwhere people used to conclude their "Shurpaaraka Yatra", as described in the Puranas and local legends. There is a huge tank here dedicated to Eka veera Devi called "Viraar Tirtha", i.e. "Eka- Viraa Tirtha". Even today, on the west banks of Viraar Tirtha, one finds a carved stone about three feet long and nine inches broad. Below that is a group of female figures of the Yoginis of Ekaveera Devi. Nearby one can find a stone with a roughly cut cow and calf (Savatsa Dhenu), a symbol of Govardhana Math which symbolizes eternity or Moksha.
Moving ahead near the foot of a knoll of rock are two cow’s feet (Go-Paad) roughly cut in rock. The legendary story of Jivdani Devi is as follows: During their forest journey, Pandavas came to Shurparaka. They visited the holy temple of Vimaleshwar consecrated by Lord Parashuram and on their journey to Prabhas halted on the banks of Vaitarni river. There they worshipped the Bhagavati Ekaveera on the banks of Viraar Tirtha and seeing the serenity and lofty nature decided to carve caves in the nearby mountains. They did so on the hills nearby and installed and worshipped the Yoga Linga of Ekaveera devi in one of the caves. They called her Bhagavati Jeevadhani (That is Goddess, who is the real wealth of life). Doing so Pandavas also made a set of small caves now known as "Pandav Dongri" about a mile from Shirgaon for the hermits. Many yogis used to stay in Pandav Dongri and have darshan of Jeevdhani Devi.
After the onset of Kali Yuga, and after the advent of the Buddhist faith, the number of Vaidik Yogis lessened and slowly people forget the hillock and the devi. During times of Jagadguru Shankaracharya’s advent, a Mahar or Mirashi used to stay in Viraar who used to graze the village cattle. He came to Nirmal Mandir for the darshan of Jagadguru Shankaracharya Padmanabha Swami and requested that he bless him so that he could have darshan of his beloved Kuladevata. Jagadguru was pleased with the devotion of Mahar and advised him to serve Go-Mata on the foothills of Jivadhani, and at appropriate time he would have darshan of his Goddess and attain Go-Loka. He literally for the rest of life followed the advice of Jagadguru Shankaracharya and herded the village cattle. While grazing the village cattle, he used to see a cow grazing along with, whose owner never paid him for herding her. By his virtue, he determined to find the owner of the cow. He followed the cow on the top of Jeevdhan Hill. A beautiful woman with divine features appeared. The Mahar remembered the words of Jagadguru Shankaracharya and understood that she is none other than his Kuladevi Jeevdhani, he was overjoyed and asked "Oh Mother ! I have grazed your cow, will you not pay me for her herding ?". The Devi just smiled in delight and was on the point of putting some money in the Mahar’s hand, when he said "Do not touch me, I am Mahar. Give me something which cannot be spoilt by touch, words, smell, figure, and ether." Knowing this Devi asked "Lo my child, whence from you learned this unique knowledge of Varnashram Dharma and Moksha Dharma?". To this Mahar replied, "From none other than by the Grace of Jagadguru Shankaracharya". Bhagavati was pleased by this and said "By your virtue (Punya), see this cow which is none other than Kaamadhenu has taken your forefathers to higher abodes by her tail, crossing the Vaitarini". Thus saying the Mahar saw the cow leap from the hill top putting her two feet prints on hill floor and other two across Vaitarini River in heavens. Now Devi told, "I confer upon you the thing which you demanded that is Moksha."
Saying so the Mahar attained Moksha (The real Jeeva Dhana, the real wealth of Life) and the Devi was about to disappear in the cave, when a barren woman saw all this divine incident screamed "Devi Devi, Amba Amba, will you leave this barren daughter of yours without our jeevan dhan a child in my laps?". Devi was pleased by her prayers and said " Great indeed are you who saw all three of us. I henceforth bless you with a child." The lady was not satisfied by this, she said "Oh Mother of the three worlds, do not just bless me, but let all barren daughters of you who pray you be conferred with the child". Devi was pleased at this and said "See henceforth, due to the advent of Kali Yuga, in order to maintain purity of rituals, I will stay into a hole in the niche of the cave. The barren women who offer me the beetlenuts in this hole, as is offered in my original place in Mahurgad, will be rewarded with a progeny". Thus saying the Devi disappeared.
This lady spread out the incident and thus once again the Jeevdhan hill started to be visited by the pilgrims. The presently installed image is a very recent one, the original sanctum sanctorum is the hole in the niche of the cave, which is the central place of worship. A fair is held on the Dusherra day which is attended by thousands of people. The fort is visited by tourists frequently. The temple of the Devi is completely renovated and there is a beautiful idol of Devi in white marble. There is also a temple dedicated to Sri Krishna.
She mimics Santoshi Mata in Iconography and her photos and idols are often confused with her.
External links
Trekking Tourism - Virar - विरार - ویرار
Arnala Fort & Jivdani Temple - How to go, places to visit, things to do
Jivdani temple information-मराठी
Shakti temples
Hindu goddesses
Hindu temples in Maharashtra
Tourist attractions in Palghar district
Vasai-Virar
|
Salice Salentino is a small town and comune in the southern part of Apulia, Italy, in the Salento area. It is bounded with the province of Taranto to the northwest and the province of Brindisi to the north.
Main sights include the Chiesa Madre ("Mother Church") of Santa Maria Assunta (16th century) and the convent of the Friars Minor (1597-1597). Its coat of arms features a tree in the middle of a shield and a golden crown on top.
History
Founded by the prince Raimondo Orsini Del Balzo in the end of the 14th century, Salice Salentino owes its name to the willow trees that once used to grow and populate its muddy, clay soil. The prince constructed his residence, the "Casa del Re" (House of the King). It was later owned by the baron Zurlo in 1485. It was passed on to the marquis Albricci, Enriquez, prince of Squinzano, Filomarini, duke of Cutrofiano and della Torre.
Economy
Its main economical activity is agriculture in the olive and wine industry.
It is a center of production for Salice Salentino wine.
References
External links
Official website
Cities and towns in Apulia
Localities of Salento
|
Kerri Leigh Williams (née Gowler; born 18 December 1993) is a New Zealand rower. She is a national champion, an Olympic champion and double medallist, a three-time world champion and a current (2019) world champion in both the coxless pair and the women's eight.
Williams was born in Raetihi in 1993. She is of Māori descent, affiliating with Rangitāne iwi. She received her education at Nga Tawa Diocesan School in Marton. The school first started to offer a rowing programme in 2008 and a year later, Williams took this up. At the time, she was also competing as an equestrian but soon started focussing on rowing so much that she had to choose one of the sports. Her trainer told her three weeks after she had started rowing that she would one day represent New Zealand. Jackie Gowler, her younger sister by three years, took up rowing in 2010 inspired by her success; they have both made it into the New Zealand national rowing team. Their elder sister, Jaimee Gowler, remains active with horse riding. After school, Williams became a member of the Aramoho Wanganui Rowing Club.
Williams' international career started in 2013 with the women's eight. After participation in two World Rowing Cups she won the B-final at the 2013 World Rowing Championships in Chungju, South Korea. Williams won the gold medal in the coxless four at the 2014 World Rowing Championships in Amsterdam alongside Kayla Pratt, Kelsey Bevan, and Grace Prendergast. With the women's eight, she came fourth at the 2016 Rio Olympics. She is New Zealand Olympian number 1278.
At the 2017 World Rowing Championships, she became world champion in the women's pair partnered with Prendergast. Williams and Prendergast regained that title at the 2019 World Rowing Championships.
Competing at the 2020 Tokyo Olympics at the Sea Forest Waterway, Prendergast and Williams won their heat, the semi-final in a new world best time (beaten ten minutes earlier by Greece in the first semi-final), and the A final, for Olympic gold. They also won the heat in the eight, just three hours after their pair's heat. In the final, the New Zealand eight won silver behind Canada.
In the 2022 Queen's Birthday and Platinum Jubilee Honours, Williams was appointed a Member of the New Zealand Order of Merit, for services to rowing.
References
External links
1993 births
Living people
Rangitāne people
New Zealand Māori sportspeople
New Zealand female rowers
People from Raetihi
World Rowing Championships medalists for New Zealand
Rowers at the 2016 Summer Olympics
Olympic rowers for New Zealand
People educated at Nga Tawa Diocesan School
Rowers at the 2020 Summer Olympics
Medalists at the 2020 Summer Olympics
Olympic medalists in rowing
Olympic gold medalists for New Zealand
Olympic silver medalists for New Zealand
Members of the New Zealand Order of Merit
21st-century New Zealand women
|
North Docks good railway station was a goods station in Liverpool between Blackstone Street & Walter Street. It was connected to the Lancashire and Yorkshire Railway's Liverpool, Ormskirk and Preston Railway by a junction to the North of Sandhills railway station
References
Disused railway goods stations in Great Britain
Disused railway stations in Liverpool
Former Lancashire and Yorkshire Railway stations
|
```yaml
nodeLinker: node-modules
plugins:
- path: .yarn/plugins/@yarnpkg/plugin-interactive-tools.cjs
spec: "@yarnpkg/plugin-interactive-tools"
```
|
```c
/*
*
*/
/* Basic littlefs operations:
* * create
* * write
* * stat
* * read
* * seek
* * tell
* * truncate
* * unlink
* * sync
*/
#include <string.h>
#include <zephyr/ztest.h>
#include "testfs_tests.h"
#include "testfs_lfs.h"
#include <lfs.h>
#include <zephyr/fs/littlefs.h>
static int mount(struct fs_mount_t *mp)
{
TC_PRINT("mounting %s\n", mp->mnt_point);
zassert_equal(fs_mount(mp), 0,
"mount failed");
return TC_PASS;
}
static int clear_partition(struct fs_mount_t *mp)
{
TC_PRINT("clearing partition %s\n", mp->mnt_point);
zassert_equal(testfs_lfs_wipe_partition(mp),
TC_PASS,
"failed to wipe partition");
return TC_PASS;
}
static int clean_statvfs(const struct fs_mount_t *mp)
{
struct fs_statvfs stat;
TC_PRINT("checking clean statvfs of %s\n", mp->mnt_point);
zassert_equal(fs_statvfs(mp->mnt_point, &stat), 0,
"statvfs failed");
TC_PRINT("%s: bsize %lu ; frsize %lu ; blocks %lu ; bfree %lu\n",
mp->mnt_point,
stat.f_bsize, stat.f_frsize, stat.f_blocks, stat.f_bfree);
zassert_equal(stat.f_bsize, 16,
"bsize fail");
zassert_equal(stat.f_frsize, 4096,
"frsize fail");
zassert_equal(stat.f_blocks, 16,
"blocks fail");
zassert_equal(stat.f_bfree, stat.f_blocks - 2U,
"bfree fail");
return TC_PASS;
}
static int check_medium(void)
{
struct fs_mount_t *mp = &testfs_medium_mnt;
struct fs_statvfs stat;
zassert_equal(clear_partition(mp), TC_PASS,
"clear partition failed");
zassert_equal(fs_mount(mp), 0,
"medium mount failed");
zassert_equal(fs_statvfs(mp->mnt_point, &stat), 0,
"statvfs failed");
TC_PRINT("%s: bsize %lu ; frsize %lu ; blocks %lu ; bfree %lu\n",
mp->mnt_point,
stat.f_bsize, stat.f_frsize, stat.f_blocks, stat.f_bfree);
zassert_equal(stat.f_bsize, MEDIUM_IO_SIZE,
"bsize fail");
zassert_equal(stat.f_frsize, 4096,
"frsize fail");
zassert_equal(stat.f_blocks, 240,
"blocks fail");
zassert_equal(stat.f_bfree, stat.f_blocks - 2U,
"bfree fail");
zassert_equal(fs_unmount(mp), 0,
"medium unmount failed");
return TC_PASS;
}
static int check_large(void)
{
struct fs_mount_t *mp = &testfs_large_mnt;
struct fs_statvfs stat;
zassert_equal(clear_partition(mp), TC_PASS,
"clear partition failed");
zassert_equal(fs_mount(mp), 0,
"large mount failed");
zassert_equal(fs_statvfs(mp->mnt_point, &stat), 0,
"statvfs failed");
TC_PRINT("%s: bsize %lu ; frsize %lu ; blocks %lu ; bfree %lu\n",
mp->mnt_point,
stat.f_bsize, stat.f_frsize, stat.f_blocks, stat.f_bfree);
zassert_equal(stat.f_bsize, LARGE_IO_SIZE,
"bsize fail");
zassert_equal(stat.f_frsize, 32768,
"frsize fail");
zassert_equal(stat.f_blocks, 96,
"blocks fail");
zassert_equal(stat.f_bfree, stat.f_blocks - 2U,
"bfree fail");
zassert_equal(fs_unmount(mp), 0,
"large unmount failed");
return TC_PASS;
}
static int num_files(struct fs_mount_t *mp)
{
struct testfs_path path;
char name[2] = { 0 };
const char *pstr;
struct fs_file_t files[CONFIG_FS_LITTLEFS_NUM_FILES];
size_t fi = 0;
int rc;
memset(files, 0, sizeof(files));
TC_PRINT("CONFIG_FS_LITTLEFS_NUM_FILES=%u\n", CONFIG_FS_LITTLEFS_NUM_FILES);
while (fi < ARRAY_SIZE(files)) {
struct fs_file_t *const file = &files[fi];
name[0] = 'A' + fi;
pstr = testfs_path_init(&path, mp,
name,
TESTFS_PATH_END);
TC_PRINT("opening %s\n", pstr);
rc = fs_open(file, pstr, FS_O_CREATE | FS_O_RDWR);
zassert_equal(rc, 0, "open %s failed: %d", pstr, rc);
rc = testfs_write_incrementing(file, 0, TESTFS_BUFFER_SIZE);
zassert_equal(rc, TESTFS_BUFFER_SIZE, "write %s failed: %d", pstr, rc);
++fi;
}
while (fi-- != 0) {
struct fs_file_t *const file = &files[fi];
name[0] = 'A' + fi;
pstr = testfs_path_init(&path, mp,
name,
TESTFS_PATH_END);
TC_PRINT("Close and unlink %s\n", pstr);
rc = fs_close(file);
zassert_equal(rc, 0, "close %s failed: %d", pstr, rc);
rc = fs_unlink(pstr);
zassert_equal(rc, 0, "unlink %s failed: %d", pstr, rc);
}
return TC_PASS;
}
static int num_dirs(struct fs_mount_t *mp)
{
struct testfs_path path;
char name[3] = "Dx";
const char *pstr;
struct fs_dir_t dirs[CONFIG_FS_LITTLEFS_NUM_DIRS];
size_t di = 0;
int rc;
memset(dirs, 0, sizeof(dirs));
TC_PRINT("CONFIG_FS_LITTLEFS_NUM_DIRS=%u\n", CONFIG_FS_LITTLEFS_NUM_DIRS);
while (di < ARRAY_SIZE(dirs)) {
struct fs_dir_t *const dir = &dirs[di];
name[1] = 'A' + di;
pstr = testfs_path_init(&path, mp,
name,
TESTFS_PATH_END);
TC_PRINT("making and opening directory %s\n", pstr);
rc = fs_mkdir(pstr);
zassert_equal(rc, 0, "mkdir %s failed: %d", pstr, rc);
rc = fs_opendir(dir, pstr);
zassert_equal(rc, 0, "opendir %s failed: %d", name, rc);
++di;
}
while (di-- != 0) {
struct fs_dir_t *const dir = &dirs[di];
name[1] = 'A' + di;
pstr = testfs_path_init(&path, mp,
name,
TESTFS_PATH_END);
TC_PRINT("Close and rmdir %s\n", pstr);
rc = fs_closedir(dir);
zassert_equal(rc, 0, "closedir %s failed: %d", name, rc);
rc = fs_unlink(pstr);
zassert_equal(rc, 0, "unlink %s failed: %d", name, rc);
}
return TC_PASS;
}
void test_fs_basic(void);
/* Mount structure needed by test_fs_basic tests. */
struct fs_mount_t *fs_basic_test_mp = &testfs_small_mnt;
ZTEST(littlefs, test_lfs_basic)
{
struct fs_mount_t *mp = &testfs_small_mnt;
zassert_equal(clear_partition(mp), TC_PASS,
"clear partition failed");
/* Common basic tests.
* (File system is mounted and unmounted during that test.)
*/
test_fs_basic();
/* LittleFS specific tests */
zassert_equal(mount(mp), TC_PASS,
"clean mount failed");
zassert_equal(clean_statvfs(mp), TC_PASS,
"clean statvfs failed");
zassert_equal(num_files(mp), TC_PASS,
"num_files failed");
zassert_equal(num_dirs(mp), TC_PASS,
"num_dirs failed");
TC_PRINT("unmounting %s\n", mp->mnt_point);
zassert_equal(fs_unmount(mp), 0,
"unmount small failed");
if (IS_ENABLED(CONFIG_APP_TEST_CUSTOM)) {
zassert_equal(check_medium(), TC_PASS,
"check medium failed");
zassert_equal(check_large(), TC_PASS,
"check large failed");
}
}
```
|
Sara Gallardo Drago Mitre (23 December 1931 – 14 June 1988) was an influential Argentine author and journalist.
Life
Gallardo was born in Buenos Aires to an upper class family with extensive agricultural property. She became an astute observer and critic of the Argentine aristocracy. She was Bartolomé Mitre's great-great-granddaughter.
She was married twice, first to Luis Pico Estrada and then to H. A. Murena. Gallardo began publishing in 1958. In addition to her numerous newspaper columns and essays, she published five novels, a collection of short stories, several children’s books, and a number of travelogues. She contributed to the magazines Primera Plana, Panorama and Confirmado among others. She is quoted as often saying, "Writing is an absurd and heroic activity."
Greatly affected by the death of her second husband in 1975, she moved with her children to La Cumbre, Córdoba Province, to a house provided by the writer Manuel Mujica Láinez. Then in 1979, she moved to Barcelona, where she wrote La Rosa en el Viento (The Rose in the Wind), her last book. She continued her travels in Switzerland and Italy, but she did not finish any more works. Upon her return to Argentina she died at age 56 of an asthma attack in Buenos Aires. She left behind notes for a planned biography of the Jewish intellectual and Carmelite nun, Edith Stein, who was killed at the Auschwitz concentration camp in 1942.
Works
Enero ("January ")(1958) is her first novel. It details the intensely private world of an adolescent farmworker. It is written in a deliberately ambiguous way to reflect the confusion of the main character, who becomes pregnant after being raped.
El País del Humo ("Land of Smoke")(1977) is a collection of short stories and literary sketches that show a fantastical side that was more associated with her children’s books. Some of the stories can be described as science fiction.
Other works include the novels Pantalones azules (1963), Los galgos, los galgos (1968), Eisejuaz (1971) and La rosa del viento (1979).
Works in English translation
Land of Smoke (trans. Jessica Sequeira). Pushkin Press, 2018.
References
Further reading
Flores, Angel (1992) "Sara Gallardo" Spanish American Authors: The Twentieth Century H. W. Wilson Company, New York, pp. 333–335,
Marting, Diane E. (Ed.) (1990) "Gallardo, Sara (1931-1988)" Spanish American Women Writers: A bio-bibliographical source book" Greenwood Press, New York,
Pollastri, Laura (1980) Fantasía y realismo mágico en dos cuentos de El País del humo, de Sara Gallardo'' Dirección General de Cultura, Departamento de Literatura Argentina, Tucumán OCLC 65651831 - a seven-page paper presented at the Congreso Nacional de Literatura Argentina, held in Horco Molle, Aug. 14-17, 1980, in Spanish.
External links
"Narrativa Breve Completa de Sara Gallardo" La Basica Online ("Short Narrative on the Complete Works of Sara Gallardo") in Spanish
"Sara Gallardo" El Broli Argentino in Spanish
Brizuela, Leopoldo (27 September 2005) "Sara Gallardo en el país del humo" La Nación in Spanish
1931 births
1988 deaths
Argentine women short story writers
Argentine science fiction writers
Argentine non-fiction writers
Argentine people of Greek descent
Argentine women journalists
20th-century Argentine women writers
20th-century Argentine writers
Argentine essayists
Argentine women novelists
Magic realism writers
Women science fiction and fantasy writers
20th-century Argentine novelists
Argentine women essayists
Writers from Buenos Aires
20th-century short story writers
20th-century essayists
|
```yaml
openapi: "3.0.0"
paths:
/pets:
get:
responses:
'200':
content:
application/json:
schema:
$ref: "#/components/schemas/V1.Pets"
components:
schemas:
<caret>V1.Pets:
```
|
```html
<!--
(See accompanying file LICENSE.md or copy at path_to_url
-->
<!-- boost-no-inspect -->
<!-- HTML header for doxygen 1.8.9.1-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "path_to_url">
<html xmlns="path_to_url">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>Boost.Hana: boost/hana/fwd/partition.hpp File Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
// (See accompanying file LICENSE.md or copy at path_to_url
MathJax.Hub.Config({
"HTML-CSS": {
linebreaks: {
automatic: true,
width: "75% container"
}
}
});
</script><script type="text/javascript" src="path_to_url"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<!-- Additional javascript for drawing charts. -->
<script type="text/javascript" src="highcharts.js"></script>
<script type="text/javascript" src="highcharts-data.js"></script>
<script type="text/javascript" src="highcharts-exporting.js"></script>
<script type="text/javascript" src="chart.js"></script>
<script type="text/javascript" src="hana.js"></script>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="Boost.png"/></td>
<td style="padding-left: 0.5em;">
<div id="projectname">Boost.Hana
 <span id="projectnumber">1.3.0</span>
</div>
<div id="projectbrief">Your standard library for metaprogramming</div>
</td>
<td> <div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('fwd_2partition_8hpp.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> |
<a href="#var-members">Variables</a> </div>
<div class="headertitle">
<div class="title">partition.hpp File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Forward declares <code><a class="el" href="group__group-Sequence.html#ga5e84ac3f1eb09c637b6b38ef42dccd8d" title="Partition a sequence based on a predicate.Specifically, returns an unspecified Product whose first el...">boost::hana::partition</a></code>.
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:namespaceboost_1_1hana"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1hana.html">boost::hana</a></td></tr>
<tr class="memdesc:namespaceboost_1_1hana"><td class="mdescLeft"> </td><td class="mdescRight">Namespace containing everything in the library. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:ga5e84ac3f1eb09c637b6b38ef42dccd8d"><td class="memItemLeft" align="right" valign="top">constexpr auto </td><td class="memItemRight" valign="bottom"><a class="el" href="group__group-Sequence.html#ga5e84ac3f1eb09c637b6b38ef42dccd8d">boost::hana::partition</a></td></tr>
<tr class="memdesc:ga5e84ac3f1eb09c637b6b38ef42dccd8d"><td class="mdescLeft"> </td><td class="mdescRight">Partition a sequence based on a <code>predicate</code>.Specifically, returns an unspecified <code>Product</code> whose first element is a sequence of the elements satisfying the predicate, and whose second element is a sequence of the elements that do not satisfy the predicate. <a href="group__group-Sequence.html#ga5e84ac3f1eb09c637b6b38ef42dccd8d">More...</a><br /></td></tr>
<tr class="separator:ga5e84ac3f1eb09c637b6b38ef42dccd8d"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Forward declares <code><a class="el" href="group__group-Sequence.html#ga5e84ac3f1eb09c637b6b38ef42dccd8d" title="Partition a sequence based on a predicate.Specifically, returns an unspecified Product whose first el...">boost::hana::partition</a></code>. </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!--
(See accompanying file LICENSE.md or copy at path_to_url
-->
<!-- boost-no-inspect -->
<!-- HTML footer for doxygen 1.8.9.1-->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_daf74c896eae580804ddb7810f485dad.html">hana</a></li><li class="navelem"><a class="el" href="dir_cc4d96287a8e6ea2980c75f79e8c5cd4.html">fwd</a></li><li class="navelem"><a class="el" href="fwd_2partition_8hpp.html">partition.hpp</a></li>
</ul>
</div>
</body>
</html>
```
|
```java
package com.ctrip.platform.dal.dao.annotation.javaConfig.normal;
import com.ctrip.platform.dal.dao.annotation.DalTransactional;
import com.ctrip.platform.dal.dao.annotation.Transactional;
import com.ctrip.platform.dal.dao.client.DalTransactionManager;
import org.junit.Assert;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Component;
import com.ctrip.platform.dal.dao.unitbase.MySqlDatabaseInitializer;
@Component
public class TransactionAnnoClass {
public static final String DB_NAME = MySqlDatabaseInitializer.DATABASE_NAME;
@Autowired
private AnotherClass test;
public AnotherClass getTest() {
return test;
}
@DalTransactional(logicDbName = DB_NAME)
public String perform() {
Assert.assertTrue(DalTransactionManager.isInTransaction());
return null;
}
@Transactional(logicDbName = DB_NAME)
public String performOld() {
Assert.assertTrue(DalTransactionManager.isInTransaction());
return null;
}
}
```
|
```go
// Unless explicitly stated otherwise all files in this repository are licensed
// This product includes software developed at Datadog (path_to_url
package defaultforwarder
import (
"context"
"net/http"
"time"
"github.com/DataDog/datadog-agent/comp/core/config"
log "github.com/DataDog/datadog-agent/comp/core/log/def"
"github.com/DataDog/datadog-agent/comp/forwarder/defaultforwarder/endpoints"
"github.com/DataDog/datadog-agent/comp/forwarder/defaultforwarder/transaction"
utilhttp "github.com/DataDog/datadog-agent/pkg/util/http"
)
// SyncForwarder is a very simple Forwarder synchronously sending
// the data to the intake.
type SyncForwarder struct {
config config.Component
log log.Component
defaultForwarder *DefaultForwarder
client *http.Client
}
// NewSyncForwarder returns a new synchronous forwarder.
func NewSyncForwarder(config config.Component, log log.Component, keysPerDomain map[string][]string, timeout time.Duration) *SyncForwarder {
return &SyncForwarder{
config: config,
log: log,
defaultForwarder: NewDefaultForwarder(config, log, NewOptions(config, log, keysPerDomain)),
client: &http.Client{
Timeout: timeout,
Transport: utilhttp.CreateHTTPTransport(config),
},
}
}
// Start starts the sync forwarder: nothing to do.
func (f *SyncForwarder) Start() error {
return nil
}
// Stop stops the sync forwarder: nothing to do.
func (f *SyncForwarder) Stop() {
}
func (f *SyncForwarder) sendHTTPTransactions(transactions []*transaction.HTTPTransaction) error {
for _, t := range transactions {
if err := t.Process(context.Background(), f.config, f.log, f.client); err != nil {
f.log.Debugf("SyncForwarder.sendHTTPTransactions first attempt: %s", err)
// Retry once after error
// The intake may have closed the connection between Lambda invocations.
// If so, the first attempt will fail because the closed connection will still be cached.
f.log.Debug("Retrying transaction")
if err := t.Process(context.Background(), f.config, f.log, f.client); err != nil {
f.log.Warnf("SyncForwarder.sendHTTPTransactions failed to send: %s", err)
}
}
}
f.log.Debugf("SyncForwarder has flushed %d transactions", len(transactions))
return nil
}
// SubmitV1Series will send timeserie to v1 endpoint (this will be remove once
// the backend handles v2 endpoints).
func (f *SyncForwarder) SubmitV1Series(payload transaction.BytesPayloads, extra http.Header) error {
transactions := f.defaultForwarder.createHTTPTransactions(endpoints.V1SeriesEndpoint, payload, transaction.Series, extra)
return f.sendHTTPTransactions(transactions)
}
// SubmitSeries will send timeseries to the v2 endpoint
func (f *SyncForwarder) SubmitSeries(payload transaction.BytesPayloads, extra http.Header) error {
transactions := f.defaultForwarder.createHTTPTransactions(endpoints.SeriesEndpoint, payload, transaction.Series, extra)
return f.sendHTTPTransactions(transactions)
}
// SubmitV1Intake will send payloads to the universal `/intake/` endpoint used by Agent v.5
func (f *SyncForwarder) SubmitV1Intake(payload transaction.BytesPayloads, kind transaction.Kind, extra http.Header) error {
// treat as a Series transaction
transactions := f.defaultForwarder.createHTTPTransactions(endpoints.V1IntakeEndpoint, payload, kind, extra)
// the intake endpoint requires the Content-Type header to be set
for _, t := range transactions {
t.Headers.Set("Content-Type", "application/json")
}
return f.sendHTTPTransactions(transactions)
}
// SubmitV1CheckRuns will send service checks to v1 endpoint (this will be removed once
// the backend handles v2 endpoints).
func (f *SyncForwarder) SubmitV1CheckRuns(payload transaction.BytesPayloads, extra http.Header) error {
transactions := f.defaultForwarder.createHTTPTransactions(endpoints.V1CheckRunsEndpoint, payload, transaction.CheckRuns, extra)
return f.sendHTTPTransactions(transactions)
}
// SubmitSketchSeries will send payloads to Datadog backend - PROTOTYPE FOR PERCENTILE
func (f *SyncForwarder) SubmitSketchSeries(payload transaction.BytesPayloads, extra http.Header) error {
transactions := f.defaultForwarder.createHTTPTransactions(endpoints.SketchSeriesEndpoint, payload, transaction.Sketches, extra)
return f.sendHTTPTransactions(transactions)
}
// SubmitHostMetadata will send a host_metadata tag type payload to Datadog backend.
func (f *SyncForwarder) SubmitHostMetadata(payload transaction.BytesPayloads, extra http.Header) error {
return f.SubmitV1Intake(payload, transaction.Metadata, extra)
}
// SubmitMetadata will send a metadata type payload to Datadog backend.
func (f *SyncForwarder) SubmitMetadata(payload transaction.BytesPayloads, extra http.Header) error {
return f.SubmitV1Intake(payload, transaction.Metadata, extra)
}
// SubmitAgentChecksMetadata will send a agentchecks_metadata tag type payload to Datadog backend.
func (f *SyncForwarder) SubmitAgentChecksMetadata(payload transaction.BytesPayloads, extra http.Header) error {
return f.SubmitV1Intake(payload, transaction.Metadata, extra)
}
// SubmitProcessChecks sends process checks
func (f *SyncForwarder) SubmitProcessChecks(payload transaction.BytesPayloads, extra http.Header) (chan Response, error) {
return f.defaultForwarder.submitProcessLikePayload(endpoints.ProcessesEndpoint, payload, extra, true)
}
// SubmitProcessDiscoveryChecks sends process discovery checks
func (f *SyncForwarder) SubmitProcessDiscoveryChecks(payload transaction.BytesPayloads, extra http.Header) (chan Response, error) {
return f.defaultForwarder.submitProcessLikePayload(endpoints.ProcessDiscoveryEndpoint, payload, extra, true)
}
// SubmitProcessEventChecks sends process events checks
func (f *SyncForwarder) SubmitProcessEventChecks(payload transaction.BytesPayloads, extra http.Header) (chan Response, error) {
return f.defaultForwarder.submitProcessLikePayload(endpoints.ProcessLifecycleEndpoint, payload, extra, true)
}
// SubmitRTProcessChecks sends real time process checks
func (f *SyncForwarder) SubmitRTProcessChecks(payload transaction.BytesPayloads, extra http.Header) (chan Response, error) {
return f.defaultForwarder.submitProcessLikePayload(endpoints.RtProcessesEndpoint, payload, extra, false)
}
// SubmitContainerChecks sends container checks
func (f *SyncForwarder) SubmitContainerChecks(payload transaction.BytesPayloads, extra http.Header) (chan Response, error) {
return f.defaultForwarder.submitProcessLikePayload(endpoints.ContainerEndpoint, payload, extra, true)
}
// SubmitRTContainerChecks sends real time container checks
func (f *SyncForwarder) SubmitRTContainerChecks(payload transaction.BytesPayloads, extra http.Header) (chan Response, error) {
return f.defaultForwarder.submitProcessLikePayload(endpoints.RtContainerEndpoint, payload, extra, false)
}
// SubmitConnectionChecks sends connection checks
func (f *SyncForwarder) SubmitConnectionChecks(payload transaction.BytesPayloads, extra http.Header) (chan Response, error) {
return f.defaultForwarder.submitProcessLikePayload(endpoints.ConnectionsEndpoint, payload, extra, true)
}
// SubmitOrchestratorChecks sends orchestrator checks
func (f *SyncForwarder) SubmitOrchestratorChecks(payload transaction.BytesPayloads, extra http.Header, payloadType int) (chan Response, error) {
return f.defaultForwarder.SubmitOrchestratorChecks(payload, extra, payloadType)
}
// SubmitOrchestratorManifests sends orchestrator manifests
func (f *SyncForwarder) SubmitOrchestratorManifests(payload transaction.BytesPayloads, extra http.Header) (chan Response, error) {
return f.defaultForwarder.SubmitOrchestratorManifests(payload, extra)
}
```
|
```css
/*
Theme Name: Child Theme
Template: theme-file-parent
*/
```
|
```shell
Truncate files with `cat` instead of `rm`
Extracting `tar` files to a specific directory
Monitor the progress of data through a pipe with `pv`
Find the unknown process preventing deleting of files
Delete commands aliases
```
|
Napaeus is a genus of air-breathing land snails, terrestrial pulmonate gastropod mollusks in the subfamily Eninae of the family Enidae.
Distribution
Napaeus is endemic to the Macaronesia ecoregion: Azores and Canary Islands.
Species
There are three recognized subgenera, Macaronapaeus Kobelt, 1899, Napaeus Albers, 1850 and Napaeinus Hesse, 1933.
Species within the genus Napaeus include 18 species on the Tenerife, 17 species on the La Gomera and others. Additionally, 11 new species from the Canary Islands were described in 2011.
Napaeus alabastrinus Frias Martins, 1989
Napaeus alucensis Santana & Yanes, 2011- on La Gomera
Napaeus anaga (Grasset, 1857)
Napaeus aringaensis Yanes et al., 2011
Napaeus atlanticus (L. Pfeiffer, 1853)
Napaeus avaloensis Groh, 2006
Napaeus badiosus (Webb & Berthelot, 1833)
Napaeus baeticatus (Webb & Berthelot, 1833) - type species
Napaeus barquini Alonso & Ibáñez, 2006
Napaeus bechi M. R. Alonso & Ibáñez, 1993
Napaeus beguirae Henríquez, 1995
Napaeus bertheloti (L. Pfeiffer, 1846)
Napaeus boucheti M. R. Alonso & Ibáñez, 1993
Napaeus chrysaloides (Wollaston, 1878)
Napaeus consecoanus (Mousson, 1872)
Napaeus delibutus (Morelet & Drouët, 1857)
Napaeus delicatus Alonso, Yanes & Ibáñez, 2011
Napaeus doliolum Henríquez, 1993
Napaeus doloresae Santana, 2013
Napaeus elegans M. R. Alonso & Ibáñez, 1995
Napaeus encaustus (Shuttleworth, 1852)
Napaeus esbeltus Ibáñez & M. R. Alonso, 1995
Napaeus estherae Artiles, 2013
Napaeus exilis Henríquez, 1995
Napaeus gomerensis G. A. Holyoak & D. T. Holyoak, 2011 - on La Gomera
Napaeus grohi Yanes et al., 2011
Napaeus gruereanus (Grasset, 1857)
Napaeus hartungi (Morelet & Drouët, 1857)
Napaeus helvolus (Webb & Berthelot, 1833)
Napaeus huttereri Henríquez, 1991
Napaeus indifferens (Mousson, 1872)
Napaeus inflatiusculus (Wollaston, 1878)
Napaeus interpunctatus (Wollaston, 1878)
Napaeus isletae Groh & Ibanez, 1992
Napaeus josei Yanes et al., 2011
Napaeus lajaensis Castillo et al., 2006
Napaeus lichenicola M. R. Alonso & Ibáñez, 2007
Napaeus maculatus Goodacre, 2006
Napaeus maffioteanus (Mousson, 1872)
Napaeus magnus Yanes, Deniz, M. R. Alonso & Ibáñez, 2013
Napaeus minimus Holyoak & Holyoak, 2011
Napaeus moquinianus (Webb & Berthelot, 1833)
Napaeus moroi Martín, Alonso & Ibáñez, 2011 - La Gomera
Napaeus myosotis (Webb & Berthelot, 1833)
Napaeus nanodes Shuttleworth, 1852
Napaeus obesatus (Webb & Berthelot, 1833)
Napaeus ocellatus (Mousson, 1872)
Napaeus orientalis Henríquez, 1995
Napaeus ornamentatus Moro, 2009
Napaeus osoriensis (Wollaston, 1878)
Napaeus palmaensis (Mousson, 1872)
Napaeus procerus Emerson, 2006
Napaeus propinquus (Shuttleworth, 1852)
Napaeus pruninus (A. Gould, 1846)
Napaeus pygmaeus Ibanez & Alonso, 1993
Napaeus roccellicola (Webb & Berthelot, 1833)
Napaeus rufobrunneus (Wollaston, 1878)
Napaeus rupicola (Mousson, 1872)
Napaeus savinosus (Wollaston, 1878)
† Napaeus servus (Mousson, 1872)
Napaeus severus (J. Mabille, 1898)
Napaeus subgracilior (Wollaston, 1878)
Napaeus subsimplex (Wollaston, 1878)
Napaeus tabidus (Shuttleworth, 1852)
Napaeus tafadaensis Yanes, 2009
Napaeus tagamichensis Henríquez, 1993
Napaeus taguluchensis Henríquez, 1993
Napaeus tenoensis Henríquez, 1993
Napaeus teobaldoi Martín, 2009
Napaeus texturatus (Mousson, 1872)
Napaeus torilensis Artiles & Deniz, 2011 - on La Gomera
Napaeus tremulans (Mousson, 1858)
Napaeus validoi Yanes et al., 2011
Napaeus variatus (Webb & Berthelot, 1833)
Napaeus venegueraensis Yanes et al., 2011
Napaeus voggenreiteri Hutterer, 2006
Napaeus vulgaris (Morelet & Drouët, 1857)
Species brought into synonymy
Napaeus arcuatus (Kuester, 1845): synonym of Pseudonapaeus arcuatus (Kuester, 1845) (unaccepted combination)
Napaeus candelaris (L. Pfeiffer, 1846): synonym of Pseudonapaeus candelaris (L. Pfeiffer, 1846) (unaccepted combination)
Napaeus coelebs (L. Pfeiffer, 1846): synonym of Pseudonapaeus coelebs (L. Pfeiffer, 1846) (unaccepted combination)
Napaeus sindicus (Reeve, 1848): synonym of Pseudonapaeus sindicus (Reeve, 1848) (unaccepted combination)
Napaeus vincentii (Gredler, 1898): synonym of Serina vincentii (Gredler, 1898)
References
Further reading
Alonso M. R., Henríquez F. & Ibáñez M. (1995). "Revision of the species group Napaeus variatus (Gastropoda, Pulmonata, Buliminidae) from the Canary Islands, with description of five new species". Zool Scr 24: 303–320.
Yanes Y., Martín J., Moro L., Alonso M. R. & Ibáñez M. (2009). "On the relationships of the genus Napaeus (Gastropoda: Pulmonata: Enidae), with the description of four new species from the Canary Islands". Journal of Natural History 43(35): 2179–2207.
External links
"Species in genus Napaeus". AnimalBase.
Enidae
Taxonomy articles created by Polbot
|
Van Meter Township is a township in Dallas County, Iowa, USA. As of the 2000 census, its population was 3061.
Geography
Van Meter Township covers an area of and contains two incorporated settlements: De Soto and Van Meter. According to the USGS, it contains six cemeteries: Clayton, Oakland, Otterman, Thornton, Van Meter and Williams.
The streams of Bulger Creek, North Raccoon River and South Raccoon River run through this township.
Transportation
Van Meter Township contains landing strip, Flying Green Acres Landing Strip.
References
USGS Geographic Names Information System (GNIS)
External links
US-Counties.com
City-Data.com
Townships in Dallas County, Iowa
Townships in Iowa
|
The women's 1500 metres event at the 2002 European Athletics Indoor Championships was held on March 2–3.
Medalists
Results
Heats
First 3 of each heat (Q) and the next 3 fastest (q) qualified for the semifinals.
Final
References
Results
1500 metres at the European Athletics Indoor Championships
1500
2002 in women's athletics
|
Nodar Mgaloblishvili (, , July 15, 1931 in Tiflis, Georgian SSR, Soviet Union – March 26, 2019 in Tbilisi) was a Soviet and Georgian theatrical and cinema actor.
Biography
In 1954 Nodar Mgaloblishvili graduated from the Shota Rustaveli Theatre and Film University. The same year he started to work in Marjanishvili Theatre as an actor. Meritorious Artist of Georgia (1976), People's Artist of the Georgian SSR (1979), winner of Hungary Drama and Music Festival (1976), he is best known for his portrayal of Count Cagliostro in Formula of Love directed by Mark Zakharov.
Mgaloblishvili lived and worked in Tbilisi, Georgia.
Selected filmography
Centaurs (1978) as minister Miguel
Jaqo's Dispossessed (1980, TV Movie) as Teimuraz Eristavi
Formula of Love (1984) as Alessandro Cagliostro
Katala (1989) as Director
Spetsnaz (2002) as Bearded
Inspection (; 2006, TV series) as Lame man
A Second Before... (2007, TV Series) as The Devil
References
External links
Жизнь и смерть «графа Калиостро». Формула любви Нодара Мгалоблишвили
1931 births
2019 deaths
Male actors from Tbilisi
Soviet male actors
Russian male actors
Male stage actors from Georgia (country)
Male film actors from Georgia (country)
20th-century male actors from Georgia (country)
People's Artists of Georgia
|
Brylov Serhii Volodymyrovych (born April 5, 1974, in Kyiv, Ukraine) is a Ukrainian sculptor.
Biography
Education
1986-1992 Taras Shevchenko Republican Art School
1992-1998 National Academy of Fine Arts and Architecture B.A. Sculpture
1998-2001 National Academy of Fine Arts and Architecture M.A. Sculpture
1995 Member of Kyiv Organization Youth Assotiation of the National Union of Artists of Ukraine
2000 Member of the National Union of Artists of Ukraine
Exhibitions
1993-2021 All-Ukrainian Exhibitions, Central House of Artists, Kiev
1993 Ukrainian Academy of Arts 75th Anniversary Art Exhibition, the Ukrainian House, Kyiv
1996 Christmas exhibition, Artist Gallery, Kyiv
1996 The Art of Youth, 36 Gallery, Kyiv
1996 The Art of Youth, Gallery of the Crimean Organization of the National Union of Artists of Ukraine, Yalta
1997 Harmony, 36 Gallery, Kyiv
1997 Youth Chooses Art, Artist Gallery, Kyiv
1997 L, K, B Solo Exhibition, Museum of Kyiv History, Kyiv
1998 Boys and Girls, Artist Gallery, Kyiv
1998 Enclosed in a Circle,Slavutych Gallery, Kyiv
1999 Ukrainian Sculpture Triennial, Central House of Artists, Kyiv
2000 3+2,Artist Gallery, Kyiv
2000 PRO ART Festival, the Ukrainian House, Kyiv
2002 Ukrainian Sculpture Triennial, Central House of Artists, Kyiv
2003 Solo Exhibition, Artist Gallery, Kyiv
2003 New Generation, Central House of Artists, Moscow
2005 Ukrainian Sculpture Triennial, Central House of Artists, Kyiv
2008 Ukrainian Sculpture Triennial, Central House of Artists, Kyiv
2011 Animalistic, Artist Gallery, Kyiv
2012-2013 The Art of Nations - II. The Exhibition of Commonwealth
2014 Independent States Artists, Central House of Artists, Moscow
2014 Solo Exhibition, Artist Gallery, Kyiv
2016 Color palette, Gallery Mitseva, Kiev
2016 POWER / Violence /Ruler, Hotel Adlon Berlin Germany
2020 Ukrainian Sculpture Triennial, Central House of Artists, Kyiv
2023 Ukrainian Sculpture Triennial, Central House of Artists, Kyiv
* Altogether 4 Solo and 40 Group Exhibitions
Collections
Private collections in the United States, Denmark, South Korea, Germany, Austria, Canada, Switzerland, Russia
Valentina Tereshkova collection
Museum of Kyiv History (Kyiv) Regional Natural History Museum
(Vyshhorod)
Work
2011-2017 Kyiv State Mykhailo Boychuk Institute of decorative arts and design, Drawing Department, lecturer
2017-2019 Senior Lecturer at the Kyiv National University of Technology and Design, Department of Drawing and Painting * 2009- 2012 Head of Kyiv Organization Youth Assotiation of the National Union of Artists of Ukraine
2010-2013 Deputy Head of Kyiv Organization of the National Union of Artists of Ukraine
2021-2022 Deputy Head of the National Union of Artists of Ukraine
Honors
2002 Certificate of Commendation of Chief Department for Arts and Culture of Kiev City State Administration
2003 Certificate of Commendation of Minister of Culture of Ukraine for personal contribution to the Development of Ukrainian Art
2011 Certificate for Assistance in charity event "I'll live", All-Ukrainian non-governmental organization "Association for Support of Disabled People and patients with CLL"
2012 Certificate for highly appreciated social work on raising educational background of Adults of Ukraine and the development of spiritual and intellectual potential of Ukrainian Society and the Ukrainian State.
National Academy of Pedagogical Sciences of Ukraine, All-Ukrainian Bureau "Education of Adults of Ukraine", The UNESCO International Institute for Lifelong Learning * 2017 Diploma of the National Union of Artists of Ukraine for a significant personal contribution to the development of Ukrainian fine arts, high professionalism, multi-year creative and pedagogical activity. * 2019- Acknowledgment "For high-quality fruitful activity and asceticism in the field of culture and art. III International Multi-genre Festival of Arts" Magical Melodies ", personal contribution to the development of the world festival movement in Ukraine, active and professional work in the jury of the international festival.
2019- Acknowledgment "For professional self-explanatory work as part of the commission (jury) of the All-Ukrainian project" JUST FALSE "in 2019." * 2020 - Honorary award of the National Academy of Fine Arts and Architecture
2020 - Diploma for the active community position for the expansion in the Ukrainian suspension of the sea idea and the renewal of Ukraine in the status of the sea power and for the fate of the project "Expedition 2020", the contest for a child child about the sea "Sea"
References
External links
Sculptures Website Serhii Brylov
Брильов Сергій Володимирович
http://vikna.stb.ua/news/2012/1/11/89009/
https://web.archive.org/web/20120730115859/http://kpravda.com/v-kieve-paralizovano-bolshinstvo-masterskix-xudozhnikov-i-skulptorov-nechem-platit-za-teplo/
https://web.archive.org/web/20090831070428/http://www.ukraine.org/VKyiv/vk1/s3.htm
https://www.umoloda.kyiv.ua/number/2038/189/72597/
https://scholar.google.com.ua/citations?user=W3vld00AAAAJ&hl=uk
https://web.archive.org/web/20160303212840/http://www.lympho.com.ua/news/zelena-khvylya
http://konshu.org/section/sculpture/briloyv-sergey.html
http://esu.com.ua/search_articles.php?id=37776
Ukrainian male sculptors
1974 births
Living people
|
Vic-la-Gardiole (; ) is a commune in the Hérault department in the Occitanie region in southern France.
Population
Gallery
See also
Communes of the Hérault department
References
Communes of Hérault
|
```c++
#ifndef BOOST_ARCHIVE_BASIC_BINARY_OARCHIVE_HPP
#define BOOST_ARCHIVE_BASIC_BINARY_OARCHIVE_HPP
// MS compatible compilers support #pragma once
#if defined(_MSC_VER)
# pragma once
#endif
/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
// basic_binary_oarchive.hpp
// Use, modification and distribution is subject to the Boost Software
// path_to_url
// See path_to_url for updates, documentation, and revision history.
// archives stored as native binary - this should be the fastest way
// to archive the state of a group of obects. It makes no attempt to
// convert to any canonical form.
// IN GENERAL, ARCHIVES CREATED WITH THIS CLASS WILL NOT BE READABLE
// ON PLATFORM APART FROM THE ONE THEY ARE CREATE ON
#include <boost/assert.hpp>
#include <boost/config.hpp>
#include <boost/detail/workaround.hpp>
#include <boost/integer.hpp>
#include <boost/integer_traits.hpp>
#include <boost/archive/detail/common_oarchive.hpp>
#include <boost/serialization/string.hpp>
#include <boost/serialization/collection_size_type.hpp>
#include <boost/serialization/item_version_type.hpp>
#include <boost/archive/detail/abi_prefix.hpp> // must be the last header
#ifdef BOOST_MSVC
# pragma warning(push)
# pragma warning(disable : 4511 4512)
#endif
namespace boost {
namespace archive {
namespace detail {
template<class Archive> class interface_oarchive;
} // namespace detail
//////////////////////////////////////////////////////////////////////
// class basic_binary_oarchive - write serialized objects to a binary output stream
// note: this archive has no pretensions to portability. Archive format
// may vary across machine architectures and compilers. About the only
// guarentee is that an archive created with this code will be readable
// by a program built with the same tools for the same machne. This class
// does have the virtue of buiding the smalles archive in the minimum amount
// of time. So under some circumstances it may be he right choice.
template<class Archive>
class BOOST_SYMBOL_VISIBLE basic_binary_oarchive :
public detail::common_oarchive<Archive>
{
#ifdef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
public:
#else
protected:
#if BOOST_WORKAROUND(BOOST_MSVC, < 1500)
// for some inexplicable reason insertion of "class" generates compile erro
// on msvc 7.1
friend detail::interface_oarchive<Archive>;
#else
friend class detail::interface_oarchive<Archive>;
#endif
#endif
// any datatype not specifed below will be handled by base class
typedef detail::common_oarchive<Archive> detail_common_oarchive;
template<class T>
void save_override(const T & t){
this->detail_common_oarchive::save_override(t);
}
// include these to trap a change in binary format which
// isn't specifically handled
BOOST_STATIC_ASSERT(sizeof(tracking_type) == sizeof(bool));
// upto 32K classes
BOOST_STATIC_ASSERT(sizeof(class_id_type) == sizeof(int_least16_t));
BOOST_STATIC_ASSERT(sizeof(class_id_reference_type) == sizeof(int_least16_t));
// upto 2G objects
BOOST_STATIC_ASSERT(sizeof(object_id_type) == sizeof(uint_least32_t));
BOOST_STATIC_ASSERT(sizeof(object_reference_type) == sizeof(uint_least32_t));
// binary files don't include the optional information
void save_override(const class_id_optional_type & /* t */){}
// enable this if we decide to support generation of previous versions
#if 0
void save_override(const boost::archive::version_type & t){
library_version_type lvt = this->get_library_version();
if(boost::serialization::library_version_type(7) < lvt){
this->detail_common_oarchive::save_override(t);
}
else
if(boost::serialization::library_version_type(6) < lvt){
const boost::uint_least16_t x = t;
* this->This() << x;
}
else{
const unsigned int x = t;
* this->This() << x;
}
}
void save_override(const boost::serialization::item_version_type & t){
library_version_type lvt = this->get_library_version();
if(boost::serialization::library_version_type(7) < lvt){
this->detail_common_oarchive::save_override(t);
}
else
if(boost::serialization::library_version_type(6) < lvt){
const boost::uint_least16_t x = t;
* this->This() << x;
}
else{
const unsigned int x = t;
* this->This() << x;
}
}
void save_override(class_id_type & t){
library_version_type lvt = this->get_library_version();
if(boost::serialization::library_version_type(7) < lvt){
this->detail_common_oarchive::save_override(t);
}
else
if(boost::serialization::library_version_type(6) < lvt){
const boost::int_least16_t x = t;
* this->This() << x;
}
else{
const int x = t;
* this->This() << x;
}
}
void save_override(class_id_reference_type & t){
save_override(static_cast<class_id_type &>(t));
}
#endif
// explicitly convert to char * to avoid compile ambiguities
void save_override(const class_name_type & t){
const std::string s(t);
* this->This() << s;
}
#if 0
void save_override(const serialization::collection_size_type & t){
if (get_library_version() < boost::serialization::library_version_type(6)){
unsigned int x=0;
* this->This() >> x;
t = serialization::collection_size_type(x);
}
else{
* this->This() >> t;
}
}
#endif
BOOST_ARCHIVE_OR_WARCHIVE_DECL void
init();
basic_binary_oarchive(unsigned int flags) :
detail::common_oarchive<Archive>(flags)
{}
};
} // namespace archive
} // namespace boost
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
#include <boost/archive/detail/abi_suffix.hpp> // pops abi_suffix.hpp pragmas
#endif // BOOST_ARCHIVE_BASIC_BINARY_OARCHIVE_HPP
```
|
```c
/*
* code is released under a tri EPL/GPL/LGPL license. You can use it,
* redistribute it and/or modify it under the terms of the:
*
*/
#include <limits.h>
unsigned short max_ushort(void) {
return USHRT_MAX;
}
unsigned int max_uint(void) {
return UINT_MAX;
}
```
|
```c++
/*
*
* 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.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS 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 APPLE OR ITS 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.
*/
#include "config.h"
#include "core/dom/DOMURLUtils.h"
#include "platform/weborigin/KnownPorts.h"
namespace blink {
void DOMURLUtils::setHref(const String& value)
{
setInput(value);
}
void DOMURLUtils::setProtocol(const String& value)
{
KURL kurl = url();
if (kurl.isNull())
return;
kurl.setProtocol(value);
setURL(kurl);
}
void DOMURLUtils::setUsername(const String& value)
{
KURL kurl = url();
if (kurl.isNull())
return;
kurl.setUser(value);
setURL(kurl);
}
void DOMURLUtils::setPassword(const String& value)
{
KURL kurl = url();
if (kurl.isNull())
return;
kurl.setPass(value);
setURL(kurl);
}
void DOMURLUtils::setHost(const String& value)
{
if (value.isEmpty())
return;
KURL kurl = url();
if (!kurl.canSetHostOrPort())
return;
kurl.setHostAndPort(value);
setURL(kurl);
}
void DOMURLUtils::setHostname(const String& value)
{
KURL kurl = url();
if (!kurl.canSetHostOrPort())
return;
// Before setting new value:
// Remove all leading U+002F SOLIDUS ("/") characters.
unsigned i = 0;
unsigned hostLength = value.length();
while (value[i] == '/')
i++;
if (i == hostLength)
return;
kurl.setHost(value.substring(i));
setURL(kurl);
}
void DOMURLUtils::setPort(const String& value)
{
KURL kurl = url();
if (!kurl.canSetHostOrPort())
return;
kurl.setPort(value);
setURL(kurl);
}
void DOMURLUtils::setPathname(const String& value)
{
KURL kurl = url();
if (!kurl.canSetPathname())
return;
kurl.setPath(value);
setURL(kurl);
}
void DOMURLUtils::setSearch(const String& value)
{
KURL kurl = url();
if (!kurl.isValid())
return;
// FIXME: have KURL do this clearing of the query component
// instead, if practical. Will require addressing
// path_to_url for one.
if (value[0] == '?')
kurl.setQuery(value.length() == 1 ? String() : value.substring(1));
else
kurl.setQuery(value.isEmpty() ? String() : value);
setURL(kurl);
}
void DOMURLUtils::setHash(const String& value)
{
KURL kurl = url();
if (kurl.isNull())
return;
// FIXME: have KURL handle the clearing of the fragment component
// on the same input.
if (value[0] == '#')
kurl.setFragmentIdentifier(value.length() == 1 ? String() : value.substring(1));
else
kurl.setFragmentIdentifier(value.isEmpty() ? String() : value);
setURL(kurl);
}
} // namespace blink
```
|
Louise Lamphere (born 1940) is an American anthropologist who has been distinguished professor of anthropology at the University of New Mexico since 2001. She was a faculty member at UNM from 1976–1979 and again from 1986–2009, when she became a professor emerita.
Lamphere served as president of the American Anthropological Association from 1999 to 2001.
Career
Lamphere received her B.A. and M.A. from Stanford University in 1962 and 1966 and her Ph.D. from Harvard University in 1968. She has published extensively throughout her career on subjects as diverse as the Navajo and their medicinal practices and de-industrialisation and urban anthropology; nonetheless she is possibly best known for her work on feminist anthropology and gender issues.
In 1977, Lamphere became an associate of the Women's Institute for Freedom of the Press (WIFP).
Lamphere was the co-editor, with Michelle Zimbalist Rosaldo, of Woman, Culture, and Society, the first volume to address the anthropological study of gender and women's status.
In the 1970s, after being denied tenure at Brown University, Lamphere brought a class action suit against Brown for gender discrimination. She won an out-of-court settlement that served as a model for future suits by others. In 2015, Brown announced a series of events (including a symposium) examining the important impact of the suit and its settlement.
In 2005 Lamphere supervised an ethnographic team which examined the impact of Medicaid managed care in New Mexico. The team published their articles in a special issue of Medical Anthropology Quarterly. In her introduction, she emphasized the impact of increased bureaucratization on women workers in health care clinics, emergency rooms and small doctors offices.
Lamphere was elected as the member of the School for Advanced Research on August 5, 2017.
Awards
In 2013, she was awarded the Franz Boas Award for Exemplary Service to Anthropology from the American Anthropological Association.
On May 24, 2015 Brown University awarded Lamphere an honorary doctorate (honoris causa) for her "courage in standing up for equity and fairness for all faculty and [her] exemplary examinations of urban anthropology, healthcare practices and gender issues."
In 2017, she was awarded the Bronislaw Malinowski Award by The Society of Applied Anthropology.
Selected works
Sunbelt Working Mothers: Reconciling Family and Factory. Co-authored with Patricia Zavella, Felipe Gonzales and Peter B. Evans. Ithaca: Cornell University Press. 1993
Newcomers in the Workplace: Immigrants and the Restructuring of the U.S. Economy, co-edited with Guillermo Grenier. Philadelphia: Temple University Press. 1994.
Situated Lives: Gender and Culture in Everyday Life (edited with Helena Ragone' and Patricia Zavella) New York: Routledge Press. 1997.
"Gender Models in the Southwest: Sociocultural Perspectives" in Women & Men in the Prehispanic Southwest, edited by Patricia L. Crown. Santa Fe: School of American Research Press. pp. 379–402. 2001.
"Rereading and Remembering Michelle Rosaldo" in Gender Matters: Rereading Michelle Z. Rosaldo. ed. by Alejandro Lugo and Bill Maurer. Ann Arbor: The University of Michigan Press. pp. 1–15. 2001
"Perils and Prospects for an Engaged Anthropology: A view from the U.S." (2002 Plenary address of the meetings of the European Association of Social Anthropology. Social Anthropology 11(2): 13–28. 2003.
"Women, Culture, and Society". Co-edited with Michelle Zimbalist Rosaldo. Stanford, CA: Stanford University Press. 1974.
"Unofficial Histories: A Vision of Anthropology From the Margins." 2001 American Anthropological Association Presidential Address. American Anthropologist 106(1). 2004.
References
External links
Louise Lamphere Papers --Pembroke Center Archives, Brown University
Professor Louise Lamphere's Curriculum Vitae Accessed from University of New Mexico webpage 8 June 2008
Profile of Work as American Anthropological Association "Squeaky Wheel" Award Recipient 1998 Accessed 8 June 2008
American anthropologists
American women anthropologists
Stanford University alumni
Harvard University alumni
1941 births
Living people
Brown University faculty
University of New Mexico faculty
|
Endothelin-3 is a protein that in humans is encoded by the EDN3 gene.
The protein encoded by this gene is a member of the endothelin family. Endothelins are endothelium-derived vasoactive peptides involved in a variety of biological functions. The active form of this protein is a 21 amino acid peptide processed from the precursor protein. The active peptide is a ligand for endothelin receptor type B (EDNRB). The interaction of this endothelin with EDNRB is essential for development of neural crest-derived cell lineages, such as melanocytes and enteric neurons. Mutations in this gene and EDNRB have been associated with Hirschsprung disease (HSCR) and Waardenburg syndrome (WS), which are congenital disorders involving neural crest-derived cells. Four alternatively spliced transcript variants encoding three distinct isoforms have been observed.
References
Further reading
Endothelin receptor agonists
|
Kandagallu (also known as Kandagal) is a village in Davangere taluk, Karnataka, South India. The population is approximately 5,000
To the west, of the village there is a small lake with the historic Sri Kalleshwara Temple at the center. It is 30 kilometers from Davangere city, and there is bus service between the two towns.
Education
Schooling is up to 10th Class, with three schools Kannada and English Medium, the (1)Government Higher Primary School,(2) sri Lingeshwara Higher Primary School which covers first through seventh standards, and the Sri H Siddaveerappa High School, which covers eighth through tenth standards. Students who want to continue their education must go to Davangere.
Surrounding area
It is surrounded by of coconut trees, Areca nut palm trees, shrubs, herbs and rice paddy fields, providing a habitat for peacocks, ducks and migratory birds in winter.
This village is partly surrounded by the Haridravathi River, a tributary of the Tunga Bhadra River which flows 365 days of a year, providing water for farming, drinking water.
Life Style
Subgroups within the population of the village are Veerashaiva Lingayat, Jangama,Valmiki Nayakas, Brahmanas, S.C, S.T, kumbara, Vishwakarma and Muslims, although the majority are Veerashaiva Lingayats and Valmiki Nayakas.
The majority of the population are farmers. Only 45% of the people are vegetarians, rest of them are non vegetarians. Typical dishes eaten here include Jolada Mudde, Jolada Rotti, Rice & Saambar, Ragi Mudde, Chapathi,Milk and Curd. Breakfast items such as Pulao, Rice Bath,Upma,lemon rice, Avalakki, Poori, Idli, Paddu,Dosa, Thalipattu and Mandakki are eaten.
Many people buy local Kannada news papers Janathavaani, Prajavaani, Vijaya karnataka, Vijayavani, Deccan Herald and Times of India.
There is a government sponsored library in the village.
Culture
The village's main festival, Rathothsava, honours Sri Veerabhadreshwara is celebrated 9 days after the Ugadi festival. The other festivals celebrated here are Deepavali (Diwali), Ugadi, Sri Ganesha Chathurthi, Basava Jayanthi, Shravana Masa pooja & Maheshwarana Jathre, Maha Shivarathri.
Each festival has significant meaning.
Sports, such as chess, volleyball, cricket, badminton, kabaddi, and kho kho, are the most common games.
References
Villages in Davanagere district
|
2120 Tyumenia (prov. designation: ) is a dark background asteroid, approximately in diameter, located in the outer regions of the asteroid belt. It was discovered on 9 September 1967, by Soviet astronomer Tamara Smirnova at the Crimean Astrophysical Observatory in Nauchnyj, on the Crimean peninsula. The asteroid was named for the now Russian district of Tyumen Oblast in Western Siberia.
Orbit and classification
Tyumenia is a non-family asteroid from the main belt's background population. It orbits the Sun in the outer asteroid belt at a distance of 2.7–3.4 AU once every 5 years and 4 months (1,954 days; semi-major axis of 3.06 AU). Its orbit has an eccentricity of 0.13 and an inclination of 18° with respect to the ecliptic. The body's observation arc begins with its identification as at Turku Observatory in November 1941, almost 26 years prior to its official discovery observation at Nauchnyj.
Naming
This minor planet was named after the district of Tyumen Oblast of the former Russian Soviet Federative Socialist Republic (1917–1991). Tyumen Oblast is located east of the Ural Mountains in Western Siberia, in the center of an oil-gas basin. The region is Russia's largest producer of oil and natural gas. The official naming citation was published by the Minor Planet Center on 1 April 1980 ().
Physical characteristics
Tyumenia is an assumed carbonaceous C-type asteroid.
Rotation period
Three rotational lightcurves of Tyumenia have been obtained from photometric observations since 2004.(). The consolidated lightcurve gave a short rotation period of 2.769 hours with a brightness amplitude between 0.33 and 0.39 magnitude.
Diameter and albedo
According to the surveys carried out by the Infrared Astronomical Satellite IRAS, the Japanese Akari satellite and the NEOWISE mission of NASA's Wide-field Infrared Survey Explorer, Tyumenia measures between 38.619 and 51.49 kilometers in diameter and its surface has an albedo between 0.029 and 0.0819. The Collaborative Asteroid Lightcurve Link derives an albedo of 0.0420 and a diameter of 40.93 kilometers based on an absolute magnitude of 11.0.
Notes
References
External links
Lightcurve Database Query (LCDB), at www.minorplanet.info
Dictionary of Minor Planet Names, Google books
Asteroids and comets rotation curves, CdR – Geneva Observatory, Raoul Behrend
Discovery Circumstances: Numbered Minor Planets (1)-(5000) – Minor Planet Center
002120
Discoveries by Tamara Mikhaylovna Smirnova
Named minor planets
19670909
|
Polany is a village in the administrative district of Gmina Wierzbica, within Radom County, Masovian Voivodeship, in east-central Poland. It lies approximately south-east of Wierzbica, south of Radom, and south of Warsaw.
References
Polany
|
```xml
import Link from 'next/link'
export default async function Page({
searchParams,
}: {
searchParams: { [key: string]: string | string[] | undefined }
}) {
const hasParams = Object.keys(searchParams).length > 0
return (
<>
<Link href="/?blazing=good">Go</Link>
{hasParams ? (
<div id="search-params">
Search params: {JSON.stringify(searchParams)}
</div>
) : null}
</>
)
}
```
|
Thomas Joseph Leahy (13 January 1888 – 7 May 1964) was an Australian rules footballer who played 111 games with North Adelaide and 58 games with West Adelaide in the SAFL.
Family
The son of George Joseph Leahy (1861-1910), and Annie Mary Leahy (1860-1929), née McKenzie, Thomas Joseph Leahy was born at Goodwood, South Australia on 13 January 1888.
He married Agnes Shannon on 29 November 1917.
Education
He was educated at the Christian Brothers College in Wakefield Street, Adelaide. He played football for the school (he was captain of the team), as well as for Albert Park in the (Junior) Adelaide and Suburban Youths' Association competition.
Football
West Adelaide
The Leahy family lived in Gouger Street in the city and thus Tom was tied to the West Adelaide Football Club under the electorate or district system. Tom and his brother Bernie debuted for West Adelaide on 27 May 1905 against Port Adelaide on the Jubilee Oval. Tom was 17 years and 4 months old at the time. Despite West Adelaide's lowly position in the competition Tom established himself as a ruckman of some note, and made his state debut one year later on 23 June 1906 against Victoria on the Adelaide Oval. He was named in the back pocket and second ruck. He finished the season by being awarded West Adelaide's best and fairest.
In 1908 Jack Reedman who had recently left North Adelaide as a player took the coaching position at West Adelaide and took the side to not only SAFL Premiers but also the club was dubbed Champions of Australia after they defeated VFL Premiers Carlton on the Adelaide Oval by 29 points, on 3 October 1908. Tom had an outstanding season being named in South Australian Carnival Side, and finishing second in the Magarey Medal. West Adelaide went back to back after defeating Port Adelaide in the 1909 SAFL Grand Final by 18 points.
North Adelaide
A rift in the West Adelaide Football Club at the end of the 1909 season saw Tom and his two brothers, Bernie and Vinnie, seek clearances to North Adelaide. All three lined up for North Adelaide in the first round of 1910, and Bernie was voted Captain of the side by his teammates. In 1911 Tom played a vital role in South Australia's winning side at the 1911 Adelaide Carnival.
After being runner up three times in the Magarey Medal in 1908, 1909 & 1911, Tom finally won the award in 1913. He also led North's Rucks in the Grand Final that year against Port Adelaide. Another fine season followed in 1914 with him taking out North Adelaide's best and fairest award, but he missed a spot in North Adelaide's Grand Final side that year due to a controversial suspension in the finals series. In 1915 Tom was unanimously voted Captain of the side after the retirement of longtime servant of the club Ernie Johns.
From 1916 to 1918 the SAFL went into recess and a Patriotic League was played. Tom didn't play football during these years until 1918 when he joined the West Adelaide patriotic side. Prospect (who was loosely aligned with North Adelaide in this league) had left the competition early in the 1918 season due to lack of numbers. West Adelaide made the Grand Final against the West Torrens Patriotic side, and while West lost to Torrens Tom was named West's best player if not the best player on ground.
In 1919 the SAFL returned and Tom again took up his role as North Adelaide's Captain, as well as the State Captain. Tom again had an outstanding season taking out North's Best and Fairest award and leading the side in what turned out to be a marathon finals series. North played in five games (having drawn two) and fell narrowly at the last hurdle to Sturt by 5 points.1919 SAFL Grand Final. In 1920 North Adelaide, led by Tom Leahy, went one better and took out the Premiership against Norwood 1920 SAFL Grand Final. Tom also captained the South Australian side that took on the Victorian side on the MCG and claimed a rare "away" victory against Victoria, 10-12(72)to 9-11(65).
Tom was again North Captain and State captain in 1921. He retired early in 1922 before the season started, after having played 169 league games.
Leahy represented South Australia at interstate football on 31 occasions during his career, including four carnivals. The only Interstate matches he missed since making his State debut in 1906 was in 1910 when his uncle died, and he missed the Western Australia match in the 1921 Perth Carnival after being injured in the opening match against Victoria. Considering that in four years encompassed by his career (1915-1918) there was no State football at all this number of games is no mean feat.
Norwood Coach
When his retirement was announced in April 1922 the Norwood Football Club approached him to ask him to coach that side. Tom repaid their faith in him with two premierships in a row (1922 and 1923) and a Grand Final appearance (1924) in his three years as coach there.
After football
After leaving coaching Tom wrote about Football in the Adelaide press. In 1935 he accepted a position on the tribunal which heard charges against reported players, so that he could protect them from unwarranted suspensions. He was belatedly appointed a life member of the South Australian National Football League in 1945 and in 1944-64 was the resident officer at Football House, Hindmarsh Square. In 1946 he helped to form the Past Players and Officials Association.
Legacy
North Adelaide Football Club (Team of the Century)
In October 2000, Leahy was named in the first ruck in North Adelaide's official "Team of the Century". He was also one of the first twenty inductees into North Adelaide's Hall of Fame in 2015.
South Australian Football Hall of Fame
In 2002, Leahy was among the inaugural group of 113 inductees into the South Australian Football Hall of Fame.
Australian Football Hall of Fame
Despite being considered by many as the best ruckman from South Australia in the sport's history, Leahy was for a longtime, absent from the Australian Football Hall of Fame. He was finally inducted in 2023.
See also
1908 Melbourne Carnival
1911 Adelaide Carnival
1914 Sydney Carnival
1921 Perth Carnival
Footnotes
References
Agars, Mervyn (1986), "Leahy, Thomas Joseph (Tom) (1888–1964)", in B. Nairn & G. Serle (eds.), Australian Dictionary of Biography, Volume 10: 1891—1939: Lat-Ner, Melbourne University Press, (Carlton).
Tom Leahy Kisses The Bride, The (Adelaide) News, (Saturday, 11 April 1953), p.1.
External links
Tom Leahy (c.1920), photograph in the collection of the State Library of South Australia.
Tom Leahy and Alby Klose of the West Adelaide Football Club (1909), photograph in the collection of the State Library of South Australia.
1888 births
1964 deaths
Players of Australian handball
North Adelaide Football Club players
West Adelaide Football Club players
Norwood Football Club coaches
Magarey Medal winners
Australian rules footballers from Adelaide
South Australian Football Hall of Fame inductees
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
package io.ballerina.compiler.internal.parser.tree;
import io.ballerina.compiler.syntax.tree.Node;
import io.ballerina.compiler.syntax.tree.NonTerminalNode;
import io.ballerina.compiler.syntax.tree.ReAtomCharOrEscapeNode;
import io.ballerina.compiler.syntax.tree.SyntaxKind;
import java.util.Collection;
import java.util.Collections;
/**
* This is a generated internal syntax tree node.
*
* @since 2201.3.0
*/
public class STReAtomCharOrEscapeNode extends STNode {
public final STNode reAtomCharOrEscape;
STReAtomCharOrEscapeNode(
STNode reAtomCharOrEscape) {
this(
reAtomCharOrEscape,
Collections.emptyList());
}
STReAtomCharOrEscapeNode(
STNode reAtomCharOrEscape,
Collection<STNodeDiagnostic> diagnostics) {
super(SyntaxKind.RE_LITERAL_CHAR_DOT_OR_ESCAPE, diagnostics);
this.reAtomCharOrEscape = reAtomCharOrEscape;
addChildren(
reAtomCharOrEscape);
}
@Override
public STNode modifyWith(Collection<STNodeDiagnostic> diagnostics) {
return new STReAtomCharOrEscapeNode(
this.reAtomCharOrEscape,
diagnostics);
}
public STReAtomCharOrEscapeNode modify(
STNode reAtomCharOrEscape) {
if (checkForReferenceEquality(
reAtomCharOrEscape)) {
return this;
}
return new STReAtomCharOrEscapeNode(
reAtomCharOrEscape,
diagnostics);
}
@Override
public Node createFacade(int position, NonTerminalNode parent) {
return new ReAtomCharOrEscapeNode(this, position, parent);
}
@Override
public void accept(STNodeVisitor visitor) {
visitor.visit(this);
}
@Override
public <T> T apply(STNodeTransformer<T> transformer) {
return transformer.transform(this);
}
}
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.