text stringlengths 1 22.8M |
|---|
Pdr1p (Pleiotropic Drug Resistance 1p) is a transcription factor found in yeast and is a key regulator of genes involved in general drug response. It induces the expression of ATP-binding cassette transporter, which can export toxic substances out of the cell, allowing cells to survive under general toxic chemicals. It binds to DNA sequences that contain certain motifs called pleiotropic drug response element (PDRE). Pdr1p is encoded by a gene called PDR1 (also known as YGL013C) on chromosome VII.
Transcriptional role
Pdr1p is a main regulator of PDR genes and is known to target about 50 genes. Pdr1p binds to sequence 5'-TCCGYGGR-3' of PDRE, which is located within the promoter sequences of its target genes. 218 genes are reported to possess PDRE. Pdr1p is observed to bind PDRE sites on DNA at basal level and also after simulation with toxins. This shows that Pdr1p-DNA interaction isn't dependent on toxic stimulation. This also suggests an involvement of activator(s) or co-activator(s) that induce PDR genes along with Pdr1p. Pdr1p has a functional homolog called Pdr3p encoded by gene called PDR3. Pdr3p is known to be regulated by Pdr3p and Pdr1p. Pdr1p can form a homodimer with itself or heterodimer with Pdr3p.
Loss of function studies of both PDR1 and PDR3 revealed that Pdr1p mutant shows lower tolerance (grows less in culture) against organic toxins such as cycloheximide and oligomycin. This confirms the functions of Prf1p that confer stronger drug response phenotype than Pdr3p. However, Pdr3p is crucial for PDR responses since cells containing loss of function mutation in both PDR1 and PDR3 genes weren't able to grow at all in the presence of those two toxins.
Both Pdr1p and Pdr3p regulate Pdr5p, which is an ATP-binding cassette transporter. A single amino acid substitution mutation, which is a gain of function mutation of Pdr1p denoted as pdr1-3 (F815S, substitution mutation of Phenylalanine at 815th of the polypeptide by Serine) leads to an over-expression of mRNA of PDR5, which codes for Pdr5p. For cells treated with fluphenazine, Pdr1p was the only transcription factor necessary for PDR response genes induction. But at basal level, Pdr1p can be partially compensated by Pdr3p, a functional homolog of Pdr1p.
Structure
Pdr1p and Pdr3p is a part of Gal4 transcription factor family due to their zinc-finger DNA binding motif, which is located in N-terminus end of Pdr1p. Pdr1p also contains a long internal region of many inhibitory domains and possess a C-terminal transcription activation domain (amino acids 879β1036). The transcriptional activation domain is rich in glutamine and asparagine, which is theorized to facilitate in protein-protein interaction via hydrogen bonding. A study found that DNA-binding domain of Pdr1p was sufficient for recognizing its endogenous target genes. Strong drug resistance phenotype of yeasts with pdr1-3 is speculated due to its inability to bind to ligands that otherwise cause conformational change to inhibit the transcriptional activity of Pdr1p.
Interaction with other transcription factors
Pdr1p and Pdr3p also interact with other transcription factors and their associated networks such as Yap1p, which controls oxidative stress response, and Rpn4p, which regulates proteasome activities, depending on the kinds of toxins cells face. It is known that Pdr1p induces the expression of Rpn4p.
Importance
Drugs or toxic chemicals are useful in killing pathogenic bacteria or tumor cells, and studying how they mechanistically develop tolerance to a wide range of drugs can improve anti-bacterial and cancer therapeutics. Pdr5p has a similar mechanism of actions and functions to human multidrug resistance protein, whose overexpression is shown to provide chemical tolerance to cancer cells. Studying Pdr5p and how it is regulated by Pdr1p in yeast can give insights into how multi drug resistance occurs in mammals.
By using pdr1-3 and fusing the promoter of Pdr5p to genes that code for membrane proteins of interests, yeast membrane proteins such as Pdr5p, Yor1, and Drs2 can be expressed highly so that they can be efficiently cloned and purified for further studies.
See also
Multiple drug resistance
References
Molecular biology |
The discography of British recording artist Cher Lloyd consists of two studio albums, ten singles, five featured singles, and eight promotional singles.
Lloyd rose to fame in 2010 when she participated in reality TV series The X Factor, to which she finished in fourth place. Shortly afterward, Lloyd was signed by Simon Cowell to Sony Records subsidiary Syco Music, releasing her debut single "Swagger Jagger" in June 2011. "Swagger Jagger" entered at number one on the UK Singles Chart and number two on the Irish Singles Chart. Her second single "With Ur Love" was released on 31 October, featuring Mike Posner, and reached number four in the UK, and number five in Ireland, preceding her debut album Sticks + Stones, which reached number four on the UK Albums Chart and number seven on the Irish Albums Chart. "Want U Back", featuring American rapper Astro, served as the album's third single and was released on 13 February 2012.
Studio albums
Singles
As lead artist
As featured artist
Promotional singles
Other charted songs
Music videos
Notes
References
Discographies of British artists
Pop music discographies |
Science Fiction is an album by the American jazz saxophonist and composer Ornette Coleman, recorded in 1971 and released on the Columbia label.
In 2000, the album was re-released with Broken Shadows (1971) and several unreleased tracks as a 2-CD set titled The Complete Science Fiction Sessions.
Recording
The album features Coleman's early 70s quartet, consisting of Charlie Haden (double bass), Ed Blackwell (drums), and Dewey Redman (tenor saxophone). It also features performances by former Coleman sidemen Billy Higgins (drums), Don Cherry (trumpet), and Bobby Bradford (trumpet), as well as vocals by Indian singer Asha Puthli.
Reception
The Allmusic review by Steve Huey awarded the album 5 stars and stated "Science Fiction was his creative rebirth, a stunningly inventive and appropriately alien-sounding blast of manic energy... Science Fiction is a meeting ground between Coleman's past and future; it combines the fire and edge of his Atlantic years with strong hints of the electrified, globally conscious experiments that were soon to come. And, it's overflowing with brilliance". The Rolling Stone Jazz Record Guide called it "fascinating" and "multifaceted."
Track listing
All compositions by Ornette Coleman
"What Reason Could I Give?" β 3:06
"Civilization Day" β 6:04
"Street Woman" β 4:50
"Science Fiction" β 5:03
"Rock the Clock" β 3:16
"All My Life" β 3:56
"Law Years" β 5:22
"The Jungle Is a Skyscraper" β 5:26
Recorded at Columbia Studio E, NYC on September 9 (tracks 2, 3, 7 & 8), September 10 (track 4) and October 13 (tracks 1, 5 & 6), 1971
Personnel
Ornette Coleman β alto saxophone, trumpet, violin
Don Cherry β pocket trumpet (tracks 2β4)
Bobby Bradford (tracks 4, 7 & 8), Carmine Fornarotto (tracks 1 & 6), Gerard Schwarz (tracks 1 & 6) β trumpet
Dewey Redman β tenor saxophone, musette (tracks 1 & 4β8)
Charlie Haden β bass
Billy Higgins (tracks 1β4 & 6), Ed Blackwell (tracks 1 & 4β8) β drums
David Henderson β recitation (track 4)
Asha Puthli β vocals (tracks 1 & 6)
References
1972 albums
Ornette Coleman albums
Columbia Records albums
Free jazz albums |
The history of cycling in Azerbaijan began in 1930, when bicycles were first imported from Russia.
History
Initially bikes were popular among pupils and students, and in the 1940s they became widely used by almost entire population without exception. The same year the first amateur bicycle race was launched and was held every four years. 10 years later the first professional racers begin to perform in Azerbaijan - Sabzali Museyibov and Zargarli Hussein, who later became a pioneer in the training of professional cyclists Azerbaijan.
In the second half of the 20th century, female cycling has actively developed β both individual tournaments and mixed tournaments were organized for women. In the same period, a mixed team of cyclists from Baku won several local races, and represented Azerbaijan at the Union and trans-Caucasian races.
At the same time, Azerbaijani cyclists took part in the first foreign competitions. New βstarsβ were lighted- Alkhas Talybov, Aladdin Shabanov, Vladimir Semergey, Alexander Averin and others have successfully performed in different cycle events. Alkhas Talybov, Aladdin Shabanov in these tournaments was awarded with medals and diplomas. We cannot but mention Aladdin Shabanov, who represented Azerbaijan at the races in more than 50 countries and Europe.
After his retirement, Shabanov organized the Museum of Bicycle and bicycling at the Baku State University. The exhibition was composed of materials relating to the history of cycling and a sport both in Azerbaijan and around the world. Some of the artifacts were exhibited during many international competitions, including World and European championships in cycling. Recently, the museum has celebrated its 40th anniversary.
Since the early 1990s, Azerbaijan held many cycling competitions. The championship of Azerbaijan, district and city championships, were organized for the fans by the best riders. In 1991, in honor of the 850th anniversary of the outstanding Persian poet Nizami Ganjavi a 4000Β km cycling race between Saint Petersburg and Ganja was held. There were participants from 26 cities of Russia and Azerbaijan.
In 1997, the construction of a modern sport complex was completed, and Azerbaijani national cycling federation was founded.
In 2009, the Central Directorate of Youth and Sport in Baku, Azerbaijan, together with the National Cycling Federation organized a championship of Baku road racing.
In 2011 Tour dβAzerbaΓ―djan, a cycling tour in memory of national leader Heydar Aliyev "Big Caucasus" was organized, and in 2012 - the tour became an annual event, later transformed into Tour d'Azerbaidjan. Assad Fazil Mammadov was elected as the chairman of the Azerbaijan National Cycling Federation.
References
Transport in Azerbaijan |
```java
/**
* @author : Paul Taylor
* @author : Eric Farng
*
* Version @version:$Id$
*
*
* This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser
* or (at your option) any later version.
*
* This library 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.
*
* you can get a copy from path_to_url or write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Description:
*
*/
package org.jaudiotagger.tag.datatype;
import org.jaudiotagger.logging.ErrorMessage;
import org.jaudiotagger.tag.InvalidDataTypeException;
import org.jaudiotagger.tag.id3.AbstractTagFrameBody;
import org.jaudiotagger.tag.id3.valuepair.*;
import org.jaudiotagger.tag.reference.GenreTypes;
import org.jaudiotagger.tag.reference.PictureTypes;
import org.jaudiotagger.utils.EqualsUtil;
import java.util.Iterator;
import java.util.Map;
import java.util.TreeSet;
/**
* Represents a number thats acts as a key into an enumeration of values
*/
public class NumberHashMap extends NumberFixedLength implements HashMapInterface<Integer, String>
{
/**
* key to value map
*/
private Map<Integer, String> keyToValue = null;
/**
* value to key map
*/
private Map<String, Integer> valueToKey = null;
/**
*
*/
private boolean hasEmptyValue = false;
/**
* Creates a new ObjectNumberHashMap datatype.
*
* @param identifier
* @param frameBody
* @param size
* @throws IllegalArgumentException
*/
public NumberHashMap(String identifier, AbstractTagFrameBody frameBody, int size)
{
super(identifier, frameBody, size);
if (identifier.equals(DataTypes.OBJ_GENRE))
{
valueToKey = GenreTypes.getInstanceOf().getValueToIdMap();
keyToValue = GenreTypes.getInstanceOf().getIdToValueMap();
//genres can be an id or literal value
hasEmptyValue = true;
}
else if (identifier.equals(DataTypes.OBJ_TEXT_ENCODING))
{
valueToKey = TextEncoding.getInstanceOf().getValueToIdMap();
keyToValue = TextEncoding.getInstanceOf().getIdToValueMap();
}
else if (identifier.equals(DataTypes.OBJ_INTERPOLATION_METHOD))
{
valueToKey = InterpolationTypes.getInstanceOf().getValueToIdMap();
keyToValue = InterpolationTypes.getInstanceOf().getIdToValueMap();
}
else if (identifier.equals(DataTypes.OBJ_PICTURE_TYPE))
{
valueToKey = PictureTypes.getInstanceOf().getValueToIdMap();
keyToValue = PictureTypes.getInstanceOf().getIdToValueMap();
//Issue #224 Values should map, but have examples where they dont, this is a workaround
hasEmptyValue = true;
}
else if (identifier.equals(DataTypes.OBJ_TYPE_OF_EVENT))
{
valueToKey = EventTimingTypes.getInstanceOf().getValueToIdMap();
keyToValue = EventTimingTypes.getInstanceOf().getIdToValueMap();
}
else if (identifier.equals(DataTypes.OBJ_TIME_STAMP_FORMAT))
{
valueToKey = EventTimingTimestampTypes.getInstanceOf().getValueToIdMap();
keyToValue = EventTimingTimestampTypes.getInstanceOf().getIdToValueMap();
}
else if (identifier.equals(DataTypes.OBJ_TYPE_OF_CHANNEL))
{
valueToKey = ChannelTypes.getInstanceOf().getValueToIdMap();
keyToValue = ChannelTypes.getInstanceOf().getIdToValueMap();
}
else if (identifier.equals(DataTypes.OBJ_RECIEVED_AS))
{
valueToKey = ReceivedAsTypes.getInstanceOf().getValueToIdMap();
keyToValue = ReceivedAsTypes.getInstanceOf().getIdToValueMap();
}
else if (identifier.equals(DataTypes.OBJ_CONTENT_TYPE))
{
valueToKey = SynchronisedLyricsContentType.getInstanceOf().getValueToIdMap();
keyToValue = SynchronisedLyricsContentType.getInstanceOf().getIdToValueMap();
}
else
{
throw new IllegalArgumentException("Hashmap identifier not defined in this class: " + identifier);
}
}
public NumberHashMap(NumberHashMap copyObject)
{
super(copyObject);
this.hasEmptyValue = copyObject.hasEmptyValue;
// we don'timer need to clone/copy the maps here because they are static
this.keyToValue = copyObject.keyToValue;
this.valueToKey = copyObject.valueToKey;
}
/**
* @return the key to value map
*/
public Map<Integer, String> getKeyToValue()
{
return keyToValue;
}
/**
* @return the value to key map
*/
public Map<String, Integer> getValueToKey()
{
return valueToKey;
}
/**
* @param value
*/
public void setValue(Object value)
{
if (value instanceof Byte)
{
this.value = (long) ((Byte) value).byteValue();
}
else if (value instanceof Short)
{
this.value = (long) ((Short) value).shortValue();
}
else if (value instanceof Integer)
{
this.value = (long) ((Integer) value).intValue();
}
else
{
this.value = value;
}
}
/**
* @param obj
* @return
*/
public boolean equals(Object obj)
{
if(obj==this)
{
return true;
}
if (!(obj instanceof NumberHashMap))
{
return false;
}
NumberHashMap that = (NumberHashMap) obj;
return
EqualsUtil.areEqual(hasEmptyValue, that.hasEmptyValue) &&
EqualsUtil.areEqual(keyToValue, that.keyToValue) &&
EqualsUtil.areEqual(valueToKey, that.valueToKey) &&
super.equals(that);
}
/**
* @return
*/
public Iterator<String> iterator()
{
if (keyToValue == null)
{
return null;
}
else
{
// put them in a treeset first to sort them
TreeSet<String> treeSet = new TreeSet<String>(keyToValue.values());
if (hasEmptyValue)
{
treeSet.add("");
}
return treeSet.iterator();
}
}
/**
* Read the key from the buffer.
*
* @param arr
* @param offset
* @throws InvalidDataTypeException if emptyValues are not allowed and the eky was invalid.
*/
public void readByteArray(byte[] arr, int offset) throws InvalidDataTypeException
{
super.readByteArray(arr, offset);
//Mismatch:Superclass uses Long, but maps expect Integer
Integer intValue = ((Long) value).intValue();
if (!keyToValue.containsKey(intValue))
{
if (!hasEmptyValue)
{
throw new InvalidDataTypeException(ErrorMessage.MP3_REFERENCE_KEY_INVALID.getMsg(identifier, intValue));
}
else if (identifier.equals(DataTypes.OBJ_PICTURE_TYPE))
{
logger.warning(ErrorMessage.MP3_PICTURE_TYPE_INVALID.getMsg(value));
}
}
}
/**
* @return
*/
public String toString()
{
if (value == null)
{
return "";
}
else if (keyToValue.get(value) == null)
{
return "";
}
else
{
return keyToValue.get(value);
}
}
}
``` |
The medical post-nominal suffix DObst RCOG is awarded to obstetricians and gynaecologists who have gained the Diploma of the Royal College of Obstetricians and Gynaecologists. The Diploma is aimed at doctors, and especially general practitioners, who wish to certificate their knowledge and interest in Women's Health.
See also
Royal College of Obstetricians and Gynaecologists
MRCOG
References
External links
The DObst RCOG
Official website of The Royal College of Gynaecologists
Obstetrics |
Solana de Γvila is a municipality located in the province of Γvila, Castile and LeΓ³n, Spain. According to the 2004 census (INE), the municipality has a population of 194 inhabitants.
References
Municipalities in the Province of Γvila |
St Paul's Church is a Roman Catholic church in Dover, Kent, England. It was built from 1867 to 1868. It is situated on Maison Dieu Road, north of Pencester Gardens in the centre of the town. It is a Gothic Revival church designed by E.W. Pugin.
History
Origin
In 1822, a mission started in the town that ministered to Catholics in the area and Mass was said in a house, 45 Snargate Street.
In 1834, a location had to be bought, because Mass was being said in the loft of a house on St James' Street, and it was not large to hold everybody there. A former Wesleyan chapel in Elizabeth Street was bought for the Catholics to worship in. It was bought for Β£425 and it cost Β£400 to renovate. A further Β£350 was paid for an adjacent presbytery. In May 1935, new chapel was opened. Yet, less than 30 years later, with the increasing population in the area, a new site needed to be found to accommodate the larger Catholic congregation.
Construction
In 1864, the present site on Maison Dieu Road was bought for Β£450. In 1867, construction of the church began. Construction of the church started in 1867 and cost Β£2300. Much of the money for the new building came from an endowment from the estate of Mary Winifred St Martin, Countess de Front (died 1830). She was the wife of Philip St Martin, Count de Front (died 1812), an ambassador of the Kingdom of Sardinia to the Court of St James's. On 15 May 1868, Thomas Grant the Bishop of Southwark opened the church.
In 1872, a school was built next to the church and a year later, in 1873, an apse was added to the church.
Developments
In 1959, the church was repaired. This was done by lowering the chancel and bringing forward the altar, closer to the nave of the church. In 1964, the nave was renovated, new pews were added and the pulpit was removed.
On 23 October 1987, an arsonist set fire to the church. The fire destroyed the church roof and organ. After setting fire to the church, the arsonist went to Canterbury to rob St Thomas of Canterbury Church there. A few days later, he was arrested by the police.
Repair work to the church started on 1 June 1988 and on 28 October the church was reopened. Mass was celebrated that day by the Archbishop of Southwark, Michael Bowen.
Parish
Very close to the church is St Edmund's Chapel, it was built in 1262, but was dissolved in 1544. In the 1960s, efforts were made to restore it, achieved primarily through the efforts of Fr Terrence Tanner, parish priest of St Paul's Church from 1958 to 1970. The chapel is owned by The St Edmund of Abingdon Memorial Trust.
In 2015, together with St Finbarr's Church in Aylesham, the church became part of the parish of the Good Shepherd.
St Paul's Church has two Sunday Masses, they are at 6:00pm on Saturday and 9:15am on Sunday.
See also
Roman Catholic Archdiocese of Southwark
References
External links
Official Parish site
St Paul's Church on Archdiocese of Southwark
Churches in Dover, Kent
Roman Catholic churches in Kent
Gothic Revival church buildings in England
Gothic Revival architecture in Kent
Roman Catholic churches completed in 1868
1867 establishments in England
19th-century Roman Catholic church buildings in the United Kingdom
E. W. Pugin church buildings |
Sir Luigi Camilleri was the chief justice of Malta from 1952 to 1957.
References
Chief justices of Malta
Maltese knights
20th-century Maltese judges
1892 births
1989 deaths |
Peyrouzet (; ) is a commune in the Haute-Garonne department in southwestern France.
Population
See also
Communes of the Haute-Garonne department
References
Communes of Haute-Garonne |
```javascript
//your_sha256_hash---------------------------------------
//your_sha256_hash---------------------------------------
// Object Rest unit tests
if (this.WScript && this.WScript.LoadScriptFile) { // Check for running in ch
this.WScript.LoadScriptFile("..\\UnitTestFramework\\UnitTestFramework.js");
}
var tests = [
{
name: "let assignment with simple Object",
body: function() {
let {a, b, ...rest} = {a: 1, b: 2, c: 3, d: 4};
assert.areEqual(1, a);
assert.areEqual(2, b);
assert.areEqual({c: 3, d: 4}, rest);
}
},
{
name: "var assignment with simple Object",
body: function() {
var {a, b, ...rest} = {a: 1, b: 2, c: 3, d: 4};
assert.areEqual(1, a);
assert.areEqual(2, b);
assert.areEqual({c: 3, d: 4}, rest);
}
},
{
name: "Rest in assignment expression",
body: function() {
({a, b, ...rest} = {a: 1, b: 2, c: 3, d: 4});
assert.areEqual(1, a);
assert.areEqual(2, b);
assert.areEqual({c: 3, d: 4}, rest);
}
},
{
name: "Rest with simple function parameter Object",
body: function() {
function foo({a: _a, b: _b, ..._rest}) {
assert.areEqual(1, _a);
assert.areEqual(2, _b);
assert.areEqual({c: 3, d: 4}, _rest);
}
foo({a: 1, b: 2, c: 3, d: 4});
}
},
{
name: "Rest with simple catch parameter Object",
body: function() {
try {
throw {a: 1, b: 2, c: 3, d: 4};
} catch({a: _a, b: _b, ..._rest}) {
assert.areEqual(1, _a);
assert.areEqual(2, _b);
assert.areEqual({c: 3, d: 4}, _rest);
}
}
},
{
name: "Rest with simple for variable declaration",
body: function() {
bar = [{a: 1, b: 2, c: 3, d: 4}];
for({a, b, ...rest} of bar) {
assert.areEqual(1, a);
assert.areEqual(2, b);
assert.areEqual({c: 3, d: 4}, rest);
}
}
},
{
name: "Rest nested in destructuring",
body: function() {
let {a, b, double: {c, ...rest}} = {a: 1, b: 2, double: {c: 3, d: 4}};
assert.areEqual(1, a);
assert.areEqual(2, b);
assert.areEqual(3, c);
assert.areEqual({d: 4}, rest);
}
},
{
name: "Rest with nested function parameter Object",
body: function() {
function foo({a: _a, b: _b, double: {c: _c, ..._rest}}) {
assert.areEqual(1, _a);
assert.areEqual(2, _b);
assert.areEqual(3, _c);
assert.areEqual({d: 4}, _rest);
}
foo({a: 1, b: 2, double: {c: 3, d: 4}});
}
},
{
name: "Rest with computed properties",
body: function() {
let {a, ["b"]:b, ...rest} = {a: 1, b: 2, c: 3, d: 4};
assert.areEqual(1, a);
assert.areEqual(2, b);
assert.areEqual({c: 3, d: 4}, rest);
}
},
{
name: "Rest with computed properties in function parameter binding",
body: function() {
function foo({a: _a, ["b"]: _b, ..._rest}) {
assert.areEqual(1, _a);
assert.areEqual(2, _b);
assert.areEqual({c: 3, d: 4}, _rest);
}
foo({a: 1, b: 2, c: 3, d: 4});
}
},
{
name: "Rest inside re-entrant function",
body: function() {
function foo(r) {
if (r) {
var {a, [foo(false)]:b, ...rest} = {a: 1, b: 2, c: 3, d: 4};
assert.areEqual(1, a);
assert.areEqual(2, b);
assert.areEqual({c: 3, d: 4}, rest);
} else {
var {one, ...rest} = {one:1, two:2, three:3};
assert.areEqual(1, one);
assert.areEqual({two: 2, three: 3}, rest);
}
return "b";
}
foo(true);
}
},
{
name: "Rest nested in Computed Value",
body: function() {
let {[eval("let {..._rest} = {a: 1, b: 2, c: 3, d: 4};\"a\"")]:nest, ...rest} = {a: 10, b: 20, c: 30, d: 40};
assert.areEqual(10, nest);
assert.areEqual({b: 20, c: 30, d: 40}, rest);
}
},
{
name: "Rest with no values left to destructure",
body: function() {
let {a, b, ...rest} = {a: 1, b: 2};
assert.areEqual(1, a);
assert.areEqual(2, b);
assert.areEqual({}, rest);
}
},
{
name: "Getters in rhs object should be evaluated",
body: function() {
let getterExecuted = false;
let obj = {a: 1, get b() {getterExecuted = true; return 2;}};
let {...rest} = obj;
assert.areEqual(1, rest.a);
assert.isTrue(getterExecuted);
assert.areEqual(2, rest.b);
}
},
{
name: "Rest modifying source object",
body: function() {
let val = 1;
let source = {get a() {val++; return 1;}, get b() {return val;}};
let {b, ...rest} = source;
assert.areEqual(1, b);
assert.areEqual(1, rest.a);
}
},
{
name: "Source object changed by destructuring before Rest",
body: function() {
let val = 1;
let source = {get a() {val++; return 1;}, get b() {return val;}};
let {a, ...rest} = source;
assert.areEqual(1, a);
assert.areEqual(2, rest.b);
}
},
{
name: "Copy only own properties",
body: function() {
let parent = {i: 1, j: 2};
let child = Object.create(parent);
child.i = 3;
let {...rest} = child;
assert.areEqual(3, child.i);
assert.areEqual(2, child.j);
assert.areEqual(3, rest.i);
assert.isFalse(rest.hasOwnProperty("j"));
}
},
{
name: "Rest includes symbols in properties",
body: function() {
let sym = Symbol("foo");
let a = {};
a[sym] = 1;
let {...rest} = a;
assert.areEqual(1, rest[sym], "property with Symbol property name identifier should be copied over");
assert.areEqual(1, Object.getOwnPropertySymbols(rest).length);
}
},
{
name: "Object Rest interacting with Arrays",
body: function() {
let arr = [1, 2, 3];
let {[2]:foo, ...rest} = arr;
assert.areEqual(2, Object.keys(rest).length);
assert.areEqual(1, rest[0]);
assert.areEqual(2, rest[1]);
assert.areEqual(3, foo);
}
},
// TODO: Fix bug regarding nested destrucuring in array rest.
// Disabling this test for now
// {
// name: "Object Rest interacting with Array Rest",
// body: function() {
// function foo(a, ...{...rest}) {
// assert.areEqual(1, a);
// assert.areEqual(2, rest[0]);
// assert.areEqual(3, rest[1]);
// assert.areEqual(2, Object.keys(rest).length);
// }
// foo(1, 2, 3);
// }
// },
{
name: "Object Rest interacting with Numbers",
body: function() {
let {...rest} = 1;
assert.areEqual(0, Object.keys(rest).length);
}
},
{
name: "Object Rest interacting with Functions",
body: function() {
let {...rest} = function i() {return 1;}
assert.areEqual(0, Object.keys(rest).length);
}
},
{
name: "Object Rest interacting with Strings",
body: function() {
let {...rest} = "edge";
assert.areEqual(4, Object.keys(rest).length);
assert.areEqual("e", rest[0]);
assert.areEqual("d", rest[1]);
assert.areEqual("g", rest[2]);
assert.areEqual("e", rest[3]);
}
},
{
name: "Test Proxy Object",
body: function() {
let proxy = new Proxy({i: 1, j: 2}, {});
let {...rest} = proxy;
assert.areEqual(2, Object.keys(rest).length);
assert.areEqual(1, rest.i);
assert.areEqual(2, rest.j);
}
},
{
name: "Test Proxy Object with custom getter",
body: function() {
let handler = {get: function(obj, prop) {return obj[prop];}};
let proxy = new Proxy({i: 1, j: 2}, handler);
let {...rest} = proxy;
assert.areEqual(2, Object.keys(rest).length);
assert.areEqual(1, rest.i);
assert.areEqual(2, rest.j);
}
},
{
name: "Test Proxy Object with custom getter and setter",
body: function() {
let setterCalled = false;
let handler = {
get: function(obj, prop) {
return obj[prop];
},
set: function(obj, prop, value) {
setterCalled = true;
}
};
let proxy = new Proxy({i: 1, j: 2}, handler);
let {...rest} = proxy;
assert.areEqual(2, Object.keys(rest).length);
assert.areEqual(1, rest.i);
assert.areEqual(2, rest.j);
assert.isFalse(setterCalled);
}
},
{
name: "Test Syntax Errors",
body: function() {
assert.throws(function () { eval("let {...rest1, ...rest2} = {a:1, b:2};"); }, SyntaxError, "Destructuring assignment can only have 1 Rest", "Destructuring rest variables must be in the last position of the expression");
assert.throws(function () { eval("let {...{a, b}} = {a:1, b:2};"); }, SyntaxError, "Destructuring inside Rest is invalid syntax", "Expected identifier");
assert.throws(function () { eval("let {...{a, ...rest}} = {a:1, b:2};"); }, SyntaxError, "Nested Rest is invalid syntax", "Expected identifier");
assert.throws(function () { eval("let {...rest, a} = {a:1, b:2};"); }, SyntaxError, "Rest before other variables is invalid syntax", "Destructuring rest variables must be in the last position of the expression");
assert.throws(function () { eval("...(rest)"); }, SyntaxError, "Rest must be inside destructuring", "Invalid use of the ... operator. Spread can only be used in call arguments or an array literal.");
assert.throws(function () { eval("let {...(rest)} = {a:1, b:2};"); }, SyntaxError, "Destructuring expressions can only have identifier references");
assert.throws(function () { eval("let {...++rest} = {a: 1, b: 2};"); }, SyntaxError, "Prefix operators before rest is invalid syntax", "Unexpected operator in destructuring expression");
assert.throws(function () { eval("let {...rest++} = {a: 1, b: 2};"); }, SyntaxError, "Postfix operators after rest is invalid syntax", "Unexpected operator in destructuring expression");
assert.throws(function () { eval("let {...rest+1} = {a: 1, b: 2};"); }, SyntaxError, "Infix operators after rest is invalid syntax", "Unexpected operator in destructuring expression");
assert.throws(function () { eval("let {... ...rest} = {};"); }, SyntaxError, "Incomplete rest expression", "Unexpected operator in destructuring expression");
assert.throws(function () { eval("let {...} = {};"); }, SyntaxError, "Incomplete rest expression", "Destructuring expressions can only have identifier references");
assert.throws(function () { eval("function foo({...rest={}}){};"); }, SyntaxError, "Rest cannot be default initialized", "Unexpected default initializer");
}
},
{
name: "Test Type Errors",
body: function() {
assert.throws(function () { eval("let {...rest} = undefined;"); }, TypeError, "Cannot destructure undefined", "Cannot convert null or undefined to object");
assert.throws(function () { eval("let {...rest} = null;"); }, TypeError, "Cannot destructure null", "Cannot convert null or undefined to object");
}
},
];
testRunner.runTests(tests, { verbose: WScript.Arguments[0] != "summary" });
``` |
This is an incomplete list of the continuing Acts of the Parliament of Canada. Many of these Acts have had one or more amending Acts.
1867 β 1899
Aliens and Naturalization Act, 1868
Fisheries Act, 1868
Gradual Enfranchisement Act, 1869
Manitoba Act, 1870
Bank Act, 1871
Dominion Lands Act, 1872
Parliament of Canada Act, 1875
Supreme and Exchequer Courts Act, 1875
Indian Act, 1876
Canada Temperance Act, 1878
Naturalization and Aliens Act, 1881
Chinese Immigration Act, 1885
Rocky Mountains Park Act, 1887
Criminal Code, 1892
Canada Evidence Act, 1893
Quebec Boundary Extension Act, 1898
1900 β 1929
Alberta Act, 1905
Saskatchewan Act, 1905
Juvenile Delinquents Act, 1908
Immigration Act, 1910
Naval Service Act, 1910
Quebec Boundaries Extension Act, 1912
Finance Act, 1914
Naturalization Act, 1914
War Measures Act, 1914
Military Service Act, 1917
Military Voters Act, 1917
Wartime Elections Act, 1917
Civil Service Act, 1918
Statistics Act, 1918
Women's Franchise Act 1918
Canada Highways Act, 1919
Dominion Elections Act, 1920
Food and Drugs Act, 1920
Canadian Nationals Act 1921
Chinese Immigration Act, 1923
Combines Investigation Act 1923
National Defence Act, 1923
1930 β 1949
National Parks Act, 1930
Natural Resources Acts, 1930
Unemployment and Farm Relief Act, 1931
Bank of Canada Act, 1934
Public Works Construction Act, 1934
Succession to the Throne Act, 1937
National Housing Act, 1938
National Resources Mobilization Act, 1940
Family Allowance Act, 1945
Canadian Citizenship Act, 1946
Canadian Overseas Telecommunication Corporation Act, 1948
1950 β 1979
Canada Council for the Arts Act, 1957
Hospital Insurance and Diagnostic Services Act, 1957
Canadian Bill of Rights, 1960
Narcotic Control Act, 1961
Canada Labour Code, 1967
Criminal Law Amendment Act, 1968β69
Arctic Waters Pollution Prevention Act, 1970
Consumer Packaging and Labeling Act, 1970
Weights and Measures Act, 1970
Divorce Act, 1968 - replaced by Divorce Act, 1985
Canada Wildlife Act, 1973
National Symbol of Canada Act, 1975
Anti-Inflation Act 1975
Immigration Act, 1976
Canadian Human Rights Act, 1977
Canadian Football Act 1974
1980 β 1989
Tax Court of Canada Act, 1980
Privacy Act, 1982
Access to Information Act, 1983
Tax Court of Canada Act, 1983
Western Grain Transportation Act, 1983
Canada Health Act, 1984
Foreign Extraterritorial Measures Act, 1984
Young Offenders Act, 1984
Asia Pacific Foundation of Canada Act, 1985
Auditor General Act, 1985
Canada Agricultural Products Act, 1985
Divorce Act (R.S., 1985, c. 3 (2nd Supp.))
Aeronautics Act, R.S. 1985
Bankruptcy and Insolvency Act, 1985
Canada Business Corporations Act, 1985
Companies' Creditors Arrangement Act, 1985
Criminal Records Act, 1985
Lobbying Act, 1985
Pest Control Products Act, 1985
Radiocommunication Act, 1985
Employment Equity Act, 1986
Canada Agricultural Products Act, 1988
Canadian Centre on Substance Abuse Act, 1988
Canadian Multiculturalism Act, 1988
Emergencies Act, 1988
Heritage Railway Stations Protection Act, 1988
Mutual Legal Assistance in Criminal Matters Act, 1988
Official Languages Act, 1988
1990 β 1999
Canadian Space Agency Act, 1990
Integrated Circuit Topography Act, 1990
Broadcasting Act, 1991
Bank Act, 1991
Contraventions Act, 1992
Transportation of Dangerous Goods Act, 1992, 1992
Telecommunications Act, 1993
Firearms Act, 1995 1995
Controlled Drugs and Substances Act, 1996
Winding-up and Restructuring Act, 1996
Nuclear Safety and Control Act, S.C. 1997
Tobacco Act, 1997
Canada Marine Act, 1998
DNA Identification Act, 1998
Canadian Environmental Protection Act, 1999, 1999
Clarity Act, 1999
Corruption of Foreign Public Officials Act, 1999
2000 β 2009
Canada Elections Act, 2000
Canada National Parks Act, 2000
Crimes Against Humanity and War Crimes Act, 2000
Personal Information Protection and Electronic Documents Act, 2000
Canada Foundation for Sustainable Development Technology Act, 2001
Immigration and Refugee Protection Act, 2001
Proceeds of Crime (Money Laundering) and Terrorist Financing Act, 2001
Anti-Terrorism Act, 2001
Species at Risk Act, 2002
Youth Criminal Justice Act, 2002
Canadian Environmental Assessment Act, 2003
An Act to amend the Criminal Code (protection of children and other vulnerable persons) and the Canada Evidence Act, 2004
Assisted Human Reproduction Act, 2004
International Transfer of Offenders Act, 2004
Pledge to Africa Act, 2004
Wage Earner Protection Program Act, 2005
Civil Marriage Act, 2005
Federal Accountability Act, 2006
Public Servants Disclosure Protection Act, 2007
Veterans' Bill of Rights,, 2007
Heritage Lighthouse Protection Act, 2008
Official Development Assistance Accountability Act,, 2008
Tackling Violent Crime Act, 2008
Electronic Commerce Protection Act, 2009
2010 β 2019
Canada Consumer Product Safety Act, 2010
Fighting Internet and Wireless Spam Act, 2010
Copyright Modernization Act, 2012
Jobs, Growth and Long-term Prosperity Act, 2012
Jobs and Growth Act, 2012, 2012
Preventing Persons from Concealing Their Identity during Riots and Unlawful Assemblies Act, 2012
Protecting Canada's Immigration System Act, 2012
Safe Streets and Communities Act,, 2012
Succession to the Throne Act, 2013, 2013
Combating Terrorism Act, 2013
Fair Elections Act, 2014
Protecting Canadians from Online Crime Act, 2014
Anti-terrorism Act, 2015, 2015
An Act to amend the Canadian Human Rights Act and the Criminal Code, 2016
Cannabis Act, 2018
Tobacco and Vaping Products Act, 2018 (formerly the Tobacco Act)
Accessible Canada Act, 2019
Ending the Captivity of Whales and Dolphins Act, 2019
Impact Assessment Act and Canadian Energy Regulator Act, 2019
Oil Tanker Moratorium Act, 2019
2020 β present
Preserving Provincial Representation in the House of Commons Act, 2022
Online News Act, 2023
Online Streaming Act, 2023
See also
List of Canadian provincial Acts
External links
Statutes of Canada, 1867 to 1872 at Canadiana.org
Acts of the Parliament of the Dominion of Canada, 1873 to 1900 at Canadiana.org
Acts of the Parliament (of the Dominion) of Canada, 1901 to 1997 at the Internet Archive
Acts of the Parliament of Canada, 1987 to 2021 at the Government of Canada Publications catalogue.
Official Justice Laws Website of the Canadian Department of Justice
Constitutional Acts, Consolidated Statutes, and Annual Statutes at the Canadian Legal Information Institute
Canadian Constitutional Documents: A Legal History at the Solon Law Archive.
Canada
Acts of Parliament of Canada
Statutory law by legislature |
Zelmo "Big Z" Beaty ( ; October 25, 1939 β August 27, 2013) was an American basketball player. He played eight seasons in the National Basketball Association (NBA) and four in the rival American Basketball Association (ABA). A three-time ABA All-Star, Beaty was inducted into the Naismith Memorial Basketball Hall of Fame as a player in 2016.
Early life
Zelmo Beaty Jr. was born on October 25, 1939, in Hillister, Texas, a small town of 250. He attended Scott High School in Woodville, Texas, and played for Coach John Payton winning back to back Prairie View Interscholastic League 1A state championships in 1957 & 1958. For college, Beaty attended Prairie View A&M.
College
Prairie View A&M Panthers
"From 1958β1962 at Prairie View A&M Beaty averaged 25 points and 20 rebounds per game and was a two-time first team NAIA All-American (1960 & 1962). The "Big Z" led Prairie View A&M to the NAIA national basketball title in 1962 and was named the Chuck Taylor Tournament MVP."
NBA
St. Louis Hawks
He was selected with the third pick of the 1962 National Basketball Association (NBA) Draft by the St. Louis Hawks. Beaty was named to the inaugural NBA All-Rookie Team in 1963. He averaged more than 20 points per game in three different seasons, and over ten rebounds per game in six of his seven seasons with the Hawks. A physical player, Beaty led the NBA in personal fouls in 1962β63 and 1965β66, and tied for the league lead in disqualifications during the 1963β64 season.
On December 3, 1967, Beaty scored an NBA career high 42 points in a 123β109 win over the Seattle SuperSonics. During the 1969 NBA Playoffs, the first Hawks postseason in Atlanta, Beaty averaged 22.5 points (his highest NBA playoffs average) and 12.9 rebounds in 11 games before, in a pattern familiar for the 1960s Hawks, they were eliminated in the Western Division Finals, the round before the NBA Finals.
During his Hawks tenure, Beaty made two NBA All-Star Game appearances in 1966 and 1968, and helped the Hawks reach the playoffs every season of his tenure. In 1969, Beaty left the NBA to play in the rival American Basketball Association (ABA).
ABA
Utah Stars
Beaty was legally barred from playing in the ABA by a legal injunction from the Hawks during the 1969-70 NBA season. In his first season in the ABA, Beaty led the league in field goal percentage, was third in the league in rebounds per game. Coached by Bill Sharman and also featuring ABA star Willie Wise, the Stars were dominant in the regular season and finished with the second best record in the league at 57-27. Utah's success continued in the playoffs, sweeping the Texas Chaparrals in the first round, before defeating the Indiana Pacers to advance to the 1971 ABA Finals. In the finals, Beaty averaged 28.4 points and 16 rebounds per game, including recording totals of 36 points and 16 rebounds in a Game 7 win to end the series. After the game, Beaty was awarded the ABA Playoffs Most Valuable Player Award for his role in the championship victory.
The following year, Beaty averaged a career high (for both his NBA and ABA careers) of 23.6 points per game while playing all 84 games of the regular season. However, that postseason the Stars would be eliminated during a hard-fought seven game series in the Western Division Finals by the Pacers, who Utah had beat the year before to advance to the finals.
In total, Beaty played four seasons with the Stars, being named to the All-ABA Second Team twice and making the ABA All-Star Game three times, before returning to the NBA as a member of the Los Angeles Lakers.
He also served as president of the ABA's Player Association, as well as union player representative with the Hawks.
By 1974 during his final year with the Stars, Beaty was severely hampered by knee injuries, having undergone six surgeries on his knees during his career. Beaty retired in 1975 with combined ABA/NBA totals of 15,207 points and 9,665 rebounds. He briefly served as a coach for the ABA's Virginia Squires.
Personal
After pro ball, Beaty worked in financial planning. He also worked as a substitute physical education teacher in Seattle elementary schools. Beaty died from cancer on August 27, 2013, at his home in Bellevue, Washington. He was 73 years old. He had been married to his wife for about 50 years, and had two children.
Posthumous honors
Beaty was selected to be inducted into the 2014 National Collegiate Basketball Hall of Fame class and the 2016 Naismith Memorial Basketball Hall of Fame class.
Host Josh Levin ends every episode of the Slate sports podcast Hang Up and Listen by saying, "Remember Zelmo Beaty." This is a reference to an appearance by Shaquille O'Neal on the Late Show with David Letterman in which the host asked O'Neal about several centers from earlier eras and O'Neal did not know about Beaty even though Beaty made significant contributions to the game on and off the court.
NBA/ABA career statistics
Regular season
|-
| style="text-align:left;"|
| style="text-align:left;"|St. Louis
| 80 || β || 24.0 || .439 || β || .717 || 8.3 || 1.1 || β || β || 10.2
|-
| style="text-align:left;"|
| style="text-align:left;"|St. Louis
| 59 || β || 32.6 || .444 || β || .741 || 10.7 || 1.3 || β || β || 13.1
|-
| style="text-align:left;"|
| style="text-align:left;"|St. Louis
| 80 || β || 36.5 || .482 || β || .715 || 12.1 || 1.4 || β || β || 16.9
|-
| style="text-align:left;"|
| style="text-align:left;"|St. Louis
| 80 || β || 38.4 || .473 || β || .758 || 13.6 || 1.6 || β || β || 20.7
|-
| style="text-align:left;"|
| style="text-align:left;"|St. Louis
| 48 || β || 34.6 || .473 || β || .758 || 10.7 || 1.3 || β || β || 17.8
|-
| style="text-align:left;"|
| style="text-align:left;"|St. Louis
| 82 || β || 37.4 || .488 || β || .794 || 11.7 || 2.1 || β || β || 21.1
|-
| style="text-align:left;"|
| style="text-align:left;"|Atlanta
| 72 || β || 35.8 || .470 || β || .731 || 11.1 || 1.8 || β || β || 21.5
|-
| style="text-align:left;background:#afe6fa;"|β
| style="text-align:left;"|Utah (ABA)
| 76 || β || 38.4 || .555 || .500 || .791 || 15.7 || 1.9 || β || β || 22.9
|-
| style="text-align:left;"|
| style="text-align:left;"|Utah (ABA)
| 84 || β || 37.3 || .539 || .000 || .829 || 13.2 || 1.5 || β || β || 23.6
|-
| style="text-align:left;"|
| style="text-align:left;"|Utah (ABA)
| 82 || β || 34.2 || .520 || .000 || .803 || 9.8 || 1.5 || β || 1.0 || 16.4
|-
| style="text-align:left;"|
| style="text-align:left;"|Utah (ABA)
| 77 || β || 32.2 || .524 || .000 || .795 || 8.0 || 1.7 || 0.8 || 0.8 || 13.4
|-
| style="text-align:left;"|
| style="text-align:left;"|L.A. Lakers
| 69 || β || 17.6 || .439 || β || .800 || 4.7 || 1.1 || 0.7 || 0.4 || 5.5
|- class="sortbottom"
| style="text-align:center;" colspan="2"| Career
| 889 || β || 33.4 || .494 || .154 || .771 || 10.9 || 1.5 || 0.7 || 0.8 || 17.1
|- class="sortbottom"
| style="text-align:center;" colspan="2"| All-Star
| 5 || 1 || 24.6 || .340 || β || .789 || 9.4 || 1.2 || 0.2 || 0.4 || 9.8
Playoffs
|-
|style="text-align:left;"|1963
|style="text-align:left;"|St. Louis
|11||β||27.9||.443||β||.750||7.6||1.0||β||β||10.3
|-
|style="text-align:left;"|1964
|style="text-align:left;"|St. Louis
|12||β||36.3||.521||β||.597||9.5||1.0||β||β||14.3
|-
|style="text-align:left;"|1965
|style="text-align:left;"|St. Louis
|4||β||38.5||.492||β||.760||13.8||0.3||β||β||19.3
|-
|style="text-align:left;"|1966
|style="text-align:left;"|St. Louis
|10||β||41.8||.493||β||.759||13.1||2.2||β||β||19.0
|-
|style="text-align:left;"|1967
|style="text-align:left;"|St. Louis
|9||β||35.3||.442||β||.785||9.9||1.3||β||β||15.9
|-
|style="text-align:left;"|1968
|style="text-align:left;"|St. Louis
|6||β||39.8||.467||β||.782||13.5||2.5||β||β||21.5
|-
|style="text-align:left;"|1969
|style="text-align:left;"|Atlanta
|11||β||43.0||.432||β||.672||12.9||2.3||β||β||22.5
|-
| style="text-align:left;background:#afe6fa;"|1971β
|style="text-align:left;"|Utah (ABA)
|18||β||38.8||.536||β||.846||14.6||2.4||β||β||23.2
|-
|style="text-align:left;"|1972
|style="text-align:left;"|Utah (ABA)
|11||β||40.3||.552||β||.830||14.0||2.2||β||β||20.1
|-
|style="text-align:left;"|1973
|style="text-align:left;"|Utah (ABA)
|10||β||38.7||.552||β||.827||11.6||1.4||β||β||15.9
|-
|style="text-align:left;"|1974
|style="text-align:left;"|Utah (ABA)
|13||β||36.3||.503||β||.825||10.8||1.6||1.4||0.9||14.8
|- class="sortbottom"
| style="text-align:center;" colspan="2"| Career
| 115 || β || 37.8 || .496 || β || .770 || 11.9 || 1.7 || 1.4 || 0.9 || 17.9
Legacy
The March 16, 2022, game between Maryland Eastern Shore and Coastal Carolina at The Basketball Classic been designated the Zelmo Beaty Game.
See also
Basketball in the United States
References
External links
Remember the ABA: Zelmo Beaty
Remembering Zelmo Beaty
1939 births
2013 deaths
Basketball coaches from Texas
American men's basketball players
Atlanta Hawks players
Basketball players from Texas
Deaths from cancer in Washington (state)
Centers (basketball)
Los Angeles Lakers players
National Basketball Association All-Stars
National Collegiate Basketball Hall of Fame inductees
People from Tyler County, Texas
Prairie View A&M Panthers basketball players
St. Louis Hawks draft picks
St. Louis Hawks players
Utah Stars players
Virginia Squires coaches |
Joina City is the 3rd tallest building in Zimbabwe standing at 105 metres (behind the Rerseve Bank of Zimbabwe (120m) and NRZ Headquarters (110m). It is owned by Masawara Investments. The building has the single largest lift and escalator installation in Zimbabwe. Construction started in 1998 but was halted due economic crisis that was plaguing Zimbabwe. then resumed and completed in 2010
The Building has 3 basement parking floors, 2 Open Shopping Mall namely Lower Ground (UG) and Upper Ground (UG) and 19 Commercial Floors.
References
Buildings and structures in Zimbabwe
Harare |
In natural language processing, language identification or language guessing is the problem of determining which natural language given content is in. Computational approaches to this problem view it as a special case of text categorization, solved with various statistical methods.
Overview
There are several statistical approaches to language identification using different techniques to classify the data. One technique is to compare the compressibility of the text to the compressibility of texts in a set of known languages. This approach is known as mutual information based distance measure. The same technique can also be used to empirically construct family trees of languages which closely correspond to the trees constructed using historical methods. Mutual information based distance measure is essentially equivalent to more conventional model-based methods and is not generally considered to be either novel or better than simpler techniques.
Another technique, as described by Cavnar and Trenkle (1994) and Dunning (1994) is to create a language n-gram model from a "training text" for each of the languages. These models can be based on characters (Cavnar and Trenkle) or encoded bytes (Dunning); in the latter, language identification and character encoding detection are integrated. Then, for any piece of text needing to be identified, a similar model is made, and that model is compared to each stored language model. The most likely language is the one with the model that is most similar to the model from the text needing to be identified. This approach can be problematic when the input text is in a language for which there is no model. In that case, the method may return another, "most similar" language as its result. Also problematic for any approach are pieces of input text that are composed of several languages, as is common on the Web.
For a more recent method, see ΕehΕ―Εek and Kolkus (2009). This method can detect multiple languages in an unstructured piece of text and works robustly on short texts of only a few words: something that the n-gram approaches struggle with.
An older statistical method by Grefenstette was based on the prevalence of certain function words (e.g., "the" in English).
A common non-statistical intuitive approach (though highly uncertain) is to look for common letter combinations, or distinctive diacritics or punctuation.
Identifying similar languages
One of the great bottlenecks of language identification systems is to distinguish between closely related languages. Similar languages like Bulgarian and Macedonian or Indonesian and Malay present significant lexical and structural overlap, making it challenging for systems to discriminate between them.
In 2014 the DSL shared task has been organized providing a dataset (Tan et al., 2014) containing 13 different languages (and language varieties) in six language groups: Group A (Bosnian, Croatian, Serbian), Group B (Indonesian, Malaysian), Group C (Czech, Slovak), Group D (Brazilian Portuguese, European Portuguese), Group E (Peninsular Spanish, Argentine Spanish), Group F (American English, British English). The best system reached performance of over 95% results (Goutte et al., 2014). Results of the DSL shared task are described in Zampieri et al. 2014.
Software
Apache OpenNLP includes char n-gram based statistical detector and comes with a model that can distinguish 103 languages
Apache Tika contains a language detector for 18 languages
See also
Native Language Identification
Algorithmic information theory
Artificial grammar learning
Family name affixes
Kolmogorov complexity
Language Analysis for the Determination of Origin
Machine translation
Translation
References
Benedetto, D., E. Caglioti and V. Loreto. Language trees and zipping. Physical Review Letters, 88:4 (2002), Complexity theory.
Cavnar, William B. and John M. Trenkle. "N-Gram-Based Text Categorization". Proceedings of SDAIR-94, 3rd Annual Symposium on Document Analysis and Information Retrieval (1994) .
Cilibrasi, Rudi and Paul M.B. Vitanyi. "Clustering by compression". IEEE Transactions on Information Theory 51(4), April 2005, 1523β1545.
Dunning, T. (1994) "Statistical Identification of Language". Technical Report MCCS 94-273, New Mexico State University, 1994.
Goodman, Joshua. (2002) Extended comment on "Language Trees and Zipping". Microsoft Research, Feb 21 2002. (This is a criticism of the data compression in favor of the Naive Bayes method.)
Goutte, C.; Leger, S.; Carpuat, M. (2014) The NRC System for Discriminating Similar Languages. Proceedings of the Coling 2014 workshop "Applying NLP Tools to Similar Languages, Varieties and Dialects"
Grefenstette, Gregory. (1995) Comparing two language identification schemes. Proceedings of the 3rd International Conference on the Statistical Analysis of Textual Data (JADT 1995).
Poutsma, Arjen. (2001) Applying Monte Carlo techniques to language identification. SmartHaven, Amsterdam. Presented at CLIN 2001.
Tan, L.; Zampieri, M.; LjubeΕ‘iΔ, N.; Tiedemann, J. (2014) Merging Comparable Data Sources for the Discrimination of Similar Languages: The DSL Corpus Collection. Proceedings of the 7th Workshop on Building and Using Comparable Corpora (BUCC). Reykjavik, Iceland. p.Β 6-10
The Economist. (2002) "The elements of style: Analysing compressed data leads to impressive results in linguistics"
Radim ΕehΕ―Εek and Milan Kolkus. (2009) "Language Identification on the Web: Extending the Dictionary Method" Computational Linguistics and Intelligent Text Processing.
Zampieri, M.; Tan, L.; LjubeΕ‘iΔ, N.; Tiedemann, J. (2014) A Report on the DSL Shared Task 2014. Proceedings of the 1st Workshop on Applying NLP Tools to Similar Languages, Varieties and Dialects (VarDial). Dublin, Ireland. p.Β 58-67.
References
Applications of artificial intelligence
Computational linguistics
Natural language processing
Translation
Tasks of natural language processing |
StΓ©fanie Clermont (born April 24, 1988) is a Canadian writer, who published her debut novel Le jeu de la musique in 2017.
The novel was published in an English translation, The Music Game, in 2022.
Biography
Originally from Ottawa, Ontario, Clermont won a children's poetry contest sponsored by the Ottawa Public Library in 2001, in the ages 12β14 division. After completing high school, she travelled throughout Canada and the United States before settling in Montreal in 2012.
Awards and honours
Le jeu de la musique won the Prix de l'Εuvre de la relΓ¨ve from the Conseil des arts et des lettres du QuΓ©bec and the Prix Adrienne-Choquette in 2018. It was a competing title in the 2018 edition of Le Combat des livres, where it was defended by comedian Philippe-Audrey Larrue-St-Jacques.
References
1988 births
Living people
Canadian women novelists
Canadian novelists in French
Franco-Ontarian people
Writers from Ottawa
21st-century Canadian novelists
21st-century Canadian women writers |
Tararo Jane Ariki II (26 May 1910 β 23 December 1982) was a Cook Islands chiefess and politician. An ariki of Mauke island, she was also the first woman to become a member of the islands' Legislative Council.
Biography
Tararo was born in 1910 in Mauke. She became the Tararo ariki of Mauke in 1934, succeeding her mother. She married George Cowan, and the couple had a daughter Hilda who was born in 1937 but died the following year. During the 1930s she formed a dance group consisting of family members and other people from Oiretumu village.
The first indirect elections were held for the Legislative Council in 1947, in which members were elected by island councils. A member of Mauke Island Council, Tararo was elected as the island's representative, becoming the only women in the Legislative Council. She served until the following year, and again in 1951. Following its creation, she became a member of the House of Ariki. She also served on the General Assembly of the Cook Islands Christian Church and worked as an adviser on Maori customs, choreographer and costume designer.
In 1977 she was awarded the Queen Elizabeth II Silver Jubilee Medal and appointed Commissioner of the Cook Islands Judiciary. Construction work began on a palace for her in 1982, but was abandoned due to political disputes within the Tararo group.
References
1910 births
People from Mauke
Members of the Parliament of the Cook Islands
Members of the House of Ariki
Cook Island women in politics
1982 deaths
20th-century New Zealand women politicians
20th-century New Zealand politicians
Royalty of the Cook Islands |
```c++
/****************************************************************************
* MeshLab o o *
* A versatile mesh processing toolbox o o *
* _ O _ *
* Visual Computing Lab /\/| *
* ISTI - Italian National Research Council | *
* \ *
* All rights reserved. *
* *
* 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 *
* for more details. *
* *
****************************************************************************/
#include "edit_point_factory.h"
#include "edit_point.h"
PointEditFactory::PointEditFactory()
{
editPoint = new QAction(QIcon(":/images/select_vertex_geodesic.png"),"Select Vertex Clusters", this);
editPointFittingPlane = new QAction(QIcon(":/images/select_vertex_plane.png"),"Select Vertices on a Plane", this);
actionList.push_back(editPoint);
actionList.push_back(editPointFittingPlane);
foreach(QAction *editAction, actionList)
editAction->setCheckable(true);
}
QString PointEditFactory::pluginName() const
{
return "EditPoint";
}
//get the edit tool for the given action
EditTool* PointEditFactory::getEditTool(const QAction *action)
{
if(action == editPoint)
return new EditPointPlugin(EditPointPlugin::SELECT_DEFAULT_MODE);
else if (action == editPointFittingPlane)
return new EditPointPlugin(EditPointPlugin::SELECT_FITTING_PLANE_MODE);
assert(0); //should never be asked for an action that isn't here
return nullptr;
}
QString PointEditFactory::getEditToolDescription(const QAction *)
{
return EditPointPlugin::info();
}
MESHLAB_PLUGIN_NAME_EXPORTER(PointEditFactory)
``` |
The Canadian Stem Cell Foundation is an independent, non-profit organization established in 2008 and situated in Ottawa, Ontario. Stem Cell science is a Canadian innovation through the discovery of stem cells by Drs. James Till and Ernest McCulloch. It is globally known as the leading organization for stem cell research and support in the study of treatments and cures for diseases such as cancer, diabetes, blindness and stroke.
The Canadian Stem Cell Strategy
Their first strategy was created in 2013 to determine the concerns and actions required to develop an innovation that can advance stem cell research and clinics. The Canadian Stem Cell Foundation's goals are to invest a strategy for new treatments, sustainable healthcare, therapies and beneficial products. Their goals are beyond their capacity, such as "using cells to treat respiratory heart diseases, restore lost vision, create a source of insulin-producing cells to treat diabetes, repair damaged spinal cords, reverse the effect of MS, Crohn's disease and other autoimmune disorders, reduce the ravages of Parkinson's disease and reverse tumour formation in the brain, breast and other solid tissues." Their other goals are to bring together scientists, institutions, health charities, industry partners, regulators, funders and philanthropists in a universal vision in the developments of stem cell science research and have public and private sectors support in the funding for stem cell research in the long-term.
There are many organizations involved such as the Stem Cell Network, Health Charities Coalition of Canada, Ontario Stem Cell Initiative, Centre for Commercialization of Regenerative Medicine, Ontario Bioscience Innovation Organization, and Cell CAN Regenerative Medicine and Cell Therapy Network.
To follow updates regarding "The Canadian Stem Cell Strategy," visit the site: http://www.stemcellfoundation.ca/en/blog/categories/listings/strategy-updates
The Stem Cell Charter
The Stem Cell Charter is an appeal launched in September, regarding the support for stem cell research. It is an interactive document that seeks concern for humanity with reference to stem cell science. It was created and written by, Bartha Maria Knoppers of McGill University, with a team of stem cell scientists, patients, ethicists and laypeople. This document is accessible to many individuals around the world, it is not a document for scientists, government officials or physicians, but for all. The charter includes five principles such as, "responsible science, protection of citizens, intellectual freedom, transparency and integrity." The document's goal is to bring people together with the belief that stem cell science has the potential to conquer disease and advance medicine. Moreover, many significant scientists have endorsed the Charter, including Mick Bhatia, Tim Caulfield, John Dick, Connie Eaves, Norman Iscove, Gordon Keller, Derek van der Kooy, Freda Miller, Andras Nagy, Janer Rossant, Michael Rudnicki, Guy Sauvageau, Jim Till and Sam Weiss.
Over 3000 individuals have signed the charter, any individual can sign the charter by visiting the link: http://www.stemcellfoundation.ca/en/act/charter?view=default
References
Canadian Stem Cell Foundation(2013) Canadian Stem Cell Foundation http://www.stemcellfoundation.ca/en/
Biology education
Health charities in Canada
Organizations based in Ottawa
Stem cells
Organizations established in 2008
Medical and health organizations based in Ontario |
YapBrowser, also known as YapSearch or YapCash, is a rogue Web browser that was removed from the Internet after security researchers found it was serving up child porn advertising. It eventually reappeared [1], with a peculiar twist; it now came with the odd claim that users could expect protection from harmful exploits and viruses.
The site hosting the browser download originates from Russia and includes an "adult version" that lets users search for and browse pornography-themed content for free.
The site even offers a "100% guarantee" that no malicious system infection will occur when using the software, but security researchers tracking the seedier side of the Internet have flagged YapBrowser as a serious threat to computer users.
The first sign of YapBrowser trouble came in April 2006 when malware researchers discovered that the browser was serving up spyware and underage porn advertising.
McAfee flags YapBrowser as a "potentially unwanted program" that directs the user to use the yapsearch.com search portal.
It appears that YapBrowser is primarily a front-end for an Internet Explorer HTML rendering engine that uses commercial links to push users to other shopping search portals.
In June 2006 YapBrowser was acquired by Search engine MyAllSearch.com.
External links
YapBrowser Homepage
SearchWebMe Press Release
Yapbrowser: serves up Zango and...child porn?
Return of Porn-Fetching 'YapBrowser' Raises Eyebrows
YapBrowser- SpywareGuide
Users Warned After YapBrowser Returns From the Dead - PC World
References
https://www.theregister.co.uk/2011/10/10/yapbrowser_zombie_reanimates/
Spyware |
Nicetius, or Nicetas, was the Count of Clermont, Duke of Auvergne, and Governor of Provence in the late sixth century.
He sent gifts to Childebert II in order to secure a dukedom. He received, as constituting his duchy, the cities of Rodez, Clermont, and Uzès. According to Gregory of Tours, though he was young at the time, he was "a man of acute insight," who "established peace in the Auvergne."
In 585, he participated in a war against the Visigoths; Gregory strongly criticises his conduct in the war ("crime and deception"). Afterwards, he patrolled the border between Septimania (the Gothic province of Narbonensis) and his own Frankish territory, the so-called "Dukedom of Auvergne."
In 587, he was made governor of Provence (the diocesan province of Marseille) as well. In 588 Theodore, Bishop of Marseille, complained to the king that there had been a plague in Provence. Nicetius was replaced in the countship of Clermont by one Eulalius.
Sources
Gregory of Tours. The History of the Franks. 2 vol. trans. O. M. Dalton. Oxford: Clarendon Press, 1967.
Governors of Provence
Counts of Clermont
Dukes of Auvergne
6th-century Frankish nobility |
Racing Club de Roubaix was a French association football team that played in Roubaix, Nord.
History
The team was founded in 1895 and was very successful before the establishment of professionalism in France. In 1933, after losing twice in a row in the final of Coupe de France, this time against city rival Excelsior AC Roubaix (a professional team), the team turned professional and reached Division 1 in 1936 and stayed there till World War II. After the war, the club merged with Excelsior AC Roubaix and US Tourcoing in CO Roubaix-Tourcoing (1945β1963). In 1963, CO Roubaix-Tourcoing lost its professional status and RC Roubaix decided to merge with another club, Stade Roubaix, to create Racing Stade Roubaisien. This team would eventually merge with Roubaix Football (i.e. former Excelsior AC Roubaix) in Stade Club Olympique de Roubaix, a team which ended in 1995 due to financial problems.
Names of the club
1895β1944. Racing Club de Roubaix.
1944β1963. in CO Roubaix-Tourcoing.
1964β1990. Racing Stade Roubaisien.
1990β1995. Stade Club Olympique de Roubaix (SCOR).
Honours
Champion of France USFSA : 1902, 1903, 1904, 1906, 1908.
DH Nord champion : 1923, 1925, 1926, 1930.
Coupe de France : Runner-up 1932, 1933.
Managerial history
Charles Griffiths: 1935β?
Franz Platko: ?
See also
CO Roubaix-Tourcoing
Excelsior AC Roubaix
References
External links
History
Association football clubs established in 1895
Association football clubs disestablished in 1964
Defunct football clubs in France
1895 establishments in France
1964 disestablishments in France
RC Roubaix
Football clubs in Hauts-de-France
Ligue 1 clubs |
The Tabas () missile-system is an Iranian medium range road-mobile aerial defense system that was first revealed on 11 May 2014. It is believed to be another version of the Ra'ad air defense system along with Sevom Khordad. The name of the air defense system refers to Operation Eagle Claw which took place at Tabas and hence the name of the missile system.
Characteristics
The missile system resembles the Buk-M1 missile system due to its lets sophisticated radar system. The speed of its TELAR is estimated to be 65Β km/h, each vehicle can carry 3 missiles. It is also likely that the system can intercept ballistic missiles, cruise missiles, anti-radiation missiles, smart bombs and UAVs. Each Tabas battery consists of one TELAR and two TELs hence each battery carries 9 missiles. Each battalion consists of four batteries and hence can engage multiple targets simultaneously. Each battalion is also equipped with a Bashir S-band 3-D Phased array radar that extends its detection range up to 350Β km.
References
Surface-to-air missiles of Iran
21st-century surface-to-air missiles
Weapons and ammunition introduced in 2014
Guided missiles of Iran |
Anne Johnson is a British archaeologist and researcher.
Ann(e) Johnson may also refer to:
Anne Johnson Davis, author
Dame Anne Mandall Johnson, British epidemiologist
Anne-Marie Johnson, American actress
Ann Johnson (athlete), British sprinter
Ann Johnson (politician), American politician
Ann Johnson (dancer); see Savoy-style Lindy Hop
See also
Annie Johnson (disambiguation)
Anne Johnston (disambiguation)
Anna Johnson (disambiguation)
Anne Johnstone (disambiguation)
Johnson |
```yaml
#
# 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.
#
name: pg_attribute
columns:
attrelid:
caseSensitive: true
dataType: -5
generated: false
name: attrelid
primaryKey: false
unsigned: false
visible: true
attname:
caseSensitive: true
dataType: 12
generated: false
name: attname
primaryKey: false
unsigned: false
visible: true
atttypid:
caseSensitive: true
dataType: -5
generated: false
name: atttypid
primaryKey: false
unsigned: false
visible: true
attstattarget:
caseSensitive: true
dataType: 4
generated: false
name: attstattarget
primaryKey: false
unsigned: false
visible: true
attlen:
caseSensitive: true
dataType: 5
generated: false
name: attlen
primaryKey: false
unsigned: false
visible: true
attnum:
caseSensitive: true
dataType: 5
generated: false
name: attnum
primaryKey: false
unsigned: false
visible: true
attndims:
caseSensitive: true
dataType: 4
generated: false
name: attndims
primaryKey: false
unsigned: false
visible: true
attcacheoff:
caseSensitive: true
dataType: 4
generated: false
name: attcacheoff
primaryKey: false
unsigned: false
visible: true
atttypmod:
caseSensitive: true
dataType: 4
generated: false
name: atttypmod
primaryKey: false
unsigned: false
visible: true
attbyval:
caseSensitive: true
dataType: -7
generated: false
name: attbyval
primaryKey: false
unsigned: false
visible: true
attstorage:
caseSensitive: true
dataType: 1
generated: false
name: attstorage
primaryKey: false
unsigned: false
visible: true
attalign:
caseSensitive: true
dataType: 1
generated: false
name: attalign
primaryKey: false
unsigned: false
visible: true
attnotnull:
caseSensitive: true
dataType: -7
generated: false
name: attnotnull
primaryKey: false
unsigned: false
visible: true
atthasdef:
caseSensitive: true
dataType: -7
generated: false
name: atthasdef
primaryKey: false
unsigned: false
visible: true
attisdropped:
caseSensitive: true
dataType: -7
generated: false
name: attisdropped
primaryKey: false
unsigned: false
visible: true
attislocal:
caseSensitive: true
dataType: -7
generated: false
name: attislocal
primaryKey: false
unsigned: false
visible: true
attcmprmode:
caseSensitive: true
dataType: -6
generated: false
name: attcmprmode
primaryKey: false
unsigned: false
visible: true
attinhcount:
caseSensitive: true
dataType: 4
generated: false
name: attinhcount
primaryKey: false
unsigned: false
visible: true
attcollation:
caseSensitive: true
dataType: -5
generated: false
name: attcollation
primaryKey: false
unsigned: false
visible: true
attacl:
caseSensitive: true
dataType: 2003
generated: false
name: attacl
primaryKey: false
unsigned: false
visible: true
attoptions:
caseSensitive: true
dataType: 2003
generated: false
name: attoptions
primaryKey: false
unsigned: false
visible: true
attfdwoptions:
caseSensitive: true
dataType: 2003
generated: false
name: attfdwoptions
primaryKey: false
unsigned: false
visible: true
attinitdefval:
caseSensitive: true
dataType: -2
generated: false
name: attinitdefval
primaryKey: false
unsigned: false
visible: true
attkvtype:
caseSensitive: true
dataType: -6
generated: false
name: attkvtype
primaryKey: false
unsigned: false
visible: true
indexes:
pg_attribute_relid_attnam_index:
name: pg_attribute_relid_attnam_index
pg_attribute_relid_attnum_index:
name: pg_attribute_relid_attnum_index
``` |
Polio vaccines are vaccines used to prevent poliomyelitis (polio). Two types are used: an inactivated poliovirus given by injection (IPV) and a weakened poliovirus given by mouth (OPV). The World Health Organization (WHO) recommends all children be fully vaccinated against polio. The two vaccines have eliminated polio from most of the world, and reduced the number of cases reported each year from an estimated 350,000 in 1988 to 33 in 2018.
The inactivated polio vaccines are very safe. Mild redness or pain may occur at the site of injection. Oral polio vaccines cause about three cases of vaccine-associated paralytic poliomyelitis per million doses given. This compares with 5,000 cases per million who are paralysed following a polio infection. Both types of vaccine are generally safe to give during pregnancy and in those who have HIV/AIDS but are otherwise well. However, the emergence of circulating vaccine-derived poliovirus (cVDPV), a form of the vaccine virus that has reverted to causing poliomyelitis, has led to the development of novel oral polio vaccine type 2 (nOPV2) which aims to make the vaccine safer and thus stop further outbreaks of cVDPV2.
The first successful demonstration of a polio vaccine was by Hilary Koprowski in 1950, with a live attenuated virus which people drank. The vaccine was not approved for use in the United States, but was used successfully elsewhere. The success of an inactivated (killed) polio vaccine, developed by Jonas Salk, was announced in 1955. Another attenuated live oral polio vaccine was developed by Albert Sabin and came into commercial use in 1961.
Polio vaccine is on the World Health Organization's List of Essential Medicines.
Medical uses
Interruption of person-to-person transmission of the virus by vaccination is important in global polio eradication, since no long-term carrier state exists for poliovirus in individuals with normal immune function, polio viruses have no non-primate reservoir in nature, and survival of the virus in the environment for an extended period of time appears to be remote. There are two types of vaccine: inactivated polio vaccine (IPV) and oral polio vaccine (OPV).
Inactivated
When the IPV (injection) is used, 90% or more of individuals develop protective antibodies to all three serotypes of polio virus after two doses of inactivated polio vaccine (IPV), and at least 99% are immune to polio virus following three doses. The duration of immunity induced by IPV is not known with certainty, although a complete series is thought to provide protection for many years. IPV replaced the oral vaccine in many developed countries in the 1990s mainly due to the (small) risk of vaccine-derived polio in the oral vaccine.
Attenuated
Oral polio vaccines were easier to administer than IPV, as it eliminated the need for sterile syringes and therefore was more suitable for mass vaccination campaigns. OPV also provided longer-lasting immunity than the Salk vaccine, as it provides both humoral immunity and cell-mediated immunity.
One dose of OPV produces immunity to all three poliovirus serotypes in roughly 50% of recipients. Three doses of live-attenuated OPV produce protective antibodies to all three poliovirus types in more than 95% of recipients. OPV produces excellent immunity in the intestine, the primary site of wild poliovirus entry, which helps prevent infection with wild virus in areas where the virus is endemic. The live virus used in the vaccine can rarely shed in the stool and can rarely spread to others within a community. The live virus also has stringent requirements for transport and storage, which are a problem in some hot or remote areas. As with other live-virus vaccines, immunity initiated by OPV is probably lifelong.
The trivalent (against wild types 1, 2, and 3) OPV has been used to nearly eradicate polio infection worldwide. Led by the Global Polio Eradication Initiative, 155 countries switched to use the bivalent (against wild types 1 and 3) between 17 April and 1 May 2016. The bivalent OPV is more effective against types 1 and 3, but does not cover type 2. The United States as of 2017 continues to recommend the use of a trivalent version, but a fully inactivated version. The switch to the bivalent vaccine and associated missing immunity against type 2 strains, among other factors, led to outbreaks of circulating vaccine-derived poliovirus type 2(cVDPV2), which increased from 2 cases in 2016 to 1037 cases in 2020. As a response, a novel oral polio vaccine type 2 (nOPV2) was developed with the aim to provide a safer form of vaccination against type 2 strains with less risk of reverting to infectious polio.
Schedule
In countries with endemic polio or where the risk of imported cases is high, the WHO recommends OPV vaccine at birth followed by a primary series of three OPV doses and at least one IPV dose starting at 6 weeks of age, with a minimum of 4 weeks between OPV doses. In countries with >90% immunization coverage and low risk of importation, the WHO recommends one or two IPV doses starting at 2 months of age followed by at least two OPV doses, with the doses separated by 4β8 weeks depending on the risk of exposure. In countries with the highest levels of coverage and the lowest risks of importation and transmission, the WHO recommends a primary series of three IPV injections, with a booster dose after an interval of six months or more if the first dose was administered before 2 months of age.
Side effects
The inactivated polio vaccines are very safe. Mild redness or pain may occur at the site of injection. Oral polio vaccine results in vaccine-associated paralytic poliomyelitis in about three per million doses. They are generally safe to give to those who are pregnant, and those who have HIV/AIDS, but who are otherwise well.
Allergic reaction to the vaccine
Inactivated polio vaccine can cause an allergic reaction in a few people since the vaccine contains trace amounts of antibiotics, streptomycin, polymyxin B, and neomycin. It should not be given to anyone who has an allergic reaction to these medicines. Signs and symptoms of an allergic reaction, which usually appear within minutes or a few hours after receiving the injected vaccine, include breathing difficulties, weakness, hoarseness or wheezing, heart rate fluctuations, skin rash and dizziness.
Vaccine-induced polio
A potential, adverse effect of the OPV is its known ability to recombine to a form that causes neurological infection and paralysis. This genetic reversal of the pathogen to a virulent form takes a considerable time (at least 12 months) and does not affect the person who was originally vaccinated. The vaccine-derived attenuated virus is normally excreted from vaccinated people for a limited period. Thus, in areas with poor sanitation and low vaccination coverage, the spontaneous reversal of the vaccine-derived virus to a virulent form and its spreading in the environment can lead to unvaccinated people becoming infected. Clinical disease, including paralysis, caused by vaccine-derived poliovirus (VDPV) is indistinguishable from that caused by wild polioviruses. Outbreaks of vaccine-associated paralytic poliomyelitis (VAPP), caused by a circulating vaccine-derived poliovirus (cVDPV), have been reported, and tend to occur in areas of low coverage by OPV, presumably because the OPV is itself protective against the related outbreak strain. With wild polio cases at record lows, 2017 was the first year where more cases of cVDPV were recorded than the wild poliovirus, a trend that is expected to continue.
To combat this, the WHO in 2016, decided to switch from the trivalent polio vaccine to the bivalent polio vaccine. This vaccine no longer contains the type 2 polio virus because it was eradicated in 1999.
Contamination concerns
In 1960, the rhesus monkey kidney cells used to prepare the poliovirus vaccines were determined to be infected with the simian virus-40 (SV40), which was also discovered in 1960 and is a naturally occurring virus that infects monkeys. In 1961, SV40 was found to cause tumors in rodents. More recently, the virus was found in certain forms of cancer in humans, for instance brain and bone tumors, pleural and peritoneal mesothelioma, and some types of non-Hodgkin lymphoma. However, SV40 has not been determined to cause these cancers.
SV40 was found to be present in stocks of the injected form of the IPV in use between 1955 and 1963. It is not found in the OPV form. Over 98 million Americans received one or more doses of polio vaccine between 1955 and 1963 when a proportion of vaccine was contaminated with SV40; an estimated 10β30 million Americans may have received a dose of vaccine contaminated with SV40. Later analysis suggested that vaccines produced by the former Soviet bloc countries until 1980, and used in the USSR, China, Japan, and several African countries, may have been contaminated, meaning hundreds of millions more may have been exposed to SV40.
In 1998, the National Cancer Institute undertook a large study, using cancer case information from the institute's SEER database. The published findings from the study revealed no increased incidence of cancer in persons who may have received vaccine containing SV40. Another large study in Sweden examined cancer rates of 700,000 individuals who had received potentially contaminated polio vaccine as late as 1957; the study again revealed no increased cancer incidence between persons who received polio vaccines containing SV40 and those who did not. The question of whether SV40 causes cancer in humans remains controversial, however, and the development of improved assays for detection of SV40 in human tissues will be needed to resolve the controversy.
During the race to develop an oral polio vaccine, several large-scale human trials were undertaken. By 1958, the National Institutes of Health had determined that OPV produced using the Sabin strains were the safest. Between 1957 and 1960, however, Hilary Koprowski continued to administer his vaccine around the world. In Africa, the vaccines were administered to roughly one million people in the Belgian territories (now the Democratic Republic of the Congo, Rwanda, and Burundi). The results of these human trials have been controversial, and unfounded accusations in the 1990s arose that the vaccine had created the conditions necessary for transmission of simian immunodeficiency virus from chimpanzees to humans, causing HIV/AIDS. These hypotheses, however, have been conclusively refuted. By 2004, cases of poliomyelitis in Africa had been reduced to just a small number of isolated regions in the western portion of the continent, with sporadic cases elsewhere. Recent local opposition to vaccination campaigns have evolved due to lack of adequate information, often relating to fears that the vaccine might induce sterility. The disease has since resurged in Nigeria and in several other African nations without necessary information, which epidemiologists believe is due to refusals by certain local populations to allow their children to receive the polio vaccine.
Manufacture
Inactivated
The Salk vaccine, IPV, is based on three wild, virulent reference strains, Mahoney (type 1 poliovirus), MEF-1 (type 2 poliovirus), and Saukett (type 3 poliovirus), grown in a type of monkey kidney tissue culture (Vero cell line), which are then inactivated with formalin. The injected Salk vaccine confers IgG-mediated immunity in the bloodstream, which prevents polio infection from progressing to viremia and protects the motor neurons, thus eliminating the risk of bulbar polio and post-polio syndrome.
In the United States, vaccine is administered along with the tetanus, diphtheria, and acellular pertussis vaccines (DTaP) and a pediatric dose of hepatitis B vaccine. In the UK, IPV is combined with tetanus, diphtheria, pertussis, and Haemophilus influenzae type b vaccines.
Attenuated
OPV is an attenuated vaccine, produced by the passage of the virus through nonhuman cells at a subphysiological temperature, which produces spontaneous mutations in the viral genome. Oral polio vaccines were developed by several groups, one of which was led by Albert Sabin. Other groups, led by Hilary Koprowski and H.R. Cox, developed their own attenuated vaccine strains. In 1958, the National Institutes of Health created a special committee on live polio vaccines. The various vaccines were carefully evaluated for their ability to induce immunity to polio, while retaining a low incidence of neuropathogenicity in monkeys. Large-scale clinical trials performed in the Soviet Union in late 1950s to early 1960s by Mikhail Chumakov and his colleagues demonstrated safety and high efficacy of the vaccine. Based on these results, the Sabin strains were chosen for worldwide distribution. Fifty-seven nucleotide substitutions distinguish the attenuated Sabin 1 strain from its virulent parent (the Mahoney serotype), two nucleotide substitutions attenuate the Sabin 2 strain, and 10 substitutions are involved in attenuating the Sabin 3 strain. The primary attenuating factor common to all three Sabin vaccines is a mutation located in the virus's internal ribosome entry site, which alters stem-loop structures and reduces the ability of poliovirus to translate its RNA template within the host cell. The attenuated poliovirus in the Sabin vaccine replicates very efficiently in the gut, the primary site of infection and replication, but is unable to replicate efficiently within nervous system tissue. In 1961, type 1 and 2 monovalent oral poliovirus vaccine (MOPV) was licensed, and in 1962, type 3 MOPV was licensed. In 1963, trivalent OPV (TOPV) was licensed, and became the vaccine of choice in the United States and most other countries of the world, largely replacing the inactivated polio vaccine. A second wave of mass immunizations led to a further dramatic decline in the number of polio cases. Between 1962 and 1965, about 100 million Americans (roughly 56% of the population at that time) received the Sabin vaccine. The result was a substantial reduction in the number of poliomyelitis cases, even from the much-reduced levels following the introduction of the Salk vaccine.
OPV is usually provided in vials containing 10β20 doses of vaccine. A single dose of oral polio vaccine (usually two drops) contains 1,000,000 infectious units of Sabin 1 (effective against PV1), 100,000 infectious units of the Sabin 2 strain, and 600,000 infectious units of Sabin 3. The vaccine contains small traces of antibioticsβneomycin and streptomycinβbut does not contain preservatives.
History
In a generic sense, vaccination works by priming the immune system with an 'immunogen'. Stimulating immune response, by use of an infectious agent, is known as immunization. The development of immunity to polio efficiently blocks person-to-person transmission of wild poliovirus, thereby protecting both individual vaccine recipients and the wider community.
The development of two polio vaccines led to the first modern mass inoculations. The last cases of paralytic poliomyelitis caused by endemic transmission of wild virus in the United States occurred in 1979, with an outbreak among the Amish in several Midwest states.
1930s
In the 1930s, poliovirus was perceived as especially terrifying, as little was known of how the disease was transmitted or how it could be prevented. This virus was also notable for primarily impacting affluent children, making it a prime target for vaccine development, despite its relatively low mortality and morbidity. Despite this, the community of researchers in the field thus far had largely observed an informal moratorium on any vaccine development as it was perceived to present too high a risk for too little likelihood of success.
This shifted in the early 1930s when American groups took up the challenge: Maurice Brodie led a team from the public health laboratory of the city of New York and John A. Kolmer collaborated with the Research Institute of Cutaneous Medicine in Philadelphia. The rivalry between these two researchers lent itself to a race-like mentality which, combined with a lack of oversight of medical studies, was reflected in the methodology and outcomes of each of these early vaccine development ventures.
Kolmer's live vaccine
Kolmer began his vaccine development project in 1932 and ultimately focused on producing an attenuated or live virus vaccine. Inspired by the success of vaccines for rabies and yellow fever, he hoped to use a similar process to denature the polio virus. In order to go about attenuating his polio vaccine, he repeatedly passed the virus through monkeys. Using methods of production that were later described as "hair-raisingly amateurish, the therapeutic equivalent of bath-tub gin," Kolmer ground the spinal cords of his infected monkeys and soaked them in a salt solution. He then filtered the solution through mesh, treated it with ricinolate, and refrigerated the product for 14 days to ultimately create what would later be prominently critiqued as a "veritable witches brew".
In keeping with the norms of the time, Kolmer completed a relatively small animal trial with 42 monkeys before proceeding to self experimentation in 1934. He tested his vaccine upon himself, his two children, and his assistant. He gave his vaccine to just 23 more children before declaring it safe and sending it out to doctors and health departments for a larger test of efficacy. By April 1935, he was able to report having tested the vaccine on 100 children without ill effect. Kolmer's first formal presentation of results would not come about until November 1935 where he presented the results of 446 children and adults he had vaccinated with his attenuated vaccine. He also reported that together the Research Institute of Cutaneous Medicine and the Merrell Company of Cincinnati (the manufacturer who held the patent for his ricinoleating process) had distributed 12,000 doses of vaccine to some 700 physicians across the United States and Canada. Kolmer did not describe any monitoring of this experimental vaccination program nor did he provide these physicians with instructions in how to administer the vaccine or how to report side effects. Kolmer dedicated the bulk of his publications thereafter to explaining what he believed to be the cause of the 10+ reported cases of paralytic polio following vaccination, in many cases in towns where no polio outbreak had occurred. Six of these cases had been fatal. Kolmer had no control group but asserted that many more children would have gotten sick.
Brodie's inactivated vaccine
At nearly the same time as Kolmer's project, Maurice Brodie had joined immunologist William H. Park at the New York City Health Department where they worked together on poliovirus. With the aid of grant funding from the President's Birthday Ball Commission (a predecessor to what would become the March of Dimes), Brodie was able to pursue development of an inactivated or "killed virus" vaccine. Brodie's process also began by grinding the spinal cords of infectious monkeys and then treating the cords with various germicides, ultimately finding a solution of formaldehyde to be the most effective. By 1 June 1934, Brodie was able to publish his first scholarly article describing his successful induction of immunity in three monkeys with inactivated polio virus. Through continued study on an additional 26 monkeys, Brodie ultimately concluded that administration of live virus vaccine tended to result in humoral immunity while administration of killed virus vaccine tended to result in tissue immunity.
Soon after, following a similar protocol to Kolmer, Brodie proceeded with self experimentation upon himself and his co-workers at the NYC Health Department laboratory. Brodie's progress was eagerly covered by popular press as the public hoped for a successful vaccine to become available. Such reporting did not make mention of the 12 children in a New York City Asylum who were subjected to early safety trials. As none of the subjects experienced ill effects, Park, described by contemporaries as "never one to let grass grow under his feet," declared the vaccine safe. When a severe polio outbreak overwhelmed Kern County, California it became the first trial site for the new vaccine on very short notice. Between November 1934 - May 1935, over 1,500 doses of the vaccine were administered in Kern County. While initial results were very promising, insufficient staffing and poor protocol design left Brodie open to criticism when he published the California results in August 1935. Through private physicians, Brodie also conducted a broader field study, including 9,000 children who received the vaccine and 4,500 age- and location-matched controls who did not receive a vaccine. Again, results were promising. Of those who received the vaccine, only a few went on to develop polio. Most had been exposed prior to vaccination and none had received the full series of vaccine doses being studied. Additionally, a polio epidemic in Raleigh, North Carolina provided an opportunity for the U.S. Public Health Service to conduct a highly structured trial of the Brodie vaccine using funding from the Birthday Ball Commission.
Academic reception
While their work was ongoing, the larger community of bacteriologists began to raise concerns regarding the safety and efficacy of the new poliovirus vaccines. At this time there was very little oversight of medical studies, and ethical treatment of study participants largely relied upon moral pressure from peer academic scientists. Brodie's inactivated vaccines faced scrutiny from many who felt killed virus vaccines could not be efficacious. While researchers were able to replicate the tissue immunity he had produced in his animal trials, prevailing wisdom was that humoral immunity was essential for an efficacious vaccine. Kolmer directly questioned the killed virus approach in scholarly journals. Kolmer's studies however had raised even more concern with increasing reports of children becoming paralysed following vaccination with his live virus vaccine and notably, with paralysis beginning at the arm rather than the foot in many cases. Both Kolmer and Brodie were called to present their research at the Annual Meeting of the American Public Health Association in Milwaukee WI in October 1935. Additionally, Thomas M. Rivers was asked to discuss each of the presented papers as a prominent critic of the vaccine development effort. This resulted in the APHA arranging a Symposium on Poliomyelitis to be delivered at the Annual Meeting of their Southern Branch the following month. It was during the discussion at this meeting that James Leake of the U.S. Public Health Service stood to immediately present clinical evidence that the Kolmer vaccine had caused several deaths and then allegedly accused Kolmer of being a murderer. As Rivers recalled in his oral history, "All hell broke loose, and it seemed as if everybody was trying to talk at the same time....Jimmy Leake used the strongest language that I have ever heard used at a scientific meeting." In response to the attacks from all sides, Brodie was reported to have stood up and stated, "It looks as though, according to Dr. Rivers, my vaccine is no good, and, according to Dr. Leake, Dr Kolmer's is dangerous." Kolmer simply responded by stating, "Gentlemen, this is one time I wish the floor would open up and swallow me." Ultimately, Kolmer's live vaccine was undoubtedly shown to be dangerous and had already been withdrawn in September 1935 prior to the Milwaukee meeting. While the consensus of the symposium was largely skeptical of the efficacy of Brodie's vaccine, its safety was not in question and the recommendation was for a much larger well-controlled trial. However, when three children became ill with paralytic polio following a dose of the vaccine, the directors of the Warm Springs Foundation in Georgia (acting as the primary funders for the project) requested it be withdrawn in December 1935. Following its withdrawal, the previously observed moratorium on human poliomyelitis vaccine development resumed and there would not be another attempt for nearly 20 years.
While Brodie had arguably made the most progress in the pursuit of a poliovirus vaccine, he suffered the most significant career repercussions due to his status as a less widely known researcher. Modern researchers recognize that Brodie may well have developed an effective polio vaccine, however the basic science and technology of the time was insufficient to understand and utilize this breakthrough. Brodie's work using formalin-inactivated virus would later become the basis for the Salk vaccine, but he would not live to see this success. Brodie was fired from his position within three months of the symposium's publication. While he was able to find another laboratory position, he died of a heart attack only three years later at age 36. By contrast, Park, who was believed in the community to be reaching senility at this point in his older age, was able to retire from his position with honors prior to his death in 1939. Kolmer, already an established and well respected researcher, returned to Temple University as a professor of medicine. Kolmer had a very productive career, receiving multiple awards, and publishing countless papers, articles, and textbooks up until his retirement in 1957.
1948
A breakthrough came in 1948 when a research group headed by John Enders at the Children's Hospital Boston successfully cultivated the poliovirus in human tissue in the laboratory. This group had recently successfully grown mumps in cell culture. In March 1948, Thomas H. Weller was attempting to grow varicella virus in embryonic lung tissue. He had inoculated the planned number of tubes when he noticed that there were a few unused tubes. He retrieved a sample of mouse brain infected with poliovirus and added it to the remaining test tubes, on the off chance that the virus might grow. The varicella cultures failed to grow, but the polio cultures were successful. This development greatly facilitated vaccine research and ultimately allowed for the development of vaccines against polio. Enders and his colleagues, Thomas H. Weller and Frederick C. Robbins, were recognized in 1954 for their efforts with a Nobel Prize in Physiology or Medicine. Other important advances that led to the development of polio vaccines were: the identification of three poliovirus serotypes (Poliovirus type 1 β PV1, or Mahoney; PV2, Lansing; and PV3, Leon); the finding that prior to paralysis, the virus must be present in the blood; and the demonstration that administration of antibodies in the form of gamma globulin protects against paralytic polio.
1950β1955
During the early 1950s, polio rates in the U.S. were above 25,000 annually; in 1952 and 1953, the U.S. experienced an outbreak of 58,000 and 35,000 polio cases, respectively, up from a typical number of some 20,000 a year, with deaths in those years numbering 3,200 and 1,400. Amid this U.S. polio epidemic, millions of dollars were invested in finding and marketing a polio vaccine by commercial interests, including Lederle Laboratories in New York under the direction of H. R. Cox. Also working at Lederle was Polish-born virologist and immunologist Hilary Koprowski of the Wistar Institute in Philadelphia, who tested the first successful polio vaccine, in 1950. His vaccine, however, being a live attenuated virus taken orally, was still in the research stage and would not be ready for use until five years after Jonas Salk's polio vaccine (a dead-virus injectable vaccine) had reached the market. Koprowski's attenuated vaccine was prepared by successive passages through the brains of Swiss albino mice. By the seventh passage, the vaccine strains could no longer infect nervous tissue or cause paralysis. After one to three further passages on rats, the vaccine was deemed safe for human use. On 27 February 1950, Koprowski's live, attenuated vaccine was tested for the first time on an 8-year-old boy living at Letchworth Village, an institution for physically and mentally disabled people located in New York. After the child had no side effects, Koprowski enlarged his experiment to include 19 other children.
Jonas Salk
The first effective polio vaccine was developed in 1952 by Jonas Salk and a team at the University of Pittsburgh that included Julius Youngner, Byron Bennett, L. James Lewis, and Lorraine Friedman, which required years of subsequent testing. Salk went on CBS radio to report a successful test on a small group of adults and children on 26 March 1953; two days later, the results were published in JAMA. Leone N. Farrell invented a key laboratory technique that enabled the mass production of the vaccine by a team she led in Toronto. Beginning 23 February 1954, the vaccine was tested at Arsenal Elementary School and the Watson Home for Children in Pittsburgh, Pennsylvania.
Salk's vaccine was then used in a test called the Francis Field Trial, led by Thomas Francis, the largest medical experiment in history at that time. The test began with about 4,000 children at Franklin Sherman Elementary School in McLean, Virginia, and eventually involved 1.8 million children, in 44 states from Maine to California. By the conclusion of the study, roughly 440,000 received one or more injections of the vaccine, about 210,000 children received a placebo, consisting of harmless culture media, and 1.2 million children received no vaccination and served as a control group, who would then be observed to see if any contracted polio.
The results of the field trial were announced 12 April 1955 (the tenth anniversary of the death of President Franklin D. Roosevelt, whose paralytic illness was generally believed to have been caused by polio). The Salk vaccine had been 60β70% effective against PV1 (poliovirus type 1), over 90% effective against PV2 and PV3, and 94% effective against the development of bulbar polio. Soon after Salk's vaccine was licensed in 1955, children's vaccination campaigns were launched. In the U.S., following a mass immunization campaign promoted by the March of Dimes, the annual number of polio cases fell from 35,000 in 1953 to 5,600 by 1957. By 1961 only 161 cases were recorded in the United States.
A week before the announcement of the Francis Field Trial results in April 1955, Pierre LΓ©pine at the Pasteur Institute in Paris had also announced an effective polio vaccine.
Safety incidents
In April 1955, soon after mass polio vaccination began in the US, the Surgeon General began to receive reports of patients who contracted paralytic polio about a week after being vaccinated with Salk polio vaccine from the Cutter pharmaceutical company, with the paralysis starting in the limb the vaccine was injected into. The Cutter vaccine had been used in vaccinating 409,000 children in the western and midwestern United States.
Later investigations showed that the Cutter vaccine had caused 260 cases of polio, killing 11.
In response, the Surgeon General pulled all polio vaccines made by Cutter Laboratories from the market, but not before 260 cases of paralytic illness had occurred. Eli Lilly, Parke-Davis, Pitman-Moore and Wyeth polio vaccines were also reported to have paralyzed numerous children. It was soon discovered that some lots of Salk polio vaccine made by Cutter, Wyeth, and the other labs had not been properly inactivated, allowing live poliovirus into more than 100,000 doses of vaccine. In May 1955, the National Institutes of Health and Public Health Services established a Technical Committee on Poliomyelitis Vaccine to test and review all polio vaccine lots and advise the Public Health Service as to which lots should be released for public use. These incidents reduced public confidence in polio vaccine, leading to a drop in vaccination rates.
1961
At the same time that Salk was testing his vaccine, both Albert Sabin and Hilary Koprowski continued working on developing a vaccine using live virus. During a meeting in Stockholm to discuss polio vaccines in November 1955, Sabin presented results obtained on a group of 80 volunteers, while Koprowski read a paper detailing the findings of a trial enrolling 150 people. Sabin and Koprowski both eventually succeeded in developing vaccines. Because of the commitment to the Salk vaccine in America, Sabin and Koprowski both did their testing outside the United States, Sabin in Mexico and the Soviet Union, Koprowski in the Congo and Poland. In 1957, Sabin developed a trivalent vaccine containing attenuated strains of all three types of poliovirus. In 1959, ten million children in the Soviet Union received the Sabin oral vaccine. For this work, Sabin was given the medal of the Order of Friendship of Peoples, described as the Soviet Union's highest civilian honor. Sabin's oral vaccine using live virus came into commercial use in 1961.
Once Sabin's oral vaccine became widely available, it supplanted Salk's injected vaccine, which had been tarnished in the public's opinion by the Cutter incident of 1955, in which Salk vaccines improperly prepared by one company resulted in several children dying or becoming paralyzed.
1987
An enhanced-potency IPV was licensed in the United States in November 1987, and is currently the vaccine of choice there. The first dose of polio vaccine is given shortly after birth, usually between 1 and 2 months of age, and a second dose is given at 4 months of age. The timing of the third dose depends on the vaccine formulation, but should be given between 6 and 18 months of age. A booster vaccination is given at 4 to 6 years of age, for a total of four doses at or before school entry. In some countries, a fifth vaccination is given during adolescence. Routine vaccination of adults (18 years of age and older) in developed countries is neither necessary nor recommended because most adults are already immune and have a very small risk of exposure to wild poliovirus in their home countries. In 2002, a pentavalent (five-component) combination vaccine (called Pediarix) containing IPV was approved for use in the United States.
1988
A global effort to eradicate polio, led by the World Health Organization (WHO), UNICEF, and the Rotary Foundation, began in 1988, and has relied largely on the oral polio vaccine developed by Albert Sabin and Mikhail Chumakov (Sabin-Chumakov vaccine).
After 1990
Polio was eliminated in the Americas by 1994. The disease was officially eliminated in 36 Western Pacific countries, including China and Australia, in 2000. Europe was declared polio-free in 2002. Since January 2011, no cases of the disease have been reported in India, hence in February 2012, the country was taken off the WHO list of polio-endemic countries. In March 2014, India was declared a polio-free country.
Although poliovirus transmission has been interrupted in much of the world, transmission of wild poliovirus does continue and creates an ongoing risk for the importation of wild poliovirus into previously polio-free regions. If importations of poliovirus occur, outbreaks of poliomyelitis may develop, especially in areas with low vaccination coverage and poor sanitation. As a result, high levels of vaccination coverage must be maintained. In November 2013, the WHO announced a polio outbreak in Syria. In response, the Armenian government put out a notice asking Syrian Armenians under age 15 to get the polio vaccine. As of 2014, polio virus had spread to 10 countries, mainly in Africa, Asia, and the Middle East, with Pakistan, Syria, and Cameroon advising vaccinations to outbound travellers.
Polio vaccination programs have been resisted by some people in Pakistan, Afghanistan, and Nigeria - the three countries as of 2017 with remaining polio cases. Almost all Muslim religious and political leaders have endorsed the vaccine, but a fringe minority believes that the vaccines are secretly being used for sterilization of Muslims. The fact that the CIA organized a fake vaccination program in 2011 to help find Osama bin Laden is an additional cause of distrust. In 2015, the WHO announced a deal with the Taliban to encourage them to distribute the vaccine in areas they control. However, the Pakistani Taliban was not supportive. On 11 September 2016, two unidentified gunmen associated with the Pakistani Taliban, Jamaat-ul-Ahrar, shot Zakaullah Khan, a doctor who was administering polio vaccines in Pakistan. The leader of the Jamaat-ul-Ahrar claimed responsibility for the shooting and stated that the group would continue this type of attack. Such resistance to and skepticism of vaccinations has consequently slowed down the polio eradication process within the two remaining endemic countries.
Travel requirements
Travellers who wish to enter or leave certain countries must be vaccinated against polio, usually at most 12 months and at least 4 weeks before crossing the border, and be able to present a vaccination record/certificate at the border checks. Most requirements apply only to travel to or from so-called 'polio-endemic', 'polio-affected', 'polio-exporting', 'polio-transmission', or 'high-risk' countries. As of August 2020, Afghanistan and Pakistan are the only polio-endemic countries in the world (where wild polio has not yet been eradicated). Several countries have additional precautionary polio vaccination travel requirements, for example to and from 'key at-risk countries', which as of December 2020 include China, Indonesia, Mozambique, Myanmar, and Papua New Guinea.
Society and culture
Cost
, the Global Alliance for Vaccines and Immunization supplies the inactivated vaccine to developing countries for as little as (about ) per dose in 10-dose vials.
Misconceptions
A misconception has been present in Pakistan that polio vaccine contained haram ingredients and could cause impotence and infertility in male children, leading some parents not to have their children vaccinated. This belief is most common in the Khyber Pakhtunkhwa province and the FATA region. Attacks on polio vaccination teams have also occurred, thereby hampering international efforts to eradicate polio in Pakistan and globally.
References
Further reading
External links
History of Vaccines Website β History of Polio History of Vaccines, a project of the College of Physicians of Philadelphia
PBS.org β 'People and Discoveries: Salk Produces Polio Vaccine 1952', Public Broadcasting Service (PBS)
Polio
1952 in biology
1955 introductions
American inventions
Inactivated vaccines
Live vaccines
Vaccines
World Health Organization essential medicines (vaccines)
Wikipedia medicine articles ready to translate |
James Waldegrave may refer to:
James Waldegrave, 1st Earl Waldegrave, British diplomat
James Waldegrave, 2nd Earl Waldegrave, British politician
James Waldegrave, 13th Earl Waldegrave, British peer and businessman |
K League (Hangul: K리그) is South Korea's professional football league. It includes the first division K League 1 and the second division K League 2.
History
Until the 1970s, South Korean football operated two major football leagues, the National Semi-professional Football League and the National University Football League, but these were not professional leagues in which footballers could focus on only football. In 1979, however, the Korea Football Association (KFA)'s president Choi Soon-young planned to found a professional football league, and made South Korea's first professional football club Hallelujah FC the next year. After the South Korean professional baseball league KBO League was founded in 1982, the KFA was aware of crisis about the popularity of football. In 1983, it urgently made the Korean Super League with two professional clubs (Hallelujah FC, Yukong Elephants) and three semi-professional clubs (POSCO Dolphins, Daewoo Royals, Kookmin Bank) to professionalize South Korean football. Then, the Super League accomplished its purpose after existing clubs were also converted into professional clubs (POSCO Atoms, Daewoo Royals) and new professional clubs joined the league. In the early years, it also showed a promotion system by giving qualifications to the Semi-professional League winners. (Hanil Bank in 1984, Sangmu FC in 1985)
However, the number of spectators was consistently decreased despite KFA's effort, and so the professional league, renamed as the Korean Professional Football League, operated home and away system to interest fans since 1987. On 30 July 1994, the Professional League Committee under KFA was independent of the association, and renamed as the "Korean Professional Football Federation". In 1996, South Korean government and the Football Federation introduced a decentralization policy to proliferate the popularity of football nationally in preparation for the 2002 FIFA World Cup, which they wanted to host. Several clubs located in the capital Seoul moved to other cities according to the new policy, but this was abolished after only three years and is regarded as a failed policy because it gave up the most populous city in South Korea. In 1998, the league was renamed again as current K League.
It had the current format by abolishing the K League Championship and the Korean League Cup after the 2011 season, and being split into two divisions in 2013. The first division's name was the K League Classic, and the second division's name was the K League Challenge at the time. The fact that both the first and the second divisions had very similar names caused some degree of confusion and controversy. Beginning with the 2018 season, both divisions were renamed the K League 1 and the K League 2 respectively.
On February 23, 2021, an OTT platform named "K League TV" officially began its service: born from a partnership between K League and their official relay operator abroad, Sportradar, the platform would guarantee access to users from almost the whole world (except for Korea), broadcast K League 1 and K League 2 matches in real time and host game highlights and interviews. K League TV also represented the first official portal to publish content about both the championships in English.
Structure
Below the K League 1, there is the K League 2, and both form the K League as professional championships. Under them, there are two semi-professional leagues (K3 League, K4 League) and several amateur leagues, but their clubs cannot be promoted to K League.
However, since 2021 K League 1 and K League 2 teams have been allowed to create reserve teams set to play in the K4 League.
Promotion and Relegation between K League 2 and third tier K3 League starting from 2023 season after nine seasons did not feature promotion and relegation.
Clubs
Current clubs
K League 1
K League 2
All-time clubs
As of 2023, there have been a total of 36 member clubs in the history of the K LeagueΒ β those clubs are listed below with their current names (where applicable):
K League's principle of official statistics is that final club succeeds to predecessor club's history and records.
Clubs in italics no longer exist.
Champions
Promotion-relegation playoffs
The K League promotion-relegation playoffs were introduced in 2013 and are contested between the eleventh-placed team of the K League 1 and the runners-up of the K League 2. The first leg is always played at the second division team's home ground, while the second leg is played at the first division team's home ground.
Records and statistics
K League officially includes records of K League 1, K League 2 and Korean League Cup in its statistics.
Restriction of foreign players
At the inception of the K League in 1983, only two Brazilian players made rosters. At the time, rules allowed each club to have three foreign players and that the three could also play simultaneously in a game. From the 1996 season, each team had five foreign players among whom three could play in a game at the same time. Since 1999, foreign goalkeepers are banned from the league because South Korean clubs excessively employed foreign goalkeepers after watching Valeri Sarychev's performances at that time. In 2001 and 2002, the limit on foreign players was expanded seven but only three could play in a game at the same time. The limit was lower to five in 2003, four in 2005, and three in 2007. Since 2009, the number of foreign players went back up to four per team, including a slot for a player from AFC countries. Since 2020, Southeast Asian players can be registered under the ASEAN Quota.
Relocation of clubs
In early years, the hometowns of K League clubs were determined, but they were pointless in substance because the clubs played all K League matches by going around all stadiums together. The current home and away system is being operated since 1987. The clubs were relocated from provinces to cities in 1990, but clubs are currently based in their area regardless of province and city since 1994. In 1996, the decentralization policy was operated. In result 3 clubs based in Seoul were relocated. Since 1996, it is obligatory for all clubs to include hometown name in their club name.
Awards
Annual awards
K League Most Valuable Player Award
K League Top Scorer Award
K League Top Assist Provider Award
K League Young Player of the Year Award
K League Manager of the Year Award
K League Best XI
K League FANtastic Player
Hall of Fame
Sponsorship
See also
Football in South Korea
K League 1
K League 2
K League Championship
Korean League Cup
K League All-Star Game
Korean FA Cup
Korean Super Cup
List of K League licensed video games
South Korean football league system
South Korean football clubs in the AFC Champions League
R League
References
External links
Official K League website
Professional sports leagues in South Korea |
```go
package rewrite
import (
"strings"
"testing"
"github.com/coredns/caddy"
)
func TestParse(t *testing.T) {
tests := []struct {
inputFileRules string
shouldErr bool
errContains string
}{
// parse errors
{`rewrite`, true, ""},
{`rewrite name`, true, ""},
{`rewrite name a.com b.com`, false, ""},
{`rewrite stop {
name regex foo bar
answer name bar foo
}`, false, ""},
{`rewrite stop name regex foo bar answer name bar foo`, false, ""},
{`rewrite stop {
name regex foo bar
answer name bar foo
name baz
}`, true, "2 arguments required"},
{`rewrite stop {
answer name bar foo
name regex foo bar
}`, true, "must begin with a name rule"},
{`rewrite stop`, true, ""},
{`rewrite continue`, true, ""},
}
for i, test := range tests {
c := caddy.NewTestController("dns", test.inputFileRules)
_, err := rewriteParse(c)
if err == nil && test.shouldErr {
t.Fatalf("Test %d expected errors, but got no error\n---\n%s", i, test.inputFileRules)
} else if err != nil && !test.shouldErr {
t.Fatalf("Test %d expected no errors, but got '%v'\n---\n%s", i, err, test.inputFileRules)
}
if err != nil && test.errContains != "" && !strings.Contains(err.Error(), test.errContains) {
t.Errorf("Test %d got wrong error for invalid response rewrite: '%v'\n---\n%s", i, err.Error(), test.inputFileRules)
}
}
}
``` |
Louis H. Folmer (April 15, 1904 β February 1983) was an American politician who served in the New York State Assembly from 1951 to 1968.
References
1904 births
1983 deaths
Republican Party members of the New York State Assembly
20th-century American politicians |
Leigha Amy Simonton is an American lawyer who has served as United States attorney for the Northern District of Texas since December 2022.
Education
Simonton earned a Bachelor of Arts in history from the University of Texas at Austin in 1997 and a Juris Doctor from Yale Law School in 2001.
Career
Simonton served as a law clerk for Judge Barbara M. Lynn of the United States District Court for the Northern District of Texas from 2001 to 2002 and for Judge Patrick Higginbotham of the United States Court of Appeals for the Fifth Circuit from 2002 to 2003. From 2003 to 2005, she was an associate at Haynes and Boone in their Dallas, Texas, office. From 2005 to 2022, she served as an assistant United States attorney in the United States Attorney's Office for the Northern District of Texas.
U.S. attorney for the Northern District of Texas
On October 14, 2022, President Joe Biden announced his intent to nominate Simonton to be the United States attorney for the Northern District of Texas. On November 14, 2022, her nomination was sent to the United States Senate. Simonton was recommended to the post by Senators John Cornyn and Ted Cruz. On November 17, 2022, her nomination was reported out of committee by a voice vote. On December 6, 2022, her nomination was confirmed in the Senate by voice vote. She was sworn in by District Judge Barbara M. Lynn on December 10, 2022.
References
Living people
21st-century American women lawyers
21st-century American lawyers
Assistant United States Attorneys
Texas lawyers
United States Attorneys for the Northern District of Texas
University of Texas at Austin alumni
Yale Law School alumni
Year of birth missing (living people) |
Rajni Tiwari (born 27 July 1973) is an Indian politician, a Minister of State in the Government of Uttar Pradesh and a member of the 18th Legislative Assembly. She represents the Shahabad constituency and is a member of the Bhartiya Janta Party.
Early life and education
Tiwari was born on 27 July 1973 to Krishna Prasad Agnihotri in Bilgram in Hardoi district. She graduated with a Bachelor of Arts from Arya Kanya Degree College, Hardoi, Kanpur University. Tiwari is an agriculturalist and businesswoman by profession.
Personal life
Tiwari was married to Upendra Tiwari, with whom she has a son and a daughter. Upendra Tiwari was an MLA from Bilgram constituency. He died in 2007 which left the Bilgram constituency seat vacant. Tiwari was elected as an MLA in the 2008 by-polls.
Positions held
See also
Government of Uttar Pradesh
Sixteenth Legislative Assembly of Uttar Pradesh
Fifteenth Legislative Assembly of Uttar Pradesh
Uttar Pradesh Legislative Assembly
Bhartiya Janta Party
References
1973 births
Living people
Women in Uttar Pradesh politics
Bharatiya Janata Party politicians from Uttar Pradesh
Uttar Pradesh MLAs 2017β2022
21st-century Indian women politicians
21st-century Indian politicians
Uttar Pradesh MLAs 2022β2027 |
For Sentimental Reasons may refer to:
For Sentimental Reasons (Nat King Cole album), 1997
For Sentimental Reasons (Ella Fitzgerald album), 1955
For Sentimental Reasons (Linda Ronstadt album), 1986
For Sentimental Reasons, a 2007 album by Bobby Hutcherson
"For Sentimental Reasons" (1936 song), a song popularized in the 1930s by Tommy Dorsey
"(I Love You) For Sentimental Reasons", a song written by William "Pat" Best |
Harald Johansen (9 October 1887 β 11 July 1965) was a Norwegian football player. He was born in Fredrikstad. He played for the club Mercantile, and for the Norwegian national team. He competed at the 1912 Summer Olympics in Stockholm. He was Norwegian champion with the club Mercantile in 1907 and 1912.
References
External links
1887 births
1965 deaths
Footballers from Fredrikstad
Norwegian men's footballers
Norway men's international footballers
Footballers at the 1912 Summer Olympics
Olympic footballers for Norway
Men's association football midfielders |
The Cascais Line () is a Portuguese railway line which connects the municipalities of Lisbon, Oeiras, and Cascais. The line starts in Lisbon, at Cais do Sodré and ends in Cascais. The first section, from Cascais to Pedrouços, was opened in 1889. The line was completed in 1895. It was the first heavy rail line to be electrified in Portugal, in 1926, and the last to be integrated into CP, in 1977. In July, 2020, CP announced that the line is slated to be converted from 1500 V DC electrification, to 25 kV AC, to match the rest of the network. Signalling will also be upgraded and new trains acquired.
See also
List of railway lines in Portugal
List of Portuguese locomotives and railcars
History of rail transport in Portugal
References
Sources
Cas
Iberian gauge railways
Railway lines opened in 1889 |
Robert Watt (bapt. 1 May 1774 β 12 March 1819) was a Scottish physician and bibliographer.
Early life
The son of a small farmer in Bonnyton near Stewarton in Ayrshire, Watt attended school from the age of six to twelve. After working as a ploughman, aged seventeen he went to learn cabinetmaking with his brother. Forming the ambition to go to Glasgow University, Watt was given tuition by a local schoolmaster and managed to enter Glasgow University in 1793, transferring to Edinburgh University in 1795. After briefly considering the ministry, he graduated with a Licence in medicine in 1799 and took up a medical practice in Paisley.
Medical career
By 1800 he was publishing papers in the Medical and Physical Journal, and he continued to publish medical articles until 1814. A founding member of the Paisley Medical Society in 1806, he was admitted a full member of the Glasgow Faculty of Physicians and Surgeons in 1807 and thereafter built his reputation as a Glasgow physician. From 1814 to 1816 he was President of the Faculty, and he was a founding member and first president of the Glasgow Medical Society. Watt published two books and several papers on medicine: his 1813 Inquiry into child mortality (after two of his children had died from whooping cough) concluded that smallpox vaccination had impacted on smallpox mortality, but not on overall child mortality. However, he gave up medical practice due to ill-health in 1817 and his lasting reputation rests on his work as a bibliographer.
Bibliotheca Britannica
Watt's first bibliographical publication was a catalogue (1812) of his own medical library. Bibliotheca Britannica was a much more extravagantly ambitious project: "A General Index on the Literature of Great Britain and Ireland Ancient and Modern including Such Foreign Books as have been translated into English or printed in the British Dominions, as also a copious selection from the writings of the most distinguished authors of all ages and nations."
Watt died in 1819, but lived to see the book mostly completed and printing begun. The support of Thomas Chalmers, James Ewing, George Jardine and Ralph Whitelaw was enlisted to ensure that publication would be completed. A complete edition in four large quarto volumes was seen through the press by 1824: volumes one and two were an alphabetical author index, and volumes three and four a subject index. Over 40,000 authors were covered, and some periodical literature was also indexed. Paisley Public Library holds a manuscript of Bibliotheca Britannica in 57 folio volumes.
Works
Cases of Diabetes, Consumption, etc., with Observations on the History and Treatment of Disease in General, 1808
Catalogue of Medical Books for the Use of Students Attending Lectures on the Principles and Practice of Medicine, Glasgow, 1812
Treatise on the History, Nature and Treatment of Chincough... to which is subjoined an Inquiry into the Relative Mortality of the Principal Diseases of Children, Glasgow, 1813.
The Rule of Life, 1814
Bibliotheca Britannica or a general index of British and foreign literature. Edinburgh, Constable, 1824. Four volumes.
Notes
References
Finlayson, Life and Works of Robert Watt, 1897
Further reading
External links
James Beaton, βWatt, Robert (bap. 1774, d. 1819)β, Oxford Dictionary of National Biography, Oxford University Press, 2004, accessed 19 Dec 2007
archive.org: Bibliotheca Britannica, volume I
archive.org: Bibliotheca Britannica, volume II
19th-century Scottish medical doctors
1774 births
1819 deaths
Scottish bibliographers
People from East Ayrshire
Alumni of the University of Glasgow
Alumni of the University of Edinburgh
Scottish medical writers
18th-century Scottish medical doctors |
The Defence Survive, Evade, Resist, Extract (SERE) Training Organisation (DSTO), is a military training organisation based at RAF St Mawgan, Cornwall, in the United Kingdom. It is tri-service and trains personnel in survival techniques, evading capture and resistance from interrogation.
History
Background
The Royal Navy and the Royal Air Force have what has been described as a "rich history of survival training". Crews were often lost at sea during the Second World War, with an attrition rate of 80%, which prompted the training to be initiated.
Prior to the DSTO being established, the Royal Navy and the Royal Air Force provided their own survival training and the Resistance Training Wing provided the services with conduct after capture training.
Royal Navy
Before 1943, Royal Navy survival training and equipment was the responsibility of two ratings trained by the RAF. The significance of the work, however, resulted in a reorganisation whereby the navy would train its own Survival Equipment Officers and ratings. The new Royal Navy Survival Equipment School (RNSES) initially took up residence at Eastleigh, Hampshire, before it was moved to improved accommodation at Grange Airfield (HMS Siskin) in March 1947. In 1955, the school moved to a former boys' preparatory school (Seafield Park) at Hill Head. It remained there until September 1991, when it relocated to the former Naval Aircraft Technical Evaluation Centre (NATEC) building at RNAS Lee-on-Solent (HMS Daedalus). In February 1995, the RNSES become part of the Royal Navy Air Engineering School, which was renamed to Royal Navy Air Engineering and Survival School (RNAESS). When Lee-on-Solent closed in March 1996, the RNAESS was relocated to a purpose-built building at in Gosport. The unit was renamed the Survival Equipment Group and formed part of the Air Engineering and Survival Department. It remained at HMS Sultan until 2008.
Resistance Training Wing
Formerly 4 Conduct after Capture Company (4 CAC Coy), the Resistance Training Wing (RTW) was part of the now-disbanded Joint Services Intelligence Organisation (JSIO) based at Defence Intelligence Security Centre Chicksands, in Bedfordshire. The wing trained personnel resistance to interrogation techniques.
Royal Air Force
The Royal Air Force can trace such training back to May 1943 with the formation of the School of Air/Sea Rescue, located near RAF Squire Gate, in Lancashire. The school taught RAF and USAAF crews rescue procedures and familiarisation with rescue equipment. It relocated to RAF Calshot in Hampshire in 1945, when it became the Survival and Rescue Training Unit, before moving to RAF Thorney Island in West Sussex during 1946. It disbanded in April 1949, but was replaced by the Survival and Rescue Mobile Instruction Unit (SRMIU), again at Thorney Island, in January 1950. The SRMIU would provide training to personnel during annual visits to RAF stations, but that method was considered inadequate, and in 1955, the Search, Rescue and Survival School was established as part of No. 2 Air Navigation School. The School moved to RAF Mount Batten, near Plymouth, in June 1959, when it was renamed the School of Combat Survival and Rescue (SCSR) to reflect the combat environment in which it was expected that survival and rescue skills would typically be used. RAF Mount Batten closed in 1992, with the school relocated to RAF St Mawgan, in Cornwall, where it remained until 2008.
Establishment
The Defence Survive, Evade, Resist, Extract (SERE) Training Organisation (DSTO) was created in 2008, when the RAF's School of Combat Survival and Rescue was amalgamated with the Royal Navy's Survival Equipment Group and the Resistance Training Wing. Although DSTO is a tri-service organisation, it comes under the control of No. 22 Group within RAF Air Command.
Until then, training was undertaken at three different sites across the three services at diverse locations such as Chicksands and at . The Royal Air Force is the lead on aircrew-focused training for military personnel in the United Kingdom and has a second training centre (ASTC) located at RAF Cranwell, in Lincolnshire. The patron of ASTC is Ray Mears, who was in a SERE situation during filming in 2005 when his helicopter crashed in Wyoming. Mears managed to recover all of his crew to safety after the incident.
Role and operations
SERE is an acronym for Survive, Evade, Resist and Extract. At a basic level, that is a core aspect of training for all UK military personnel on an annual basis. Regular Army personnel are tested as part of their Military Annual Training Tests (MATTs) as befits their frontline nature (similar processes are run by the Royal Marines and RAF Regiment) with non-frontline personnel mandated to watch a DVD detailing SERE methods.
UK armed forces personnel who train at the SERE school may be subject to methods of interrogation that are prohibited under international law. That training is carried out under strictly-controlled conditions and is delivered only to enable the trainees to understand the methods that may be used against them if they are captured by hostile forces who are not signatories to or adherents of the Geneva Convention or of international law.
SERE is mandated for all aircrew from all services and involves sea drills for those that require it. Sea drills involve jumping into the sea and spending some time adrift before hauling oneself into a dinghy from where the servicemember can be rescued. The Royal Navy and the Royal Air Force aircrews practice it with regularity. SERE training is also delivered to aircrew because the nature of their job makes them vulnerable to capture if they must bail out over or crash an aircraft into hostile territory.
Notable students
Prince William, Duke of Cambridge β went through the training as part of his survival training for being a helicopter pilot
Prince Harry, Duke of Sussex β went through the training as part of his survival training for being a helicopter pilot
Richard Branson β underwent the survival training as part of his world record ballooning attempt
Guy Martin β trained at St Mawgan for his pedal-powered blimp challenge across the English Channel
Carol Vorderman β undertook sea drills SERE training at RAF St Mawgan as part of her effort to become the ninth woman to fly solo around the world.
See also
United Kingdom Special Forces Selection
Survival, Evasion, Resistance and Escapean analogous program in the United States armed forces
References
Military education and training in the United Kingdom
Psychological warfare
Survival training
2008 establishments in the United Kingdom |
Chaudhary Nouraiz Shakoor Khan (Urdu, ) (born October 19, 1948) is a Pakistani politician from Sahiwal who has been a member of the Pakistan National Assembly three times in 1988, 1993 and 2002 elections respectively. Shakoor was a member of the Pakistan Peoples Party (PPP) and then Pakistan Tehreek e Insaf PTI. Presently he is CEC Member of PTI.
He has served in various Ministerial positions, including Minister for Petroleum and Natural Resources, Minister for Science and Technology, Minister for Communications, Minister of State for Youth Affairs and Parliamentary Secretary for Communications. He has also served as a Member of the National Assembly Standing Committees on Kashmir Affairs, Finance, Planning and Production. He joined the Pakistan Tehreek-e-Insaf in 2011.
From 1993 to 1996, he was Parliamentary Secretary for Communications. Later he became Minister of Communications and Youth Affairs (Pakistan). From 2002 to 2004, he was the Minister of Petroleum and Natural Affairs (Pakistan). From 2004 to 2007 he was the Minister of Science and Technology (Pakistan). As a representative of the government of Pakistan, Khan has made a number of official tours across Europe, Asia and the United States.
He is the incumbent president of the Pakistan Cycling Federation. He was defeated in General Elections 2008, 2013 and 2018 consecutively.
Background
Ch.Nouraiz Shakoor Khan graduated from the Cadet College Petaro in 1968 after finishing intermediate education. He later completed a Bachelor of Laws and became a practicing lawyer.
Shakoor contested all member National Assembly Elections from 1985 to 2018 on the PPP ticket, except 1985(independent), 2008(PML-Q) and 2018(PTI). In the history of Sahiwal, he is the only politician who has been elected three timesΒ - in 1988, 1993 and 2002 -Β as a Member of the National Assembly. In 2002 Nouraiz formed the Pakistan Peoples Party Parliamentarians Patriots (PPPPP) and became the Senior Vice President of the party. PPPPP merged with the ruling Pakistan Muslim League(PML-Q) and he became senior member of the ruling PML-Q. He contested the 2008 elections on the PML-Q ticket and lost. He joined PTI in 2011 and contested the 2018 election on PTI ticket.
Shakoor has served as Parliamentary Secretary for Communications in 1993β95 and as the Federal Minister of State for Communications and Youth Affairs in 1995β97. He then held the office of the Federal Minister for Petroleum and Natural Resources from 2002 to 2004. From 2005 to 2007, he held the portfolio of Minister of Science and Technology. He is an Advocate and an Agriculturist by profession. He was also a member of the Standing Committee on Finance Economics Affairs in 1988β90 and 1993β96, Standing Committee on Production 1988β90, Standing Committee on Planning and Development and Parliamentary Kashmir Committee 1993β96. Being on these titles Nouraiz Shakoor attended many national and international Conferences, Workshops and Seminars as part and leader of the delegations. He has represented Pakistan on many official tours around the World and has visited regions within U.S.A, Europe and Asia.
References
1950 births
Living people
Federal ministers of Pakistan
Pakistani lawyers
Pakistan People's Party politicians
People from Sahiwal
Cadet College Petaro alumni
Punjabi people
Pakistani sports executives and administrators
Pakistan Tehreek-e-Insaf politicians |
Ray's Moods is a studio album by Ray Charles released in July 1966.
Track listing
"What-Cha Doing In There (I Wanna Know)" (C. Sessions) β 2:22
"Please Say You're Fooling" (Bobby Stevenson) β 2:43
"By the Light of the Silvery Moon" (Edward Madden, Gus Edwards) β 2:46
"You Don't Understand" (Biba Lee Walker) β 3:05
"Maybe It's Because of Love" (Percy Mayfield) β 3:08
"Chitlins with Candied Yams" (Ray Charles) β 4:40
"Granny Wasn't Grinning That Day" (Percy Mayfield) β 2:08
"She's Lonesome Again" (George Riddle) β 2:29
"Sentimental Journey" (Ben Homer, Bud Green, Les Brown) β 2:56
"A Born Loser" (Don Gibson) β 2:13
"It's a Man's World" (Leroy Kirkland, Pearl Woods) β 3:23
"A Girl I Used To Know" (Jack Clement) β 2:39
Charting history
Personnel
Ray Charles β Keyboards, Vocals
Onzy Matthews - arranger
External links
Ray Charles albums
1966 albums
ABC Records albums
Tangerine Records (1962) albums |
KarlΔ± is a neighbourhood in the municipality and district of VezirkΓΆprΓΌ, Samsun Province, Turkey. Its population is 228 (2022).
References
Neighbourhoods in VezirkΓΆprΓΌ District |
The Jungle was a large homeless encampment located in San Jose, California. It was located off Story Road and along Coyote Creek, in an area called Coyote Meadow, and consisted of various makeshift dwellings, shacks, tree houses and tents on around of land. During the time of its existence, it was often considered to be one of the largest homeless encampments in the United States.
The Jungle appears to have been in existence from 1999 to early December 2014, per the account of a former resident who lived there, stating in December 2014 that she lived there periodically for fifteen years before it was closed down at that time.
Another former resident referred to it as resembling a "small community" when he lived there, with amenities such as stoves, couches, tarps and motor homes. He also stated that several encampment residents held nine-to-five day jobs, and would stay at the camp because they had no place to live, despite being employed full-time.
Closure
An attempted closure that led to 150 people being removed from The Jungle occurred in May 2012. However, people eventually returned to the site.
In July 2013, the San Jose City Council agreed upon a $4 million budget to provide housing for homeless Jungle inhabitants, which marked the beginning of a permanent eviction process. In December 2014, authorities evicted camp residents, closed the site and then demolished it, hauled everything away in garbage trucks, and fenced it off. Around the time of its closing, about 300 people lived there. The Jungle was closed down in part due to pressure from California state and regional water authorities to remove human waste and garbage from Coyote Creek, because it was polluting the San Francisco Bay. It was also reported that complaints about the encampment from area residents was a factor leading to its closure. Additional reasons for the eviction included general unsanitary conditions at the site and an increase in violent incidents.
Prior to being demolished, the city of San Jose utilized the allocated $4 million to relocate Jungle inhabitants into subsidized housing. By early December 2014, housing was secured in the form of apartments for 144 people, and subsidization for two years was allocated. Sixty additional subsidy vouchers were available at the time, but available apartments were not found. A general housing shortage in San Jose was blamed for the lack of available housing, along with high housing costs and limited available low-cost housing.
In 2015, to prevent people from returning to the site, the Rangers of the Watershed Protection Team regularly patrolled the area, and in addition to the fencing that was erected, large boulders were placed next to Story Road to prevent vehicular entry. At this time, after the site's closure, some began referring to the site as Coyote Meadow, its former name before it was called The Jungle.
See also
Homelessness in the San Francisco Bay Area
Homelessness in the United States
Joe Rodota Trail
List of tent cities in the United States
Squatting in the United States
Tent city
References
External links
2010s in California
Crime in the San Francisco Bay Area
Homelessness in the United States
History of San Jose, California |
```java
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.beam.runners.dataflow.worker;
import static org.junit.Assert.assertArrayEquals;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import static org.junit.Assert.fail;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.io.BaseEncoding;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.primitives.Bytes;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.JUnit4;
/** Tests for OrderedCode. */
@RunWith(JUnit4.class)
public class OrderedCodeTest {
@Test
public void testWriteInfinity() {
OrderedCode orderedCode = new OrderedCode();
try {
orderedCode.readInfinity();
fail("Expected IllegalArgumentException.");
} catch (IllegalArgumentException e) {
// expected
}
orderedCode.writeInfinity();
assertTrue(orderedCode.readInfinity());
try {
orderedCode.readInfinity();
fail("Expected IllegalArgumentException.");
} catch (IllegalArgumentException e) {
// expected
}
}
@Test
public void testWriteBytes() {
byte[] first = {'a', 'b', 'c'};
byte[] second = {'d', 'e', 'f'};
byte[] last = {'x', 'y', 'z'};
OrderedCode orderedCode = new OrderedCode();
orderedCode.writeBytes(first);
byte[] firstEncoded = orderedCode.getEncodedBytes();
assertArrayEquals(orderedCode.readBytes(), first);
orderedCode.writeBytes(first);
orderedCode.writeBytes(second);
orderedCode.writeBytes(last);
byte[] allEncoded = orderedCode.getEncodedBytes();
assertArrayEquals(orderedCode.readBytes(), first);
assertArrayEquals(orderedCode.readBytes(), second);
assertArrayEquals(orderedCode.readBytes(), last);
orderedCode = new OrderedCode(firstEncoded);
orderedCode.writeBytes(second);
orderedCode.writeBytes(last);
assertArrayEquals(orderedCode.getEncodedBytes(), allEncoded);
assertArrayEquals(orderedCode.readBytes(), first);
assertArrayEquals(orderedCode.readBytes(), second);
assertArrayEquals(orderedCode.readBytes(), last);
orderedCode = new OrderedCode(allEncoded);
assertArrayEquals(orderedCode.readBytes(), first);
assertArrayEquals(orderedCode.readBytes(), second);
assertArrayEquals(orderedCode.readBytes(), last);
}
@Test
public void testWriteNumIncreasing() {
OrderedCode orderedCode = new OrderedCode();
orderedCode.writeNumIncreasing(0);
orderedCode.writeNumIncreasing(1);
orderedCode.writeNumIncreasing(Long.MIN_VALUE);
orderedCode.writeNumIncreasing(Long.MAX_VALUE);
assertEquals(0, orderedCode.readNumIncreasing());
assertEquals(1, orderedCode.readNumIncreasing());
assertEquals(Long.MIN_VALUE, orderedCode.readNumIncreasing());
assertEquals(Long.MAX_VALUE, orderedCode.readNumIncreasing());
}
/**
* Assert that encoding the specified long via {@link OrderedCode#writeSignedNumIncreasing(long)}
* results in the bytes represented by the specified string of hex digits. E.g.
* assertSignedNumIncreasingEncodingEquals("3fbf", -65) asserts that -65 is encoded as { (byte)
* 0x3f, (byte) 0xbf }.
*/
private static void assertSignedNumIncreasingEncodingEquals(
String expectedHexEncoding, long num) {
OrderedCode orderedCode = new OrderedCode();
orderedCode.writeSignedNumIncreasing(num);
assertEquals(
"Unexpected encoding for " + num,
expectedHexEncoding,
BaseEncoding.base16().lowerCase().encode(orderedCode.getEncodedBytes()));
}
/**
* Assert that encoding various long values via {@link OrderedCode#writeSignedNumIncreasing(long)}
* produces the expected bytes. Expected byte sequences were generated via the c++ (authoritative)
* implementation of OrderedCode::WriteSignedNumIncreasing.
*/
@Test
public void testSignedNumIncreasing_write() {
assertSignedNumIncreasingEncodingEquals("003f8000000000000000", Long.MIN_VALUE);
assertSignedNumIncreasingEncodingEquals("003f8000000000000001", Long.MIN_VALUE + 1);
assertSignedNumIncreasingEncodingEquals("077fffffff", Integer.MIN_VALUE - 1L);
assertSignedNumIncreasingEncodingEquals("0780000000", Integer.MIN_VALUE);
assertSignedNumIncreasingEncodingEquals("0780000001", Integer.MIN_VALUE + 1);
assertSignedNumIncreasingEncodingEquals("3fbf", -65);
assertSignedNumIncreasingEncodingEquals("40", -64);
assertSignedNumIncreasingEncodingEquals("41", -63);
assertSignedNumIncreasingEncodingEquals("7d", -3);
assertSignedNumIncreasingEncodingEquals("7e", -2);
assertSignedNumIncreasingEncodingEquals("7f", -1);
assertSignedNumIncreasingEncodingEquals("80", 0);
assertSignedNumIncreasingEncodingEquals("81", 1);
assertSignedNumIncreasingEncodingEquals("82", 2);
assertSignedNumIncreasingEncodingEquals("83", 3);
assertSignedNumIncreasingEncodingEquals("bf", 63);
assertSignedNumIncreasingEncodingEquals("c040", 64);
assertSignedNumIncreasingEncodingEquals("c041", 65);
assertSignedNumIncreasingEncodingEquals("f87ffffffe", Integer.MAX_VALUE - 1);
assertSignedNumIncreasingEncodingEquals("f87fffffff", Integer.MAX_VALUE);
assertSignedNumIncreasingEncodingEquals("f880000000", Integer.MAX_VALUE + 1L);
assertSignedNumIncreasingEncodingEquals("ffc07ffffffffffffffe", Long.MAX_VALUE - 1);
assertSignedNumIncreasingEncodingEquals("ffc07fffffffffffffff", Long.MAX_VALUE);
}
/**
* Convert a string of hex digits (e.g. "3fbf") to a byte[] (e.g. { (byte) 0x3f, (byte) 0xbf }).
*/
private static byte[] bytesFromHexString(String hexDigits) {
return BaseEncoding.base16().lowerCase().decode(hexDigits);
}
/**
* Assert that decoding (via {@link OrderedCode#readSignedNumIncreasing()}) the bytes represented
* by the specified string of hex digits results in the expected long value. E.g.
* assertDecodedSignedNumIncreasingEquals(-65, "3fbf") asserts that the byte array { (byte) 0x3f,
* (byte) 0xbf } is decoded as -65.
*/
private static void assertDecodedSignedNumIncreasingEquals(
long expectedNum, String encodedHexString) {
OrderedCode orderedCode = new OrderedCode(bytesFromHexString(encodedHexString));
assertEquals(
"Unexpected value when decoding 0x" + encodedHexString,
expectedNum,
orderedCode.readSignedNumIncreasing());
assertFalse(
"Unexpected encoded bytes remain after decoding 0x" + encodedHexString,
orderedCode.hasRemainingEncodedBytes());
}
/**
* Assert that decoding various sequences of bytes via {@link
* OrderedCode#readSignedNumIncreasing()} produces the expected long value. Input byte sequences
* were generated via the c++ (authoritative) implementation of
* OrderedCode::WriteSignedNumIncreasing.
*/
@Test
public void testSignedNumIncreasing_read() {
assertDecodedSignedNumIncreasingEquals(Long.MIN_VALUE, "003f8000000000000000");
assertDecodedSignedNumIncreasingEquals(Long.MIN_VALUE + 1, "003f8000000000000001");
assertDecodedSignedNumIncreasingEquals(Integer.MIN_VALUE - 1L, "077fffffff");
assertDecodedSignedNumIncreasingEquals(Integer.MIN_VALUE, "0780000000");
assertDecodedSignedNumIncreasingEquals(Integer.MIN_VALUE + 1, "0780000001");
assertDecodedSignedNumIncreasingEquals(-65, "3fbf");
assertDecodedSignedNumIncreasingEquals(-64, "40");
assertDecodedSignedNumIncreasingEquals(-63, "41");
assertDecodedSignedNumIncreasingEquals(-3, "7d");
assertDecodedSignedNumIncreasingEquals(-2, "7e");
assertDecodedSignedNumIncreasingEquals(-1, "7f");
assertDecodedSignedNumIncreasingEquals(0, "80");
assertDecodedSignedNumIncreasingEquals(1, "81");
assertDecodedSignedNumIncreasingEquals(2, "82");
assertDecodedSignedNumIncreasingEquals(3, "83");
assertDecodedSignedNumIncreasingEquals(63, "bf");
assertDecodedSignedNumIncreasingEquals(64, "c040");
assertDecodedSignedNumIncreasingEquals(65, "c041");
assertDecodedSignedNumIncreasingEquals(Integer.MAX_VALUE - 1, "f87ffffffe");
assertDecodedSignedNumIncreasingEquals(Integer.MAX_VALUE, "f87fffffff");
assertDecodedSignedNumIncreasingEquals(Integer.MAX_VALUE + 1L, "f880000000");
assertDecodedSignedNumIncreasingEquals(Long.MAX_VALUE - 1, "ffc07ffffffffffffffe");
assertDecodedSignedNumIncreasingEquals(Long.MAX_VALUE, "ffc07fffffffffffffff");
}
/**
* Assert that encoding (via {@link OrderedCode#writeSignedNumIncreasing(long)}) the specified
* long value and then decoding (via {@link OrderedCode#readSignedNumIncreasing()}) results in the
* original value.
*/
private static void assertSignedNumIncreasingWriteAndReadIsLossless(long num) {
OrderedCode orderedCode = new OrderedCode();
orderedCode.writeSignedNumIncreasing(num);
assertEquals(
"Unexpected result when decoding writeSignedNumIncreasing(" + num + ")",
num,
orderedCode.readSignedNumIncreasing());
assertFalse(
"Unexpected remaining encoded bytes after decoding " + num,
orderedCode.hasRemainingEncodedBytes());
}
/**
* Assert that for various long values, encoding (via {@link
* OrderedCode#writeSignedNumIncreasing(long)}) and then decoding (via {@link
* OrderedCode#readSignedNumIncreasing()}) results in the original value.
*/
@Test
public void testSignedNumIncreasing_writeAndRead() {
assertSignedNumIncreasingWriteAndReadIsLossless(Long.MIN_VALUE);
assertSignedNumIncreasingWriteAndReadIsLossless(Long.MIN_VALUE + 1);
assertSignedNumIncreasingWriteAndReadIsLossless(Integer.MIN_VALUE - 1L);
assertSignedNumIncreasingWriteAndReadIsLossless(Integer.MIN_VALUE);
assertSignedNumIncreasingWriteAndReadIsLossless(Integer.MIN_VALUE + 1);
assertSignedNumIncreasingWriteAndReadIsLossless(-65);
assertSignedNumIncreasingWriteAndReadIsLossless(-64);
assertSignedNumIncreasingWriteAndReadIsLossless(-63);
assertSignedNumIncreasingWriteAndReadIsLossless(-3);
assertSignedNumIncreasingWriteAndReadIsLossless(-2);
assertSignedNumIncreasingWriteAndReadIsLossless(-1);
assertSignedNumIncreasingWriteAndReadIsLossless(0);
assertSignedNumIncreasingWriteAndReadIsLossless(1);
assertSignedNumIncreasingWriteAndReadIsLossless(2);
assertSignedNumIncreasingWriteAndReadIsLossless(3);
assertSignedNumIncreasingWriteAndReadIsLossless(63);
assertSignedNumIncreasingWriteAndReadIsLossless(64);
assertSignedNumIncreasingWriteAndReadIsLossless(65);
assertSignedNumIncreasingWriteAndReadIsLossless(Integer.MAX_VALUE - 1);
assertSignedNumIncreasingWriteAndReadIsLossless(Integer.MAX_VALUE);
assertSignedNumIncreasingWriteAndReadIsLossless(Integer.MAX_VALUE + 1L);
assertSignedNumIncreasingWriteAndReadIsLossless(Long.MAX_VALUE - 1);
assertSignedNumIncreasingWriteAndReadIsLossless(Long.MAX_VALUE);
}
@Test
public void testLog2Floor_Positive() {
OrderedCode orderedCode = new OrderedCode();
assertEquals(0, orderedCode.log2Floor(1));
assertEquals(1, orderedCode.log2Floor(2));
assertEquals(1, orderedCode.log2Floor(3));
assertEquals(2, orderedCode.log2Floor(4));
assertEquals(5, orderedCode.log2Floor(63));
assertEquals(6, orderedCode.log2Floor(64));
assertEquals(62, orderedCode.log2Floor(Long.MAX_VALUE));
}
/** OrderedCode.log2Floor(long) is defined to return -1 given an input of zero. */
@Test
public void testLog2Floor_zero() {
OrderedCode orderedCode = new OrderedCode();
assertEquals(-1, orderedCode.log2Floor(0));
}
@Test
public void testLog2Floor_negative() {
OrderedCode orderedCode = new OrderedCode();
try {
orderedCode.log2Floor(-1);
fail("Expected an IllegalArgumentException.");
} catch (IllegalArgumentException expected) {
// Expected!
}
}
@Test
public void testGetSignedEncodingLength() {
OrderedCode orderedCode = new OrderedCode();
assertEquals(10, orderedCode.getSignedEncodingLength(Long.MIN_VALUE));
assertEquals(10, orderedCode.getSignedEncodingLength(~(1L << 62)));
assertEquals(9, orderedCode.getSignedEncodingLength(~(1L << 62) + 1));
assertEquals(3, orderedCode.getSignedEncodingLength(-8193));
assertEquals(2, orderedCode.getSignedEncodingLength(-8192));
assertEquals(2, orderedCode.getSignedEncodingLength(-65));
assertEquals(1, orderedCode.getSignedEncodingLength(-64));
assertEquals(1, orderedCode.getSignedEncodingLength(-2));
assertEquals(1, orderedCode.getSignedEncodingLength(-1));
assertEquals(1, orderedCode.getSignedEncodingLength(0));
assertEquals(1, orderedCode.getSignedEncodingLength(1));
assertEquals(1, orderedCode.getSignedEncodingLength(63));
assertEquals(2, orderedCode.getSignedEncodingLength(64));
assertEquals(2, orderedCode.getSignedEncodingLength(8191));
assertEquals(3, orderedCode.getSignedEncodingLength(8192));
assertEquals(9, orderedCode.getSignedEncodingLength((1L << 62)) - 1);
assertEquals(10, orderedCode.getSignedEncodingLength(1L << 62));
assertEquals(10, orderedCode.getSignedEncodingLength(Long.MAX_VALUE));
}
@Test
public void testWriteTrailingBytes() {
byte[] escapeChars =
new byte[] {
OrderedCode.ESCAPE1,
OrderedCode.NULL_CHARACTER,
OrderedCode.SEPARATOR,
OrderedCode.ESCAPE2,
OrderedCode.INFINITY,
OrderedCode.FF_CHARACTER
};
byte[] anotherArray = new byte[] {'a', 'b', 'c', 'd', 'e'};
OrderedCode orderedCode = new OrderedCode();
orderedCode.writeTrailingBytes(escapeChars);
assertArrayEquals(orderedCode.getEncodedBytes(), escapeChars);
assertArrayEquals(orderedCode.readTrailingBytes(), escapeChars);
try {
orderedCode.readInfinity();
fail("Expected IllegalArgumentException.");
} catch (IllegalArgumentException e) {
// expected
}
orderedCode = new OrderedCode();
orderedCode.writeTrailingBytes(anotherArray);
assertArrayEquals(orderedCode.getEncodedBytes(), anotherArray);
assertArrayEquals(orderedCode.readTrailingBytes(), anotherArray);
}
@Test
public void testMixedWrite() {
byte[] first = {'a', 'b', 'c'};
byte[] second = {'d', 'e', 'f'};
byte[] last = {'x', 'y', 'z'};
byte[] escapeChars =
new byte[] {
OrderedCode.ESCAPE1,
OrderedCode.NULL_CHARACTER,
OrderedCode.SEPARATOR,
OrderedCode.ESCAPE2,
OrderedCode.INFINITY,
OrderedCode.FF_CHARACTER
};
OrderedCode orderedCode = new OrderedCode();
orderedCode.writeBytes(first);
orderedCode.writeBytes(second);
orderedCode.writeBytes(last);
orderedCode.writeInfinity();
orderedCode.writeNumIncreasing(0);
orderedCode.writeNumIncreasing(1);
orderedCode.writeNumIncreasing(Long.MIN_VALUE);
orderedCode.writeNumIncreasing(Long.MAX_VALUE);
orderedCode.writeSignedNumIncreasing(0);
orderedCode.writeSignedNumIncreasing(1);
orderedCode.writeSignedNumIncreasing(Long.MIN_VALUE);
orderedCode.writeSignedNumIncreasing(Long.MAX_VALUE);
orderedCode.writeTrailingBytes(escapeChars);
byte[] allEncoded = orderedCode.getEncodedBytes();
assertArrayEquals(orderedCode.readBytes(), first);
assertArrayEquals(orderedCode.readBytes(), second);
assertFalse(orderedCode.readInfinity());
assertArrayEquals(orderedCode.readBytes(), last);
assertTrue(orderedCode.readInfinity());
assertEquals(0, orderedCode.readNumIncreasing());
assertEquals(1, orderedCode.readNumIncreasing());
assertFalse(orderedCode.readInfinity());
assertEquals(Long.MIN_VALUE, orderedCode.readNumIncreasing());
assertEquals(Long.MAX_VALUE, orderedCode.readNumIncreasing());
assertEquals(0, orderedCode.readSignedNumIncreasing());
assertEquals(1, orderedCode.readSignedNumIncreasing());
assertFalse(orderedCode.readInfinity());
assertEquals(Long.MIN_VALUE, orderedCode.readSignedNumIncreasing());
assertEquals(Long.MAX_VALUE, orderedCode.readSignedNumIncreasing());
assertArrayEquals(orderedCode.getEncodedBytes(), escapeChars);
assertArrayEquals(orderedCode.readTrailingBytes(), escapeChars);
orderedCode = new OrderedCode(allEncoded);
assertArrayEquals(orderedCode.readBytes(), first);
assertArrayEquals(orderedCode.readBytes(), second);
assertFalse(orderedCode.readInfinity());
assertArrayEquals(orderedCode.readBytes(), last);
assertTrue(orderedCode.readInfinity());
assertEquals(0, orderedCode.readNumIncreasing());
assertEquals(1, orderedCode.readNumIncreasing());
assertFalse(orderedCode.readInfinity());
assertEquals(Long.MIN_VALUE, orderedCode.readNumIncreasing());
assertEquals(Long.MAX_VALUE, orderedCode.readNumIncreasing());
assertEquals(0, orderedCode.readSignedNumIncreasing());
assertEquals(1, orderedCode.readSignedNumIncreasing());
assertFalse(orderedCode.readInfinity());
assertEquals(Long.MIN_VALUE, orderedCode.readSignedNumIncreasing());
assertEquals(Long.MAX_VALUE, orderedCode.readSignedNumIncreasing());
assertArrayEquals(orderedCode.getEncodedBytes(), escapeChars);
assertArrayEquals(orderedCode.readTrailingBytes(), escapeChars);
}
@Test
public void testEdgeCases() {
byte[] ffChar = {OrderedCode.FF_CHARACTER};
byte[] nullChar = {OrderedCode.NULL_CHARACTER};
byte[] separatorEncoded = {OrderedCode.ESCAPE1, OrderedCode.SEPARATOR};
byte[] ffCharEncoded = {OrderedCode.ESCAPE1, OrderedCode.NULL_CHARACTER};
byte[] nullCharEncoded = {OrderedCode.ESCAPE2, OrderedCode.FF_CHARACTER};
byte[] infinityEncoded = {OrderedCode.ESCAPE2, OrderedCode.INFINITY};
OrderedCode orderedCode = new OrderedCode();
orderedCode.writeBytes(ffChar);
orderedCode.writeBytes(nullChar);
orderedCode.writeInfinity();
assertArrayEquals(
orderedCode.getEncodedBytes(),
Bytes.concat(
ffCharEncoded, separatorEncoded, nullCharEncoded, separatorEncoded, infinityEncoded));
assertArrayEquals(orderedCode.readBytes(), ffChar);
assertArrayEquals(orderedCode.readBytes(), nullChar);
assertTrue(orderedCode.readInfinity());
orderedCode = new OrderedCode(Bytes.concat(ffCharEncoded, separatorEncoded));
assertArrayEquals(orderedCode.readBytes(), ffChar);
orderedCode = new OrderedCode(Bytes.concat(nullCharEncoded, separatorEncoded));
assertArrayEquals(orderedCode.readBytes(), nullChar);
byte[] invalidEncodingForRead = {
OrderedCode.ESCAPE2, OrderedCode.ESCAPE2, OrderedCode.ESCAPE1, OrderedCode.SEPARATOR
};
orderedCode = new OrderedCode(invalidEncodingForRead);
try {
orderedCode.readBytes();
fail("Should have failed.");
} catch (Exception e) {
// Expected
}
assertTrue(orderedCode.hasRemainingEncodedBytes());
}
@Test
public void testHasRemainingEncodedBytes() {
byte[] bytes = {'a', 'b', 'c'};
long number = 12345;
// Empty
OrderedCode orderedCode = new OrderedCode();
assertFalse(orderedCode.hasRemainingEncodedBytes());
// First and only field of each type.
orderedCode.writeBytes(bytes);
assertTrue(orderedCode.hasRemainingEncodedBytes());
assertArrayEquals(orderedCode.readBytes(), bytes);
assertFalse(orderedCode.hasRemainingEncodedBytes());
orderedCode.writeNumIncreasing(number);
assertTrue(orderedCode.hasRemainingEncodedBytes());
assertEquals(orderedCode.readNumIncreasing(), number);
assertFalse(orderedCode.hasRemainingEncodedBytes());
orderedCode.writeSignedNumIncreasing(number);
assertTrue(orderedCode.hasRemainingEncodedBytes());
assertEquals(orderedCode.readSignedNumIncreasing(), number);
assertFalse(orderedCode.hasRemainingEncodedBytes());
orderedCode.writeInfinity();
assertTrue(orderedCode.hasRemainingEncodedBytes());
assertTrue(orderedCode.readInfinity());
assertFalse(orderedCode.hasRemainingEncodedBytes());
orderedCode.writeTrailingBytes(bytes);
assertTrue(orderedCode.hasRemainingEncodedBytes());
assertArrayEquals(orderedCode.readTrailingBytes(), bytes);
assertFalse(orderedCode.hasRemainingEncodedBytes());
// Two fields of same type.
orderedCode.writeBytes(bytes);
orderedCode.writeBytes(bytes);
assertTrue(orderedCode.hasRemainingEncodedBytes());
assertArrayEquals(orderedCode.readBytes(), bytes);
assertArrayEquals(orderedCode.readBytes(), bytes);
assertFalse(orderedCode.hasRemainingEncodedBytes());
}
}
``` |
Ramadhan Saputra (born on May 5, 1986) is an Indonesian former footballer who plays as a defender.
Club statistics
References
External links
Ramadhan Saputra at Liga Indonesia
1986 births
Men's association football central defenders
Sportspeople from Tangerang
Footballers from Banten
Living people
Indonesian men's footballers
Indonesian Premier Division players
Liga 1 (Indonesia) players
Liga 2 (Indonesia) players
Persita Tangerang
Semen Padang F.C. players
PSMS Medan players
Persiwa Wamena players
Persiba Bantul players
Persik Kediri players
Persela Lamongan players
Persik Kendal players
RANS Nusantara F.C. players
Perserang Serang players |
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.shardingsphere.proxy.backend.connector.jdbc.transaction;
import lombok.RequiredArgsConstructor;
import org.apache.shardingsphere.proxy.backend.connector.ProxyDatabaseConnectionManager;
import java.sql.Connection;
import java.sql.SQLException;
import java.util.Collection;
import java.util.Iterator;
import java.util.LinkedList;
/**
* Local transaction manager.
*/
@RequiredArgsConstructor
public final class LocalTransactionManager {
private final ProxyDatabaseConnectionManager databaseConnectionManager;
/**
* Begin transaction.
*/
public void begin() {
databaseConnectionManager.getConnectionPostProcessors().add(target -> target.setAutoCommit(false));
}
/**
* Commit transaction.
*
* @throws SQLException SQL exception
*/
public void commit() throws SQLException {
Collection<SQLException> exceptions = new LinkedList<>();
if (databaseConnectionManager.getConnectionSession().getConnectionContext().getTransactionContext().isExceptionOccur()) {
exceptions.addAll(rollbackConnections());
} else {
exceptions.addAll(commitConnections());
}
throwSQLExceptionIfNecessary(exceptions);
}
private Collection<SQLException> commitConnections() {
Collection<SQLException> result = new LinkedList<>();
for (Connection each : databaseConnectionManager.getCachedConnections().values()) {
try {
each.commit();
} catch (final SQLException ex) {
result.add(ex);
}
}
return result;
}
/**
* Rollback transaction.
*
* @throws SQLException SQL exception
*/
public void rollback() throws SQLException {
if (databaseConnectionManager.getConnectionSession().getTransactionStatus().isInTransaction()) {
Collection<SQLException> exceptions = new LinkedList<>(rollbackConnections());
throwSQLExceptionIfNecessary(exceptions);
}
}
private Collection<SQLException> rollbackConnections() {
Collection<SQLException> result = new LinkedList<>();
for (Connection each : databaseConnectionManager.getCachedConnections().values()) {
try {
each.rollback();
} catch (final SQLException ex) {
result.add(ex);
}
}
return result;
}
private void throwSQLExceptionIfNecessary(final Collection<SQLException> exceptions) throws SQLException {
if (exceptions.isEmpty()) {
return;
}
Iterator<SQLException> iterator = exceptions.iterator();
SQLException firstException = iterator.next();
while (iterator.hasNext()) {
firstException.setNextException(iterator.next());
}
throw firstException;
}
}
``` |
```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 bt.net.buffer;
import java.nio.Buffer;
/**
* Re-usable buffer.
*
* Thread-safe, but not recommended to be used by any thread different from the one that created it.
*
* @since 1.6
*/
public interface BorrowedBuffer<T extends Buffer> {
/**
* Get the underlying buffer instance. It's strongly recommended to never
* save the returned reference in object fields, variables or pass it via method parameters,
* unless it is known for sure, that such field or variable will be short-lived
* and used exclusively between calls to this method and {@link #unlock()}.
*
* Caller of this method SHOULD call {@link #unlock()} as soon as it's finished working with the buffer,
* e.g. by using the same try-finally pattern as when working with locks:
*
* <blockquote><pre>
* BorrowedBuffer<T> holder = ...;
* T buffer = holder.lockAndGet();
* try {
* writeData(buffer);
* } finally {
* holder.unlock();
* }
* </pre></blockquote>
*
* This method will block the calling thread until the buffer is in UNLOCKED state.
*
* @return Buffer or null if the buffer has already been released
* @since 1.6
*/
T lockAndGet();
/**
* Unlock the buffer, thus allowing to {@link #release()} it.
*
* @throws IllegalMonitorStateException if the buffer is not locked or is locked by a different thread
* @since 1.6
*/
void unlock();
/**
* Release the underlying buffer.
*
* The buffer will be returned to the pool of allocated but un-used buffers
* and will eventually be garbage collected (releasing native memory in case of direct buffers)
* or re-used in the form of another BorrowedBuffer instance.
*
* This method will block the calling thread until the buffer is in UNLOCKED state.
*
* This method has no effect, if the buffer has already been released.
*
* @since 1.6
*/
void release();
}
``` |
Alfred William 'Alf' O'Connor (1900-1970) was an Australian rugby league player who played in the 1920s and 1930s. O'Connor was a state and national representative second-rower who won three NSWRFL premierships with South Sydney.
Playing career
Alf 'Itchy' O'Connor played eight seasons for South Sydney between 1922 and 1929. A tall second-row forward, O'Connor played 83 first grade games for Souths and played in four Grand Finals, and won three premierships with the club in 1925 , 1926 and 1929.
O'Connor had an excellent representative career, representing New South Wales on nine separate occasions between 1924 and 1930. He also represented Australia on three occasions during the 1924 Ashes series.
O'Connor is listed on the Australian Players Register as Kangaroo No.131. Alf O'Connor was the brother of fellow Souths champion player Frank O'Connor.
Post playing
Alf O'Connor became an Australian National Test Selector in 1946.
Death
O'Connor died at Mascot, New South Wales on 30 January 1970 aged 69.
References
South Sydney Rabbitohs players
New South Wales rugby league team players
Australia national rugby league team players
Australian rugby league players
Australian rugby league administrators
1900 births
1970 deaths
Rugby league second-rows
Rugby league players from Sydney |
Color analysis (American English; colour analysis in Commonwealth English), also known as personal color analysis (PCA), seasonal color analysis, or skin-tone matching, is a term often used within the cosmetics and fashion industry to describe a method of determining the colors of clothing, makeup, hair style that harmonizes with a person's skin complexion, eye color, and hair color for use in wardrobe planning and style consulting. It is generally agreed that the wrong colors will draw attention to such flaws as wrinkles or uneven skin tone while harmonious colors will enhance the natural beauty of the individual making them appear healthy, brighter, and possible more attractive or put-together.
By the 1920s, a color revolution had occurred in the United States with the development of new color industries and the possibility of producing color swatch books used as a marketing tool. Personal color analysis reached a height in popularity in the early 1980s with a recent resurgence in the 2010s after further development and promotion of different versions of seasonal analysis by image and color consultants worldwide. Seasonal analysis is a technique that attempts to place individual coloring into the tonal groupings of Winter, Spring, Summer and Autumn, and their sub-variants. However, the approach can vary greatly among different schools of thought. Some color analysis systems classify an individual's personal combination of hair color, eye color and skin tone using labels that refer to a color's "temperature" (cool blue vs. warm yellow) and the degree to which the hair, skin and eye colors contrast. Cosmetic colors are often determined by hair or eye color alone.
The successful practical application of a color analysis will theoretically allow the individual to coordinate their clothing and accessories with greater ease and avoid costly mistakes by purchasing items that are not within their color palette. However, color analysis has continued to be controversial due to the lack of standard training or degree required to market oneself as a color analyst. This can become costly for the individual, both in regard to the fees of professional and less than professional analyses, and subsequent clothing and cosmetics purchases.
History
Early history (1850sβearly 1970s)
Chevreul
Michel EugΓ¨ne Chevreul (1786β1889) was a French chemist whose career took a new direction in 1824 when he was appointed director of dyeing at the Gobelins Manufactory in Paris, where he worked for 28 years. After receiving several complaints about the lack of consistency in the dye colors, Chevreul determined that the issue was not chemical but optical and focused his attention on exploring optical color mixing. He published his groundbreaking findings in The Laws of Contrast of Colour (1839) where he discussed the concept of simultaneous contrast (the colors of two different objects affect each other), successive contrast (a negative afterimage effect), and mixed contrast.
Chevreul's studies in color became the most widely used and influential color manual of the 19th century with a significant and long-lasting impact on the fine and industrial arts. As well as being the first to create a hemispherical color model displaying 72 normal tone hue scales, his exploration of color harmonies is an underlying principle in personal color analysis. In the 1850s, Chevreul's ideas were prescribed for an American audience lacking any education in color harmony. Godey's Lady's Book (1855 and 1859) introduced "gaudy" American women to Chevreul's idea of "becoming colors" for brunettes and blondes.
Munsell
Albert Henry Munsell (1858β1918) is famous for inventing the Munsell color system, one of the first color order systems created. An American painter and art teacher at the Massachusetts Normal Art School, he had visited the tapestry works of Chevreul and studied color in France. With the use of his own unique inventions, including the Photometer that measures object luminance, Munsell started to determine color spaces and standardize the way color was organized and defined.
In 1905, Munsell published his first of three books on color, A Color Notation where he discussed his color theory referencing three color dimensions: hue (the discernible shade on the wavelength spectrum), value (lightness to darkness scale), and chroma (softness through to brightness). Before the Munsell Color Theory, the intensity of color was defined as 'saturation' in the art and scientific community. Munsell determined that saturation encompassed two different dimensions, value and chroma, where chroma defines the difference between a pure hue and a pure grey.
Munsell paid close attention to the human visual system and human response to color, being sensitive to its inclusion in his mapping of three-dimensional color space. In 1917, Munsell founded the Munsell Color Company, to improve color communication and education. In the 1930s, the Munsell Color System was adopted by the USDA as the official color system for soil research and the system. The company is now owned by X-Rite who is known for color calibration. The Munsell Color System still remains the basis of color education today and is the foundation for modern color systems including CIELAB.
Itten
Johannes Itten (1888β1967) was a Swiss-born artist and art educator who expounded upon the principles of simultaneous contrast which Chevreul set forth in his 1839 treatise. He valued individual artistic expression and in 1928, while teaching a class assignment on color harmony, he noticed his students were choosing colors, lines and orientation that showed themselves "as they are", which led him to formulate the concept of "subjective color".
In his 1961 book The Art of Color, Itten examined two different approaches to understanding the art of color: Subjective feelings and objective color principles. Itten described "subjective color" as "the aura of the person. and provided examples or how subjective color might be expressed by an artist: A high contrast brunette will choose dark colors and high contrast, "suggesting a lively and concentrated personality and intense feeling." On the other hand, for a fair woman of low contrast the "fundamental contrast is hue". Furthermore, , which became the foundation for seasonal color analysis. In his book, Itten noted that, "Every woman should know what colors are becoming to her; they will always be her subjective colors and their complements."
Itten believed that "subjective colors" were of a lower artistic value and significance than what he deemed "objective colors," which were color harmonies of a higher order. In his final chapter titled 'Composition', Itten spoke of bringing two or more colors together in such a way that they harmonize to give an expression unambiguous and full of character.
Dorr
Robert C. Dorr (1905β1979) was an American artist who, in 1928, observed the harmonious effects of paint colors when grouping those of either a blue or yellow undertone. In 1934 Chicago, Dorr began working on furniture design using his own color theory of undertones and developed his ideas on color psychology. After working on a textile group for a manufacturer, he became a professional color consultant for cosmetic companies.
Dorr's Color Key System defined an individual's complexion as being either Key I (cool blue undertone) or Key II (warm yellow undertone). Each palette in The Color Key Program contain 170 colors per fan. Orange and magenta are the color indicants of yellow and blue undertones respectively. Dorr's Color Key Program took all races into consideration and no race was limited to any one Key palette.
After moving to California in the late 1950s, Dorr taught courses and gave lectures on his Color Key Program until his death in 1979. The color company Devoe Reynolds developed paint chips using their Key 1 & Key 2 color matching system from Robert Dorr.
Caygill
Suzanne Caygill (1911β1994) was an American fashion designer and color theorist who developed the Caygill Method of Color Analysis. A milliner, poet, dress designer and night club singer, as a young adult, Caygill turned her attention to color in 1945 and devoted the rest of her life to creating individual style guides and color palettes for clients and teaching design seminars. Caygill may have been influenced by her association with Edith Head, wardrobe designer and consultant to Hollywood studios and stars.
In the 1950s, Caygill starred in a self-improvement television program on fashion and relationships, "Living With Suzanne," which aired on CBS in Los Angeles and began to teach seminars in which she described her work on style, personality, line, and color. Many devotees attended her classes, adapted and popularized her theories of personality style and color analysis in the late 1970s and 80s.
In 1980, she published Color: The Essence of You and established the Academy of Color. In this book, Caygill identified a wide range of sub-groups within each season, and gave them descriptive names such as "Early Spring", "Metallic Autumn", or "Dynamic Winter", each with its own set of special characteristics. Caygill believed in the fundamental link between style, color and a person's personality. The Suzanne Caygill Papers, circa 1950β1990, are held within the Division of Rare and Manuscript Collections, Cornell University Library, Cornell University.
Seasonal skin tone color matching for clothing and cosmetics
Starting in the 1970s, the availability of high-quality, accurate and inexpensive color printing made it possible for the first time to produce books for the mass market in which skin tones and clothing colors could be accurately reproduced. Color reproduction technology was still not perfect, causing Carole Jackson to warn her readers, "Because it is difficult to print the color swatches 100 percent accurately, ... verbal descriptions will help you understand the concept of your colors when you shop for clothes." The result was the near-simultaneous publication by a number of authors of books proposing systems of color analysis designed to allow the reader to "discover which shades of color in clothes complement your natural coloring to look healthier, sexier and more powerful."
The authors of these books all present roughly similar ideas. Most agree, for example, on the following basic points:
Most rely upon a color system in which the colors are divided into four groups of harmonious colors which are said to match with the four seasons of the year. The seasons are, to some degree, arbitrary, and it sometimes happens that someone will be on the cusp of two seasons. But, as Carole Jackson insists, "with testing, one palette will prove to be better [more harmonious] than the other." Jackson also acknowledges, however, that the reference to the four seasons is nothing more than a convenient artifice: "We could call your coloring 'Type A,', 'Type B,' and so on, but comparison with the seasons provides a more poetic way to describe your coloring and your best colors."
An individual's basic color category, or season, remains the same over their lifetime, and is not affected by tanning, because "[w]e still have the same color skin, but in a darker hue."
Skin color, rather than hair or eye color, determines a person's season. Bernice Kentner warns, "Remember, do not rely on hair coloring to find your Season!"
Foremost publications on seasonal color analysis
Deborah Chase, The Medically Based No Nonsense Beauty Book (1975)
Chase explored the impact of skin pigments on coloration. She noted that there are three primary pigments that give the skin its tone: "Melanin, which gives the skin its brown tones; carotene imparts the yellow/orange skin tones; and hemoglobin is the red pigment in the blood, which gives the skin its pink and red hues....The three pigments--melanin, carotene, and hemoglobin join one another to produce our flesh tones."
Bernice Kentner, Color Me a Season (1978)
Bernice Kentner, who had worked as a licensed cosmetologist since 1950, began holding lectures on color analysis in the early 1970s, and in 1978 published Color Me a Season, which went through several printings in the early 1980s.
Like Chevreul and Suzanne Caygill, Kentner drew her ideas from the art of interior decorating. She wrote, "It is possible to color coordinate your home, so it is pleasing to the eye....So it is with the human body. The body itself is the background for all color that will be placed upon it. It remains our task then to find what color scheme our bodies fall into. As with the walls of a room we must determine what color our skin is." Kentner also drew on the ideas of Johannes Itten who linked the subjective colors of an individual to one of the four seasons.
Kentner emphasizes that it is skin color rather than hair or eye color that serves as the base from which a color analysis must start. The color of a person's skin determines whether that individual should be classified as a Summer, a Winter, a Spring, or an Autumn. This can cause confusion, because the color of the hair may be the first thing that strikes the observer's eye (particularly if the hair color is dramatic). Thus, "even though [one palette of] colors work best for [a particular person's] complexion, the individual may look like another Season because of haircoloring....I call this their secondary Season." The color of the hair and eyes serve to heighten the appeal of certain color choices for clothing and makeup, and to rule out certain other choices, but all such choices must be made from within the palette that is compatible with the shade of the skin.
To illustrate this point, Kentner offers the example of a woman whose dramatic hair color suggested that she ought to be an Autumn, but whose skin color made her a Winter. When the woman was "color draped" in swatches from the Winter palette, "she came to life", and looked considerably more attractive than she had been when wearing Autumn colors. However, one of the colors in the palette was incompatible with her hair, and was determined to be inappropriate for her wardrobe.
Winter
Dominant skin characteristics (an individual's skin may include more than one): "cool with rose undertones"; "may appear almost white, yet the skin will be a bit darker than the very pale-skinned 'Summer'"; "not the translucent look that a 'Summer' person has"; "Rosy cheeks will not appear naturally on a 'Winter' person"; "Dark-skinned 'Winters' are usually olive-skinned with a blue undertone."
Summer
Dominant skin characteristics (an individual's skin may include more than one): "very pale"; "It is the Summer person's lot in life to never have a suntan"; "transparent"; "fine-textured"; "light with a rosy-red or lilac undertone that does not come to the surface"; "not prone to blushing"; "The overall look of a 'Summer' is colorless".
Spring
Dominant skin characteristics (an individual's skin may include more than one): "Light amber with gold tones"; "darker suntanned look with a yellow undercast"; "There is a tendency to blush easily"; "often very rosy"; "there is a lively appearance to skin-tone"; "The overall appearance of 'Spring' is 'Radiance'".
Autumn
Dominant skin characteristics (an individual's skin may include more than one): "gold or yellow undertone"; "more gold or orange-toned than a 'Spring'"; "Bronze".
The Suzanne Caygill Method
An analyst trained in this system relies on an in-person interview which reveals a range of clues. The most important indicators are the color, light, texture and pattern found in the skin, hair and eyes. Texture, color contrast levels, movement patterns, and facial and body characteristics are secondary indicators that help to determine basic seasonal type and subgroup within the season. Experienced practitioners also often observe predictable personality types and preferences that correspond to a person's seasonal group.
Winter
The palette includes colors that are pure pigments, or pigments with added black, or with so much white added as to create an icy, frosted pastel.
Spring
Palette colors are usually clear washes or tints, pigments that have white or water added.
Summer
These complex palettes may have a blend of black, white, grey or brown added to their pure pigments, creating a wide range of subtle differences.
Autumn
The palette is dominated by undertones of natural brown pigment, which may range from ochre, umber, or burnt sienna to browns darkened with black.
With this system, almost any color can be found within each season, and many palettes include a combination of both warm and cool tones. The result is nuanced, individualized and unique to each person. The outcome of the analysis is a palette of fabric samples which complement each other and reflect the client. They can then be used as a guide to simplify selection of clothing and accessories and may also be used in choosing home and office interior colors, fabrics and designs.
Carole Jackson, Color Me Beautiful (1980)
The most successful book on seasonal color analysis was Carole Jackson's Color Me Beautiful. The book was a 1980s pop-culture phenomenon and spawned a number of related sequels, including Jackson's own Color Me Beautiful Makeup Book, and Color for Men, as well as titles in the same line by other authors. Jackson utilized a seasonal color system less complicated than Caygill's, and sought to assist each reader to find her own "thirty special colors."
Carole Jackson was the first of the "color analysis authors" to create a retail success story based on her highly successful books, selling swatch packets (a wallet designed to house fabric swatches by season) for use as a shopping companion, a successful line of cosmetics and seasonal color swatches Color Me Beautiful, and a direct selling company Color Me Direct featuring Color Analysis as its key home selling strategy. Most recently Color Me Beautiful has acquired the Color Alliance system which employs the use of color coordinates, designed to match eye color, skin tone and hair color; and through the use of computer modeling creates a unique color palette for each user.
Winter
Dominant skin tones (an individual's skin may include more than one): "Very white", "White with delicate pink tone", "Beige (no cheek color, may be sallow)", "Gray-beige or brown", "Rosy beige", "Olive", "Black" (blue undertone)", "Black (sallow)".
Summer
Dominant skin tones (an individual's skin may include more than one): "Pale beige with delicate pink cheeks", "Pale beige with no cheek color (even sallow)", "Rosy beige", "Very pink", "Gray-brown", "Rosy brown".
Spring
Dominant skin tones (an individual's skin may include more than one): "Creamy ivory", "Ivory with pale golden freckles", "Peach", "Peach/pink (may have pink/purple knuckles)", "Golden beige", "Rosy cheeks (may blush easily)", "Golden brown."
Autumn
Dominant skin tones (an individual's skin may include more than one): "Ivory", "Ivory with freckles (usually redhead)", "Peach", "Peach with freckles (usually golden blonde, brown)", "Golden beige (no cheek color, needs blush)", "dark beige, coppery", "Golden brown."
Mary Spillane and Christine Sherlock, Color Me Beautiful's Looking Your Best
Spillane and Sherlock introduced an expanded classification system, in which the four "seasonal" palettes were expanded to twelve.
Veronique Henderson and Pat Henshaw
Henderson and Henshaw combine the seasonal analysis method with a classification system based on contrasts in an individual's coloring, returning to the previous color study from Doris Pooser in the early 1990s.
Other Color Analysis Systems
Seasonal color analysis is not the only color analysis system out there. Other color systems base their methodology on Munsell's color system of chroma, temperature and hue.
Systems of contrast analysis
In an attempt to move away from the complexities involved in seasonal color systems, some authors have suggested that it is possible to achieve attractive results by focusing instead on the level of contrast between a person's skin tone and their hair and eye colors.
Donna Cognac, Essential Colors
The principles of repeating one's contrast level as well as the color temperatures and intensities that complement their personal coloring are combined in a system developed by Donna Cognac. It relates 16 different color harmonies to the energy of nature's five elements: Water, Wood, Fire, Earth, and Metal. Palettes are various combinations of these five elemental energies. For example, any palette with a very bright appearance or a very warm overall color temperature is a Fire palette to one degree or another and is consistent with the essence of the wearer.
Joanne Nicholson and Judy Lewis-Crum, Color Wonderful (1986)
Another method of analysis was developed by color consultants Joanne Nicholson and Judy Lewis-Crum, whose 1986 book Color Wonderful explains their classification system, which is based on the amount of contrast in an individual's coloring.
Alan Flusser, Dressing the Man (2002)
Flusser lays out two relatively simple rules:
The degree of contrast between the wearer's skin and his / her hair and eyes should be reflected in the degree of contrast between the colors in his / her clothes. "[The] great variety of shadings ... can be scaled down into two basic formats: contrast or muted. If your hair is dark and your skin light, you have a contrast format. If your hair and skin tone are similar, your complexion would be considered muted or tonal." A high-contrast individual should dress in clothes with highly contrasting colors. The result will be that the "high-contrast format [of the clothing] actually invites the eye to look at [the wearer's] face because of its compatibility with his [dark] hair and light skin." By contrast, "Encasing a low-intensity complexion within a higher-contrast setting dilutes the face's natural pigmentation in addition to distracting the viewer's eye."
One or more of the tones in the skin and hair should be repeated in an article of clothing near the face. One option is to repeat the color of the hair in a jacket, tie or scarf, in order to "frame" the face: "The obvious choice of suit shade would be that which repeated his hair color, thereby drawing the observer's attention to what was bracketed in between--in other words, his face." Flusser uses a series of photos of models to demonstrate that it is possible to achieve attractive results by repeating the eye color or the skin tones in clothing articles that are close to the face, and that it is even more desirable to use several colors in the clothes to match some combination of skin / hair / eye colors.
Color psychology
Color psychology, an extension of color analysis, is a valuable tool that is used in conjunction with the analysis of colors. In reality, the psychological connotation of a color has nothing to do with its effect upon the color of one's face or the results in the mirror. It is necessary to consider both the physical impact color has upon your appearance, and the impact a color has upon the unique persona that one projects to the world.
See also
Color-blocking
References
Fashion
Analysis
Color of clothing |
Rochelle Paula Walensky (nΓ©e Bersoff; born April 5, 1969) is an American physician-scientist who served as the director of the U.S. Centers for Disease Control and Prevention from 2021 to 2023 and had also served as the administrator of the Agency for Toxic Substances and Disease Registry in her capacity as the director of the U.S. Centers for Disease Control and Prevention from 2021 to 2023. On May 5, 2023, she announced her resignation, effective June 30, 2023. Prior to her appointment at the CDC, she had served as the chief of the Division of Infectious Diseases at Massachusetts General Hospital and a professor of medicine at Harvard Medical School. Walensky is an expert on HIV/AIDS.
Early life and education
Walensky was born Rochelle Paula Bersoff in Peabody, Massachusetts, to Edward Bersoff and Carol Bersoff-Bernstein. Her family is Jewish. She was raised in Potomac, Maryland. Walensky graduated high school from Winston Churchill High School in 1987.
In 1991, Walensky received a Bachelor of Arts in biochemistry and molecular biology from Washington University in St. Louis. In 1995, she received an Doctor of Medicine from Johns Hopkins School of Medicine. From 1995 to 1998, she trained in internal medicine at Johns Hopkins Hospital. Walensky then became a fellow in the Massachusetts General Hospital/Brigham and Women's Hospital Infectious Diseases Fellowship Program. In 2001, she earned an MPH in clinical effectiveness from the Harvard School of Public Health.
Academic career
Walensky had been on the faculty of Harvard Medical School since 2001, first as an instructor, then as a professor. Walensky was a professor of medicine at Harvard Medical School from 2012 to 2020, and served as chief of the division of infectious diseases at Massachusetts General Hospital from 2017 to 2020. She conducted research on vaccine delivery and strategies to reach underserved communities. Walensky has worked to improve HIV screening and care in South Africa, led health policy initiatives, and researched clinical trial design and evaluation in a variety of settings.
Walensky was chair of the Office of AIDS Research Advisory Council at the National Institutes of Health from 2014 to 2015 and has served as a member of the US Department of Health and Human Services Panel on Antiretroviral Guidelines for Adults and Adolescents since 2011. She serves on the board of directors of Mass General Brigham. She has been co-director of the Medical Practice Evaluation Center at Massachusetts General Hospital since 2011.
COVID-19
Walensky was among the first to sign the John Snow Memorandum in October 2020 as a critical response to the Great Barrington Declaration.
In a paper published in Health Affairs in November 2020, Walensky and her co-authors showed that the effectiveness of a COVID-19 vaccine will be strongly affected by:
The speed with which the vaccine is produced and administered. Some of the potential vaccines have logistical challenges including the need for ultra-cold storage or requiring two doses.
The willingness of people to be vaccinated.
The pandemic's severity when the vaccine is introduced.
CDC director
President-elect Joe Biden announced Walensky's presumptive appointment as CDC director on December 7, 2020, during the presidential transition. Doctors and public health experts widely praised the choice. As the position of director of the CDC does not require Senate confirmation to take office, Walensky's tenure at the CDC began on January 20, 2021.
On August 3, 2021, Walensky instituted a 60-day extension of a federal COVID-related ban, which had just expired, on landlords evicting their tenants. The extended ban applied only to "counties experiencing substantial and high levels of community transmission levels", but under the criteria of the ban this covered an area holding 90% of the U.S. population. On August 26, as was widely expected, the U.S. Supreme Court struck down the extension as unconstitutional, ruling that only the U.S. Congress had the authority to issue such a moratorium.
As the pandemic entered the Omicron variant wave, Walensky acknowledged that officials on the CDC response team were burned out, and tried to reassign workers. Walensky and other top officials had a plan to dissolve large parts of the pandemic response team, which has more than 1,500 staffers, and reassign members to their original posts. Walensky shelved the plan with the emergence of Omicron as cases began to tick up across the U.S., bringing morale lower than ever at the CDC. However, Ashish Jha says, "Dr. Walensky inherited a really messy organization with some real strengths but also a lot of problems."
In a January 18, 2022 interview with The Boston Globe Walensky responded to some of the criticisms of her first year in office.
Her critics told the Globe that she has confused the public on issues like quarantine guidance, school reopening, and mask-wearing. "What weβre seeing is policy failures, accompanied by poor messaging," said Anne N. Sosin, a public health researcher at Dartmouth College, who added that the rest of the administration is also to blame. Critics said that the CDC was prioritizing the economy over public health. The American Medical Association criticized her December 27 guidance to shorten the COVID isolation period from ten to five days and to let people who contracted COVID leave isolation without a negative test. Former CDC Director Dr. Tom_Frieden commented on her messaging around the change in guidance, saying βI think the way they were released was very problematic.β
Walensky described her critics as "naysayers" who have helped sow the public confusion she has been accused of creating and pointing out that many Americans are still not following the most basic guidance on COVID-19 prevention. She also said, "Weβre making decisions in imperfect times, sometimes without all the data that we would like to make them.β Walensky said she is working with a messaging coach and she is listening to her critics. She said that better communication is not always possible. "Some of this is not based on the messaging because, 'Wear a mask' is about as crystal clear as you could be. And still we have much of America not doing it. So some of the really easy stuff is not being followed, and some of the harder stuff is actually complicated science."
During a January 26, 2022 news conference about the rise of the Omicron variant and high hospitalization rates, Dr. Walensky said the nation should not ease up on COVID-19 safety protocols, saying, "Milder does not mean mild and we cannot look past the strain on our health systems and substantial number of deaths." She also said, "It's important to remember we're still facing a high overall burden of disease."
In April 2022, Dr. Walensky announced CDC was undergoing an external review following its mishandling of the pandemic. On August 17, 2022, she delivered a sweeping rebuke of her agencyβs handling of the coronavirus pandemic, saying it had failed to respond quickly enough and needed to be overhauled.
In October 22, 2022, Dr. Walensky tested positive for COVID-19.
In November 29, 2022, Dr. Walensky marked the 50th year of the Tuskegee Syphilis Study, and said that she would be meeting with colleagues and leaders in public health the following day, with a commitment to "ethical research & practice". Her comments that the 623 African-American study participants would be honored for their "suffering & sacrifice" was criticized by social media users, including those within Black Twitter, and other commentators as racist, while some users came to the defense of Walensky. Walensky later tweeted, on November 30, that she reflected on the Tuskegee study, that the men who were subjects in the study were "honored", that "their pain & that of their families" was acknowledged, and stated that the legacy of the study's participants "lives on...[and] must never be forgotten."
On May 5, 2023, Dr. Walensky announced her resignation from her role at the CDC, effective June 30, 2023. Her decision came as the Biden administration was preparing to end the nation's national health emergency status around COVID, and she was one of multiple administration officials to leave after working on the pandemic.
Personal life
Walensky is married to Loren D. Walensky, also a physician-scientist. They have three sons. They are Jewish and members of Temple Emanuel in Newton, Massachusetts.
Selected works and publications
References
External links
1969 births
Living people
21st-century American women physicians
21st-century American physicians
21st-century American women scientists
American medical researchers
Biden administration personnel
Directors of the Centers for Disease Control and Prevention
Harvard Medical School faculty
Harvard T.H. Chan School of Public Health alumni
HIV/AIDS researchers
Jewish American scientists
Jewish physicians
Johns Hopkins School of Medicine alumni
Massachusetts General Hospital faculty
People from Peabody, Massachusetts
Physicians from Maryland
Physicians from Massachusetts
Scientists from Maryland
Washington University in St. Louis alumni
Women medical researchers
Members of the National Academy of Medicine |
Alfred Luff (5 April 1846 β 24 February 1933) was an English cricketer. Luff was a right-handed batsman who bowled right-arm roundarm fast. He was born at Kew, Surrey.
Luff made three first-class appearances for Surrey in 1867, the first of which came against Yorkshire at The Oval. His second appearance came against the Marylebone Cricket Club at The Oval, while his third appearance came against Yorkshire at Bramall Lane, Sheffield. He scored 25 runs in his three matches, at an average of 5.00 and a high score of 8. With the ball, he took 2 wickets at a bowling average of 55.50, with best figures of 1/25. He later stood as an umpire in two first-class matches in 1874, between the Gentlemen of the South and the Players of the North, and the Gentlemen against the Players. He also stood in six Minor Counties Championship matches between 1898 and 1902.
He died at Tonbridge, Kent, on 24 February 1933.
References
External links
Alfred Luff at ESPNcricinfo
Alfred Luff at CricketArchive
1846 births
1933 deaths
People from Kew, London
Sportspeople from the London Borough of Richmond upon Thames
English cricketers
Surrey cricketers
English cricket umpires |
```html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "path_to_url">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (1.8.0_152-release) on Thu Jun 28 11:01:15 BST 2018 -->
<title>C-Index</title>
<meta name="date" content="2018-06-28">
<link rel="stylesheet" type="text/css" href="../stylesheet.css" title="Style">
<script type="text/javascript" src="../script.js"></script>
</head>
<body>
<script type="text/javascript"><!--
try {
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="C-Index";
}
}
catch(err) {
}
//-->
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar.top">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.top.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../org/mozilla/mentat/package-summary.html">Package</a></li>
<li>Class</li>
<li><a href="../overview-tree.html">Tree</a></li>
<li><a href="../deprecated-list.html">Deprecated</a></li>
<li class="navBarCell1Rev">Index</li>
<li><a href="../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="index-2.html">Prev Letter</a></li>
<li><a href="index-4.html">Next Letter</a></li>
</ul>
<ul class="navList">
<li><a href="../index.html?index-files/index-3.html" target="_top">Frames</a></li>
<li><a href="index-3.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_top");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<a name="skip.navbar.top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<div class="contentContainer"><a href="index-1.html">A</a> <a href="index-2.html">B</a> <a href="index-3.html">C</a> <a href="index-4.html">D</a> <a href="index-5.html">E</a> <a href="index-6.html">F</a> <a href="index-7.html">G</a> <a href="index-8.html">H</a> <a href="index-9.html">I</a> <a href="index-10.html">J</a> <a href="index-11.html">L</a> <a href="index-12.html">M</a> <a href="index-13.html">O</a> <a href="index-14.html">Q</a> <a href="index-15.html">R</a> <a href="index-16.html">S</a> <a href="index-17.html">T</a> <a href="index-18.html">U</a> <a href="index-19.html">V</a> <a name="I:C">
<!-- -->
</a>
<h2 class="title">C</h2>
<dl>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/Mentat.html#cache-java.lang.String-org.mozilla.mentat.CacheDirection-">cache(String, CacheDirection)</a></span> - Method in class org.mozilla.mentat.<a href="../org/mozilla/mentat/Mentat.html" title="class in org.mozilla.mentat">Mentat</a></dt>
<dd>
<div class="block">Add an attribute to the cache.</div>
</dd>
<dt><a href="../org/mozilla/mentat/CacheDirection.html" title="enum in org.mozilla.mentat"><span class="typeNameLink">CacheDirection</span></a> - Enum in <a href="../org/mozilla/mentat/package-summary.html">org.mozilla.mentat</a></dt>
<dd> </dd>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/TxChange.html#changes">changes</a></span> - Variable in class org.mozilla.mentat.<a href="../org/mozilla/mentat/TxChange.html" title="class in org.mozilla.mentat">TxChange</a></dt>
<dd> </dd>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/TxChange.html#changes_len">changes_len</a></span> - Variable in class org.mozilla.mentat.<a href="../org/mozilla/mentat/TxChange.html" title="class in org.mozilla.mentat">TxChange</a></dt>
<dd> </dd>
<dt><a href="../org/mozilla/mentat/CollResult.html" title="class in org.mozilla.mentat"><span class="typeNameLink">CollResult</span></a> - Class in <a href="../org/mozilla/mentat/package-summary.html">org.mozilla.mentat</a></dt>
<dd>
<div class="block">Wraps a `Coll` result from a Mentat query.</div>
</dd>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/CollResult.html#CollResult-org.mozilla.mentat.JNA.TypedValueList-">CollResult(JNA.TypedValueList)</a></span> - Constructor for class org.mozilla.mentat.<a href="../org/mozilla/mentat/CollResult.html" title="class in org.mozilla.mentat">CollResult</a></dt>
<dd> </dd>
<dt><a href="../org/mozilla/mentat/CollResultHandler.html" title="interface in org.mozilla.mentat"><span class="typeNameLink">CollResultHandler</span></a> - Interface in <a href="../org/mozilla/mentat/package-summary.html">org.mozilla.mentat</a></dt>
<dd>
<div class="block">Interface defining the structure of a callback from a query returning a <a href="../org/mozilla/mentat/CollResult.html" title="class in org.mozilla.mentat"><code>CollResult</code></a>.</div>
</dd>
<dt><a href="../org/mozilla/mentat/ColResultIterator.html" title="class in org.mozilla.mentat"><span class="typeNameLink">ColResultIterator</span></a> - Class in <a href="../org/mozilla/mentat/package-summary.html">org.mozilla.mentat</a></dt>
<dd>
<div class="block">Iterator for a <a href="../org/mozilla/mentat/CollResult.html" title="class in org.mozilla.mentat"><code>CollResult</code></a></div>
</dd>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/EntityBuilder.html#commit--">commit()</a></span> - Method in class org.mozilla.mentat.<a href="../org/mozilla/mentat/EntityBuilder.html" title="class in org.mozilla.mentat">EntityBuilder</a></dt>
<dd>
<div class="block">Transacts the added assertions and commits.</div>
</dd>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/InProgress.html#commit--">commit()</a></span> - Method in class org.mozilla.mentat.<a href="../org/mozilla/mentat/InProgress.html" title="class in org.mozilla.mentat">InProgress</a></dt>
<dd>
<div class="block">Commits all the transacts that have been performed on this `InProgress`, either directly
or through a Builder.</div>
</dd>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/InProgressBuilder.html#commit--">commit()</a></span> - Method in class org.mozilla.mentat.<a href="../org/mozilla/mentat/InProgressBuilder.html" title="class in org.mozilla.mentat">InProgressBuilder</a></dt>
<dd>
<div class="block">Transacts the added assertions and commits.</div>
</dd>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/ColResultIterator.html#constructItem-org.mozilla.mentat.JNA.TypedValue-">constructItem(JNA.TypedValue)</a></span> - Method in class org.mozilla.mentat.<a href="../org/mozilla/mentat/ColResultIterator.html" title="class in org.mozilla.mentat">ColResultIterator</a></dt>
<dd> </dd>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/RelResultIterator.html#constructItem-org.mozilla.mentat.JNA.TypedValueList-">constructItem(JNA.TypedValueList)</a></span> - Method in class org.mozilla.mentat.<a href="../org/mozilla/mentat/RelResultIterator.html" title="class in org.mozilla.mentat">RelResultIterator</a></dt>
<dd> </dd>
<dt><span class="memberNameLink"><a href="../org/mozilla/mentat/RustError.html#consumeErrorMessage--">consumeErrorMessage()</a></span> - Method in class org.mozilla.mentat.<a href="../org/mozilla/mentat/RustError.html" title="class in org.mozilla.mentat">RustError</a></dt>
<dd>
<div class="block">Get and consume the error message, or null if there is none.</div>
</dd>
</dl>
<a href="index-1.html">A</a> <a href="index-2.html">B</a> <a href="index-3.html">C</a> <a href="index-4.html">D</a> <a href="index-5.html">E</a> <a href="index-6.html">F</a> <a href="index-7.html">G</a> <a href="index-8.html">H</a> <a href="index-9.html">I</a> <a href="index-10.html">J</a> <a href="index-11.html">L</a> <a href="index-12.html">M</a> <a href="index-13.html">O</a> <a href="index-14.html">Q</a> <a href="index-15.html">R</a> <a href="index-16.html">S</a> <a href="index-17.html">T</a> <a href="index-18.html">U</a> <a href="index-19.html">V</a> </div>
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar.bottom">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.bottom.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../org/mozilla/mentat/package-summary.html">Package</a></li>
<li>Class</li>
<li><a href="../overview-tree.html">Tree</a></li>
<li><a href="../deprecated-list.html">Deprecated</a></li>
<li class="navBarCell1Rev">Index</li>
<li><a href="../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="index-2.html">Prev Letter</a></li>
<li><a href="index-4.html">Next Letter</a></li>
</ul>
<ul class="navList">
<li><a href="../index.html?index-files/index-3.html" target="_top">Frames</a></li>
<li><a href="index-3.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_bottom");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<a name="skip.navbar.bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
``` |
```java
/*
All rights reserved. Use is subject to license terms.
This program is free software; you can redistribute it and/or modify
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
package testsuite.clusterj.tie;
public class TimestampAsSqlTimestampTypesTest extends testsuite.clusterj.TimestampAsSqlTimestampTypesTest {
}
``` |
Lucille May Grace (October 3, 1900 β December 22, 1957) was an American politician who was the Louisiana Register of State Lands from 1931 to 1952 and again from 1956 to 1957. She was the state's first female statewide elected officeholder and first female gubernatorial candidate.
Biography
Born in Plaquemine, she graduated from Academy of the Sacred Heart, Grand Coteau, and received a Bachelor of Arts degree from the Louisiana State University, where she was the first female freshman treasurer.
After the death of her father, Fred J. Grace, on September 9, 1931, she was appointed to succeed him as Louisiana Register of State Lands by Governor Huey Long, before being elected in every leap-year election from 1932 to 1956 (except 1952). She also ran in the 1952 Louisiana gubernatorial election, making her the state's first female gubernatorial candidate.
After her unsuccessful gubernatorial bid in 1952, she took over her old position from Ellen Bryan Moore in 1956 before her death in Baton Rouge the next year. Her husband ran for the office in 1959 but Moore retained the seat.
She had one son with her husband Fred C. Dent. Despite being married, she kept her maiden name in order to maintain her recognition.
She was posthumously inducted to the Louisiana Center for Women in Government and Business Hall of Fame in 1995 and the Louisiana Political Museum and Hall of Fame in 2011.
Bibliography
Garry Boulard, The Big Lie: Hale Boggs, Lucille May Grace and Leander Perez in 1951, Gretna, Louisiana: Pelican Publishing, 2001
See also
List of the first women holders of political offices in North and Central America and the Caribbean
Notes
References
1900 births
1957 deaths
People from Plaquemine, Louisiana
Louisiana Democrats
Registers of the State Land Office of Louisiana
Politicians from Baton Rouge, Louisiana
Louisiana State University alumni
Women in Louisiana politics
20th-century American politicians
Burials in Louisiana
20th-century American women politicians |
Calliethilla is a genus of flies in the family Tachinidae.
Species
Calliethilla caerulea Shima, 1979
Calliethilla hirta Cerretti, 2012
References
Tachinidae
Brachycera genera
Diptera of Africa
Diptera of Asia |
Mathys Zyn Loop is a town in Nkangala District Municipality in the Mpumalanga province of South Africa.
References
Populated places in the Thembisile Hani Local Municipality |
The following elections occurred in the year 1871.
1871 Chilean presidential election
1871 New Zealand general election
Africa
French legislative election in Algeria
general election in Liberia
French legislative election in Senegal
Europe
1871 Dutch general election
July 1871 French by-elections
February 1871 French legislative election and July 1871 French by-elections
1871 German federal election
1871 Portuguese legislative election
elections in Spain
UK:
1871 Dover by-election
January and April 1871 Durham City by-election
1871 East Surrey by-election
1871 Galway County by-election
1871 Halifax by-election
1871 Hereford by-election
1871 Limerick City by-election
1871 County Limerick by-election
1871 Meath by-election
1871 Monaghan by-election
1871 Monmouthshire by-election
1871 Newry by-election
1871 Norwich by-election
1871 Plymouth by-election
1871 Ripon by-election
1871 South Norfolk by-election
1871 Stalybridge by-election
1871 Tamworth by-election
1871 Truro by-election
1871 West Norfolk by-election
1871 West Staffordshire by-election
1871 Westmeath by-election
1871 Westmorland by-election
1871 York by-election
North America
Canada
1871 British Columbia general election
1871 Nova Scotia general election
1871 Ontario general election
1871 Quebec general election
By-elections to the 1st Canadian Parliament
United States
California:
1871 United States House of Representatives elections in California
1871 California gubernatorial election
Georgia: US Senate special elections
Illinois:
1871 Chicago mayoral election
Illinois's at-large congressional district special election
Kansas: US Senate election
Kentucky: US Senate election
Massachusetts: US Senate election
Michigan: US Senate election
Minnesota:
US Senate election
US Senate special election
gubernatorial election
New Hampshire: US House of Representatives elections
New Jersey: gubernatorial election
New York: state election
Texas:
US House of Representatives elections
US Senate election
Virginia: US Senate election
West Virginia: US Senate election
See also
:Category:1871 elections
1871
Elections |
The 2014 European Parliament election in Austria was held on 25 May 2014 in Austria. As a result of the Lisbon Treaty Austria held 19 seats in the European Parliament, but with Croatia joining the Union in 2013, Austria's allocation was reduced to 18 seats.
Background
Three Members of the European Parliament (MEPs) decided to stand in the election again, but not for their original parties. They are Martin Ehrenhauser (former member of Hans-Peter Martin's List), Ewald Stadler (formerly top candidate for the Alliance for the Future of Austria) and Angelika Werthmann (former member of Hans-Peter Martin's List).
Ehrenhauser is now top candidate for the left-wing electoral alliance "Europe Different" (Europa Anders), which includes the Communists and the Pirate Party.
Stadler founded the eurosceptic "Reform Conservatives" (Die Reformkonservativen, REKOS), who intend to join the Europe of Freedom and Democracy group in European Parliament.
Angelika Werthmann, who was part of the ALDE group between 2012 and 2014, had originally planned to contest the election for NEOS, but in early 2014 she claimed that "the buying of votes" had occurred at the NEOS party caucus for the 2013 national election. She withdrew her NEOS-candidacy for the 2014 European election in January 2014. The Alliance for the Future of Austria (BZΓ) initially planned to field Ulrike Haider-Quercia, daughter of the late party founder JΓΆrg Haider, as their frontrunner. She withdrew on 8 April, complaining that the party would not accept her "independent policy". Instead of her, the BZΓ's new top candidate is Angelika Werthmann. She was also excluded from the liberal ALDE group in the European Parliament after joining the BZΓ.
The new liberal party NEOS (represented in the national parliament since 2013) is contesting the election. Angelika Mlinar was elected as its top candidate after its caucus in February 2014.
Team Stronach, another successful new party in the 2013 national election, announced on 8 April 2014 that they would not contest the election.
On 25 March 2014 MEP Hans-Peter Martin, the leader of Hans-Peter Martin's List, announced that he would no longer be contesting European Elections.
A small party called "EU-STOP" also managed to collect the 2600 signatures necessary to be included on the election ballot. Their main goal is Austria's exit from the EU resulting in a fully neutral and self-determined country, a return to the Austrian Schilling and strict border controls to limit cross-border crime.
Electoral system
Voters who so chose were allowed to cast their vote either by absentee ballot or postal ballot. Postal ballots had to arrive at the district voting commission no later than 5Β pm on election day. Before the 2009 election, 309,200 voters requested absentee or postal ballots. For the 2014 election, the number was 444,057.
According to the final figures, a total of 6,410,602 people were eligible to vote in this election, an increase from 6,362,761 people in the 2009 election. 3,322,498 women (2009: 3,314,816) and 3,088,104 men (2009: 3,047,945) were eligible to vote. Included in these totals are 34,773 Austrians living abroad and 33,184 foreign EU-citizens living in Austria.
Poll opening and closing times on election day were set individually by each municipality. Poll closing times can be no later than 17:00.
Contesting parties
There were 9 parties contesting the election. They are ranked here as they appeared on the ballot paper:
ΓVP β (Γsterreichische Volkspartei β Liste Othmar Karas) β Austrian People's Party
SPΓ β (Sozialdemokratische Partei Γsterreichs) β Social Democratic Party of Austria
FPΓ β (Freiheitliche Partei Γsterreichs (FPΓ) β Die Freiheitlichen) β Freedom Party of Austria
GRΓNE β (Die GrΓΌnen β Die GrΓΌne Alternative) β The Greens β The Green Alternative
BZΓ β (BZΓ β Liste Mag. Werthmann) β Alliance for the Future of Austria
NEOS β (NEOS Das Neue Γsterreich und Liberales Forum) β NEOS β The New Austria
REKOS β (Die Reformkonservativen β Liste Ewald Stadler) β The Reform Conservatives
ANDERS β (Europa Anders β KPΓ, Piratenpartei, Wandel und UnabhΓ€ngige) β Europe Different (Communist Party of Austria, Pirate Party of Austria, The Change and independents)
EUSTOP β (EU-Austritt, Direkte Demokratie, NeutralitΓ€t, EU-Stop) β EU Stop
Opinion polls
Results
References
Austria
European Parliament elections in Austria
Europe |
Highland is an unincorporated community in Cinque Hommes Township in Perry County, Missouri, United States.
History
Highland's name is topographical and was named after a nearby creek. It is located in the north-central part of Cinque Hommes Township. A post office was maintained there between 1891 β 1904.
The community has a Catholic church, St. Joseph parish, which was founded in 1870.
Geography
Highland is located four and one-half miles southwest of Perryville.
Notable person
Vincent Joseph Dunker (1878β1974), a photographer, inventor, and camera manufacturer was born in Highland, Missouri
References
Unincorporated communities in Perry County, Missouri
Unincorporated communities in Missouri |
Events from the year 1896 in Canada.
Incumbents
Crown
Monarch β Victoria
Federal government
Governor General β John Hamilton-Gordon
Prime Minister β Mackenzie Bowell (until April 27) then Charles Tupper (May 1 to July 8) then Wilfrid Laurier (from July 11)
Chief Justice β Samuel Henry Strong (Ontario)
Parliament β 7th (until 24 April) then 8th (from 19 August)
Provincial governments
Lieutenant governors
Lieutenant Governor of British Columbia β Edgar Dewdney
Lieutenant Governor of Manitoba β James Colebrooke Patterson
Lieutenant Governor of New Brunswick β John James Fraser (until November 24) then Jabez Bunting Snowball (from December 9)
Lieutenant Governor of Nova Scotia β Malachy Bowes Daly
Lieutenant Governor of Ontario β George Airey Kirkpatrick (until November 7) then Casimir Gzowski
Lieutenant Governor of Prince Edward Island β George William Howlan
Lieutenant Governor of Quebec β Joseph-Adolphe Chapleau
Premiers
Premier of British Columbia β John Herbert Turner
Premier of Manitoba β Thomas Greenway
Premier of New Brunswick β Andrew George Blair (until July 17) then James Mitchell
Premier of Nova Scotia β William Stevens Fielding (until July 18) then George Henry Murray (from July 20)
Premier of Ontario β Oliver Mowat (until July 25) then Arthur Sturgis Hardy
Premier of Prince Edward Island β Frederick Peters
Premier of Quebec β Louis-Olivier Taillon (until May 11) then Edmund James Flynn
Territorial governments
Lieutenant governors
Lieutenant Governor of Keewatin β James Colebrooke Patterson
Lieutenant Governor of the North-West Territories β Charles Herbert Mackintosh
Premiers
Chairman of the Executive Committee of the North-West Territories β Frederick Haultain
Events
April 27 β Sir Mackenzie Bowell resigns as Prime Minister due to cabinet infighting. He is replaced by Sir Charles Tupper.
May 1 β Sir Charles Tupper becomes prime minister, replacing Sir Mackenzie Bowell
May 11 β Edmund Flynn becomes Premier of Quebec, replacing Sir Louis-Olivier Taillon
May 26 β A bridge collapse in Victoria, British Columbia kills 55 people
June 23 β Federal election: Wilfrid Laurier's Liberals win a majority, defeating Sir Charles Tupper's Conservatives. One of the key issues in the campaign has been the Manitoba Schools Question
July 11 β Wilfrid Laurier becomes prime minister, replacing Sir Charles Tupper
July 20 β George Henry Murray becomes premier of Nova Scotia, replacing William Fielding
July 25 β Arthur S. Hardy becomes premier of Ontario, replacing Sir Oliver Mowat
July β James Mitchell becomes premier of New Brunswick, replacing Andrew Blair
August 17 β Gold is discovered in the Yukon, prompting the Klondike gold rush
Full date unknown
A plan to populate the western prairies with immigration from eastern Europe is unveiled
The first Canadian blast furnace opens in Hamilton, Ontario
Sport
February 14 β Winnipeg Victorias win their first Stanley Cup by defeating Montreal Victorias 2 goals to 0 at Montreal's Victoria Skating Rink
Births
January to June
March 8 β Charlotte Whitton, feminist, politician and mayor of Ottawa (d.1975)
March 16 β Harry Banks, soldier
March 21 β Errick Willis, politician (d.1967)
April 11 β LΓ©o-Paul Desrosiers, journalist, writer (d.1967)
April 20 β Wilfrid R. "Wop" May, World War I flying ace and pioneering bush pilot (d.1952)
May 2 β Elmore Philpott, journalist and politician (d.1964)
May 18 β Brock Chisholm, doctor and first Director-General of the World Health Organization (d.1971)
June 22 β Leonard W. Murray, naval officer (d.1971)
July to December
July 2 β Prudence Heward, painter (d.1947)
July 4 β Frederick Cronyn Betts, politician (d.1938)
July 10 β ThΓ©rΓ¨se Casgrain, feminist, reformer, politician and Senator (d.1981)
July 27 β Anne Savage, painter and art teacher (d.1971)
August 12 β Mitchell Hepburn, politician and 11th Premier of Ontario (d.1953)
August 18 β Jack Pickford, actor (d.1933)
August 30 β Raymond Massey, actor (d.1983)
August 31 β Alice Strike, Canada's last surviving female World War I veteran (d.2004)
November 3 β Madeleine Fritz, paleontologist
November 7 β Henry Botterell, World War I fighter pilot (d.2003)
Deaths
January 14 β Christopher William Bunting, politician, merchant, newspaper owner and newspaper publisher (b.1837)
February 20 β Hart Massey, businessman and philanthropist (b.1823)
April 13 β John Christian Schultz, politician and Lieutenant-Governor of Manitoba (b.1840)
May 4 β Timothy Anglin, politician and Speaker of the House of Commons of Canada (b.1822)
June 7 β Wyatt Eaton, painter (b.1849)
June 10 β Donald Alexander Macdonald, politician (b.1817)
June 19 β John Beverley Robinson, politician (b.1821)
June 25 β Samuel Leonard Tilley, Premier of New Brunswick (b. 1818)
November 24 β John James Fraser, lawyer, judge, politician and 4th Premier of New Brunswick (b.1829)
Anne Hill, dancer and actor (b. 1804)
Historical documents
Summary of Canada's imperial history and description of Governor General's Historical Ball
Joshua Slocum sails Cape Horn solo on his globe-circling voyage
Visitor describes constant boat traffic on the Muskoka Lakes, Ontario
References
Years of the 19th century in Canada
Canada
1896 in North America |
The Battle of Tarczek took place on 13 February 1241, during the first Mongol invasion of Poland. It ended in the defeat of the Polish armies of Lesser Poland.
In March 1241, after a successful winter campaign, in which Mongol forces captured and ransacked Sandomierz, Asiatic hordes entered Poland in full force. Near Sandomierz, the Mongol forces were divided into two groups. The stronger one, probably with 15,000 warriors under Baidar and Orda Khan, headed westwards, defeating Poles in the Battle of Chmielnik. The second army, with 10,000 warriors under Kadan (according to Jan DΕugosz) headed northwards, to the Land of ΕΔczyca and Kujawy. On 19 March 1241 this army clashed with Polish knights near Tarczek. Most likely, the Polish forces which participated in the battle, were knights from Lesser Poland, survivors of the Battle of Chmielnik. They were defeated, and Tarczek itself was burned to the ground.
After the battle, the Mongols ransacked central Poland for a few more days. On 1 April 1241 they appeared in KrakΓ³w, and on 8 April they reached WrocΕaw, where they joined the army of Baidar.
Sources
Piastowie. Leksykon biograficzny, wyd. 1999, str. 397
Wielka Historia Polski cz. do 1320, wyd. Pinexx 1999, s. 187-188
Stanislaw Krakowski, Polska w walce z najazdami tatarskimi w XIII wieku, wyd. MON 1956, str.136-137
Conflicts in 1241
1241 in Europe
Tarczek
Tarczek |
```go
package extension
import (
"github.com/ethereum/go-ethereum"
"github.com/ethereum/go-ethereum/core/types"
"github.com/ethereum/go-ethereum/ethclient"
"github.com/ethereum/go-ethereum/log"
"github.com/ethereum/go-ethereum/node"
"github.com/ethereum/go-ethereum/private"
)
type subscriptionHandler struct {
facade ManagementContractFacade
client Client
service *PrivacyService
}
func NewSubscriptionHandler(node *node.Node, psi types.PrivateStateIdentifier, ptm private.PrivateTransactionManager, service *PrivacyService) *subscriptionHandler {
rpcClient, err := node.AttachWithPSI(psi)
if err != nil {
panic("extension: could not connect to ethereum client rpc")
}
client := ethclient.NewClientWithPTM(rpcClient, ptm)
return &subscriptionHandler{
facade: NewManagementContractFacade(client),
client: NewInProcessClient(client),
service: service,
}
}
func (handler *subscriptionHandler) createSub(query ethereum.FilterQuery, logHandlerCb func(types.Log)) error {
incomingLogs, subscription, err := handler.client.SubscribeToLogs(query)
if err != nil {
return err
}
go func() {
stopChan, stopSubscription := handler.service.subscribeStopEvent()
defer stopSubscription.Unsubscribe()
for {
select {
case err := <-subscription.Err():
log.Error("Contract extension watcher subscription error", "error", err)
break
case foundLog := <-incomingLogs:
logHandlerCb(foundLog)
case <-stopChan:
return
}
}
}()
return nil
}
``` |
This article is a list of story arcs for the Marvel Comics comic book series New X-Men.
Grant Morrison's New X-Men
New Mutants (vol. 2)
Back To School
New Mutants Vol.2 Issues #1-6
Former New Mutant Danielle "Dani" Moonstar is convinced to return to the Xavier school as a mutant mentor & recruiter. Dani encounters her first recruit, Sophia Montega, by chance when the young girl is arrested for using her abilities to manipulate the wind in an effort to gain the attention of her neglectful father. Dani offers to take Sofia to the Xavier school to learn to control her abilities. At the school, currently in its summer session, Sofia meets fellow students Laurie Collins (Pheromone Control), Julian Keller (Telekinesis), and Cessily Kincaid (Mercury Metal Form). Professor Xavier accepts Sophia as a new student and enlists Dani to help him recruit other possible students. Dani helps in recruiting additional students Kevin Ford (Organic Decay) and David Alleyn (Telepathic Learning). Dani is also reunited with former New Mutant Xi'an "Shan" Coy Manh who agrees to move back to the school with her younger siblings.
On a recruiting trip to New York to recruit another student, Dani and Shan discover that the last potential student, Josh Foley, may be connected to a mutant-hate group called The Reavers; led by X-Men antagonist Donald Pierce. Pierce and the Reavers plan to kick-nap Sofia's wealthy father as a way to target her and other mutants. When the students stumble into Pierce's trap, a battle ensues. When a Reaver friend falls in battle, Josh unwittingly uses his mutant healing ability to recover him, outing himself as a mutant. As the battle turns in the students favor, Pierce arrives and mortally wounds Laurie Collins. Josh attempts to heal Laurie with his ability, while Kevin, in his anger strikes at Pierce in an effort to kill him by decaying his exposed flesh. Dani, unable to physically stop Kevin, must reluctantly use her mutant ability against him; generating a horrifying illusion that he is attacking Laurie instead of Pierce. This vision causes Kevin to halt his assault. The battle now over, Josh, not accepting he is a mutant, rejects the offer to join the school. Kevin, horrified by Dani's illusion, decides to leave the school, deciding he is better living alone where he cannot hurt others. Kevin's leaving wears heavily on Dani as she feels she has failed him. Josh Foley, upon returning home, finds that he is not welcomed back by his friends or family. He arrives to the school seeking admittance, being paired with a reluctant David Alleyn as a roommate. Dani informs Professor Xavier that she will not continue recruiting and will also leave the school. Before leaving Xavier has her attend a small meeting in his office with her recently recruited students. They are each asked who they would like as a faculty adviser and they all unanimously choose Dani as the person they trust most. This convinces Dani to stay at the school as a teacher/adviser.
The Ties That Bind
New Mutants Vol.2 Issues #7-12
The new students settle into the new semester. David, Sofia, and Laurie have become fast friends, while Josh feels rejected, primarily by David, due to his past as a Reaver. Laurie likes him regardless. Josh becomes friends with Julian and his group of friends. Dani encourages David to forgive and befriend Josh. She also mentions to David she is worried about former New Mutant Amara (Magma) who lies in a coma in the school infirmary. Josh and Julian decide to try to use Josh's healing powers to revive her and become heroes at the school. Amara revives, but quickly breaks out of the school, injuring the school nurse and leaving damage in her wake. The boys receive detention, and as a result, Josh's parents sign over his custody to the school, disowning him. Later, Julian rejects entry to a homeless mutant girl seeking help at the main gate. During parents week, Sofia has a bad encounter with her father, and in a moment of grief, Emma encourages her to switch to her as an adviser, but Dani quickly quashes the idea. Julian continues to run afoul of his adviser Northstar, and asks to be transferred over to Emma. When Julian learns from her that Josh had been a Reaver, he attacks him and David and Sofia come to his defense. Rahne Sinclair returns to the school, free of her Wolf powers, but more wild than before. Laurie Collins crush on Josh grows, but Josh's attention is interrupted by the arrival of Rahne. The students leave campus and discover the mutant Julian previously rejected may be involved in an electrical attack and robbery at the local coffee shop. Dani and Shan agree to look for her, but refuse to involve the students. Rahne feels this is a mistake and enlists them to find the girl first. Josh, David, Sofia, and Laurie leave with Rahne to find the girl. The team finds her buying drugs, but when they approach her, she pleads that she needs them to control her power. She losses control and injures some of the team. The students help to calm her and offer her the school's help. The girl, named Noriko, agrees. Back at Xavier's, Dani chastises Rahne for endangering her students, which Cyclops as headmaster, reinforces. Scott refuses her a teaching position and Rahne decides to leave the school after her visit. Josh befriends Rahne and a physical relationship results. Noriko "Nori" gains gauntlets from Hank McCoy to help control her electrical emissions. David befriends her, but she is reluctant to befriend anyone. At Rahne's request, Josh heals Rahne and her wolf power suddenly returns and she viciously attacks Josh. Laurie discovers them and scares Rahne from the school. With Josh badly injured, Dani and Shan call another healer, Angel, for help, but he is hours away. David and Nori determine that Josh could heal himself if he were awake. Nori shocks him awake as David guides him to heal himself. This works but has the result of turning his skin gold. Rahne is tracked down by Dani and convinced to return to the school. Later, Dani convinces Noriko to work at the coffee shop to make amends and repay the money she had stolen.
X-Men Reload
New Mutants Vol.2 Issue #13
The Xavier school and much of New York has recently been attacked by mutant terrorist Magneto, leaving much in ruins. Former New Mutants Dani, Shan, and Rahne were assigned the task of shuttling the summer students to safety, thereby sitting out the encounter. Donald Pierce, leader of The Reavers, lies in prison awaiting execution, but is given an offer of leniency in exchange for information on Kevin Ford who previously attacked him in New York. During transport to his hearing, Pierce escapes. Many former New Mutants arrive at the school to assess the damage. The FBI inform the team that Pierce has escaped and will likely seek revenge against Kevin Ford or Josh Foley, the former Reaver that betrayed him. The students are hid away from the school grounds, but Josh Foley agrees to return to the school to try to draw Pierce to him. The plan works and as Pierce and his Reavers attack, the New Mutant team quickly jumps to the defense of the school; swiftly defeating Pierce. Their battle complete, Dani considers if her true calling should be as part of an X-Men team vs. remaining with the students.
New X-Men: Academy X
Choosing Sides
Academy X Issues #1-6
Haunted
Academy X Issues #7-11
The students begin to notice mysterious events around the Xavier school. Several students begin encountering haunting voices, the movement and disappearance of items, and other mischievous behavior. The voices keep telling the students that they should leave the school. While many think the pranks are due to a prankster using his mutant powers, after a particularly dangerous encounter in the Danger Room with the students, Dani realizes that the entity might actually be a ghost and she and the students investigate further.
Elsewhere, many of the team leaders enroll in Scott Summers tactical leadership class. Julian demoralizes David in front of the class by indicating that he his power to temporarily absorb knowledge is insignificant in a tactical environment. Scott mentions that David ability to learn the tactics of his opponents could be very valuable for a field leader, but David still feels inadequate. David approaches Emma Frost to help him learn why he is not able to retain any of the knowledge he gains. Emma informs him that his mind has set up blocks as a safety mechanism. With the help of his Emma and his adviser Dani, David explores having Emma remove the blocks so that he may retain the knowledge he absorbs.
X-Posed
Academy X Issues #12-15
The student squads compete for the Prizegiving awards as a damaging secret becomes known to the school. The students are affected to various degrees, and one of the faculty, Rahne, leaves the school as a result. As the staff struggle to adjust to this ordeal, another more dangerous issue threatens the school; a mind-controlled Wolverine is lose on the grounds. All the available X-Men, and even a team of Avengers, are called in to capture him; but one of the X-Men, Northstar, is killed in the pursuit. Too add further insult to injury, Northstar's body is captured by The Hand before it can be buried. Not wanting to worry the students further, Scott and Emma decide that the planned memorial for Northstar will proceed without his body to allow the students some closure.
Toward the end of the school year, the faculty begin preparing for the school's spring dance. Shan and Dani struggle with the extra burden of covering for the absent faculty. For the students, anxiety runs high as each of them ponders if they will be asked to the dance by one of their classmates. The dance goes off with several hitches among the students, but is for the most part uneventful. The following day, the X-Men are called away by The Avengers on important business, and Dani is left to perform the Prizegiving ceremony alone. Near the completion of the ceremony, The Blob crashes into the school. Upset about not being invited into the new Brotherhood of Evil Mutants, he intends to attack the X-Men single-handedly to make a name for himself. With the X-Men away, and only Dani and Amara to protect the school, several New Mutants and Hellions join the fray to help defeat Blob.
As the school year ends, Sophia gathers the New Mutant's together for a team camp-out by the lake to get them to air out their differences and to re-bond together as a team.
House of M
Academy X Issues #16-19
New X-Men: Hellions
Hellions Issues #1-4
New X-Men
Childhood's End
Issues #20-23
As a result of the Decimation event, in which the Scarlet Witch's magicks de-powered most of the mutant population, only 27 of the 182 students enrolled at the Xavier Institute still retain their powers, and the comic changed its name to simply New X-Men. In response to the increasingly desperate situation that mutants now faced, Emma Frost has disbanded all the former training squads and integrated those students she deemed capable of combat, including new addition X-23, to a new team.
Crusade
Issues #24-27
Forty-two of the de-powered students are killed in an attack by anti-mutant fanatic, Reverend William Stryker. Furthermore, Icarus is misled by Stryker into allowing his wings to be amputated, and was later killed by Stryker after serving his purpose. A sniper working for Stryker kills Wallflower. Elixir, who had a romantic relationship with Wallflower and witnessed her death, kills Stryker and is reduced to a comatose state.
Nimrod
Issues #28-32
The X-Men receive a distress call from Forge, who was forced to repair the mutant-hunting Nimrod. The New X-Men go there to help, but are barely able to damage Nimrod. Rockslide is reduced to dust but soon reconstitutes himself in a stronger form, while Hellion lets Emma Frost release a formerly untapped potential of his mental powers. Through a trick, Nimrod is sent back in time.
Mercury Falling
Issues #33-36
Former New Mutants and Hellion squad member Wither is living in Mutant Town with a strange woman who is revealed to be Selene, the Black Queen, who seduces him into using his powers to kill. Back at the mansion, a memorial is held to honor all the X-Men and students who have perished.
Mercury is captured by Kimura. She is experimented on and tortured by scientists who use her living mercury to create a skin for a mutant hunting animal-like being called Predator X. The New X-Men and some of the Astonishing X-Men, including Emma Frost, arrive to rescue Mercury.
Quest for Magik
Issues #37-41
The Institute students are transported from the school into Limbo by Belasco. He tortures several of the students, questioning them on the whereabouts of Illyana Rasputin. The few students who evaded Belasco's capture, including Blindfold, Rockslide, Anole and Pixie, are attacked by a group of Belasco's monsters, but are rescued by Illyana who offers her help.
Illyana reveals that she can defeat Belasco with a Soulsword, but having lost her own, she persuades Pixie to allow her to create a new one from her soul. Illyana tells the students that Pixie, who now has a "soul dagger" created from the fraction of her innocence and soul, is the key to stopping Belasco.
Pixie kills Belasco with her Soulknife, losing more of her innocence. Illyana attempts to steal the rest of Pixie's soul, but memories of her past self come back when Colossus speaks to her. She sends the X-Men and students home, then retakes the throne of Limbo. At the institute, Anole and Pixie are made members of the New X-Men.
Children of X-Men
Issues #42-43
At the Xavier Institute, the New X-Men and students recover from their recent battles. Rockslide learns that he is a psionic entity that draws from the earth in order to create and reform his golem-like body. Surge kisses Hellion as a means of driving Prodigy away from the danger that seems to surround the team. This pushes David to allow the Stepford Cuckoos to unlock the psychic barriers in his mind that prevented him from remembering all of the information he had absorbed as a mutant; he also ends his relationship with Surge. Elixir slips into a depression because of the overwhelming potential of his powers, and while he is shaken out of it by Loa's advances, the Institute staff fear that he could become "the next Magneto."
Meanwhile, the Purifiers, now led by Matthew Risman, lure Predator X into pursuing Dust using one of her spare niqabs, until it changes direction towards Alaska.
Messiah Complex
Issues #44-46
Following the detection of a new mutant in Alaska, Cyclops tells the new X-Men that they are being held back from action. Disobeying his orders, several of the New X-Men, confront the Purifiers in Washington. As they're engaged in combat with them, Lady Deathstrike and her Reavers appear, and badly wound Hellion. They manage to escape due to the intervention of the undercover Rictor. Returning to the mansion for medical help, the students come under attack from Predator X, who had been feasting on the remains of the students buried on the grounds. Confronted by Armor and Gentle, they try to keep the monster back from the medical bay. Pixie remembers that X-23 was able to kill one of the Predators in their first encounter and attempts to teleport it to Laura. However, her spell mis-fires and she teleports all the present students, Predator X, Beast and Nightcrawler to Muir Island, where X-23 and the rest of X-Force and the X-Men were in battle with the Marauders. During the final battle, Cyclops pits the New X-Men against the Marauders, realising the team would be unfamiliar with the abilities of the students. The resulting fight goes to plan, Pixie stabbing the Malice-possessed Omega Sentinel and Dust attacking Exodus internally while Emma Frost distracts him with a telepathic battle.
See also
Young X-Men
References
New X-Men
New X-Men |
Acrocercops ennychodes is a moth of the family Gracillariidae. It is known from Queensland, Australia.
References
ennychodes
Moths of Australia
Moths described in 1921 |
The Tarikh al-Sudan ( TΔrΔ«kh as-SΕ«dΔn; also Tarikh es-Sudan, "History of the Sudan") is a West African chronicle written in Arabic in around 1655 by the chronicler of Timbuktu, al-Sa'di. It provides the single most important primary source for the history of the Songhay Empire. It and the Tarikh al-fattash, another 17th century chronicle giving a history of Songhay, are together known as the Timbuktu Chronicles.
The author, Abderrahmane al-Sa'di, was born on 28 May 1594, and died at an unknown date sometime after 1655-56, the last date to be mentioned in his chronicle. He spent most of his life working for the Moroccan Arma bureaucracy, initially in the administration of DjennΓ© and the massina region of the Inland Niger Delta. In 1646 he became chief secretary to the Arma administration of Timbuktu.
The early sections of the chronicle are devoted to brief histories of earlier Songhay dynasties, of the Mali Empire and of the Tuareg, and to biographies of the scholars and holymen of both Timbuktu and DjennΓ©. The main part of the chronicle covers the history of the Songhay from the middle of the 15th century till the Moroccan invasion in 1591, and then the history of Timbuktu under Moroccan rule up to 1655. Al-Sadi rarely acknowledges his sources. For the earlier period much of his information is presumably based on oral tradition. From around 1610 the information would have been gained first hand.
Publication
In 1853 the German scholar and explorer Heinrich Barth visited Timbuktu on behalf of the British government. During his stay in Gwandu (now in northwest Nigeria) he consulted a copy of the Tarikh al-Sudan in his investigation of the history of the Songhay empire. However he was under the misapprehension that the author was the Timbuktu scholar Ahmed Baba. In his book Barth wrote:
But I myself was so successful as to have an opportunity of perusing a complete history of the kingdom of Songhay, from the very dawn of historical records down to the year 1640 of our era; although, unfortunately, circumstances prevented my bringing back a complete copy of this manuscript, which forms a respectable quarto volume, and I was only able, during the few days that I had this manuscript in my hands during my stay in GandΓ³, to make short extracts of those passages from its contents which I thought of the highest interest in an historical and geographical point of view.
These annals, according to the universal statement of the learned people of Negroland, were written by a distinguished person of the name of A'hmed Baba, although in the work itself that individual is only spoken of in the third person; and it would seem that additions had been made to the book by another hand; but on this point I can not speak with certainty, as I had not sufficient time to read over the latter portion of the work with the necessary attention and care.
Forty years later the French journalist FΓ©lix Dubois in his Timbuctoo the Mysterious pointed out that the Tarikh could not have been written by Ahmed Baba as it mentions Ahmed Baba's death. "How could a man so well informed in Arabian subjects be so completely deceived?Β ... If he had read the entire book with more attention, he would have seen that the date β year, month and day β of Ahmed Baba's death is mentioned by the authorΒ ...". Dubois realized that the manuscript was by Abd al-Sadi.
After the French occupation of Mali in the 1890s, two copies of the manuscript were acquired by the BibliothΓ¨que Nationale in Paris. These were studied by the Arabic scholar Octave Houdas. The undated ManuscriptΒ A had been sent by Louis Archinard, ManuscriptΒ B was a copy made for FΓ©lix Dubois while in DjennΓ© in 1895 and was very similar to ManuscriptΒ A. A third copy of the Tarikh al-Sudan, ManuscriptΒ C, was sent to Houdas by the linguist RenΓ© Basset who was head of the Γcole SupΓ©rieure des Lettres in Algiers. ManuscriptΒ C was generally superior to the other two and included vowels for many of the proper names and the date of 1792 for when the copy had been made. Houdas published the Arabic text in 1898 and a translation into French in 1900. A century later John Hunwick published a partial translation into English.
Manuscripts
Manuscripts A, B and C were used by Houdas. A further four were listed by Hunwick. The text of the manuscripts are all very similar. The differences are mainly in the spelling of places and personal names.
Origin of the Kingdom of Mali
The Berber author of Ta'rikh al-Sudan, Abd al-Rahman al-Sa'di, recorded the oral tradition surrounding the origin of the Mali. He states, "Mali is the name of an extensive territory lying in the far west (of the Sudan) to the direction of the Ocean. It was Kaya-Magha who founded the first kingdom in that region. Their subjects, however, were Wa'kore (Soninke). When their kingdom came to an end, the people of Mali succeeded to hegemony."
Notes
References
. Google books: Volume 1, Volume 2, Volume 3.
.
.
.
. (Houdas divided the text into 38 chapters. This book includes a translation into English of Chapters 1-27 and 30).
History of Africa
History of Mali
1655 books
African chronicles
Songhai Empire |
```scss
.leaflet-control-layers-control .layers-control-panel{
padding: 6px 10px 6px 6px;
background: #fff;
width: 300px;
min-height: 74px;
max-height: 418px;
overflow-y: auto;
.loading{
margin-top: 6px;
margin-left: 4px;
}
.close-button{
display: inline-block;
background-image: url(data:image/png;base64,your_sha256_hashUBAFJ9pMflNIP/iVSkIb2wgccXd7g7O+your_sha256_hashoJNX6IDZfbUBQNrX7qfeXfPuqwBAQjEz60w64htGJ+luFH48gt+NYe6v5b/cnr9asM+HlRQ2Qlwh2CjuqQQ9vKsKTwhQ1wAAAABJRU5ErkJggg==);
height: 18px;
width: 18px;
margin-right: 0;
float: right;
vertical-align: middle;
text-align: right;
margin-top: 0px;
margin-left: 16px;
position: relative;
left: 2px;
&:hover{
opacity: 0.7;
cursor: pointer;
}
}
.title{
font-size: 120%;
margin-right: 60px;
}
hr{
clear: both;
margin: 6px 0px;
border-color: #ddd;
}
*{
font-size: 12px;
}
.layer-group-title{
margin-top: 2px;
margin-bottom: 2px;
white-space: nowrap;
text-overflow: ellipsis;
overflow: hidden;
}
}
``` |
Mukund Parikh is a Gujarati novelist, poet and playwright from Gujarat, India.
Life
Mukund Parikh was born on 26 January 1934 in Nadisar village (now in Panchmahal district, Gujarat) to Bhailal Parikh. He completed his primary and secondary education from his native town Balasinor. He completed his B. A. in Economics from Dharmendrasinhji College, Rajkot in 1957. He worked in a Provident Fund Commissioner Office from 1954 to 1980. He studied LL.B. from Ahmedabad in 1980 from Gujarat University. Since 1981, he is working as a lawyer.
Works
His Mahabhinishkraman (1968) was an experimental novel. The story follows a love triangle of a character named Amit Dalal and it explores his relationship with three ladies: Chandan, his mother; Rama, his wife and Saroj, his lover. Parikh employs the stream of consciousness in his narration. He has used motifs such as pipal tree and darkness. He has explored Oedipus complex in his character's relationships. The novel was particularly praised for its language.
He was associated with the experimental literary circles such as Re Math and Akanth Sabarmati. His one-act play Choras Inda Ane Gol Kabaro was included in a collection of five one-act plays Make Believe (1968) published by Re Math. This play is considered as an example of an absurd play from the early period of modern Gujarati literature. It is a psychological play flipping the places of an actor and the viewers in the theatre. Moksh (1975) is his one-act plays collection.
Man Chitarie (2004) is his poetry collection awarded by Gujarat Sahitya Akademi.
He co-edited poetry journal Shabda with Ravji Patel.
See also
List of Gujarati-language writers
References
1934 births
Living people
People from Panchmahal district
Gujarati-language poets
Gujarati-language writers
20th-century Indian novelists
20th-century Indian poets
Poets from Gujarat
Novelists from Gujarat
Gujarat University alumni |
HMAS Curlew (M 1121) was a operated by the Royal Navy (as HMS Chediston) from 1953 to 1961, and the Royal Australian Navy from 1962 to 1991. During her Australian service, the ship operated off Malaysia during the IndonesiaβMalaysia confrontation during the mid-1960s, then was modified for use as a minehunter. Delays in bringing a replacement class into service kept Curlew operational until 1990, and she was sold into civilian service in 1991.
Construction
The minesweeper was built by the Montrose Shipyard in Scotland, launched on 6 October 1953, and commissioned into the Royal Navy on 28 September 1954 as HMS Chediston.
Operational history
Royal Navy
Between August 1955 and October 1957, the ship was attached to Tay Division of the Royal Naval Volunteer Reserve. After October 1957, the ship was placed in storage.
Royal Australian Navy
The ship was one of six sold to the Royal Australian Navy for AΒ£5.5 million in 1961. Chediston was modified for tropical conditions, and commissioned on 12 August 1962 as HMAS Curlew.
During the mid-1960s, Curlew was one of several ships operating in support of the Malaysian government during the Indonesia-Malaysia Confrontation. This service was later recognised with the battle honour "Malaysia 1964β66".
In the late 1960s, Curlew and sister ship were modified for use as minehunters.
Divers from Curlew inspected the wreck of .
Decommissioning and fate
The delay in bringing the Bay class minehunters into service kept Curlew operational until 1990. Curlew paid off on 30 April 1990 and was sold on 17 June 1991. In the late 1990s she appeared in the movies Paradise Road and The Thin Red Line.
As of mid-2003, Curlew was operating out of Port Huon, Tasmania as a fishing vessel. The ship was later used for accommodation at Port Huon.
In April 2018 she was purchased for $1. Her new owner intends to use the ship as a floating backpacker hostel in Brisbane.
Citations
References
Books
Journal articles
Websites
Ton-class minesweepers of the Royal Navy
Ships built in Scotland
1953 ships
Cold War minesweepers of the United Kingdom
Ton-class minesweepers of the Royal Australian Navy
Cold War minesweepers of Australia
Ships and vessels on the National Archive of Historic Vessels |
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// +build ignore
// +godefs map struct_in6_addr [16]byte /* in6_addr */
package ipv6
/*
#define __APPLE_USE_RFC_3542
#include <netinet/in.h>
#include <netinet/icmp6.h>
*/
import "C"
const (
sysIPV6_UNICAST_HOPS = C.IPV6_UNICAST_HOPS
sysIPV6_MULTICAST_IF = C.IPV6_MULTICAST_IF
sysIPV6_MULTICAST_HOPS = C.IPV6_MULTICAST_HOPS
sysIPV6_MULTICAST_LOOP = C.IPV6_MULTICAST_LOOP
sysIPV6_JOIN_GROUP = C.IPV6_JOIN_GROUP
sysIPV6_LEAVE_GROUP = C.IPV6_LEAVE_GROUP
sysIPV6_PORTRANGE = C.IPV6_PORTRANGE
sysICMP6_FILTER = C.ICMP6_FILTER
sysIPV6_2292PKTINFO = C.IPV6_2292PKTINFO
sysIPV6_2292HOPLIMIT = C.IPV6_2292HOPLIMIT
sysIPV6_2292NEXTHOP = C.IPV6_2292NEXTHOP
sysIPV6_2292HOPOPTS = C.IPV6_2292HOPOPTS
sysIPV6_2292DSTOPTS = C.IPV6_2292DSTOPTS
sysIPV6_2292RTHDR = C.IPV6_2292RTHDR
sysIPV6_2292PKTOPTIONS = C.IPV6_2292PKTOPTIONS
sysIPV6_CHECKSUM = C.IPV6_CHECKSUM
sysIPV6_V6ONLY = C.IPV6_V6ONLY
sysIPV6_IPSEC_POLICY = C.IPV6_IPSEC_POLICY
sysIPV6_RECVTCLASS = C.IPV6_RECVTCLASS
sysIPV6_TCLASS = C.IPV6_TCLASS
sysIPV6_RTHDRDSTOPTS = C.IPV6_RTHDRDSTOPTS
sysIPV6_RECVPKTINFO = C.IPV6_RECVPKTINFO
sysIPV6_RECVHOPLIMIT = C.IPV6_RECVHOPLIMIT
sysIPV6_RECVRTHDR = C.IPV6_RECVRTHDR
sysIPV6_RECVHOPOPTS = C.IPV6_RECVHOPOPTS
sysIPV6_RECVDSTOPTS = C.IPV6_RECVDSTOPTS
sysIPV6_USE_MIN_MTU = C.IPV6_USE_MIN_MTU
sysIPV6_RECVPATHMTU = C.IPV6_RECVPATHMTU
sysIPV6_PATHMTU = C.IPV6_PATHMTU
sysIPV6_PKTINFO = C.IPV6_PKTINFO
sysIPV6_HOPLIMIT = C.IPV6_HOPLIMIT
sysIPV6_NEXTHOP = C.IPV6_NEXTHOP
sysIPV6_HOPOPTS = C.IPV6_HOPOPTS
sysIPV6_DSTOPTS = C.IPV6_DSTOPTS
sysIPV6_RTHDR = C.IPV6_RTHDR
sysIPV6_AUTOFLOWLABEL = C.IPV6_AUTOFLOWLABEL
sysIPV6_DONTFRAG = C.IPV6_DONTFRAG
sysIPV6_PREFER_TEMPADDR = C.IPV6_PREFER_TEMPADDR
sysIPV6_MSFILTER = C.IPV6_MSFILTER
sysMCAST_JOIN_GROUP = C.MCAST_JOIN_GROUP
sysMCAST_LEAVE_GROUP = C.MCAST_LEAVE_GROUP
sysMCAST_JOIN_SOURCE_GROUP = C.MCAST_JOIN_SOURCE_GROUP
sysMCAST_LEAVE_SOURCE_GROUP = C.MCAST_LEAVE_SOURCE_GROUP
sysMCAST_BLOCK_SOURCE = C.MCAST_BLOCK_SOURCE
sysMCAST_UNBLOCK_SOURCE = C.MCAST_UNBLOCK_SOURCE
sysIPV6_BOUND_IF = C.IPV6_BOUND_IF
sysIPV6_PORTRANGE_DEFAULT = C.IPV6_PORTRANGE_DEFAULT
sysIPV6_PORTRANGE_HIGH = C.IPV6_PORTRANGE_HIGH
sysIPV6_PORTRANGE_LOW = C.IPV6_PORTRANGE_LOW
sysSizeofSockaddrStorage = C.sizeof_struct_sockaddr_storage
sysSizeofSockaddrInet6 = C.sizeof_struct_sockaddr_in6
sysSizeofInet6Pktinfo = C.sizeof_struct_in6_pktinfo
sysSizeofIPv6Mtuinfo = C.sizeof_struct_ip6_mtuinfo
sysSizeofIPv6Mreq = C.sizeof_struct_ipv6_mreq
sysSizeofGroupReq = C.sizeof_struct_group_req
sysSizeofGroupSourceReq = C.sizeof_struct_group_source_req
sysSizeofICMPv6Filter = C.sizeof_struct_icmp6_filter
)
type sysSockaddrStorage C.struct_sockaddr_storage
type sysSockaddrInet6 C.struct_sockaddr_in6
type sysInet6Pktinfo C.struct_in6_pktinfo
type sysIPv6Mtuinfo C.struct_ip6_mtuinfo
type sysIPv6Mreq C.struct_ipv6_mreq
type sysICMPv6Filter C.struct_icmp6_filter
type sysGroupReq C.struct_group_req
type sysGroupSourceReq C.struct_group_source_req
``` |
Manchild was an American 1970s funk band from Indianapolis, Indiana.
They are best known for having a teenaged Kenny Babyface Edmonds in the group before he moved over to Dick Griffey's SOLAR Records to be in the band the Deele along with Antonio "L.A." Reid. The group was formed by Reggie Griffin and Anthony "A.J." Johnson in June of 1974. They released two albums and had a minor hit with "Especially for You". The band also included percussionist/vocalist Daryl Simmons, who later became associated with numerous Babyface-related projects (and has several Top Ten hits a producer/songwriter on acts like Dru Hill, Monica and Xscape to name a few), and multi-instrumentalist Reggie Griffin, who became a prominent musician/arranger, contributing heavily to the massive hit title track of Chaka Khan's 1984 I Feel for You album and later working extensively with Sugar Hill Records with such acts a Grandmaster Flash and The Furious Five, Melle Melle and sessions with Phyliss Hyman, The O'Jays, Dionne Warwick, Aretha Franklin, Patti LaBelle, Bette Midler and Toni Braxton to name a few, has toured with The Isley Brothers and with Babyface during his solo career.
Additionally Griffin has had a solo charting single called "Mirda Rock" in 1982.
Singer and keyboard player Charles "Chuckie" Bush, co-writer of "Especially for You", died on February 6, 2017, aged 58.
Bass guitarist Anthony "A.J." Johnson and co-writer of the songs "Red Hot Daddy" and "You Get What You Give" from their first album POWER AND LOVE, died on December 24, 2021, age 68.
Discography
Studio albums
Power and Love (Chi Sound Records, 1977)
Feel the Phuff (Chi Sound Records, 1978)
References
External links
Manchild at Discogs
American rhythm and blues musical groups
American soul musical groups
American funk musical groups
Musical groups from Indiana
Musical groups established in 1972
Babyface (musician) |
The Radioactive Substances Act 1993 (RSA93) deals with the control of radioactive material and disposal of radioactive waste in the United Kingdom.
On 6 April 2010 the Environmental Permitting (England and Wales) Regulations
2010 came into force. These new regulations repeal, amend and replace much of Radioactive Substances Act 1993 in England and Wales.
See also
Ionising Radiations Regulations 1999
References
United Kingdom Acts of Parliament 1993 |
The Lahu Democratic Union (; abbreviated LDU) is a Lahu political and insurgent group in Myanmar. It signed the Nationwide Ceasefire Agreement (NCA) with the government of Myanmar on 13 February 2018. The LDU is part of the United Nationalities Federal Council (UNFC) and its military coalition, the Federal Union Army (FUA).
References
Paramilitary organisations based in Myanmar
Political parties in Myanmar
Rebel groups in Myanmar |
Prosoplus neopomerianus is a species of beetle in the family Cerambycidae. It was described by Stephan von Breuning in 1938.
References
Prosoplus
Beetles described in 1938 |
This page lists the winners and nominees for the Black Reel Award for Best Director. Lee Daniels and Steve McQueen are the only directors nominated for Academy Awards. Daniels earned a nomination for Precious and McQueen for 12 Years a Slave.
Winners and nominees
Winners are listed first and highlighted in bold.
2000s
2010s
Multiple nominations and wins
Multiple wins
2 Wins
Ava DuVernay
Steve McQueen
Gina Prince-Bythewood
Multiple Nominees
9 Nominations
Spike Lee
5 Nominations
Antoine Fuqua
Malcolm D. Lee
4 Nominations
John Singleton
3 Nominations
Ava DuVernay
Albert Hughes
Allen Hughes
Gina Prince-Bythewood
Tim Story
2 Nominations
Salim Akil
Thomas Carter
Ryan Coogler
Lee Daniels
Rick Famuyiwa
F Gary Gray
Sanaa Hamri
Gary Hardwick
Steve McQueen
Charles Stone III
George Tillman, Jr.
References
Black Reel Awards |
Jacobus Cornelis Johannes "Jacques" van der Heyden (professional name JCJ Vanderheyden) (23 June 1928 β 27 February 2012) was a Dutch painter and photographer.
Life and work
JCJ Vanderheyden was born in 1928 in 's-Hertogenbosch. He studied from 1946 to 1956 at the Academy of Art and Design St. Joost in 's-Hertogenbosch and painting at the Jan van Eyck Academy in Maastricht. Van der Heyden was a guest lecturer repeatedly and taught from 1987 at the Rijksakademie van Beeldende Kunsten in Amsterdam.
Between 1964 and 1975 Vanderheyden experimented with film, new media, computer graphics, sound equipment, breathing exercises, photography and printing technology. In the 1970s in his studio Vanderheyden started to rearrange his own paintings, as well as the old masters (Hieronymus Bosch, Pieter Brueghel or Velasquez), so that installations were created, which he recorded as a photograph or with video. In the 1980s he concentrated on installations where his own paintings are displayed small or fragmented.
Trips to the Far East (1977), China (1989), the North Pole (1990) and in the Himalayas (1979 and 1986) inspired him to work, having the emptiness, the limitation and the reflection as subject. On the works the horizon is, however, never at a right angle to the plumb perpendicular, which can be seen repeatedly.
References
1928 births
2012 deaths
20th-century Dutch painters
Dutch male painters
Dutch photographers
People from 's-Hertogenbosch
20th-century Dutch male artists |
Henrich Christoforovich Eiche (, ; September 29 (October 12) 1893, Riga β June 25, 1968, JΕ«rmala, Latvia) was a Soviet Komdiv and military historian of Latvian ethnicity. He served in World War I as an officer in the Russian Imperial Army before siding with the Bolsheviks and in 1917 being elected Chairman of the Military Revolutionary Committee of his regiment. Eiche also held leading civil posts. He was the cousin of Robert Eikhe.
Biography
Johann Henrich Martin Eiche was born on 29 September 1893, in Riga, Russian Empire. His father Kristaps (Christof) and mother Lina (nΓ©e Laudon) were ethnic Latvians from rural areas of the center and north-west of the Courland Governorate respectively. Christoph's income from working as a forwarding agent enabled his wife to concentrate on taking care of Henrich and his older brother Friedrich Wilhelm (born in 1890).
At the age of 12 Eiche took part in several demonstrations and meetings of workers during the course of the 1905 Russian Revolution, witnessing their violent suppression by Orenburg Cossacks. Eiche's political views were further influenced by his cousins who were active members of the Latvian branch of the Russian Social Democratic Labour Party.
In January 1906, he enrolled in the Riga Commercial Academy, graduating on 23 December 1911. In January 1912, he began his apprenticeship at the Riga based Helmsing & Grimm shipping agency. In late 1913, Eiche finished his apprenticeship, becoming a full-time employee in the company's import department. In a pursuit of his passion for music Eiche visited Berlin, where he enrolled in a composition correspondence course in the Berlin Conservatory.
His studies were interrupted by the outbreak of World War I, whereupon he was drafted into the Russian Imperial Army as a private on 17 October 1914. After completing Warrant Officersβ Training School in 1915 he was sent to the front. He commanded a squadron, and was a staff captain.
After the February Revolution of 1917 he was elected to the regimental committee, and during the Russian Revolution of 1917 he was elected Chairman of the Military Revolutionary Committee of the 245th Infantry Regiment. In November 1917 he was elected to the Council of Soldiers' Deputies of the 10th Army and was a member of the board for the formation of the Red Guard.
He took part in suppressing the insurrection of the Polish corps under General JΓ³zef Dowbor-MuΕnicki. In March 1918 he voluntarily enlisted in the Red Army. From August 1918 to November 1919 he commanded a regiment, a brigade and the 26th Infantry Division (beginning April 1919) on the Eastern Front. From November 1919 to January 1920 he was Commander of the 5th Army.
From March 1920 to April 1921 Eiche served as Commander-in-Chief of the People's Revolutionary Army of the Far Eastern Republic. He was recalled to Moscow only after his mission was completed: i.e., the entire Far East was merged into the buffer Far Eastern Republic; all the major White Guard groups in the Far East were eliminated; the Japanese troops occupying the Far East were forced to withdraw from the Trans-Baikal, Amur and Primorye regions; and partisan units were reorganized into the regular army following the pattern of the Red Army of the time.
In 1921 he was sent to Belarus as a Commander to lead the struggle to eliminate guerilla groups and White Russian partisan units. This mission was completed by the spring of 1922. For successful discharge of his duties he was awarded the Certificate of Merit of the All-Russia Central Executive Committee.
In March 1922, upon order of the Central Committee Bureau of Organization, he was transferred from Belarus to Central Asia to counter the Basmachi Revolt in Fergana as Commander of the Fergana Region.
From 1923 until the day of his arrest in April 1938 he worked in government institutions in Moscow, including more than 12 years (beginning in 1924) in leading positions in Narkomvneshtorg, the Ministry of Foreign Trade.
During the Great Purge as a part of the so-called "Latvian Operation", in May 1938 he was arrested and convicted by the NKVDβs Counterintelligence Department on charges of "involvement in a Latvian counterrevolutionary organization" and as the cousin of Robert I. Eiche, a former member of the Central Committee (sentenced to be shot, posthumously rehabilitated in the 1950s). After sentencing he first was incarcerated in the NKVD's Lefortovo Prison in Moscow, where during interrogations he endured beatings and torture, and then served time in the gulags. After release from the camps he was in exile in the Far North. Also arrested as "the wife of an enemy of the people" was Maria Alexandrovna Eiche. She was incarcerated in Butyrka Prison. After her release she voluntarily followed her husband into exile.
Eiche was rehabilitated sixteen years later. In April 1954 the Military Board of the USSR Supreme Court repealed the decision of the NKVD Counterintelligence Department and dismissed the case for absence of the event of a crime.
Returning to Moscow after his release, as a member of the Military-Historical and Scientific Society Council of the Central Museum of the Soviet Army, Eiche was also active as a military historian and writer, devoting a great deal of time and effort to the editing of military/historical literature.
Eiche is the author of several works on the history of the Civil War in the Urals, Siberia, and the Far East.
He is buried at Moscowβs Vvedenskoye Cemetery.
Awards
For participating in all of the battles of the 245th Infantry, Berdyansk Regiment, 62nd Infantry Division, 10th Army of the Western Front from August 1915 to the end of 1917, Eiche was awarded:
Order of St. Stanislaus, 3rd class, with swords and ribbon
Order of St. Stanislaus, 2nd class, with swords
Order of St. Anne, 4th class
Order of St. Anne, 3rd class, with swords and ribbon
Order of St. Anne, 2nd class, with swords
During the years of the Civil War Eiche was awarded:
Order of the Red Banner No. 96
Certificate of Merit of the All-Russia Central Executive Committee on the award of a gold engraved watch (as Commander of the 3rd Brigade, 26th Infantry Division, for successful operations against Kolchak in the winter of 1918 - Urals Operation)
Special Custom Award Certificate issued by the Revolutionary Military Council of the Republic, as Divisional Commander of the 26th Infantry, for the successfully forced crossing of the Belaya River, and the crushing defeat and capture of Kolchak's army - Birsk Operation, 1919.
Certificate of Award from the All-Russia Central Executive Committee as Commander of the Minsk region (1922)
After his release Eiche was awarded:
Order of Lenin in honor of the 50th anniversary of the Soviet regime (1967)
Selected works
β’ Forced Crossing of the Belaya River by Units of the 5th Army of the Eastern Front in June 1919, Moscow-Leningrad, 1928 [Π€ΠΎΡΡΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΡΠ΅ΠΊΠΈ ΠΠ΅Π»ΠΎΠΉ ΡΠ°ΡΡΡΠΌΠΈ 5-ΠΉ Π°ΡΠΌΠΈΠΈ ΠΠΎΡΡΠΎΡΠ½ΠΎΠ³ΠΎ ΡΡΠΎΠ½ΡΠ° Π² ΠΈΡΠ½Π΅ 1919 Π³., Π.- Π., 1928];
β’ Tactical Lessons from the Civil War, Moscow, 1931 [Π’Π°ΠΊΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΏΠΎΡΡΠ΅Π½ΠΈΡ Π³ΡΠ°ΠΆΠ΄Π°Π½ΡΠΊΠΎΠΉ Π²ΠΎΠΉΠ½Ρ, Π., 1931];
β’ Kolchakβs Ufa Adventure, Moscow, 1966 [Π£ΡΠΈΠΌΡΠΊΠ°Ρ Π°Π²Π°Π½ΡΡΡΠ° ΠΠΎΠ»ΡΠ°ΠΊΠ°, Π., 1966];
β’ Defeated Rear, Moscow, 1966 [ΠΠΏΡΠΎΠΊΠΈΠ½ΡΡΡΠΉ ΡΡΠ», Π., 1966].
References
Sources
ΠΠ°Π΄ΠΈΠΊΠΎΠ² Π .Π. Π ΡΠ΅Π½ΠΈ Π.Π. Π€ΡΡΠ½Π·Π΅ ΠΈ Π.Π. Π§Π°ΠΏΠ°Π΅Π²Π°: Π΄Π΅ΡΡΠ΅Π»ΡΠ½ΠΎΡΡΡ Π.Π₯. ΠΠΉΡ
Π΅ Π² Π°ΠΏΡΠ΅Π»Π΅-ΠΈΡΠ½Π΅ 1919 Π³. // Π ΠΎΡΡΠΈΠΉΡΠΊΠ°Ρ ΠΈΡΡΠΎΡΠΈΡ. 2016. β 3. β Π‘. 111-126. In Russian.
ΠΠ°Π΄ΠΈΠΊΠΎΠ² Π .Π. ΠΠ΅Π½ΡΠΈΡ
Π₯ΡΠΈΡΡΠΎΡΠΎΡΠΎΠ²ΠΈΡ ΠΠΉΡ
Π΅ // ΠΠΎΠΏΡΠΎΡΡ ΠΈΡΡΠΎΡΠΈΠΈ. 2015. β 1. β Π‘. 45-59. In Russian.
1893 births
1968 deaths
Writers from Riga
Military personnel from Riga
People from Kreis Riga
Military historians
Soviet historians
Imperial Russian Army officers
Russian military personnel of World War I
Soviet military personnel of the Russian Civil War
Military personnel of the Far Eastern Republic
Recipients of the Order of St. Anna, 2nd class
Recipients of the Order of St. Anna, 3rd class
Recipients of the Order of St. Anna, 4th class
Recipients of the Order of Saint Stanislaus (Russian), 2nd class
Recipients of the Order of Saint Stanislaus (Russian), 3rd class
Recipients of the Order of Lenin
Recipients of the Order of the Red Banner
Gulag detainees
Soviet rehabilitations |
The Davao City Recreation Center formerly known as the Almendras Gym is an indoor arena in Davao City, Philippines.
It is situated along Quimpo Boulevard and has a capacity of 2,500 people.
From 2007 to 2010, the indoor arena underwent a renovation. Part of the renovation was the installment of an air-conditioning system in the sports facility. The sports venue hosted the 2015 Discovery Womenβs Basketball Invitational.
Alab Pilipinas uses the Davao City Recreation Center as one of its home venues for the 2016-17 season of the ASEAN Basketball League.
References
Basketball venues in the Philippines
Buildings and structures in Davao City |
Mircea Tiberian (born May 4, 1955 in Cluj, Romania) is a jazz musician and professor of music at the National University of Music in Bucharest. He coordinates the Jazz Department, which he set up in 1991.
Musical career
Tiberian spent his childhood and adolescence in Sibiu, Transylvania where he made his debut at the International Jazz Festival in 1974. He holds a doctorate in music. He currently lives in Bucharest. He has performed the world over with such musicians as Larry Coryell, Tomasz Stanko, Herb Robertson, John Betsch, Ed Shuller, Nicholas Simion, Adam PieroΕczyk, Maurice de Martin, Theo JΓΆrgensmann and the Romanians Johnny Raducanu, Aura Urziceanu, Anca Parghel and Dan Mandrila.
Awards
Composers Union Award (1990, 1996, 2000, 2003)
Romanian Musician of the Year Award (2003, 2007, 2008)
The Enescu-Brancusi Scholarship granted by the Romanian Cultural Institute
Publications
Tehnica Improvizatiei in Muzica de Jazz (A Course of Improvisation Techniques), Editura UNMB, Bucharest, 2005
Notes on Music and Music Notes (book and CDs), Editura Muzeului National al Literaturii Romane, Bucharest, 2005
Cartea de muzica (An anthology of musicology studies), Editura Tracus Arte, Bucharest, 2008
Intercultural Projects
Liniada (2000), Agnus Dei (2001), Les annes folles de Bucharest (2004), Jazz and Cinema (2005 βpresent), Dark (2006), Eurotique (2006), Jazzy Tarot - musical (2007β2008) β theatre Metropolis Bucuresti
Discography
Magic Bird (Electrecord, 1990)
Never Ending Story (Blue Label, 1992)
Working Underground (Prima Records, 1994)
Alone in Heaven (Intercont, 1998)
Hotel of Three Beginnings (Intercont, 1999)
Interzone (Editura Casa Radio, 2000)
Interzone plays with Adam Pieronczyk (Not Two, 2001)
Crossing Atlas 45 (Not Two, 2002)
Eleven (Jazz and More, 2002)
Back to my Angel (Editura Muzicala, 2002)
Viata Lumii (Jazz and More, 2003)
Lumini (La Strada, 2003)
Palindrome (Jazz and More, 2004)
Shining of the Abyss (Jazz and More, 2004)
Notes on Music and Music Notes β double CD anthology (Editura Muzeului National al Literaturii Romane, 2005)
Dark (Editura Muzeului National al Literaturii Romane, 2006)
November (Openart Records, 2008)
Ulysses (Openart Records, 2008)
References
Mircea Tiberian's Biography (RO)
Mircea Tiberian's Discography
1955 births
Living people
Romanian jazz pianists
21st-century pianists |
Park Mun-su (; 1691 β 1756), also known as Bak Munsu, was a Korean government official in the period of King Yeongjo in the Joseon dynasty. He was famous for his lifetime spent protecting the Korean people from corrupt royal officials.
Park passed the state examination in 1723 and later became a secret royal inspector (Amhaengeosa; ζθ‘εΎ‘ε², μνμ΄μ¬). He is the most famous secret inspector in the history of Korea, and has become something of a legendary figure, with many legends surrounding his achievements.
Bak was the son of Park Hang-han, and a member of the Goryeong Park clan. His art name was Gieun, his courtesy name was Seongbo, and his posthumous name was Chungheon.
Two portraits of Park Mun-su have been preserved and are in good condition.
Popular culture
Portrayed by Yoo Jun-sang in the 2002 MBC TV series Inspector Park Moon-soo.
Portrayed by Lee Won-jong in the 2014 SBS TV series Secret Door.
Portrayed by Kwon Yul in the 2019 SBS TV series Haechi.
References
1691 births
1756 deaths
18th-century Korean poets
Mun |
The English Spelling Society is an international organisation, based in the United Kingdom. It was founded in 1908 as the Simplified Spelling Society. It primarily aims to raise awareness of problems caused by English spelling's irregularity and to improve literacy and reduce learning costs, including through the use of spelling reform. The Society publishes leaflets, newsletters, journals, books, and bulletins. Its spokespeople feature regularly on TV, radio, and in print.
Structure
The Society is based in the United Kingdom, but has a worldwide membership, including Ireland, the United States, Canada, Australia and New Zealand. It is governed by a committee elected at its Annual General Meeting. The Society maintains links with the American Literacy Council, which has similar objectives.
Aims
The English Spelling Society primarily aims to make known the problems caused by English spelling's irregularity in an effort to improve literacy and reduce learning costs, including through the use of spelling reform. It also wishes to raise awareness of the alphabetic principle and its "corruption during the long history of written English" and to prepare a graded set of proposals for a more regular English orthography.
The Society believes that both recent research and the continuing governmental concern about literacy rates in the English-speaking world strengthen its position. In particular, it points to evidence that Anglophone children have a harder time learning to read and write than do Italian children. It also quotes evidence that dyslexia is less of a problem in Italy and linguistically similar countries which have more phonemic writing systems than English. Finally, it points to a recent study by the KPMG Foundation that estimates the total costs to the public purse till age 37 arising from failure to read in the primary school years at Β£1.73 billion to Β£2.05 billion a year.
Specific reform systems
As of September 2021, the Society has not endorsed any specific alternative English spelling system. However, through its "Personal View" series, it provides a forum for authors of alternative systems to publish their work and submit them to peer review. The forum includes resources for Simple-Fonetik and SoundSpel, among others. Its listed proposals vary in their recommendations from regularising only a few words to making English almost completely phonemically written.
In the November 1983 edition of the Society's newsletter, it printed a five-part reform proposal called "Stage 1". One of these was Harry Lindgren's SR1 proposal. In April 1984, SR1 was adopted as the Society's house style at its yearly meeting. The Society said that the newsletter's proposed reforms could be used either together or individually (as a step-by-step change).
In April 2021, Stephen Linstead's Traditional Spelling Revised (TSR) was approved by the International English Spelling Congress as the best alternative to English Orthography. The Society, sponsor of the Congress, is affording TSR a degree of support and publicity.
Spelling bee protests
Protesters from the Society have regularly taken good-humoured action against orthodox English spelling and its promotion (e.g. by demonstrating, most conspicuously in the form of 'BeeMan,' at the annual Scripps National Spelling Bee in Washington, D.C.).
Books
Jolly Dictionary - Sue Lloyd and Sara Wernham
Future of Fonics - Isobel Raven
Spelling for the 21st century - Sanford S. Silverman
Spelling Dearest (The Down and Dirty, Nitty-Gritty History of English Spelling) - Niall McLeod Waldman
The Book of Spells & Misspells - Valerie Yule
Lets End Our Literacy Crisis - Bob C. Cleckler
See also
List of reforms of the English language
Orthography
Spelling reform
Defective script
"The Chaos" (poem demonstrating irregular English spelling)
Linguistic conservatism
Linguistic prescription
Traditional Spelling Revised
References
External links
Spelling Society Home page
American Literacy Council
The History of English Spelling Reform
Children of the Code
English spelling reform
Educational organisations based in the United Kingdom
1908 establishments in the United Kingdom
Organizations established in 1908 |
Robert Surcouf de Maisonneuve (4 January 1671 β c. 1720) was a Breton privateer.
Career
Born in Saint-Malo, Surcouf de Maisonneuve captained the privateer Aimable under the reign of Louis XIV.
Legacy
Amongst the descendants of Surcouf de Maisonneuve were Robert Surcouf and Joseph Potier.
Notes and references
Notes
References
Bibliography
French privateers
French sailors
1671 births
1720s deaths
People from Saint-Malo
18th-century Breton people |
```tex
\documentclass{article}
\usepackage[fancyhdr,pdf]{latex2man}
\input{common.tex}
\begin{document}
\begin{Name}{3}{unw\_get\_reg}{David Mosberger-Tang}{Programming Library}{unw\_get\_reg}unw\_get\_reg -- get register contents
\end{Name}
\section{Synopsis}
\File{\#include $<$libunwind.h$>$}\\
\Type{int} \Func{unw\_get\_reg}(\Type{unw\_cursor\_t~*}\Var{cp}, \Type{unw\_regnum\_t} \Var{reg}, \Type{unw\_word\_t~*}\Var{valp});\\
\section{Description}
The \Func{unw\_get\_reg}() routine reads the value of register
\Var{reg} in the stack frame identified by cursor \Var{cp} and stores
the value in the word pointed to by \Var{valp}.
The register numbering is target-dependent and described in separate
manual pages (e.g., libunwind-ia64(3) for the IA-64 target).
Furthermore, the exact set of accessible registers may depend on the
type of frame that \Var{cp} is referring to. For ordinary stack
frames, it is normally possible to access only the preserved
(``callee-saved'') registers and frame-related registers (such as the
stack-pointer). However, for signal frames (see
\Func{unw\_is\_signal\_frame}(3)), it is usually possible to access
all registers.
Note that \Func{unw\_get\_reg}() can only read the contents of
registers whose values fit in a single word. See
\Func{unw\_get\_fpreg}(3) for a way to read registers which do not fit
this constraint.
\section{Return Value}
On successful completion, \Func{unw\_get\_reg}() returns 0.
Otherwise the negative value of one of the error-codes below is
returned.
\section{Thread and Signal Safety}
\Func{unw\_get\_reg}() is thread-safe as well as safe to use
from a signal handler.
\section{Errors}
\begin{Description}
\item[\Const{UNW\_EUNSPEC}] An unspecified error occurred.
\item[\Const{UNW\_EBADREG}] An attempt was made to read a register
that is either invalid or not accessible in the current frame.
\end{Description}
In addition, \Func{unw\_get\_reg}() may return any error returned by
the \Func{access\_mem}(), \Func{access\_reg}(), and
\Func{access\_fpreg}() call-backs (see
\Func{unw\_create\_addr\_space}(3)).
\section{See Also}
\SeeAlso{libunwind(3)},
\SeeAlso{libunwind-ia64(3)},
\SeeAlso{unw\_get\_fpreg(3)},
\SeeAlso{unw\_is\_signal\_frame(3)},
\SeeAlso{unw\_set\_reg(3)}
\section{Author}
\noindent
David Mosberger-Tang\\
Email: \Email{dmosberger@gmail.com}\\
WWW: \URL{path_to_url}.
\LatexManEnd
\end{document}
``` |
```html
<!--
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.
-->
<mat-card appearance="outlined" class="page-content single-column">
<tp-loading *ngIf="loading"></tp-loading>
<form ngNativeValidate (ngSubmit)="submit($event)">
<mat-card-content class="container">
<mat-form-field>
<mat-label>Name</mat-label>
<input matInput type="text" name="name" required [(ngModel)]="topology.name">
</mat-form-field>
<mat-form-field>
<mat-label>Description</mat-label>
<textarea matInput name="description" [(ngModel)]="topology.description"></textarea>
</mat-form-field>
</mat-card-content>
<mat-card-content class="container">
<mat-tree [dataSource]="topologySource" [treeControl]="topologyControl">
<mat-nested-tree-node *matTreeNodeDef="let node; when: hasChild">
<div class="mat-tree-node" matTreeNodeToggle mat-menu-item [attr.aria-label]="'Toggle ' + node.name">
{{node.name}}
</div>
<div class="expand-node" role="group">
<ng-container matTreeNodeOutlet></ng-container>
</div>
</mat-nested-tree-node>
</mat-tree>
</mat-card-content>
<mat-card-actions align="end" class="actions-container">
<button mat-raised-button type="button" *ngIf="!new" color="warn" (click)="delete()">Delete</button>
<button mat-raised-button color="primary" type="submit">Save</button>
</mat-card-actions>
</form>
</mat-card>
``` |
The Conversations with Filmmakers Series is part of the University Press of Mississippi which is sponsored by Mississippi's eight state universities. The mission of the Series is to publish collected interviews with world-famous directors. The current Filmmakers Series editor is Gerald Peary, a noted film critic and Professor of Communications and Journalism at Suffolk University, Boston. Peary was appointed to this position following the death of the Series' original general editor, Dr. Peter Brunette.
Background
The series was launched in 1998 with Gerald Peary's Quentin Tarantino: Interviews. It was favorably reviewed by MovieMaker magazine which found a balance and depth throughout saying, "Contemporary giants like Soderbergh, Oliver Stone and John Sayles are treated with just as much esteem as legends like Wilder and John Huston."
Interviewees
J.J. Abrams
Robert Aldrich
Woody Allen
Pedro AlmodΓ³var
Robert Altman
Theo Angelopoulos
Michelangelo Antonioni
Dorothy Arzner
Hal Ashby
Ingmar Bergman
Bernardo Bertolucci
Peter Bogdanovich
Kathryn Bigelow
Danny Boyle
Stan Brakhage
Charles Burnett
Tim Burton
James Cameron
Jane Campion
Frank Capra
John Cassavetes
Claude Chabrol
Charlie Chaplin
The Coen Brothers
Francis Ford Coppola
Sofia Coppola
Roger Corman
Wes Craven
David Cronenberg
George Cukor
Jonathan Demme
Clint Eastwood
Blake Edwards
Atom Egoyan
Asghar Farhadi
Federico Fellini
David Fincher
John Ford
William Friedkin
Su Friedrich
Samuel Fuller
Terry Gilliam
Jean-Luc Godard
Stuart Gordon
Peter Greenaway
D.W. Griffith
Michael Haneke
Howard Hawks
Todd Haynes
Werner Herzog
Alfred Hitchcock
Dennis Hopper
John Huston
Jim Jarmusch
Neil Jordan
Wong Kar-wai
Elia Kazan
Buster Keaton
Krzysztof KieΕlowski
Barbara Kopple
Harmony Korine
Stanley Kubrick
Akira Kurosawa
Fritz Lang
David Lean
Ang Lee
Spike Lee
Mike Leigh
Kasi Lemmons
George Lucas
Baz Luhrmann
Sidney Lumet
David Lynch
Guy Maddin
Louis Malle
Joseph L. Mankiewicz
Albert and David Maysles
Jonas Mekas
Merchant-Ivory
Anthony Minghella
Errol Morris
Nichols and May
Brian De Palma
Jafar Panahi
Alexander Payne
Sam Peckinpah
Arthur Penn
Christian Petzold
Roman Polanski
Abraham Polonsky
Michael Powell
Otto Preminger
Satyajit Ray
Jean Renoir
Alain Resnais
Martin Ritt
Robert Rodriguez
Eric Rohmer
George A. Romero
David O. Russell
Carlos Saura
John Sayles
Fred Schepisi
Martin Scorsese
Ridley Scott
Ousmane Sembène
John Singleton
Steven Soderbergh
Steven Spielberg
George Stevens
Oliver Stone
Quentin Tarantino
Andrei Tarkovsky
François Truffaut
Liv Ullmann
Agnes Varda
Paul Verhoeven
Lars von Trier
Margarethe von Trotta
John Waters
Lois Weber
Peter Weir
Orson Welles
Billy Wilder
Michael Winterbottom
John Woo
William Wyler
Zhang Yimou
Fred Zinnemann
References
External links
University Press of Mississippi
Mississippi State University
Mississippi, University Press of
Publications established in 1998 |
Bueche is an unincorporated community located in West Baton Rouge Parish, Louisiana, United States.
References
Unincorporated communities in West Baton Rouge Parish, Louisiana
Unincorporated communities in Louisiana |
```c++
/* regs IO test
This file is part of DeSmuME
DeSmuME is free software; you can redistribute it and/or modify
(at your option) any later version.
DeSmuME 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 DeSmuME; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <nds.h>
#include <stdio.h>
#include "../../regstest.h"
#define myassert(e,msg) ((e) ? (void)0 : _myassert(__FILE__, __LINE__, #e, msg))
void _myassert(const char *fileName, int lineNumber, const char* conditionString, const char* message)
{
iprintf("---\nAssertion failed!\n\x1b[39mFile: \n%s\n\nLine: %d\n\nCondition:\n%s\n\n\x1b[41m%s",fileName, lineNumber, conditionString, message);
for(;;) swiWaitForVBlank();
}
arm7comm_t arm7comm;
int main(void) {
consoleDemoInit();
//tell the arm7 where to store its stuff
//(the arm7 needs to know a location in main memory (shared) to store its results)
//(it could store its results in shared arm7 memory but we chose to do it this way since)
//(I couldn't figure out how to specify storage there for a global in arm7.cpp. any suggestions?)
fifoSendAddress(FIFO_USER_01,&arm7comm);
//fog table entries should not be readable. they should return 0
for(int i=0;i<32;i++)
{
GFX_FOG_TABLE[i] = 0xFF;
//iprintf("%02X\n",GFX_FOG_TABLE[i]);
myassert(GFX_FOG_TABLE[i] == 0x00,"test whether fog table entries are non-readable");
}
//8bit vram reads should work. 8bit vram writes should fail
vu8* bgmem8 = (vu8*)0x06000000;
vu16* bgmem16 = (vu16*)0x06000000;
vu32* bgmem32 = (vu32*)0x06000000;
bgmem16[0] = 0x1234;
bgmem16[1] = 0x5678;
myassert(bgmem8[0] == 0x34 && bgmem8[1] == 0x12 && bgmem8[2] == 0x78 && bgmem8[3] == 0x56,"test 8bit vram reads");
bgmem8[0] = 0;
myassert(bgmem8[0] == 0x34, "test 8bit vram writes");
//test OAM also
vu8* oam8 = (vu8*)0x07000000;
vu16* oam16 = (vu16*)0x07000000;
vu32* oam32 = (vu32*)0x07000000;
oam16[0] = 0x1234;
oam16[1] = 0x5678;
myassert(oam8[0] == 0x34 && oam8[1] == 0x12 && oam8[2] == 0x78 && oam8[3] == 0x56,"test 8bit oam reads");
oam8[0] = 0;
myassert(oam8[0] == 0x34, "test 8bit oam writes");
//test pal also
vu8* pal8 = (vu8*)0x05000000;
vu16* pal16 = (vu16*)0x05000000;
vu32* pal32 = (vu32*)0x05000000;
pal16[0] = 0x1234;
pal16[1] = 0x5678;
myassert(pal8[0] == 0x34 && pal8[1] == 0x12 && pal8[2] == 0x78 && pal8[3] == 0x56,"test 8bit pal reads");
pal8[0] = 0;
myassert(pal8[0] == 0x34, "test 8bit pal writes");
//-------------------
iprintf("waiting for arm7 test to finish!\n");
for(;;)
{
if(fifoCheckValue32(FIFO_USER_01))
break;
swiWaitForVBlank();
}
iprintf("firmwareID: %08X\n",arm7comm.firmwareId);
iprintf("arm7 finish code: %d\n",arm7comm.code);
if(arm7comm.code == 1)
{
iprintf("arm7 test failed!\n");
iprintf("%s\n",arm7comm.message);
iprintf("offending val: 0x%08X\n",arm7comm.offender);
}
else
{
iprintf("all tests OK");
}
for(;;) swiWaitForVBlank();
return 0;
}
``` |
```c
/**
* @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.
*/
/*
* The following is auto-generated. Do not manually edit. See scripts/loops.js.
*/
#include "stdlib/strided/base/unary/i_u.h"
#include "stdlib/strided/base/unary/macros.h"
#include <stdint.h>
/**
* Applies a unary callback to strided input array elements and assigns results to elements in a strided output array.
*
* @param arrays array whose first element is a pointer to a strided input array and whose second element is a pointer to a strided output array
* @param shape array whose only element is the number of elements over which to iterate
* @param strides array containing strides (in bytes) for each strided array
* @param fcn callback
*
* @example
* #include "stdlib/strided/base/unary/i_u.h"
* #include <stdint.h>
*
* // Create underlying byte arrays:
* uint8_t x[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t out[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define a pointer to an array containing pointers to strided arrays:
* uint8_t *arrays[] = { x, out };
*
* // Define the strides:
* int64_t strides[] = { 4, 4 };
*
* // Define the number of elements over which to iterate:
* int64_t shape[] = { 3 };
*
* // Define a callback:
* static int32_t fcn( int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* stdlib_strided_i_u( arrays, shape, strides, (void *)fcn );
*/
void stdlib_strided_i_u( uint8_t *arrays[], const int64_t *shape, const int64_t *strides, void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_STRIDED_UNARY_LOOP_CLBK( int32_t, uint32_t )
}
``` |
Agoura () is an unincorporated community of Los Angeles County, which is located southeast of the city of Agoura Hills, California, adjacent to the city of Calabasas in Los Angeles County. Agoura was the historical name of the area, before much of the area was developed and before the incorporation of the city of Agoura Hills. There are a few nearby pockets of unincorporated areas that contain a handful of houses. Much of the area is also often referred to as the neighborhood of Old Agoura. The ZIP code is 91301 and the area codes are 747 and 818.
History
A stagecoach stop here was known as "Vegar Junction" and in the 1920s the community was briefly known as Picture City, as Paramount Pictures owned the Paramount Ranch, a movie ranch filming outdoor scenes and Western movies.
To obtain a post office of its own, the Postal Service required the residents to choose a one-word name, and in 1927 they chose the last name of Pierre Agoure. Pierre was a local French Basque immigrant who had settled in the area in 1871 to live the lifestyle of a Californio rancher, and styled himself Don Pierre Agoure. His name was chosen for the post office as it was the shortest name proposed, but it is unknown whether the changed final letter was an error or an attempt to make it easier to spell or pronounce.
The city of Agoura Hills incorporated in 1982 with the remaining unincorporated areas identified as Agoura.
Notable people
Erik Affholter (born 1966), American football NFL wide receiver
Brad Delson, lead guitarist of Linkin Park
Kario Salem, actor
Gintaras GruΕ‘as, archbishop of Vilnius, Lithuania
See also
Rancho Las Virgenes β 19th-century Mexican land grant in the area
References
Neighborhoods in Agoura Hills, California
Unincorporated communities in Los Angeles County, California
Conejo Valley
Populated places in the Santa Monica Mountains
Populated places established in 1871
1871 establishments in California
Unincorporated communities in California |
Kentucky RouteΒ 261 (KYΒ 261) is a state highway in Kentucky that runs from Kentucky Route 54 southeast of Fordsville to Kentucky Route 79 and Sandy Hill Road in rural Meade County southwest of Brandenburg via McQuady, Hardinsburg, and Webster.
Route description
KYΒ 261 begins at a junction with KYΒ 54 on the east side of Fordsville, located in northeastern Ohio County. It then traverses the southernmost tip of Hancock County. The highway intersects KYΒ 2124, along with a few more rural state highways that connect this particular area to Hawesville, the county seat of Hancock County.
KYΒ 261 enters Breckinridge County and then intersects KYΒ 105 at McQuady. It meets U.S. Route 60 (USΒ 60) and KYΒ 259 in the Breckinridge County seat, Hardinsburg. The highway runs concurrently with KYΒ 259 from the USΒ 60 junction to downtown Hardinsburg. KYΒ 261 turns away to traverse mainly rural areas of northeastern Breckinridge County. That section of the route also includes a stretch concurrent with KYΒ 86.
KYΒ 261 ends in Meade County at an intersection with KYΒ 79 between Irvington and the Meade County seat of Brandenburg.
Major intersections
References
0261
0261
0261
0261
0261 |
Pierre Kakhia is president of the Lebanese Basketball Federation, and a member of the Lebanese Olympic Committee.
Career
He works in the world of Lebanese and Middle East sports (Basketball but also Football). He is president of West Asia at World Sport Group.
In 2001, Kakhia established the West Asian Football Federation (WAFF) which was located in Jordan and headed by Prince Ali bin Hussein.
He was marketing manager of the Qatar Football Federation, and is currently the Head of Sports of the Lebanese Forces political party in Lebanon.
Kakhia has business ties to Sheikh Salman Bin Ibrahim Al-Khalifa, president of the Asian Football Confederation.
References
Basketball in Lebanon
Lebanese sportspeople
Living people
Year of birth missing (living people)
Place of birth missing (living people) |
The Hong Kong national rugby league team represents Hong Kong in the sport of rugby league.
History
The Hong Kong Rugby League (HKRL) was formed in December 2014, with the first official rugby league matches in Hong Kong being played in 2015 and the inaugural Hong Kong Super League being contested in 2017.
Hong Kong made its Test debut in November 2017, losing to Japan in Kowloon. Hong Kong plays Japan for a trophy called the East Asia Cup.
Hong Kong was included in the RLIF world rankings for the first time in December 2017. Hong Kong is currently ranked 45th in the world.
Ben Ryan scored the first try for Hong Kong during their debut international against Japan. He also told fellow international Rugby League player Latrel Mitchell about it in Port Macquarie.
Current squad
Squad selected for 2018 Emerging Nations World Championship;
Matthew Waugh
Mike Tsang
Rhys Johnson
Richard Lindsay
Ben Wong
John Howarth
Gus Spence
Lee Griffiths
Craig McMurrich
Gareth Janes
Benoit Mouclier
Alex Shvets
Ari Rogers
Toby Lei
Ben Ryan
Hung Yip
Ringo Lung
Allan Newsome
Jack Nielsen
Hong Kong Residents XIII
The Hong Kong Residents XIII was a representative team made by the Hong Kong Rugby League to give open-age players who currently reside in Hong Kong the opportunity to help develop Rugby League throughout Asia. This early stage International Representative team of Hong Kong gave an opportunity for a number of players in the Thunder to develop.
The Residents have had three tours since their formation in 2015, touring the Philippines twice, and Thailand once.
2017
Hong Kong Residents 58 defeated Philippines Admirals 8 (Michael Aghataher, John Franklin Agunod, Jay CaΓ±a tries) at Emperor Stadium, Taguig, Philippines (18 March 2017)
2016
Hong Kong Residents 20 (Rob Hotchin 2, Doug Fluker, Hugh Quinivan tries; Doug Fluker 2 from 4 goals) defeated Thailand Residents 16 (Sakul Chopaka, Richard Chigumba, Julien Domenech tries; Ben Geldart 2 from 3 goals) at Horseshoe Point Resort, Pattaya, Thailand (28 May 2016)
2015
Hong Kong Residents 40 (Tom Patridge 2, Kurt O'Brien 2, Doug Fluker, Tom Beresford, Yosuke Yamagishi tries; Doug Fluker 6 from 6 goals) defeated Manila Storm 34 (Elvis William Jensen 2, Martin Yam 2, Greg Ranza, Benny Noki tries; Martin Yami 5 from 6 goals) at Southern Plains Field in Alabang, Philippines (7 November 2015)
International Results
International results for the Hong Kong Thunder.
2018
Hong Kong 32 defeated Japan Samurais 20 at Sogo Ground of Inagi Chuo Park, Tokyo, 16 June 2018.
Poland 62 (S Maslanka 2, R Mykietyn 2, C Korostchuk 3, J Metuangaro 2, E Niszczot, M Maslanka 2 tries; E Niszczot 7 goals) v 6 Hong Kong (C McMurrich try; R Lindsay 1 goal) at St Marys Leagues Stadium, Sydney, 4 October 2018. 2018 Emerging Nations World Championship. C McMurrich sin binned twice.
Solomon Islands 32 (L Tongaka, T Sanga, S Momoa, M Singamoana 2, H Angikimua, D Saomatangi tries; E Moeava 2 goals) v 12 Hong Kong (L Griffiths, M Waugh tries; R Lindsay 2 goals) at Kellyville Ridge Stadium, Sydney, 7 October 2018. 2018 Emerging Nations World Championship. L Griffiths and M Singamoana sin binned.
Japan 32 (K Fukushige, F Karino, I Matsuo, E Shivasaki 2, G Gerediaga tries; T Sugano 4 goals) v 30 Hong Kong (R Lindsay, L Griffiths, B Ryan, C McMurrich, G Spence tries; R Lindsay 5 goals) at Windsor Sports Complex, Sydney, 11 October 2018. 2018 Emerging Nations World Championship.
Solomon Islands 56 (Singamoana, Angikumua 3, Moe'ava 2, Sanga, Tengemoana, Manau, 2, Saomatangi tries; E Moe'ava 5, T Sanga 1 goals) v 14 Hong Kong (B Barnes, R Lindsay, C McMurrich tries; B Barnes 1 goal) at St Marys Leagues Stadium field number 2, Sydney, 13 October 2018. 2018 Emerging Nations World Championship. C McMurrich sin binned.
2017
Hong Kong 22 (Ben Ryan 2, Gus Spence, Toby Lei tries; Kin Chong 3 from 4 goals) lost to Japan Samurais 24 (Kazuki Fukushige, Itaru Matuso, Kenshin Tsutsui, Kohei Ishikawa, Royoji Kitabayashi tries, Dai Fujitaka 2 from 5 goals) at King's Park in Kowloon, 4 November 2017.
Fixtures
Upcoming fixtures for the Hong Kong Thunder
2018
Emerging Nations World Championship - Sydney, Australia (September - October 2018)
References
External links
R
National rugby league teams
Rugby league in Hong Kong |
Ruaha National Park is a national park in Tanzania. The addition of the Usangu Game Reserve and other important wetlands to the park in 2008 increased its size to about .
The park is about west of Iringa. The park is a part of the Rungwa-Kizigo-Muhesi ecosystem, which includes the Rungwa Game Reserve, the Kizigo and Muhesi Game Reserves, and the Mbomipa Wildlife Management Area.
The name of the park is derived from the Great Ruaha River, which flows along its southeastern margin and is the focus for game-viewing. The park can be reached by car on a dirt road from Iringa and there are two airstrips β Msembe airstrip at Msembe (park headquarters), and Jongomeru Airstrip, near the Jongomeru Ranger Post.
History and wildlife
Germany gazetted the Saba Game Reserve in 1910. British colonial authorities changed the name to the Rungwa Game Reserve in 1946. In 1964, the southern portion of the reserve was excised and elevated to full park status.
More than 571 species of birds have been identified in the park. Among the resident species are hornbills. Many migratory birds visit the park.
Other noted animals found in this park are East African cheetah, East African lion, African leopard, wild dog, spotted hyena, giraffe, hippopotamus, African buffalo, and sable antelope.
Since 2005, the protected area is considered a Lion Conservation Unit.
Issues
The park was formerly known for its large elephant population. It had numbered 34,000 in the Ruaha-Rungwa ecosystem in 2009, before declining to only 15,836, plus or minus 4,759, in 2015.
In February 2018, the carcasses of 6 lions and 74 vultures were found. They appear to have been poisoned.
References
External links
Tanzania National Parks
Friends of Ruaha Society
National parks of Tanzania
Great Ruaha River
Protected areas established in 1964
1964 establishments in Tanzania
Geography of Iringa Region
Southern Acacia-Commiphora bushlands and thickets
Tourist attractions in the Iringa Region
Important Bird Areas of Tanzania
Central Zambezian miombo woodlands |
```c++
//==--- InstrEmitter.cpp - Emit MachineInstrs for the SelectionDAG class ---==//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
//
// This implements the Emit routines for the SelectionDAG class, which creates
// MachineInstrs based on the decisions of the SelectionDAG instruction
// selection.
//
//===your_sha256_hash------===//
#include "InstrEmitter.h"
#include "SDNodeDbgValue.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/CodeGen/MachineConstantPool.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/CodeGen/MachineInstrBuilder.h"
#include "llvm/CodeGen/MachineRegisterInfo.h"
#include "llvm/CodeGen/StackMaps.h"
#include "llvm/CodeGen/TargetInstrInfo.h"
#include "llvm/CodeGen/TargetLowering.h"
#include "llvm/CodeGen/TargetSubtargetInfo.h"
#include "llvm/IR/DataLayout.h"
#include "llvm/IR/DebugInfo.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/ErrorHandling.h"
#include "llvm/Support/MathExtras.h"
using namespace llvm;
#define DEBUG_TYPE "instr-emitter"
/// MinRCSize - Smallest register class we allow when constraining virtual
/// registers. If satisfying all register class constraints would require
/// using a smaller register class, emit a COPY to a new virtual register
/// instead.
const unsigned MinRCSize = 4;
/// CountResults - The results of target nodes have register or immediate
/// operands first, then an optional chain, and optional glue operands (which do
/// not go into the resulting MachineInstr).
unsigned InstrEmitter::CountResults(SDNode *Node) {
unsigned N = Node->getNumValues();
while (N && Node->getValueType(N - 1) == MVT::Glue)
--N;
if (N && Node->getValueType(N - 1) == MVT::Other)
--N; // Skip over chain result.
return N;
}
/// countOperands - The inputs to target nodes have any actual inputs first,
/// followed by an optional chain operand, then an optional glue operand.
/// Compute the number of actual operands that will go into the resulting
/// MachineInstr.
///
/// Also count physreg RegisterSDNode and RegisterMaskSDNode operands preceding
/// the chain and glue. These operands may be implicit on the machine instr.
static unsigned countOperands(SDNode *Node, unsigned NumExpUses,
unsigned &NumImpUses) {
unsigned N = Node->getNumOperands();
while (N && Node->getOperand(N - 1).getValueType() == MVT::Glue)
--N;
if (N && Node->getOperand(N - 1).getValueType() == MVT::Other)
--N; // Ignore chain if it exists.
// Count RegisterSDNode and RegisterMaskSDNode operands for NumImpUses.
NumImpUses = N - NumExpUses;
for (unsigned I = N; I > NumExpUses; --I) {
if (isa<RegisterMaskSDNode>(Node->getOperand(I - 1)))
continue;
if (RegisterSDNode *RN = dyn_cast<RegisterSDNode>(Node->getOperand(I - 1)))
if (Register::isPhysicalRegister(RN->getReg()))
continue;
NumImpUses = N - I;
break;
}
return N;
}
/// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an
/// implicit physical register output.
void InstrEmitter::
EmitCopyFromReg(SDNode *Node, unsigned ResNo, bool IsClone, bool IsCloned,
unsigned SrcReg, DenseMap<SDValue, unsigned> &VRBaseMap) {
unsigned VRBase = 0;
if (Register::isVirtualRegister(SrcReg)) {
// Just use the input register directly!
SDValue Op(Node, ResNo);
if (IsClone)
VRBaseMap.erase(Op);
bool isNew = VRBaseMap.insert(std::make_pair(Op, SrcReg)).second;
(void)isNew; // Silence compiler warning.
assert(isNew && "Node emitted out of order - early");
return;
}
// If the node is only used by a CopyToReg and the dest reg is a vreg, use
// the CopyToReg'd destination register instead of creating a new vreg.
bool MatchReg = true;
const TargetRegisterClass *UseRC = nullptr;
MVT VT = Node->getSimpleValueType(ResNo);
// Stick to the preferred register classes for legal types.
if (TLI->isTypeLegal(VT))
UseRC = TLI->getRegClassFor(VT, Node->isDivergent());
if (!IsClone && !IsCloned)
for (SDNode *User : Node->uses()) {
bool Match = true;
if (User->getOpcode() == ISD::CopyToReg &&
User->getOperand(2).getNode() == Node &&
User->getOperand(2).getResNo() == ResNo) {
unsigned DestReg = cast<RegisterSDNode>(User->getOperand(1))->getReg();
if (Register::isVirtualRegister(DestReg)) {
VRBase = DestReg;
Match = false;
} else if (DestReg != SrcReg)
Match = false;
} else {
for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) {
SDValue Op = User->getOperand(i);
if (Op.getNode() != Node || Op.getResNo() != ResNo)
continue;
MVT VT = Node->getSimpleValueType(Op.getResNo());
if (VT == MVT::Other || VT == MVT::Glue)
continue;
Match = false;
if (User->isMachineOpcode()) {
const MCInstrDesc &II = TII->get(User->getMachineOpcode());
const TargetRegisterClass *RC = nullptr;
if (i+II.getNumDefs() < II.getNumOperands()) {
RC = TRI->getAllocatableClass(
TII->getRegClass(II, i+II.getNumDefs(), TRI, *MF));
}
if (!UseRC)
UseRC = RC;
else if (RC) {
const TargetRegisterClass *ComRC =
TRI->getCommonSubClass(UseRC, RC);
// If multiple uses expect disjoint register classes, we emit
// copies in AddRegisterOperand.
if (ComRC)
UseRC = ComRC;
}
}
}
}
MatchReg &= Match;
if (VRBase)
break;
}
const TargetRegisterClass *SrcRC = nullptr, *DstRC = nullptr;
SrcRC = TRI->getMinimalPhysRegClass(SrcReg, VT);
// Figure out the register class to create for the destreg.
if (VRBase) {
DstRC = MRI->getRegClass(VRBase);
} else if (UseRC) {
assert(TRI->isTypeLegalForClass(*UseRC, VT) &&
"Incompatible phys register def and uses!");
DstRC = UseRC;
} else {
DstRC = TLI->getRegClassFor(VT, Node->isDivergent());
}
// If all uses are reading from the src physical register and copying the
// register is either impossible or very expensive, then don't create a copy.
if (MatchReg && SrcRC->getCopyCost() < 0) {
VRBase = SrcReg;
} else {
// Create the reg, emit the copy.
VRBase = MRI->createVirtualRegister(DstRC);
BuildMI(*MBB, InsertPos, Node->getDebugLoc(), TII->get(TargetOpcode::COPY),
VRBase).addReg(SrcReg);
}
SDValue Op(Node, ResNo);
if (IsClone)
VRBaseMap.erase(Op);
bool isNew = VRBaseMap.insert(std::make_pair(Op, VRBase)).second;
(void)isNew; // Silence compiler warning.
assert(isNew && "Node emitted out of order - early");
}
void InstrEmitter::CreateVirtualRegisters(SDNode *Node,
MachineInstrBuilder &MIB,
const MCInstrDesc &II,
bool IsClone, bool IsCloned,
DenseMap<SDValue, unsigned> &VRBaseMap) {
assert(Node->getMachineOpcode() != TargetOpcode::IMPLICIT_DEF &&
"IMPLICIT_DEF should have been handled as a special case elsewhere!");
unsigned NumResults = CountResults(Node);
for (unsigned i = 0; i < II.getNumDefs(); ++i) {
// If the specific node value is only used by a CopyToReg and the dest reg
// is a vreg in the same register class, use the CopyToReg'd destination
// register instead of creating a new vreg.
unsigned VRBase = 0;
const TargetRegisterClass *RC =
TRI->getAllocatableClass(TII->getRegClass(II, i, TRI, *MF));
// Always let the value type influence the used register class. The
// constraints on the instruction may be too lax to represent the value
// type correctly. For example, a 64-bit float (X86::FR64) can't live in
// the 32-bit float super-class (X86::FR32).
if (i < NumResults && TLI->isTypeLegal(Node->getSimpleValueType(i))) {
const TargetRegisterClass *VTRC = TLI->getRegClassFor(
Node->getSimpleValueType(i),
(Node->isDivergent() || (RC && TRI->isDivergentRegClass(RC))));
if (RC)
VTRC = TRI->getCommonSubClass(RC, VTRC);
if (VTRC)
RC = VTRC;
}
if (II.OpInfo[i].isOptionalDef()) {
// Optional def must be a physical register.
VRBase = cast<RegisterSDNode>(Node->getOperand(i-NumResults))->getReg();
assert(Register::isPhysicalRegister(VRBase));
MIB.addReg(VRBase, RegState::Define);
}
if (!VRBase && !IsClone && !IsCloned)
for (SDNode *User : Node->uses()) {
if (User->getOpcode() == ISD::CopyToReg &&
User->getOperand(2).getNode() == Node &&
User->getOperand(2).getResNo() == i) {
unsigned Reg = cast<RegisterSDNode>(User->getOperand(1))->getReg();
if (Register::isVirtualRegister(Reg)) {
const TargetRegisterClass *RegRC = MRI->getRegClass(Reg);
if (RegRC == RC) {
VRBase = Reg;
MIB.addReg(VRBase, RegState::Define);
break;
}
}
}
}
// Create the result registers for this node and add the result regs to
// the machine instruction.
if (VRBase == 0) {
assert(RC && "Isn't a register operand!");
VRBase = MRI->createVirtualRegister(RC);
MIB.addReg(VRBase, RegState::Define);
}
// If this def corresponds to a result of the SDNode insert the VRBase into
// the lookup map.
if (i < NumResults) {
SDValue Op(Node, i);
if (IsClone)
VRBaseMap.erase(Op);
bool isNew = VRBaseMap.insert(std::make_pair(Op, VRBase)).second;
(void)isNew; // Silence compiler warning.
assert(isNew && "Node emitted out of order - early");
}
}
}
/// getVR - Return the virtual register corresponding to the specified result
/// of the specified node.
unsigned InstrEmitter::getVR(SDValue Op,
DenseMap<SDValue, unsigned> &VRBaseMap) {
if (Op.isMachineOpcode() &&
Op.getMachineOpcode() == TargetOpcode::IMPLICIT_DEF) {
// Add an IMPLICIT_DEF instruction before every use.
// IMPLICIT_DEF can produce any type of result so its MCInstrDesc
// does not include operand register class info.
const TargetRegisterClass *RC = TLI->getRegClassFor(
Op.getSimpleValueType(), Op.getNode()->isDivergent());
Register VReg = MRI->createVirtualRegister(RC);
BuildMI(*MBB, InsertPos, Op.getDebugLoc(),
TII->get(TargetOpcode::IMPLICIT_DEF), VReg);
return VReg;
}
DenseMap<SDValue, unsigned>::iterator I = VRBaseMap.find(Op);
assert(I != VRBaseMap.end() && "Node emitted out of order - late");
return I->second;
}
/// AddRegisterOperand - Add the specified register as an operand to the
/// specified machine instr. Insert register copies if the register is
/// not in the required register class.
void
InstrEmitter::AddRegisterOperand(MachineInstrBuilder &MIB,
SDValue Op,
unsigned IIOpNum,
const MCInstrDesc *II,
DenseMap<SDValue, unsigned> &VRBaseMap,
bool IsDebug, bool IsClone, bool IsCloned) {
assert(Op.getValueType() != MVT::Other &&
Op.getValueType() != MVT::Glue &&
"Chain and glue operands should occur at end of operand list!");
// Get/emit the operand.
unsigned VReg = getVR(Op, VRBaseMap);
const MCInstrDesc &MCID = MIB->getDesc();
bool isOptDef = IIOpNum < MCID.getNumOperands() &&
MCID.OpInfo[IIOpNum].isOptionalDef();
// If the instruction requires a register in a different class, create
// a new virtual register and copy the value into it, but first attempt to
// shrink VReg's register class within reason. For example, if VReg == GR32
// and II requires a GR32_NOSP, just constrain VReg to GR32_NOSP.
if (II) {
const TargetRegisterClass *OpRC = nullptr;
if (IIOpNum < II->getNumOperands())
OpRC = TII->getRegClass(*II, IIOpNum, TRI, *MF);
if (OpRC) {
const TargetRegisterClass *ConstrainedRC
= MRI->constrainRegClass(VReg, OpRC, MinRCSize);
if (!ConstrainedRC) {
OpRC = TRI->getAllocatableClass(OpRC);
assert(OpRC && "Constraints cannot be fulfilled for allocation");
Register NewVReg = MRI->createVirtualRegister(OpRC);
BuildMI(*MBB, InsertPos, Op.getNode()->getDebugLoc(),
TII->get(TargetOpcode::COPY), NewVReg).addReg(VReg);
VReg = NewVReg;
} else {
assert(ConstrainedRC->isAllocatable() &&
"Constraining an allocatable VReg produced an unallocatable class?");
}
}
}
// If this value has only one use, that use is a kill. This is a
// conservative approximation. InstrEmitter does trivial coalescing
// with CopyFromReg nodes, so don't emit kill flags for them.
// Avoid kill flags on Schedule cloned nodes, since there will be
// multiple uses.
// Tied operands are never killed, so we need to check that. And that
// means we need to determine the index of the operand.
bool isKill = Op.hasOneUse() &&
Op.getNode()->getOpcode() != ISD::CopyFromReg &&
!IsDebug &&
!(IsClone || IsCloned);
if (isKill) {
unsigned Idx = MIB->getNumOperands();
while (Idx > 0 &&
MIB->getOperand(Idx-1).isReg() &&
MIB->getOperand(Idx-1).isImplicit())
--Idx;
bool isTied = MCID.getOperandConstraint(Idx, MCOI::TIED_TO) != -1;
if (isTied)
isKill = false;
}
MIB.addReg(VReg, getDefRegState(isOptDef) | getKillRegState(isKill) |
getDebugRegState(IsDebug));
}
/// AddOperand - Add the specified operand to the specified machine instr. II
/// specifies the instruction information for the node, and IIOpNum is the
/// operand number (in the II) that we are adding.
void InstrEmitter::AddOperand(MachineInstrBuilder &MIB,
SDValue Op,
unsigned IIOpNum,
const MCInstrDesc *II,
DenseMap<SDValue, unsigned> &VRBaseMap,
bool IsDebug, bool IsClone, bool IsCloned) {
if (Op.isMachineOpcode()) {
AddRegisterOperand(MIB, Op, IIOpNum, II, VRBaseMap,
IsDebug, IsClone, IsCloned);
} else if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
MIB.addImm(C->getSExtValue());
} else if (ConstantFPSDNode *F = dyn_cast<ConstantFPSDNode>(Op)) {
MIB.addFPImm(F->getConstantFPValue());
} else if (RegisterSDNode *R = dyn_cast<RegisterSDNode>(Op)) {
unsigned VReg = R->getReg();
MVT OpVT = Op.getSimpleValueType();
const TargetRegisterClass *IIRC =
II ? TRI->getAllocatableClass(TII->getRegClass(*II, IIOpNum, TRI, *MF))
: nullptr;
const TargetRegisterClass *OpRC =
TLI->isTypeLegal(OpVT)
? TLI->getRegClassFor(OpVT,
Op.getNode()->isDivergent() ||
(IIRC && TRI->isDivergentRegClass(IIRC)))
: nullptr;
if (OpRC && IIRC && OpRC != IIRC && Register::isVirtualRegister(VReg)) {
Register NewVReg = MRI->createVirtualRegister(IIRC);
BuildMI(*MBB, InsertPos, Op.getNode()->getDebugLoc(),
TII->get(TargetOpcode::COPY), NewVReg).addReg(VReg);
VReg = NewVReg;
}
// Turn additional physreg operands into implicit uses on non-variadic
// instructions. This is used by call and return instructions passing
// arguments in registers.
bool Imp = II && (IIOpNum >= II->getNumOperands() && !II->isVariadic());
MIB.addReg(VReg, getImplRegState(Imp));
} else if (RegisterMaskSDNode *RM = dyn_cast<RegisterMaskSDNode>(Op)) {
MIB.addRegMask(RM->getRegMask());
} else if (GlobalAddressSDNode *TGA = dyn_cast<GlobalAddressSDNode>(Op)) {
MIB.addGlobalAddress(TGA->getGlobal(), TGA->getOffset(),
TGA->getTargetFlags());
} else if (BasicBlockSDNode *BBNode = dyn_cast<BasicBlockSDNode>(Op)) {
MIB.addMBB(BBNode->getBasicBlock());
} else if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(Op)) {
MIB.addFrameIndex(FI->getIndex());
} else if (JumpTableSDNode *JT = dyn_cast<JumpTableSDNode>(Op)) {
MIB.addJumpTableIndex(JT->getIndex(), JT->getTargetFlags());
} else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Op)) {
int Offset = CP->getOffset();
unsigned Align = CP->getAlignment();
Type *Type = CP->getType();
// MachineConstantPool wants an explicit alignment.
if (Align == 0) {
Align = MF->getDataLayout().getPrefTypeAlignment(Type);
if (Align == 0) {
// Alignment of vector types. FIXME!
Align = MF->getDataLayout().getTypeAllocSize(Type);
}
}
unsigned Idx;
MachineConstantPool *MCP = MF->getConstantPool();
if (CP->isMachineConstantPoolEntry())
Idx = MCP->getConstantPoolIndex(CP->getMachineCPVal(), Align);
else
Idx = MCP->getConstantPoolIndex(CP->getConstVal(), Align);
MIB.addConstantPoolIndex(Idx, Offset, CP->getTargetFlags());
} else if (ExternalSymbolSDNode *ES = dyn_cast<ExternalSymbolSDNode>(Op)) {
MIB.addExternalSymbol(ES->getSymbol(), ES->getTargetFlags());
} else if (auto *SymNode = dyn_cast<MCSymbolSDNode>(Op)) {
MIB.addSym(SymNode->getMCSymbol());
} else if (BlockAddressSDNode *BA = dyn_cast<BlockAddressSDNode>(Op)) {
MIB.addBlockAddress(BA->getBlockAddress(),
BA->getOffset(),
BA->getTargetFlags());
} else if (TargetIndexSDNode *TI = dyn_cast<TargetIndexSDNode>(Op)) {
MIB.addTargetIndex(TI->getIndex(), TI->getOffset(), TI->getTargetFlags());
} else {
assert(Op.getValueType() != MVT::Other &&
Op.getValueType() != MVT::Glue &&
"Chain and glue operands should occur at end of operand list!");
AddRegisterOperand(MIB, Op, IIOpNum, II, VRBaseMap,
IsDebug, IsClone, IsCloned);
}
}
unsigned InstrEmitter::ConstrainForSubReg(unsigned VReg, unsigned SubIdx,
MVT VT, bool isDivergent, const DebugLoc &DL) {
const TargetRegisterClass *VRC = MRI->getRegClass(VReg);
const TargetRegisterClass *RC = TRI->getSubClassWithSubReg(VRC, SubIdx);
// RC is a sub-class of VRC that supports SubIdx. Try to constrain VReg
// within reason.
if (RC && RC != VRC)
RC = MRI->constrainRegClass(VReg, RC, MinRCSize);
// VReg has been adjusted. It can be used with SubIdx operands now.
if (RC)
return VReg;
// VReg couldn't be reasonably constrained. Emit a COPY to a new virtual
// register instead.
RC = TRI->getSubClassWithSubReg(TLI->getRegClassFor(VT, isDivergent), SubIdx);
assert(RC && "No legal register class for VT supports that SubIdx");
Register NewReg = MRI->createVirtualRegister(RC);
BuildMI(*MBB, InsertPos, DL, TII->get(TargetOpcode::COPY), NewReg)
.addReg(VReg);
return NewReg;
}
/// EmitSubregNode - Generate machine code for subreg nodes.
///
void InstrEmitter::EmitSubregNode(SDNode *Node,
DenseMap<SDValue, unsigned> &VRBaseMap,
bool IsClone, bool IsCloned) {
unsigned VRBase = 0;
unsigned Opc = Node->getMachineOpcode();
// If the node is only used by a CopyToReg and the dest reg is a vreg, use
// the CopyToReg'd destination register instead of creating a new vreg.
for (SDNode *User : Node->uses()) {
if (User->getOpcode() == ISD::CopyToReg &&
User->getOperand(2).getNode() == Node) {
unsigned DestReg = cast<RegisterSDNode>(User->getOperand(1))->getReg();
if (Register::isVirtualRegister(DestReg)) {
VRBase = DestReg;
break;
}
}
}
if (Opc == TargetOpcode::EXTRACT_SUBREG) {
// EXTRACT_SUBREG is lowered as %dst = COPY %src:sub. There are no
// constraints on the %dst register, COPY can target all legal register
// classes.
unsigned SubIdx = cast<ConstantSDNode>(Node->getOperand(1))->getZExtValue();
const TargetRegisterClass *TRC =
TLI->getRegClassFor(Node->getSimpleValueType(0), Node->isDivergent());
unsigned Reg;
MachineInstr *DefMI;
RegisterSDNode *R = dyn_cast<RegisterSDNode>(Node->getOperand(0));
if (R && Register::isPhysicalRegister(R->getReg())) {
Reg = R->getReg();
DefMI = nullptr;
} else {
Reg = R ? R->getReg() : getVR(Node->getOperand(0), VRBaseMap);
DefMI = MRI->getVRegDef(Reg);
}
unsigned SrcReg, DstReg, DefSubIdx;
if (DefMI &&
TII->isCoalescableExtInstr(*DefMI, SrcReg, DstReg, DefSubIdx) &&
SubIdx == DefSubIdx &&
TRC == MRI->getRegClass(SrcReg)) {
// Optimize these:
// r1025 = s/zext r1024, 4
// r1026 = extract_subreg r1025, 4
// to a copy
// r1026 = copy r1024
VRBase = MRI->createVirtualRegister(TRC);
BuildMI(*MBB, InsertPos, Node->getDebugLoc(),
TII->get(TargetOpcode::COPY), VRBase).addReg(SrcReg);
MRI->clearKillFlags(SrcReg);
} else {
// Reg may not support a SubIdx sub-register, and we may need to
// constrain its register class or issue a COPY to a compatible register
// class.
if (Register::isVirtualRegister(Reg))
Reg = ConstrainForSubReg(Reg, SubIdx,
Node->getOperand(0).getSimpleValueType(),
Node->isDivergent(), Node->getDebugLoc());
// Create the destreg if it is missing.
if (VRBase == 0)
VRBase = MRI->createVirtualRegister(TRC);
// Create the extract_subreg machine instruction.
MachineInstrBuilder CopyMI =
BuildMI(*MBB, InsertPos, Node->getDebugLoc(),
TII->get(TargetOpcode::COPY), VRBase);
if (Register::isVirtualRegister(Reg))
CopyMI.addReg(Reg, 0, SubIdx);
else
CopyMI.addReg(TRI->getSubReg(Reg, SubIdx));
}
} else if (Opc == TargetOpcode::INSERT_SUBREG ||
Opc == TargetOpcode::SUBREG_TO_REG) {
SDValue N0 = Node->getOperand(0);
SDValue N1 = Node->getOperand(1);
SDValue N2 = Node->getOperand(2);
unsigned SubIdx = cast<ConstantSDNode>(N2)->getZExtValue();
// Figure out the register class to create for the destreg. It should be
// the largest legal register class supporting SubIdx sub-registers.
// RegisterCoalescer will constrain it further if it decides to eliminate
// the INSERT_SUBREG instruction.
//
// %dst = INSERT_SUBREG %src, %sub, SubIdx
//
// is lowered by TwoAddressInstructionPass to:
//
// %dst = COPY %src
// %dst:SubIdx = COPY %sub
//
// There is no constraint on the %src register class.
//
const TargetRegisterClass *SRC =
TLI->getRegClassFor(Node->getSimpleValueType(0), Node->isDivergent());
SRC = TRI->getSubClassWithSubReg(SRC, SubIdx);
assert(SRC && "No register class supports VT and SubIdx for INSERT_SUBREG");
if (VRBase == 0 || !SRC->hasSubClassEq(MRI->getRegClass(VRBase)))
VRBase = MRI->createVirtualRegister(SRC);
// Create the insert_subreg or subreg_to_reg machine instruction.
MachineInstrBuilder MIB =
BuildMI(*MF, Node->getDebugLoc(), TII->get(Opc), VRBase);
// If creating a subreg_to_reg, then the first input operand
// is an implicit value immediate, otherwise it's a register
if (Opc == TargetOpcode::SUBREG_TO_REG) {
const ConstantSDNode *SD = cast<ConstantSDNode>(N0);
MIB.addImm(SD->getZExtValue());
} else
AddOperand(MIB, N0, 0, nullptr, VRBaseMap, /*IsDebug=*/false,
IsClone, IsCloned);
// Add the subregister being inserted
AddOperand(MIB, N1, 0, nullptr, VRBaseMap, /*IsDebug=*/false,
IsClone, IsCloned);
MIB.addImm(SubIdx);
MBB->insert(InsertPos, MIB);
} else
llvm_unreachable("Node is not insert_subreg, extract_subreg, or subreg_to_reg");
SDValue Op(Node, 0);
bool isNew = VRBaseMap.insert(std::make_pair(Op, VRBase)).second;
(void)isNew; // Silence compiler warning.
assert(isNew && "Node emitted out of order - early");
}
/// EmitCopyToRegClassNode - Generate machine code for COPY_TO_REGCLASS nodes.
/// COPY_TO_REGCLASS is just a normal copy, except that the destination
/// register is constrained to be in a particular register class.
///
void
InstrEmitter::EmitCopyToRegClassNode(SDNode *Node,
DenseMap<SDValue, unsigned> &VRBaseMap) {
unsigned VReg = getVR(Node->getOperand(0), VRBaseMap);
// Create the new VReg in the destination class and emit a copy.
unsigned DstRCIdx = cast<ConstantSDNode>(Node->getOperand(1))->getZExtValue();
const TargetRegisterClass *DstRC =
TRI->getAllocatableClass(TRI->getRegClass(DstRCIdx));
Register NewVReg = MRI->createVirtualRegister(DstRC);
BuildMI(*MBB, InsertPos, Node->getDebugLoc(), TII->get(TargetOpcode::COPY),
NewVReg).addReg(VReg);
SDValue Op(Node, 0);
bool isNew = VRBaseMap.insert(std::make_pair(Op, NewVReg)).second;
(void)isNew; // Silence compiler warning.
assert(isNew && "Node emitted out of order - early");
}
/// EmitRegSequence - Generate machine code for REG_SEQUENCE nodes.
///
void InstrEmitter::EmitRegSequence(SDNode *Node,
DenseMap<SDValue, unsigned> &VRBaseMap,
bool IsClone, bool IsCloned) {
unsigned DstRCIdx = cast<ConstantSDNode>(Node->getOperand(0))->getZExtValue();
const TargetRegisterClass *RC = TRI->getRegClass(DstRCIdx);
Register NewVReg = MRI->createVirtualRegister(TRI->getAllocatableClass(RC));
const MCInstrDesc &II = TII->get(TargetOpcode::REG_SEQUENCE);
MachineInstrBuilder MIB = BuildMI(*MF, Node->getDebugLoc(), II, NewVReg);
unsigned NumOps = Node->getNumOperands();
// If the input pattern has a chain, then the root of the corresponding
// output pattern will get a chain as well. This can happen to be a
// REG_SEQUENCE (which is not "guarded" by countOperands/CountResults).
if (NumOps && Node->getOperand(NumOps-1).getValueType() == MVT::Other)
--NumOps; // Ignore chain if it exists.
assert((NumOps & 1) == 1 &&
"REG_SEQUENCE must have an odd number of operands!");
for (unsigned i = 1; i != NumOps; ++i) {
SDValue Op = Node->getOperand(i);
if ((i & 1) == 0) {
RegisterSDNode *R = dyn_cast<RegisterSDNode>(Node->getOperand(i-1));
// Skip physical registers as they don't have a vreg to get and we'll
// insert copies for them in TwoAddressInstructionPass anyway.
if (!R || !Register::isPhysicalRegister(R->getReg())) {
unsigned SubIdx = cast<ConstantSDNode>(Op)->getZExtValue();
unsigned SubReg = getVR(Node->getOperand(i-1), VRBaseMap);
const TargetRegisterClass *TRC = MRI->getRegClass(SubReg);
const TargetRegisterClass *SRC =
TRI->getMatchingSuperRegClass(RC, TRC, SubIdx);
if (SRC && SRC != RC) {
MRI->setRegClass(NewVReg, SRC);
RC = SRC;
}
}
}
AddOperand(MIB, Op, i+1, &II, VRBaseMap, /*IsDebug=*/false,
IsClone, IsCloned);
}
MBB->insert(InsertPos, MIB);
SDValue Op(Node, 0);
bool isNew = VRBaseMap.insert(std::make_pair(Op, NewVReg)).second;
(void)isNew; // Silence compiler warning.
assert(isNew && "Node emitted out of order - early");
}
/// EmitDbgValue - Generate machine instruction for a dbg_value node.
///
MachineInstr *
InstrEmitter::EmitDbgValue(SDDbgValue *SD,
DenseMap<SDValue, unsigned> &VRBaseMap) {
MDNode *Var = SD->getVariable();
MDNode *Expr = SD->getExpression();
DebugLoc DL = SD->getDebugLoc();
assert(cast<DILocalVariable>(Var)->isValidLocationForIntrinsic(DL) &&
"Expected inlined-at fields to agree");
SD->setIsEmitted();
if (SD->isInvalidated()) {
// An invalidated SDNode must generate an undef DBG_VALUE: although the
// original value is no longer computed, earlier DBG_VALUEs live ranges
// must not leak into later code.
auto MIB = BuildMI(*MF, DL, TII->get(TargetOpcode::DBG_VALUE));
MIB.addReg(0U);
MIB.addReg(0U, RegState::Debug);
MIB.addMetadata(Var);
MIB.addMetadata(Expr);
return &*MIB;
}
if (SD->getKind() == SDDbgValue::FRAMEIX) {
// Stack address; this needs to be lowered in target-dependent fashion.
// EmitTargetCodeForFrameDebugValue is responsible for allocation.
auto FrameMI = BuildMI(*MF, DL, TII->get(TargetOpcode::DBG_VALUE))
.addFrameIndex(SD->getFrameIx());
if (SD->isIndirect())
// Push [fi + 0] onto the DIExpression stack.
FrameMI.addImm(0);
else
// Push fi onto the DIExpression stack.
FrameMI.addReg(0);
return FrameMI.addMetadata(Var).addMetadata(Expr);
}
// Otherwise, we're going to create an instruction here.
const MCInstrDesc &II = TII->get(TargetOpcode::DBG_VALUE);
MachineInstrBuilder MIB = BuildMI(*MF, DL, II);
if (SD->getKind() == SDDbgValue::SDNODE) {
SDNode *Node = SD->getSDNode();
SDValue Op = SDValue(Node, SD->getResNo());
// It's possible we replaced this SDNode with other(s) and therefore
// didn't generate code for it. It's better to catch these cases where
// they happen and transfer the debug info, but trying to guarantee that
// in all cases would be very fragile; this is a safeguard for any
// that were missed.
DenseMap<SDValue, unsigned>::iterator I = VRBaseMap.find(Op);
if (I==VRBaseMap.end())
MIB.addReg(0U); // undef
else
AddOperand(MIB, Op, (*MIB).getNumOperands(), &II, VRBaseMap,
/*IsDebug=*/true, /*IsClone=*/false, /*IsCloned=*/false);
} else if (SD->getKind() == SDDbgValue::VREG) {
MIB.addReg(SD->getVReg(), RegState::Debug);
} else if (SD->getKind() == SDDbgValue::CONST) {
const Value *V = SD->getConst();
if (const ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
if (CI->getBitWidth() > 64)
MIB.addCImm(CI);
else
MIB.addImm(CI->getSExtValue());
} else if (const ConstantFP *CF = dyn_cast<ConstantFP>(V)) {
MIB.addFPImm(CF);
} else if (isa<ConstantPointerNull>(V)) {
// Note: This assumes that all nullptr constants are zero-valued.
MIB.addImm(0);
} else {
// Could be an Undef. In any case insert an Undef so we can see what we
// dropped.
MIB.addReg(0U);
}
} else {
// Insert an Undef so we can see what we dropped.
MIB.addReg(0U);
}
// Indirect addressing is indicated by an Imm as the second parameter.
if (SD->isIndirect())
MIB.addImm(0U);
else
MIB.addReg(0U, RegState::Debug);
MIB.addMetadata(Var);
MIB.addMetadata(Expr);
return &*MIB;
}
MachineInstr *
InstrEmitter::EmitDbgLabel(SDDbgLabel *SD) {
MDNode *Label = SD->getLabel();
DebugLoc DL = SD->getDebugLoc();
assert(cast<DILabel>(Label)->isValidLocationForIntrinsic(DL) &&
"Expected inlined-at fields to agree");
const MCInstrDesc &II = TII->get(TargetOpcode::DBG_LABEL);
MachineInstrBuilder MIB = BuildMI(*MF, DL, II);
MIB.addMetadata(Label);
return &*MIB;
}
/// EmitMachineNode - Generate machine code for a target-specific node and
/// needed dependencies.
///
void InstrEmitter::
EmitMachineNode(SDNode *Node, bool IsClone, bool IsCloned,
DenseMap<SDValue, unsigned> &VRBaseMap) {
unsigned Opc = Node->getMachineOpcode();
// Handle subreg insert/extract specially
if (Opc == TargetOpcode::EXTRACT_SUBREG ||
Opc == TargetOpcode::INSERT_SUBREG ||
Opc == TargetOpcode::SUBREG_TO_REG) {
EmitSubregNode(Node, VRBaseMap, IsClone, IsCloned);
return;
}
// Handle COPY_TO_REGCLASS specially.
if (Opc == TargetOpcode::COPY_TO_REGCLASS) {
EmitCopyToRegClassNode(Node, VRBaseMap);
return;
}
// Handle REG_SEQUENCE specially.
if (Opc == TargetOpcode::REG_SEQUENCE) {
EmitRegSequence(Node, VRBaseMap, IsClone, IsCloned);
return;
}
if (Opc == TargetOpcode::IMPLICIT_DEF)
// We want a unique VR for each IMPLICIT_DEF use.
return;
const MCInstrDesc &II = TII->get(Opc);
unsigned NumResults = CountResults(Node);
unsigned NumDefs = II.getNumDefs();
const MCPhysReg *ScratchRegs = nullptr;
// Handle STACKMAP and PATCHPOINT specially and then use the generic code.
if (Opc == TargetOpcode::STACKMAP || Opc == TargetOpcode::PATCHPOINT) {
// Stackmaps do not have arguments and do not preserve their calling
// convention. However, to simplify runtime support, they clobber the same
// scratch registers as AnyRegCC.
unsigned CC = CallingConv::AnyReg;
if (Opc == TargetOpcode::PATCHPOINT) {
CC = Node->getConstantOperandVal(PatchPointOpers::CCPos);
NumDefs = NumResults;
}
ScratchRegs = TLI->getScratchRegisters((CallingConv::ID) CC);
}
unsigned NumImpUses = 0;
unsigned NodeOperands =
countOperands(Node, II.getNumOperands() - NumDefs, NumImpUses);
bool HasPhysRegOuts = NumResults > NumDefs && II.getImplicitDefs()!=nullptr;
#ifndef NDEBUG
unsigned NumMIOperands = NodeOperands + NumResults;
if (II.isVariadic())
assert(NumMIOperands >= II.getNumOperands() &&
"Too few operands for a variadic node!");
else
assert(NumMIOperands >= II.getNumOperands() &&
NumMIOperands <= II.getNumOperands() + II.getNumImplicitDefs() +
NumImpUses &&
"#operands for dag node doesn't match .td file!");
#endif
// Create the new machine instruction.
MachineInstrBuilder MIB = BuildMI(*MF, Node->getDebugLoc(), II);
// Add result register values for things that are defined by this
// instruction.
if (NumResults) {
CreateVirtualRegisters(Node, MIB, II, IsClone, IsCloned, VRBaseMap);
// Transfer any IR flags from the SDNode to the MachineInstr
MachineInstr *MI = MIB.getInstr();
const SDNodeFlags Flags = Node->getFlags();
if (Flags.hasNoSignedZeros())
MI->setFlag(MachineInstr::MIFlag::FmNsz);
if (Flags.hasAllowReciprocal())
MI->setFlag(MachineInstr::MIFlag::FmArcp);
if (Flags.hasNoNaNs())
MI->setFlag(MachineInstr::MIFlag::FmNoNans);
if (Flags.hasNoInfs())
MI->setFlag(MachineInstr::MIFlag::FmNoInfs);
if (Flags.hasAllowContract())
MI->setFlag(MachineInstr::MIFlag::FmContract);
if (Flags.hasApproximateFuncs())
MI->setFlag(MachineInstr::MIFlag::FmAfn);
if (Flags.hasAllowReassociation())
MI->setFlag(MachineInstr::MIFlag::FmReassoc);
if (Flags.hasNoUnsignedWrap())
MI->setFlag(MachineInstr::MIFlag::NoUWrap);
if (Flags.hasNoSignedWrap())
MI->setFlag(MachineInstr::MIFlag::NoSWrap);
if (Flags.hasExact())
MI->setFlag(MachineInstr::MIFlag::IsExact);
if (Flags.hasNoFPExcept())
MI->setFlag(MachineInstr::MIFlag::NoFPExcept);
}
// Emit all of the actual operands of this instruction, adding them to the
// instruction as appropriate.
bool HasOptPRefs = NumDefs > NumResults;
assert((!HasOptPRefs || !HasPhysRegOuts) &&
"Unable to cope with optional defs and phys regs defs!");
unsigned NumSkip = HasOptPRefs ? NumDefs - NumResults : 0;
for (unsigned i = NumSkip; i != NodeOperands; ++i)
AddOperand(MIB, Node->getOperand(i), i-NumSkip+NumDefs, &II,
VRBaseMap, /*IsDebug=*/false, IsClone, IsCloned);
// Add scratch registers as implicit def and early clobber
if (ScratchRegs)
for (unsigned i = 0; ScratchRegs[i]; ++i)
MIB.addReg(ScratchRegs[i], RegState::ImplicitDefine |
RegState::EarlyClobber);
// Set the memory reference descriptions of this instruction now that it is
// part of the function.
MIB.setMemRefs(cast<MachineSDNode>(Node)->memoperands());
// Insert the instruction into position in the block. This needs to
// happen before any custom inserter hook is called so that the
// hook knows where in the block to insert the replacement code.
MBB->insert(InsertPos, MIB);
// The MachineInstr may also define physregs instead of virtregs. These
// physreg values can reach other instructions in different ways:
//
// 1. When there is a use of a Node value beyond the explicitly defined
// virtual registers, we emit a CopyFromReg for one of the implicitly
// defined physregs. This only happens when HasPhysRegOuts is true.
//
// 2. A CopyFromReg reading a physreg may be glued to this instruction.
//
// 3. A glued instruction may implicitly use a physreg.
//
// 4. A glued instruction may use a RegisterSDNode operand.
//
// Collect all the used physreg defs, and make sure that any unused physreg
// defs are marked as dead.
SmallVector<Register, 8> UsedRegs;
// Additional results must be physical register defs.
if (HasPhysRegOuts) {
for (unsigned i = NumDefs; i < NumResults; ++i) {
Register Reg = II.getImplicitDefs()[i - NumDefs];
if (!Node->hasAnyUseOfValue(i))
continue;
// This implicitly defined physreg has a use.
UsedRegs.push_back(Reg);
EmitCopyFromReg(Node, i, IsClone, IsCloned, Reg, VRBaseMap);
}
}
// Scan the glue chain for any used physregs.
if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) {
for (SDNode *F = Node->getGluedUser(); F; F = F->getGluedUser()) {
if (F->getOpcode() == ISD::CopyFromReg) {
UsedRegs.push_back(cast<RegisterSDNode>(F->getOperand(1))->getReg());
continue;
} else if (F->getOpcode() == ISD::CopyToReg) {
// Skip CopyToReg nodes that are internal to the glue chain.
continue;
}
// Collect declared implicit uses.
const MCInstrDesc &MCID = TII->get(F->getMachineOpcode());
UsedRegs.append(MCID.getImplicitUses(),
MCID.getImplicitUses() + MCID.getNumImplicitUses());
// In addition to declared implicit uses, we must also check for
// direct RegisterSDNode operands.
for (unsigned i = 0, e = F->getNumOperands(); i != e; ++i)
if (RegisterSDNode *R = dyn_cast<RegisterSDNode>(F->getOperand(i))) {
Register Reg = R->getReg();
if (Reg.isPhysical())
UsedRegs.push_back(Reg);
}
}
}
// Finally mark unused registers as dead.
if (!UsedRegs.empty() || II.getImplicitDefs() || II.hasOptionalDef())
MIB->setPhysRegsDeadExcept(UsedRegs, *TRI);
// Run post-isel target hook to adjust this instruction if needed.
if (II.hasPostISelHook())
TLI->AdjustInstrPostInstrSelection(*MIB, Node);
}
/// EmitSpecialNode - Generate machine code for a target-independent node and
/// needed dependencies.
void InstrEmitter::
EmitSpecialNode(SDNode *Node, bool IsClone, bool IsCloned,
DenseMap<SDValue, unsigned> &VRBaseMap) {
switch (Node->getOpcode()) {
default:
#ifndef NDEBUG
Node->dump();
#endif
llvm_unreachable("This target-independent node should have been selected!");
case ISD::EntryToken:
llvm_unreachable("EntryToken should have been excluded from the schedule!");
case ISD::MERGE_VALUES:
case ISD::TokenFactor: // fall thru
break;
case ISD::CopyToReg: {
unsigned DestReg = cast<RegisterSDNode>(Node->getOperand(1))->getReg();
SDValue SrcVal = Node->getOperand(2);
if (Register::isVirtualRegister(DestReg) && SrcVal.isMachineOpcode() &&
SrcVal.getMachineOpcode() == TargetOpcode::IMPLICIT_DEF) {
// Instead building a COPY to that vreg destination, build an
// IMPLICIT_DEF instruction instead.
BuildMI(*MBB, InsertPos, Node->getDebugLoc(),
TII->get(TargetOpcode::IMPLICIT_DEF), DestReg);
break;
}
unsigned SrcReg;
if (RegisterSDNode *R = dyn_cast<RegisterSDNode>(SrcVal))
SrcReg = R->getReg();
else
SrcReg = getVR(SrcVal, VRBaseMap);
if (SrcReg == DestReg) // Coalesced away the copy? Ignore.
break;
BuildMI(*MBB, InsertPos, Node->getDebugLoc(), TII->get(TargetOpcode::COPY),
DestReg).addReg(SrcReg);
break;
}
case ISD::CopyFromReg: {
unsigned SrcReg = cast<RegisterSDNode>(Node->getOperand(1))->getReg();
EmitCopyFromReg(Node, 0, IsClone, IsCloned, SrcReg, VRBaseMap);
break;
}
case ISD::EH_LABEL:
case ISD::ANNOTATION_LABEL: {
unsigned Opc = (Node->getOpcode() == ISD::EH_LABEL)
? TargetOpcode::EH_LABEL
: TargetOpcode::ANNOTATION_LABEL;
MCSymbol *S = cast<LabelSDNode>(Node)->getLabel();
BuildMI(*MBB, InsertPos, Node->getDebugLoc(),
TII->get(Opc)).addSym(S);
break;
}
case ISD::LIFETIME_START:
case ISD::LIFETIME_END: {
unsigned TarOp = (Node->getOpcode() == ISD::LIFETIME_START) ?
TargetOpcode::LIFETIME_START : TargetOpcode::LIFETIME_END;
FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(Node->getOperand(1));
BuildMI(*MBB, InsertPos, Node->getDebugLoc(), TII->get(TarOp))
.addFrameIndex(FI->getIndex());
break;
}
case ISD::INLINEASM:
case ISD::INLINEASM_BR: {
unsigned NumOps = Node->getNumOperands();
if (Node->getOperand(NumOps-1).getValueType() == MVT::Glue)
--NumOps; // Ignore the glue operand.
// Create the inline asm machine instruction.
unsigned TgtOpc = Node->getOpcode() == ISD::INLINEASM_BR
? TargetOpcode::INLINEASM_BR
: TargetOpcode::INLINEASM;
MachineInstrBuilder MIB =
BuildMI(*MF, Node->getDebugLoc(), TII->get(TgtOpc));
// Add the asm string as an external symbol operand.
SDValue AsmStrV = Node->getOperand(InlineAsm::Op_AsmString);
const char *AsmStr = cast<ExternalSymbolSDNode>(AsmStrV)->getSymbol();
MIB.addExternalSymbol(AsmStr);
// Add the HasSideEffect, isAlignStack, AsmDialect, MayLoad and MayStore
// bits.
int64_t ExtraInfo =
cast<ConstantSDNode>(Node->getOperand(InlineAsm::Op_ExtraInfo))->
getZExtValue();
MIB.addImm(ExtraInfo);
// Remember to operand index of the group flags.
SmallVector<unsigned, 8> GroupIdx;
// Remember registers that are part of early-clobber defs.
SmallVector<unsigned, 8> ECRegs;
// Add all of the operand registers to the instruction.
for (unsigned i = InlineAsm::Op_FirstOperand; i != NumOps;) {
unsigned Flags =
cast<ConstantSDNode>(Node->getOperand(i))->getZExtValue();
const unsigned NumVals = InlineAsm::getNumOperandRegisters(Flags);
GroupIdx.push_back(MIB->getNumOperands());
MIB.addImm(Flags);
++i; // Skip the ID value.
switch (InlineAsm::getKind(Flags)) {
default: llvm_unreachable("Bad flags!");
case InlineAsm::Kind_RegDef:
for (unsigned j = 0; j != NumVals; ++j, ++i) {
unsigned Reg = cast<RegisterSDNode>(Node->getOperand(i))->getReg();
// FIXME: Add dead flags for physical and virtual registers defined.
// For now, mark physical register defs as implicit to help fast
// regalloc. This makes inline asm look a lot like calls.
MIB.addReg(Reg,
RegState::Define |
getImplRegState(Register::isPhysicalRegister(Reg)));
}
break;
case InlineAsm::Kind_RegDefEarlyClobber:
case InlineAsm::Kind_Clobber:
for (unsigned j = 0; j != NumVals; ++j, ++i) {
unsigned Reg = cast<RegisterSDNode>(Node->getOperand(i))->getReg();
MIB.addReg(Reg,
RegState::Define | RegState::EarlyClobber |
getImplRegState(Register::isPhysicalRegister(Reg)));
ECRegs.push_back(Reg);
}
break;
case InlineAsm::Kind_RegUse: // Use of register.
case InlineAsm::Kind_Imm: // Immediate.
case InlineAsm::Kind_Mem: // Addressing mode.
// The addressing mode has been selected, just add all of the
// operands to the machine instruction.
for (unsigned j = 0; j != NumVals; ++j, ++i)
AddOperand(MIB, Node->getOperand(i), 0, nullptr, VRBaseMap,
/*IsDebug=*/false, IsClone, IsCloned);
// Manually set isTied bits.
if (InlineAsm::getKind(Flags) == InlineAsm::Kind_RegUse) {
unsigned DefGroup = 0;
if (InlineAsm::isUseOperandTiedToDef(Flags, DefGroup)) {
unsigned DefIdx = GroupIdx[DefGroup] + 1;
unsigned UseIdx = GroupIdx.back() + 1;
for (unsigned j = 0; j != NumVals; ++j)
MIB->tieOperands(DefIdx + j, UseIdx + j);
}
}
break;
}
}
// GCC inline assembly allows input operands to also be early-clobber
// output operands (so long as the operand is written only after it's
// used), but this does not match the semantics of our early-clobber flag.
// If an early-clobber operand register is also an input operand register,
// then remove the early-clobber flag.
for (unsigned Reg : ECRegs) {
if (MIB->readsRegister(Reg, TRI)) {
MachineOperand *MO =
MIB->findRegisterDefOperand(Reg, false, false, TRI);
assert(MO && "No def operand for clobbered register?");
MO->setIsEarlyClobber(false);
}
}
// Get the mdnode from the asm if it exists and add it to the instruction.
SDValue MDV = Node->getOperand(InlineAsm::Op_MDNode);
const MDNode *MD = cast<MDNodeSDNode>(MDV)->getMD();
if (MD)
MIB.addMetadata(MD);
MBB->insert(InsertPos, MIB);
break;
}
}
}
/// InstrEmitter - Construct an InstrEmitter and set it to start inserting
/// at the given position in the given block.
InstrEmitter::InstrEmitter(MachineBasicBlock *mbb,
MachineBasicBlock::iterator insertpos)
: MF(mbb->getParent()), MRI(&MF->getRegInfo()),
TII(MF->getSubtarget().getInstrInfo()),
TRI(MF->getSubtarget().getRegisterInfo()),
TLI(MF->getSubtarget().getTargetLowering()), MBB(mbb),
InsertPos(insertpos) {}
``` |
Maud de Braose, Baroness Mortimer of Wigmore (1224 β shortly before 23 March 1301) was a noble heiress, and one of the most important, being a member of the powerful de Braose family which held many lordships and domains in the Welsh Marches. She was the wife of Roger Mortimer, 1st Baron Mortimer of Wigmore, a celebrated soldier and Marcher baron.
A staunch Royalist during the Second Barons' War, she devised the plan to rescue Prince Edward (the future King Edward I of England) from the custody of Simon de Montfort, 6th Earl of Leicester.
She is sometimes referred to as Matilda de Braose.
Family
Maud was born in Wales in 1224, the second-eldest daughter and co-heiress of Marcher lord William de Braose and Eva Marshal. She was also a co-heiress to a portion of the Brewer estates, through her paternal grandmother Gracia, daughter of the prominent Angevine curialis William Brewer.
Maud had three sisters, Isabella, wife of Prince Dafydd ap Llywelyn; Eva, wife of William de Cantilupe; and Eleanor, wife of Humphrey de Bohun.
Her paternal grandparents were Reginald de Braose and Grecia de Briwere, and her maternal grandparents were William Marshal, 1st Earl of Pembroke, and Isabel de Clare, 4th Countess of Pembroke, daughter of Strongbow and Aoife of Leinster.
On 2 May 1230, when Maud was just six years old, her father was hanged by orders of Llewelyn the Great, Prince of Wales for alleged adultery with the latter's wife, Joan, Lady of Wales.
Marriage and inheritance
In 1247 Maud married Roger Mortimer of Wigmore. An old manuscript (written in Latin) describing the foundation of Wigmore Abbey recorded that Rog (secundus)...Radulphi et Gwladusae filius wedded Matildem de Brewys, filiam domini Willielmi de Brewys domini de Breghnoc. As the eldest son of Ralph de Mortimer and his Welsh wife, Princess Gwladys Ddu, Roger was himself a scion of another important Marcher family, and had succeeded his father in 1246, upon the latter's death. He was created 1st Baron Mortimer of Wigmore on an unknown date. Maud was seven years his senior, and they had been betrothed since childhood. He was the grandson of Llewelyn, Prince of Wales, the man who had ordered the execution of her father.
Maud's inheritance was one quarter of one third of the barony of Miles of Gloucester and the lordship of Radnor, Wales. On the occasion of their marriage, the honour of Radnor passed from the de Braose to the Mortimer family, and her marriage portion was some land at Tetbury which she inherited from her grandfather, Reginald de Braose. She also had inherited the Manor of Charlton sometime before her marriage, as well as four knight's fees in Ireland, which passed to Roger. Roger and Maud's principal residence was the Mortimers' family seat, Wigmore Castle in Herefordshire.
Issue
Roger and Maud together had at least six children:
Ralph Mortimer (died 10 August 1274), Sheriff of Shropshire and Staffordshire (1273).
Edmund Mortimer, 2nd Baron Mortimer of Wigmore (1251 β 17 July 1304), married Margaret de Fiennes, daughter of William II de Fiennes and Blanche de Brienne, by whom he had issue, including Roger Mortimer, 1st Earl of March.
Margaret Mortimer (died September 1297), married Robert de Vere, 6th Earl of Oxford, by whom she had one son.
Isabella Mortimer (died after 1300), married firstly, John Fitzalan, baron of Clun and Oswestry and de jure earl of Arundel (1246β1272), by whom she had issue; she married secondly, Robert de Hastang. She did not, as is incorrectly stated in Complete Peerage, marry Ralph d'Arderne.
Roger Mortimer de Chirk (died 3 August 1326 Tower of London), married Lucy de Wafre, by whom he had one son. He was sentenced to life imprisonment for having participated in the Marcher rebellion (known as the Despenser War) in 1321β1322, along with his nephew, Roger, who led the revolt.
William Mortimer (died before June 1297), first husband of Hawise de Muscegros, daughter and heir of Robert de Muscegros.
The Second Barons' War
Rescue of Prince Edward
Maud was described as beautiful and nimble-witted. She, like all medieval women, was expected to govern her husband's estates, manage his business affairs, arbitrate in tenants' disputes, and defend the family property during the times he was absent. These tasks Maud performed with great skill and efficiency.
During the Second Barons' War, she also proved to be a staunch Royalist and was instrumental in rallying the other Marcher lords to the side of King Henry III. It was Maud herself who devised a plan for the escape of Prince Edward after he had been taken hostage by Simon de Montfort, 6th Earl of Leicester following the Battle of Lewes. On 28 May 1265, when the Prince was held in custody at Hereford Castle, Maud sent a party of horsemen to carry him away to Wigmore Castle while he was out in the open fields, some distance from the castle, taking exercise by racing horses with his unsuspecting guardians as she had instructed him to do in the messages she had smuggled to him previously. At a signal from one of the horsemen, Edward galloped off to join the party of his liberators, and they escorted him to Wigmore Castle, twenty miles away, where Maud was waiting. She supplied the Prince with food and drink before sending him on to Ludlow Castle where he met up with the Earl of Gloucester who had defected to the side of the King.
Simon de Montfort
At the Battle of Evesham on 4 August 1265, Maud's husband Roger fought on the side of Prince Edward, and personally killed Simon de Montfort. As a reward, Roger was given de Montfort's severed head and other parts of his anatomy, including his genitals. Roger sent these gruesome trophies home to Wigmore Castle as a gift to Maud. The noted medieval historian Robert of Gloucester confirmed this by recording, To dam Maud the Mortimer that wel foule it ssende. She held a great feast that very night to celebrate the victory, and de Montfort's head was elevated in the Great Hall, still attached to the point of the lance.
Legacy
In 1300, Maud is recorded as having presented to a vacant benefice in the Stoke Bliss parish church in Herefordshire, its advowson having originally belonged to the Mortimers, but was bequeathed to Limebrook Priory by Roger.<ref>Parishes:Stoke Bliss, A History of the County of Worcester, Volume 4, pp.349β354, fn95, edited by William Page and J. W. Willis-Bund, 1924</ref>
Maud died on an unknown date shortly before 23 March 1301, and she was buried in Wigmore Abbey. Her husband Roger had died on 30 October 1282.
All the monarchs of England from 1413, as well as Mary, Queen of Scots, were directly descended from Maud, as is the current British Royal Family. Queen consorts Anne Boleyn, Jane Seymour, Catherine Howard, and Catherine Parr were also notable descendants of Maud de Braose through the latter's daughter Isabella, Countess of Arundel. Queen consorts Jane Seymour and Catherine Parr also descended from Maud's son, Edmund Mortimer, 2nd Baron Mortimer of Wigmore.
Maud de Braose was described by author Linda E. Mitchell as the "perfect example of a woman who obviated the restrictions her sex placed upon her and succeeded in placing herself squarely at the centre of the political milieu in the areas under her domestic control". Mitchell goes on to eulogise her as "one of the great architects of the late medieval March", which were the words used by Welsh historian R. R. Davies to sum up Maud's husband.
Ancestry
References
Bibliography
Costain, Thomas B. (1959). The Magnificent Century. Garden City, New York: Doubleday and Company, Inc.
Crouch, David (2002), William Marshal: Knighthood, War and Chivalry, 1147β1219, London: Routledge
Mitchell, Linda Elizabeth (2003). Portraits of Medieval Women: Family, Marriage and Politics in England 1225β1350''. New York: Palgrave MacMillan
Wigmore, Maud de Braose, Baroness
14th-century deaths
Mortimer, Maud de Braose, Baroness
Maud
Mortimer
13th-century English women
13th-century English landowners
13th-century women landowners
14th-century English women
14th-century women landowners
14th-century English landowners |
Garfield Township is one of thirty-one townships in Custer County, Nebraska, United States. The population was 106 at the 2020 census. A 2021 estimate placed the township's population at 105.
See also
County government in Nebraska
References
External links
City-Data.com
Townships in Custer County, Nebraska
Townships in Nebraska |
```go
package container
import (
"fmt"
containertypes "github.com/docker/docker/api/types/container"
networktypes "github.com/docker/docker/api/types/network"
"github.com/docker/docker/api/types/strslice"
"github.com/docker/go-connections/nat"
)
// WithName sets the name of the container
func WithName(name string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
c.Name = name
}
}
// WithLinks sets the links of the container
func WithLinks(links ...string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
c.HostConfig.Links = links
}
}
// WithImage sets the image of the container
func WithImage(image string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
c.Config.Image = image
}
}
// WithCmd sets the comannds of the container
func WithCmd(cmds ...string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
c.Config.Cmd = strslice.StrSlice(cmds)
}
}
// WithNetworkMode sets the network mode of the container
func WithNetworkMode(mode string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
c.HostConfig.NetworkMode = containertypes.NetworkMode(mode)
}
}
// WithExposedPorts sets the exposed ports of the container
func WithExposedPorts(ports ...string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
c.Config.ExposedPorts = map[nat.Port]struct{}{}
for _, port := range ports {
c.Config.ExposedPorts[nat.Port(port)] = struct{}{}
}
}
}
// WithTty sets the TTY mode of the container
func WithTty(tty bool) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
c.Config.Tty = tty
}
}
// WithWorkingDir sets the working dir of the container
func WithWorkingDir(dir string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
c.Config.WorkingDir = dir
}
}
// WithVolume sets the volume of the container
func WithVolume(name string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
if c.Config.Volumes == nil {
c.Config.Volumes = map[string]struct{}{}
}
c.Config.Volumes[name] = struct{}{}
}
}
// WithBind sets the bind mount of the container
func WithBind(src, target string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
c.HostConfig.Binds = append(c.HostConfig.Binds, fmt.Sprintf("%s:%s", src, target))
}
}
// WithIPv4 sets the specified ip for the specified network of the container
func WithIPv4(network, ip string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
if c.NetworkingConfig.EndpointsConfig == nil {
c.NetworkingConfig.EndpointsConfig = map[string]*networktypes.EndpointSettings{}
}
if v, ok := c.NetworkingConfig.EndpointsConfig[network]; !ok || v == nil {
c.NetworkingConfig.EndpointsConfig[network] = &networktypes.EndpointSettings{}
}
if c.NetworkingConfig.EndpointsConfig[network].IPAMConfig == nil {
c.NetworkingConfig.EndpointsConfig[network].IPAMConfig = &networktypes.EndpointIPAMConfig{}
}
c.NetworkingConfig.EndpointsConfig[network].IPAMConfig.IPv4Address = ip
}
}
// WithIPv6 sets the specified ip6 for the specified network of the container
func WithIPv6(network, ip string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
if c.NetworkingConfig.EndpointsConfig == nil {
c.NetworkingConfig.EndpointsConfig = map[string]*networktypes.EndpointSettings{}
}
if v, ok := c.NetworkingConfig.EndpointsConfig[network]; !ok || v == nil {
c.NetworkingConfig.EndpointsConfig[network] = &networktypes.EndpointSettings{}
}
if c.NetworkingConfig.EndpointsConfig[network].IPAMConfig == nil {
c.NetworkingConfig.EndpointsConfig[network].IPAMConfig = &networktypes.EndpointIPAMConfig{}
}
c.NetworkingConfig.EndpointsConfig[network].IPAMConfig.IPv6Address = ip
}
}
// WithLogDriver sets the log driver to use for the container
func WithLogDriver(driver string) func(*TestContainerConfig) {
return func(c *TestContainerConfig) {
if c.HostConfig == nil {
c.HostConfig = &containertypes.HostConfig{}
}
c.HostConfig.LogConfig.Type = driver
}
}
// WithAutoRemove sets the container to be removed on exit
func WithAutoRemove(c *TestContainerConfig) {
if c.HostConfig == nil {
c.HostConfig = &containertypes.HostConfig{}
}
c.HostConfig.AutoRemove = true
}
``` |
Samuel Philip Sadtler, Ph.D., LL.D. (July 18, 1847 β December 20, 1923) was an American chemist, and the first president of the American Institute of Chemical Engineers in 1908.
Life
Sadtler was born at Pine Grove, Schuylkill County, Pennsylvania, the son of a Lutheran minister, and educated at Pennsylvania College (class of 1867), at Lehigh University (one year), at Lawrence Scientific School (BSc 1870), and in Europe at the University of GΓΆttingen (PhD 1871).
As well as his professional activities, he was active in the Lutheran church.
His son, Samuel Schmucker Sadtler, also became a chemist. In 1901 they founded Samuel P. Sadtler & Son, a chemical consulting firm in Philadelphia. It was later managed by his grandson, also named Samuel Philip Sadtler.
Sadtler died December 20, 1923, in Philadelphia.
Career
Sadtler was first a professor at Pennsylvania College (1871β74) and then the University of Pennsylvania (1874β91). He then moved to the Philadelphia College of Pharmacy, where he was professor of chemistry until 1916 when he retired (and Emeritus professor afterwards). He was author of: Hand-Book of Chemical Experimentation (1877); Industrial Organic Chemistry (1901; fourth edition, 1912); and Pharmaceutical Chemistry (1895; fourth edition, 1912), with Virgil Coblentz.
In 1874, he was elected as a member of the American Philosophical Society.
In 1907 to 1908 Sadtler was part of a discussion as to the formation of a society separate from the American Chemical Society for the newly recognized profession of chemical engineering. He was initially opposed to the proliferation of societies but said he would join a chemical engineering one if it was formed. On June 22, 1908, he welcomed interested people to a meeting at the Engineers Club, Philadelphia. The forty men present became Charter Members of the American Institute of Chemical Engineers, electing Sadtler as the President, a post he held till the end of 1909. He made his Presidential address at the first Annual Meeting on December 28, 1908, and also established the Transactions of the AIChE in the same year.
References
People from Schuylkill County, Pennsylvania
1847 births
1923 deaths
American chemical engineers
American chemists
American non-fiction writers
Pennsylvania State University alumni
Pennsylvania State University faculty
University of Pennsylvania faculty
University of GΓΆttingen alumni
Harvard John A. Paulson School of Engineering and Applied Sciences alumni
Lehigh University alumni
Engineers from Pennsylvania
Chemists from Pennsylvania |
The Abbey of Bruisyard was a house of Minoresses (Poor Clares) at Bruisyard in Suffolk. It was founded from Campsey Priory in Suffolk on the initiative of Maud of Lancaster, Countess of Ulster, assisted by her son-in-law Lionel of Antwerp, in 1364β1366.
The foundation of a religious house at Rokes Hall in Bruisyard began a little earlier, when a small college of secular priests (four chaplains and a master, or warden) attached to Campsey Priory for the purposes of a chantry, established in 1346β1347, was moved to Bruisyard in 1354 to celebrate there in a new chapel of the Annunciation to the Virgin. At that time a full set of statutes was promulgated by Maud of Lancaster.
It was following the death of her daughter Elizabeth de Burgh, 4th Countess of Ulster in 1363 that Lionel of Antwerp, Duke of Clarence assisted in the refoundation of the house as a nunnery of the Order of St Clare, and at that time Maud of Lancaster, who had become a canoness at Campsey, transferred to the Poor Clares and spent her last years at Bruisyard. She and her daughter Maud de Ufford were buried there.
The house was suppressed on 17 February 1539, as part of the Dissolution of the Monasteries.
References
Monasteries in Suffolk
Poor Clare monasteries in England |
The Gilberd School is a coeducational secondary school with academy status, in Colchester, Essex, England.
History
The school originally opened on 12 July 1912 in buildings on North Hill, Colchester. During the 1930s the school became known as the North East Essex Technical College and School of Art; in 1959 the college was renamed the Gilberd County Technical School after Dr William Gilberd (also known as William Gilbert). The School of Art became the Colchester Institute.
The school was one of three Grammar Schools in Colchester: the Royal Grammar School (boys), Colchester County High School (girls) and the Gilberd School (co-educational). Educational reorganisation made all schools co-educational while also turning the Gilberd School into a Comprehensive. Since 1987 the site has been used as Colchester Sixth Form College, and the school is based in Brinkley Lane in the Highwoods area of the town.
The school converted to academy status on 1 March 2012.
In 2023 the school was found to have potentially structurally unsound buildings due to the use of reinforced autoclaved aerated concrete as a building material.
Academic results
The school's 2016 GCSE results were above the national average, with a Progress 8 score of 0.17. 67% of students achieved grades A*-C in GCSE English and Mathematics.
Notable former pupils
Alex Gilbey, footballer
James Raven, historian
Dave Rowntree, musician, politician, solicitor, composer and animator
Lewis Doyland, World Karate Champion
References
External links
Secondary schools in Essex
Educational institutions established in 1912
1912 establishments in England
Academies in Essex
Schools in Colchester (town) |
Soo Hugh () is an American television writer, producer, and showrunner. She served as co-showrunner for the first season of AMC's The Terror and is currently showrunner for Apple TV+'s Pachinko, an adaptation of Min Jin Lee's bestselling novel.
Career
Before working as a TV writer, Hugh worked in marketing and advertising. Her credits as a staff writer include AMCβs The Killing, CBSβ Under the Dome, and Apple TV+βs See. Her first series as creator/showrunner was The Whispers for ABC, which premiered in 2015. The Whispers is based on a Ray Bradbury short story and was produced by Steven Spielberg and directed by Mark Romanek.
Soo Hugh was the co-showrunner alongside show developer David Kajganich of the first season of AMC's The Terror (2018). The series was produced by Ridley Scott and is based on the Dan Simmons novel of the same name.
Hugh is currently the showrunner and executive producer of Apple TV+ series Pachinko, which premiered March 25, 2022. The series is based on the novel by Min Jin Lee, and tells the story of multiple generations of a Korean family, taking place across the US, Japan, and Korea. Kogonada and Justin Chon direct four episodes each, and also executive produce. The cast includes Youn Yuh-Jung, Jin Ha, Lee Minho, Kaho Minami, Anna Sawai, and Jimmi Simpson. On April 29, 2022, Apple renewed the series for a second season.
She inked a multi-year overall deal with Universal Content Productions in 2021. In early 2022, she launched the Thousand Miles Project through UCP. The Thousand Miles Project is an incubator program for aspiring writers telling AAPI stories, and includes an educational workshop as well as a development lab.
Hugh is set to produce an adaptation of Wisconsin Death Trip for Media Res, and a film for Amazon to be written by Lynn Nottage and Tony Gerber. She is also writing the reboot of Flight of the Navigator for Disney.
Accolades
2022: Peabody Award for her work as a creator of the show Pachinko.
References
External links
American television producers
American women television producers
American television writers
Living people
American women television writers
Place of birth missing (living people)
South Korean emigrants to the United States
Year of birth missing (living people)
21st-century American women |
Blas de Laserna Nieva (1751 in Corella, Navarra β 1816 in Madrid) was a Spanish composer.
Biography
Laserna was one of the most prolific and popular songwriters of late eighteenth and early nineteenth century Spain.
As an educator, he championed traditional Spanish musical forms, but as a theatrical impresario gave in to the public taste for Italian forms.
He composed several operas and concertos, as well as incidental music for several comedies in the popular Spanish theater. A prolific songwriter, his creative oeuvre contains more than five hundred songs (tonadillas), many with lyrics by RamΓ³n de la Cruz.
While Conductor of the orchestra of the Teatro de la Cruz, he premiered his operetta, La Gitanilla Por Amor (The Gypsy Girl For Love), in 1791.
Enrique Granados used the melody from his "La Tirana del Tripili" as the basis for "Los Requiebros" in his Goyescas suite.
References
1751 births
1816 deaths
18th-century classical composers
18th-century male musicians
18th-century conductors (music)
19th-century classical composers
19th-century conductors (music)
Spanish classical composers
Spanish male classical composers
Spanish opera composers
Spanish conductors (music)
Male opera composers
Male conductors (music)
Musicians from Madrid
Musicians from Navarre |
```scheme
;;; -*- Gerbil -*-
;;; (C) vyzo
;;; some standard sugar
(import :std/error
:std/hash-table)
(export
catch
finally
try
ignore-errors
with-destroy
defmethod/alias
using-method
with-methods
with-class-methods
with-class-method
while
until
hash
hash-eq
hash-eqv
let-hash
awhen
chain
is
with-id
with-id/expr
defsyntax/unhygienic
if-let
when-let
defcheck-argument-type
check-argument-boolean
check-argument-fixnum
check-argument-fx>=0
check-argument-vector
check-argument-u8vector
check-argument-string
check-argument-pair
check-argument-list
check-argument-procedure
syntax-eval
syntax-call
defsyntax-call)
(import (for-syntax :std/misc/func
:std/stxutil))
(defrules catch ())
(defrules finally ())
(defsyntax (try stx)
(def (generate-thunk body)
(if (null? body)
(raise-syntax-error #f "Bad syntax; missing body" stx)
(with-syntax (((e ...) (reverse body)))
#'(lambda () e ...))))
(def (generate-fini thunk fini)
(with-syntax ((thunk thunk)
((e ...) fini))
#'(with-unwind-protect thunk (lambda () e ...))))
(def (generate-catch handlers thunk)
(with-syntax (($e (genident)))
(let lp ((rest handlers) (clauses []))
(match rest
([hd . rest]
(syntax-case hd (=>)
((pred => K)
(lp rest (cons #'(((? pred) $e) => K)
clauses)))
(((pred var) body ...)
(identifier? #'var)
(lp rest (cons #'(((? pred) $e) (let ((var $e)) body ...))
clauses)))
(((var) body ...)
(identifier? #'var)
(lp rest (cons #'(#t (let ((var $e)) body ...))
clauses)))
((us body ...)
(underscore? #'us)
(lp rest (cons #'(#t (begin body ...))
clauses)))))
(else
(with-syntax (((clause ...) clauses)
(thunk thunk))
#'(with-catch
(lambda ($e) (cond clause ... (else (raise $e))))
thunk)))))))
(syntax-case stx ()
((_ e ...)
(let lp ((rest #'(e ...)) (body []))
(syntax-case rest ()
((hd . rest)
(syntax-case #'hd (catch finally)
((finally fini ...)
(if (stx-null? #'rest)
(generate-fini (generate-thunk body) #'(fini ...))
(raise-syntax-error #f "Misplaced finally clause" stx)))
((catch handler ...)
(let lp ((rest #'rest) (handlers [#'(handler ...)]))
(syntax-case rest (catch finally)
(((catch handler ...) . rest)
(lp #'rest [#'(handler ...) . handlers]))
(((finally fini ...))
(with-syntax ((body (generate-catch handlers (generate-thunk body))))
(generate-fini #'(lambda () body) #'(fini ...))))
(()
(generate-catch handlers (generate-thunk body))))))
(_ (lp #'rest (cons #'hd body)))))
(() ; no clauses, just a begin
(cons 'begin (reverse body))))))))
(defrule (ignore-errors form ...) (with-catch false (lambda () form ...)))
(defrule (with-destroy obj body ...)
(let ($obj obj)
(try body ... (finally {destroy $obj}))))
(defsyntax (defmethod/alias stx)
(syntax-case stx (@method)
((_ {method (alias ...) type} body ...)
(and (identifier? #'method)
(stx-andmap identifier? #'(alias ...))
(syntax-local-class-type-info? #'type))
(with-syntax* (((values klass) (syntax-local-value #'type))
(type::t (!class-type-descriptor klass))
(method-impl (stx-identifier #'method #'type "::" #'method)))
#'(begin
(defmethod {method type} body ...)
(bind-method! type::t 'alias method-impl) ...)))))
(defrules using-method ()
((_ obj method)
(identifier? #'method)
(def method (checked-bound-method-ref obj 'method)))
((_ obj (method method-id))
(and (identifier? #'method) (identifier? #'method-id))
(def method (checked-bound-method-ref obj 'method-id))))
(defrule (with-methods o method ...)
(begin
(def $klass (object-type o))
(with-class-methods $klass method ...)))
(defrule (with-class-methods klass method ...)
(begin (with-class-method klass method) ...))
(defrules with-class-method ()
((_ klass (method method-id))
(and (identifier? #'method) (identifier? #'method-id))
(def method
(cond
((find-method klass #f 'method-id))
(else
(error "Missing method" klass 'method-id)))))
((recur klass method)
(identifier? #'method)
(recur klass (method method))))
(defrule (while test body ...)
(let lp ()
(when test
body ...
(lp))))
(defrule (until test body ...)
(let lp ()
(unless test
body ...
(lp))))
(defrule (hash (key val) ...)
(~hash-table make-hash-table (key val) ...))
(defrule (hash-eq (key val) ...)
(~hash-table make-hash-table-eq (key val) ...))
(defrule (hash-eqv (key val) ...)
(~hash-table make-hash-table-eqv (key val) ...))
(defsyntax (~hash-table stx)
(syntax-case stx ()
((_ make-ht clause ...)
(with-syntax* ((size (stx-length #'(clause ...)))
(((key val) ...) #'(clause ...)))
#'(let (ht (make-ht size: size))
(hash-put! ht `key val) ...
ht)))))
;; the hash deconstructor macro
;; usage: (let-hash a-hash body ...)
;; rebinds %%ref so that identifiers starting with a dot are looked up in the hash:
;; .x -> (hash-ref a-hash 'x) ; strong accessor
;; .?x -> (hash-get a-hash 'x) ; weak accessor
;; .$x -> (hash-get a-hash "x") ; string weak accessor
;; ..x -> (%%ref .x) ; escape
(defsyntax (let-hash stx)
(syntax-case stx ()
((macro expr body ...)
(with-syntax ((@ref (stx-identifier #'macro '%%ref)))
#'(let (ht (: expr HashTable))
(let-syntax
((var-ref
(syntax-rules ()
((_ id) (@ref id)))))
(let-syntax
((@ref
(lambda (stx)
(syntax-case stx ()
((_ id)
(let (str (symbol->string (stx-e #'id)))
(def (str->symbol start)
(string->symbol (substring str start (string-length str))))
(def (substr start)
(substring str start (string-length str)))
(if (eq? (string-ref str 0) #\.) ; hash accessor?
(cond
((eq? (string-ref str 1) #\.) ; escape
(with-syntax ((sym (str->symbol 1)))
#'(var-ref sym)))
((eq? (string-ref str 1) #\?) ; weak
(with-syntax ((sym (str->symbol 2)))
#'(hash-get ht 'sym)))
((eq? (string-ref str 1) #\$) ; string weak
(with-syntax ((sub (substr 2)))
#'(hash-get ht 'sub)))
(else
(with-syntax ((sym (str->symbol 1)))
#'(hash-ref ht 'sym))))
#'(var-ref id))))))))
body ...)))))))
(defrule (awhen (id test) body ...)
(let (id test)
(when id body ...)))
;; chain rewrites passed expressions by passing the previous expression
;; into the position of the <> diamond symbol. In case a previous expression
;; should be used in a sub-expression, or multiple times, the expression can
;; be prefixed with a variable (supports destructuring).
;;
;; When the first expression is a <>, chain will return a unary lambda.
;;
;; Example:
;; (chain [1 2 3]
;; ([_ . rest] (map number->string rest))
;; (v (string-join v ", "))
;; (string-append <> " :)"))
;; => "2, 3 :)"
(defrules chain (<>)
((_ <> exp exp* ...)
(lambda (init)
(~chain-wrap-fn init (exp exp* ...))))
((_ init exp exp* ...)
(~chain-wrap-fn init (exp exp* ...)))
((_ <>) (lambda (init) init))
((_ init) init))
;; ~chain-wrap-fn is an auxiliary macro to wrap unary procedures which
;; have no parentheses around with parentheses: proc -> (proc) to
;; distinguish them later in ~chain-aux.
(defrules ~chain-wrap-fn ()
((_ init () previous)
(~chain-aux previous init))
((_ init ((proc arg arg* ...) . more))
(~chain-wrap-fn init more ((proc arg arg* ...))))
((_ init ((proc arg arg* ...) . more) (previous ...))
(~chain-wrap-fn init more (previous ... (proc arg arg* ...))))
((_ init (proc . more))
(~chain-wrap-fn init more ((proc))))
((_ init (proc . more) (previous ...))
(~chain-wrap-fn init more (previous ... (proc)))))
;; ~chain-aux is an auxiliary macro which takes a list of expressions
;; and the initial chain value. It then loops over the expression list
;; and transforms one expression after the other.
(defrules ~chain-aux (<>)
((_ () previous)
previous)
((_ ((var ()) . more) previous)
(syntax-error "Body expression cannot be empty"))
;; variable
((_ ((var (body1 body2 . body*)) . more) previous)
(~chain-aux more
(~chain-aux-variable (var previous) (body1 body2 . body*))))
((_ ((var (body1 body2 . body*) (body-error ...) ...) . more) previous)
(syntax-error "More than one body expression in chain-variable context"))
;; unary procedure
((_ ((fn) . more) previous)
(~chain-aux more (fn previous)))
;; diamond
((_ ((fn . args) . more) previous)
(~chain-aux more
(~chain-aux-diamond (fn . args) () previous))))
;; ~chain-aux-variable is an auxiliary macro that transforms
;; the passed expression into a with-expression.
(defrules ~chain-aux-variable ()
((_ (() (fn . args)) body)
(syntax-error "The variable must be non-empty"))
((_ (var previous) body)
(with ((var previous)) body)))
;; ~chain-aux-diamond is an auxiliary macro that replaces the <> symbol
;; with the previous expressions. There must be only one <> diamond in a row
;; and it must be in the top-level expression.
(defrules ~chain-aux-diamond (<>)
((_ () acc)
acc)
((_ () acc previous)
(syntax-error "No diamond operator in expression"))
((_ (<> . more) (acc ...))
(syntax-error "More than one diamond operator in expression"))
((_ (<> . more) (acc ...) previous)
(~chain-aux-diamond more (acc ... previous)))
((_ (v . more) (acc ...) . previous) ; previous is not set after <> was replaced
(~chain-aux-diamond more (acc ... v) . previous)))
;; is converts a given value into a predicate testing for the presence of the
;; given value. Optionally a transforming procedure can prefix the value, which
;; can in this case also be a procedure. This allows to 'get' a value out of a
;; compound data structure before comparison (first map, then test).
;; For numbers, char and string specialized procedures are used automatically
;; if passed to the macro as value and not as variable. Alternatively, the
;; test: keyword can be used to supply a test, the default is equal?.
;;
;; Example:
;; (find (is cdr 5) '((a . 2) (b . 5) (c . 6)))
;; => (b . 5)
;;
;; (filter (is file-type 'regular) (directory-files))
;; => ("Documents" "Pictures" "Videos" "Music")
(defrules is ()
((_ proc n)
(stx-number? #'n)
(~is-helper proc number? = n))
((_ proc c)
(stx-char? #'c)
(lambda (v) (eqv? c (proc v))))
((_ proc s)
(stx-string? #'s)
(~is-helper proc string? string=? s))
((_ proc other)
(if (procedure? other)
(lambda (v) (other (proc v)))
(lambda (v) (equal? other (proc v)))))
((_ proc other test: test)
(if (procedure? other)
(lambda (v) (other (proc v)))
(lambda (v) (test other (proc v)))))
((_ n)
(stx-number? #'n)
(~is-helper number? = n))
((_ c)
(stx-char? #'c)
(lambda (v) (eqv? c v)))
((_ s)
(stx-string? #'s)
(~is-helper string? string=? s))
((_ v1)
(lambda (v2) (equal? v1 v2)))
((_ v1 test: test)
(lambda (v2) (test v1 v2))))
(defrules ~is-helper ()
((_ proc type-test value-test arg)
(chain <>
(proc <>)
(v (and (type-test v) (value-test arg v)))))
((_ type-test value-test arg)
(chain <>
(v (and (type-test v) (value-test arg v))))))
;;; Easier identifier introduction
(defrules defsyntax/unhygienic ()
((_ (m-id stx) body ...)
(defsyntax m-id (compose syntax-local-introduce (lambda (stx) body ...) syntax-local-introduce)))
((_ m-id f-expr) (identifier? #'m-id)
(defsyntax m-id (compose syntax-local-introduce f-expr syntax-local-introduce))))
;; Written with the precious help of Alex Knauth
(defsyntax (with-id stx)
(syntax-case stx ()
((wi (id-spec ...) body ...)
#'(wi wi (id-spec ...) body ...))
((wi ctx (id-spec ...) body body1 body+ ...)
(identifier? #'ctx)
#'(wi ctx (id-spec ...) (begin body body1 body+ ...)))
((_ ctx (id-spec ...) template)
(identifier? #'ctx)
(with-syntax ((((id expr) ...)
(stx-map (lambda (spec) (syntax-case spec ()
((id) #'(id 'id))
((id str1 str2 ...) #'(id (list str1 str2 ...)))
(id (identifier? #'id) #'(id 'id))))
#'(id-spec ...))))
#'(begin
(defsyntax/unhygienic (m stx2)
(with-syntax ((id (stx-identifier (stx-car (stx-cdr stx2)) expr)) ...)
(... #'(... template))))
(m ctx))))))
(defrule (with-id/expr stuff ...) (let () (with-id stuff ...)))
(defrules if-let ()
((_ () then else) then)
((_ ((id expr)) then else) (if-let (id expr) then else))
((_ ((id expr) ...) then else)
(let/cc return
(def (fail) (return else))
(let* ((id (or expr (fail))) ...)
then)))
((_ (id expr) then else)
(let (test expr) (if test (let (id test) then) else))))
(defrule (when-let bindings body ...)
(if-let bindings (begin body ...) (void)))
(defrule (defcheck-argument-type type ...)
(begin
(with-id type ((pred? #'type "?")
(check "check-argument-" #'type)
(a #'type "-instance")) ; go get location for context
(defrule (check a (... ...))
(begin (check-argument (pred? a) (symbol->string 'type) a) (... ...)))) ...))
(defcheck-argument-type boolean)
(defcheck-argument-type fixnum)
(defcheck-argument-type fx>=0)
(defcheck-argument-type vector)
(defcheck-argument-type u8vector)
(defcheck-argument-type string)
(defcheck-argument-type pair)
(defcheck-argument-type list)
(defcheck-argument-type procedure)
(defsyntax (syntax-eval stx)
(syntax-case stx () ((_ expr) #'(let () (defsyntax (foo _) expr) (foo)))))
(defsyntax (syntax-call stx)
(syntax-case stx ()
((ctx expr) #'(ctx expr ctx))
((_ expr ctx args ...)
#'(let ()
(defsyntax (foo stx)
(datum->syntax (stx-car (stx-cdr stx)) (apply expr (syntax->list (stx-cdr stx)))))
(foo ctx args ...)))))
(defrule (defsyntax-call (macro ctx formals ...) body ...)
(defsyntax (macro stx)
(syntax-case stx ()
((_ ctx formals ...)
(datum->syntax (stx-car (stx-cdr stx))
(apply (lambda (ctx formals ...) body ...)
(stx-car (stx-cdr stx)) (syntax->datum (stx-cdr (stx-cdr stx))))))
((ctx formals ...) #'(ctx ctx formals ...)))))
``` |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.