text stringlengths 1 22.8M |
|---|
The following is a list of mountain passes and gaps in the Commonwealth of the Northern Mariana Islands.
See also
References
External links
Mountain passes |
Ashland High School was a rural public kindergarten-grade 12 primary and secondary school located in the Ashland, Natchitoches Parish, Louisiana from 1907 until its closing in 1981.
Ashland children now go to school in Goldonna, Louisiana and Campti, Louisiana.
References
Defunct high schools in Louisiana
Schools in Natchitoches Parish, Louisiana
Educational institutions established in 1907
Educational institutions disestablished in 1981
1907 establishments in Louisiana
1981 disestablishments in Louisiana |
The 2018–19 CAF Confederation Cup qualifying rounds were played from 27 November 2018 to 20 January 2019. A total of 70 teams competed in the qualifying rounds to decide the 16 places in the group stage of the 2018–19 CAF Confederation Cup.
Draw
The draw for the preliminary round and first round was held on 3 November 2018 in Rabat, Morocco, and was officially announced by the CAF on 9 November due to a special situation with the transitional calendar.
The entry round of the 55 teams entered into the draw was determined by their performances in the CAF competitions for the previous five seasons (CAF 5-year ranking points shown in parentheses).
Format
In the qualifying rounds, each tie was played on a home-and-away two-legged basis. If the aggregate score was tied after the second leg, the away goals rule would be applied, and if still tied, extra time would not be played, and the penalty shoot-out would be used to determine the winner (Regulations III. 13 & 14).
Schedule
The schedule of each round was as follows (matches scheduled in midweek in italics).
Bracket
The bracket of the draw was announced by the CAF on 9 November 2018.
As there were 16 winners of the Confederation Cup first round, but only 15 losers of the Champions League first round for this season, the winners of the first round with the best CAF 5-year ranking (in bold italics) advanced directly to the group stage. The remaining 15 winners of the first round advanced to the play-off round, where they were joined by the 15 losers of the Champions League first round.
Preliminary round
The preliminary round included the 46 teams that did not receive byes to the first round.
2–2 on aggregate. Stade d'Abidjan won on away goals.
1–1 on aggregate. AS Nyuki won 3–1 on penalties.
Petro de Luanda won 6–0 on aggregate.
AS CotonTchad won 3–1 on aggregate.
Hassania Agadir won 4–0 on aggregate.
Génération Foot won 1–0 on aggregate.
USM Bel Abbès won 4–1 on aggregate.
Enugu Rangers won 5–1 on aggregate.
3–3 on aggregate. Salitas won on away goals.
Mtibwa Sugar won 5–0 on aggregate.
DC Motema Pembe won 5–2 on aggregate.
FC San Pédro won 2–1 on aggregate.
1–1 on aggregate. Cercle Mbéri Sportif won 4–3 on penalties.
Kaizer Chiefs won 5–1 on aggregate.
ASSM Elgeco Plus won 4–3 on aggregate.
Al-Ittihad won on walkover after Miracle Club withdrew prior to the second leg.
New Star won 4–1 on aggregate.
Kariobangi Sharks won 9–1 on aggregate.
Asante Kotoko won on walkover after the Cameroonian Football Federation was not able to confirm the engagement of Eding Sport by the CAF deadline.
Mukura Victory Sports won 1–0 on aggregate.
Green Eagles won 5–2 on aggregate.
NA Hussein Dey won 3–1 on aggregate.
Green Buffaloes won 2–0 on aggregate.
First round
The first round included 32 teams: the 9 teams that received byes to this round, and the 23 winners of the preliminary round.
Étoile du Sahel won 3–1 on aggregate.
Petro de Luanda won 2–0 on aggregate.
Zamalek won 7–2 on aggregate.
Hassania Agadir won 2–1 on aggregate.
Enugu Rangers won 2–0 on aggregate.
Salitas won 2–0 on aggregate.
KCCA won 5–1 on aggregate.
FC San Pédro won 3–1 on aggregate.
Raja Casablanca won 5–1 on aggregate.
Kaizer Chiefs won 6–0 on aggregate.
RS Berkane won 4–0 on aggregate.
1–1 on aggregate. New Star won on away goals.
Asante Kotoko won 2–1 on aggregate.
0–0 on aggregate. Mukura Victory Sports won 5–4 on penalties.
NA Hussein Dey won 2–1 on aggregate.
CS Sfaxien won 4–2 on aggregate.
Play-off round
The play-off round included 30 teams: 15 of the 16 winners of the Confederation Cup first round, and the 15 losers of the Champions League first round.
The draw for the play-off round was held on 28 December 2018, 18:00 CAT (UTC+2), at the Nile Ritz-Carlton in Cairo, Egypt. The winners of the Confederation Cup first round were drawn against the losers of the Champions League first round, with the teams from the Confederation Cup hosting the second leg.
The teams were seeded by their performances in the CAF competitions for the previous five seasons (CAF 5-year ranking points shown in parentheses):
Pot A contained the seven seeded losers of the Champions League first round.
Pot B contained the five seeded winners of the Confederation Cup first round.
Pot C contained the eight unseeded losers of the Champions League first round.
Pot D contained the ten unseeded winners of the Confederation Cup first round.
First, a team from Pot A and a team from Pot D were drawn into seven ties. Next, a team from Pot B and a team from Pot C were drawn into five ties. Finally, the remaining teams from Pot C and Pot D were drawn into the last three ties.
The 15 winners of the play-off round advanced to the group stage to join Étoile du Sahel, who advanced directly to the group stage as the winners of the first round with the best CAF 5-year ranking.
Gor Mahia won 2–1 on aggregate.
NA Hussein Dey won 3–2 on aggregate.
Al-Hilal won 3–1 on aggregate.
Nkana won 3–0 on aggregate.
Asante Kotoko won 5–3 on aggregate.
ZESCO United won 5–2 on aggregate.
Petro de Luanda won 3–2 on aggregate.
Raja Casablanca won 2–1 on aggregate.
RS Berkane won 5–3 on aggregate.
CS Sfaxien won 3–0 on aggregate.
Zamalek won 3–1 on aggregate.
AS Otôho won 3–2 on aggregate.
Enugu Rangers won 4–2 on aggregate.
Salitas won 3–2 on aggregate.
Hassania Agadir won 5–0 on aggregate.
Notes
References
External links
Total Confederation Cup 2018/2019, CAFonline.com
1
November 2018 sports events in Africa
December 2018 sports events in Africa
January 2019 sports events in Africa |
```shell
Shebang `#!` explained
Rapidly invoke an editor to write a long, complex, or tricky command
Clear the terminal instantly
Terminal based browser
Breaking out of a terminal when `ssh` locks
``` |
Trevi (; ) is an ancient town and (municipality) in Umbria, Italy, on the lower flank of overlooking the wide plain of the Clitunno river system. Located in the Province of Perugia, it is 10 km (6 mi) SSE of Foligno and 20 km (12 mi) north of Spoleto. It is a member of the I Borghi più belli d'Italia ("The most beautiful villages of Italy") association.
The population of the was c. 8,000 in 2004, with the town proper accounting for about half of that; the rest lives in the (boroughs) of Borgo, Bovara, Cannaiola, Coste, Pigge, Manciano, Matigge, Parrano, Picciche, San Lorenzo and Santa Maria in Valle. The historical subdivisions of Trevi proper are the terzieri of Castello, Matiggia e Piano; they come into play only for the Palio.
Most of the town, densely inhabited and of decidedly medieval aspect, lies on sharply sloping terrain, only the very center being more or less flat. It commands one of the best views in Umbria, extending over 50 km (30 mi) in most westerly directions. Trevi is served by the main rail line from Rome to Ancona as well as the line from Florence to Rome via Perugia.
Geography
The territory of the extends over 71 km2 from the valley (210 m) to Mts. Brunette (1422 m) and Serano (1429 m) and can be divided into three more or less equal zones: plain, hills, and mountain; each with its own characteristic vegetation. In the plain, the very fertile land is well irrigated by many watercourses, heirs for the most part to the of Antiquity, and is suited to annual crops. The hills, of a very loose alkaline limestone with excellent drainage, are an ideal terrain for the intensive and highly specialized cultivation of olive trees that produce a very characteristic and highly prized oil. Finally, the mountains are covered in meadows and forests, primarily deciduous.
The natural environment of the territory as a whole remains largely unspoiled, this despite being significantly populated for millennia. The mountainous area is now witnessing a considerable depopulation — as elsewhere in Italy, in the second half of the 20th century settlements at the highest elevations have been rapidly losing their inhabitants to the plains. The most important growth areas since the period following World War II have been Borgo Trevi (commercial, residential, and offices), Pietrarossa (industrial), and Matigge (light and medium industry, commercial).
Many rivers and canals, none of them very large, run in a general south-to-north direction, converging into a single river near Bevagna. Their courses are by now highly artificial, the result of land and water management projects undertaken over many centuries, since they are recorded at least as early as the time of Theodoric the Great (6th century) and have continued down to our own time with the construction of dams and works to regularize the seasonal waters of the Marroggia that had been subject to frequent torrential overflows with sudden and disastrous results.
The most important of the year-round watercourses is the Clitunno River, celebrated in antiquity as the Clitumnus, whose deified waters were reputed to have miraculous properties and which have been lauded in prose and verse by Pliny the Younger, Propertius, Claudian, Addison, Byron and Carducci.
Trevi borders the following municipalities: Campello sul Clitunno, Castel Ritaldi, Foligno, Montefalco, Sellano, Spoleto.
History
In Antiquity, Pliny the Elder mentioned Trevi as a city of the ancient Umbrians, which has been confirmed by the find of an Umbrian inscription within the territory of the comune, at Bovara, in the 1950s. Treviae is also mentioned in the 5th‑century Bordeaux Itinerary. After the earliest period, the history of which is essentially unknown, but to which the walls in the core hill portion of the town attest, dated to the 1st century BC, the first stage of the development of Trevi beyond the hill took place under the Empire, when Hadrian restored the main road through the territory, the Via Flaminia, thus spurring the growth of a suburb in the plain at the place now called Pietrarossa, where sporadic excavations over several centuries have brought to light many remains: among them Roman baths that appear to have been still more or less in use in the time of St. Francis, who is known to have visited the area and to have advised people to bathe there.
In antiquity Trevi is said to have had jurisdiction over much of the valley below, all the way to the Monti Martani that form the central backbone of Umbria. The seat of a bishop until the 11th century, Trevi was a Lombard gastaldate, then, in the early 13th century, freed itself of outside rulership to become a free commune. It generally allied itself with Perugia in order to defend itself from nearby Spoleto, and fought several wars with other neighboring communes, with varying outcomes, including invasion by Spoleto in the 14th century and a brief but unhappy rule of the Trinci warlords of Foligno. In 1438 Trevi passed under the temporal rule of the Church as part of the legation of Perugia, and thenceforth its history merges first with that of the States of the Church, then (1860) with the united Kingdom of Italy.
Trevi's best fortunes were in the 15th century, when its commercial importance was such that it was called "il porto secco" — the dry port. In 1470, along with Foligno, Trevi became the fourth town in Italy to have a printing press, managed by the first known printing company. The wealth of this period can still be seen in a number of Renaissance mansions in town.
Durastante Natalucci (1687–1772) was an Italian historian who specialized in the history of Trevi.
Main sights
Trevi is enclosed in two circuits of medieval walls; in the late 20th century, the inner circuit was shown to be of Roman origin.
Trevi has about twenty old churches, several of which are of note:
The Duomo of Sant' Emiliano is a Romanesque building with a carved door and an apse with carved corbels, the interior of which was significantly reworked in the 18th century.
The Madonna delle Lacrime is a medieval conventual church with large votive frescoes, including an Adoration of the Magi by Pietro Perugino, his last known signed and dated work. The chapel of Saint Francis was frescoed by Lo Spagna, one of Perugino's pupils.
S. Martino, with Lombard lapidary remains and good paintings by Mezzastris.
S. Francesco, a large Gothic building, now housing a museum.
San Pietro in Bovara is a medieval monastery in Bovara
Santo Stefano in Manciano, another monastery in Manciano, has only its church remaining.
The territory of the comune is particularly rich in Romanesque churches: some of those in the plain, erected on the Roman Via Flaminia when that road was in use, and incorporating a fair amount of Roman spolia, remain as markers of the road's course.
Museums
Trevi's main museum is the Museo S. Francesco, attached to the Gothic church of that name, now secularized; it contains some slight Roman lapidary material, but a more important collection of Umbrian painting from the late Middle Ages through the 17th century: the main work is the Coronation of the Virgin altarpiece by Lo Spagna, originally in San Martino. Particularly notable are a group of ex-votos representative of 16th‑ through 18th‑century folk art.
The Museo della Civiltà dell' Olivo provides an educational look at the olive industry, from the planting of the olive through its processing into oil; the Trevi Flash Art Museum (Now Museum of Palazzo Lucarini) houses contemporary art exhibitions.
Economy
The mainstays of Trevi's economy are olive oil and tourism.
The comuni of Trevi and Spoleto are known for the quality of their oil, a result of near-ideal calcareous soil with excellent drainage, just the right altitude for the cultivation of olive trees, and favourable climatic conditions on the west-facing lower slopes of the Apennine mountain range.
Trevi's good train and highway access has made the town the most convenient base for visiting central Umbria for those who rely on public transportation; the unusual number of good restaurants in the comune is partly the cause, partly the result of increased tourism.
Trevi also has some light industry and food processing other than olive oil.
Holidays and local events
The patron saint of Trevi is St. Emiliano; his feast is celebrated on January 27 with a night-time procession of the Illuminata, in which his statue is carried out of the Duomo around the city along the line of the earliest medieval walls.
Shrove Tuesday sees a public celebration in the main piazza, and August a 3‑week-long music festival; but the main annual festivals take place in October: the Palio on the first Sunday, the Celery and Sausage Fair (Sagra del Sedano Nero e della Salsiccia) on the third Sunday, and a historical pageant on the fourth Sunday.
References
(Portions translated and adapted from Pro Trevi, by permission.)
External links
Official website
Trevi Tourist Office (Pro Trevi)
Trevi Flash Art Museum
Trevi Olive Oil Museum
Bill Thayer's site
Cittaslow
Hilltowns in Umbria
Roman sites of Umbria
Borghi più belli d'Italia |
```yaml
models:
- columns:
- name: id
tests:
- unique
- not_null
- relationships:
field: id
to: ref('node_0')
name: node_276
version: 2
``` |
```javascript
_(function () {
return 1;
});
function foo() {
return 1;
}
foo();
foo();
var bar = function (a) {
return a;
};
bar();
bar();
class A {
foo() {}
}
new A(); // except the ones with side-effects
function a(foo) {
return foo;
}
function b(foo, bar, baz) {
return baz;
}
function c(foo, {
bar
}) {
return bar;
}
function d({
foo
}, {
bar
}) {
return foo;
}
function e({
foo
}, bar = sideEffect()) {
return foo;
}
function e({
foo
}, bar = {}) {
return foo;
}
``` |
Ann Elizabeth Moore (born August 20, 1950, in Birmingham, England), was a member of the 1972 Olympic Equestrian team from Great Britain winning the individual jumping silver medal, on her horse Psalm. She was the second woman to win an individual medal in her sport at the Olympics, following Marion Coakes, who, riding Stroller, won a silver medal for Great Britain in the same event four years previously at the Mexico Olympics. Ann Moore was the last British rider to win an individual show jumping medal in the Olympics until Nick Skelton won gold in 2016. Moore was part of the British team that finished fourth in the team event. She retired from international showjumping in 1974 aged 23.
Moore's wins included the Queen Elizabeth II Gold Cup (1972) and individual gold medals at the Women's European Championships in 1971 and 1973.
References
Living people
1950 births
Olympic medalists in equestrian
British female equestrians
Medalists at the 1972 Summer Olympics
Olympic silver medallists for Great Britain
Equestrians at the 1972 Summer Olympics |
Niarebama is a village in the Banfora Department of Comoé Province in south-western Burkina Faso. The village has a population of 262.
References
External links
Satellite map at Maplandia.com
Populated places in the Cascades Region
Comoé Province |
Junipero Serra and Ocean is a light rail stop on the Muni Metro K Ingleside line, located in the St. Francis Wood neighborhood of San Francisco, California. It originally opened around 1896 on the United Railroads 12 line; K Ingleside service began in 1919.
The stop is also served by the route bus, plus the , and bus routes, which provide service along the K Ingleside line during the early morning and late night hours respectively when trains do not operate.
History
The private Market Street Railway opened a branch – built in just six days – of its Mission Street line along Ocean Avenue to Victoria Street on December 4, 1895, to serve the new Ingleside Racetrack. The line was extended to the Ingleside House (where Ocean Avenue now meets Junipero Serra Boulevard) shortly thereafter. The 1906 earthquake damaged many cable car and streetcar lines; in the aftermath, the United Railroads (URR) – successor to the Market Street Railway – closed many cable cars lines and expanded the electric streetcar system. The URR resumed service on the Ocean Avenue line on May 6, 1906; the line (route 12) was soon extended to Ocean Beach via Junipero Serra Boulevard and Sloat Boulevard.
The city-owned Twin Peaks Tunnel was opened on February 3, 1918, with the K Ingleside line running through the tunnel and terminating at St. Francis Circle. On November 25, 1918, the city and the struggling URR signed the "Parkside Agreements", which allowed Muni streetcars to use URR trackage on Junipero Serra Boulevard, Ocean Avenue, and Taraval Street, in exchange for a cash payment and shared maintenance costs. The K Ingleside line was extended south on Junipero Serra Boulevard and east on Ocean to Ocean and Miramar on February 21, 1919. The city purchased the private company (renamed Market Street Railway in 1921) in 1944; route 12 service was removed from Junipero Serra Boulevard and Ocean Avenue on April 8, 1945, leaving just the K Ingleside.
The line was closed and replaced by buses from February 2001 to June 7, 2003, for the Ocean Avenue Reconstruction and Improvement Project, a major street repaving and utility replacement project.
References
External links
SFMTA – Junipero Serra Blvd & Ocean Ave inbound and outbound
SFBay Transit (unofficial) – Junipero Serra Blvd & Ocean Ave
Muni Metro stations
Railway stations in the United States opened in 1896 |
```python
import weaviate.classes as wvc
from .conftest import CollectionFactory
def test_ref_with_cycle(collection_factory: CollectionFactory) -> None:
col = collection_factory(
properties=[wvc.config.Property(name="name", data_type=wvc.config.DataType.TEXT)],
vectorizer_config=wvc.config.Configure.Vectorizer.none(),
)
col.config.add_reference(wvc.config.ReferenceProperty(name="ref", target_collection=col.name))
a = col.data.insert(properties={"name": "A"})
b = col.data.insert(properties={"name": "B"}, references={"ref": a})
col.data.reference_add(from_uuid=a, from_property="ref", to=b)
ret = col.query.fetch_objects(
return_references=[
wvc.query.QueryReference(
link_on="ref",
return_properties="name",
return_references=[
wvc.query.QueryReference(
link_on="ref",
return_properties="name",
return_metadata=wvc.query.MetadataQuery.full(),
)
],
return_metadata=wvc.query.MetadataQuery.full(),
),
],
).objects
ret = sorted(ret, key=lambda x: x.properties["name"])
assert ret[0].properties["name"] == "A"
assert ret[1].properties["name"] == "B"
assert ret[0].references["ref"].objects[0].properties["name"] == "B"
assert ret[1].references["ref"].objects[0].properties["name"] == "A"
def test_ref_with_multiple_cycle(collection_factory: CollectionFactory) -> None:
col = collection_factory(
properties=[wvc.config.Property(name="name", data_type=wvc.config.DataType.TEXT)],
vectorizer_config=wvc.config.Configure.Vectorizer.none(),
)
col.config.add_reference(wvc.config.ReferenceProperty(name="ref", target_collection=col.name))
# Add objects with two cyclic paths
# c => b => a => c
# c => a => c
a = col.data.insert(properties={"name": "A"})
b = col.data.insert(properties={"name": "B"}, references={"ref": a})
c = col.data.insert(properties={"name": "C"}, references={"ref": [b, a]}) # has two refs
col.data.reference_add(from_uuid=a, from_property="ref", to=c)
ret = col.query.fetch_objects(
return_references=[
wvc.query.QueryReference(
link_on="ref",
return_properties=["name"],
return_references=[
wvc.query.QueryReference(
link_on="ref",
return_properties="name",
return_metadata=wvc.query.MetadataQuery.full(),
return_references=[
wvc.query.QueryReference(
link_on="ref",
return_properties="name",
return_metadata=wvc.query.MetadataQuery.full(),
)
],
)
],
return_metadata=wvc.query.MetadataQuery.full(),
),
],
).objects
# both paths are resolved correctly
ret = sorted(ret, key=lambda x: x.properties["name"])
assert ret[0].properties["name"] == "A"
assert ret[1].properties["name"] == "B"
assert ret[2].properties["name"] == "C"
assert ret[0].references["ref"].objects[0].properties["name"] == "C"
assert ret[1].references["ref"].objects[0].properties["name"] == "A"
ret2_objects = sorted(ret[2].references["ref"].objects, key=lambda x: x.properties["name"])
assert ret2_objects[0].properties["name"] == "A"
assert ret2_objects[1].properties["name"] == "B"
``` |
```xml
<?xml version="1.0" encoding="utf-8"?>
<resources>
<style name="AppCompatAlertDialogStyleLight" parent="Theme.AppCompat.Light.Dialog.Alert">
</style>
<style name="AppCompatAlertDialogStyleDark" parent="Theme.AppCompat.Dialog.Alert">
</style>
<style name="AppCompatDialogStyleLight" parent="Theme.AppCompat.Light.Dialog">
</style>
<style name="AppCompatDialogStyleDark" parent="Theme.AppCompat.Dialog">
</style>
<!-- ActionBar styles -->
<style name="TextSecure.DarkActionBar"
parent="@style/Widget.AppCompat.ActionBar">
<item name="background">@color/gray95</item>
<item name="elevation">4dp</item>
<item name="popupTheme">@style/ThemeOverlay.AppCompat.Dark</item>
<item name="titleTextStyle">@style/TextSecure.TitleTextStyle</item>
<item name="subtitleTextStyle">@style/TextSecure.SubtitleTextStyle</item>
<item name="android:textColorSecondary">@color/white</item>
</style>
<style name="TextSecure.LightActionBar"
parent="@style/Widget.AppCompat.ActionBar">
<item name="background">@color/delta_primary</item>
<item name="elevation">4dp</item>
<item name="popupTheme">@style/ThemeOverlay.AppCompat.Light</item>
<item name="titleTextStyle">@style/TextSecure.TitleTextStyle</item>
<item name="subtitleTextStyle">@style/TextSecure.SubtitleTextStyle</item>
<item name="android:textColorPrimary">@color/white</item>
<item name="android:textColorSecondary">@color/white</item>
</style>
<style name="TextSecure.DarkActionBar.TabBar"
parent="@style/Widget.AppCompat.ActionBar.TabBar">
<item name="background">@color/gray95</item>
<item name="android:background">@color/gray95</item>
<item name="elevation">4dp</item>
</style>
<style name="TextSecure.LightActionBar.TabBar"
parent="@style/Widget.AppCompat.ActionBar.TabBar">
<item name="android:background">@color/delta_primary</item>
<item name="background">@color/delta_primary</item>
<item name="android:textColorPrimary">@color/white</item>
<item name="android:textColorSecondary">#BFffffff</item>
<item name="elevation">4dp</item>
</style>
<style name="TextSecure.TitleTextStyle" parent="TextAppearance.AppCompat.Widget.ActionBar.Title">
<item name="android:textColor">@color/white</item>
<item name="android:textColorHint">#BFffffff</item>
<item name="android:textSize">20dp</item>
</style>
<style name="TextSecure.SubtitleTextStyle" parent="TextAppearance.AppCompat.Widget.ActionBar.Subtitle">
<item name="android:textColor">#BFffffff</item>
</style>
<!-- For Holo Light Dialog Activity Styling Emulation -->
<style name="ComposeEditText" parent="@style/Signal.Text.Body">
<item name="android:padding">2dp</item>
<item name="android:background">@null</item>
<item name="android:maxLines">5</item>
<item name="android:maxLength">64000</item>
<item name="android:textColor">?conversation_item_outgoing_text_primary_color</item>
<item name="android:capitalize">sentences</item>
<item name="android:autoText">true</item>
<item name="android:gravity">center_vertical</item>
<item name="android:imeOptions">flagNoEnterAction</item>
<item name="android:inputType">textAutoCorrect|textCapSentences|textMultiLine</item>
<item name="android:contentDescription">@string/chat_input_placeholder</item>
</style>
<style name="AttachmentTypeLabel">
<item name="android:textColor">#ff999999</item>
<item name="android:textSize">14sp</item>
</style>
<style name="ButtonPrimary">
<item name="drawableTint">@color/white</item>
<item name="android:textColor">@color/white</item>
<item name="android:paddingLeft">8dp</item>
<item name="android:paddingRight">8dp</item>
<item name="android:background">@drawable/button_background</item>
</style>
<style name="ButtonSecondary">
<item name="drawableTint">?attr/secondary_button_fg</item>
<item name="android:textColor">?attr/secondary_button_fg</item>
<item name="android:paddingLeft">8dp</item>
<item name="android:paddingRight">8dp</item>
<item name="android:background">@drawable/button_secondary_background</item>
</style>
<style name="PreferenceThemeOverlay.Fix" parent="PreferenceThemeOverlay.v14.Material">
</style>
<style name="NoMessagesTextView">
<item name="android:textColor">?attr/conversation_item_update_text_color</item>
<item name="android:textSize">16sp</item>
<item name="android:background">@drawable/conversation_item_update_background</item>
<item name="android:layout_marginLeft">12dp</item>
<item name="android:layout_marginRight">12dp</item>
<item name="android:padding">12dp</item>
</style>
<style name="SwitchTheme" parent="Theme.AppCompat.Light">
<item name="colorControlActivated">#ff2090ea</item>
</style>
<style name="ShapeAppearanceOverlay.App.CornerSize10Percent" parent="">
<item name="cornerSize">7%</item>
</style>
</resources>
``` |
Elections were held in the Colony of Western Australia in June and July 1894 to elect 33 members to the Legislative Assembly. Less than half of the seats were contested and virtually all campaigns were fought on local issues, although a few candidates were endorsed by extraparliamentary organisations. The election presented no threat to the government of Sir John Forrest, but its aftermath saw the establishment of a credible opposition for the first time, led by George Randell.
Timeline
Close of nominations
12 June: East Perth, Perth, West Perth
13 June: Fremantle, Moore, North Fremantle, South Fremantle
14 June: Bunbury, Geraldton, Roebourne, Williams
15 June: Murray, Nelson, Plantagenet, Sussex, Swan, Wellington
16 June: Greenough, Toodyay
18 June: Albany, Irwin, Northam
19 June: Ashburton, Gascoyne
21 June: York
22 June: East Kimberley, Pilbara, West Kimberley, Yilgarn
23 June: Beverley, De Grey
25 June: Murchison, Nannine
Polling day
14 June: East Perth, Perth, West Perth
15 June: Fremantle, North Fremantle, South Fremantle
18 June: Murray, Roebourne, Swan
19 June: Bunbury, Geraldton
20 June: Nelson, Plantagenet, Sussex, Toodyay, Wellington, Williams
21 June: Greenough
22 June: Albany, Northam
25 June: Irwin, Moore, York
27 June: Beverley
29 June: Ashburton, De Grey, Gascoyne
3 July: East Kimberley, Murchison, Nannine, Pilbara, West Kimberley, Yilgarn
Campaign and results
Only 15 out of the 33 seats were contested at the election, although this represented an increase of four from the 1890 election. Five of the six seats in Perth and Fremantle were contested, the exception being South Fremantle, where Elias Solomon was returned unopposed. In Perth, the major campaign issue was education – in particular, whether Catholic schools should be funded by the state. Two extraparliamentary organisations were established on either side of the debate, with the Education Defence League (led by Thomas Molloy and Timothy Quinlan) in favour and the National Education League (led by George Randell) opposed. Both leagues endorsed candidates in the three Perth electorates, with all three pro-Catholic candidates being defeated. In North Fremantle, one of the candidates, George Baker, was endorsed by the Progressive Political League (PPL), which was the political arm of the Trades and Labour Council (and a forerunner of the Labor Party). Other PPL members had been unable to meet the property qualifications necessary to stand.
Aftermath
After the election, George Randell was chosen as Leader of the Opposition, and had this status acknowledged by Forrest. Other prominent figures in the opposition were William Loton and George Leake, and there was much variation in the leadership of the opposition in the years leading up to the 1897 election.
References
1894 elections in Australia
Elections in Western Australia
June 1894 events
July 1894 events
1890s in Western Australia |
Discovery High School is a public high school in Lawrenceville, Georgia and a part of Gwinnett County Public Schools.
It was built in 2015 for over $70 million. Its opening provided relief to over crowding at Central Gwinnett High School and Berkmar High School.
it had 2,716 students. That year GCPS acquired land for the Discovery High park facilities using eminent domain.
References
External links
Discovery High School
Public high schools in Georgia (U.S. state)
Schools in Gwinnett County, Georgia
2015 establishments in Georgia (U.S. state)
Educational institutions established in 2015 |
Arkebek is a municipality in the district of Dithmarschen, in Schleswig-Holstein, Germany.
See also
Albersdorf (Amt Kirchspielslandgemeinde)
References
Dithmarschen |
Ian LeFeuvre is a Canadian musician, record producer and songwriter.
Early career
He was initially a member of the Ottawa alternative rock band Fun for Malakaï in the early 1990s, until the band broke up when drummer Peter von Althen moved to Toronto to join Skydiggers. LeFeuvre then spent several years as a guitarist for singer-songwriter Lynn Miles before reuniting with von Althen in the late 1990s to form the new band Starling. By the time that band released its debut album Sustainer in 2000 on Time Bomb Recordings, its lineup also included Danny Michel.
Although widely hyped as a "next big thing", the album's sales fell short of expectations and the label soon dropped them. Michel then left the band to pursue a solo career, and LeFeuvre concentrated on session and production work with Miles, Andy Stochansky and Jim Bryson until the band released its second and final album, Stuff You Should Have Said Before, independently in 2002.
The band briefly reunited in 2007, changing its name to The Hundreds and Thousands.
Composing work
Following Starling's breakup, LeFeuvre did extensive soundtrack and composing work, including for the television series What's Up Warthogs!, Johnny Test, The Stanley Dynamic, The Adventures of Napkin Man, 24 Hour Rental, Combat Hospital, and Hi Opie!, the films The Husband, and James vs. His Future Self, the CBC Radio documentary series The Age of Persuasion and Under the Influence, and interstitial music for Teletoon and Kids' CBC.
He received a Canadian Screen Award nomination for Best Original Song at the 3rd Canadian Screen Awards for "The Whisper in Me", a song he wrote for the film Dirty Singles; at the 8th Canadian Screen Awards in 2020, he received nominations for both Best Original Song and Best Original Score (shared with Stephen Krecklo) for his work on James vs. His Future Self.
Other
The song "22 Steps", which he cowrote with Stochansky for the album Five Star Motel, was covered by Australian pop singer Damien Leith on his album Where We Land, and was a Top 40 hit in Australia in 2006. The song "Ride with the Tide", which LeFeuvre cowrote with Emilie Mover, has been featured in the television series Girls and Pretty Little Liars.
He has also appeared as a session musician on recordings by k-os, Danny Michel, Kathleen Edwards, Jason Plumb, The Carnations, Major Maker, Scott Merritt, Lindy Vopnfjörð and Barenaked Ladies.
References
External links
Canadian rock singers
Canadian rock guitarists
Canadian male guitarists
Canadian male songwriters
Canadian film score composers
Canadian television composers
Musicians from Ottawa
Writers from Ottawa
Living people
Male film score composers
Year of birth missing (living people) |
Austria is a federal republic consisting of nine federal states. The European Commission calls them provinces. Austrian federal states can pass laws that stay within the limits of the constitution, and each federal state has representatives in the main Austrian parliament.
Geography
The majority of the land area in the federal states of Upper Austria, Lower Austria, Vienna, and Burgenland is situated in the Danube valley and thus consists almost completely of accessible and easily arable terrain. Austria's most densely populated federal state is Vienna, the heart of what is Austria's only metropolitan area. Lower Austria ranks only fourth in population density even though it contains Vienna's suburbs; this is due to large areas of land being predominantly agricultural. The alpine federal state Tyrol, the less alpine but geographically more remote federal state Carinthia, and the non-alpine but near-exclusively agricultural federal state Burgenland are Austria's least densely populated federal states. The wealthy alpine federal state Vorarlberg is something of an anomaly due to its small size, isolated location and distinct Alemannic culture.
Federalism and federal state powers
Each Austrian federal state has an elected legislature, the federal state parliament, and a federal state government (Landesregierung) headed by a governor (Landeshauptmann or Landeshauptfrau). Elections are held every five years (six years in Upper Austria). The federal state constitution, among other things, determines how the seats in the federal state government are assigned to political parties, with most federal states having a system of proportional representation based on the number of delegates in the federal state parliament in place. The governor is elected by the federal state parliament, though in practice the governor is the leader of the majority party or coalition in the federal state parliament.
Vienna, the capital of Austria, plays a double role as a city and a federal state. The mayor has the rank of a federal state governor, while the city council also functions as a federal state parliament. Under the municipal constitution, however, city and federal state business must be kept separate. Hence, while the city council and the federal state parliament have identical memberships, they hold separate meetings, and each body has separate presiding officers. When meeting as a city council, the deputies can only deal with city affairs; when meeting as a federal state parliament, they can only deal with affairs of the state.
Austrian federalism is largely theoretical, as the federal states are granted few legislative powers. Austria's constitution initially granted all legislative powers to the federal states, but many powers have been subsequently taken away, and only a few remain, such as planning and zoning codes, nature protection, hunting, fishing, farming, youth protection, certain issues of public health and welfare and the right to levy certain taxes.
All other matters, including but not limited to criminal law, civil law, corporate law, most aspects of economic law, defense, most educational matters and academia, telecommunications, and much of the healthcare system are regulated by national law. There is also no judiciary of the federal states, since Austria's constitution defines the judiciary as an exclusively national matter. This centralisation follows a historic model where central power during the time of the empire was largely concentrated in Vienna.
However, the federal state governor (Landeshauptmann) is in charge of the administration of much of federal administrative law within the respective province, which makes this post an important political position. Furthermore, federal state competences include zoning laws, planning issues and public procurement on the regional level, which adds considerable weight to federal state politics. As a practical matter, there have been cases where federal states have been able to block projects endorsed by the national government, as in the case of a railway tunnel that was to be built under the Semmering.
Austrian federal states are formally and practically endowed with a much smaller degree of autonomy than American states or German lands. Even so, Austrians tend to identify passionately with their respective federal state and often defend what little independent governance their federal state has. It is not unheard of for Austrians to consider themselves, for instance, Tyrolean first, Austrian second.
Historical development
In terms of boundaries, the present-day federal states arose from the crown lands of Austria-Hungary, an extensive multiethnic realm whose German-speaking nucleus emerged as the Republic of Austria after the dissolution of the Dual Monarchy in the end of World War I.
The federal states of Upper Austria and Lower Austria are essentially equivalent to what were the two halves of the Archduchy of Austria, a principality which formed the empire's historic heartland. Salzburg is coterminous with the former Austro-Hungarian Duchy of Salzburg (the former Archbishopric). Similarly, the federal state of Carinthia descends from the Duchy of Carinthia, the federal state of Styria descends from the Duchy of Styria, and the federal state of Tyrol descends from the Princely County of Tyrol; these three federal states had to cede territories to Czechoslovakia, Italy, and Yugoslavia when Austria emerged in its present form. The federal state of Vorarlberg is made up of territories acquired by the House of Habsburg in the 14th and 15th centuries, and was a semi-autonomous part of the County of Tyrol from 1861.
The 1815 Congress of Vienna saw most of these areas lose their autonomy. Federal state charters were put in place in 1861, although power remained with the central government. Following the First World War, the federal state governments declared themselves part of the Republic of German-Austria. Negotiations at this time between the federal state governments and the national governments resulted in the agreement to form a federation, with a nationally elected lower house and an upper house representing the provinces.
The city-federal state of Vienna was a part of Lower Austria up until 1921. The federal state of Burgenland is made up of the predominantly German-speaking area that the Kingdom of Hungary until 1921 had to cede to the First Austrian Republic after World War I as a result of the Treaties of Trianon and Saint-Germain-en-Laye.
List of federal states
The nine federal states () of Austria are:
For the purpose of the above list, a city is a community defined to be a city by Austrian law, and a town is a community not defined to be a city. Many of Austria's cities have population figures on the order of 10,000 inhabitants; some are even smaller.
See also
Distribution of seats in Austrian federal state parliaments
Districts of Austria
Flags of Austrian states
Coats of arms of the Austrian states
ISO 3166-2:AT
List of Austrian states by GDP
List of Austrian states by Human Development Index
References
Subdivisions of Austria
Austria, States
Austria 1
States, Austria
Austria geography-related lists |
The 2020 edition of the Liga Futebol Amadora Terceira Divisão was canceled by the FFTL due to the COVID-19 pandemic. The FFTL decided to hold only two official competitions for the 2020 season, The 2020 Copa FFTL and Taça 12 de Novembro.
Clubs (expected)
AC Mamura
AD Maubisse
ADR União
AS Lero (Lautem)
AS Inur Transforma
Cacusan CF
FC Lero (Iliomar)
Karau Fuik FC (Viqueque)
Kuda Ulun FC
Laleia United FC
YMCA FC
References
External links
Official website
Timor-Leste
2020 in East Timorese sport |
Sir William Pearce (18 March 1853 – 24 August 1932) was an English chemical manufacturer and Liberal Party politician in the East End of London, in England. He was Member of Parliament (MP) for Limehouse constituency from 1906 to 1922. He played cricket as an amateur for Kent County Cricket Club and Essex County Cricket Club in his 20s, making three first-class appearances, all of them for Kent.
Family and education
Pearce was born in Poplar, London, the son of William Pearce, a chemical manufacturer based in East London. He was educated at the Royal College of Chemistry and School of Mines and at the Royal College of Science in South Kensington. In 1885, he married Ethel Alexandra, the daughter of Edwin Neame from Selling, Kent. They had four daughters.
Career
Pearce followed his father into the chemical trade. He became a director of Spencer, Chapman & Messel, Ltd which was located in Silvertown. He later became a Vice-President of the Federation of British Industries and was a Fellow of the Chemical Society. He also served as the first Treasurer of the Association of British Chemical Manufacturers which was established in October 1916 to encourage co-operation in the industry in the face of effective co-ordination of the sector by wartime Germany. He was later elected a member of the Council of the London Chamber of Commerce.
Politics
Local politics
Pearce entered politics through local service. He was first elected as a member of the London School Board representing the Tower Hamlets Division at the elections of 1876 and served on the School Board for many years. In 1892 he was adopted as Progressive candidate for the London County Council (LCC) elections in the Tower Hamlets (Limehouse) division. He won his seat, topping the poll, gaining more votes than the sitting Progressive Party member, Arthur Leon. He represented Limehouse until 1901 during which time he sat on the Technical Education Board (1895–99). He was also a chairman of the Main Drainage Committee.
Parliament
Pearce first stood for Parliament at the 1900 general election for Limehouse the same division as he represented at LCC level. While he gained 41% of the votes, he was unable to unseat the sitting Unionist MP, Harry Samuel, losing by 538 votes.
He stood again in Limehouse at the 1906 general election. This was the year of the Liberal landslide and Pearce gained the seat from Samuel in another straight fight by a majority of 974 votes. In the general elections of January and December 1910 Pearce retained his seat, each time by the same majority, 431 votes.
At the next general election in 1918, Pearce was in receipt of the Coalition Coupon and was therefore not opposed by the Unionists who were supporters of the Coalition government of David Lloyd George. He did face Labour Party and National Party opposition but won comfortably by a majority of 3,390 and 60% of the poll.
In 1922 Pearce fought as a National Liberal, i.e. a continuing supporter of the Lloyd George wing of the Liberal Party. However he tried to keep the vexed question of Liberal Party internal politics out of the campaign. In the East End he said, it was less a matter of party politics than but how to recover commercial and industrial prosperity. He did however concede he was against 'Soviet style experiments'. At this election he was opposed in Limehouse by the Labour Party whose candidate was future Prime Minister Clement Attlee. Attlee insisted the real issue was Capital against Labour, a system based on exploitation or cooperative Commonwealth. In a straight fight Attlee gained the seat with a majority of 1,899 votes. Attlee held the seat until 1950 when it was abolished in boundary changes.
Pearce, who was by now almost 70 years old, did not stand at any further parliamentary elections.
Other appointments and honours
Pearce was made a Knight Bachelor in the King's birthday honours list of 1915. During the Great War he was appointed to sit on the Committee for After-War Trade chaired by Lord Balfour of Burleigh. At the time of Pearce's appointment the committee was charged with investigating the possibility of substituting the metric and decimal systems for the existing systems of weights and coinage and currency. He also served on a committee advising the Minister of Reconstruction Dr Addison on the procedure which should be adopted for dealing with the chemical trades after the war.
War Profits committee
In 1919 Pearce was appointed to chair the Select Committee of the House of Commons on War Profits. Its remit was to inquire into the practicability of a tax on wartime increases in wealth and it heard evidence into 1920. Despite Pearce's chairmanship being praised for its tact and ability, the committee was deadlocked and could not agree what the level of taxation should be – if any. It continued to meet but its members only seemed able to agree that any worthwhile levy on war profits was not practical politics. Eventually a compromise position was reached which was endorsed by all the members of the committee and a report, drafted by Pearce, was adopted unanimously. The committee did not recommend a war profits levy, merely advising that a levy could be imposed with the support of the government and Parliament but it did recommend that if the tax were levied it should be at the most modest level put before the committee by the Board of Inland Revenue affecting no more than 75,000 taxpayers. This scheme was reckoned to bring in about £500 million pounds for the government. However, there was strong opposition in the business community and this was reflected in Cabinet discussions. Eventually it was decided not to introduce the scheme but simply to stick to the existing excess profits duties.
Other Parliamentary work
In addition to his war profits responsibility, Pearce was asked to chair committees dealing with housing, the funding of hospitals and the relief of unemployment. He also served on a committee appointed under the Gas Regulation Act, 1920 to decide the appropriate level of carbon monoxide for use in domestic gas supply.
Cricket
Pearce played in three first-class cricket matches in 1878 for Kent County Cricket Club. As well as playing for Kent, he played for Essex County Cricket Club between 1877 and 1881 before the club had first-class status, as well as for the Gentlemen of Essex, Surrey Colts and Brentwood Cricket Club.
Death
Pearce died aged 79 on 24 August 1932 at Walmer in Kent.
References
1853 births
1932 deaths
People from Poplar, London
Knights Bachelor
Liberal Party (UK) MPs for English constituencies
UK MPs 1906–1910
UK MPs 1910
UK MPs 1910–1918
UK MPs 1918–1922
Members of London County Council
Progressive Party (London) politicians
Members of the London School Board
British sportsperson-politicians
National Liberal Party (UK, 1922) politicians |
Freziera stuebelii is a species of plant in the Pentaphylacaceae family. It is endemic to Colombia.
References
stuebelii
Endemic flora of Colombia
Critically endangered plants
Taxonomy articles created by Polbot |
Mark J. Pallen is a research leader at the Quadram Institute and Professor of Microbial Genomics at the University of East Anglia. In recent years, he has been at the forefront of efforts to apply next-generation sequencing to problems in microbiology and ancient DNA research.
Education
Pallen was educated at Wallington High School. He completed an undergraduate degree in medical sciences at Fitzwilliam College, Cambridge and gained his medical qualification from the London Hospital Medical College. During the early 1990s, he gained an MD while working at St Bartholomew's Hospital Medical College. In the mid-1990s, he worked for a PhD under the supervision of Gordon Dougan at Imperial College. During this time, he captained the winning team from Imperial College in the TV quiz show University Challenge, while also writing a series of articles for the British Medical Journal, introducing the medical profession to the Internet.
Microbial genomics, metagenomics and bioinformatics
In 2011, Pallen led a crowdsourced analysis of the genome of the outbreak strain from the 2011 German E. coli O104:H4 outbreak, which had been genome-sequenced on the Ion Torrent platform by the BGI. Around the same time, he also led a project in which an isolate from the 2011 German E. coli O104:H4 outbreak was genome-sequenced on three new benchtop sequencing platforms, benchmarking these new platforms. He has also shown that whole-genome sequencing can be used to track the spread of resistant bacteria
and to study the emergence of antimicrobial resistance
.
Through analyses of fecal samples from the 2011 German E. coli O104:H4 outbreak and sputum samples from The Gambia, Pallen showed that metagenomics can be used as a culture-independent approach to the diagnosis of bacterial infection. He has pioneered the use of metagenomics to open up new avenues in ancient DNA research, recovering 200-year-old Mycobacterium tuberculosis genomes from human remains and a medieval Brucella genome sequence. With Vince Gaffney and Robin Allaby, he has applied shotgun metagenomics to sedimentary ancient DNA samples, showing the presence of wheat in the British Isles 2000 years earlier than expected. Pallen has also used metagenomics to investigate the chicken gut microbiome, the gut microbiome of patients on the intensive care unit and the microbes that inhabit ticks.
From 2014 to 2020, Pallen was Principal Investigator on the £8 million MRC-funded cloud-computing project the Cloud Infrastructure for Microbial Bioinformatics (CLIMB) and now serves as director of the successor project CLIMB-BIG-DATA. In 2020, the CLIMB project received the HPCWire Readers’ Best High Performance Computing Collaboration Award for supporting analysis and publication of coronavirus genome sequences during the COVID-19 pandemic.
Microbial nomenclature
Pallen's studies on the chicken gut microbiome led him to propose over 800 new names for bacterial taxa found in this setting.
Pallen then developed a system for automating the creation of taxonomic names for bacteria, which resulted in the publication of over a million new names available for use by the microbiology research community to name new bacterial genera. Subsequently, in an opinion piece in the journal New Microbes and New Infections
and an invited talk for Bergey's International Society for Microbial Systematics, Pallen outlined his ideas for making bacterial nomenclature more accessible. In 2022, Pallen published over 65,000 names for previously unnamed bacterial and archaeal taxa in the Genome Taxonomy Database, using Python scripts to create user-friendly arbitrary names that comply with the phonotactics and grammar of Latin.
Pallen has also been active in viral nomenclature, starting with the creation of over 400 species epithets for the bacterial positive-sense single-stranded viruses in the family Leviviridae.
In March 2021, Pallen suggested in an Opinion article in New Scientist that an alternative should be found to the use of geographical names for variants of SARS-CoV-2, raiding the classical world for options. In early 2021, Pallen participated in a WHO working group, priming adoption of a scheme for naming variants of SARS-CoV-2 after letters in the Greek alphabet.
In recognition of Pallen's efforts in automating creation of names for microbes, in 2022 the name Palleniella was created for a new bacterial genus previously within the genus Prevotella.
Public understanding of science
Pallen is the author of a popular science book, The Rough Guide to Evolution. In the wake of the 2005 Kitzmiller v. Dover Area School District trial, he wrote a review with Nick Matzke, outlining the evidence that the bacterial flagellum is an evolved rather than designed entity. He commissioned and peer-reviewed Baba Brinkman's Rap Guide to Evolution and was responsible for recruiting Alice Roberts to the role of Professor of Public Engagement in Science at the University of Birmingham. In June 2011, Pallen appeared in an episode of Melvin Bragg's In our Time radio programme.
In 2018, Pallen published a book on the 1978 smallpox outbreak in the United Kingdom, The Last Days of Smallpox: Tragedy in Birmingham,
which includes a mixture of popular science and a historical narrative of the outbreak and subsequent court case.
Pallen has served alongside Alice Roberts on the advisory board of the Milner Centre for Evolution at the University of Bath
References
1960 births
Living people
People educated at Wallington County Grammar School
Alumni of Fitzwilliam College, Cambridge
Alumni of the London Hospital Medical College
Alumni of Imperial College London
Academics of the University of Birmingham
Academics of the University of Warwick
Academics of the University of East Anglia
Contestants on University Challenge
British microbiologists
English microbiologists
British bacteriologists
English bacteriologists
Pathogen genomics
20th-century British medical doctors |
Stoke City Football Club is an English professional association football club based in Stoke-on-Trent, Staffordshire.
Founded as Stoke Ramblers in 1863 the club changed its name to Stoke in 1878 and then to Stoke City in 1925 after Stoke-on-Trent was granted city status. They are the second oldest professional football club in the world, after Notts County, and are one of the founding members of the Football League. They currently play in the Football League Championship, the second tier of English football. They have never been lower than the third tier.
Their first, and to date only major trophy, the League Cup was won in 1972, when the team beat Chelsea 2–1. The club's highest league finish in the top division is 4th, which was achieved in the 1935–36 and 1946–47 seasons. Stoke played in the FA Cup Final in 2011, finishing runners-up to Manchester City and have reached three FA Cup semi-finals; in 1899 then consecutively in 1971 and 1972. Stoke have competed in European football on three occasions, firstly in 1972–73 then in 1974–75 and most recently in 2011–12. The club has won the Football League Trophy twice, in 1992 and in 2000. The club's record appearance maker is Eric Skeels, who made 597 appearances between 1959 and 1976, and the club's record goalscorer is John Ritchie, who scored 176 goals in 351 appearances from 1962 to 1975.
Honours
League
Football League Championship
Runners-up: 2007–08
Football League Second Division: 3
Champions: 1932–33, 1962–63, 1992–93
Runners-up: 1921–22
Third Place: (Promoted) 1978–79
Play-off Winners: 2001–02
Football League Third Division North: 1
Champions: 1926–27
Football Alliance: 1
Champions: 1890–91
Birmingham & District League: 1
Champions: 1910–11
Southern League Division Two: 2
Champions:1909–10, 1914–15
Runners-up: 1910–11
Cups
FA Cup
Runners-up: 2010–11
Semi-finalists: 1898–99, 1970–71 (3rd place), 1971–72 (4th place)
League Cup: 1
Winners: 1971–72
Runners-up: 1963–64
Football League Trophy: 2
Winners: 1991–92, 1999–2000
Watney Cup: 1
Winners: 1973
Staffordshire Senior Cup: 15
Winners: 1877–78, 1878–79, 1903–04 (shared), 1913–14, 1933–34, 1964–65, 1968–69 (shared), 1970–71, 1974–75, 1975–76, 1981–82, 1992–93, 1994–95, 1998–99, 2016–17
Runners-up: 1882–83, 1885–86, 1894–95, 1900–01, 1902–03, 2002–03, 2005–06, 2010–11
Birmingham Senior Cup: 2
Winners: 1901, 1914
Runners-up: 1910, 1915, 1920, 1921
Isle of Man Trophy: 3
Winners: 1987, 1991, 1992
Runners-up: 1985
Bass Charity Vase: 5
Winners: 1980, 1991, 1992, 1995, 1998
Runners-up: 1890, 1894, 1990, 1996
Player records
Appearances
Most appearances in total (League & Cup) – 597 Eric Skeels (1959–76)
Most League appearances – 507 Eric Skeels (1959–76)
Most appearances in total (Including war-time) – 675 John McCue (1940–60)
Most Consecutive Appearances – 148 Tony Allen (1960–63)
Youngest Player – Emre Tezgel 16 years, 112 days v Leyton Orient 9 January 2022
Oldest Player – Stanley Matthews 50 years, 5 days v Fulham 6 February 1965
First Substitute – Keith Bebbington in 1965 who replaced Dennis Viollet
Most Substitute Appearances For The Club – 98 Peter Crouch (2011–2019)
Top 20 most appearances
Goalscoring
Leading Goalscorer (League & Cup) – 176 John Ritchie (1963–75)
Leading Goalscorer (League only) – 140 Freddie Steele (1934–49)
Leading Goalscorer (Including war-time) – 282 Tommy Sale (1930–47)
Leading Goalscorer (FA Cup) – 19 Freddie Steele
Leading Goalscorer (League Cup) – 18 John Ritchie
Leading Goalscorer (Premier League only) – 45 Peter Crouch
Most Goals In a Season – 38 Charlie Wilson & Arthur Griffiths
Most Goals In a Season (League only) – 33 Freddie Steele
Most Goals In a single match – 7 Neville Coleman v Lincoln City 23 February 1957
Most matches Scored In Consecutively – 7 (7 Goals) Mike Sheron
Top 20 overall goalscorers
Internationals
Most capped player – 81 Glenn Whelan
First player to be capped – Edward Johnson for England 1880
First Scottish player to be capped – Tommy Hyslop 1896
First Welsh player to be capped – Mart Watkins 1902
First Irish player to be capped – James Sheridan 1905
Transfers
Record transfer fee paid – £18.3 million to Porto for Giannelli Imbula February 2016
Record transfer fee received – £20 million from West Ham United for Marko Arnautović July 2017
Progression of record fee paid
Progression of record fee received
All-Time XI & Hall of Fame members
In the final match of the 2012–13 season, as part of the club's official celebration of their 150th anniversary, supporters cast votes to determine the greatest ever Stoke City team.
Gordon Banks (1967–72)
Jackie Marsh (1967–79)
Ryan Shawcross (2007–21)
Denis Smith (1968–82)
Mike Pejic (1968–76)
Stanley Matthews (1932–47) & (1961–65)
Alan Hudson (1974–76) & (1984–85)
Jimmy Greenhoff (1969–76)
Peter Hoekstra (2001–04)
Mark Stein (1991–93) & (1996–97)
Ricardo Fuller (2006–12)
Bench
Asmir Begović (2010–2015)
Lee Dixon (1986–88)
Neil Franklin (1939–50)
Terry Conroy (1967–79)
John Ritchie (1962–66) & (1969–75)
Manager
Tony Waddington (1960–77)
English Football Hall of Fame members
A number of Stoke City players have been inducted into the English Football Hall of Fame:
Gordon Banks (2002 inductee)
Stanley Matthews (2002 inductee)
Peter Shilton (2002 inductee)
Geoff Hurst (2004 inductee)
Football League 100 Legends
The Football League 100 Legends is a list of "100 legendary football players" produced by The Football League in 1998, to celebrate the 100th season of League football.
Gordon Banks
Neil Franklin
Geoff Hurst
Stanley Matthews
Jimmy McIlroy
Peter Shilton
Neville Southall
PFA Team of the Year
The following have been included in the PFA Team of the Year whilst playing for Stoke :
1975 Peter Shilton, Alan Hudson (1st tier)
1976 Alan Hudson (1st tier)
1979 Mike Doyle, Howard Kendall (2nd tier)
1986 Keith Bertschin (2nd tier)
1986 Lee Dixon (2nd tier)
1991 Wayne Biggins (3rd tier)
1992 Vince Overson, Wayne Biggins (3rd tier)
1993 Vince Overson, Mark Stein (3rd tier)
1997 Mike Sheron (2nd tier)
1999 Graham Kavanagh (3rd tier)
2000 Graham Kavanagh (3rd tier)
2001 Graham Kavanagh (3rd tier)
2008 Ryan Shawcross, Liam Lawrence, Ricardo Fuller (2nd tier)
Managerial records
First full-time manager: Thomas Slaney who was in charge for nine years (1874 to 1883)
Longest serving manager: Tony Waddington 17 years (764 matches) (June 1960 to March 1977)
Team records
Matches
First recorded match: Stoke Ramblers 1–1 E.W Mays XV, Friendly, 17 October 1868
First match at the Victoria Ground: Stoke 2–1 Talke Rangers, Friendly, 28 March 1878
First FA Cup match: Stoke 1–2 Manchester, First Round, 10 November 1883
First Football League match: Stoke 0–2 West Bromwich Albion, 8 September 1888
First League Cup match: Stoke City 1–3 Doncaster Rovers, Second Round, 18 October 1960
First European match: Stoke City 3–1 Kaiserslautern, First Round, 13 September 1972
Last match at Victoria Ground: Stoke City 2–1 West Bromwich Albion, Division One, 4 May 1997
First match at the Britannia Stadium: Stoke City 1–1 Rochdale, League Cup, 1st Round 2nd Leg, 27 August 1997
First League match at the Britannia Stadium: Stoke City 1–2 Swindon Town, Division One, 30 August 1997
First match in the Premier League: Bolton Wanderers 3–1 Stoke City, 18 August 2008
Record wins
Record win: 26–0 v Mow Cop, Staffordshire Senior Cup, 1877
Record League Win: 10–3 v West Bromwich Albion, First Division, 4 February 1937
Record Premier League Win: 6–1 v Liverpool, 24 May 2015
Record FA Cup Win: 11–0 v Stourbridge, First Round, 26 September 1914
Record League Cup Win: 6–2 v Chelsea, Third Round, 22 October 1974
Record home Win: 9–0 v Plymouth Argyle, Second Division, 17 December 1960
Record away Win: 6–0 v Bury, Second Division, 13 March 1954
Record defeats
Record League defeat: 0–10 v Preston North End, Football League, 14 September 1889
Record Premier League defeat: 0–7 v Chelsea, Premier League, 25 April 2010
Record FA Cup defeat: 0–8 v Wolverhampton Wanderers, Quarter Final, 22 February 1890
Record League Cup defeat: 0–8 v Liverpool, Fourth Round, 24 November 2000
Record home defeat: 0–7 v Birmingham City, First Division, 10 January 1998
Record away defeat: 0–10 v Preston North End, Football League, 14 September 1889
Sequences
Longest sequence of League wins: 8 (30 March 1895 – 21 September 1895)
Longest sequence of League defeats: 11 (6 April 1985 – 17 August 1985)
Longest sequence of League draws: 5 (1 September 1973 – 15 September 1973), (21 March 1987 – 11 April 1987), (12 August 2006 – 12 September 2006)
Longest unbeaten run: 25 (5 September 1992 – 20 February 1993)
Longest run without a win: 17 (15 September 1984 – 22 December 1984), (22 April 1989 – 14 October 1989)
Longest run without a draw: 46 (30 March 1895 – 14 November 1896)
Longest successive scoring run: 21 (24 December 1921 – 22 April 1922)
Longest successive non-scoring run: 8 (29 December 1984 – 16 March 1985)
Longest run without a clean sheet: 34 (22 December 1888 – 3 October 1891)
Longest run of clean sheets: 7 (6 November 2006 – 9 December 2006) achieved by Steve Simonsen
Attendances
Record League attendance at the Victoria Ground: 51,380 v Arsenal, 29 March 1937
Record FA Cup attendance at the Victoria Ground: 50,736 v Bolton Wanderers, 2 March 1946
Record League attendance at the Bet365 Stadium: 30,022 v Everton (17 March 2018)
Record League Cup attendance at the Bet365 Stadium: 27,109 v Liverpool, 29 November 2000
Record FA Cup attendance at the Bet365 Stadium: 28,218 v Everton, 5 January 2002
Record away attendance: 84,569 v Manchester City 3 March 1934
Season-by-season performance
Stoke City F.C. in Europe
References
Books
Lowe, Simon: "Stoke City The Modern Era – A Complete Record" (Desert Island Books, )
Matthews, Tony: "The Encyclopedia of Stoke City " (Lion Press, 1994,
External links
Stoke City History
Stoke City Honours
Stoke City Records
Stoke City
Records and Statistics |
Gérard César (born 19 December 1934 in Bordeaux, Gironde) is a member of the Senate of France. He represents the Gironde department, and is a member of the Union for a Popular Movement.
References
Page on the Senate website
1934 births
Living people
Politicians from Bordeaux
Rally for the Republic politicians
Union for a Popular Movement politicians
Gaullism, a way forward for France
The Republicans (France) politicians
Deputies of the 5th National Assembly of the French Fifth Republic
Deputies of the 6th National Assembly of the French Fifth Republic
Deputies of the 8th National Assembly of the French Fifth Republic
French senators of the Fifth Republic
Senators of Gironde |
```javascript
/**
* @type {import('next').NextConfig}
*/
const nextConfig = {
experimental: {
turbo: {
rules: {
'*.test-file.js': {
browser: {
foreign: {
loaders: [
{
loader: require.resolve('./test-file-loader.js'),
options: { browser: true, foreign: true },
},
],
},
default: {
loaders: [
{
loader: require.resolve('./test-file-loader.js'),
options: { browser: true },
},
],
},
},
foreign: false,
default: {
loaders: [
{
loader: require.resolve('./test-file-loader.js'),
options: { default: true },
},
],
},
},
},
},
},
}
module.exports = nextConfig
``` |
```c++
#include <torch/csrc/jit/ir/alias_analysis.h>
#include <ATen/core/interned_strings.h>
#include <c10/util/flat_hash_map.h>
#include <c10/util/irange.h>
#include <torch/csrc/jit/api/function_impl.h>
#include <torch/csrc/jit/jit_log.h>
#include <torch/csrc/jit/passes/inliner.h>
#include <torch/csrc/jit/passes/utils/subgraph_utils.h>
#include <torch/csrc/jit/runtime/operator.h>
#include <fstream>
#include <iostream>
namespace torch::jit {
namespace {
c10::MaybeOwned<TypePtr> toSingleType(const AliasTypeSet& mut_types) {
return mut_types.size() == 1
? c10::MaybeOwned<TypePtr>::borrowed(mut_types[0])
: c10::MaybeOwned<TypePtr>::owned(c10::UnionType::create(mut_types));
}
// This class determines whether a type is mutable, and, if so, it maps
// the type to its "mutable equivalent" (see definition in
// `mapTypeToAliasTypeSet`). It uses a cache of TypePtrs to speed up these
// type lookups
class MutableTypePtrHelper {
public:
explicit MutableTypePtrHelper(
ska::flat_hash_map<TypePtr, AliasTypeSet>* mutable_type_cache)
: mutable_type_cache_(mutable_type_cache) {}
// Map any mutable type to a type such that all other types which the
// mutable type can alias will be mapped to the same type. For
// example, calling this method on `Optional[List[int]]` should be
// the same as calling this method on `List[int]`.
//
// Rules:
// - If the type is not mutable, return `nullopt`
// - If the type is a `Tuple`, that means that it's an immutable
// object that can itself contain mutable objects. We want to make
// sure that the mutable objects are correctly aliased, so we
// remove the immutable objects. (For example,
// `Tuple[int, Tensor]` would become `Tuple[Tensor]`, while
// `Tuple[int, str]` would be returned as `nullopt`.) This is a
// convenience that makes it easy to check if the `Tuple`
// contains only immutable objects, though it's not technically
// necessary
// - For any Tensor type (including Tensor types that are part of
// a larger container, e.g. `List[Tensor]`), return the
// "unshaped" version of that Tensor. An "unshaped" Tensor is a
// Tensor with shape information removed. For example, a Tensor
// of dimension 4 would map to the same type as a Tensor of
// dimension 1. This allows us to treat all subclasses of Tensor
// as a single, homogenous "Tensor" type.
std::optional<AliasTypeSet> mapTypeToAliasTypeSet(const TypePtr& type) {
if (mutable_type_cache_) {
const AliasTypeSet* result = mapTypeToBorrowedAliasTypeSet(type);
if (result) {
return *result;
}
}
return mapTypeToAliasTypeSetImpl(type);
}
const AliasTypeSet* mapTypeToBorrowedAliasTypeSet(const TypePtr& type) {
TORCH_INTERNAL_ASSERT_DEBUG_ONLY(mutable_type_cache_ != nullptr);
auto maybe_type_mapping = mutable_type_cache_->find(type);
if (maybe_type_mapping != mutable_type_cache_->end()) {
return &maybe_type_mapping->second;
}
auto mutable_types = mapTypeToAliasTypeSetImpl(type);
if (mutable_types) {
auto it =
mutable_type_cache_->emplace(type, std::move(*mutable_types)).first;
return &it->second;
} else {
return nullptr;
}
}
private:
std::optional<AliasTypeSet> mapTypeToAliasTypeSetImpl(const TypePtr& type) {
switch (type->kind()) {
case TypeKind::ListType:
case TypeKind::DictType:
case TypeKind::ClassType:
case TypeKind::TensorType:
// TODO: Look up cached contained types. this is kind of tricky
// because a `List[Optional[T]]` should still be
// `List[Optional[Unshaped(T)]]`, but
// `mapTypeToAliasTypeSet(Optional[T])` should be `T`
return AliasTypeSet{unshapedType(type)};
case TypeKind::UnionType: {
AliasTypeSet mutable_types;
for (const TypePtr& inner :
type->expectRef<UnionType>().containedTypes()) {
if (auto maybe_inner_types = mapTypeToAliasTypeSet(inner)) {
mutable_types.insert(
mutable_types.end(),
(*maybe_inner_types).begin(),
(*maybe_inner_types).end());
}
}
if (mutable_types.empty()) {
return std::nullopt;
}
return mutable_types;
}
case TypeKind::OptionalType: {
auto inner = type->castRaw<OptionalType>()->getElementType();
return mapTypeToAliasTypeSet(inner);
}
case TypeKind::AnyType:
return {AliasTypeSet{type}};
case TypeKind::FutureType: {
if (auto maybe_mut_types = mapTypeToAliasTypeSet(
type->castRaw<FutureType>()->getElementType())) {
return {AliasTypeSet{
FutureType::create(*toSingleType(*maybe_mut_types))}};
}
return std::nullopt;
}
case TypeKind::AwaitType: {
if (auto maybe_mut_types = mapTypeToAliasTypeSet(
type->castRaw<AwaitType>()->getElementType())) {
return {
AliasTypeSet{AwaitType::create(*toSingleType(*maybe_mut_types))}};
}
return std::nullopt;
}
case TypeKind::TupleType: {
std::vector<TypePtr> mutable_types;
for (const TypePtr& inner : type->expectRef<TupleType>().elements()) {
if (auto maybe_inner_types = mapTypeToAliasTypeSet(inner)) {
mutable_types.insert(
mutable_types.end(),
(*maybe_inner_types).begin(),
(*maybe_inner_types).end());
}
}
if (mutable_types.empty()) {
return std::nullopt;
}
return {AliasTypeSet{TupleType::create(mutable_types)}};
}
default:
return std::nullopt;
}
}
ska::flat_hash_map<TypePtr, AliasTypeSet>* mutable_type_cache_;
};
bool isMutableTypeImpl(
const TypePtr& type,
ska::flat_hash_map<TypePtr, AliasTypeSet>* mutable_type_cache) {
// Check common cases to avoid recursively constructing type in
// `mapTypeToAliasTypeSetPtrImpl`
auto kind = type->kind();
if (kind == TypeKind::TensorType || kind == TypeKind::ListType ||
kind == TypeKind::ClassType || kind == TypeKind::DictType) {
return true;
}
MutableTypePtrHelper helper(mutable_type_cache);
if (mutable_type_cache) {
return helper.mapTypeToBorrowedAliasTypeSet(type) != nullptr;
} else {
return helper.mapTypeToAliasTypeSet(type).has_value();
}
}
} // namespace
// Static `isMutableType` does not use cache of type -> mutable type equivalent
bool AliasDb::isMutableType(const TypePtr& type) {
return isMutableTypeImpl(type, nullptr);
}
bool AliasDb::isMutableType(const Value* v) {
return isMutableType(v->type());
}
// Make use of type -> mutable cache
bool AliasDb::isMutableTypeInternal(const TypePtr& type) const {
return isMutableTypeImpl(type, &mapped_mutable_types_);
}
bool AliasDb::isMutableTypeInternal(const Value* v) const {
return isMutableTypeInternal(v->type());
}
const AliasTypeSet* AliasDb::mapTypeToAliasTypeSetPtr(
const TypePtr& type) const {
MutableTypePtrHelper helper(&mapped_mutable_types_);
return helper.mapTypeToBorrowedAliasTypeSet(type);
}
AliasDb::~AliasDb() = default;
// Structure used during analysis to keep track of all writes at a high
// level. When the analysis is completed, this will be used to construct
// a more efficient WriteIndex
struct AliasDb::WriteRegistry {
void registerWrite(const Value* v, Node* n) {
writes_[n].emplace_back(v);
}
void registerWriteToAllContained(const Value* v, Node* n) {
containedWrites_[n].emplace_back(v);
}
void registerWriteToAllWildcards(Node* n) {
writesToAllWildcards_.insert(n);
}
std::unordered_map<Node*, std::vector<const Value*>> writes_;
std::unordered_map<Node*, std::vector<const Value*>> containedWrites_;
std::unordered_set<Node*> writesToAllWildcards_;
};
AliasDb::AliasDb(
std::shared_ptr<Graph> graph,
bool isFrozen,
bool descendFunctionCalls)
: graph_(std::move(graph)),
isFrozen_(isFrozen),
descend_function_calls_(descendFunctionCalls),
memoryDAGBuilder_(std::make_unique<MemoryDAGBuilder>()),
writeRegistry_(std::make_unique<AliasDb::WriteRegistry>()) {
analyze(graph_);
memoryDAG_ = std::move(*memoryDAGBuilder_).createMemoryDAG();
// NOLINTNEXTLINE(cppcoreguidelines-prefer-member-initializer)
memoryDAGBuilder_ = nullptr; // to make further access a hard error
memoryDAG_->setWildcards(
wildcards_, elementMap_, [&](const Value* v) -> Element* {
return getWildcard(v->type());
});
// Now we build up the various write indices based on information in the write
// registry that we populated during analysis
// Initialize the write index
writeIndex_ = TWriteIndex();
auto& writeIndex = *writeIndex_; // to make operator[] less ugly
// Build the write index
for (const auto& write : writeRegistry_->writes_) {
Node* node = write.first;
const std::vector<const Value*> writtenValues = write.second;
for (const Value* writtenValue : writtenValues) {
auto it = elementMap_.find(writtenValue);
TORCH_INTERNAL_ASSERT(
it != elementMap_.end(), "Tried to write to value not in MemoryDAG");
const auto& writtenMemoryLocations =
memoryDAG_->getMemoryLocations(it->second);
writeIndex[node] |= writtenMemoryLocations;
}
}
for (const auto& write : writeRegistry_->containedWrites_) {
Node* node = write.first;
const std::vector<const Value*>& writtenValues = write.second;
for (const Value* writtenValue : writtenValues) {
auto elem = elementMap_.at(writtenValue);
MemoryLocations writtenMemoryLocations;
memoryDAG_->collectAllContainedMemoryLocations(
elem, writtenMemoryLocations);
writeIndex[node] |= writtenMemoryLocations;
}
}
for (const auto& write : writeRegistry_->writesToAllWildcards_) {
for (const auto& pr : wildcardIndex_) {
writeIndex[write].set(pr.second->index);
}
}
// Now that we've built the write index, we can null out the WriteRegistry to
// make future access an error. In this way we prevent the index from getting
// out of sync (since we have no way of registering new writes)
// NOLINTNEXTLINE(cppcoreguidelines-prefer-member-initializer)
writeRegistry_ = nullptr;
// Initialize the write cache
buildWrittenToLocationsIndex();
GRAPH_DEBUG(toString());
}
bool AliasDb::isMutable(Node* n) const {
ValueSet vs;
for (const auto input : n->inputs()) {
vs.insert(input);
}
return writesToAlias(n, vs);
}
bool AliasDb::hasInputWriters(const Node* n) const {
for (const auto input : n->inputs()) {
if (hasWriters(input)) {
return true;
}
}
return false;
}
bool AliasDb::hasOutputWriters(const Node* n) const {
for (const auto output : n->outputs()) {
if (hasWriters(output)) {
return true;
}
}
return false;
}
bool AliasDb::hasWriters(const Node* n) const {
return hasInputWriters(n) || hasOutputWriters(n);
}
bool AliasDb::hasWriters(const Value* v) const {
if (v->mustBeNone()) {
return false;
}
auto it = elementMap_.find(v);
if (it == elementMap_.end()) {
return false;
}
const auto& el = it->second;
return writtenToLocationsIndex_->intersects(
memoryDAG_->getMemoryLocations(el));
}
void AliasDb::getWritesImpl(Node* n, MemoryLocations& ret) const {
if (writeIndex_->count(n)) {
const auto& writes = writeIndex_->at(n);
ret |= writes;
}
for (auto block : n->blocks()) {
for (auto node : block->nodes()) {
getWritesImpl(node, ret);
}
}
}
// Does `n` write to an alias of one of the values in `vs`?
bool AliasDb::writesToAlias(Node* n, const ValueSet& vs) const {
const auto writtenTo = getWrites(n);
if (writtenTo.empty()) {
return false;
}
MemoryLocations locs;
for (const auto v : vs) {
auto it = elementMap_.find(v);
if (it != elementMap_.end()) {
const auto& vlocs = memoryDAG_->getMemoryLocations(it->second);
if (writtenTo.intersects(vlocs)) {
return true;
}
}
}
return false;
}
MemoryLocations AliasDb::getWrites(Node* n) const {
MemoryLocations writes;
getWritesImpl(n, writes);
return writes;
}
void AliasDb::getReadsImpl(Node* n, MemoryLocations& ret) const {
for (const auto input : n->inputs()) {
auto it = elementMap_.find(input);
if (it != elementMap_.end()) {
auto el = it->second;
// Add all memory locations this element may alias and their contained
// elements
memoryDAG_->collectAllContainedMemoryLocations(el, ret);
}
}
for (auto block : n->blocks()) {
for (auto node : block->nodes()) {
getReadsImpl(node, ret);
}
}
}
MemoryLocations AliasDb::getReads(Node* n) const {
MemoryLocations reads;
getReadsImpl(n, reads);
return reads;
}
std::string AliasDb::getElementName(const Element* e) const {
if (e->values.empty()) {
// Not the most efficient way, but given the fact there are
// not too many types and even fewer of them will end up in
// `wildcardIndex_`, we should be fine with a linear search
// each time we hit a Wildcard leaf
for (const auto& ent : wildcardIndex_) {
if (ent.second == e) {
return std::string("WILDCARD for type ") + ent.first->str();
}
}
return "WILDCARD";
} else {
std::ostringstream ss;
if (e->values.size() == 1) {
ss << "%" << (*e->values.begin())->debugName();
return ss.str();
}
ss << "(";
for (const Value* v : e->values) {
ss << "%" << v->debugName() << ", ";
}
ss << ")";
return ss.str();
}
}
void AliasDb::dump() const {
std::cout << toString();
}
std::string AliasDb::toString() const {
std::stringstream ss{};
ss << "\n===1. GRAPH===\n";
ss << graph_->toString();
ss << "\n===2. ALIAS DB===\n";
for (const auto& ptrPair : elementMap_) {
const auto element = ptrPair.second;
int ct = 0;
if (!element->pointsTo.empty()) {
ss << getElementName(element) << " points to: ";
for (const auto pointedTo : element->pointsTo) {
if (ct > 0) {
ss << ", ";
}
++ct;
ss << getElementName(memoryDAG_->fromIndex(pointedTo));
}
ss << "\n";
}
ct = 0;
if (!element->containedElements.empty()) {
ss << getElementName(element) << " contains: ";
for (const auto contained : element->containedElements) {
ss << getElementName(memoryDAG_->fromIndex(contained));
if (ct > 0) {
ss << ", ";
}
++ct;
}
ss << "\n";
}
}
ss << "\n===3. Writes===\n";
for (const auto& pr : *writeIndex_) {
const auto node = pr.first;
const auto& values = pr.second;
ss << *node;
ss << " ";
for (const auto value : values) {
ss << getElementName(memoryDAG_->fromIndex(value)) << ", ";
}
ss << "\n";
}
ss << "\n";
return ss.str();
}
bool AliasDb::dumpToGraphvizFile(const char* filename) const {
std::ofstream dot_file(filename);
if (!dot_file.good()) {
std::cout << "Failed to create Graphviz file: '" << filename << "'\n";
return false;
}
dot_file << toGraphviz();
return true;
}
std::string AliasDb::toGraphviz() const {
std::stringstream dot;
// Local helper to generate a graphviz-friendly name encoding
// See also AliasDb::getElementName()
const auto name = [this](const Element* e) -> std::string {
if (e->values.empty()) {
for (const auto& ent : wildcardIndex_) {
if (ent.second == e) {
return std::string("\"WILDCARD for ") + ent.first->str() + "\"";
}
}
return "\"WILDCARD\"";
} else {
std::ostringstream ss;
if (e->values.size() == 1) {
ss << "\"\\%" << (*e->values.begin())->debugName() << "\"";
return ss.str();
}
ss << "\"(";
for (const Value* v : e->values) {
ss << "\\%" << v->debugName() << ", ";
}
ss << ")\"";
return ss.str();
}
};
// Include the textual representation for reference
dot << "/*\n";
dot << toString();
dot << "*/\n";
dot << "digraph alias_db {\n"
<< " rankdir=LR\n"
<< " node [shape=rect, color=gray];\n"
<< " edge [color=black];\n";
for (const auto& ptrPair : elementMap_) {
const auto element = ptrPair.second;
if (!element->pointsTo.empty()) {
for (const auto pointedTo : element->pointsTo) {
dot << " " << name(element) << " -> "
<< name(memoryDAG_->fromIndex(pointedTo)) << "\n";
}
}
if (!element->containedElements.empty()) {
for (const auto contained : element->containedElements) {
dot << " " << name(element) << " -> "
<< name(memoryDAG_->fromIndex(contained))
<< " [style=dashed, color=blue]\n";
}
}
}
dot << "}\n";
return dot.str();
}
void AliasDb::analyze(const std::shared_ptr<Graph>& graph) {
for (auto input : graph->inputs()) {
setWildcard(input);
}
analyze(graph->block());
}
void AliasDb::analyze(Block* block) {
for (auto node : block->nodes()) {
analyze(node);
}
}
void AliasDb::analyze(Node* node) {
analyzeImpl(node);
}
// Returns true if analysis was run using
// the registered analyzer.
bool AliasDb::tryRegisteredAnalysis(Node* node) {
const Operator& op = node->getOperator();
auto analysis = op.aliasAnalysisKind();
if (AliasAnalysisKind::PURE_FUNCTION == analysis) {
analyzeCreator(node);
return true;
}
return false;
}
// The basic strategy is:
// 1. Retrieve alias information for every input.
// 2. Use the node's schema's alias annotations to propgagate alias/write
// information to the outputs. For unschematized nodes, a special analyzer
// will have to be handwritten.
void AliasDb::analyzeImpl(Node* node) {
auto op = node->maybeOperator();
const bool hasSpecialCase = aliasAnalysisHasSpecialCaseFor(node->kind());
if (op) {
const auto analysis = op->aliasAnalysisKind();
const bool registeredAsSpecialCase =
analysis == AliasAnalysisKind::INTERNAL_SPECIAL_CASE;
if (C10_UNLIKELY(registeredAsSpecialCase && !hasSpecialCase)) {
TORCH_INTERNAL_ASSERT(
false,
"Op ",
node->kind().toDisplayString(),
" is registered with AliasAnalysisKind::INTERNAL_SPECIAL_CASE but doesn't have a special case.");
} else if (C10_UNLIKELY(!registeredAsSpecialCase && hasSpecialCase)) {
TORCH_INTERNAL_ASSERT(
false,
"Op ",
node->kind().toDisplayString(),
" has a special case and should be registered with AliasAnalysisKind::INTERNAL_SPECIAL_CASE but is registered with ",
c10::toString(analysis));
}
} else {
if (!hasSpecialCase) {
std::ostringstream oss;
for (const auto input : node->inputs()) {
oss << input->type()->str() << ", ";
}
oss << "\n\nCandidates:";
const auto& candidates = getAllOperatorsFor(node->kind());
for (const auto& candidate : candidates) {
oss << "\n\t" << candidate->schema();
}
TORCH_INTERNAL_ASSERT(
0,
"We don't have an op for ",
node->kind().toDisplayString(),
" but it isn't a special case. ",
"Argument types: ",
oss.str());
}
}
// These nodes are not schematized, so we need to handle them specially
switch (node->kind()) {
case prim::If:
return analyzeIf(node);
case prim::Loop:
return analyzeLoop(node);
case prim::FusionGroup:
case prim::CudaFusionGroup:
case prim::oneDNNFusionGroup:
case prim::FunctionalGraph:
case prim::DifferentiableGraph:
case prim::FallbackGraph:
return analyzeSubgraph(node);
case prim::fork:
return analyzeFork(node);
case aten::wait:
return analyzeWait(node);
case prim::awaitable:
case prim::awaitable_nowait:
return analyzeAwaitable(node);
case prim::awaitable_wait:
return analyzeAwaitableWait(node);
case prim::rpc_async:
case prim::rpc_sync:
case prim::rpc_remote:
return analyzeRpcAsync(node);
case aten::batch_norm:
return analyzeBatchNorm(node);
case aten::instance_norm:
return analyzeInstanceNorm(node);
case prim::GradOf:
return analyzeGradOf(node);
case prim::BroadcastMKLDNNTensors: {
makePointerTo(node->outputs().at(0), node->inputs().at(0));
makePointerTo(node->outputs().at(1), node->inputs().at(1));
return;
}
// TODO: think more about TensorExpr alias correctness
case prim::TensorExprGroup:
case prim::TensorExprDynamicGroup:
case prim::MKLDNNGroup:
case prim::ConstantMKLDNNTensor:
case prim::StaticSubgraph:
case prim::Constant:
case prim::AutogradZero:
case prim::AutogradAdd:
case prim::FusedConcat:
case prim::MMTreeReduce:
case prim::MMBatchSide:
case prim::BroadcastSizes:
case prim::ChunkSizes:
// this should never be seen outside of initial compilation
// but because of some dependencies with closure invoking alias
// db needs to be handled here
case prim::EmptyListLiteral:
case prim::Closure:
case prim::CreateObject:
case prim::tolist:
case prim::Uninitialized:
return analyzeCreator(node);
case prim::TupleConstruct:
case prim::DictConstruct:
case prim::ListConstruct:
return analyzeContainerConstruct(node);
case prim::TupleUnpack:
case prim::TupleIndex:
case prim::TupleSlice:
case prim::ListUnpack:
case prim::PythonOp:
case prim::GetAttr:
if (isFrozen_ && node->kind() == prim::GetAttr) {
auto& ty = node->input()->type();
if (ty->expectRef<ClassType>().is_module()) {
return analyzeCreator(node);
}
}
return analyzeExtractor(node);
case prim::unchecked_cast:
return makePointerTo(node->output(), node->input());
case prim::ConstantChunk:
return analyzeChunk(node);
case prim::BroadcastingChunk:
return analyzeBroadcastingChunk(node);
case prim::SetAttr:
return analyzeSetAttr(node);
case prim::profile_ivalue:
case prim::profile:
makePointerTo(node->output(), node->inputs().at(0));
return;
case prim::TypeCheck:
case prim::RequiresGradCheck: {
auto num_inputs = node->inputs().size();
for (const auto i : c10::irange(num_inputs)) {
makePointerTo(node->outputs().at(i), node->inputs().at(i));
}
return;
}
case prim::BailOut:
TORCH_INTERNAL_ASSERT(
node->inputs().at(0)->node()->kind() == prim::BailoutTemplate);
makePointerTo(node->output(), node->inputs().at(1));
return;
case prim::Guard:
makePointerTo(node->output(), node->inputs().at(0));
return;
case prim::CallFunction:
case prim::CallMethod: {
// TODO: this can be improved with summarizes of what the function does
// for now we assume the worst
if (!descend_function_calls_) {
return analyzeConservative(node);
}
auto g = tryToGraphFunction(node);
if (!g) {
return analyzeConservative(node);
}
// this is an unoptimized path - we copy the subgraph for each function
// call past the first - so we do not generally enable the recursive
// analysis. use cases for fine-grained alias analysis without inlining
// are very uncommon
auto graph = g->optimized_graph();
// alias analysis will use Value* as mappings for information,
// so for each analysis of a particular function call we need a new graph
// for all copies made, store them for duration of analysis so we do not
// run into lifetime issues with the graph
std::vector<std::shared_ptr<Graph>>& graphs =
function_call_copies_[graph.get()];
if (graphs.empty()) {
graphs.push_back(graph);
analyzeSubgraph(node, graph);
} else {
auto copied_graph = graph->copy();
graphs.push_back(copied_graph);
analyzeSubgraph(node, copied_graph);
}
return;
}
case prim::Enter:
case prim::Exit:
// TODO: this can be improved with summarizes of what the function does
// for now we assume the worst
// NB: update safeToChangeAliasingRelationship if changed
return analyzeConservative(node);
case prim::Print:
case prim::isinstance:
// These ops do nothing
return;
default:
if (tryRegisteredAnalysis(node)) {
return;
}
}
TORCH_INTERNAL_ASSERT(op, "We should have an op schema if we get to here");
const AliasAnalysisKind analysis = op->aliasAnalysisKind();
TORCH_INTERNAL_ASSERT(
analysis != AliasAnalysisKind::INTERNAL_SPECIAL_CASE &&
!aliasAnalysisHasSpecialCaseFor(node->kind()),
"Special cases should be handled already if we're here.");
if (node->kind().is_aten() || node->kind().is_prim() ||
node->kind().is_cuda()) {
// TODO There is nothing in the system that relies on aten:: and prim::
// ops using AliasAnalysisKind::FROM_SCHEMA or
// AliasAnalysisKind::INTERNAL_SPECIAL_CASE, but this is the intended
// behavior for all current ops and a good error check. We can consider
// lifting this constraint later if we have a use case for it.
TORCH_INTERNAL_ASSERT(
analysis == AliasAnalysisKind::FROM_SCHEMA ||
analysis == AliasAnalysisKind::CONSERVATIVE,
"aten:: and prim:: operators should use AliasAnalysisKind::FROM_SCHEMA or "
"AliasAnalysisKind::CONSERVATIVE(if really necessary), but ",
node->kind().toDisplayString(),
" doesn't. Note: Ideally, prim:: operators actually shouldn't have a schema ",
"and then use AliasAnalysisKind::INTERNAL_SPECIAL_CASE instead.");
}
if (analysis == AliasAnalysisKind::CONSERVATIVE) {
// TODO A previous implementation of alias analysis always accessed
// node->schema , which cause the schema caches in the Node class to be
// filled for the full graph. Unfortunately, our JIT passes started relying
// on that, so we need to keep doing this. Details: in
// caffe2/torch/onnx/utils.py, _jit_pass_onnx is called on an invalid JIT
// graph because we called _jit_pass_erase_number_types right before and
// ints are now Tensors instead. So if _jit_pass_onnx tries to look up
// operator schemas, it will crash. However, _jit_pass_constant_propagation,
// which is called before it, runs alias analysis and prefills the schema
// cache in the all Node instances so that _jit_pass_onnx doesn't look up
// operators to get the schemas anymore. We should fix this.
node->schema(); // fill the schema cache in the Node class
return analyzeConservative(node);
}
TORCH_INTERNAL_ASSERT(
analysis == AliasAnalysisKind::FROM_SCHEMA,
"AliasAnalysisKind::CONSERVATIVE/PURE_FUNCTION/INTERNAL_SPECIAL_CASE should already have been handled above");
const auto& schema = node->schema();
// Bind the schema's "formal" alias annotation to the actual values those
// schema arguments represent
std::unordered_map<Symbol, Value*> formalToActual;
for (const auto i : c10::irange(schema.arguments().size())) {
const at::AliasInfo* formal = schema.arguments()[i].alias_info();
const auto& actualValue = node->inputs().at(i);
// Skip if there's no alias annotation
if (!formal) {
continue;
}
// If this type cannot alias, continue. Can occur with a VarType schema
if (!isMutableTypeInternal(actualValue)) {
continue;
}
// Do sanity checks on the alias annotation
TORCH_INTERNAL_ASSERT(
formal->containedTypes().size() <= 1,
"Composite types for alias analysis not yet supported");
TORCH_INTERNAL_ASSERT(
!formal->isWildcardBefore(),
"Doesn't make sense for a input value to begin as a wildcard");
// This is a special case where we have alias info before [] but not after,
// such as `Tensor(a!)[]`
if (formal->containedTypes().size() == 1 && formal->beforeSets().empty()) {
// Use the first containedType in alias info.
formal = &(formal->containedTypes()[0]);
}
const auto& formalAlias = formal->beforeSet();
// skip if we've already bound this alias
if (formalToActual.count(formalAlias) != 0) {
continue;
}
// Bind the formal to the actual
formalToActual[formalAlias] = actualValue;
// Record writes
if (formal->isWrite()) {
registerWrite(actualValue, node);
}
// Now deal with sets after the '->'
if (formal->isWildcardAfter()) {
TORCH_INTERNAL_ASSERT(
formal->afterSets().size() == 1,
"If the after set contains a wildcard, "
"there should be no other alias sets specified.");
setWildcard(actualValue);
} else {
// We don't understand anything else in the after yet, so assert there's
// been no change.
TORCH_INTERNAL_ASSERT(formal->beforeSets() == formal->afterSets());
}
}
// Use the formal-actual mapping to give aliases to the outputs
for (const auto i : c10::irange(schema.returns().size())) {
const auto actual = node->outputs().at(i);
const at::AliasInfo* formal = schema.returns()[i].alias_info();
if (!formal) {
// This is a fresh tensor
giveFreshAlias(actual);
continue;
}
// If this type cannot alias, continue. Can occur with a VarType schema
if (!isMutableType(actual)) {
continue;
}
TORCH_INTERNAL_ASSERT(
formal->containedTypes().size() <= 1,
"Composite types for alias analysis not yet supported");
TORCH_INTERNAL_ASSERT(formal->beforeSets() == formal->afterSets());
if (formal->containedTypes().size() == 1 && formal->beforeSets().empty()) {
// Use the first containedType in alias info.
formal = &(formal->containedTypes()[0]);
}
if (formal->isWildcardBefore()) {
TORCH_INTERNAL_ASSERT(
formal->beforeSets().size() == 1,
"If an output is a wildcard, "
"there should be no other alias sets specified.");
setWildcard(actual);
continue;
}
bool inputs_has_alias = false;
for (const auto& formalAlias : formal->beforeSets()) {
if (formalToActual.count(formalAlias)) {
inputs_has_alias = true;
auto toAlias = formalToActual.at(formalAlias);
makePointerTo(actual, toAlias);
}
}
// If all the alias annotation that we encounter weren't in the inputs:
// e.g. foo(Tensor(a) self) -> Tensor(b)
// or foo(Tensor(a) self) -> Tensor(b|c)
// Otherwise it is the form of a|fresh, which we can ignore, taking the
// conservative assumption that the output must alias `a`, e.g
// aten::cuda(Tensor(a) self) -> Tensor(a|fresh)
if (!inputs_has_alias && !formal->beforeSets().empty()) {
giveFreshAlias(actual);
}
// Record writes
if (formal->isWrite()) {
registerWrite(actual, node);
}
}
}
// Register the fact that `n` writes to `v`.
void AliasDb::registerWrite(const Value* v, Node* n, bool writeToContained) {
if (!isMutableTypeInternal(v)) {
// don't need to register a write if the value isn't mutable
return;
}
if (writeToContained) {
writeRegistry_->registerWriteToAllContained(v, n);
} else {
writeRegistry_->registerWrite(v, n);
}
}
void AliasDb::analyzeIf(Node* node) {
// For if statements, the alias set of an output is the union of the
// alias sets generated by the if and else block
const auto trueBlock = node->blocks().at(0);
const auto falseBlock = node->blocks().at(1);
analyze(trueBlock);
analyze(falseBlock);
for (const auto i : c10::irange(node->outputs().size())) {
const auto nodeOutput = node->outputs()[i];
const auto trueOutput = trueBlock->outputs().at(i);
const auto falseOutput = falseBlock->outputs().at(i);
makePointerTo(nodeOutput, trueOutput);
makePointerTo(nodeOutput, falseOutput);
}
}
void AliasDb::analyzeLoop(Node* node) {
const auto bodyBlock = node->blocks().at(0);
const auto loopCarriedInputs = node->inputs().slice(2); // skip max, cond
const auto blockInputs = bodyBlock->inputs().slice(1); // skip trip
const auto blockOutputs = bodyBlock->outputs().slice(1); // skip trip
TORCH_INTERNAL_ASSERT(loopCarriedInputs.size() == blockInputs.size());
TORCH_INTERNAL_ASSERT(blockOutputs.size() == node->outputs().size());
// Run alias analysis on the loop body, iterating until the block output
// alias info converges. Copy node input aliases to block input
mapAliases(blockInputs, loopCarriedInputs);
// Populate block output alias info by analyzing the body
analyze(bodyBlock);
// Copy the alias info from the block output to the node output
mapAliases(node->outputs(), blockOutputs);
}
void AliasDb::analyzeGradOf(Node* node) {
const auto grad_of_block = node->blocks().at(0);
analyze(grad_of_block);
mapAliases(node->outputs(), grad_of_block->outputs());
}
void AliasDb::analyzeSubgraph(
Node* node,
const std::shared_ptr<Graph>& subgraph) {
const auto subgraphBlock = subgraph->block();
// CallFunction nodes have an extra first parameter
if (node->kind() == prim::CallFunction) {
mapAliases(subgraphBlock->inputs(), node->inputs().slice(1));
} else {
mapAliases(subgraphBlock->inputs(), node->inputs());
}
analyze(subgraphBlock);
// Note: the subgraph outputs and node outputs are NOT NECESSARILY the
// same length. Autodifferentiation maybe capture additional outputs in the
// subgraph block.
TORCH_INTERNAL_ASSERT(
subgraphBlock->outputs().size() >= node->outputs().size());
for (size_t i = 0; i < node->outputs().size(); i++) {
makePointerTo(node->outputs()[i], subgraphBlock->outputs()[i]);
}
}
void AliasDb::analyzeSubgraph(Node* node) {
const auto subgraph = node->g(attr::Subgraph);
return analyzeSubgraph(node, subgraph);
}
// For nodes that generate a fresh value from nothing
void AliasDb::analyzeCreator(Node* node) {
for (Value* output : node->outputs()) {
giveFreshAlias(output);
}
}
// For nodes that extract values from a composite type. Right now, this just
// gives up and creates wildcards for everything.
void AliasDb::analyzeExtractor(Node* node) {
for (const auto output : node->outputs()) {
setWildcard(output);
}
}
// For torch.chunk(), all returned tensors may alias the input tensor
void AliasDb::analyzeChunk(Node* node) {
for (auto output : node->outputs()) {
makePointerTo(output, node->input());
}
}
void AliasDb::analyzeFork(Node* node) {
for (const auto input : node->inputs()) {
setWildcard(input);
}
// Give the future that the fork emits a fresh value
for (const auto output : node->outputs()) {
giveFreshAlias(output);
}
}
void AliasDb::analyzeWait(Node* node) {
TORCH_INTERNAL_ASSERT(node->kind() == aten::wait);
for (const auto output : node->outputs()) {
setWildcard(output);
}
// the forked subgraph that `wait` is waiting on may write to any of its
// inputs. We don't have a reliable way of recovering the fork inputs, so
// for safety we just register a write to every wildcard.
writeRegistry_->registerWriteToAllWildcards(node);
}
void AliasDb::analyzeAwaitable(Node* node) {
for (const auto input : node->inputs()) {
setWildcard(input);
}
for (const auto output : node->outputs()) {
giveFreshAlias(output);
}
}
void AliasDb::analyzeAwaitableWait(Node* node) {
TORCH_INTERNAL_ASSERT(node->kind() == prim::awaitable_wait);
for (const auto output : node->outputs()) {
setWildcard(output);
}
// the awaitable subgraph that `wait` is waiting on may write to any of its
// inputs. We don't have a reliable way of recovering the awaitable inputs, so
// for safety we just register a write to every wildcard.
writeRegistry_->registerWriteToAllWildcards(node);
}
void AliasDb::analyzeRpcAsync(Node* node) {
for (const auto input : node->inputs()) {
setWildcard(input);
}
// Give the future that the rpc_async emits a fresh value
for (const auto output : node->outputs()) {
giveFreshAlias(output);
}
}
namespace {
std::optional<bool> getConstantBooleanInput(
Node* node,
const std::string& inputName) {
TORCH_INTERNAL_ASSERT(
node->hasNamedInput(inputName), inputName + " input is expected");
auto value = node->namedInput(inputName);
TORCH_INTERNAL_ASSERT(
value->type() == BoolType::get(),
inputName + "training input is expected to be a bool");
return constant_as<bool>(value);
}
} // namespace
// custom behavior for batch_norm because (a!)? annotations currently
// aren't supported, and because behavior differs depending on the value of
// training
void AliasDb::analyzeBatchNorm(Node* node) {
// we invoking freezing for inference, so we assume training will be folded to
// a constant false to avoid needing to invoke freezing multiple times in
// order to make batch norm weights constant
for (Value* output : node->outputs()) {
giveFreshAlias(output);
}
if (isFrozen_) {
return;
}
auto isTraining = getConstantBooleanInput(node, "training");
if (!isTraining.has_value() || *isTraining) {
TORCH_INTERNAL_ASSERT(
node->hasNamedInput("running_mean"), "running_mean input is expected");
auto runningMean = node->namedInput("running_mean");
TORCH_INTERNAL_ASSERT(
node->hasNamedInput("running_var"), "running_var input is expected");
auto runningVar = node->namedInput("running_var");
registerWrite(runningMean, node);
registerWrite(runningVar, node);
}
}
// custom behavior for instance_norm, because (a!)? annotations currently
// aren't supported, and because behavior differs depending on the value of
// use_input_stats
void AliasDb::analyzeInstanceNorm(Node* node) {
for (Value* output : node->outputs()) {
giveFreshAlias(output);
}
auto useInputStats = getConstantBooleanInput(node, "use_input_stats");
if (!useInputStats.has_value() || *useInputStats) {
TORCH_INTERNAL_ASSERT(
node->hasNamedInput("running_mean"), "running_mean input is expected");
auto runningMean = node->namedInput("running_mean");
TORCH_INTERNAL_ASSERT(
node->hasNamedInput("running_var"), "running_var input is expected");
auto runningVar = node->namedInput("running_var");
registerWrite(runningMean, node);
registerWrite(runningVar, node);
}
}
// SetAttr: writes to the `self` field
void AliasDb::analyzeSetAttr(Node* node) {
const auto self = node->inputs().at(0);
TORCH_INTERNAL_ASSERT(self->type()->kind() == TypeKind::ClassType);
registerWrite(self, node);
// Also the value being set must become a wildcard.
const auto newValue = node->inputs().at(1);
setWildcard(newValue);
}
// Used for anything where we do not have accurate alias summaries
// may write to any input and produce wildcards
void AliasDb::analyzeConservative(Node* node) {
for (const auto input : node->inputs()) {
if (!isMutableTypeInternal(input)) {
continue;
}
registerWrite(input, node, /*writeToContained=*/true);
setWildcard(input);
}
for (const auto output : node->outputs()) {
setWildcard(output);
}
}
bool AliasDb::functionalNonEscapingListUse(const Use& use) const {
Node* n = use.user;
size_t offset = use.offset;
Value* container = n->inputs().at(offset);
// only consider aten op uses of lists
if (!container->type()->cast<ListType>()) {
return false;
}
/*
in the general case, we consider any Value that enters another container as
entering the heap, and thus aliasing all other heap values of the same type.
the advantage of this approach are:
- there are many composite list/container ops that would be tricky to
schematize if we did something more complicated
- limits the size of the AliasDb, because a container of size 10 only contains
1 memory dag element instead of 10
- we do not need to worry about adding contained elements to the wildcard set
when a container escapes the graph.
The downside of this approach is we are unable to handle the common case of a
list constructed and passed into an aten op. Here, optimize for a set of
common ops where the output does not alias the list or the list elements
*/
// only used in output of graph - no further uses,
// so there will be no use of it where the contained element leaks
if (use.user->kind() == prim::Return) {
return use.user->owningBlock() == graph_->block();
}
switch (use.user->kind()) {
case aten::cat:
case aten::broadcast_tensors:
case aten::stack:
case aten::vstack:
case aten::hstack:
case aten::dstack:
return true;
}
auto op = use.user->maybeOperator();
if (op && op->aliasAnalysisKind() == AliasAnalysisKind::PURE_FUNCTION) {
return true;
}
return false;
}
bool AliasDb::functionalNonEscapingTupleUse(const Use& use) const {
Node* n = use.user;
size_t offset = use.offset;
Value* container = n->inputs().at(offset);
if (!container->type()->cast<TupleType>()) {
return false;
}
// TODO(T97387453): Cover more ops that do not let escape tuples' elements.
bool in_return_outputs = use.user->kind() == prim::Return;
bool not_in_nested_subgraph = use.user->owningBlock() == graph_->block();
return in_return_outputs && not_in_nested_subgraph;
}
// List or dict or tuple construct: create an aliasing element for the actual
// container, then mark all inputs as wildcards, since they've gone inside the
// container. Then, add the wildcard sets of appropriate type to the contained
// elements of the container.
void AliasDb::analyzeContainerConstruct(Node* node) {
TORCH_INTERNAL_ASSERT(
node->kind() == prim::ListConstruct ||
node->kind() == prim::DictConstruct ||
node->kind() == prim::TupleConstruct);
// tuples which contain immutable types are immutable
if (!isMutableTypeInternal(node->output())) {
return;
}
TORCH_INTERNAL_ASSERT(node->outputs().size() == 1);
auto container = node->output();
// optimization:
// if a list is only used once in an aten op, and the op output
// doesn't alias the input, then we can add all inputs to the list's
// contained elements instead of the wildcard set.
if (container->uses().size() == 1 &&
(functionalNonEscapingListUse(container->uses().at(0)) ||
functionalNonEscapingTupleUse(container->uses().at(0)))) {
giveFreshAlias(container, false);
for (Value* v : node->inputs()) {
addToContainedElements(v, container);
}
return;
}
giveFreshAlias(container);
auto container_elem = elementMap_.at(container);
for (auto input : node->inputs()) {
auto maybe_wildcard_elem = setWildcard(input);
if (maybe_wildcard_elem) {
memoryDAGBuilder_->addToContainedElements(
*maybe_wildcard_elem, container_elem);
}
}
}
// BroadcastingChunk: all inputs are broadcasted, and then individually chunked.
// This is an intermediate node used only in the graph fuser.
void AliasDb::analyzeBroadcastingChunk(Node* node) {
auto inputs = node->inputs();
auto outputs = node->outputs();
auto nchunks = node->i(attr::chunks);
for (const auto index : c10::irange(inputs.size())) {
// Each inputs[i] is aliased by exactly `nchunks` distinct output tensors:
// inputs[i] produces chunks outputs[i * nchunks + k] for k in [0..nchunks)
auto output_begin = outputs.begin() + index * nchunks;
for (auto it = output_begin; it != output_begin + nchunks; ++it) {
makePointerTo(*it, inputs.at(index));
}
}
}
bool AliasDb::nonAliasingValue(const Value* elem) const {
// these are values which can point to aliasing types in the graph,
// as with a None value pointing to an optional if node output,
// but will never alias themselves
return elem->mustBeNone() || elem->node()->kind() == prim::Uninitialized;
}
// Register the fact that `from` is a pointer to `to`
void AliasDb::makePointerTo(const Value* from, const Value* to) {
if (nonAliasingValue(from) || nonAliasingValue(to)) {
// if either value is guaranteed to be non-aliasing, we do not need to
// connect the two elements. however, it is invariant that aliasing types
// that are not wildcards have a memory dag element, so we create one if
// needed
giveFreshAlias(from);
giveFreshAlias(to);
return;
}
// The contained types of immutable type containers (`Optional`,
// `Tuple`, `Future`, and `Union`) are unified, so these types can be
// mutable or immutable and point to a type which is mutable or
// immutable. `Any` is mutable but can point to an immutable type
// through refinement
if (isMutableTypeInternal(from) != isMutableTypeInternal(to)) {
return;
}
// both immutable
if (!isMutableTypeInternal(from)) {
return;
}
if (from == to) {
return;
}
// At this point, we are dealing with two mutable types
auto from_el = getOrCreateElement(from);
auto to_el = getOrCreateElement(to);
memoryDAGBuilder_->makePointerTo(from_el, to_el);
}
void AliasDb::addToContainedElements(
const Value* inner,
const Value* container) {
if (!isMutableTypeInternal(inner)) {
return;
}
auto inner_el = getOrCreateElement(inner);
auto cont_el = getOrCreateElement(container);
memoryDAGBuilder_->addToContainedElements(inner_el, cont_el);
}
bool AliasDb::mayAlias(const Value* a, const Value* b) const {
if (!isMutableTypeInternal(a) || !isMutableTypeInternal(b)) {
return false;
}
return memoryDAG_->mayAlias(elementMap_.at(a), elementMap_.at(b));
}
bool AliasDb::mayAlias(const ValueSet& a, const ValueSet& b) const {
if (a.empty() || b.empty()) {
return false;
}
// Record all memory locations from group `a`
MemoryLocations aMemLocs;
for (const auto value : a) {
auto it = elementMap_.find(value);
if (it != elementMap_.end()) {
aMemLocs |= memoryDAG_->getMemoryLocations(it->second);
}
}
// If any of group `b`s memory locations overlap, return true.
for (const auto value : b) {
auto it = elementMap_.find(value);
if (it != elementMap_.end()) {
if (aMemLocs.intersects(memoryDAG_->getMemoryLocations(it->second))) {
return true;
}
}
}
// No overlap, so group `a` and `b` do not share a memory location
return false;
}
bool AliasDb::mayContainAlias(Value* a, Value* b) const {
if (!isMutableTypeInternal(a) || !isMutableTypeInternal(b)) {
return false;
}
return memoryDAG_->mayContainAlias(elementMap_.at(a), elementMap_.at(b));
}
std::vector<Element*> AliasDb::getElements(at::ArrayRef<Value*> vs) const {
std::vector<Element*> elements;
for (const auto& val : vs) {
if (isMutableTypeInternal(val)) {
elements.push_back(elementMap_.at(val));
}
}
return elements;
}
bool AliasDb::mayContainAlias(
const at::ArrayRef<Value*> a,
const at::ArrayRef<Value*> b) const {
auto a_elems = getElements(a);
return a_elems.empty() ? false
: memoryDAG_->mayContainAlias(a_elems, getElements(b));
}
bool AliasDb::mayContainAlias(Value* a, const at::ArrayRef<Value*> b) const {
if (!isMutableTypeInternal(a)) {
return false;
}
auto b_elems = getElements(b);
return b_elems.empty()
? false
: memoryDAG_->mayContainAlias(elementMap_.at(a), b_elems);
}
// Make each value in the `from` list point to its partner in the `to` list
void AliasDb::mapAliases(at::ArrayRef<Value*> from, at::ArrayRef<Value*> to) {
TORCH_INTERNAL_ASSERT(to.size() == from.size());
for (const auto i : c10::irange(to.size())) {
makePointerTo(from[i], to[i]);
}
}
// Should only be called from create_functional_graphs.
// The asserts are to guard against unintentional use.
// FIXME refactor aliasdb construction to be more robust to mutation so this
// hack isn't necessary.
void AliasDb::createValue(const Value* value) {
TORCH_INTERNAL_ASSERT(isMutableTypeInternal(value->type()));
auto new_elem = memoryDAG_->unsafeMakeFreshValue(value);
elementMap_[value] = new_elem;
}
void AliasDb::giveFreshAlias(
const Value* value,
bool add_wildcard_to_contained_elems) {
auto maybe_mut_types = mapTypeToAliasTypeSetPtr(value->type());
if (!maybe_mut_types) {
return;
}
if (elementMap_.count(value)) {
// Inside a loop, we may have given a fresh alias to this value already, so
// skip
return;
}
auto new_elem = memoryDAGBuilder_->makeFreshValue(value);
elementMap_[value] = new_elem;
if (add_wildcard_to_contained_elems) {
if (maybe_mut_types->size() > 1) {
pointUnionTypeElementToAllContainedTypes(new_elem, *maybe_mut_types);
} else {
addContainedTypesToFreshElement(new_elem, *maybe_mut_types);
}
}
}
Element* AliasDb::getOrCreateElement(const Value* value) {
if (!elementMap_.count(value)) {
giveFreshAlias(value);
}
return elementMap_.at(value);
}
void AliasDb::replaceWithNewValue(Value* existing, Value* new_value) {
TORCH_INTERNAL_ASSERT(
*unshapedType(existing->type()) == *unshapedType(new_value->type()),
"Types must be strictly equal if you are replacing aliasing information. ",
"Got existing: '",
existing->type()->repr_str(),
"', new_value: '",
new_value->type()->repr_str(),
"'");
if (!isMutableTypeInternal(existing)) {
return;
}
auto existing_elem = elementMap_.at(existing);
elementMap_[new_value] = existing_elem;
elementMap_.erase(existing);
existing_elem->values = {new_value};
}
void AliasDb::copyValue(Value* from, Value* to) {
TORCH_INTERNAL_ASSERT(
*unshapedType(from->type()) == *unshapedType(to->type()),
"Types must be strictly equal if you are copying aliasing information. ",
"Got from: '",
from->type()->repr_str(),
"', to: '",
to->type()->repr_str(),
"'");
if (!isMutableTypeInternal(to)) {
return;
}
auto origElem = elementMap_.at(from);
elementMap_[to] = origElem;
origElem->values.insert(to);
}
bool AliasDb::moveAfterTopologicallyValid(Node* n, Node* movePoint) {
return tryMove(n, movePoint, MoveSide::AFTER, /*dryRun=*/false);
}
bool AliasDb::couldMoveAfterTopologically(Node* n, Node* movePoint) {
return tryMove(n, movePoint, MoveSide::AFTER, /*dryRun=*/true);
}
bool AliasDb::moveBeforeTopologicallyValid(Node* n, Node* movePoint) {
// We have to distinguish the move side (instead of just moving after
// n->prev()). Consider the following example:
// If the dependency graph looks like
// n -> movePoint -> o
// then moveBefore(o) will end up with
// n, o, movePoint
// but moveAfter(n) will return false.
return tryMove(n, movePoint, MoveSide::BEFORE, /*dryRun=*/false);
}
bool AliasDb::couldMoveBeforeTopologically(Node* n, Node* movePoint) {
return tryMove(n, movePoint, MoveSide::BEFORE, /*dryRun=*/true);
}
bool AliasDb::hasWriters(const at::ArrayRef<Value*>& values) const {
return std::any_of(values.begin(), values.end(), [&](Value* value) {
return hasWriters(value);
});
}
bool AliasDb::escapesScope(const at::ArrayRef<Value*>& vs) const {
return mayContainAlias(graph_->inputs(), vs) ||
mayContainAlias(graph_->outputs(), vs) || mayAliasWildcard(vs);
}
// Correctness conditions:
// no values in either set can have writers, and values in both sets
// cannot escape the current graph scope. Values can escape the current scope
// by aliasing a graph output or input, or by aliasing the wildcard set.
bool AliasDb::safeToChangeAliasingRelationship(
const at::ArrayRef<Value*>& a,
const at::ArrayRef<Value*>& b) const {
if (hasWriters(a) || hasWriters(b)) {
return false;
}
return !(escapesScope(a) && escapesScope(b));
}
// Helper for topologically-safe node moves. See `tryMove()` for details.
class AliasDb::WorkingSet {
public:
explicit WorkingSet(Node* mover, const AliasDb& aliasDb)
: aliasDb_(aliasDb), mover_(mover) {
for (const auto user : getUsersSameBlock(mover_)) {
moverUsers_.insert(user);
}
moverWrites_ |= aliasDb_.getWrites(mover_);
moverReads_ |= aliasDb_.getReads(mover_);
}
// Add `n` to the working set
void add(Node* n) {
nodes_.push_back(n);
node_to_index_[n] = static_cast<int64_t>(nodes_.size()) - 1;
for (const auto user : getUsersSameBlock(n)) {
users_.insert(user);
}
writes_ |= aliasDb_.getWrites(n);
reads_ |= aliasDb_.getReads(n);
}
void eraseMover() {
mover_ = nullptr;
moverWrites_.clear();
moverReads_.clear();
moverUsers_.clear();
}
const std::vector<Node*>& dependentNodes() {
return nodes_;
}
// Does the working set depend on `n`?
bool dependsOn(Node* n) const {
if (!mover_ && nodes_.empty()) {
return false;
}
return hasDataDependency(n) || hasMutabilityDependency(n);
}
private:
bool hasDataDependency(Node* n) const {
if (!mover_ && nodes_.empty()) {
return false;
}
const Node* pivot = mover_ ? mover_ : nodes_.front();
if (n->isAfter(pivot)) {
return producesFor(n);
} else {
return consumesFrom(n);
}
}
bool hasMutabilityDependency(Node* n) const {
// Check that `n` does not write to anything used by the working set
const auto& nWrites = aliasDb_.getWrites(n);
if (reads_.intersects(nWrites)) {
return true;
}
if (mover_ && moverReads_.intersects(nWrites)) {
return true;
}
// Check that the working set doesn't write to anything that `n` uses.
const auto& nReads = aliasDb_.getReads(n);
if (writes_.intersects(nReads)) {
return true;
}
if (mover_ && moverWrites_.intersects(nReads)) {
return true;
}
return false;
}
// Does the working set produce any values consumed by `n`?
bool producesFor(Node* n) const {
// This equivalent to asking: does the total use-set of all the nodes in the
// working set include `n`?
if (mover_ && moverUsers_.count(n)) {
return true;
}
return users_.count(n) != 0;
}
// Does the working set consume any values produced by `n`?
bool consumesFrom(Node* n) const {
const auto users = getUsersSameBlock(n);
if (mover_ && users.count(mover_)) {
return true;
}
return std::any_of(users.begin(), users.end(), [&](Node* user) {
return node_to_index_.find(user) != node_to_index_.end();
});
}
// Get all users of outputs of `n`, in the same block as `n`.
// This means if there is an `if` node that uses an output of `n` in some
// inner sub-block, we will consider the whole `if` node a user of `n`.
std::unordered_set<Node*> getUsersSameBlock(Node* n) const {
std::unordered_set<Node*> users;
for (const auto output : n->outputs()) {
for (const auto& use : output->uses()) {
if (auto sameBlock = findSameBlock(use.user, n)) {
users.insert(sameBlock);
}
}
}
return users;
}
// Traverse `target`'s blockchain upward until we find a node that shares a
// block with `n`.
//
// If one can't be found (say, because `n` is an inner block and target is
// outside), then return nullptr. Since we can only reorder nodes within a
// block, `target` would be irrelevant.
static Node* findSameBlock(Node* target, Node* n) {
TORCH_INTERNAL_ASSERT(target->owningGraph() == n->owningGraph());
if (target->owningBlock() == n->owningBlock()) {
return target;
} else {
// This user is in a sub-block. Traverse the blockchain upward until
// we arrive at a node that shares a block with `this`
auto curNode = target;
while (curNode->owningBlock() != n->owningBlock()) {
curNode = curNode->owningBlock()->owningNode();
if (curNode == nullptr) {
return curNode;
}
}
return curNode;
}
}
// NOLINTNEXTLINE(cppcoreguidelines-avoid-const-or-ref-data-members)
const AliasDb& aliasDb_;
std::vector<Node*> nodes_;
// Extra data structure for nodes for faster look up
// Since the tryMove method is used a lot, we want to
// make it as fast as possible.
std::unordered_map<Node*, int64_t> node_to_index_;
// Mover dependencies. We track these separately since we may erase the mover
// from the working set.
Node* mover_;
MemoryLocations moverWrites_;
MemoryLocations moverReads_;
std::unordered_set<Node*> moverUsers_;
// users => # of working set nodes it uses
std::unordered_set<Node*> users_;
// Values written to by the working set => number of nodes writing to value
MemoryLocations writes_;
MemoryLocations reads_;
};
// Try to move `toMove` before/after `movePoint` while preserving value
// dependencies. Returns false iff such a move could not be made.
//
// If `dryRun` is set, don't actually execute the move, just check if the move
// is possible
//
// The basic approach is: have a "working set" that we are moving forward, one
// node at a time. When we can't move past a node (because it depends on the
// working set), then add it to the working set and keep moving until we hit
// `moveAfter`.
bool AliasDb::tryMove(
Node* toMove,
Node* movePoint,
MoveSide moveSide,
bool dryRun) {
if (toMove->owningBlock() != movePoint->owningBlock()) {
return false;
}
if (toMove == movePoint) {
return true;
}
// 1. Move from `this` toward movePoint, building up the working set of
// dependencies
WorkingSet workingSet(toMove, *this);
// NOLINTNEXTLINE(cppcoreguidelines-init-variables)
int direction;
if (toMove->isAfter(movePoint)) {
direction = kPrevDirection;
} else {
direction = kNextDirection;
}
auto curNode = toMove->next_in_graph[direction];
bool toMoveIsOnMoveSide =
(moveSide == MoveSide::BEFORE && toMove->isBefore(movePoint)) ||
(moveSide == MoveSide::AFTER && toMove->isAfter(movePoint));
if (toMoveIsOnMoveSide && curNode == movePoint) {
return true;
}
// it is never valid to move reorder a node with side effects
if (toMove->hasSideEffects() ||
(!toMoveIsOnMoveSide && movePoint->hasSideEffects())) {
return false;
}
// Move forward one node at a time
while (curNode != movePoint) {
// never valid to reorder around a node with side effects
if (curNode->hasSideEffects()) {
return false;
}
if (workingSet.dependsOn(curNode)) {
// If we can't move past this node, add it to the working set
workingSet.add(curNode);
}
curNode = curNode->next_in_graph[direction];
}
// 2. Decide whether we can move it all to `movePoint`.
// Say we are moving directly before movePoint and `toMove` starts before
// movePoint in the graph. The move looks like
//
// `toMove` `toMove` |
// <dependencies> -> `movePoint` | `toMove` and deps are split
// `movePoint` <dependencies> |
//
// Contrast with the case where `toMove` starts AFTER movePoint:
//
// `movePoint` <dependencies> |
// <dependencies> -> `toMove` | `toMove` and deps are together
// `toMove` `movePoint` |
//
// In the first case, we need to split `this` off from its dependencies, so we
// can move the dependencies below `movePoint` and keep `toMove` above.
const bool splitToMoveAndDeps =
(moveSide == MoveSide::BEFORE && toMove->isBefore(movePoint)) ||
(moveSide == MoveSide::AFTER && toMove->isAfter(movePoint));
if (splitToMoveAndDeps) {
// remove `this` from dependencies to be moved past `movePoint`
workingSet.eraseMover();
}
// Check if we can move the working set past the move point
if (workingSet.dependsOn(movePoint)) {
// if we can't, then there are intermediate dependencies between the
// `this` and `movePoint`, so we can't do the move
return false;
}
if (dryRun) {
return true;
}
// 3. Execute the move
TORCH_INTERNAL_ASSERT(curNode == movePoint);
if (splitToMoveAndDeps) {
// Move `toMove`
move(toMove, movePoint, moveSide);
// Then move all of its dependencies on the other side of `movePoint`
const auto reversed =
moveSide == MoveSide::BEFORE ? MoveSide::AFTER : MoveSide::BEFORE;
for (auto n : workingSet.dependentNodes()) {
move(n, curNode, reversed);
curNode = n;
}
} else {
// Just append/prepend everything to `movePoint`
move(toMove, curNode, moveSide);
curNode = toMove;
for (auto n : workingSet.dependentNodes()) {
move(n, curNode, moveSide);
curNode = n;
}
}
return true;
}
// Helper function so we can generalize `tryMove`
void AliasDb::move(Node* toMove, Node* movePoint, MoveSide moveSide) {
switch (moveSide) {
case MoveSide::BEFORE:
toMove->moveBefore(movePoint);
break;
case MoveSide::AFTER:
toMove->moveAfter(movePoint);
break;
}
}
bool AliasDb::writesToWildcard(Node* n) const {
if (!writeIndex_->count(n)) {
return false;
}
const auto& writes = writeIndex_->at(n);
// Are any of these memoryLocs a wildcard element?
for (const auto& pr : wildcardIndex_) {
const auto wildcardElement = pr.second;
if (writes.test(wildcardElement->index)) {
return true;
}
}
return false;
}
bool AliasDb::mayAliasWildcard(const Value* v) const {
if (auto e = getWildcard(v->type())) {
return memoryDAG_->mayAlias(elementMap_.at(v), e);
}
// There were no wildcards of this type, so return false.
return false;
}
bool AliasDb::mayAliasWildcard(const at::ArrayRef<Value*> vs) const {
return std::any_of(
vs.begin(), vs.end(), [&](Value* v) { return mayAliasWildcard(v); });
}
std::optional<Element*> AliasDb::tryGetOrCreateWildcard(const TypePtr& type) {
auto maybe_mut_types = mapTypeToAliasTypeSetPtr(type);
if (!maybe_mut_types) {
return std::nullopt;
}
auto mut_type = toSingleType(*maybe_mut_types);
auto existing_wildcard = wildcardIndex_.find(*mut_type);
if (existing_wildcard != wildcardIndex_.end()) {
return existing_wildcard->second;
}
auto wildcard_elem = memoryDAGBuilder_->makeFreshValue(nullptr);
wildcardIndex_.emplace(*std::move(mut_type), wildcard_elem);
if (maybe_mut_types->size() > 1) {
pointUnionTypeElementToAllContainedTypes(wildcard_elem, *maybe_mut_types);
} else {
addContainedTypesToFreshElement(wildcard_elem, *maybe_mut_types);
}
return wildcard_elem;
}
void AliasDb::pointUnionTypeElementToAllContainedTypes(
Element* container_elem,
const AliasTypeSet& mut_types) {
for (const auto& mut_type : mut_types) {
auto maybe_elem = tryGetOrCreateWildcard(mut_type);
if (maybe_elem) {
TORCH_INTERNAL_ASSERT(*maybe_elem != container_elem);
memoryDAGBuilder_->makePointerTo(container_elem, *maybe_elem);
}
}
}
void AliasDb::addContainedTypesToFreshElement(
Element* container_elem,
const AliasTypeSet& mut_types) {
for (const auto& mut_type : mut_types) {
for (const auto& contained : mut_type->containedTypes()) {
auto maybe_elem = tryGetOrCreateWildcard(contained);
if (maybe_elem) {
memoryDAGBuilder_->addToContainedElements(*maybe_elem, container_elem);
}
}
}
}
// Search the wildcard index for an element that corresponds to the given type.
// Const version returns nullptr
Element* AliasDb::getWildcard(const TypePtr& type) const {
auto maybe_mut_types = mapTypeToAliasTypeSetPtr(type);
if (!maybe_mut_types) {
return {};
}
if (maybe_mut_types->size() > 1) {
auto union_type = UnionType::create(*maybe_mut_types);
// Get a <TypePtr, Element*> pair where the TypePtr is this Union
// type and the Element is the corresponding Wildcard
auto maybe_union_pair = wildcardIndex_.find(union_type);
if (maybe_union_pair != wildcardIndex_.end()) {
return (*maybe_union_pair).second;
}
} else {
// Get a <TypePtr, Element*> pair where the TypePtr is the given
// type and the Element is the corresponding Wildcard
auto type_pair = wildcardIndex_.find((*maybe_mut_types)[0]);
if (type_pair != wildcardIndex_.end()) {
return type_pair->second;
}
}
return {};
}
// Register `v` as a wildcard value.
std::optional<Element*> AliasDb::setWildcard(const Value* v) {
std::optional<Element*> maybe_wildcardElement =
tryGetOrCreateWildcard(v->type());
if (!maybe_wildcardElement) {
return std::nullopt;
}
// Ensure that we create a corresponding Element for `v` still, as it is an
// invariant that all mutable values have an Element
getOrCreateElement(v);
wildcards_.insert(v);
return maybe_wildcardElement;
}
void AliasDb::buildWrittenToLocationsIndex() {
MemoryLocations ret;
for (const auto& pr : *writeIndex_) {
const auto& writtenLocs = pr.second;
ret |= writtenLocs;
}
writtenToLocationsIndex_ = ret;
}
void Lint(const AliasDb* db) {
bool failed = false;
std::stringstream ss;
// Every mutable value in the system has a corresponding element.
for (const auto& v : db->graph_->all_values) {
if (!db->isMutableTypeInternal(v)) {
continue;
}
auto it = db->elementMap_.find(v);
if (it == db->elementMap_.end()) {
failed = true;
ss << "Value %" << v->debugName() << " of type " << v->type()->repr_str()
<< " wasn't found in the element map.\n"
<< "It was defined in " << *v->node();
}
}
TORCH_INTERNAL_ASSERT(!failed, ss.str());
// Two checks that we want to add but can't until the mutation API is more
// fully developed.
// - Every mutable value in the aliasdb belongs to the graph
// - All container values have contained elements
}
} // namespace torch::jit
``` |
Rzebikia is an extinct genus of mole from the Plio-Pleistocene of Poland. It is closely related to the American shrew-mole (Neurotrichus gibbsii) and had formerly been placed in the same genus.
Taxonomy
Two species are assigned to this genus, though both were originally described as belonging to the genus Neurotrichus. Rzebikia polonica and Rzebikia skoczeni. R. polonica was described in 1980 while R. skoczeni was described in 2004, originally under the name Neurotrichus minor, though it was found to be preoccupied by a subspecies of American shrew-mole. In 2014, the two species were moved out of Neurotrichus into their current genus.
References
Pliocene mammals of Europe
Pleistocene mammals of Europe
Extinct mammals of Europe
Talpidae |
Julius Braunthal (1891–1972) was an Austrian-born historian, magazine editor, and political activist. Braunthal is best remembered as the Secretary of the Socialist International from 1951 to 1956 and for his massive three volume History of the International, first published in German between 1961 and 1971.
Biography
Early years
Julius Braunthal was born in Vienna, Austria-Hungary on 5 May 1891.
During World War I Braunthal was an officer in the Austro-Hungarian army, winning a decoration for valor and rising to the rank of lieutenant by the end of the war.
Interwar period
After the war Braunthal served as an Assistant Secretary of State for the newly established Republic of Austria from 1918 to 1920.
A committed socialist, following his departure from government service Braunthal edited several socialist publications. He published the first article on Fascism entitled "Der Putsch der Fascisten" in Der Kampf, a theoretical monthly journal of the Socialist Party of Austria (SPÖ), in November 1922 shortly after March on Rome which was an organized mass demonstration and a coup d'état by Benito Mussolini's National Fascist Party. In 1924 Braunthal was editor of the Arbeiter-Zeitung, the official organ of the SPÖ. From 1927 to 1934 he served as editor of the popular socialist newspaper, Das Kleine Blatt (German: The Little Leaf), also published by the SPÖ. He also founded and edited the illustrated magazine Der Kuckuck (The Cuckoo) between 1929 and 1934.
Austrofascism began to rise in the middle 1930s and Brauthal was soon embroiled with difficulties with the new right wing regime. In 1934 Braunthal was arrested and jailed, charged with treason. He was ultimately expelled from the country in 1935, narrowly escaping the annexation of Austria to Nazi Germany three years later.
In 1938, Braunthal went into exile in Great Britain, where his elder sister Bertha Clark (1887-1967) had been living and working with her Scottish born husband since 1933, and where he would remain for the rest of his life.
Julius Braunthal was named an assistant secretary of the Labour and Socialist International in 1938, remaining in that capacity until the outbreak of World War II.
World War II and after
During World War II, Braunthal was the editor of the journal of the Labour and Socialist International, International Socialist Forum. He would serve in that capacity until 1948. Thereafter Braunthal was named as the Secretary of the International Socialist Conference, a transitional organization which preceded establishment of the new Socialist International. In 1951 Braunthal was named the first Secretary General of this new international institution. He would hold this post until 1956.
Following the end of his time as the head of the Socialist International, Braunthal turned his attention to the writing of history. He authored a three volume History of the International, detailing the institutional development of international socialism from the First International until the present day. The first volume of this work was published in 1961, with the third and final volume seeing print in 1971.
Death and legacy
Julius Braunthal died on 24 April 1972 in Teddington, England. He was 78 years old at the time of his death.
Braunthal's papers reside at the International Institute of Social History in Amsterdam, Netherlands.
Works
Die Arbeiterräte in Deutschösterreich. Vienna, 1919.
Die Sozialpolitik der Republik. Vienna: Wiener Volksbuchhandlung, 1919.
Kommunisten und sozialdemokraten. Vienna: Verlag der Wiener Volksbuchhandlung, 1920.
Die Wiener Julitage 1927. Vienna: Verlag der Wiener Volksbuchhandlung, 1927.
40 Jahre 1. Mai. Vienna, 1929.
Festschrift zur 2. Arbeiter-Olympiade. Vienna: Rotationstiefdruck: "Vorwärts," 1931.
Need Germany Survive? London: Victor Gollancz, 1943.
The Future of Austria: A Plea for the United States of Europe. London: Victor Gollancz, 1943.
In Search of the Millennium. London: Victor Gollancz, 1945.
The Paradox of Nationalism: An Epilogue to the Nuremberg Trials: Common-Sense Reflections in the Atomic Age. London: St. Botolph Publishing Co., 1946.
The Tragedy of Austria. London: Victor Gollancz, 1948.
"The Rebirth of Social Democracy," Foreign Affairs, vol. 27, no. 4 (July 1949), pp. 586–600. In JSTOR
Der gegenwärtige Stand der sozialistischen Literatur. Bielefeld : Verlag Neue Gesellschaft, n.d. [c. 1955].
Yearbook of the International Socialist Labour Movement. London: Lincolns-Prager, 1956.
The Significance of Israeli Socialism and the Arab-Israeli Dispute. With J.B. Kripalani. London: Lincolns-Prager, 1958.
Sozialistische Weltstimmen. Berlin: Verlag nach J.H.W. Dietz, 1958.
Geschichte der Internationale, Vol. 1. Hannover, Germany: Verlag J.H.W. Dietz, 1961.
Geschichte der Internationale, Vol. 2. Hannover, Germany: Verlag J.H.W. Dietz, 1963.
Auf der Suche nach dem Millennium. Vienna: Europa Verlag, 1964.
Socialism. The First 100 Years. Rome: Centre for Labour and Social Studies, 1964.
Victor und Friedrich Adler; zwei Generationen Arbeiterbewegung. Vienna: Verlag der Wiener Volksbuchhandlung, 1965.
History of the International: Volume 1: 1864-1914. New York: Frederick A. Praeger, Publishers, 1967.
History of the International: Volume 2: 1914-1943. New York: Frederick A. Praeger, Publishers, 1967.
Geschichte der Internationale, Vol. 3. Hannover, Germany: Verlag J.H.W. Dietz, 1971.
History of the International: Volume 3: 1943-1968. London: Victor Gollancz, 1980.
Footnotes
Further reading
Brigitte Robach, Julius Braunthal als politscher Publizist. Ein Leben im dienste des Sozialismus. PhD dissertation. University of Vienna, 1983.
Shlomo Shafir, "Julius Braunthal and His Postwar Mediation Efforts between German and Israeli Socialists," Jewish Social Studies, vol. 47, no. 3/4 (Summer-Autumn, 1985), pp. 267–280. In JSTOR.
External links
Emile Schwidder, "Julius Braunthal Papers online finding aid," International Institute of Social History, 1977.
1891 births
1972 deaths
20th-century Austrian people
People from Austria-Hungary
Austrian newspaper editors
British people of Austrian-Jewish descent
Jewish socialists
European democratic socialists
Socialist International
Austrian emigrants to the United Kingdom
Austrian magazine founders
Austrian magazine editors |
```yaml
description: Example binding for a node using a PWM clock
compatible: "test-clock-control-pwm-clock"
include: base.yaml
properties:
clocks:
required: true
description: Clock phandle array
``` |
Mary Elaine Sykes (24 August 1896 – 25 February 1981) was a British solicitor, politician and magistrate. She was one of the first women solicitors in England and Wales. She read English at Royal Holloway College (1914–1917) and law at the University of Leeds (1918–1919). She obtained a BA and LL.B both from the University of London.
Having been articled to her father, a partner in his own firm of solicitors in Huddersfield (Armitage, Sykes and Hinchcliffe), in November 1922, along with Mary Pickup, Carrie Morrison, and Maud Crofts, she was one of the first women to sit the Law Society’s Final Examination, the first time the examination was opened to women following the passing of the Sex Disqualification (Removal) Act 1919. Morrison was the first of them to finish her articles, and was the first woman admitted to the role of solicitor. Sykes was admitted as a solicitor in 1923. She worked for her father’s firm until 1930, when she set up her own firm, Mary E Sykes & Co. She remained in practice as a solicitor until 1968. In 1980 Mary E Sykes & Co merged with Ramsdens Solicitors. Sykes was elected president of the Huddersfield Law Society in 1951 and in 1955 was appointed as a magistrate.
In 1935 she was elected as a Labour councillor on the Huddersfield Borough Council. In 1938 she became Huddersfield’s first woman alderman, and in 1945 she became the first woman to be elected as Mayor of Huddersfield. She was a member of the Labour Party and served as President of the Huddersfield Labour Party.
She was a founder member of the Huddersfield branch of the British Federation of Women Graduates, and a member of the Women’s Luncheon Club, the Business and Professional Women’s Club, and the Huddersfield Soroptimist Club.
She was friends with the renowned naturalist Phyllis Kelway. She married Richard Harry Browne in 1953.
References
1896 births
1981 deaths
English solicitors
20th-century English lawyers |
A VeggieTales Movie may refer to:
Jonah: A VeggieTales Movie (2002)
The Pirates Who Don't Do Anything: A VeggieTales Movie (2008) |
```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.test.it.sql.parser.internal.cases.sql.jaxb;
import lombok.Getter;
import javax.xml.bind.annotation.XmlElement;
import javax.xml.bind.annotation.XmlRootElement;
import java.util.LinkedList;
import java.util.List;
/**
* SQL test cases for XML root tag.
*/
@XmlRootElement(name = "sql-cases")
@Getter
public final class RootSQLCases {
@XmlElement(name = "sql-case")
private final List<SQLCase> sqlCases = new LinkedList<>();
}
``` |
The Third Programme (, Trito Programma) is the third public radio station of Greece's state broadcaster, ERT. The station's main program broadcasts are focused on classical music and culture. Since October 2018, the station is headed by Pantazis Tsaras.
History
It aired on September 19, 1954, with the initiative of author Dionysios Romas, two years after the founding of the Second Program. In its first days, it utilized a neglected transmitter and aired only three hours a day (7 PM to 11 PM).
The station's success story, began after the fall of the dictatorship, during metapolitefsi, when Manos Hatzidakis, became the station's director.
Under Hatzidakis' tenure (1975-1982), the program attracted the interest of people of all ages, including children. The landmark children's series Εδώ Λιλιπούπολη (Liliput Speaking) was aired in 1976. It was initially considered a failure, because it was deemed too childish and as such failed to fit the 'serious' thematology of the station, oriented towards classical music. When the show became more theatrical, incorporating political parallelisms, it arose in popularity.
After the series' end in 1980, the station gradually stopped being in the spotlight. However, as it is the only nationwide radio station centered around classic music and culture, it retains a loyal audience.
Following the temporary closure of ERT on June 11, 2013, the Third Programme broadcast unofficially four hours a day in a unified EPA and, after 25 September of the same year was emitted through the unofficial ERT Open.
On March 10, 2014, the Third Programme reopened by Public Radio, a transitional entity, and from 4 May was broadcast from NERIT. After the reopening of ERT on June 11, 2015, the station was reinstated in EPA and stopped being broadcast by ERT Open.
References
Hellenic Radio
Radio stations established in 1954 |
Owen Simpson (born 18 September 1943 in Mickley, England) is an English former professional footballer. He played for Rotherham, Leyton Orient, Colchester, Southend, Darlington and Grimsby in The Football League
References
External links
Owen Simpson at Colchester United Archive Database
1943 births
Living people
Rotherham United F.C. players
Leyton Orient F.C. players
Colchester United F.C. players
Southend United F.C. players
Darlington F.C. players
Grimsby Town F.C. players
Boston United F.C. players
Men's association football defenders
English men's footballers
People from Mickley, Northumberland
Footballers from Northumberland |
Legends of the Wild West is a walkthrough attraction located in Frontierland in Disneyland Paris. It opened in 1993, and features wax characters from the American Far-West, and even famous "Legends".
Summary
The attraction takes place in a Civil War-inspired fort, known as Fort Comstock, located at the entrance of Thunder Mesa (the fictional city portrayed in Frontierland). Guests are led to the upper floor, where the following wax figures are visible:
The Forty-Niner, who has just found golden nuggets during the Gold Rush.
The Thug, snoring in prison, waiting for a jailbreak.
The Sheriff in his office, full of Wanted posters. He is getting ready for his next shootout.
Davy Crockett, here seen shooting another man.
Buffalo Bill in his home, preparing his Wild West Show with two other men.
Originally, the walkthrough ended in a remote area featuring Indian tepees. There, guests could meet cast Native Americans. Later, this part was closed, but it is still visible.
References
Amusement park attractions introduced in 1993
Walt Disney Parks and Resorts attractions
Western (genre) amusement park attractions
Legends of the Wild West
1993 establishments in France |
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package util
import (
"context"
"time"
"k8c.io/kubermatic/v2/pkg/kubernetes"
"k8c.io/kubermatic/v2/pkg/resources"
appsv1 "k8s.io/api/apps/v1"
apierrors "k8s.io/apimachinery/pkg/api/errors"
"k8s.io/apimachinery/pkg/util/wait"
ctrlruntimeclient "sigs.k8s.io/controller-runtime/pkg/client"
)
// WaitForDeploymentRollout queries k8s until a deployment with the supplied version exists and
// has been rolled out, or until the timeout is reached.
func WaitForDeploymentRollout(ctx context.Context, client ctrlruntimeclient.Client, deployment *appsv1.Deployment, version string, timeout time.Duration) error {
return wait.PollUntilContextTimeout(ctx, 1*time.Second, timeout, true, func(ctx context.Context) (bool, error) {
dep := &appsv1.Deployment{}
if err := client.Get(ctx, ctrlruntimeclient.ObjectKeyFromObject(deployment), dep); err != nil {
if apierrors.IsNotFound(err) {
return false, nil
}
return false, err
}
if dep.Labels[resources.VersionLabel] != version {
return false, nil
}
return kubernetes.IsDeploymentRolloutComplete(dep, 0)
})
}
``` |
The 2023 NCAA Division I Men's Golf Championship was a golf tournament contested from May 26–31 at the Grayhawk Golf Club in Scottsdale, Arizona. It was the 84th NCAA Division I Men's Golf Championship. It included both team and individual championships.
Regional qualifying tournaments
Five teams qualified from each of the six regional tournaments held around the country May 15–17, 2023.
The lowest scoring individual not affiliated with one of the qualified teams in their regional also qualified for the individual national championship.
Venue
This was the third consecutive NCAA Division I Men's Golf Championship held at the Grayhawk Golf Club in Scottsdale, Arizona. This would have been the third year and final year of a planned three year stretch for Grayhawk hosting both men's and women's NCAA golf championships had the 2020 championship not been cancelled due to the COVID-19 pandemic. In October 2020, the NCAA announced that Grayhawk would host the 2023 NCAA Division I Women's and Men's Golf Championship.
Team competition
Leaderboard
Par, single-round: 280
Par, total: 1,120
After 54 holes, the field of 30 teams was cut to the top 15.
† Arizona State (–1) beat Stanford (E) in a two-hole playoff to advance to match play.
Ohio State (E) beat Texas Tech (+1) in a one-hole playoff to advance to the final round of stroke play.
Remaining teams: Texas Tech (866), Oklahoma (867), Arkansas (870), Texas (872), San Francisco (873), Colorado (874), Duke (878), Chattanooga (879), BYU (879), New Mexico (880), Mississippi State (880), Oregon (882), Colorado State (885), East Tennessee State (886), Baylor (893)
Source:
Match play bracket
Source:
Individual competition
Leaderboard
Par, single-round: 70
Par, total: 280
The field was cut after 54 holes to the top 15 teams and the top nine individuals not on a top 15 team. These 84 players competed for the individual championship
Source:
References
NCAA Men's Golf Championship
Golf in Arizona
NCAA Division I Men's Golf Championship
NCAA Division I Men's Golf Championship
NCAA Division I Men's Golf Championship
NCAA Division I Men's Golf Championship |
The Pian Upe Wildlife Reserve is a conservation area in the Karamoja subregion of northeastern Uganda. It is the second largest conservation protected area in Uganda.
History
The south of the reserve was designated as Debasien Animal Sanctuary in 1958. A government-led project to convert land just south of the Greek River for agriculture threatened the viability of wildlife conservation in the whole area. In 1964 the area was expanded northward and renamed Pian-Upe Game Reserve.
A 2003 proposal to degazette the reserve in order to farm fruit on the land was blocked.
Geology
There is a hot spring potential for Geothermal tapping at Cheposukunya. Further to that, there are Mercury wells at Mt. Kadam.
The reserve features semi arid climate with one rain season annually.
Biology
Plants
Most of the reserve is covered by undisturbed grassland and wooded grassland. Small areas of riverine woodland, kopjes also exist. Some land is cultivated, and especially the area near the Greek River is threatened by conversion.
Dominant tree species are red acacia and desert date. Also present are bushwillows, Harrisonia abyssinica and red spike-thorns. Shrubs include butterfly pea and wooly caper bush. Cultivated areas have many live fences of yellow oleander.
Common grasses in the grassland are thatching grass and bristle species. Less common are beard grasses and lemon grasses. Along the rivers Vlei bristle grass and red nut sedge dominate. The lower vegetation layer burns every year.
Large mammals
Although the area once supported healthy populations of lions, elephants, black rhinos and giraffes, these are now locally extinct. The last giraffe was reportedly poached in 1995. In October 2019 15 giraffes from Murchison Falls National Park where reintroduced in the reserve by UWA. Populations of plains zebra, common eland, are also threatened Grants gazelle.
The most commonly sighted mammal in the reserve is the oribi. Others known to inhabit the area (as of 1996) include:
Reptiles
Pian Upe is home to enormous rock pythons and smaller but venomous puff adders. Harmless water snakes are also found there.
The largest lizards in Pian Upe are the Savannah monitors. Others in the reserve include the common agama as well as skinks, chameleons and geckos.
References
External links
World Database on Protected Areas
Pian-Upe Wildlife Reserve Indepth Guide
official website
Wildlife sanctuaries of Uganda
Northern Acacia-Commiphora bushlands and thickets
East African montane forests
Important Bird Areas of Uganda |
Škorpil (feminine Škorpilová) is a Czech surname. Notable people with the surname include:
Hermenegild Škorpil, Czech archaeologist
Karel Škorpil, Czech archaeologist
Ladislav Škorpil, Czech football manager
Czech-language surnames |
"Memories" is a dance music song written by Fulvio Perniola, Gianni Bini, Marco Galeotti and Maurizio Tognarelli and originally recorded and released by the group Netzwerk in 1995. The song was a hit in dance clubs around the world.
Track listing
Memories (Remix) - Italy 12 "Single
, Germany / Canada / Italy CD Maxi-single
Lil Suzy version
In 1997, Lil Suzy covered "Memories" for her fourth album Paradise. It was released as the second single from the album on November 11, 1997, and reached No. 5 on the Bubbling Under Hot 100 Singles chart.
Track listing
US 12" single
References
1995 singles
Lil Suzy songs
1997 singles |
Maciek Miernik (born Maciej Stanislaw Miernik) is a bass guitar playing rock musician, composer, sound editor, recording engineer and producer. He has appeared in many groups such as Aurora, 1984, Noah-Noah, Restrykcja, Reflection-NY band, King Poyaviack, Flashback as well as producing songs ranging from progressive rock and progressive punk. He is known for his avant-garde multimedia productions.
His production credits include some of the most respected albums by Alan Lomax.[]
In 2003, he received an honorable mention for the Alan Lomax Archive in the 45th Grammy Trustees Award, New York City.
See also
List of Poles
Music of Poland
External links
recording studio
Year of birth missing (living people)
Living people
Polish composers |
Mix It Up: Jump5 Remixed is a remix album by Christian pop group Jump5. It was released on April 6, 2004. It includes nine remixes of songs from their previous studio albums (excluding their Christmas album, All the Joy in the World), three tracks containing in-studio audio of the group, and a cover of Kool & the Gang's "Celebration", which is slightly different from the original version of their cover previously released on the Kim Possible soundtrack.
Mix It Up charted at #3 on Billboard'''s Top Dance/Electronic Albums chart in 2004.
Track listing
Tracks 14 through 24 are between five and six seconds in length each, totaling 48 seconds between "Celebration" and the hidden track.
Personnel
Credits adapted from the liner notes of Mix It Up''.
Jump5 – vocals
Chris Fedun
Brandon Hargest
Brittany Hargest
Libby Hodges
Lesley Moore
Mark Hammond – original production
References
Jump5 albums
2004 remix albums
Sparrow Records remix albums
Christian music remix albums |
Events in the year 1969 in Cyprus.
Incumbents
President: Makarios III
President of the Parliament: Glafcos Clerides
Events
The Movement for Social Democracy was founded by Vasos Lyssaridis.
Deaths
References
1960s in Cyprus
Years of the 21st century in Cyprus
Cyprus
Cyprus
Cyprus |
```xml
import {
IAbstractManipulatorInitialValues,
vtkAbstractManipulator,
} from '../AbstractManipulator';
import { Vector3 } from '../../../types';
/**
*
*/
export interface ITrackballManipulatorInitialValues
extends IAbstractManipulatorInitialValues {}
export interface vtkTrackballManipulator extends vtkAbstractManipulator {
/**
*
*/
reset(callData: any): void;
}
/**
* Method use to decorate a given object (publicAPI+model) with vtkTrackballManipulator characteristics.
*
* @param publicAPI object on which methods will be bounds (public)
* @param model object on which data structure will be bounds (protected)
* @param {ITrackballManipulatorInitialValues} [initialValues] (default: {})
*/
export function extend(
publicAPI: object,
model: object,
initialValues?: ITrackballManipulatorInitialValues
): void;
/**
* Method use to create a new instance of vtkTrackballManipulator
*/
export function newInstance(
initialValues?: ITrackballManipulatorInitialValues
): vtkTrackballManipulator;
/**
*
* @param {Number} prevX
* @param {Number} prevY
* @param {Number} curX
* @param {Number} curY
* @param {Vector3} origin
* @param {Vector3} direction
* @param renderer
* @param glRenderWindow
*/
export function trackballRotate(
prevX: number,
prevY: number,
curX: number,
curY: number,
origin: Vector3,
direction: Vector3,
renderer: any,
glRenderWindow: any
): void;
/**
* vtkTrackballManipulator.
*/
export declare const vtkTrackballManipulator: {
newInstance: typeof newInstance;
extend: typeof extend;
trackballRotate: typeof trackballRotate;
};
export default vtkTrackballManipulator;
``` |
```objective-c
#ifndef _NPY_ENDIAN_H_
#define _NPY_ENDIAN_H_
/*
* NPY_BYTE_ORDER is set to the same value as BYTE_ORDER set by glibc in
* endian.h
*/
#if defined(NPY_HAVE_ENDIAN_H) || defined(NPY_HAVE_SYS_ENDIAN_H)
/* Use endian.h if available */
#if defined(NPY_HAVE_ENDIAN_H)
#include <endian.h>
#elif defined(NPY_HAVE_SYS_ENDIAN_H)
#include <sys/endian.h>
#endif
#if defined(BYTE_ORDER) && defined(BIG_ENDIAN) && defined(LITTLE_ENDIAN)
#define NPY_BYTE_ORDER BYTE_ORDER
#define NPY_LITTLE_ENDIAN LITTLE_ENDIAN
#define NPY_BIG_ENDIAN BIG_ENDIAN
#elif defined(_BYTE_ORDER) && defined(_BIG_ENDIAN) && defined(_LITTLE_ENDIAN)
#define NPY_BYTE_ORDER _BYTE_ORDER
#define NPY_LITTLE_ENDIAN _LITTLE_ENDIAN
#define NPY_BIG_ENDIAN _BIG_ENDIAN
#elif defined(__BYTE_ORDER) && defined(__BIG_ENDIAN) && defined(__LITTLE_ENDIAN)
#define NPY_BYTE_ORDER __BYTE_ORDER
#define NPY_LITTLE_ENDIAN __LITTLE_ENDIAN
#define NPY_BIG_ENDIAN __BIG_ENDIAN
#endif
#endif
#ifndef NPY_BYTE_ORDER
/* Set endianness info using target CPU */
#include "npy_cpu.h"
#define NPY_LITTLE_ENDIAN 1234
#define NPY_BIG_ENDIAN 4321
#if defined(NPY_CPU_X86) \
|| defined(NPY_CPU_AMD64) \
|| defined(NPY_CPU_IA64) \
|| defined(NPY_CPU_ALPHA) \
|| defined(NPY_CPU_ARMEL) \
|| defined(NPY_CPU_AARCH64) \
|| defined(NPY_CPU_SH_LE) \
|| defined(NPY_CPU_MIPSEL) \
|| defined(NPY_CPU_PPC64LE) \
|| defined(NPY_CPU_ARCEL)
#define NPY_BYTE_ORDER NPY_LITTLE_ENDIAN
#elif defined(NPY_CPU_PPC) \
|| defined(NPY_CPU_SPARC) \
|| defined(NPY_CPU_S390) \
|| defined(NPY_CPU_HPPA) \
|| defined(NPY_CPU_PPC64) \
|| defined(NPY_CPU_ARMEB) \
|| defined(NPY_CPU_SH_BE) \
|| defined(NPY_CPU_MIPSEB) \
|| defined(NPY_CPU_OR1K) \
|| defined(NPY_CPU_M68K) \
|| defined(NPY_CPU_ARCEB)
#define NPY_BYTE_ORDER NPY_BIG_ENDIAN
#else
#error Unknown CPU: can not set endianness
#endif
#endif
#endif
``` |
```c++
//==- WebAssemblyAsmParser.cpp - Assembler for WebAssembly -*- C++ -*-==//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
///
/// \file
/// This file is part of the WebAssembly Assembler.
///
/// It contains code to translate a parsed .s file into MCInsts.
///
//===your_sha256_hash------===//
#include "AsmParser/WebAssemblyAsmTypeCheck.h"
#include "MCTargetDesc/WebAssemblyMCTargetDesc.h"
#include "MCTargetDesc/WebAssemblyTargetStreamer.h"
#include "TargetInfo/WebAssemblyTargetInfo.h"
#include "Utils/WebAssemblyTypeUtilities.h"
#include "Utils/WebAssemblyUtilities.h"
#include "WebAssembly.h"
#include "llvm/MC/MCContext.h"
#include "llvm/MC/MCExpr.h"
#include "llvm/MC/MCInst.h"
#include "llvm/MC/MCInstrInfo.h"
#include "llvm/MC/MCParser/MCAsmLexer.h"
#include "llvm/MC/MCParser/MCParsedAsmOperand.h"
#include "llvm/MC/MCParser/MCTargetAsmParser.h"
#include "llvm/MC/MCSectionWasm.h"
#include "llvm/MC/MCStreamer.h"
#include "llvm/MC/MCSubtargetInfo.h"
#include "llvm/MC/MCSymbol.h"
#include "llvm/MC/MCSymbolWasm.h"
#include "llvm/MC/TargetRegistry.h"
#include "llvm/Support/Endian.h"
#include "llvm/Support/SourceMgr.h"
using namespace llvm;
#define DEBUG_TYPE "wasm-asm-parser"
static const char *getSubtargetFeatureName(uint64_t Val);
namespace {
/// WebAssemblyOperand - Instances of this class represent the operands in a
/// parsed Wasm machine instruction.
struct WebAssemblyOperand : public MCParsedAsmOperand {
enum KindTy { Token, Integer, Float, Symbol, BrList } Kind;
SMLoc StartLoc, EndLoc;
struct TokOp {
StringRef Tok;
};
struct IntOp {
int64_t Val;
};
struct FltOp {
double Val;
};
struct SymOp {
const MCExpr *Exp;
};
struct BrLOp {
std::vector<unsigned> List;
};
union {
struct TokOp Tok;
struct IntOp Int;
struct FltOp Flt;
struct SymOp Sym;
struct BrLOp BrL;
};
WebAssemblyOperand(KindTy K, SMLoc Start, SMLoc End, TokOp T)
: Kind(K), StartLoc(Start), EndLoc(End), Tok(T) {}
WebAssemblyOperand(KindTy K, SMLoc Start, SMLoc End, IntOp I)
: Kind(K), StartLoc(Start), EndLoc(End), Int(I) {}
WebAssemblyOperand(KindTy K, SMLoc Start, SMLoc End, FltOp F)
: Kind(K), StartLoc(Start), EndLoc(End), Flt(F) {}
WebAssemblyOperand(KindTy K, SMLoc Start, SMLoc End, SymOp S)
: Kind(K), StartLoc(Start), EndLoc(End), Sym(S) {}
WebAssemblyOperand(KindTy K, SMLoc Start, SMLoc End)
: Kind(K), StartLoc(Start), EndLoc(End), BrL() {}
~WebAssemblyOperand() {
if (isBrList())
BrL.~BrLOp();
}
bool isToken() const override { return Kind == Token; }
bool isImm() const override { return Kind == Integer || Kind == Symbol; }
bool isFPImm() const { return Kind == Float; }
bool isMem() const override { return false; }
bool isReg() const override { return false; }
bool isBrList() const { return Kind == BrList; }
unsigned getReg() const override {
llvm_unreachable("Assembly inspects a register operand");
return 0;
}
StringRef getToken() const {
assert(isToken());
return Tok.Tok;
}
SMLoc getStartLoc() const override { return StartLoc; }
SMLoc getEndLoc() const override { return EndLoc; }
void addRegOperands(MCInst &, unsigned) const {
// Required by the assembly matcher.
llvm_unreachable("Assembly matcher creates register operands");
}
void addImmOperands(MCInst &Inst, unsigned N) const {
assert(N == 1 && "Invalid number of operands!");
if (Kind == Integer)
Inst.addOperand(MCOperand::createImm(Int.Val));
else if (Kind == Symbol)
Inst.addOperand(MCOperand::createExpr(Sym.Exp));
else
llvm_unreachable("Should be integer immediate or symbol!");
}
void addFPImmf32Operands(MCInst &Inst, unsigned N) const {
assert(N == 1 && "Invalid number of operands!");
if (Kind == Float)
Inst.addOperand(
MCOperand::createSFPImm(bit_cast<uint32_t>(float(Flt.Val))));
else
llvm_unreachable("Should be float immediate!");
}
void addFPImmf64Operands(MCInst &Inst, unsigned N) const {
assert(N == 1 && "Invalid number of operands!");
if (Kind == Float)
Inst.addOperand(MCOperand::createDFPImm(bit_cast<uint64_t>(Flt.Val)));
else
llvm_unreachable("Should be float immediate!");
}
void addBrListOperands(MCInst &Inst, unsigned N) const {
assert(N == 1 && isBrList() && "Invalid BrList!");
for (auto Br : BrL.List)
Inst.addOperand(MCOperand::createImm(Br));
}
void print(raw_ostream &OS) const override {
switch (Kind) {
case Token:
OS << "Tok:" << Tok.Tok;
break;
case Integer:
OS << "Int:" << Int.Val;
break;
case Float:
OS << "Flt:" << Flt.Val;
break;
case Symbol:
OS << "Sym:" << Sym.Exp;
break;
case BrList:
OS << "BrList:" << BrL.List.size();
break;
}
}
};
// Perhaps this should go somewhere common.
static wasm::WasmLimits DefaultLimits() {
return {wasm::WASM_LIMITS_FLAG_NONE, 0, 0};
}
static MCSymbolWasm *GetOrCreateFunctionTableSymbol(MCContext &Ctx,
const StringRef &Name) {
MCSymbolWasm *Sym = cast_or_null<MCSymbolWasm>(Ctx.lookupSymbol(Name));
if (Sym) {
if (!Sym->isFunctionTable())
Ctx.reportError(SMLoc(), "symbol is not a wasm funcref table");
} else {
Sym = cast<MCSymbolWasm>(Ctx.getOrCreateSymbol(Name));
Sym->setFunctionTable();
// The default function table is synthesized by the linker.
Sym->setUndefined();
}
return Sym;
}
class WebAssemblyAsmParser final : public MCTargetAsmParser {
MCAsmParser &Parser;
MCAsmLexer &Lexer;
// Much like WebAssemblyAsmPrinter in the backend, we have to own these.
std::vector<std::unique_ptr<wasm::WasmSignature>> Signatures;
std::vector<std::unique_ptr<std::string>> Names;
// Order of labels, directives and instructions in a .s file have no
// syntactical enforcement. This class is a callback from the actual parser,
// and yet we have to be feeding data to the streamer in a very particular
// order to ensure a correct binary encoding that matches the regular backend
// (the streamer does not enforce this). This "state machine" enum helps
// guarantee that correct order.
enum ParserState {
FileStart,
FunctionLabel,
FunctionStart,
FunctionLocals,
Instructions,
EndFunction,
DataSection,
} CurrentState = FileStart;
// For ensuring blocks are properly nested.
enum NestingType {
Function,
Block,
Loop,
Try,
CatchAll,
If,
Else,
Undefined,
};
struct Nested {
NestingType NT;
wasm::WasmSignature Sig;
};
std::vector<Nested> NestingStack;
MCSymbolWasm *DefaultFunctionTable = nullptr;
MCSymbol *LastFunctionLabel = nullptr;
bool is64;
WebAssemblyAsmTypeCheck TC;
// Don't type check if -no-type-check was set.
bool SkipTypeCheck;
public:
WebAssemblyAsmParser(const MCSubtargetInfo &STI, MCAsmParser &Parser,
const MCInstrInfo &MII, const MCTargetOptions &Options)
: MCTargetAsmParser(Options, STI, MII), Parser(Parser),
Lexer(Parser.getLexer()),
is64(STI.getTargetTriple().isArch64Bit()),
TC(Parser, MII, is64), SkipTypeCheck(Options.MCNoTypeCheck) {
setAvailableFeatures(ComputeAvailableFeatures(STI.getFeatureBits()));
// Don't type check if this is inline asm, since that is a naked sequence of
// instructions without a function/locals decl.
auto &SM = Parser.getSourceManager();
auto BufferName =
SM.getBufferInfo(SM.getMainFileID()).Buffer->getBufferIdentifier();
if (BufferName == "<inline asm>")
SkipTypeCheck = true;
}
void Initialize(MCAsmParser &Parser) override {
MCAsmParserExtension::Initialize(Parser);
DefaultFunctionTable = GetOrCreateFunctionTableSymbol(
getContext(), "__indirect_function_table");
if (!STI->checkFeatures("+reference-types"))
DefaultFunctionTable->setOmitFromLinkingSection();
}
#define GET_ASSEMBLER_HEADER
#include "WebAssemblyGenAsmMatcher.inc"
// TODO: This is required to be implemented, but appears unused.
bool parseRegister(MCRegister & /*RegNo*/, SMLoc & /*StartLoc*/,
SMLoc & /*EndLoc*/) override {
llvm_unreachable("parseRegister is not implemented.");
}
OperandMatchResultTy tryParseRegister(MCRegister & /*RegNo*/,
SMLoc & /*StartLoc*/,
SMLoc & /*EndLoc*/) override {
llvm_unreachable("tryParseRegister is not implemented.");
}
bool error(const Twine &Msg, const AsmToken &Tok) {
return Parser.Error(Tok.getLoc(), Msg + Tok.getString());
}
bool error(const Twine &Msg, SMLoc Loc = SMLoc()) {
return Parser.Error(Loc.isValid() ? Loc : Lexer.getTok().getLoc(), Msg);
}
void addSignature(std::unique_ptr<wasm::WasmSignature> &&Sig) {
Signatures.push_back(std::move(Sig));
}
StringRef storeName(StringRef Name) {
std::unique_ptr<std::string> N = std::make_unique<std::string>(Name);
Names.push_back(std::move(N));
return *Names.back();
}
std::pair<StringRef, StringRef> nestingString(NestingType NT) {
switch (NT) {
case Function:
return {"function", "end_function"};
case Block:
return {"block", "end_block"};
case Loop:
return {"loop", "end_loop"};
case Try:
return {"try", "end_try/delegate"};
case CatchAll:
return {"catch_all", "end_try"};
case If:
return {"if", "end_if"};
case Else:
return {"else", "end_if"};
default:
llvm_unreachable("unknown NestingType");
}
}
void push(NestingType NT) { NestingStack.push_back({NT, wasm::WasmSignature()}); }
bool pop(StringRef Ins, NestingType NT1, NestingType NT2 = Undefined) {
if (NestingStack.empty())
return error(Twine("End of block construct with no start: ") + Ins);
auto Top = NestingStack.back();
if (Top.NT != NT1 && Top.NT != NT2)
return error(Twine("Block construct type mismatch, expected: ") +
nestingString(Top.NT).second + ", instead got: " + Ins);
TC.setLastSig(Top.Sig);
NestingStack.pop_back();
return false;
}
bool ensureEmptyNestingStack(SMLoc Loc = SMLoc()) {
auto Err = !NestingStack.empty();
while (!NestingStack.empty()) {
error(Twine("Unmatched block construct(s) at function end: ") +
nestingString(NestingStack.back().NT).first,
Loc);
NestingStack.pop_back();
}
return Err;
}
bool isNext(AsmToken::TokenKind Kind) {
auto Ok = Lexer.is(Kind);
if (Ok)
Parser.Lex();
return Ok;
}
bool expect(AsmToken::TokenKind Kind, const char *KindName) {
if (!isNext(Kind))
return error(std::string("Expected ") + KindName + ", instead got: ",
Lexer.getTok());
return false;
}
StringRef expectIdent() {
if (!Lexer.is(AsmToken::Identifier)) {
error("Expected identifier, got: ", Lexer.getTok());
return StringRef();
}
auto Name = Lexer.getTok().getString();
Parser.Lex();
return Name;
}
bool parseRegTypeList(SmallVectorImpl<wasm::ValType> &Types) {
while (Lexer.is(AsmToken::Identifier)) {
auto Type = WebAssembly::parseType(Lexer.getTok().getString());
if (!Type)
return error("unknown type: ", Lexer.getTok());
Types.push_back(*Type);
Parser.Lex();
if (!isNext(AsmToken::Comma))
break;
}
return false;
}
void parseSingleInteger(bool IsNegative, OperandVector &Operands) {
auto &Int = Lexer.getTok();
int64_t Val = Int.getIntVal();
if (IsNegative)
Val = -Val;
Operands.push_back(std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Integer, Int.getLoc(), Int.getEndLoc(),
WebAssemblyOperand::IntOp{Val}));
Parser.Lex();
}
bool parseSingleFloat(bool IsNegative, OperandVector &Operands) {
auto &Flt = Lexer.getTok();
double Val;
if (Flt.getString().getAsDouble(Val, false))
return error("Cannot parse real: ", Flt);
if (IsNegative)
Val = -Val;
Operands.push_back(std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Float, Flt.getLoc(), Flt.getEndLoc(),
WebAssemblyOperand::FltOp{Val}));
Parser.Lex();
return false;
}
bool parseSpecialFloatMaybe(bool IsNegative, OperandVector &Operands) {
if (Lexer.isNot(AsmToken::Identifier))
return true;
auto &Flt = Lexer.getTok();
auto S = Flt.getString();
double Val;
if (S.compare_insensitive("infinity") == 0) {
Val = std::numeric_limits<double>::infinity();
} else if (S.compare_insensitive("nan") == 0) {
Val = std::numeric_limits<double>::quiet_NaN();
} else {
return true;
}
if (IsNegative)
Val = -Val;
Operands.push_back(std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Float, Flt.getLoc(), Flt.getEndLoc(),
WebAssemblyOperand::FltOp{Val}));
Parser.Lex();
return false;
}
bool checkForP2AlignIfLoadStore(OperandVector &Operands, StringRef InstName) {
// FIXME: there is probably a cleaner way to do this.
auto IsLoadStore = InstName.contains(".load") ||
InstName.contains(".store") ||
InstName.contains("prefetch");
auto IsAtomic = InstName.contains("atomic.");
if (IsLoadStore || IsAtomic) {
// Parse load/store operands of the form: offset:p2align=align
if (IsLoadStore && isNext(AsmToken::Colon)) {
auto Id = expectIdent();
if (Id != "p2align")
return error("Expected p2align, instead got: " + Id);
if (expect(AsmToken::Equal, "="))
return true;
if (!Lexer.is(AsmToken::Integer))
return error("Expected integer constant");
parseSingleInteger(false, Operands);
} else {
// v128.{load,store}{8,16,32,64}_lane has both a memarg and a lane
// index. We need to avoid parsing an extra alignment operand for the
// lane index.
auto IsLoadStoreLane = InstName.contains("_lane");
if (IsLoadStoreLane && Operands.size() == 4)
return false;
// Alignment not specified (or atomics, must use default alignment).
// We can't just call WebAssembly::GetDefaultP2Align since we don't have
// an opcode until after the assembly matcher, so set a default to fix
// up later.
auto Tok = Lexer.getTok();
Operands.push_back(std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Integer, Tok.getLoc(), Tok.getEndLoc(),
WebAssemblyOperand::IntOp{-1}));
}
}
return false;
}
void addBlockTypeOperand(OperandVector &Operands, SMLoc NameLoc,
WebAssembly::BlockType BT) {
if (BT != WebAssembly::BlockType::Void) {
wasm::WasmSignature Sig({static_cast<wasm::ValType>(BT)}, {});
TC.setLastSig(Sig);
NestingStack.back().Sig = Sig;
}
Operands.push_back(std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Integer, NameLoc, NameLoc,
WebAssemblyOperand::IntOp{static_cast<int64_t>(BT)}));
}
bool parseLimits(wasm::WasmLimits *Limits) {
auto Tok = Lexer.getTok();
if (!Tok.is(AsmToken::Integer))
return error("Expected integer constant, instead got: ", Tok);
int64_t Val = Tok.getIntVal();
assert(Val >= 0);
Limits->Minimum = Val;
Parser.Lex();
if (isNext(AsmToken::Comma)) {
Limits->Flags |= wasm::WASM_LIMITS_FLAG_HAS_MAX;
auto Tok = Lexer.getTok();
if (!Tok.is(AsmToken::Integer))
return error("Expected integer constant, instead got: ", Tok);
int64_t Val = Tok.getIntVal();
assert(Val >= 0);
Limits->Maximum = Val;
Parser.Lex();
}
return false;
}
bool parseFunctionTableOperand(std::unique_ptr<WebAssemblyOperand> *Op) {
if (STI->checkFeatures("+reference-types")) {
// If the reference-types feature is enabled, there is an explicit table
// operand. To allow the same assembly to be compiled with or without
// reference types, we allow the operand to be omitted, in which case we
// default to __indirect_function_table.
auto &Tok = Lexer.getTok();
if (Tok.is(AsmToken::Identifier)) {
auto *Sym =
GetOrCreateFunctionTableSymbol(getContext(), Tok.getString());
const auto *Val = MCSymbolRefExpr::create(Sym, getContext());
*Op = std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Symbol, Tok.getLoc(), Tok.getEndLoc(),
WebAssemblyOperand::SymOp{Val});
Parser.Lex();
return expect(AsmToken::Comma, ",");
} else {
const auto *Val =
MCSymbolRefExpr::create(DefaultFunctionTable, getContext());
*Op = std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Symbol, SMLoc(), SMLoc(),
WebAssemblyOperand::SymOp{Val});
return false;
}
} else {
// For the MVP there is at most one table whose number is 0, but we can't
// write a table symbol or issue relocations. Instead we just ensure the
// table is live and write a zero.
getStreamer().emitSymbolAttribute(DefaultFunctionTable, MCSA_NoDeadStrip);
*Op = std::make_unique<WebAssemblyOperand>(WebAssemblyOperand::Integer,
SMLoc(), SMLoc(),
WebAssemblyOperand::IntOp{0});
return false;
}
}
bool ParseInstruction(ParseInstructionInfo & /*Info*/, StringRef Name,
SMLoc NameLoc, OperandVector &Operands) override {
// Note: Name does NOT point into the sourcecode, but to a local, so
// use NameLoc instead.
Name = StringRef(NameLoc.getPointer(), Name.size());
// WebAssembly has instructions with / in them, which AsmLexer parses
// as separate tokens, so if we find such tokens immediately adjacent (no
// whitespace), expand the name to include them:
for (;;) {
auto &Sep = Lexer.getTok();
if (Sep.getLoc().getPointer() != Name.end() ||
Sep.getKind() != AsmToken::Slash)
break;
// Extend name with /
Name = StringRef(Name.begin(), Name.size() + Sep.getString().size());
Parser.Lex();
// We must now find another identifier, or error.
auto &Id = Lexer.getTok();
if (Id.getKind() != AsmToken::Identifier ||
Id.getLoc().getPointer() != Name.end())
return error("Incomplete instruction name: ", Id);
Name = StringRef(Name.begin(), Name.size() + Id.getString().size());
Parser.Lex();
}
// Now construct the name as first operand.
Operands.push_back(std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Token, NameLoc, SMLoc::getFromPointer(Name.end()),
WebAssemblyOperand::TokOp{Name}));
// If this instruction is part of a control flow structure, ensure
// proper nesting.
bool ExpectBlockType = false;
bool ExpectFuncType = false;
std::unique_ptr<WebAssemblyOperand> FunctionTable;
if (Name == "block") {
push(Block);
ExpectBlockType = true;
} else if (Name == "loop") {
push(Loop);
ExpectBlockType = true;
} else if (Name == "try") {
push(Try);
ExpectBlockType = true;
} else if (Name == "if") {
push(If);
ExpectBlockType = true;
} else if (Name == "else") {
if (pop(Name, If))
return true;
push(Else);
} else if (Name == "catch") {
if (pop(Name, Try))
return true;
push(Try);
} else if (Name == "catch_all") {
if (pop(Name, Try))
return true;
push(CatchAll);
} else if (Name == "end_if") {
if (pop(Name, If, Else))
return true;
} else if (Name == "end_try") {
if (pop(Name, Try, CatchAll))
return true;
} else if (Name == "delegate") {
if (pop(Name, Try))
return true;
} else if (Name == "end_loop") {
if (pop(Name, Loop))
return true;
} else if (Name == "end_block") {
if (pop(Name, Block))
return true;
} else if (Name == "end_function") {
ensureLocals(getStreamer());
CurrentState = EndFunction;
if (pop(Name, Function) || ensureEmptyNestingStack())
return true;
} else if (Name == "call_indirect" || Name == "return_call_indirect") {
// These instructions have differing operand orders in the text format vs
// the binary formats. The MC instructions follow the binary format, so
// here we stash away the operand and append it later.
if (parseFunctionTableOperand(&FunctionTable))
return true;
ExpectFuncType = true;
}
if (ExpectFuncType || (ExpectBlockType && Lexer.is(AsmToken::LParen))) {
// This has a special TYPEINDEX operand which in text we
// represent as a signature, such that we can re-build this signature,
// attach it to an anonymous symbol, which is what WasmObjectWriter
// expects to be able to recreate the actual unique-ified type indices.
auto Loc = Parser.getTok();
auto Signature = std::make_unique<wasm::WasmSignature>();
if (parseSignature(Signature.get()))
return true;
// Got signature as block type, don't need more
ExpectBlockType = false;
TC.setLastSig(*Signature.get());
if (ExpectBlockType)
NestingStack.back().Sig = *Signature.get();
auto &Ctx = getContext();
// The "true" here will cause this to be a nameless symbol.
MCSymbol *Sym = Ctx.createTempSymbol("typeindex", true);
auto *WasmSym = cast<MCSymbolWasm>(Sym);
WasmSym->setSignature(Signature.get());
addSignature(std::move(Signature));
WasmSym->setType(wasm::WASM_SYMBOL_TYPE_FUNCTION);
const MCExpr *Expr = MCSymbolRefExpr::create(
WasmSym, MCSymbolRefExpr::VK_WASM_TYPEINDEX, Ctx);
Operands.push_back(std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Symbol, Loc.getLoc(), Loc.getEndLoc(),
WebAssemblyOperand::SymOp{Expr}));
}
while (Lexer.isNot(AsmToken::EndOfStatement)) {
auto &Tok = Lexer.getTok();
switch (Tok.getKind()) {
case AsmToken::Identifier: {
if (!parseSpecialFloatMaybe(false, Operands))
break;
auto &Id = Lexer.getTok();
if (ExpectBlockType) {
// Assume this identifier is a block_type.
auto BT = WebAssembly::parseBlockType(Id.getString());
if (BT == WebAssembly::BlockType::Invalid)
return error("Unknown block type: ", Id);
addBlockTypeOperand(Operands, NameLoc, BT);
Parser.Lex();
} else {
// Assume this identifier is a label.
const MCExpr *Val;
SMLoc Start = Id.getLoc();
SMLoc End;
if (Parser.parseExpression(Val, End))
return error("Cannot parse symbol: ", Lexer.getTok());
Operands.push_back(std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::Symbol, Start, End,
WebAssemblyOperand::SymOp{Val}));
if (checkForP2AlignIfLoadStore(Operands, Name))
return true;
}
break;
}
case AsmToken::Minus:
Parser.Lex();
if (Lexer.is(AsmToken::Integer)) {
parseSingleInteger(true, Operands);
if (checkForP2AlignIfLoadStore(Operands, Name))
return true;
} else if(Lexer.is(AsmToken::Real)) {
if (parseSingleFloat(true, Operands))
return true;
} else if (!parseSpecialFloatMaybe(true, Operands)) {
} else {
return error("Expected numeric constant instead got: ",
Lexer.getTok());
}
break;
case AsmToken::Integer:
parseSingleInteger(false, Operands);
if (checkForP2AlignIfLoadStore(Operands, Name))
return true;
break;
case AsmToken::Real: {
if (parseSingleFloat(false, Operands))
return true;
break;
}
case AsmToken::LCurly: {
Parser.Lex();
auto Op = std::make_unique<WebAssemblyOperand>(
WebAssemblyOperand::BrList, Tok.getLoc(), Tok.getEndLoc());
if (!Lexer.is(AsmToken::RCurly))
for (;;) {
Op->BrL.List.push_back(Lexer.getTok().getIntVal());
expect(AsmToken::Integer, "integer");
if (!isNext(AsmToken::Comma))
break;
}
expect(AsmToken::RCurly, "}");
Operands.push_back(std::move(Op));
break;
}
default:
return error("Unexpected token in operand: ", Tok);
}
if (Lexer.isNot(AsmToken::EndOfStatement)) {
if (expect(AsmToken::Comma, ","))
return true;
}
}
if (ExpectBlockType && Operands.size() == 1) {
// Support blocks with no operands as default to void.
addBlockTypeOperand(Operands, NameLoc, WebAssembly::BlockType::Void);
}
if (FunctionTable)
Operands.push_back(std::move(FunctionTable));
Parser.Lex();
return false;
}
bool parseSignature(wasm::WasmSignature *Signature) {
if (expect(AsmToken::LParen, "("))
return true;
if (parseRegTypeList(Signature->Params))
return true;
if (expect(AsmToken::RParen, ")"))
return true;
if (expect(AsmToken::MinusGreater, "->"))
return true;
if (expect(AsmToken::LParen, "("))
return true;
if (parseRegTypeList(Signature->Returns))
return true;
if (expect(AsmToken::RParen, ")"))
return true;
return false;
}
bool CheckDataSection() {
if (CurrentState != DataSection) {
auto WS = cast<MCSectionWasm>(getStreamer().getCurrentSection().first);
if (WS && WS->getKind().isText())
return error("data directive must occur in a data segment: ",
Lexer.getTok());
}
CurrentState = DataSection;
return false;
}
// This function processes wasm-specific directives streamed to
// WebAssemblyTargetStreamer, all others go to the generic parser
// (see WasmAsmParser).
bool ParseDirective(AsmToken DirectiveID) override {
// This function has a really weird return value behavior that is different
// from all the other parsing functions:
// - return true && no tokens consumed -> don't know this directive / let
// the generic parser handle it.
// - return true && tokens consumed -> a parsing error occurred.
// - return false -> processed this directive successfully.
assert(DirectiveID.getKind() == AsmToken::Identifier);
auto &Out = getStreamer();
auto &TOut =
reinterpret_cast<WebAssemblyTargetStreamer &>(*Out.getTargetStreamer());
auto &Ctx = Out.getContext();
// TODO: any time we return an error, at least one token must have been
// consumed, otherwise this will not signal an error to the caller.
if (DirectiveID.getString() == ".globaltype") {
auto SymName = expectIdent();
if (SymName.empty())
return true;
if (expect(AsmToken::Comma, ","))
return true;
auto TypeTok = Lexer.getTok();
auto TypeName = expectIdent();
if (TypeName.empty())
return true;
auto Type = WebAssembly::parseType(TypeName);
if (!Type)
return error("Unknown type in .globaltype directive: ", TypeTok);
// Optional mutable modifier. Default to mutable for historical reasons.
// Ideally we would have gone with immutable as the default and used `mut`
// as the modifier to match the `.wat` format.
bool Mutable = true;
if (isNext(AsmToken::Comma)) {
TypeTok = Lexer.getTok();
auto Id = expectIdent();
if (Id == "immutable")
Mutable = false;
else
// Should we also allow `mutable` and `mut` here for clarity?
return error("Unknown type in .globaltype modifier: ", TypeTok);
}
// Now set this symbol with the correct type.
auto WasmSym = cast<MCSymbolWasm>(Ctx.getOrCreateSymbol(SymName));
WasmSym->setType(wasm::WASM_SYMBOL_TYPE_GLOBAL);
WasmSym->setGlobalType(wasm::WasmGlobalType{uint8_t(*Type), Mutable});
// And emit the directive again.
TOut.emitGlobalType(WasmSym);
return expect(AsmToken::EndOfStatement, "EOL");
}
if (DirectiveID.getString() == ".tabletype") {
// .tabletype SYM, ELEMTYPE[, MINSIZE[, MAXSIZE]]
auto SymName = expectIdent();
if (SymName.empty())
return true;
if (expect(AsmToken::Comma, ","))
return true;
auto ElemTypeTok = Lexer.getTok();
auto ElemTypeName = expectIdent();
if (ElemTypeName.empty())
return true;
std::optional<wasm::ValType> ElemType =
WebAssembly::parseType(ElemTypeName);
if (!ElemType)
return error("Unknown type in .tabletype directive: ", ElemTypeTok);
wasm::WasmLimits Limits = DefaultLimits();
if (isNext(AsmToken::Comma) && parseLimits(&Limits))
return true;
// Now that we have the name and table type, we can actually create the
// symbol
auto WasmSym = cast<MCSymbolWasm>(Ctx.getOrCreateSymbol(SymName));
WasmSym->setType(wasm::WASM_SYMBOL_TYPE_TABLE);
wasm::WasmTableType Type = {uint8_t(*ElemType), Limits};
WasmSym->setTableType(Type);
TOut.emitTableType(WasmSym);
return expect(AsmToken::EndOfStatement, "EOL");
}
if (DirectiveID.getString() == ".functype") {
// This code has to send things to the streamer similar to
// WebAssemblyAsmPrinter::EmitFunctionBodyStart.
// TODO: would be good to factor this into a common function, but the
// assembler and backend really don't share any common code, and this code
// parses the locals separately.
auto SymName = expectIdent();
if (SymName.empty())
return true;
auto WasmSym = cast<MCSymbolWasm>(Ctx.getOrCreateSymbol(SymName));
if (WasmSym->isDefined()) {
// We push 'Function' either when a label is parsed or a .functype
// directive is parsed. The reason it is not easy to do this uniformly
// in a single place is,
// 1. We can't do this at label parsing time only because there are
// cases we don't have .functype directive before a function label,
// in which case we don't know if the label is a function at the time
// of parsing.
// 2. We can't do this at .functype parsing time only because we want to
// detect a function started with a label and not ended correctly
// without encountering a .functype directive after the label.
if (CurrentState != FunctionLabel) {
// This .functype indicates a start of a function.
if (ensureEmptyNestingStack())
return true;
push(Function);
}
CurrentState = FunctionStart;
LastFunctionLabel = WasmSym;
}
auto Signature = std::make_unique<wasm::WasmSignature>();
if (parseSignature(Signature.get()))
return true;
TC.funcDecl(*Signature);
WasmSym->setSignature(Signature.get());
addSignature(std::move(Signature));
WasmSym->setType(wasm::WASM_SYMBOL_TYPE_FUNCTION);
TOut.emitFunctionType(WasmSym);
// TODO: backend also calls TOut.emitIndIdx, but that is not implemented.
return expect(AsmToken::EndOfStatement, "EOL");
}
if (DirectiveID.getString() == ".export_name") {
auto SymName = expectIdent();
if (SymName.empty())
return true;
if (expect(AsmToken::Comma, ","))
return true;
auto ExportName = expectIdent();
auto WasmSym = cast<MCSymbolWasm>(Ctx.getOrCreateSymbol(SymName));
WasmSym->setExportName(storeName(ExportName));
TOut.emitExportName(WasmSym, ExportName);
}
if (DirectiveID.getString() == ".import_module") {
auto SymName = expectIdent();
if (SymName.empty())
return true;
if (expect(AsmToken::Comma, ","))
return true;
auto ImportModule = expectIdent();
auto WasmSym = cast<MCSymbolWasm>(Ctx.getOrCreateSymbol(SymName));
WasmSym->setImportModule(storeName(ImportModule));
TOut.emitImportModule(WasmSym, ImportModule);
}
if (DirectiveID.getString() == ".import_name") {
auto SymName = expectIdent();
if (SymName.empty())
return true;
if (expect(AsmToken::Comma, ","))
return true;
auto ImportName = expectIdent();
auto WasmSym = cast<MCSymbolWasm>(Ctx.getOrCreateSymbol(SymName));
WasmSym->setImportName(storeName(ImportName));
TOut.emitImportName(WasmSym, ImportName);
}
if (DirectiveID.getString() == ".tagtype") {
auto SymName = expectIdent();
if (SymName.empty())
return true;
auto WasmSym = cast<MCSymbolWasm>(Ctx.getOrCreateSymbol(SymName));
auto Signature = std::make_unique<wasm::WasmSignature>();
if (parseRegTypeList(Signature->Params))
return true;
WasmSym->setSignature(Signature.get());
addSignature(std::move(Signature));
WasmSym->setType(wasm::WASM_SYMBOL_TYPE_TAG);
TOut.emitTagType(WasmSym);
// TODO: backend also calls TOut.emitIndIdx, but that is not implemented.
return expect(AsmToken::EndOfStatement, "EOL");
}
if (DirectiveID.getString() == ".local") {
if (CurrentState != FunctionStart)
return error(".local directive should follow the start of a function: ",
Lexer.getTok());
SmallVector<wasm::ValType, 4> Locals;
if (parseRegTypeList(Locals))
return true;
TC.localDecl(Locals);
TOut.emitLocal(Locals);
CurrentState = FunctionLocals;
return expect(AsmToken::EndOfStatement, "EOL");
}
if (DirectiveID.getString() == ".int8" ||
DirectiveID.getString() == ".int16" ||
DirectiveID.getString() == ".int32" ||
DirectiveID.getString() == ".int64") {
if (CheckDataSection()) return true;
const MCExpr *Val;
SMLoc End;
if (Parser.parseExpression(Val, End))
return error("Cannot parse .int expression: ", Lexer.getTok());
size_t NumBits = 0;
DirectiveID.getString().drop_front(4).getAsInteger(10, NumBits);
Out.emitValue(Val, NumBits / 8, End);
return expect(AsmToken::EndOfStatement, "EOL");
}
if (DirectiveID.getString() == ".asciz") {
if (CheckDataSection()) return true;
std::string S;
if (Parser.parseEscapedString(S))
return error("Cannot parse string constant: ", Lexer.getTok());
Out.emitBytes(StringRef(S.c_str(), S.length() + 1));
return expect(AsmToken::EndOfStatement, "EOL");
}
return true; // We didn't process this directive.
}
// Called either when the first instruction is parsed of the function ends.
void ensureLocals(MCStreamer &Out) {
if (CurrentState == FunctionStart) {
// We haven't seen a .local directive yet. The streamer requires locals to
// be encoded as a prelude to the instructions, so emit an empty list of
// locals here.
auto &TOut = reinterpret_cast<WebAssemblyTargetStreamer &>(
*Out.getTargetStreamer());
TOut.emitLocal(SmallVector<wasm::ValType, 0>());
CurrentState = FunctionLocals;
}
}
bool MatchAndEmitInstruction(SMLoc IDLoc, unsigned & /*Opcode*/,
OperandVector &Operands, MCStreamer &Out,
uint64_t &ErrorInfo,
bool MatchingInlineAsm) override {
MCInst Inst;
Inst.setLoc(IDLoc);
FeatureBitset MissingFeatures;
unsigned MatchResult = MatchInstructionImpl(
Operands, Inst, ErrorInfo, MissingFeatures, MatchingInlineAsm);
switch (MatchResult) {
case Match_Success: {
ensureLocals(Out);
// Fix unknown p2align operands.
auto Align = WebAssembly::GetDefaultP2AlignAny(Inst.getOpcode());
if (Align != -1U) {
auto &Op0 = Inst.getOperand(0);
if (Op0.getImm() == -1)
Op0.setImm(Align);
}
if (is64) {
// Upgrade 32-bit loads/stores to 64-bit. These mostly differ by having
// an offset64 arg instead of offset32, but to the assembler matcher
// they're both immediates so don't get selected for.
auto Opc64 = WebAssembly::getWasm64Opcode(
static_cast<uint16_t>(Inst.getOpcode()));
if (Opc64 >= 0) {
Inst.setOpcode(Opc64);
}
}
if (!SkipTypeCheck && TC.typeCheck(IDLoc, Inst, Operands))
return true;
Out.emitInstruction(Inst, getSTI());
if (CurrentState == EndFunction) {
onEndOfFunction(IDLoc);
} else {
CurrentState = Instructions;
}
return false;
}
case Match_MissingFeature: {
assert(MissingFeatures.count() > 0 && "Expected missing features");
SmallString<128> Message;
raw_svector_ostream OS(Message);
OS << "instruction requires:";
for (unsigned i = 0, e = MissingFeatures.size(); i != e; ++i)
if (MissingFeatures.test(i))
OS << ' ' << getSubtargetFeatureName(i);
return Parser.Error(IDLoc, Message);
}
case Match_MnemonicFail:
return Parser.Error(IDLoc, "invalid instruction");
case Match_NearMisses:
return Parser.Error(IDLoc, "ambiguous instruction");
case Match_InvalidTiedOperand:
case Match_InvalidOperand: {
SMLoc ErrorLoc = IDLoc;
if (ErrorInfo != ~0ULL) {
if (ErrorInfo >= Operands.size())
return Parser.Error(IDLoc, "too few operands for instruction");
ErrorLoc = Operands[ErrorInfo]->getStartLoc();
if (ErrorLoc == SMLoc())
ErrorLoc = IDLoc;
}
return Parser.Error(ErrorLoc, "invalid operand for instruction");
}
}
llvm_unreachable("Implement any new match types added!");
}
void doBeforeLabelEmit(MCSymbol *Symbol, SMLoc IDLoc) override {
// Code below only applies to labels in text sections.
auto CWS = cast<MCSectionWasm>(getStreamer().getCurrentSection().first);
if (!CWS || !CWS->getKind().isText())
return;
auto WasmSym = cast<MCSymbolWasm>(Symbol);
// Unlike other targets, we don't allow data in text sections (labels
// declared with .type @object).
if (WasmSym->getType() == wasm::WASM_SYMBOL_TYPE_DATA) {
Parser.Error(IDLoc,
"Wasm doesn\'t support data symbols in text sections");
return;
}
// Start a new section for the next function automatically, since our
// object writer expects each function to have its own section. This way
// The user can't forget this "convention".
auto SymName = Symbol->getName();
if (SymName.startswith(".L"))
return; // Local Symbol.
// TODO: If the user explicitly creates a new function section, we ignore
// its name when we create this one. It would be nice to honor their
// choice, while still ensuring that we create one if they forget.
// (that requires coordination with WasmAsmParser::parseSectionDirective)
auto SecName = ".text." + SymName;
auto *Group = CWS->getGroup();
// If the current section is a COMDAT, also set the flag on the symbol.
// TODO: Currently the only place that the symbols' comdat flag matters is
// for importing comdat functions. But there's no way to specify that in
// assembly currently.
if (Group)
WasmSym->setComdat(true);
auto *WS =
getContext().getWasmSection(SecName, SectionKind::getText(), 0, Group,
MCContext::GenericSectionID, nullptr);
getStreamer().switchSection(WS);
// Also generate DWARF for this section if requested.
if (getContext().getGenDwarfForAssembly())
getContext().addGenDwarfSection(WS);
if (WasmSym->isFunction()) {
// We give the location of the label (IDLoc) here, because otherwise the
// lexer's next location will be used, which can be confusing. For
// example:
//
// test0: ; This function does not end properly
// ...
//
// test1: ; We would like to point to this line for error
// ... . Not this line, which can contain any instruction
ensureEmptyNestingStack(IDLoc);
CurrentState = FunctionLabel;
LastFunctionLabel = Symbol;
push(Function);
}
}
void onEndOfFunction(SMLoc ErrorLoc) {
if (!SkipTypeCheck)
TC.endOfFunction(ErrorLoc);
// Reset the type checker state.
TC.Clear();
}
void onEndOfFile() override { ensureEmptyNestingStack(); }
};
} // end anonymous namespace
// Force static initialization.
extern "C" LLVM_EXTERNAL_VISIBILITY void LLVMInitializeWebAssemblyAsmParser() {
RegisterMCAsmParser<WebAssemblyAsmParser> X(getTheWebAssemblyTarget32());
RegisterMCAsmParser<WebAssemblyAsmParser> Y(getTheWebAssemblyTarget64());
}
#define GET_REGISTER_MATCHER
#define GET_SUBTARGET_FEATURE_NAME
#define GET_MATCHER_IMPLEMENTATION
#include "WebAssemblyGenAsmMatcher.inc"
StringRef GetMnemonic(unsigned Opc) {
// FIXME: linear search!
for (auto &ME : MatchTable0) {
if (ME.Opcode == Opc) {
return ME.getMnemonic();
}
}
assert(false && "mnemonic not found");
return StringRef();
}
``` |
Antonio Aloisio (November 11, 1898 – January 28, 1977) was a politician from Alberta, Canada. He served in the Legislative Assembly of Alberta from 1952 to 1955 and again from 1959 to 1971 as a member of the Social Credit caucus.
Political career
Aloisio first ran for a seat to the Alberta Legislature as a Social Credit candidate in the 1952 general election. He won a comfortable majority to hold the Athabasca electoral district for his party.
He ran for a second term in the 1955 general election and was defeated by Liberal candidate Richard Hall. He led on the first count but was defeated on second choice preferences. He regained the seat for Social Credit in the 1959 election, defeating Hall by a large majority.
In the 1963 general election, Aloisio faced a strong challenge from provincial Liberal leader Dave Hunter, but managed to hang on to his seat. Hunter and Aloisio faced each other again in the 1967 election. Aloisio held the seat with an increase in his vote and Hunter finished a distant third.
Aloisio retired from the legislature at dissolution in 1971.
References
External links
Legislative Assembly of Alberta Members Listing
1898 births
1977 deaths
Alberta Social Credit Party MLAs
20th-century Canadian legislators |
Sydney South West Area Health Service, abbreviated SSWAHS and known by the corporate name Sydney South West Health, was an area health service charged with the provision of public health services in central and south-western Sydney. It was formed in January 2005 from the amalgamation of the former Central Sydney Area Health Service and the South Western Sydney Area Health Service. It was a statutory body of the New South Wales Government, operating under the NSW Department of Health. The head office of SSWAHS was located in Liverpool. It was disbanded on 1 January 2011 as part of the National Health Reform and creation of Local Hospital Networks, and replaced by the Sydney Local Health District and South Western Sydney Local Health District.
Major facilities
Eastern Zone
The Eastern Zone of SSWAHS comprised the facilities of the former Central Sydney Area Health Service. Major facilities in the Eastern Zone were:
Canterbury Hospital, Canterbury
Concord Repatriation General Hospital, Concord
Royal Prince Alfred Hospital, Camperdown
Concord Centre for Mental Health, Concord (Sydney South West Area Mental Health Service)
Sydney Dental Hospital, Surry Hills
Balmain Hospital, Balmain
Western Zone
The Western Zone of SSWAHS comprised the facilities of the former South Western Sydney Area Health Service. Major facilities in the Western Zone were:
Bankstown Lidcombe Hospital, Bankstown
Camden Hospital, Camden
Campbelltown Hospital, Campbelltown
Fairfield Hospital, Fairfield
Liverpool Hospital, Liverpool
Bowral Hospital, Bowral
See also
List of hospitals in Australia
References
External links
Sydney South West Area Health Service website
Sydney Local Health District website
South Western Sydney Local Health District website
Government agencies of New South Wales
Healthcare in Sydney |
```yaml
description: TI SimpleLink CC13xx / CC26xx SPI node
compatible: "ti,cc13xx-cc26xx-spi"
include: [spi-controller.yaml, pinctrl-device.yaml, base.yaml]
properties:
reg:
required: true
``` |
```c
/**
* @file lv_draw_sw_letter.c
*
*/
/*********************
* INCLUDES
*********************/
#include "blend/lv_draw_sw_blend_private.h"
#include "../lv_draw_label_private.h"
#include "lv_draw_sw.h"
#if LV_USE_DRAW_SW
#include "../../display/lv_display.h"
#include "../../misc/lv_math.h"
#include "../../misc/lv_assert.h"
#include "../../misc/lv_area.h"
#include "../../misc/lv_style.h"
#include "../../font/lv_font.h"
#include "../../core/lv_refr_private.h"
#include "../../stdlib/lv_string.h"
/*********************
* DEFINES
*********************/
/**********************
* TYPEDEFS
**********************/
/**********************
* STATIC PROTOTYPES
**********************/
static void /* LV_ATTRIBUTE_FAST_MEM */ draw_letter_cb(lv_draw_unit_t * draw_unit, lv_draw_glyph_dsc_t * glyph_draw_dsc,
lv_draw_fill_dsc_t * fill_draw_dsc, const lv_area_t * fill_area);
/**********************
* STATIC VARIABLES
**********************/
/**********************
* GLOBAL VARIABLES
**********************/
/**********************
* MACROS
**********************/
/**********************
* GLOBAL FUNCTIONS
**********************/
void lv_draw_sw_label(lv_draw_unit_t * draw_unit, const lv_draw_label_dsc_t * dsc, const lv_area_t * coords)
{
if(dsc->opa <= LV_OPA_MIN) return;
LV_PROFILER_BEGIN;
lv_draw_label_iterate_characters(draw_unit, dsc, coords, draw_letter_cb);
LV_PROFILER_END;
}
/**********************
* STATIC FUNCTIONS
**********************/
static void LV_ATTRIBUTE_FAST_MEM draw_letter_cb(lv_draw_unit_t * draw_unit, lv_draw_glyph_dsc_t * glyph_draw_dsc,
lv_draw_fill_dsc_t * fill_draw_dsc, const lv_area_t * fill_area)
{
if(glyph_draw_dsc) {
switch(glyph_draw_dsc->format) {
case LV_FONT_GLYPH_FORMAT_NONE: {
#if LV_USE_FONT_PLACEHOLDER
/* Draw a placeholder rectangle*/
lv_draw_border_dsc_t border_draw_dsc;
lv_draw_border_dsc_init(&border_draw_dsc);
border_draw_dsc.opa = glyph_draw_dsc->opa;
border_draw_dsc.color = glyph_draw_dsc->color;
border_draw_dsc.width = 1;
lv_draw_sw_border(draw_unit, &border_draw_dsc, glyph_draw_dsc->bg_coords);
#endif
}
break;
case LV_FONT_GLYPH_FORMAT_A1:
case LV_FONT_GLYPH_FORMAT_A2:
case LV_FONT_GLYPH_FORMAT_A4:
case LV_FONT_GLYPH_FORMAT_A8: {
lv_area_t mask_area = *glyph_draw_dsc->letter_coords;
mask_area.x2 = mask_area.x1 + lv_draw_buf_width_to_stride(lv_area_get_width(&mask_area), LV_COLOR_FORMAT_A8) - 1;
lv_draw_sw_blend_dsc_t blend_dsc;
lv_memzero(&blend_dsc, sizeof(blend_dsc));
blend_dsc.color = glyph_draw_dsc->color;
blend_dsc.opa = glyph_draw_dsc->opa;
lv_draw_buf_t * draw_buf = glyph_draw_dsc->glyph_data;
blend_dsc.mask_buf = draw_buf->data;
blend_dsc.mask_area = &mask_area;
blend_dsc.mask_stride = draw_buf->header.stride;
blend_dsc.blend_area = glyph_draw_dsc->letter_coords;
blend_dsc.mask_res = LV_DRAW_SW_MASK_RES_CHANGED;
lv_draw_sw_blend(draw_unit, &blend_dsc);
}
break;
case LV_FONT_GLYPH_FORMAT_IMAGE: {
#if LV_USE_IMGFONT
lv_draw_image_dsc_t img_dsc;
lv_draw_image_dsc_init(&img_dsc);
img_dsc.rotation = 0;
img_dsc.scale_x = LV_SCALE_NONE;
img_dsc.scale_y = LV_SCALE_NONE;
img_dsc.opa = glyph_draw_dsc->opa;
img_dsc.src = glyph_draw_dsc->glyph_data;
lv_draw_sw_image(draw_unit, &img_dsc, glyph_draw_dsc->letter_coords);
#endif
}
break;
default:
break;
}
}
if(fill_draw_dsc && fill_area) {
lv_draw_sw_fill(draw_unit, fill_draw_dsc, fill_area);
}
}
#endif /*LV_USE_DRAW_SW*/
``` |
Franciscus Liberati (1615–1703) was a Roman Catholic prelate who served as titular archbishop of Ephesus (1688–1703).
Biography
Franciscus Liberati was born in 1615.
On 24 February 1688, he was appointed during the papacy of Pope Innocent XI as titular archbishop of Ephesus.
On 25 April 1688, he was consecrated bishop by Gasparo Carpegna, cardinal-priest of San Silvestro in Capite, with Odoardo Cibo, Titular Archbishop of Seleucia in Isauria, and Ercole Visconti, titular archbishop of Ephesus, serving as co-consecrators.
He remained as titular archbishop of Tamiathis until his death on 18 April 1703.
While bishop, he was the principal co-consecrator of Petrus Draghi Bartoli, titular patriarch of Alexandria (1690).
References
17th-century Roman Catholic titular archbishops
18th-century Roman Catholic titular archbishops
Bishops appointed by Pope Innocent XI
1615 births
1703 deaths |
```objective-c
/*
* Compatibility section
* This section sets new-style macros based on old-style ones, for compatibility
*/
#if defined (__STL_DEBUG) && !defined (_STLP_DEBUG)
# define _STLP_DEBUG __STL_DEBUG
#endif
#if defined (__STL_NO_ANACHRONISMS) && !defined (_STLP_NO_ANACHRONISMS)
# define _STLP_NO_ANACHRONISMS __STL_NO_ANACHRONISMS
#endif
#if defined (__STL_NO_EXTENSIONS) && !defined (_STLP_NO_EXTENSIONS)
# define _STLP_NO_EXTENSIONS __STL_NO_EXTENSIONS
#endif
#if defined (__STL_NO_EXCEPTIONS) && !defined (_STLP_NO_EXCEPTIONS)
# define _STLP_NO_EXCEPTIONS __STL_NO_EXCEPTIONS
#endif
#if defined (__STL_NO_NAMESPACES) && !defined (_STLP_NO_NAMESPACES)
# define _STLP_NO_NAMESPACES __STL_NO_NAMESPACES
#endif
#if defined (__STL_MINIMUM_DEFAULT_TEMPLATE_PARAMS) && !defined (_STLP_MINIMUM_DEFAULT_TEMPLATE_PARAMS)
# define _STLP_MINIMUM_DEFAULT_TEMPLATE_PARAMS __STL_MINIMUM_DEFAULT_TEMPLATE_PARAMS
#endif
#if defined (__STL_NO_OWN_NAMESPACE) && !defined (_STLP_NO_OWN_NAMESPACE)
# define _STLP_NO_OWN_NAMESPACE __STL_NO_OWN_NAMESPACE
#endif
#if defined (__STL_NO_RELOPS_NAMESPACE) && !defined (_STLP_NO_RELOPS_NAMESPACE)
# define _STLP_NO_RELOPS_NAMESPACE __STL_NO_RELOPS_NAMESPACE
#endif
#if defined (__STL_DEBUG_UNINITIALIZED) && !defined (_STLP_DEBUG_UNINITIALIZED)
# define _STLP_DEBUG_UNINITIALIZED __STL_DEBUG_UNINITIALIZED
#endif
#if defined (__STL_SHRED_BYTE) && !defined (_STLP_SHRED_BYTE)
# define _STLP_SHRED_BYTE __STL_SHRED_BYTE
#endif
#if defined (__STL_USE_MFC) && !defined (_STLP_USE_MFC)
# define _STLP_USE_MFC __STL_USE_MFC
#endif
#if defined (__STL_USE_NEWALLOC) && !defined (_STLP_USE_NEWALLOC)
# define _STLP_USE_NEWALLOC __STL_USE_NEWALLOC
#endif
#if defined (__STL_USE_MALLOC) && !defined (_STLP_USE_MALLOC)
# define _STLP_USE_MALLOC __STL_USE_MALLOC
#endif
#if defined (__STL_DEBUG_ALLOC) && !defined (_STLP_DEBUG_ALLOC)
# define _STLP_DEBUG_ALLOC __STL_DEBUG_ALLOC
#endif
#if defined (__STL_DEBUG_MESSAGE) && !defined (_STLP_DEBUG_MESSAGE)
# define _STLP_DEBUG_MESSAGE __STL_DEBUG_MESSAGE
#endif
#if defined (__STL_DEBUG_TERMINATE) && !defined (_STLP_DEBUG_TERMINATE)
# define _STLP_DEBUG_TERMINATE __STL_DEBUG_TERMINATE
#endif
#if defined (__STL_USE_ABBREVS) && !defined (_STLP_USE_ABBREVS)
# define _STLP_USE_ABBREVS __STL_USE_ABBREVS
#endif
#if defined (__STL_NO_MSVC50_COMPATIBILITY) && !defined (_STLP_NO_MSVC50_COMPATIBILITY)
# define _STLP_NO_MSVC50_COMPATIBILITY __STL_NO_MSVC50_COMPATIBILITY
#endif
/* STLport do not support anymore the iostream wrapper mode so this macro should
* always been define for other libraries that was using it:
*/
#if !defined (_STLP_OWN_IOSTREAMS)
# define _STLP_OWN_IOSTREAMS
#endif
#if defined (_STLP_NO_OWN_IOSTREAMS)
# error STLport do not support anymore the wrapper mode. If you want to use STLport \
use its iostreams implementation or no iostreams at all.
#endif
``` |
```shell
#!/bin/bash
#Include utils
source ../utils/utils.sh
make-bare-remote-repo
clone-remote-to-exercise
git commit --allow-empty -m "Initial commit"
git tag v0.0
git push origin master
git push origin v0.0
echo "Hello" > hello.code
git add hello.code
git commit -m "Helo Volrd feature"
echo "HelloWrld?" > hello.code
echo "Unrelated stuff!" > other.code
git add -A
git commit -am "Finished HW feature"
echo "Hello World!" > hello.code
git commit -am "Really made the thingy done"
echo "println DEBUG" >> hello.code
git commit -am "debugging"
echo "4321pass" > private.secret
git add private.secret
git commit -m "important secret"
echo "# THE Hello World program" > README.md
git add README.md
git commit -m "Add doc - step 1"
echo "# THE Ultimate Hello World program" > README.md
git commit -am "Add doc - step 2"
echo "" >> README.md
echo "This program does exactly what it says" >> README.md
git commit -am "Add doc - step 3"
echo "does_it_work(hello.code)" > hello.test
git add hello.test
git commit -m "Test for feature hello world"
echo "does_it_work(hello.code);" > hello.test
git commit -am "I forgot a semicolon"
``` |
Derek Theler (born October 29, 1986) is an American actor and model.
Acting career
Theler started his acting career in 2009, starring in several minor roles in TV series such as The Middle, Cougar Town, and The Hills.
In between acting gigs, Theler appeared as a model in TV commercials. He first landed a Coke Zero commercial in 2009. This was followed by a campaign for State Farm, in which he played a "hot guy" who was conjured up by three women. He has also been in commercials for Nike, Kayak.com, Arby's, and Verizon.
Aside from acting, he was also the writer and executive producer of a short film called Intrusion.
In 2012, Theler landed his first major role when he was cast in the ABC Family comedy Baby Daddy, playing Danny Wheeler, the brother of the title character. Also that year, Theler starred as Riggins in the web series Project S.E.R.A.
In 2015, he starred as Chase Walker in the movie Shark Killer, which released on June 16, 2015 via digital download. Theler played the role of shark killer who hunts down a black-finned shark that swallowed a valuable diamond during a gang transaction. He also starred as Jordan in Christmas movie How Sarah Got Her Wings, which was released on digital hd and video on demand on November 1, 2015. The Christmas movie premiered on Ion television on December 6, 2015.
On November 19, 2015, Theler starred in the Funny or Die parody titled Chicago Sanitation. In 2016, Theler starred as Jake Kenman in family movie Secret Summer, which was released on April 2, 2016 on PixL (On Demand and YouTube). He also appeared on short Princess Rap Battle, where he played the role of Huntsman and it was released on YouTube on April 6, 2016.
In 2017, he starred as Chris in the short film Brotherly Love alongside Krista Kalmus. The same year, Theler was cast as Craig Hollis / Mister Immortal in the planned Marvel Cinematic Universe series New Warriors. The series notoriously lost its distributor before it could air proper and was ultimately cancelled. He guest starred in an episode of ABC comedy American Housewife as Dirk. In 2018, he played the role of Aric Dacia/X-O Manowar in the Valiant Entertainment's Ninjak vs. the Valiant Universe. He also guest starred as Conan in the YouTube series Wayne and as Thor a.k.a. Donar the Great in the Starz series American Gods. Theler guest starred in Hulu's web comedy series Dollface playing the role of Ryan, a man Jules has a fling with.
On September 24, 2019, Theler was cast as Sasquatch in the Paramount Network military series 68 Whiskey. In 2022, he guest starred as Billy McShane in an episode of Leverage: Redemption.
Personal life
Theler was diagnosed with Type 1 Diabetes at age 3. He attended Colorado State University in Fort Collins, Colorado.
He started dating actress Lisa Marie Summerscales in May 2016. In July 2022, Theler announced on his Instagram that he and Summerscales had become engaged. They got married in September of the same year.
Filmography
Film
Television
Web series
Music
Awards and nominations
References
External links
Living people
American male television actors
American male film actors
Male actors from Colorado
Colorado State University alumni
Actors from Alaska
People with type 1 diabetes
21st-century American male actors
1986 births |
The Christopher McEwen House was a property in Franklin, Tennessee that was listed on the National Register of Historic Places, but later was removed from the Register, in 1995.
It was built in c.1836 and included Federal and Colonial Revival architecture.
When listed the property included four contributing buildings and one non-contributing structure on an area of .
Its NRHP eligibility was addressed in a 1988 study of Williamson County historical resources.
It was removed from the Register in 1995. Usually when a property is removed that means its historic building(s) have been demolished or otherwise lost their historic integrity.
See also
David McEwen House, also NRHP-listed in Franklin, Tennessee
References
Former National Register of Historic Places in Tennessee
Houses in Franklin, Tennessee
Federal architecture in Tennessee
Colonial Revival architecture in Tennessee
Houses completed in 1836
Houses on the National Register of Historic Places in Tennessee
National Register of Historic Places in Williamson County, Tennessee |
```xml
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<vector xmlns:android="path_to_url" android:height="24dp" android:viewportHeight="24.0" android:viewportWidth="24.0" android:width="24dp">
<path android:fillColor="#FFFFFF" android:pathData="M19,7h-8v6h8L19,7zM21,3L3,3c-1.1,0 -2,0.9 -2,2v14c0,1.1 0.9,1.98 2,1.98h18c1.1,0 2,-0.88 2,-1.98L23,5c0,-1.1 -0.9,-2 -2,-2zM21,19.01L3,19.01L3,4.98h18v14.03z"/>
</vector>
``` |
```xml
import { BuilderElement, createStringElement, OnOffElement, XmlComponent } from "@file/xml-components";
// <xsd:complexType name="CT_Font">
// <xsd:sequence>
// <xsd:element name="altName" type="CT_String" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="panose1" type="CT_Panose" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="charset" type="CT_Charset" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="family" type="CT_FontFamily" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="notTrueType" type="CT_OnOff" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="pitch" type="CT_Pitch" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="sig" type="CT_FontSig" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="embedRegular" type="CT_FontRel" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="embedBold" type="CT_FontRel" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="embedItalic" type="CT_FontRel" minOccurs="0" maxOccurs="1"/>
// <xsd:element name="embedBoldItalic" type="CT_FontRel" minOccurs="0" maxOccurs="1"/>
// </xsd:sequence>
// <xsd:attribute name="name" type="s:ST_String" use="required"/>
// </xsd:complexType>
// <xsd:complexType name="CT_FontRel">
// <xsd:complexContent>
// <xsd:extension base="CT_Rel">
// <xsd:attribute name="fontKey" type="s:ST_Guid" />
// <xsd:attribute name="subsetted" type="s:ST_OnOff" />
// </xsd:extension>
// </xsd:complexContent>
// </xsd:complexType>
// path_to_url
export interface IFontRelationshipOptions {
/**
* Relationship to Part
*/
readonly id: string;
/**
* Embedded Font Obfuscation Key
*/
readonly fontKey?: string;
/**
* Embedded Font Is Subsetted
*/
readonly subsetted?: boolean;
}
export const CharacterSet = {
ANSI: "00",
DEFAULT: "01",
SYMBOL: "02",
MAC: "4D",
JIS: "80",
HANGUL: "81",
JOHAB: "82",
GB_2312: "86",
CHINESEBIG5: "88",
GREEK: "A1",
TURKISH: "A2",
VIETNAMESE: "A3",
HEBREW: "B1",
ARABIC: "B2",
BALTIC: "BA",
RUSSIAN: "CC",
THAI: "DE",
EASTEUROPE: "EE",
OEM: "FF",
} as const;
export type FontOptions = {
readonly name: string;
readonly altName?: string;
readonly panose1?: string;
readonly charset?: (typeof CharacterSet)[keyof typeof CharacterSet];
readonly family?: string;
readonly notTrueType?: boolean;
readonly pitch?: string;
readonly sig?: {
readonly usb0: string;
readonly usb1: string;
readonly usb2: string;
readonly usb3: string;
readonly csb0: string;
readonly csb1: string;
};
readonly embedRegular?: IFontRelationshipOptions;
readonly embedBold?: IFontRelationshipOptions;
readonly embedItalic?: IFontRelationshipOptions;
readonly embedBoldItalic?: IFontRelationshipOptions;
};
const createFontRelationship = ({ id, fontKey, subsetted }: IFontRelationshipOptions, name: string): XmlComponent =>
new BuilderElement({
name,
attributes: {
id: { key: "r:id", value: id },
...(fontKey ? { fontKey: { key: "w:fontKey", value: `{${fontKey}}` } } : {}),
},
children: [...(subsetted ? [new OnOffElement("w:subsetted", subsetted)] : [])],
});
export const createFont = ({
name,
altName,
panose1,
charset,
family,
notTrueType,
pitch,
sig,
embedRegular,
embedBold,
embedItalic,
embedBoldItalic,
}: FontOptions): XmlComponent =>
// path_to_url
new BuilderElement({
name: "w:font",
attributes: {
name: { key: "w:name", value: name },
},
children: [
// path_to_url
...(altName ? [createStringElement("w:altName", altName)] : []),
// path_to_url
...(panose1 ? [createStringElement("w:panose1", panose1)] : []),
// path_to_url
...(charset ? [createStringElement("w:charset", charset)] : []),
// path_to_url
...(family ? [createStringElement("w:family", family)] : []),
// path_to_url
...(notTrueType ? [new OnOffElement("w:notTrueType", notTrueType)] : []),
...(pitch ? [createStringElement("w:pitch", pitch)] : []),
// path_to_url
...(sig
? [
new BuilderElement({
name: "w:sig",
attributes: {
usb0: { key: "w:usb0", value: sig.usb0 },
usb1: { key: "w:usb1", value: sig.usb1 },
usb2: { key: "w:usb2", value: sig.usb2 },
usb3: { key: "w:usb3", value: sig.usb3 },
csb0: { key: "w:csb0", value: sig.csb0 },
csb1: { key: "w:csb1", value: sig.csb1 },
},
}),
]
: []),
// path_to_url
...(embedRegular ? [createFontRelationship(embedRegular, "w:embedRegular")] : []),
// path_to_url
...(embedBold ? [createFontRelationship(embedBold, "w:embedBold")] : []),
// path_to_url
...(embedItalic ? [createFontRelationship(embedItalic, "w:embedItalic")] : []),
// path_to_url
...(embedBoldItalic ? [createFontRelationship(embedBoldItalic, "w:embedBoldItalic")] : []),
],
});
``` |
Kacper Majchrzak (born 22 September 1992) is a Polish swimmer. He currently represents the Cali Condors which is part of the International Swimming League.
Majchrzak competed in the 50 m freestyle and 4 × 100m medley relay events at the 2012 Summer Olympics. He finished 10th in the 200 metre freestyle at the 2016 Summer Olympics setting a new national record of 1:46.30.
Career
International Swimming League
In 2019 he was a member of the inaugural International Swimming League representing the Cali Condors, who finished third place in the final match in Las Vegas, Nevada in December. Majchrzak competed in the 100 meter and 200 meter freestyle events as well as all 3 relay events throughout the season.
References
1992 births
Sportspeople from Poznań
Living people
Polish male freestyle swimmers
Swimmers at the 2012 Summer Olympics
Swimmers at the 2016 Summer Olympics
Olympic swimmers for Poland
Male medley swimmers
Universiade medalists in swimming
European Aquatics Championships medalists in swimming
Universiade silver medalists for Poland
Medalists at the 2017 Summer Universiade
Swimmers at the 2020 Summer Olympics
21st-century Polish people |
```html
<html>
<head>
<title>NVIDIA(R) PhysX(R) SDK 3.4 API Reference: Class Members - Functions</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<LINK HREF="NVIDIA.css" REL="stylesheet" TYPE="text/css">
</head>
<body bgcolor="#FFFFFF">
<div id="header">
<hr class="first">
<img alt="" src="images/PhysXlogo.png" align="middle"> <br>
<center>
<a class="qindex" href="main.html">Main Page</a>
<a class="qindex" href="hierarchy.html">Class Hierarchy</a>
<a class="qindex" href="annotated.html">Compound List</a>
<a class="qindex" href="functions.html">Compound Members</a>
</center>
<hr class="second">
</div>
<!-- Generated by Doxygen 1.5.8 -->
<div class="tabs">
<ul>
<li><a href="functions.html"><span>All</span></a></li>
<li class="current"><a href="functions_func.html"><span>Functions</span></a></li>
<li><a href="functions_vars.html"><span>Variables</span></a></li>
<li><a href="functions_type.html"><span>Typedefs</span></a></li>
<li><a href="functions_enum.html"><span>Enumerations</span></a></li>
<li><a href="functions_eval.html"><span>Enumerator</span></a></li>
<li><a href="functions_rela.html"><span>Related Functions</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="functions_func.html#index_a"><span>a</span></a></li>
<li><a href="functions_func_0x62.html#index_b"><span>b</span></a></li>
<li><a href="functions_func_0x63.html#index_c"><span>c</span></a></li>
<li><a href="functions_func_0x64.html#index_d"><span>d</span></a></li>
<li><a href="functions_func_0x65.html#index_e"><span>e</span></a></li>
<li><a href="functions_func_0x66.html#index_f"><span>f</span></a></li>
<li><a href="functions_func_0x67.html#index_g"><span>g</span></a></li>
<li><a href="functions_func_0x68.html#index_h"><span>h</span></a></li>
<li><a href="functions_func_0x69.html#index_i"><span>i</span></a></li>
<li><a href="functions_func_0x6c.html#index_l"><span>l</span></a></li>
<li><a href="functions_func_0x6d.html#index_m"><span>m</span></a></li>
<li><a href="functions_func_0x6e.html#index_n"><span>n</span></a></li>
<li><a href="functions_func_0x6f.html#index_o"><span>o</span></a></li>
<li><a href="functions_func_0x70.html#index_p"><span>p</span></a></li>
<li><a href="functions_func_0x72.html#index_r"><span>r</span></a></li>
<li class="current"><a href="functions_func_0x73.html#index_s"><span>s</span></a></li>
<li><a href="functions_func_0x74.html#index_t"><span>t</span></a></li>
<li><a href="functions_func_0x75.html#index_u"><span>u</span></a></li>
<li><a href="functions_func_0x76.html#index_v"><span>v</span></a></li>
<li><a href="functions_func_0x77.html#index_w"><span>w</span></a></li>
<li><a href="functions_func_0x7a.html#index_z"><span>z</span></a></li>
<li><a href="functions_func_0x7e.html#index_~"><span>~</span></a></li>
</ul>
</div>
<div class="contents">
<p>
<h3><a class="anchor" name="index_s">- s -</a></h3><ul>
<li>save()
: <a class="el" href="classPxClothFabricCooker.html#6d9657cf26e9eece0d0fe66dfaf5f12a">PxClothFabricCooker</a>
<li>saveCells()
: <a class="el" href="classPxHeightField.html#d509e93fd7d7fc43726160540faeb610">PxHeightField</a>
<li>scale()
: <a class="el" href="classPxMat44.html#00550660a7488827dd9fe2b1520bba90">PxMat44</a>
<li>scaleFast()
: <a class="el" href="group__foundation.html#ge942e76eff12ad0827a6d3870afb9bc9">PxBounds3</a>
<li>scaleInertia()
: <a class="el" href="classPxMassProperties.html#4ba3bf338320c9f0bf558b5d3a9046bd">PxMassProperties</a>
<li>scaleRestlengths()
: <a class="el" href="classPxClothFabric.html#56084286b66bf374e3fe37fbd097a83b">PxClothFabric</a>
<li>scaleSafe()
: <a class="el" href="group__foundation.html#g34f70075ac4a52e2d7fb8afc03afc6e2">PxBounds3</a>
<li>sceneQueriesUpdate()
: <a class="el" href="classPxScene.html#a2b103c61cc84c1df17b82266a17413f">PxScene</a>
<li>seek()
: <a class="el" href="classPxDefaultMemoryInputData.html#7344d413c8bdf97731fd63d06ba26b54">PxDefaultMemoryInputData</a>
, <a class="el" href="classPxDefaultFileInputData.html#234ab504e8d281b6e0319e40dcac7c4d">PxDefaultFileInputData</a>
, <a class="el" href="classPxInputData.html#c80d55021a6bae02a1cc64d27a98c575">PxInputData</a>
<li>seekRead()
: <a class="el" href="classPxFileBuf.html#e706ac6909e4fe16db22cbe1ca2dc53d">PxFileBuf</a>
<li>seekWrite()
: <a class="el" href="classPxFileBuf.html#7fab04894cb6b2c4440e87ca33d66340">PxFileBuf</a>
<li>serializeCollectionToBinary()
: <a class="el" href="classPxSerialization.html#1d6242bea0c7513bfbfb24670e5cfb03">PxSerialization</a>
<li>serializeCollectionToXml()
: <a class="el" href="classPxSerialization.html#cbb99dac3e71e78338ab3eec4ab0ab75">PxSerialization</a>
<li>set()
: <a class="el" href="structPxExtendedVec3.html#16e7d8daf70ae2dc2c9553f92e1e74e3">PxExtendedVec3</a>
, <a class="el" href="group__foundation.html#gf9d14cf14cd5e1a4c3849f323d4a5c71">PxFlags< enumtype, storagetype ></a>
<li>setAckermannGeometryData()
: <a class="el" href="classPxVehicleDriveSimData4W.html#5a0a4baf4721c3b213258978ed7003fb">PxVehicleDriveSimData4W</a>
<li>setActorFlag()
: <a class="el" href="classPxActor.html#e24ff3f3ed0cb2a138b382fd0720b94f">PxActor</a>
<li>setActorFlags()
: <a class="el" href="classPxActor.html#f60720e190324e8ff36281a2360c6043">PxActor</a>
<li>setActors()
: <a class="el" href="classPxConstraint.html#ad3f1f8c8e4220238c8fcb00c440e701">PxConstraint</a>
, <a class="el" href="classPxJoint.html#e3f3bbd628f77104c438a16a1e9bff2f">PxJoint</a>
<li>setAnalogAccel()
: <a class="el" href="classPxVehicleDrive4WRawInputData.html#f9c058df3af57913173e106fd51645d9">PxVehicleDrive4WRawInputData</a>
, <a class="el" href="classPxVehicleDriveTankRawInputData.html#1af6a6d1b1fb77d0bcc7e5af1e350a14">PxVehicleDriveTankRawInputData</a>
<li>setAnalogBrake()
: <a class="el" href="classPxVehicleDrive4WRawInputData.html#96d32688f239c2f9379616c6fbbde422">PxVehicleDrive4WRawInputData</a>
<li>setAnalogHandbrake()
: <a class="el" href="classPxVehicleDrive4WRawInputData.html#b2541ef77142c3fc2b4c8a2ce197f512">PxVehicleDrive4WRawInputData</a>
<li>setAnalogInput()
: <a class="el" href="classPxVehicleDriveDynData.html#702f9f3b98ba914cb313383aef4b45d5">PxVehicleDriveDynData</a>
<li>setAnalogLeftBrake()
: <a class="el" href="classPxVehicleDriveTankRawInputData.html#b1694ab536feae168670452b88804d08">PxVehicleDriveTankRawInputData</a>
<li>setAnalogLeftThrust()
: <a class="el" href="classPxVehicleDriveTankRawInputData.html#5e456c1b780b26b900d47afe0c0509ef">PxVehicleDriveTankRawInputData</a>
<li>setAnalogRightBrake()
: <a class="el" href="classPxVehicleDriveTankRawInputData.html#ba110cc558497adbe79c2abb3d45504c">PxVehicleDriveTankRawInputData</a>
<li>setAnalogRightThrust()
: <a class="el" href="classPxVehicleDriveTankRawInputData.html#1dacc730a946b0e23d57968a22d9ff72">PxVehicleDriveTankRawInputData</a>
<li>setAnalogSteer()
: <a class="el" href="classPxVehicleDrive4WRawInputData.html#55b3e0151ca011438b5de595741e0ccf">PxVehicleDrive4WRawInputData</a>
<li>setAngularDamping()
: <a class="el" href="classPxRigidDynamic.html#5435556860f16008b2c88ae6c36025dd">PxRigidDynamic</a>
<li>setAngularDragCoefficient()
: <a class="el" href="classPxCloth.html#39a4c1f5258832f51940aaf9a44aa10f">PxCloth</a>
<li>setAngularInertiaScale()
: <a class="el" href="classPxCloth.html#5deea84f3f38b4b98f358e56acff221e">PxCloth</a>
<li>setAngularVelocity()
: <a class="el" href="classPxRigidBody.html#d49850630db14af26e019d2550ecfd27">PxRigidBody</a>
<li>setAntiRollBarData()
: <a class="el" href="classPxVehicleWheelsSimData.html#e8706a8f39a630ba469414fb814fe206">PxVehicleWheelsSimData</a>
<li>setAutoBoxData()
: <a class="el" href="classPxVehicleDriveSimData.html#c7128888b46d993ff574d7eb3078e36d">PxVehicleDriveSimData</a>
<li>setAutoBoxSwitchTime()
: <a class="el" href="classPxVehicleDriveDynData.html#0de28a83d795f037d4042f0a5601087b">PxVehicleDriveDynData</a>
<li>setBaseFlag()
: <a class="el" href="classPxBase.html#1dd20bb574075df904e1878f2e771ef9">PxBase</a>
<li>setBaseFlags()
: <a class="el" href="classPxBase.html#fb391b692c561df0a54c413785e4ebd0">PxBase</a>
<li>setBit()
: <a class="el" href="classPxBitAndDataT.html#4f9b369d7f1da505910cb6b6b900d95f">PxBitAndDataT< storageType, bitMask ></a>
<li>setBounceThresholdVelocity()
: <a class="el" href="classPxScene.html#1e102ec1b29dea3b588b7507561e656e">PxScene</a>
<li>setBrakeTorque()
: <a class="el" href="classPxVehicleNoDrive.html#3150f58d865082068a1bf7c674cec010">PxVehicleNoDrive</a>
<li>setBreakForce()
: <a class="el" href="classPxConstraint.html#dc0b069b41e76b7c017632cfc24f08d3">PxConstraint</a>
, <a class="el" href="classPxJoint.html#1cfe86fe5c8131cea1b9b5ff9df7a014">PxJoint</a>
<li>setBroadPhaseCallback()
: <a class="el" href="classPxScene.html#c1110386fc2ffad70aa771aabc51d026">PxScene</a>
<li>setCCDContactModifyCallback()
: <a class="el" href="classPxScene.html#593d339e0fd64e47fa3b68016ce723ec">PxScene</a>
<li>setCCDMaxPasses()
: <a class="el" href="classPxScene.html#ed46505d6eac63a508c7a2d7e39cd5fb">PxScene</a>
<li>setCentrifugalInertiaScale()
: <a class="el" href="classPxCloth.html#4c765fceb26e3c72c0b1c526ea5773f6">PxCloth</a>
<li>setChassisMass()
: <a class="el" href="classPxVehicleWheelsSimData.html#c022268fa66b80edb6bb9b078923ba99">PxVehicleWheelsSimData</a>
<li>setChildPose()
: <a class="el" href="classPxArticulationJoint.html#1ede77555b69f0f137d1d20c8a8ea69c">PxArticulationJoint</a>
<li>setClientBehaviorFlags()
: <a class="el" href="classPxActor.html#d7b70236ed41524eda4c92636922d599">PxActor</a>
, <a class="el" href="classPxScene.html#6f61e48083f63f6fac343a3b1d8b2ddc">PxScene</a>
<li>setClimbingMode()
: <a class="el" href="classPxCapsuleController.html#256d6b281406c5bd1fa30dbc99e5a2df">PxCapsuleController</a>
<li>setClothFlag()
: <a class="el" href="classPxCloth.html#3d3ee58e3b3960efb9d1e22422806c9d">PxCloth</a>
<li>setClothFlags()
: <a class="el" href="classPxCloth.html#6bc462eec7ba57909611c047a40003b6">PxCloth</a>
<li>setClothInterCollisionDistance()
: <a class="el" href="classPxScene.html#b42513ab6ce4137698565ca8629eea1c">PxScene</a>
<li>setClothInterCollisionNbIterations()
: <a class="el" href="classPxScene.html#7197a1ce70671bfc81e6f3088920ac16">PxScene</a>
<li>setClothInterCollisionStiffness()
: <a class="el" href="classPxScene.html#85444db1420db29be5c0b748197b4fed">PxScene</a>
<li>setClutchData()
: <a class="el" href="classPxVehicleDriveSimData.html#0edff168e18a4d5c923460cb0ee3fe8b">PxVehicleDriveSimData</a>
<li>setCMassLocalPose()
: <a class="el" href="classPxRigidBody.html#b152773926fe7b222d61e982c3cb6adf">PxRigidBody</a>
<li>setCollisionMassScale()
: <a class="el" href="classPxCloth.html#64d468f1f5bab0e2cfabcb02b9fe9f0b">PxCloth</a>
<li>setCollisionPlanes()
: <a class="el" href="classPxCloth.html#c9fb679ec22ccad7ba5ea9b2397873d6">PxCloth</a>
<li>setCollisionSpheres()
: <a class="el" href="classPxCloth.html#d4bde7978010861d13207ba2dcd36b7a">PxCloth</a>
<li>setCollisionTriangles()
: <a class="el" href="classPxCloth.html#62d56093aa47f45a263c62721bd12530">PxCloth</a>
<li>setCompletionTask()
: <a class="el" href="classphysx_1_1PxGpuTask.html#70580dd1b3cfde44c4cbb66064cdab4c">physx::PxGpuTask</a>
<li>setConstraintFlag()
: <a class="el" href="classPxJoint.html#5bbf2a4196e036d711eea9bd5e542ce9">PxJoint</a>
<li>setConstraintFlags()
: <a class="el" href="classPxJoint.html#857ea5abc40d94b0e1537b566a9d45bf">PxJoint</a>
<li>setConstraintFunctions()
: <a class="el" href="classPxConstraint.html#3fb6da793a10be50c30bb8e3fb175d68">PxConstraint</a>
<li>setContactModifyCallback()
: <a class="el" href="classPxScene.html#eec3367a4461c1ab2e552acdb8c0609e">PxScene</a>
<li>setContactOffset()
: <a class="el" href="classPxShape.html#07c638b68e14de5e284a03dbcc128d27">PxShape</a>
, <a class="el" href="classPxController.html#6bf15ba0b66b3f271fdb2f2c6cb8c68b">PxController</a>
, <a class="el" href="classPxCloth.html#04c2915cae434276ab7b60dcffa6f096">PxCloth</a>
, <a class="el" href="classPxParticleBase.html#1daf9cb4e5b4a0abbfee215c144582e4">PxParticleBase</a>
<li>setContactReportThreshold()
: <a class="el" href="classPxRigidDynamic.html#bfd510964f2287e81fe76a1a9e1725b5">PxRigidDynamic</a>
<li>setContextId()
: <a class="el" href="classphysx_1_1PxBaseTask.html#0fa6ca56b758ea6b8be5c3acc8e89364">physx::PxBaseTask</a>
<li>setContinuation()
: <a class="el" href="classphysx_1_1PxLightCpuTask.html#56ef764508a2bbc98d82bb6dbb09fa3e">physx::PxLightCpuTask</a>
<li>setCpuDispatcher()
: <a class="el" href="classphysx_1_1PxTaskManager.html#c391319b63678f793dc6800b5ecda801">physx::PxTaskManager</a>
<li>setCurrentGear()
: <a class="el" href="classPxVehicleDriveDynData.html#a7f0d12794afa5fcfa1b5ede6bd2539d">PxVehicleDriveDynData</a>
<li>setDamping()
: <a class="el" href="classPxArticulationJoint.html#e9a7c940a51ae6df5e7e2370692a1f4b">PxArticulationJoint</a>
, <a class="el" href="classPxDistanceJoint.html#1fcc6660ac4544d477582057ebff39de">PxDistanceJoint</a>
, <a class="el" href="classPxParticleBase.html#8fb190deeb6744368762b296d8819eeb">PxParticleBase</a>
<li>setDampingCoefficient()
: <a class="el" href="classPxCloth.html#6d636bc91871e6cde3535c72bfbc2f53">PxCloth</a>
<li>setDebugRenderingFlags()
: <a class="el" href="classPxControllerManager.html#6748551f35cb6eee1048e810f09fb9b9">PxControllerManager</a>
<li>setDiffData()
: <a class="el" href="classPxVehicleDriveSimData4W.html#6a0bd7a643cdba6571de4470ddb8533b">PxVehicleDriveSimData4W</a>
, <a class="el" href="classPxVehicleDriveSimDataNW.html#ff36d113c311cc254834efe8cc3d3964">PxVehicleDriveSimDataNW</a>
<li>setDigitalAccel()
: <a class="el" href="classPxVehicleDrive4WRawInputData.html#39a229c2fbc12f23ab146a6ce6b014ee">PxVehicleDrive4WRawInputData</a>
, <a class="el" href="classPxVehicleDriveTankRawInputData.html#ba1a38302de5b91b35c83d79053fc564">PxVehicleDriveTankRawInputData</a>
<li>setDigitalBrake()
: <a class="el" href="classPxVehicleDrive4WRawInputData.html#a5a7c8943c3ad9b20901988388614505">PxVehicleDrive4WRawInputData</a>
<li>setDigitalHandbrake()
: <a class="el" href="classPxVehicleDrive4WRawInputData.html#d63aa0083730fbafb77e60b76fc9c985">PxVehicleDrive4WRawInputData</a>
<li>setDigitalLeftBrake()
: <a class="el" href="classPxVehicleDriveTankRawInputData.html#96183c87242fda2d2ed1ca56fb24977d">PxVehicleDriveTankRawInputData</a>
<li>setDigitalLeftThrust()
: <a class="el" href="classPxVehicleDriveTankRawInputData.html#e5379f5da9762716cf7d567af369ed1e">PxVehicleDriveTankRawInputData</a>
<li>setDigitalRightBrake()
: <a class="el" href="classPxVehicleDriveTankRawInputData.html#d98a22d3fcdbaf1f2731e3072d3315c6">PxVehicleDriveTankRawInputData</a>
<li>setDigitalRightThrust()
: <a class="el" href="classPxVehicleDriveTankRawInputData.html#a4981fac8d036a4616ba2980f757e3ab">PxVehicleDriveTankRawInputData</a>
<li>setDigitalSteerLeft()
: <a class="el" href="classPxVehicleDrive4WRawInputData.html#c0bee2d84b744b13af694bf34384bb76">PxVehicleDrive4WRawInputData</a>
<li>setDigitalSteerRight()
: <a class="el" href="classPxVehicleDrive4WRawInputData.html#a4654bf9fa296e6e2fe3433cc1a79918">PxVehicleDrive4WRawInputData</a>
<li>setDistanceJointFlag()
: <a class="el" href="classPxDistanceJoint.html#ec3a1147c1d87db4fdf4573f9f190bfa">PxDistanceJoint</a>
<li>setDistanceJointFlags()
: <a class="el" href="classPxDistanceJoint.html#7ecea55140d9946b94279b1730507062">PxDistanceJoint</a>
<li>setDominanceGroup()
: <a class="el" href="classPxActor.html#614c46687cf76eb219ce47927fc90824">PxActor</a>
<li>setDominanceGroupPair()
: <a class="el" href="classPxScene.html#b6d9e986e6af967d2bd60a63a0b550c4">PxScene</a>
<li>setDownRatios()
: <a class="el" href="classPxVehicleAutoBoxData.html#a2353fe51236e4d02924eff9bccd94b2">PxVehicleAutoBoxData</a>
<li>setDragCoefficient()
: <a class="el" href="classPxCloth.html#e985ceb77e39016e6945b1bfbf51cd36">PxCloth</a>
<li>setDrive()
: <a class="el" href="classPxD6Joint.html#85811f1770be8ff4ea79b4e49b313599">PxD6Joint</a>
<li>setDriveForceLimit()
: <a class="el" href="classPxRevoluteJoint.html#2c51c5a515957c48e7a82d78947a1b0f">PxRevoluteJoint</a>
<li>setDriveGearRatio()
: <a class="el" href="classPxRevoluteJoint.html#b5bd3ea301323d7e8ef6b1db08b8834c">PxRevoluteJoint</a>
<li>setDriveModel()
: <a class="el" href="classPxVehicleDriveTank.html#dc228416d792c11e78d41028bf24fad6">PxVehicleDriveTank</a>
<li>setDrivenWheel()
: <a class="el" href="classPxVehicleDifferentialNWData.html#c8976b0853cae0c7baf95603aa1909f9">PxVehicleDifferentialNWData</a>
<li>setDrivenWheelStatus()
: <a class="el" href="classPxVehicleDifferentialNWData.html#9041277bd53d21ad9992365185f9a06e">PxVehicleDifferentialNWData</a>
<li>setDrivePosition()
: <a class="el" href="classPxD6Joint.html#22471ee961a299903402b10d786d36c7">PxD6Joint</a>
<li>setDriveTorque()
: <a class="el" href="classPxVehicleNoDrive.html#2cee320c1b39eb72f8350e63ae5fd749">PxVehicleNoDrive</a>
<li>setDriveType()
: <a class="el" href="classPxArticulationJoint.html#d9ca201e90b380133e8913fb756a52e2">PxArticulationJoint</a>
<li>setDriveVelocity()
: <a class="el" href="classPxD6Joint.html#f23b422a5ed89350c0f04664ae2351cc">PxD6Joint</a>
, <a class="el" href="classPxRevoluteJoint.html#3b468f55536921dd3f505883df1aa661">PxRevoluteJoint</a>
<li>setDynamicFriction()
: <a class="el" href="classPxContactSet.html#360344f51cce5d01c69701e3dcc3747b">PxContactSet</a>
, <a class="el" href="classPxMaterial.html#971a4c6a385310c28aaeaa1f5ead78e9">PxMaterial</a>
, <a class="el" href="classPxParticleBase.html#d95b342c529785ca7e126605804ccfbb">PxParticleBase</a>
<li>setDynamicTreeRebuildRateHint()
: <a class="el" href="classPxScene.html#bf2322887ca4db2fdea0229a44e2892c">PxScene</a>
<li>setEmpty()
: <a class="el" href="group__foundation.html#g9e31f59de4ce4f4ad1f1e51c401ac5fd">PxBounds3</a>
<li>setEndianMode()
: <a class="el" href="classPxFileBuf.html#f72ea9fc1222848db164855a3d8f8b70">PxFileBuf</a>
<li>setEngineData()
: <a class="el" href="classPxVehicleDriveSimData.html#7bc4349466a64ab5b50f8e0a847e1a2f">PxVehicleDriveSimData</a>
<li>setEngineRotationSpeed()
: <a class="el" href="classPxVehicleDriveDynData.html#881b76d5ad721e3e48fa68466e3dbee6">PxVehicleDriveDynData</a>
<li>setErrorLevel()
: <a class="el" href="classPxFoundation.html#ac16a599bd1ffc725f849703e7eb5696">PxFoundation</a>
<li>setExternalAcceleration()
: <a class="el" href="classPxCloth.html#e13130b689712c14e2c98f4d98d5fd1a">PxCloth</a>
, <a class="el" href="classPxParticleBase.html#b43431b492105e432f1f5eb33fabd0c4">PxParticleBase</a>
<li>setExternalCompliance()
: <a class="el" href="classPxArticulationJoint.html#cba73835e3bdfb85a362e59ba979a959">PxArticulationJoint</a>
<li>setExternalDriveIterations()
: <a class="el" href="classPxArticulation.html#767fb3ec58b891bcd8dd0d769a5789cf">PxArticulation</a>
<li>setFilterShaderData()
: <a class="el" href="classPxScene.html#5ab05d2a2c908d98aed4ca642c5f394d">PxScene</a>
<li>setFlag()
: <a class="el" href="classPxConstraint.html#95488eea1d5847d3d1408c3d5cdf2576">PxConstraint</a>
, <a class="el" href="classPxMaterial.html#3dbcd175e805766442291c1285eafe8c">PxMaterial</a>
, <a class="el" href="classPxScene.html#6610c08a5a92c894dcac9d658e48b7de">PxScene</a>
, <a class="el" href="classPxShape.html#3c879df184ef40514589c5aa3d1f2a33">PxShape</a>
<li>setFlags()
: <a class="el" href="classPxConstraint.html#2d697724814976973b1de9e303e15b3f">PxConstraint</a>
, <a class="el" href="classPxMaterial.html#452856bae712ad60a281ec45a4bd69a9">PxMaterial</a>
, <a class="el" href="classPxShape.html#fc179cb4b2146af98c76623d2fc0db6e">PxShape</a>
<li>setFootPosition()
: <a class="el" href="classPxController.html#b09889972859bf03168d1d48434094ff">PxController</a>
<li>setFrictionCoefficient()
: <a class="el" href="classPxCloth.html#11c07c5b385688e921d950f50ccf8e24">PxCloth</a>
<li>setFrictionCombineMode()
: <a class="el" href="classPxMaterial.html#15c32fcd28a63a02caad0247dd2e9835">PxMaterial</a>
<li>setFrictionType()
: <a class="el" href="classPxScene.html#9ff7784b4d51acf2d56b9462e256b58b">PxScene</a>
<li>setGearChange()
: <a class="el" href="classPxVehicleDriveDynData.html#ea22183763d8431279917949fb5be912">PxVehicleDriveDynData</a>
<li>setGearDown()
: <a class="el" href="classPxVehicleDriveDynData.html#0e31ae1c0d74b575ac10494e94fb325c">PxVehicleDriveDynData</a>
, <a class="el" href="classPxVehicleDrive4WRawInputData.html#5849bbe5d93b0a6178fe05413fd2f38e">PxVehicleDrive4WRawInputData</a>
, <a class="el" href="classPxVehicleDriveTankRawInputData.html#4ff7609f917b69e7bc329540b2c3aaa2">PxVehicleDriveTankRawInputData</a>
<li>setGearRatio()
: <a class="el" href="classPxVehicleGearsData.html#3e3deb6f0ea5abe0eb4602adb0d3291d">PxVehicleGearsData</a>
<li>setGearsData()
: <a class="el" href="classPxVehicleDriveSimData.html#6596d7535d54f6a43a6575b8f4c51748">PxVehicleDriveSimData</a>
<li>setGearSwitchTime()
: <a class="el" href="classPxVehicleDriveDynData.html#8a42ae9182f4e9375b94a19787dafa30">PxVehicleDriveDynData</a>
<li>setGearUp()
: <a class="el" href="classPxVehicleDriveDynData.html#fd97592ae5714d45c494957808fa7020">PxVehicleDriveDynData</a>
, <a class="el" href="classPxVehicleDrive4WRawInputData.html#dd91327bf12c6c5578e20d9df82d0432">PxVehicleDrive4WRawInputData</a>
, <a class="el" href="classPxVehicleDriveTankRawInputData.html#0093f8a955f714617b1269a652f0c709">PxVehicleDriveTankRawInputData</a>
<li>setGeometry()
: <a class="el" href="classPxShape.html#c6112e8c0ee9803eb3436bbaf673d98a">PxShape</a>
<li>setGlobalPose()
: <a class="el" href="classPxRigidActor.html#26994d9594ed9a04bd412bdeb2a55f3e">PxRigidActor</a>
, <a class="el" href="classPxCloth.html#e5b64a8e0ff184cf5ef76a5c6dd52ede">PxCloth</a>
<li>setGpuDispatcher()
: <a class="el" href="classphysx_1_1PxTaskManager.html#2222879a9e1f258c3d46579f56d65275">physx::PxTaskManager</a>
<li>setGravity()
: <a class="el" href="classPxScene.html#575ed34c73adbd61892d728a688479f3">PxScene</a>
<li>setGridSize()
: <a class="el" href="classPxParticleBase.html#f484aea29669a33f8bf78465d2d2f8b4">PxParticleBase</a>
<li>setHalfForwardExtent()
: <a class="el" href="classPxBoxController.html#cae44a6bab0ca9da6d47b84345d03e61">PxBoxController</a>
<li>setHalfHeight()
: <a class="el" href="classPxBoxController.html#f959bc51b41f2c00156cd28bd19fc240">PxBoxController</a>
<li>setHalfSideExtent()
: <a class="el" href="classPxBoxController.html#f1b0b85810c79821ddb61cb42d0ef730">PxBoxController</a>
<li>setHeight()
: <a class="el" href="classPxCapsuleController.html#8068e1a64b40a6c6a96bd30ba1db0883">PxCapsuleController</a>
<li>setHighForwardSpeedSubStepCount()
: <a class="el" href="classPxVehicleWheelsSimData.html#d959b05b234cf8b132d3e0a62072641a">PxVehicleWheelsSimData</a>
<li>setIncrementalRebuildRate()
: <a class="el" href="classPxSpatialIndex.html#c1d1711a3dc99f9bb244ca0d2ea78f5f">PxSpatialIndex</a>
<li>setInertiaScale()
: <a class="el" href="classPxCloth.html#ae66828d50e4ee25ed06a5abdf87bb5c">PxCloth</a>
<li>setInternalCompliance()
: <a class="el" href="classPxArticulationJoint.html#023d58f64e1e29a984beb935ca2a4f54">PxArticulationJoint</a>
<li>setInternalDriveIterations()
: <a class="el" href="classPxArticulation.html#cda14790e09cb759007038d35885065a">PxArticulation</a>
<li>setInvInertiaScale0()
: <a class="el" href="classPxContactSet.html#e145d9eec7403316390478f401837dcf">PxContactSet</a>
, <a class="el" href="classPxJoint.html#97cc4d817e404177af4c2a598bb944c3">PxJoint</a>
<li>setInvInertiaScale1()
: <a class="el" href="classPxContactSet.html#74a22b5ae3140aba546b66415427a7d5">PxContactSet</a>
, <a class="el" href="classPxJoint.html#d733659ee380ebf04a5d1d50fcf46222">PxJoint</a>
<li>setInvMassScale0()
: <a class="el" href="classPxContactSet.html#74648acc75bce20cfd555e76298b514f">PxContactSet</a>
, <a class="el" href="classPxJoint.html#df8d09205b60811980a2202f1265562b">PxJoint</a>
<li>setInvMassScale1()
: <a class="el" href="classPxContactSet.html#d77be76292fb196ff129d70c372c5d97">PxContactSet</a>
, <a class="el" href="classPxJoint.html#2f5f6c66b5e6933f8578a880a4a957ad">PxJoint</a>
<li>setKinematicTarget()
: <a class="el" href="classPxRigidDynamic.html#4464d188e7a1e94582c9cf35da9bbc93">PxRigidDynamic</a>
<li>setLatency()
: <a class="el" href="classPxVehicleAutoBoxData.html#b58a308ce4750594e3335d953d70281c">PxVehicleAutoBoxData</a>
<li>setLimit()
: <a class="el" href="classPxPrismaticJoint.html#7831c090d462d38eb7ba8e2fd25bc751">PxPrismaticJoint</a>
, <a class="el" href="classPxRevoluteJoint.html#d28e13ae7149b0a09f8b5a9d8beaae60">PxRevoluteJoint</a>
<li>setLimitCone()
: <a class="el" href="classPxSphericalJoint.html#7ca415d2d986e63c5d5fa86dde583e6c">PxSphericalJoint</a>
<li>setLimits()
: <a class="el" href="classPxScene.html#1c9025d9a26efa7b90c8c75cb7126b92">PxScene</a>
<li>setLinearDamping()
: <a class="el" href="classPxRigidDynamic.html#003953e985ace5966375acb0674f7b0b">PxRigidDynamic</a>
<li>setLinearDragCoefficient()
: <a class="el" href="classPxCloth.html#04fcc059b87d0011a1fc01979ea47bd2">PxCloth</a>
<li>setLinearInertiaScale()
: <a class="el" href="classPxCloth.html#a7ea423a0eca321e2b6aebd436792832">PxCloth</a>
<li>setLinearLimit()
: <a class="el" href="classPxD6Joint.html#8ceb03a43499c3f85a01ba00eea0c034">PxD6Joint</a>
<li>setLinearVelocity()
: <a class="el" href="classPxRigidBody.html#0aed51d5ddcf81b09a104ad7f0f30c05">PxRigidBody</a>
<li>setLocalPose()
: <a class="el" href="classPxShape.html#9f32c7cea3b5701de3f815cd64c978df">PxShape</a>
, <a class="el" href="classPxJoint.html#7bb7f7676c3660945356ef6e726c48b3">PxJoint</a>
<li>setLowForwardSpeedSubStepCount()
: <a class="el" href="classPxVehicleWheelsSimData.html#0fd598dcbca75814aab13fb002cac976">PxVehicleWheelsSimData</a>
<li>setMass()
: <a class="el" href="classPxRigidBody.html#8a697a7a4b9bdd2c83a68e84b9bc3a35">PxRigidBody</a>
<li>setMassAndPreserveNaturalFrequency()
: <a class="el" href="classPxVehicleSuspensionData.html#2bec1ac8b8808407d0af0accfcc21e57">PxVehicleSuspensionData</a>
<li>setMassAndUpdateInertia()
: <a class="el" href="classPxRigidBodyExt.html#b8f6af57a0fde875c41e5d747dec49fb">PxRigidBodyExt</a>
<li>setMassSpaceInertiaTensor()
: <a class="el" href="classPxRigidBody.html#755d0c8a8d1dd8b29e59d50a6dfda5fd">PxRigidBody</a>
<li>setMaterials()
: <a class="el" href="classPxShape.html#14fbf4de00134d17b85194487d68ff30">PxShape</a>
<li>setMaxAngularVelocity()
: <a class="el" href="classPxRigidDynamic.html#d90b8ba1636cfef0e3e2386bc21dc3f1">PxRigidDynamic</a>
<li>setMaxContactImpulse()
: <a class="el" href="classPxRigidBody.html#1a3bbe100e644995742f80f19ea8f250">PxRigidBody</a>
<li>setMaxDepenetrationVelocity()
: <a class="el" href="classPxRigidBody.html#261ce18fdc6cb81c0bfb46590db0867d">PxRigidBody</a>
<li>setMaxDistance()
: <a class="el" href="classPxDistanceJoint.html#a1f0551bbf0f5cac9878e41525d67e9a">PxDistanceJoint</a>
<li>setMaximal()
: <a class="el" href="group__foundation.html#g125e6c8496174f5aee6b53c2ecd9ba75">PxBounds3</a>
<li>setMaxImpulse()
: <a class="el" href="classPxContactSet.html#145d98e983e46057f0fa57903f671c06">PxContactSet</a>
<li>setMaxMotionDistance()
: <a class="el" href="classPxParticleBase.html#0e768c7a7e0375b870078d45c890721e">PxParticleBase</a>
<li>setMaxNbDynamicShapes()
: <a class="el" href="classPxVolumeCache.html#30048238aa971768c4bf24c56d186d7c">PxVolumeCache</a>
<li>setMaxNbStaticShapes()
: <a class="el" href="classPxVolumeCache.html#7c239abc1d93b2dea0cec7ae68d93319">PxVolumeCache</a>
<li>setMaxProjectionIterations()
: <a class="el" href="classPxArticulation.html#4154ccfb1afad6e3b8145a67e7f580bd">PxArticulation</a>
<li>setMetaData()
: <a class="el" href="classPxBinaryConverter.html#475c6a6dc11b63b3570f2fc5d21b5c0e">PxBinaryConverter</a>
<li>setMinCCDAdvanceCoefficient()
: <a class="el" href="classPxRigidBody.html#c6f4fe582726801cb09c2381de0c144d">PxRigidBody</a>
<li>setMinDistance()
: <a class="el" href="classPxDistanceJoint.html#1b58a39c6c0fa2cca1ea52a8da949e9b">PxDistanceJoint</a>
<li>setMinLongSlipDenominator()
: <a class="el" href="classPxVehicleWheelsSimData.html#940016ddd052f0c763a21fe776fdcc9d">PxVehicleWheelsSimData</a>
<li>setMinResponseThreshold()
: <a class="el" href="classPxConstraint.html#9ddd5450fca029d9574b5c854b77d3d6">PxConstraint</a>
<li>setMinusInfinity()
: <a class="el" href="structPxExtendedVec3.html#a69612b215b58d3cdafb51f66a622a7b">PxExtendedVec3</a>
<li>setMotion()
: <a class="el" href="classPxD6Joint.html#6253223e558ef6c3fd22a4d558dee97d">PxD6Joint</a>
<li>setMotionConstraintConfig()
: <a class="el" href="classPxCloth.html#161c0d634e0650187b0f737873bcca17">PxCloth</a>
<li>setMotionConstraints()
: <a class="el" href="classPxCloth.html#0ccf1ef6c461898826b66f285e8c9f6a">PxCloth</a>
<li>setName()
: <a class="el" href="classPxActor.html#fdcfb185892a5c8311fd0d825b0ce758">PxActor</a>
, <a class="el" href="classPxArticulation.html#1efa57c3102cb6258ee90ac70a3c2657">PxArticulation</a>
, <a class="el" href="classPxShape.html#51a289ac174c48ccc8d0b09d3fd90508">PxShape</a>
, <a class="el" href="classPxJoint.html#79fbf86820e6ac2b1e5aedf13478e3c4">PxJoint</a>
<li>setNbContactDataBlocks()
: <a class="el" href="classPxScene.html#148be23880c4e2d67f9f772066a9f966">PxScene</a>
<li>setNonWalkableMode()
: <a class="el" href="classPxController.html#8f30123d5e7d45c6fdb1992cf8c748ef">PxController</a>
<li>setNormal()
: <a class="el" href="classPxContactSet.html#fdc45b285e1aaedd29690571b2098daa">PxContactSet</a>
<li>setOverlapRecoveryModule()
: <a class="el" href="classPxControllerManager.html#7b82dfa1f30ab934fa287f1e3aabf3cf">PxControllerManager</a>
<li>setOwnerClient()
: <a class="el" href="classPxActor.html#9bb8613863cf1d73e4d0c0227f25bc6e">PxActor</a>
<li>setParams()
: <a class="el" href="classPxCooking.html#febe112057bd03660dd78dee384d5321">PxCooking</a>
<li>setParentPose()
: <a class="el" href="classPxArticulationJoint.html#8dd529f6924fa777f99c1d646ef3bca6">PxArticulationJoint</a>
<li>setParticleAccelerations()
: <a class="el" href="classPxCloth.html#4f41c83d95eef0f7ed3894920cb7556d">PxCloth</a>
<li>setParticleBaseFlag()
: <a class="el" href="classPxParticleBase.html#4445c7746cfd5cbcda51173d0cf5c93a">PxParticleBase</a>
<li>setParticleMass()
: <a class="el" href="classPxParticleBase.html#80881666e5ee6743b6ac2c1f8723ce19">PxParticleBase</a>
<li>setParticleReadDataFlag()
: <a class="el" href="classPxParticleBase.html#9fbba67f740bc2b915ce0eb8d5c1b099">PxParticleBase</a>
<li>setParticles()
: <a class="el" href="classPxCloth.html#45c9ddfe6fdadcb99dc26c41eea2afb9">PxCloth</a>
<li>setPlusInfinity()
: <a class="el" href="structPxExtendedVec3.html#6b892692e4990c404ba6170cd3da5d13">PxExtendedVec3</a>
<li>setPoint()
: <a class="el" href="classPxContactSet.html#21cfe31aa14065c8b3ee6390c312e178">PxContactSet</a>
<li>setPosition()
: <a class="el" href="classPxController.html#2687b4fabb77f2998ce31bffccc74a78">PxController</a>
, <a class="el" href="classPxMat44.html#54b4c7e35d3ac0e4639dedba56d39e71">PxMat44</a>
<li>setPositions()
: <a class="el" href="classPxParticleBase.html#4fba51bed2ec1b3445885916350b10d5">PxParticleBase</a>
<li>setPreciseSweeps()
: <a class="el" href="classPxControllerManager.html#aa88f335b64ec33775ec73fb532c920f">PxControllerManager</a>
<li>setPreventVerticalSlidingAgainstCeiling()
: <a class="el" href="classPxControllerManager.html#aa9553cd92772fcfc583aff5678f7ef0">PxControllerManager</a>
<li>setPrismaticJointFlag()
: <a class="el" href="classPxPrismaticJoint.html#6d20577d885f919eeee64e9daba76679">PxPrismaticJoint</a>
<li>setPrismaticJointFlags()
: <a class="el" href="classPxPrismaticJoint.html#0041ced8b6962072214dc81032ed2a2d">PxPrismaticJoint</a>
<li>setProjectionAngularTolerance()
: <a class="el" href="classPxFixedJoint.html#cb90411048d18e7e09aa3f1e4ece7609">PxFixedJoint</a>
, <a class="el" href="classPxD6Joint.html#ba8db764141f62a0a160a0752e7e65d7">PxD6Joint</a>
, <a class="el" href="classPxPrismaticJoint.html#f1a04172a838d1a1ee741d7471f4d62d">PxPrismaticJoint</a>
, <a class="el" href="classPxRevoluteJoint.html#3b088a58542f57366da55fa0fcf56f25">PxRevoluteJoint</a>
<li>setProjectionLinearTolerance()
: <a class="el" href="classPxD6Joint.html#acb253ce8a5aad477afd96f1202d4b61">PxD6Joint</a>
, <a class="el" href="classPxFixedJoint.html#45f16f6dc31f103ea8bef435b6bd0e5f">PxFixedJoint</a>
, <a class="el" href="classPxPrismaticJoint.html#01d904a1fd7a2394c44ee39efcbdd6f2">PxPrismaticJoint</a>
, <a class="el" href="classPxRevoluteJoint.html#3f96f9a0b8a5464a25452bb5aea51184">PxRevoluteJoint</a>
, <a class="el" href="classPxSphericalJoint.html#73173f0db2281377b91fe3b58b22001d">PxSphericalJoint</a>
<li>setProjectionPlane()
: <a class="el" href="classPxParticleBase.html#59216c6fd900d478cd1e75b0a34b37af">PxParticleBase</a>
<li>setQueryFilterData()
: <a class="el" href="classPxShape.html#c98191c26e55ecebfd9eb4553c969fab">PxShape</a>
<li>setRadius()
: <a class="el" href="classPxCapsuleController.html#a568af92bc897e9242c063d50c71cfd2">PxCapsuleController</a>
<li>setReportAllocationNames()
: <a class="el" href="classPxFoundation.html#10a9bd2dc04b64b17a6bb624872b565d">PxFoundation</a>
<li>setReportMode()
: <a class="el" href="classPxBinaryConverter.html#ba26eda3b46071eca65fa38cabee2a09">PxBinaryConverter</a>
<li>setRestitution()
: <a class="el" href="classPxContactSet.html#2c1f31f9201c804d6310ec0129cc0cea">PxContactSet</a>
, <a class="el" href="classPxMaterial.html#9038f690c180b962a7543734f44ec0f1">PxMaterial</a>
, <a class="el" href="classPxParticleBase.html#7dc8dc59b5032d7e4ebd9d901df20a3d">PxParticleBase</a>
<li>setRestitutionCombineMode()
: <a class="el" href="classPxMaterial.html#8f9930b0e18a932e428a061891e4683f">PxMaterial</a>
<li>setRestOffset()
: <a class="el" href="classPxShape.html#413afb25b39a7a0cf0981aa01c6d7f8b">PxShape</a>
, <a class="el" href="classPxCloth.html#b613c92ba9a4d334536c9d97d87a13df">PxCloth</a>
, <a class="el" href="classPxParticleBase.html#9c5759758c6fcaf61759dacea5d4653d">PxParticleBase</a>
<li>setRestOffsets()
: <a class="el" href="classPxParticleBase.html#4b193d290509a4442ed0110580a16447">PxParticleBase</a>
<li>setRestParticleDistance()
: <a class="el" href="classPxParticleFluid.html#6f649af954b4fda3c6a72e689637e07f">PxParticleFluid</a>
<li>setRestPositions()
: <a class="el" href="classPxCloth.html#0184c7d7f20110fdee01b1c485bb7a63">PxCloth</a>
<li>setRevoluteJointFlag()
: <a class="el" href="classPxRevoluteJoint.html#794f81a2e8668928669e2d89a15e2558">PxRevoluteJoint</a>
<li>setRevoluteJointFlags()
: <a class="el" href="classPxRevoluteJoint.html#10854c64ba8d56db2b7bddc26118393e">PxRevoluteJoint</a>
<li>setRigidBodyFlag()
: <a class="el" href="classPxRigidBody.html#9b23b890404b1010bf0b67a225bd22e7">PxRigidBody</a>
<li>setRigidBodyFlags()
: <a class="el" href="classPxRigidBody.html#9e6f3afd71605e037a5de47955d941e0">PxRigidBody</a>
<li>setRigidDynamicLockFlag()
: <a class="el" href="classPxRigidDynamic.html#7cf3e84117da3ec5b499262a3a9f5521">PxRigidDynamic</a>
<li>setRigidDynamicLockFlags()
: <a class="el" href="classPxRigidDynamic.html#16f9f0dfeae6e7877bcebca80df42c92">PxRigidDynamic</a>
<li>setRunProfiled()
: <a class="el" href="classPxDefaultCpuDispatcher.html#ccb465b8fcfd7f5e257e2e6f042703f1">PxDefaultCpuDispatcher</a>
<li>setScenePvdFlag()
: <a class="el" href="classPxPvdSceneClient.html#3b5e6327978fbe7a39fd53478da0c588">PxPvdSceneClient</a>
<li>setScenePvdFlags()
: <a class="el" href="classPxPvdSceneClient.html#74a77b0f48b6d0f9394ed7daa9c2c957">PxPvdSceneClient</a>
<li>setSceneQueryFilterData()
: <a class="el" href="classPxVehicleWheelsSimData.html#be8c9e522970df21292a0e8dfa5e2463">PxVehicleWheelsSimData</a>
<li>setSceneQueryUpdateMode()
: <a class="el" href="classPxScene.html#8b689efc2353e9c57abf0182cb3f7dfd">PxScene</a>
<li>setSelfCollisionDistance()
: <a class="el" href="classPxCloth.html#8a9395c7ef65990a78a8654eedd70eef">PxCloth</a>
<li>setSelfCollisionIndices()
: <a class="el" href="classPxCloth.html#3d1655d3a49678ac120e60e5f5d0cb74">PxCloth</a>
<li>setSelfCollisionStiffness()
: <a class="el" href="classPxCloth.html#444689a873e29404153b54e06c7f21f6">PxCloth</a>
<li>setSeparation()
: <a class="el" href="classPxContactSet.html#dd1b219393a21fdbb6e6db51400aa900">PxContactSet</a>
<li>setSeparationConstraints()
: <a class="el" href="classPxCloth.html#8cdc9a3c9faebf80d20e6e821c83834b">PxCloth</a>
<li>setSeparationTolerance()
: <a class="el" href="classPxArticulation.html#284072a943c7e9caa992c513e0855aaf">PxArticulation</a>
<li>setSimulationEventCallback()
: <a class="el" href="classPxScene.html#88f5438bf61cf5c3f767d8b515c51d31">PxScene</a>
<li>setSimulationFilterData()
: <a class="el" href="classPxShape.html#a0c62176ed01c9fb14c26ad7c393963c">PxShape</a>
, <a class="el" href="classPxCloth.html#b25c6eba3fdd622cf24bb768b9c9010a">PxCloth</a>
, <a class="el" href="classPxParticleBase.html#c9babb704b6400ee1a11b1d17439b362">PxParticleBase</a>
<li>setSleepLinearVelocity()
: <a class="el" href="classPxCloth.html#f333884779888e3cbb11033877fe0638">PxCloth</a>
<li>setSleepThreshold()
: <a class="el" href="classPxArticulation.html#e7e4735b8c23aaf5f41d829208cccce6">PxArticulation</a>
, <a class="el" href="classPxRigidDynamic.html#c087213f7360a202eaccfab26e97e644">PxRigidDynamic</a>
<li>setSlopeLimit()
: <a class="el" href="classPxController.html#5e3a554fe03319301360df65122f22c8">PxController</a>
<li>setSolverBatchSize()
: <a class="el" href="classPxScene.html#ad9cc8bf329f4de4b407436f5cd38c98">PxScene</a>
<li>setSolverFrequency()
: <a class="el" href="classPxCloth.html#f5d725608c3f0cd3a7c3b67743e14aac">PxCloth</a>
<li>setSolverIterationCounts()
: <a class="el" href="classPxArticulation.html#f31eb23f85c5a8516612cad455d4fef3">PxArticulation</a>
, <a class="el" href="classPxRigidDynamic.html#fa68d947962bc2d0f8862caaf3e8b304">PxRigidDynamic</a>
<li>setSphericalJointFlag()
: <a class="el" href="classPxSphericalJoint.html#0cff21b619ff48b2ca974df7f0e38ebb">PxSphericalJoint</a>
<li>setSphericalJointFlags()
: <a class="el" href="classPxSphericalJoint.html#3f3dd6934d09d6bc1605e53c15e45ab7">PxSphericalJoint</a>
<li>setStabilizationThreshold()
: <a class="el" href="classPxRigidDynamic.html#59fb22d9402497cffe1b5e54d9ecd62f">PxRigidDynamic</a>
, <a class="el" href="classPxArticulation.html#259748392f6223dc218d1e1ba8ee9944">PxArticulation</a>
<li>setStaticFriction()
: <a class="el" href="classPxContactSet.html#8c585855a8936d762520b1d1471bf3fe">PxContactSet</a>
, <a class="el" href="classPxMaterial.html#0384706084d22fe2ec745bc81d54ef14">PxMaterial</a>
, <a class="el" href="classPxParticleBase.html#3fb596178c017ed1c536c152e4fba358">PxParticleBase</a>
<li>setSteerAngle()
: <a class="el" href="classPxVehicleNoDrive.html#362899ae429c39a05703223bb8fdba0f">PxVehicleNoDrive</a>
<li>setStepOffset()
: <a class="el" href="classPxController.html#6cad9ee5c32ccbf80ec47465a07dcdc3">PxController</a>
<li>setStiffness()
: <a class="el" href="classPxArticulationJoint.html#e00f55560d4d4b78a20d97b20e39dafb">PxArticulationJoint</a>
, <a class="el" href="classPxDistanceJoint.html#2ac2f3e6b8afe91d7b39e34e34310e28">PxDistanceJoint</a>
, <a class="el" href="classPxParticleFluid.html#334f8a10e7d00c29f3989b906b429fc5">PxParticleFluid</a>
<li>setStiffnessFrequency()
: <a class="el" href="classPxCloth.html#3a353d83924d66f611186e0d8a046c63">PxCloth</a>
<li>setStretchConfig()
: <a class="el" href="classPxCloth.html#287124c7b4d26640849b8dd3489fff0d">PxCloth</a>
<li>setSubStepCount()
: <a class="el" href="classPxVehicleWheelsSimData.html#cbe6956ae50dfadcd9264ed9830da207">PxVehicleWheelsSimData</a>
<li>setSuspensionData()
: <a class="el" href="classPxVehicleWheelsSimData.html#2d919fecb713d371d2624e3b5b37053b">PxVehicleWheelsSimData</a>
<li>setSuspForceAppPointOffset()
: <a class="el" href="classPxVehicleWheelsSimData.html#cd51a38c9e5cf37b1c0b5feed7b03c04">PxVehicleWheelsSimData</a>
<li>setSuspTravelDirection()
: <a class="el" href="classPxVehicleWheelsSimData.html#13bf7c0a8e2765fa34146c7518950329">PxVehicleWheelsSimData</a>
<li>setSwingLimit()
: <a class="el" href="classPxD6Joint.html#72a1f48dffd418d278ec9beb110a9236">PxD6Joint</a>
, <a class="el" href="classPxArticulationJoint.html#12544e79ee2ef6ff061e6a3a9e1e65c8">PxArticulationJoint</a>
<li>setSwingLimitContactDistance()
: <a class="el" href="classPxArticulationJoint.html#909101d144f45f8fd8fbf1e2f01f9072">PxArticulationJoint</a>
<li>setSwingLimitEnabled()
: <a class="el" href="classPxArticulationJoint.html#c8f06505ec2b8bd187124008f428ce1e">PxArticulationJoint</a>
<li>setTangentialDamping()
: <a class="el" href="classPxArticulationJoint.html#9ba1951c929b003bf57dcea26756bf9f">PxArticulationJoint</a>
<li>setTangentialStiffness()
: <a class="el" href="classPxArticulationJoint.html#df1f03b5945c8db6103f6529736af5a8">PxArticulationJoint</a>
<li>setTargetGear()
: <a class="el" href="classPxVehicleDriveDynData.html#568663354ffa23f4b6f8d9a0194ea0e6">PxVehicleDriveDynData</a>
<li>setTargetOrientation()
: <a class="el" href="classPxArticulationJoint.html#c6f12118dc05485815cbe08df956b05c">PxArticulationJoint</a>
<li>setTargetPose()
: <a class="el" href="classPxCloth.html#ba7f7ca016a260f8bed962764814ade3">PxCloth</a>
<li>setTargetVelocity()
: <a class="el" href="classPxContactSet.html#2e374d99ff72fcf410a070ee3bf17abb">PxContactSet</a>
, <a class="el" href="classPxArticulationJoint.html#469427827733f35ba286f88b0e48984d">PxArticulationJoint</a>
<li>setTessellation()
: <a class="el" href="classPxControllerManager.html#801c7a25dc888d307bfee0e119e43724">PxControllerManager</a>
<li>setTessFlag()
: <a class="el" href="structPxHeightFieldSample.html#82ee14c99624ff3ace22e8408eea9935">PxHeightFieldSample</a>
<li>setTetherConfig()
: <a class="el" href="classPxCloth.html#b6f7f3f91fe4f2ed5e2620605c4723ff">PxCloth</a>
<li>setThresholdLongSpeed()
: <a class="el" href="classPxVehicleWheelsSimData.html#6b0a3e4cfee1def7c49905e193250e50">PxVehicleWheelsSimData</a>
<li>setTireData()
: <a class="el" href="classPxVehicleWheelsSimData.html#cfc01818dd853e393bf3d9ea4370441c">PxVehicleWheelsSimData</a>
<li>setTireForceAppPointOffset()
: <a class="el" href="classPxVehicleWheelsSimData.html#7914e9b4cbf6a5bbfce66d46f601b440">PxVehicleWheelsSimData</a>
<li>setTireForceShaderData()
: <a class="el" href="classPxVehicleWheelsDynData.html#25312456167dbd6611450a593444928e">PxVehicleWheelsDynData</a>
<li>setTireForceShaderFunction()
: <a class="el" href="classPxVehicleWheelsDynData.html#1d7405c9aeb529ca1a2bf945edd3d83f">PxVehicleWheelsDynData</a>
<li>setTireLoadFilterData()
: <a class="el" href="classPxVehicleWheelsSimData.html#f0b5eb7ae77c271ce3ba1604c8dad3b3">PxVehicleWheelsSimData</a>
<li>setToDefault()
: <a class="el" href="structPxBVH33MidphaseDesc.html#032c13ce0350dea8512f56b66f5a2744">PxBVH33MidphaseDesc</a>
, <a class="el" href="classPxMidphaseDesc.html#c941c94835e494ae0dcc3f774ac16240">PxMidphaseDesc</a>
, <a class="el" href="group__physics.html#ge673c050f15b0fc912860adbb3394e34">PxSceneLimits</a>
, <a class="el" href="group__character.html#gf2f271a2e1d38f619d345bd89f737412">PxBoxControllerDesc</a>
, <a class="el" href="structPxBVH34MidphaseDesc.html#c0848cd6f8b3b771e5e5761df2f6b033">PxBVH34MidphaseDesc</a>
, <a class="el" href="group__cooking.html#g6e86954b2426aae207489af9928d45e3">PxConvexMeshDesc</a>
, <a class="el" href="group__cooking.html#g3efcaf703b329270eed5b0890b0c5304">PxClothMeshDesc</a>
, <a class="el" href="group__geomutils.html#gd6110ba2e5505fb809d3c3ebeb82e2f5">PxSimpleTriangleMesh</a>
, <a class="el" href="group__particles.html#g565e686111afbbdaf07c2bd8b149efb6">PxParticleCreationData</a>
, <a class="el" href="group__geomutils.html#gdd7ec6c255262ddceeb7e04600bc47b5">PxHeightFieldDesc</a>
, <a class="el" href="group__cooking.html#gfd882da42844238f9a91e5754694391e">PxTriangleMeshDesc</a>
, <a class="el" href="group__cloth.html#g2a75f18d35312c00faeacf1e144af741">PxClothFabricDesc</a>
, <a class="el" href="structPxFilterData.html#d6d40431c37145235eaceea47f57b9b5">PxFilterData</a>
, <a class="el" href="group__character.html#g48c1aa8996f7a4686f65cf517fb466e5">PxCapsuleControllerDesc</a>
, <a class="el" href="group__physics.html#ga7375184ba494172fa7677dae44bd9a8">PxSceneDesc</a>
<li>setTolerance()
: <a class="el" href="classPxDistanceJoint.html#a4897db1805eea28a241867aaeb01d70">PxDistanceJoint</a>
<li>setToRestState()
: <a class="el" href="classPxVehicleDrive4W.html#37811fb8cf89260d45276a97b767acce">PxVehicleDrive4W</a>
, <a class="el" href="classPxVehicleDriveNW.html#a66886e48cb1b6e635e804ee8267e5b3">PxVehicleDriveNW</a>
, <a class="el" href="classPxVehicleWheels.html#38cf9474ad2c23ba3c21766fac251339">PxVehicleWheels</a>
, <a class="el" href="classPxVehicleDrive.html#a5fdf730d2b90e2fdbd2dd34d2a01765">PxVehicleDrive</a>
, <a class="el" href="classPxVehicleDriveTank.html#dbbad11dfa6fb32b6d209ddabf8f9132">PxVehicleDriveTank</a>
, <a class="el" href="classPxVehicleWheelsDynData.html#b760ac444b65311796ccf5a3bb3fafff">PxVehicleWheelsDynData</a>
, <a class="el" href="classPxVehicleDriveDynData.html#395909ff575722b78041d67a42fb62f3">PxVehicleDriveDynData</a>
, <a class="el" href="classPxVehicleNoDrive.html#284e8e6ff3c1617b8c39bab3edc217c7">PxVehicleNoDrive</a>
<li>setTwistLimit()
: <a class="el" href="classPxArticulationJoint.html#e3fc7d9b7c327b897a0a33c1844f03c4">PxArticulationJoint</a>
, <a class="el" href="classPxD6Joint.html#6461182921ceab095997f58891fb4adc">PxD6Joint</a>
<li>setTwistLimitContactDistance()
: <a class="el" href="classPxArticulationJoint.html#f9c9a92beaf042f7ad7bb3bf95c34b96">PxArticulationJoint</a>
<li>setTwistLimitEnabled()
: <a class="el" href="classPxArticulationJoint.html#b0d113b6b62dc07cd06c4d6341ce0608">PxArticulationJoint</a>
<li>setTypePairFriction()
: <a class="el" href="classPxVehicleDrivableSurfaceToTireFrictionPairs.html#23b36296b4be7a569f4e97e6849c1ad8">PxVehicleDrivableSurfaceToTireFrictionPairs</a>
<li>setup()
: <a class="el" href="classPxVehicleDriveTank.html#1cd437995b8664b4d6005a0f636ab318">PxVehicleDriveTank</a>
, <a class="el" href="classPxVehicleDrive4W.html#d6740fedd4d8d026f8750e7bd601b76a">PxVehicleDrive4W</a>
, <a class="el" href="classPxVehicleNoDrive.html#837924c936c8b6608b691e48e80fcab4">PxVehicleNoDrive</a>
, <a class="el" href="classPxVehicleDrivableSurfaceToTireFrictionPairs.html#7104485ac201ef952d8b164982ac222f">PxVehicleDrivableSurfaceToTireFrictionPairs</a>
, <a class="el" href="classPxVehicleWheels.html#ed5b450123f32286b847b52dbb961a5c">PxVehicleWheels</a>
, <a class="el" href="classPxVehicleDrive.html#02bbb8b1aad17272d533b7b3a41f016f">PxVehicleDrive</a>
, <a class="el" href="classPxVehicleDriveNW.html#72f85747311561f991aa94a525f38b22">PxVehicleDriveNW</a>
<li>setUpDirection()
: <a class="el" href="classPxController.html#3393ba5043c3534712d8f362a9872cfc">PxController</a>
<li>setUpRatios()
: <a class="el" href="classPxVehicleAutoBoxData.html#8fadedab89e26a913b7c24b312ccf106">PxVehicleAutoBoxData</a>
<li>setUseAutoGears()
: <a class="el" href="classPxVehicleDriveDynData.html#3a7a66f713691e6c1ce0f97e1dd2d80a">PxVehicleDriveDynData</a>
<li>setUserData()
: <a class="el" href="classPxVehicleWheelsDynData.html#506628156f9502e0dc6ccc11e3fa75d7">PxVehicleWheelsDynData</a>
, <a class="el" href="classPxController.html#2b6c1841bafa53877baa3dca8543c9ca">PxController</a>
<li>setUserMemory()
: <a class="el" href="classPxBatchQuery.html#ca7ccdab697074ae572c7d0baf9af3c2">PxBatchQuery</a>
<li>setVelocities()
: <a class="el" href="classPxParticleBase.html#f73716656e6d6efef3a5650f9e04ffe3">PxParticleBase</a>
<li>setVirtualParticles()
: <a class="el" href="classPxCloth.html#16ef3c8f9e199f38f84ca0b1529209e5">PxCloth</a>
<li>setViscosity()
: <a class="el" href="classPxParticleFluid.html#51e95f09eeb9730130fb2c139bd2be4c">PxParticleFluid</a>
<li>setVisualizationCullingBox()
: <a class="el" href="classPxScene.html#b562ba2df953188a7e2b99f7ddcda5dc">PxScene</a>
<li>setVisualizationParameter()
: <a class="el" href="classPxScene.html#4055d302466a1f5cd9d481028b66b20a">PxScene</a>
<li>setWakeCounter()
: <a class="el" href="classPxRigidDynamic.html#0f7de8c56c76461555219b2b98d5147a">PxRigidDynamic</a>
, <a class="el" href="classPxCloth.html#cfd45f2a5c3c1dde4bc84e8a6acab096">PxCloth</a>
, <a class="el" href="classPxArticulation.html#aef04ee0fba882eb8212f6baa5dde0b2">PxArticulation</a>
<li>setWheelCentreOffset()
: <a class="el" href="classPxVehicleWheelsSimData.html#7f5a27dafbbf58ad01c0172e03349d24">PxVehicleWheelsSimData</a>
<li>setWheelData()
: <a class="el" href="classPxVehicleWheelsSimData.html#26ac23021422b9ed70773bb1976f076c">PxVehicleWheelsSimData</a>
<li>setWheelEnabledState()
: <a class="el" href="classPxVehicleWheelsSimData.html#de28e7cf0fbb267d3ca0b6abd151e601">PxVehicleWheelsSimData</a>
<li>setWheelRotationAngle()
: <a class="el" href="classPxVehicleWheelsDynData.html#129ab9f993d414c469f002314307dd7e">PxVehicleWheelsDynData</a>
<li>setWheelRotationSpeed()
: <a class="el" href="classPxVehicleWheelsDynData.html#ef9282166f0b158d978b7ae8e8c28153">PxVehicleWheelsDynData</a>
<li>setWheelShapeMapping()
: <a class="el" href="classPxVehicleWheelsSimData.html#07988e7e4bfd905ae1dd182ef3a1cab1">PxVehicleWheelsSimData</a>
<li>setWindDrag()
: <a class="el" href="classPxCloth.html#41d1bc3cbe1f01737a49bd4d489afb54">PxCloth</a>
<li>setWindLift()
: <a class="el" href="classPxCloth.html#2c43cb034276d6be1ac72b3219ebd21c">PxCloth</a>
<li>setWindVelocity()
: <a class="el" href="classPxCloth.html#88764e4c775cf251cd8011d9b1a6fd8e">PxCloth</a>
<li>setZero()
: <a class="el" href="classPxVec4.html#9277eee047f78d606c60d57c8726b1f1">PxVec4</a>
<li>shiftOrigin()
: <a class="el" href="classPxScene.html#3cb2b6b3b72cefb94fa9e64ca09660f6">PxScene</a>
, <a class="el" href="classPxControllerManager.html#6cbb06688c15bed0838ee051127905f8">PxControllerManager</a>
<li>simulate()
: <a class="el" href="classPxScene.html#9a9cacecc3b0f6adaf2f3d2168c2aff5">PxScene</a>
<li>size()
: <a class="el" href="classPxContactSet.html#63434463f6bea994645e3dcbdc2cf2d0">PxContactSet</a>
<li>sphere()
: <a class="el" href="classPxGeometryHolder.html#725211588eba5f168eb9266a25e0b59b">PxGeometryHolder</a>
<li>startAfter()
: <a class="el" href="classphysx_1_1PxTask.html#5ea294d819b903a507efe1358f86b8cd">physx::PxTask</a>
<li>startGearChange()
: <a class="el" href="classPxVehicleDriveDynData.html#2ba2789e69500d31d1acf2f6e11545cf">PxVehicleDriveDynData</a>
<li>startGroup()
: <a class="el" href="classphysx_1_1PxGpuDispatcher.html#86f6db8b18cf8380967890d694e3df8e">physx::PxGpuDispatcher</a>
<li>startSimulation()
: <a class="el" href="classphysx_1_1PxGpuDispatcher.html#091cb121a38ddf39fcab51f5118a15d2">physx::PxGpuDispatcher</a>
, <a class="el" href="classphysx_1_1PxTaskManager.html#ab9b613b731eb4cc5007db33fc801017">physx::PxTaskManager</a>
<li>statusChange()
: <a class="el" href="classPxSimulationFilterCallback.html#0ba6a20106fd9ef3eca10099be8017da">PxSimulationFilterCallback</a>
<li>stopSimulation()
: <a class="el" href="classphysx_1_1PxTaskManager.html#6008ca7efcd7fa4a77d10f0606e3f17a">physx::PxTaskManager</a>
, <a class="el" href="classphysx_1_1PxGpuDispatcher.html#b46896dea09105e1f5fc1d19a98f2b1b">physx::PxGpuDispatcher</a>
<li>storeAny()
: <a class="el" href="classPxGeometryHolder.html#7f4cab3419580e1d985858d1f5ffb653">PxGeometryHolder</a>
<li>storeByte()
: <a class="el" href="classPxFileBuf.html#a050d73be42f3e7179374c5e91841392">PxFileBuf</a>
<li>storeDouble()
: <a class="el" href="classPxFileBuf.html#24b58be8fbcfdb159411494cc6ff89c9">PxFileBuf</a>
<li>storeDword()
: <a class="el" href="classPxFileBuf.html#c4522927d2ddb0af751443de8292cf84">PxFileBuf</a>
<li>storeFloat()
: <a class="el" href="classPxFileBuf.html#598346fa996f55e3e195cb5b5df86faa">PxFileBuf</a>
<li>storeWord()
: <a class="el" href="classPxFileBuf.html#b37c7194f8a6728802b75f487b878499">PxFileBuf</a>
<li>stride()
: <a class="el" href="classPxStrideIterator.html#27661ae2f477495396544cdc0cd2cf9b">PxStrideIterator< T ></a>
<li>submitNamedTask()
: <a class="el" href="classphysx_1_1PxTaskManager.html#f1a81608f80d92d19520aa9dba2dca23">physx::PxTaskManager</a>
<li>submitTask()
: <a class="el" href="classphysx_1_1PxGpuDispatcher.html#5ffc5d0c124afbcad0b6fcf1080af5ee">physx::PxGpuDispatcher</a>
, <a class="el" href="classphysx_1_1PxCpuDispatcher.html#0030e67bed850b70d6725775e5c3ce3c">physx::PxCpuDispatcher</a>
<li>submitted()
: <a class="el" href="classphysx_1_1PxTask.html#2a0a6f83fcd05069f594631272faa8ae">physx::PxTask</a>
<li>submitUnnamedTask()
: <a class="el" href="classphysx_1_1PxTaskManager.html#2f942d2ad1ea34dd74e7127cd72e20ae">physx::PxTaskManager</a>
<li>sum()
: <a class="el" href="classPxMassProperties.html#63e7875cb60efa35150002e56fcfa43f">PxMassProperties</a>
<li>swap2Bytes()
: <a class="el" href="classPxFileBuf.html#8f7aef54d065c1251bc729c32e898a9a">PxFileBuf</a>
<li>swap4Bytes()
: <a class="el" href="classPxFileBuf.html#d3bec920f93f851d420875d3572db866">PxFileBuf</a>
<li>swap8Bytes()
: <a class="el" href="classPxFileBuf.html#c26c76c0c790270716291cab5e29599f">PxFileBuf</a>
<li>sweep()
: <a class="el" href="classPxMeshQuery.html#e35a79d58b3c90dbaefe7d204bbfc9b5">PxMeshQuery</a>
, <a class="el" href="classPxShapeExt.html#9fb19195f3ac80b6ab55fd0aa7a41cf3">PxShapeExt</a>
, <a class="el" href="classPxBatchQuery.html#bf15206e4dcf2238db75f47565078b49">PxBatchQuery</a>
, <a class="el" href="classPxGeometryQuery.html#574970e722f882778a250c51f77b5b85">PxGeometryQuery</a>
, <a class="el" href="classPxScene.html#9b07b2a98e64105a06e97ffaeba2a63d">PxScene</a>
, <a class="el" href="classPxSpatialIndex.html#fa49a33803f4f392d2908287c41bfeab">PxSpatialIndex</a>
, <a class="el" href="classPxVolumeCache.html#86eb361338891b14b27f9d4594b15df8">PxVolumeCache</a>
<li>sweepAny()
: <a class="el" href="classPxSceneQueryExt.html#e1f498d024c8072f1d5036ca34412f84">PxSceneQueryExt</a>
<li>sweepMultiple()
: <a class="el" href="classPxSceneQueryExt.html#2e55cf2e513a120d96e594e516d3e62c">PxSceneQueryExt</a>
<li>sweepSingle()
: <a class="el" href="classPxSceneQueryExt.html#eda6bdd24336f093a8bd7bc76aa82ad8">PxSceneQueryExt</a>
</ul>
</div>
<hr style="width: 100%; height: 2px;"><br>
</body>
</html>
``` |
Tycho Lawson Collins (born October 20, 2001) is a Chinese-American footballer who plays as a forward for USL Championship side Memphis 901.
Career
Youth
Born in Shanghai, China, Collins also spent part of his childhood in Memphis, Tennessee with Lobo Rush between 2013 and 2015, winning two state titles.
In 2015, Collins moved overseas where he trialed and played in exhibition matches for clubs across three different countries. Starting with Shanghai SIPG, Collins would also spend various periods training with Chelsea in England, VVV-Venlo in the Netherlands and Shanghai Shenhua, also in China.
After a return trial with Shanghai SIPG during the summer of 2019, Collins returned to the United States where he finished high school in Boca Raton, Florida. He also spent time with club side Team Boca. After graduating in 2020, Collins trained for six months with Houston Dynamo.
On May 14, 2021, Collins signed with USL Championship side Memphis 901 on an academy contract, allowing him to remain eligible to play college soccer. He made his debut the following day, appearing as an injury-time substitute during a 2–1 win over Indy Eleven.
References
External links
Profile at Memphis 901
2001 births
Living people
American men's soccer players
American sportspeople of Chinese descent
Chinese men's footballers
Men's association football defenders
Memphis 901 FC players
Soccer players from Florida
Soccer players from Tennessee
Sportspeople from Boca Raton, Florida
Soccer players from Memphis, Tennessee
USL Championship players |
The Man of the Future (Spanish: El hombre del futuro) is a 2019 Chilean-Argentine drama road movie written and directed by Felipe Ríos Fuentes in his directorial debut. Starring José Soza and Antonia Giesen. Its world premiere was at the 54th Karlovy Vary International Film Festival where it competed for the Crystal Globe.
Synopsis
After a forced retirement, the old and lonely trucker Michelsen undertakes one last trip aboard his truck to Villa O'Higgins, the so-called end of the world by the southern truckers. Along the way, he will detach himself from everything that made up his life, turning his last route into a journey of illumination, in which facing the end of the road and the wild nature will allow him to live the present as he always wanted: with his daughter Elena.
Cast
The actors participating in this film are:
José Soza as Michelsen
Antonia Giesen as Elena
Sergio Hernández as Boss
Rubén Redlich as Gaucho Sheep
Roberto Farías as Four Fingers
Amparo Noguera as Nicole
Giannina Fruttero as Paula
Jorge Arecheta as Tecla
Erto Pantoja as Nicole's Husband
Solange Lackington as Olivia
María Alché as Maxi
Nicolás Rojas as Elena's Friend
Luis Uribe as Trainer
Release
It had its world premiere on July 3, 2019, at the 54th Karlovy Vary International Film Festival, then it was screened on August 21 of the same year at the Santiago International Film Festival. It was commercially released on August 29, 2019, in Chilean theaters.
Accolades
References
External links
Official Page
2019 films
2019 drama films
Chilean drama road movies
Argentine drama road movies
2010s drama road movies
2010s Spanish-language films
Films set in Chile
Films shot in Chile
Films about father–daughter relationships
Films about trucks
Films about old age
2019 directorial debut films
2010s Chilean films
2010s Argentine films |
```forth
*> \brief \b ZTPMV
*
* =========== DOCUMENTATION ===========
*
* Online html documentation available at
* path_to_url
*
* Definition:
* ===========
*
* SUBROUTINE ZTPMV(UPLO,TRANS,DIAG,N,AP,X,INCX)
*
* .. Scalar Arguments ..
* INTEGER INCX,N
* CHARACTER DIAG,TRANS,UPLO
* ..
* .. Array Arguments ..
* COMPLEX*16 AP(*),X(*)
* ..
*
*
*> \par Purpose:
* =============
*>
*> \verbatim
*>
*> ZTPMV performs one of the matrix-vector operations
*>
*> x := A*x, or x := A**T*x, or x := A**H*x,
*>
*> where x is an n element vector and A is an n by n unit, or non-unit,
*> upper or lower triangular matrix, supplied in packed form.
*> \endverbatim
*
* Arguments:
* ==========
*
*> \param[in] UPLO
*> \verbatim
*> UPLO is CHARACTER*1
*> On entry, UPLO specifies whether the matrix is an upper or
*> lower triangular matrix as follows:
*>
*> UPLO = 'U' or 'u' A is an upper triangular matrix.
*>
*> UPLO = 'L' or 'l' A is a lower triangular matrix.
*> \endverbatim
*>
*> \param[in] TRANS
*> \verbatim
*> TRANS is CHARACTER*1
*> On entry, TRANS specifies the operation to be performed as
*> follows:
*>
*> TRANS = 'N' or 'n' x := A*x.
*>
*> TRANS = 'T' or 't' x := A**T*x.
*>
*> TRANS = 'C' or 'c' x := A**H*x.
*> \endverbatim
*>
*> \param[in] DIAG
*> \verbatim
*> DIAG is CHARACTER*1
*> On entry, DIAG specifies whether or not A is unit
*> triangular as follows:
*>
*> DIAG = 'U' or 'u' A is assumed to be unit triangular.
*>
*> DIAG = 'N' or 'n' A is not assumed to be unit
*> triangular.
*> \endverbatim
*>
*> \param[in] N
*> \verbatim
*> N is INTEGER
*> On entry, N specifies the order of the matrix A.
*> N must be at least zero.
*> \endverbatim
*>
*> \param[in] AP
*> \verbatim
*> AP is COMPLEX*16 array, dimension at least
*> ( ( n*( n + 1 ) )/2 ).
*> Before entry with UPLO = 'U' or 'u', the array AP must
*> contain the upper triangular matrix packed sequentially,
*> column by column, so that AP( 1 ) contains a( 1, 1 ),
*> AP( 2 ) and AP( 3 ) contain a( 1, 2 ) and a( 2, 2 )
*> respectively, and so on.
*> Before entry with UPLO = 'L' or 'l', the array AP must
*> contain the lower triangular matrix packed sequentially,
*> column by column, so that AP( 1 ) contains a( 1, 1 ),
*> AP( 2 ) and AP( 3 ) contain a( 2, 1 ) and a( 3, 1 )
*> respectively, and so on.
*> Note that when DIAG = 'U' or 'u', the diagonal elements of
*> A are not referenced, but are assumed to be unity.
*> \endverbatim
*>
*> \param[in,out] X
*> \verbatim
*> X is COMPLEX*16 array, dimension at least
*> ( 1 + ( n - 1 )*abs( INCX ) ).
*> Before entry, the incremented array X must contain the n
*> element vector x. On exit, X is overwritten with the
*> transformed vector x.
*> \endverbatim
*>
*> \param[in] INCX
*> \verbatim
*> INCX is INTEGER
*> On entry, INCX specifies the increment for the elements of
*> X. INCX must not be zero.
*> \endverbatim
*
* Authors:
* ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley
*> \author Univ. of Colorado Denver
*> \author NAG Ltd.
*
*> \ingroup tpmv
*
*> \par Further Details:
* =====================
*>
*> \verbatim
*>
*> Level 2 Blas routine.
*> The vector and matrix arguments are not referenced when N = 0, or M = 0
*>
*> -- Written on 22-October-1986.
*> Jack Dongarra, Argonne National Lab.
*> Jeremy Du Croz, Nag Central Office.
*> Sven Hammarling, Nag Central Office.
*> Richard Hanson, Sandia National Labs.
*> \endverbatim
*>
* =====================================================================
SUBROUTINE ZTPMV(UPLO,TRANS,DIAG,N,AP,X,INCX)
*
* -- Reference BLAS level2 routine --
* -- Reference BLAS is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*
* .. Scalar Arguments ..
INTEGER INCX,N
CHARACTER DIAG,TRANS,UPLO
* ..
* .. Array Arguments ..
COMPLEX*16 AP(*),X(*)
* ..
*
* =====================================================================
*
* .. Parameters ..
COMPLEX*16 ZERO
PARAMETER (ZERO= (0.0D+0,0.0D+0))
* ..
* .. Local Scalars ..
COMPLEX*16 TEMP
INTEGER I,INFO,IX,J,JX,K,KK,KX
LOGICAL NOCONJ,NOUNIT
* ..
* .. External Functions ..
LOGICAL LSAME
EXTERNAL LSAME
* ..
* .. External Subroutines ..
EXTERNAL XERBLA
* ..
* .. Intrinsic Functions ..
INTRINSIC DCONJG
* ..
*
* Test the input parameters.
*
INFO = 0
IF (.NOT.LSAME(UPLO,'U') .AND. .NOT.LSAME(UPLO,'L')) THEN
INFO = 1
ELSE IF (.NOT.LSAME(TRANS,'N') .AND.
+ .NOT.LSAME(TRANS,'T') .AND.
+ .NOT.LSAME(TRANS,'C')) THEN
INFO = 2
ELSE IF (.NOT.LSAME(DIAG,'U') .AND.
+ .NOT.LSAME(DIAG,'N')) THEN
INFO = 3
ELSE IF (N.LT.0) THEN
INFO = 4
ELSE IF (INCX.EQ.0) THEN
INFO = 7
END IF
IF (INFO.NE.0) THEN
CALL XERBLA('ZTPMV ',INFO)
RETURN
END IF
*
* Quick return if possible.
*
IF (N.EQ.0) RETURN
*
NOCONJ = LSAME(TRANS,'T')
NOUNIT = LSAME(DIAG,'N')
*
* Set up the start point in X if the increment is not unity. This
* will be ( N - 1 )*INCX too small for descending loops.
*
IF (INCX.LE.0) THEN
KX = 1 - (N-1)*INCX
ELSE IF (INCX.NE.1) THEN
KX = 1
END IF
*
* Start the operations. In this version the elements of AP are
* accessed sequentially with one pass through AP.
*
IF (LSAME(TRANS,'N')) THEN
*
* Form x:= A*x.
*
IF (LSAME(UPLO,'U')) THEN
KK = 1
IF (INCX.EQ.1) THEN
DO 20 J = 1,N
IF (X(J).NE.ZERO) THEN
TEMP = X(J)
K = KK
DO 10 I = 1,J - 1
X(I) = X(I) + TEMP*AP(K)
K = K + 1
10 CONTINUE
IF (NOUNIT) X(J) = X(J)*AP(KK+J-1)
END IF
KK = KK + J
20 CONTINUE
ELSE
JX = KX
DO 40 J = 1,N
IF (X(JX).NE.ZERO) THEN
TEMP = X(JX)
IX = KX
DO 30 K = KK,KK + J - 2
X(IX) = X(IX) + TEMP*AP(K)
IX = IX + INCX
30 CONTINUE
IF (NOUNIT) X(JX) = X(JX)*AP(KK+J-1)
END IF
JX = JX + INCX
KK = KK + J
40 CONTINUE
END IF
ELSE
KK = (N* (N+1))/2
IF (INCX.EQ.1) THEN
DO 60 J = N,1,-1
IF (X(J).NE.ZERO) THEN
TEMP = X(J)
K = KK
DO 50 I = N,J + 1,-1
X(I) = X(I) + TEMP*AP(K)
K = K - 1
50 CONTINUE
IF (NOUNIT) X(J) = X(J)*AP(KK-N+J)
END IF
KK = KK - (N-J+1)
60 CONTINUE
ELSE
KX = KX + (N-1)*INCX
JX = KX
DO 80 J = N,1,-1
IF (X(JX).NE.ZERO) THEN
TEMP = X(JX)
IX = KX
DO 70 K = KK,KK - (N- (J+1)),-1
X(IX) = X(IX) + TEMP*AP(K)
IX = IX - INCX
70 CONTINUE
IF (NOUNIT) X(JX) = X(JX)*AP(KK-N+J)
END IF
JX = JX - INCX
KK = KK - (N-J+1)
80 CONTINUE
END IF
END IF
ELSE
*
* Form x := A**T*x or x := A**H*x.
*
IF (LSAME(UPLO,'U')) THEN
KK = (N* (N+1))/2
IF (INCX.EQ.1) THEN
DO 110 J = N,1,-1
TEMP = X(J)
K = KK - 1
IF (NOCONJ) THEN
IF (NOUNIT) TEMP = TEMP*AP(KK)
DO 90 I = J - 1,1,-1
TEMP = TEMP + AP(K)*X(I)
K = K - 1
90 CONTINUE
ELSE
IF (NOUNIT) TEMP = TEMP*DCONJG(AP(KK))
DO 100 I = J - 1,1,-1
TEMP = TEMP + DCONJG(AP(K))*X(I)
K = K - 1
100 CONTINUE
END IF
X(J) = TEMP
KK = KK - J
110 CONTINUE
ELSE
JX = KX + (N-1)*INCX
DO 140 J = N,1,-1
TEMP = X(JX)
IX = JX
IF (NOCONJ) THEN
IF (NOUNIT) TEMP = TEMP*AP(KK)
DO 120 K = KK - 1,KK - J + 1,-1
IX = IX - INCX
TEMP = TEMP + AP(K)*X(IX)
120 CONTINUE
ELSE
IF (NOUNIT) TEMP = TEMP*DCONJG(AP(KK))
DO 130 K = KK - 1,KK - J + 1,-1
IX = IX - INCX
TEMP = TEMP + DCONJG(AP(K))*X(IX)
130 CONTINUE
END IF
X(JX) = TEMP
JX = JX - INCX
KK = KK - J
140 CONTINUE
END IF
ELSE
KK = 1
IF (INCX.EQ.1) THEN
DO 170 J = 1,N
TEMP = X(J)
K = KK + 1
IF (NOCONJ) THEN
IF (NOUNIT) TEMP = TEMP*AP(KK)
DO 150 I = J + 1,N
TEMP = TEMP + AP(K)*X(I)
K = K + 1
150 CONTINUE
ELSE
IF (NOUNIT) TEMP = TEMP*DCONJG(AP(KK))
DO 160 I = J + 1,N
TEMP = TEMP + DCONJG(AP(K))*X(I)
K = K + 1
160 CONTINUE
END IF
X(J) = TEMP
KK = KK + (N-J+1)
170 CONTINUE
ELSE
JX = KX
DO 200 J = 1,N
TEMP = X(JX)
IX = JX
IF (NOCONJ) THEN
IF (NOUNIT) TEMP = TEMP*AP(KK)
DO 180 K = KK + 1,KK + N - J
IX = IX + INCX
TEMP = TEMP + AP(K)*X(IX)
180 CONTINUE
ELSE
IF (NOUNIT) TEMP = TEMP*DCONJG(AP(KK))
DO 190 K = KK + 1,KK + N - J
IX = IX + INCX
TEMP = TEMP + DCONJG(AP(K))*X(IX)
190 CONTINUE
END IF
X(JX) = TEMP
JX = JX + INCX
KK = KK + (N-J+1)
200 CONTINUE
END IF
END IF
END IF
*
RETURN
*
* End of ZTPMV
*
END
``` |
Symphogear or Senki Zesshō Symphogear is a 2012 anime television series produced by Satelight with production assistance from Encourage Films during the first season. In the near future, musical warriors wielding armor known as Symphogear fight against an alien race known as the Noise. Hibiki Tachibana, a girl who was rescued from the Noise two years ago by a Symphogear user named Kanade, who died in the ensuing battle, ends up inheriting her power to fight against the Noise.
The first season aired in Japan on Tokyo MX between January 6, 2012 and March 30, 2012 and was licensed in North America and simulcast on Niconico by Funimation Entertainment. The opening theme is "Synchrogazer" by Nana Mizuki whilst the ending theme for the first 12 episodes is "Meteor Light" by Ayahi Takagaki, and for episode 13, "Gyakkou no Flügel" by Nana Mizuki & Minami Takayama. A second season, Senki Zesshō Symphogear G, aired in Japan between July 4, 2013 and September 26, 2013. The opening theme is "Vitalization" by Mizuki whilst the ending theme is "Next Destination" by Takagaki. Bonus OVA episodes were included with the fifth and sixth BD/DVD volumes. A third season, Senki Zesshō Symphogear GX, aired between July 4, 2015 and September 25, 2015 and was simulcast by Crunchyroll. The opening theme is "Exterminate" by Mizuki while the ending theme is "Rebirth-day" by Takagaki.
A fourth and fifth season were announced at Symphogear Live 2016. The fourth season, Senki Zesshō Symphogear AXZ, aired between July 1, 2017 and September 30, 2017. The opening theme is "TESTAMENT" by Mizuki while the ending theme is "Futurism" by Takagaki. The fifth and final season, Senki Zesshō Symphogear XV, aired between July 6, 2019 and September 28, 2019. The opening theme (episodes 2-11; ending for episode 12) is "METANOIA" by Mizuki, while the ending theme (episodes 2-11; opening for episode 12) is "Lasting Song" by Takagaki. The season was initially scheduled to start airing in April. The OVAs, Senki Zesshou Shinai Symphogear, started to be included with G's BDs. The G OVAs are included in the two last BD volumes of the series, while from GX onwards the OVAs are included in the last 4 BD volumes. The first two OVAs haven't an ending theme, while in the GX and AXZ's ones the ending theme is "Itsuka no Niji, Hana no Omoide" by Aoi Yuuki and Yuka Iguchi, except the last AXZ's OVA, which ending theme is "Todoke Happy Uta Zukin!" by Takagaki. From second season G to AXZ, the ending theme for every season finale is "Nijiiro no Flügel", performed by Aoi Yuuki, Nana Mizuki, Ayahi Takagaki, Yoko Hikasa, Yoshino Nanjo, Ai Kayano & Minami Takayama; and for the series finale, the ending theme is "Ashita e no Flügel", performed by Aoi Yuuki, Nana Mizuki, Ayahi Takagaki, Yoko Hikasa, Yoshino Nanjo, Ai Kayano & Yuka Iguchi.
Series overview
Episode list
Symphogear (2012)
Symphogear G (2013)
Bonus episodes
Symphogear GX (2015)
Bonus episodes
Symphogear AXZ (2017)
Bonus episodes
Symphogear XV (2019)
Bonus episodes
Notes
References
Senki Zesshō Symphogear |
David Hollwitz (born 20 March 1989 in Luckenwalde) is a German footballer who plays as a midfielder for SV Lichtenberg 47.
References
External links
1989 births
Living people
Sportspeople from Luckenwalde
People from Bezirk Potsdam
German men's footballers
Footballers from Brandenburg
Men's association football midfielders
3. Liga players
Regionalliga players
1. FC Union Berlin players
SV Babelsberg 03 players
FC Viktoria 1889 Berlin players |
Gutterson Fieldhouse (nicknamed "The Gut") is a 4,035-seat hockey arena in Burlington, Vermont. It is home to the Vermont Catamounts men's and women's ice hockey teams. It is the largest indoor arena in the state of Vermont. It is adjacent to Patrick Gymnasium and Forbush Natatorium at the school's athletic complex. It is named for Albert Gutterson, class of 1912, the school's first Olympian. He set an Olympic record with a 7.60 meter long jump, beating, among others, the great Jim Thorpe.
History
The barrel-vaulted arena opened in 1963, originally seating 3,335, with a rink 190 x 85 feet, and the Catamounts varsity hockey program was established the same year. In 1990, the arena was extended eastward to expand the rink to 200 x 90 feet, add an additional row of 700 seats, and add a new lobby, concession, and restroom area. New locker rooms were also added to the north, enough to accommodate six teams at once, along with offices and a varsity weight room.
The hockey team has played host to exhibitions with the Soviet Union national ice hockey team, Russia women's national ice hockey team, and United States men's national ice hockey team and United States women's national ice hockey team. It was the venue for the first women's hockey game ever nationally televised in the US (on December 17, 1997, a pre-Olympic game between Canada and the United States). Between 1995 and 2000, and again in 2002, it was the preseason training camp site of the New York Rangers. (The Hartford Whalers had previously held their 1992 and 1993 training camps there.)
On March 30, 2012, President Barack Obama made his first public appearance in the State of Vermont at the Gutterson Fieldhouse. However, he did speak previously to students on campus at UVM campaigning for Senator Bernie Sanders (I-VT) in 2006, outside of Ira Allen Chapel.
The Vermont Principal's Association (VPA) has held the boys' and girls' high school state ice hockey championships at the venue since 1976 (boys) and 2011 (girls).
Gutterson Fieldhouse, along with Cairns Arena in nearby South Burlington, served as venues for the 2012 IIHF Women's World Championship.
In July 2016, the Vermont Bucks, an indoor football team, was announced as a 2017 expansion team as part of American Indoor Football (AIF) and would use the arena for home games. The AIF would fold before the Bucks could play in the league, but team owner Tim Viens started the Can-Am Indoor Football League for the 2017 season. The Can-Am then merged into the American Arena League after one season of play, but Viens sold the Bucks and the Bucks would eventually fold before playing in the new league.
References
External links
Gutterson Fieldhouse at UVM Athletics
Albert's Gold - More information on the Gutterson Field House
College ice hockey venues in the United States
Indoor ice hockey venues in the United States
Sports venues in Vermont
Buildings and structures in Burlington, Vermont
Tourist attractions in Burlington, Vermont
Sports in Burlington, Vermont
Indoor arenas in Vermont
Music Venues in Vermont
Sports venues completed in 1963
1960s establishments in Vermont
1963 establishments in the United States |
Dwight Lyman Johnson (March 26, 1898 – June 3, 1972) was a physician and a politician in Manitoba, Canada. He served in the Legislative Assembly of Manitoba from 1943 to 1945. Elected as a member of the Manitoba Cooperative Commonwealth Federation, Johnson had a tenuous relationship with the party leadership and was expelled from the party caucus in 1945. After leaving the legislature, he became a member of the communist Labor-Progressive Party.
Johnson was born in Rapid City, Manitoba. His ancestors had moved from Pennsylvania to Ontario in the late eighteenth century. Many were Quakers, and almost all were farmers. He was educated in Rapid City, and at the Brandon Normal School, Brandon College and the Manitoba Medical College. He received a degree in medicine in 1926.
He served in the ranks of the 27th Battalion during World War I, and was awarded a Military Medal and recommended for a commission. From 1926 to 1931, he served in the Philippines as a hospital superintendent. On returning to Manitoba, he served on the Brandon School Board and the Brandon Health Unit from 1937 to 1943.
Johnson became politically active during this period. He was a member of the Brandon Reconstruction Club in the 1930s, a local division of the Canadian League for Social Reconstruction. In 1936, he became a vice-president of the Brandon CCF club. Johnson was a vocal proponent of socialism, and criticized others in the party who were reluctant to use the term openly.
He was elected to the Manitoba legislature in a by-election held in the Brandon constituency on November 18, 1943. Along with Beresford Richards, who had been elected for The Pas earlier in the year, he soon became a prominent figure on the party's left-wing. The CCF was the official opposition party during this period, and Johnson distinguished himself in the legislature as his party's health and welfare critic.
Since the 1930s, Johnson had called for cooperation among Canada's left-wing parties. In 1945, this position caused both Johnson and Richards to be expelled from the CCF caucus. Johnson and Richards argued that the CCF should promote friendly relations with the Soviet Union after World War II, and should seek cooperation with other progressive and working-class parties to prevent the Conservatives from returning to power at the federal level. This strategy of cooperation was identical to that favoured by the Labor-Progressive Party in 1945. Many in the CCF believed Johnson and Richards were directly influenced by the LPP, and accused them of disrupting the party. After Richards made their position public in a speech to the legislature, the provincial CCF council suspended both MLAs from the party.
Johnson and Richards sat in the legislature as independent members, and sought re-election as "Independent CCF" candidates in the 1945 provincial election. Richards was re-elected, and later returned to the CCF fold. Johnson faced opposition from an official CCF candidate, however, and finished third. The winner in Brandon was Leslie McDorman from the Liberal-Progressive party. Johnson appealed for reinstatement to the CCF after the election, but was rejected at the party's December 1945 convention.
Unlike Richards, whose motivations in 1945 have been described as "naive and confused", Johnson's personal philosophy had shifted to Marxism by this period. He joined the Labor-Progressive Party a few years after his expulsion from the CCF. In 1949, he accused social democratic parties such as the CCF of being traitors to the working-class and of propping up the existing capitalist order.
Johnson ran as an independent candidate in the riding of Brandon in the 1949 federal election. Neither the CCF nor the LPP endorsed an official candidate, leaving Johnson as the de facto candidate of a united left. He finished a distant third, behind Liberal James Ewen Matthews . Johnson later attended the Asia and Pacific Rim Peace Conference in the People's Republic of China in 1952, during the period of the Korean War.
References
1898 births
1972 deaths
Canadian anti-capitalists
Canadian anti-war activists
Canadian communists
Canadian Expeditionary Force soldiers
Physicians from Manitoba
Manitoba Co-operative Commonwealth Federation MLAs
Politicians from Brandon, Manitoba
Independent candidates in the 1949 Canadian federal election
Canadian recipients of the Military Medal |
```smalltalk
using System.Collections.Generic;
using System.IO;
using Microsoft.CodeAnalysis;
using Mono.Options;
namespace SkiaSharpGenerator
{
public class CookieCommand : BaseCommand
{
public CookieCommand()
: base("cookie", "Ensure that all cookies have been defined in mono.")
{
}
public string? AssemblyPath { get; set; }
public string? InteropType { get; set; }
public string? MonoBranch { get; set; } = "master";
protected override OptionSet OnCreateOptions() => new OptionSet
{
{ "a|assembly=", "The .NET assembly", v => AssemblyPath = v },
{ "t|type=", "The interop type", v => InteropType = v },
{ "b|branch=", "The mono branch [master]", v => MonoBranch = v },
};
protected override bool OnValidateArguments(IEnumerable<string> extras)
{
var hasError = false;
if (string.IsNullOrEmpty(AssemblyPath))
{
Program.Log.LogError($"{Program.Name}: Path to the .NET assembly was not provided: `--assembly=<path-to.dll>`.");
hasError = true;
}
else if (!File.Exists(AssemblyPath))
{
Program.Log.LogError($"{Program.Name}: Path to the .NET assembly does not exist: `{AssemblyPath}`.");
hasError = true;
}
if (string.IsNullOrEmpty(InteropType))
{
Program.Log.LogError($"{Program.Name}: The interop type was not specified: `{InteropType}`.");
hasError = true;
}
if (string.IsNullOrEmpty(MonoBranch))
{
MonoBranch = "master";
}
return !hasError;
}
protected override bool OnInvoke(IEnumerable<string> extras)
{
var detector = new CookieDetector(AssemblyPath!, InteropType!, MonoBranch!);
detector.Log = Program.Log;
try
{
detector.DetectAsync().Wait();
}
catch
{
if (detector.HasErrors)
{
foreach (var dgn in detector.Messages)
{
if (dgn.Severity == DiagnosticSeverity.Error)
Program.Log.LogError($"{dgn.Descriptor} at {dgn.Location}");
}
}
throw;
}
return true;
}
}
}
``` |
National Route 19 is a national highway in South Korea connects Namhae County to Hongcheon County. It established on 31 August 1971.
Main stopovers
South Gyeongsang Province
Namhae County - Hadong County
South Jeolla Province
Gurye County
North Jeolla Province
Namwon - Jangsu County - Muju County
North Chungcheong Province
Yeongdong County - Okcheon County - Boeun County - Cheongju - Goesan County - Chungju
Gangwon Province
Wonju - Hoengseong County - Hongcheon County
Major intersections
(■): Motorway
IS: Intersection, IC: Interchange
South Gyeongsang Province
South Jeolla Province
North Jeolla Province
North Chungcheong Province
Gangwon Province
References
19
Roads in South Gyeongsang
Roads in North Jeolla
Roads in South Jeolla
Roads in North Chungcheong
Roads in Gangwon |
"3 A.M." is a song by American rapper King Von as the fourteenth track from his second mixtape Levon James that was released in conjunction with it on March 6, 2020.
The production is by Chopsquad DJ.
Composition
"3 A.M." is a storytelling song that delves into the mindset and actions of the protagonist during the early hours of the morning. Bennett paints a picture of a person contemplating committing a robbery, despite having responsibilities and a child at home. He talks about his intention to take advantage of someone's wealth and the risks involved, as the person he plans to rob may be armed. He expresses a willingness to use violence if necessary. The song also touches on the presence of a woman accompanying the victim, with Von considering the possibility of including her in the robbery, finally realizing that that girl was his sister. King Von emphasizes his reputation for being dangerous and willing to retaliate against those who disrespect him and emphasizing a "do or die" mentality.
Overall, the song portrays the dangerous world the protagonist exists in, his willingness to engage in criminal acts, his disregard for consequences, and his determination to assert dominance in his environment. AudibleTreats qualifies it as : "A quick-hitting drill banger with a snide sense of humor and a beat from Von’s favorite producer Chopsquad DJ".
Music video
The music video for "3 A.M." was released a month after the album drop, on April 6, 2020, and it was directed by DrewFilmedIt.
The video paints the scenes drawn and inspired by the lyrics of the song.
References
2020 singles
2020 songs
King Von songs
Empire Distribution singles |
Overconsumption describes a situation where a consumer overuses their available goods and services to where they can't, or don't want to, replenish or reuse them. In microeconomics, this may be described as the point where the marginal cost of a consumer is greater than their marginal utility. The term overconsumption is quite controversial in use and does not necessarily have a single unifying definition. When used to refer to natural resources to the point where the environment is negatively affected, is it synonymous with the term overexploitation. However, when used in the broader economic sense, overconsumption can refer to all types of goods and services, including manmade ones, e.g. "the overconsumption of alcohol can lead to alcohol poisoning". Overconsumption is driven by several factors of the current global economy, including forces like consumerism, planned obsolescence, economic materialism, and other unsustainable business models and can be contrasted with sustainable consumption.
Defining the amount of a natural resource required to be consumed for it to count as "overconsumption" is challenging because defining a sustainable capacity of the system requires accounting for many variables. The total capacity of a system occurs at both the regional and worldwide levels, which means that certain regions may have higher consumption levels of certain resources than others due to greater resources without overconsuming a resource. A long-term pattern of overconsumption in any given region or ecological system can cause a reduction in natural resources that often results in environmental degradation. However, this is only when applying the word to human impacts on the environment. When used in an economic sense, this point is defined as when the marginal cost of a consumer is equal to their marginal utility. Gossen's law of diminishing utility states that at this point, the consumer realizes the cost of consuming/purchasing another item/good is not worth the amount of utility (also known as happiness or satisfaction from the good) they'd receive, and therefore is not conducive to the consumer's wellbeing.
When used in the environmental sense, the discussion of overconsumption often parallels that of population size and growth, and human development: more people demanding higher qualities of living, currently requires greater extraction of resources, which causes subsequent environmental degradation such as climate change and biodiversity loss. Currently, the inhabitants of high wealth, "developed" nations consume resources at a rate almost 32 times greater than those of the developing world, who make up the majority of the human population (7.9 billion people). However, the developing world is a growing consumer market. These nations are quickly gaining more purchasing power and it is expected that the Global South, which includes cities in Asia, America, and Africa, will account for 56% of consumption growth by 2030. This means that if current trends continue relative consumption rates will shift more into these developing countries, whereas developed countries would start to plateau. Sustainable Development Goal 12 "responsible consumption and production" is the main international policy tool with goals to abate the impact of overconsumption.
Causes
Economic growth
Economic growth is sometimes seen as a driver for overconsumption. Economic growth can be seen as a catalyst of overconsumption due to it requiring greater resource input to sustain the growth. China is an example where this phenomenon has been observed readily. China’s GDP increased massively from 1978, and energy consumption has increased by 6-fold. By 1983, China’s consumption surpassed the biocapacity of their natural resources, leading to overconsumption. In the last 30–40 years, China has seen significant increases in its pollution, land degradation, and non-renewable resource depletion, which aligns with its considerable economic growth. It is unknown if other rapidly developing nations will see similar trends in resource overconsumption.
The Worldwatch Institute said China and India, with their booming economies, along with the United States, are the three planetary forces that are shaping the global biosphere. The State of the World 2005 report said the two countries' high economic growth exposed the reality of severe pollution. The report states that
The world's ecological capacity is simply insufficient to satisfy the ambitions of China, India, Japan, Europe, and the United States as well as the aspirations of the rest of the world in a sustainable way.
In 2019, a warning on the climate crisis signed by 11,000 scientists from over 150 nations said economic growth is the driving force behind the "excessive extraction of materials and overexploitation of ecosystems" and that this "must be quickly curtailed to maintain long-term sustainability of the biosphere." Also in 2019, the Global Assessment Report on Biodiversity and Ecosystem Services published by the United Nations' Intergovernmental Science-Policy Platform on Biodiversity and Ecosystem Services, which found that up to one million species of plants and animals are at risk of extinction from human activity, asserted that
A key element of more sustainable future policies is the evolution of global financial and economic systems to build a global sustainable economy, steering away from the current limited paradigm of economic growth.
Consumerism
Consumerism is a social and economic order that encourages the acquisition of goods and services in ever-increasing amounts. There is a spectrum of goods and services that the world population constantly consumes. These range from food and beverage, clothing and footwear, housing, energy, technology, transportation, education, health and personal care, financial services, and other utilities. When the resources required to produce these goods and services are depleted beyond a reasonable level, it can be considered to be overconsumption. Because developing nations are rising quickly into the consumer class, the trends happening in these nations are of special interest. According to the World Bank, the highest shares of consumption, regardless of income lie in food, beverage, clothing, and footwear. As of 2015, the top five consumer markets in the world were the United States, Japan, Germany, China, and France.
Planned and perceived obsolescence is an important factor that explains why some overconsumption of consumer products exists. This factor of the production revolves around designing products with the intent to be discarded after a short period of time. Perceived obsolescence is prevalent within the fashion and technology industries. Through this technique, products are made obsolete and replaced on a semi-regular basis. Frequent new launches of technology or fashion lines can be seen as a form of marketing-induced perceived obsolescence. Products designed to break after a certain period of time or use would be considered to be planned obsolescence.
Affluence
According to a 2020 paper written by a team of scientists titled "Scientists' warning on affluence", the entrenchment of "capitalist, growth-driven economic systems" since World War II gave rise to increasing affluence along with "enormous increases in inequality, financial instability, resource consumption and environmental pressures on vital earth support systems." And the world's wealthiest citizens, referred to as "super-affluent consumers . . . which overlap with powerful fractions of the capitalist class," are the most responsible for environmental impacts through their consumption patterns worldwide.
Any sustainable social and environmental pathways must include transcending paradigms fixated on economic growth and also reducing, not simply "greening", the overconsumption of the super-affluent, the authors contend, and propose adopting either reformist policies which can be implemented within a capitalist framework such as wealth redistribution through taxation (in particular eco-taxes), green investments, basic income guarantees and reduced work hours to accomplish this, or looking to more radical approaches associated with degrowth, eco-socialism and eco-anarchism, which would "entail a shift beyond capitalism and/or current centralised states."
Effects
A fundamental effect of overconsumption is a reduction in the planet's carrying capacity. Excessive unsustainable consumption will exceed the long-term carrying capacity of its environment (ecological overshoot) and subsequent resource depletion, environmental degradation and reduced ecosystem health. In 2020 multinational team of scientists published a study, saying that overconsumption is the biggest threat to sustainability. According to the study, a drastic lifestyle change is necessary for solving the ecological crisis. According to one of the authors Julia Steinberger: “To protect ourselves from the worsening climate crisis, we must reduce inequality and challenge the notion that riches, and those who possess them, are inherently good.” The research was published on the site of the World Economic Forum. The leader of the forum professor Klaus Schwab, calls to a "great reset of capitalism".
A 2020 study published in Scientific Reports, in which both population growth and deforestation were used as proxies for total resource consumption, warns that if consumption continues at the current rate for the next several decades, it can trigger a full or almost full extinction of humanity. The study says that "while violent events, such as global war or natural catastrophic events, are of immediate concern to everyone, a relatively slow consumption of the planetary resources may be not perceived as strongly as a mortal danger for the human civilization." To avoid it humanity should pass from a civilization dominated by the economy to a "cultural society" that "privileges the interest of the ecosystem above the individual interest of its components, but eventually in accordance with the overall communal interest."
The scale of modern life's overconsumption can lead to a decline in economy and an increase in financial instability. Some argue that overconsumption enables the existence of an "overclass", while others disagree with the role of overconsumption in class inequality. Population, Development, and Poverty all coincide with overconsumption; how they interplay with each other is complex. Because of this complexity it is difficult to determine the role of consumption in terms of economic inequality.
In the long term, these effects can lead to increased conflict over dwindling resources and in the worst case a Malthusian catastrophe. Lester Brown of the Earth Policy Institute, has said: "It would take 1.5 Earths to sustain our present level of consumption. Environmentally, the world is in an overshoot mode."
As of 2012, the United States alone was using 30% of the world's resources and if everyone were to consume at that rate, we would need 3-5 planets to sustain this type of living. Resources are quickly becoming depleted, with about ⅓ already gone. With new consumer markets rising in the developing countries which account for a much higher percentage of the world's population, this number can only rise. According to Sierra Club’s Dave Tilford, "With less than 5 percent of world population, the U.S. uses one-third of the world’s paper, a quarter of the world’s oil, 23 percent of the coal, 27 percent of the aluminum, and 19 percent of the copper." According to BBC, a World Bank study has found that "Americans produce 16.5 tonnes of carbon dioxide per capita every year. By comparison, only 0.1 tonnes of the greenhouse gas is generated in Ethiopia per inhabitant."
A 2021 study published in Frontiers in Conservation Science posits that aggregate consumption growth will continue into the near future and perhaps beyond, largely due to increasing affluence and population growth. The authors argue that "there is no way—ethically or otherwise (barring extreme and unprecedented increases in human mortality)—to avoid rising human numbers and the accompanying overconsumption", although they do say that the negative impacts of overconsumption can perhaps be diminished by implementing human rights policies to lower fertility rates and decelerate current consumption patterns.
Effects on health
A report from the Lancet Commission says the same. The experts write: "Until now, undernutrition and obesity have been seen as polar opposites of either too few or too many calories," "In reality, they are both driven by the same unhealthy, inequitable food systems, underpinned by the same political economy that is single-focused on economic growth, and ignores the negative health and equity outcomes. Climate change has the same story of profits and power,". Obesity was a medical problem for people who overconsumed food and worked too little already in ancient Rome, and its impact slowly grew through history. As to 2012, mortality from obesity was 3 times larger than from hunger, reaching 2.8 million people per year by 2017
Overuse of artificial energy, for example, in cars, hurts health and the planet. Promoting active living and reducing sedentary lifestyle, for example, by cycling, reduces greenhouse gas emissions and improve health
Global estimates
In 2010, the International Resource Panel published the first global scientific assessment on the impacts of consumption and production. The study found that the most critical impacts are related to ecosystem health, human health and resource depletion. From a production perspective, it found that fossil-fuel combustion processes, agriculture and fisheries have the most important impacts. Meanwhile, from a final consumption perspective, it found that household consumption related to mobility, shelter, food, and energy-using products causes the majority of life-cycle impacts of consumption.
According to the IPCC Fifth Assessment Report, human consumption, with current policy, by the year 2100 will be seven times bigger than in the year 2010.
Footprint
The idea of overconsumption is also strongly tied to the idea of an ecological footprint. The term "ecological footprint" refers to the "resource accounting framework for measuring human demand on the biosphere." Currently, China, for instance, has a per person ecological footprint roughly half the size of the US, yet has a population that is more than four times the size of the US. It is estimated that if China developed to the level of the United States that world consumption rates would roughly double.
Humans, their prevailing growth of demands for livestock and other domestic animals, has added overshoot through domestic animal breeding, keeping, and consumption, especially with the environmentally destructive industrial livestock production.
Globalization and modernization have brought Western consumer cultures to countries like China and India, including meat-intensive diets which are supplanting traditional plant-based diets. Between 166 to more than 200 billion land and aquatic animals are consumed by a global population of over 7 billion annually. A 2018 study published in Science postulates that meat consumption is set to increase as the result of human population growth and rising affluence, which will increase greenhouse gas emissions and further reduce biodiversity. Meat consumption needs to be reduced in order to make agriculture sustainable by up to 90% according to a 2018 study published in Nature.
56% of respondents to a 2022 climate survey support a carbon budget system to limit the most climate-damaging consumption (62% of those under 30).
Counteractions
The most obvious solution to the issue of overconsumption is to simply slow the rate at which materials are becoming depleted. From a capitalistic point of view, less consumption has negative effects on economies and so instead, countries must look to curb consumption rates but also allow for new industries, such as renewable energy and recycling technologies, to flourish and deflect some of the economic burdens. Some movements think that a reduction in consumption in some cases can benefit the economy and society. They think that a fundamental shift in the global economy may be necessary to account for the current change that is taking place or that will need to take place. Movements and lifestyle choices related to stopping overconsumption include: anti-consumerism, freeganism, green economics, ecological economics, degrowth, frugality, downshifting, simple living, minimalism, the slow movement, and thrifting.
Many consider the final target of the movements as arriving to a steady-state economy in which the rate of consumption is optimal for health and environment.
Recent grassroots movements have been coming up with creative ways to decrease the number of goods we consume. The Freecycle Network is a network of people in one's community that are willing to trade goods for other goods or services. It is a new take on thrifting while still being beneficial to both parties.
Other researchers and movements such as the Zeitgeist Movement suggest a new socioeconomic model which, through a structural increase of efficiency, collaboration and locality in production as well as effective sharing, increased modularity, sustainability and optimal design of products, are expected to reduce resource-consumption.
Solutions offered include consumers using market forces to influence businesses towards more sustainable manufacturing and products.
Another way to reduce consumption is to slow population growth by improving family planning services worldwide. In developing countries, more than 200 million women do not have adequate access. Women's empowerment in these countries will also result in smaller families.
See also
Energy crisis
Artificial demand
Collaborative consumption
Conspicuous consumption
Consumption (economics)
Degrowth
Effects of the car on societies
Environmental studies
Externality
The Limits to Growth
Mottainai
Overexploitation
Overshoot (population)
Peak copper
Peak oil
Planet of the Humans (film)
Preorder economy
Santosha (renunciation of the need to acquire)
Steady-state economy
Surplus: Terrorized into Being Consumers (film)
World Scientists' Warning to Humanity
References
Further reading
Fifty Possible Ways to Challenge Over-Commercialism by Albert J. Fritsch, SJ, PhD
Why people hate fat Americans by Daniel Ben-Ami
External links
Mother Pelican A journal of sustainability
Optimum Population Trust
UN Division for Sustainable Development, Agenda 21, Chapter 4 – "Changing Consumption Patterns"
Footprint For Nations
The Story of Stuff (video)
Energy statistics-Oil Consumption by Country
World Energy Use Graph
Global GDP by Country
Consumerism
Waste minimisation
Peak oil
Population ecology
World population
Global issues
Environmental controversies
Environmental social science concepts |
The Big One is a phrase describing any crash usually involving five or more cars in NASCAR, ARCA, and IndyCar racing. It is most commonly used at Daytona International Speedway and Talladega Superspeedway, although occasionally seen at other tracks as well, such as Dover Motor Speedway and Watkins Glen International.
Coining the phrase
Until the 2000s, massive crashes were referred to as "major" or "terrific" crashes.
By the mid-1990s, competitors and media began taking note of the multi-car wrecks at Daytona and Talladega. In 1997, Dale Earnhardt described a final-lap crash at the 1997 Pepsi 400 as "the Big Wreck". News articles began using the term "Big Wreck" to describe such crashes in 1998, and by 1999, its use was widespread. Drivers began to openly admit they were apprehensive of its possibility.
One of the first times the term "The Big One" was used on-air was during the Winston 500 on ESPN October 11, 1998. Commentator Bob Jenkins said during the crash on lap 134 "This is the big one that we had hoped we would not have." One of the first published instances of the term "The Big One," was an April 18, 2000, article on ESPN.com about a crash in the DieHard 500. The term was also being used informally by fans on message boards.
During the 2001 Daytona 500, Fox commentator Darrell Waltrip used the term on-air to describe an 18-car crash in the backstretch on lap 173, as saying "It's the big one, gang, it's the big one. It's what we've all been fearing in this kind of racing is going to happen."
By 2001, the phrase was widely used by competitors, fans, and in print and broadcast media. It soon became standard NASCAR vernacular, and it became a retronym to describe past such accidents as well.
The Big One has been the subject of criticism of NASCAR. Some have complained that the sanctioning body, promoters and media have celebrated the crashes.
By 2009, Talladega Superspeedway marketed itself on the notorious crashes, with hot dogs, and later meatballs billed as "The Big One," with activities on Friday night after on-track action concludes billed as "The Big One on Talladega Boulevard".
Examples
NASCAR Cup Series
2001 Daytona 500:
On the back straightaway on lap 173, fifth-place Robby Gordon got into the back of fourth-place Ward Burton, turning Burton left into third-place Tony Stewart's right rear. Stewart's car went straight into the wall, catching air, landing on its side on top of Gordon's car, and tumbling across the track while getting hit by other cars. The car briefly landed on top of Joe Gibbs Racing teammate Bobby Labonte before falling onto the track and rolling to a stop in the infield grass. Burton's and Stewart's cars blocked the track, starting a chain reaction crash that collected 18 cars in total, including Burton, Stewart, Labonte, Gordon, Rusty Wallace, Steve Park, Terry Labonte, Mark Martin, Jerry Nadeau, Jason Leffler, Elliott Sadler, John Andretti, Jeff Burton, Andy Houston, Jeff Gordon, Kenny Wallace, Buckshot Jones, and Dale Jarrett. This crash, however, was later overshadowed by Dale Earnhardt's fatal crash on the last lap. Incidentally, Earnhardt had narrowly escaped being caught up in the lap 173 crash, nearly being hit by the spinning Ward Burton.
2002 Daytona 500:
Second-place Kevin Harvick attempted to block the advancing Jeff Gordon going into turn one on lap 149, resulting in the two making contact and Harvick being spun down to the apron. Harvick slid up the track, hit the wall, and slid back down the track, collecting an additional 17 cars (18 in total). Matt Kenseth, Ricky Rudd, Ken Schrader, John Andretti, Kenny Wallace, Casey Atwood, Johnny Benson Jr., Bobby Labonte, Jeremy Mayfield, Joe Nemechek, Mike Wallace, Jimmie Johnson, Bobby Hamilton, Todd Bodine, Dave Blaney, Jerry Nadeau, and Dale Earnhardt Jr. (his third incident in the race). Eventual race winner Ward Burton barely made it to the inside of the spinning Harvick to avoid the crash.
2002 Aaron's 499:
On lap 164, Jimmie Johnson shuffled Kyle Petty out of line in turn 1. Coming on to the backstretch, Petty found a spot in line, but the whole field stacked up behind him, causing Mike Wallace to force Tony Stewart against the outside wall, causing a crash that collected 23 cars: Wallace, Stewart, Steve Park, Rusty Wallace, Terry Labonte, Mark Martin, Casey Atwood, Bill Elliott, Johnny Benson Jr., Matt Kenseth, Bobby Labonte, Jeremy Mayfield, Elliott Sadler, Kevin Harvick, Robby Gordon, Ricky Craven, Jimmy Spencer, John Andretti, Steve Grissom, Bobby Hamilton, Dave Blaney, Geoff Bodine, and Ricky Rudd. Sadler took the biggest hit in the wreck by slamming the corner of the inside wall on the right side, while Benson had to be pulled out of his car after it caught fire on pit road. However, all of the drivers involved escaped injury.
2003 Aaron's 499:
On lap 4, entering turn one, Ryan Newman blew a tire, bounced off Mark Martin, and smashed hard into the turn one wall, almost turning over. One of Newman's tires came off as he spun back down the track, and the tire bounced off Ricky Rudd's hood, causing it to bounce over the catch fence and land in a restricted access area outside the track. Mayhem ensued as cars checked up behind attempting to avoid Newman, who spun across the middle of the track, resulting the largest recorded wreck in modern Cup Series competition. The crash collected a total of 27 cars, the others being Jack Sprague, Jerry Nadeau, Hermie Sadler, Mike Wallace, Steve Park, Rusty Wallace, Mike Skinner, Mark Martin, Jimmy Spencer, eventual race winner Dale Earnhardt, Jr., Johnny Benson Jr., Greg Biffle, Matt Kenseth, Bobby Labonte, Tony Stewart, Jeff Green, Casey Mears, Jamie McMurray, John Andretti, Kyle Petty, Ken Schrader, Todd Bodine, Dave Blaney, Dale Jarrett, and Jeff Burton.
2005 Aaron's 499:
On lap 132, Mike Wallace, Jimmie Johnson and Dale Earnhardt Jr. got together in the tri-oval near pit road exit, forcing Scott Riggs and Wallace to careen into the wall hard, and collecting 23 other cars (25 in all): Kyle Busch, Dave Blaney, Mark Martin, Ryan Newman, Matt Kenseth, Bobby Labonte, Rusty Wallace, Ricky Rudd, Kasey Kahne, Mike Bliss, Mike Skinner, Brian Vickers, Scott Wimmer, Bobby Hamilton Jr., Kerry Earnhardt, Sterling Marlin, Jeff Green, Jason Leffler, Boris Said, Casey Mears, Joe Nemechek, and Carl Edwards. Fox studio analyst Jeff Hammond estimated the total damage at $8 million. The race was red-flagged for about 43 minutes for extensive cleanup.
2012 Good Sam Roadside Assistance 500:
On lap 189, the last lap of a green-white-checker restart following Jamie McMurray's spin with five laps to go, Tony Stewart tried to block the advancing draft of Michael Waltrip and Casey Mears in turn four. As Stewart moved down to block Waltrip, he was passed on the outside by Matt Kenseth (the only car ahead of the crash; would go on to win the race). Stewart came across the front of Waltrip's car, turned sideways, and spun up into the pack, collecting 24 other cars (25 in all): Waltrip, Mears, Kevin Harvick, Marcos Ambrose, Sam Hornish Jr., Aric Almirola, Jimmie Johnson, Dale Earnhardt Jr., Paul Menard, Clint Bowyer, David Ragan, Regan Smith, Dave Blaney, Jeff Burton, Kasey Kahne, Brad Keselowski, Bobby Labonte, Martin Truex Jr., David Gilliland, Terry Labonte, Landon Cassill, Denny Hamlin, Jeff Gordon, and Kyle Busch. Stewart's car went upside down and landed on top of Kahne, Menard, and Bowyer before flipping back over and coming to rest at the exit of turn four. Gordon and Kyle Busch escaped the wreck on the apron with only minor damage to finish in second and third place, respectively. Most of the cars were caught in the initial pileup; however, five cars (Keselowski, Truex, Bobby Labonte, Cassill, and Gilliland) were swept up as the others cars began the spin down into the infield and another (Hamlin) spun out by himself and sustained front-end damage. Travis Kvapil, Greg Biffle, and Ryan Newman avoided the wreck at the back of the pack to take top-ten finishes. Following this crash, Earnhardt Jr., who had taken a few hard hits in the crash, was diagnosed with a concussion, requiring him to sit out the next two races (Charlotte and Kansas). He was replaced by Regan Smith at both of them.
2014 Sprint Unlimited:
On lap 36, going through the tri-oval, Matt Kenseth attempted to move to the inside to carry his momentum around the slightly slower car of Brad Keselowski; however, he didn't have enough room and was turned by Joey Logano. As Kenseth came back up the track, he collected Tony Stewart, Jeff Gordon, Carl Edwards, Kurt Busch, and Ricky Stenhouse Jr. Stewart and Gordon ended up pinned against the wall, with Busch's front end under Gordon's car and Stenhouse's front end under Busch's car. Danica Patrick spun out while trying to miss both the larger crash and the spinning car of Edwards, but she did not hit anything. As her car came to a stop, she was t-boned by the accelerating Stenhouse, who couldn't see because of front-end damage and was trying to make it back to the garage. Kevin Harvick was also involved in the crash, but his damage was only from running through debris.
2015 Coke Zero 400:
On lap 3, David Gilliland tried to drop in behind Dale Earnhardt Jr. on the inside line, failing to see Clint Bowyer, and got turned around by Bowyer, and collected an additional ten cars, including Michael Annett, Greg Biffle, Sam Hornish Jr., Bobby Labonte, Joey Logano, and Danica Patrick.
On lap 105, Matt Kenseth got loose in front of Kasey Kahne out of turn 4. Kenseth's car then washed up the track, collecting nine additional cars, including Aric Almirola, Kyle Larson, Martin Truex Jr., Jamie McMurray, Brad Keselowski, Joey Logano, Sam Hornish Jr., David Ragan, and Trevor Bayne.
On lap 161, the final lap of a green-white-checker finish, second place Denny Hamlin got tapped by Kevin Harvick, spinning him in front of the 27-car lead pack as they crossed the finish line. Hamlin drifted back up into traffic and was hit by Austin Dillon, causing Dillon's car to fly over two other rows of cars, flip, and hit the catch fence. The crash collected 25 cars: Hamlin, Kevin Harvick, Jeff Gordon, Kyle Busch, David Ragan, Matt Kenseth, Matt Dibenedetto, A. J. Allmendinger, Greg Biffle, Brett Moffitt, Landon Cassill, Alex Bowman, Justin Allgaier, Ricky Stenhouse Jr., Cole Whitt, Austin Dillon, Jamie McMurray, Ryan Newman, Brad Keselowski, Joey Logano, Casey Mears, Paul Menard, Tony Stewart, Trevor Bayne, and Brendan Gaughan, with the only uninvolved cars from the lead pack being race winner Dale Earnhardt Jr., second place Jimmie Johnson, and fifth place Kurt Busch. Twenty-four cars from the lead pack, as well as the trailing car of Brad Keselowski, were swept up in the melee. The crash occurred after the cars crossed the finish line, as Hamlin finished third and Harvick fourth, while Dillon finished seventh.
2016 GEICO 500:
On lap 96, Austin Dillon got turned into the outside wall by the car of David Gilliland, and in the ensuing check-up Jimmie Johnson spun out, and Chris Buescher flipped several times down the backstretch. Also involved were Jamie McMurray, Carl Edwards, and Michael Annett.
On lap 161, Kurt Busch attempted to give Johnson a push going into turn 1, which sent Johnson into the outside wall and back into traffic, collecting an additional twenty cars, including Greg Biffle, Kyle Larson, Dillon (his second crash of the afternoon, as was Johnson's), Ryan Blaney, Denny Hamlin, and Ryan Newman.
On lap 181, Michael McDowell bumped into Danica Patrick, sending her into Matt Kenseth, sending Kenseth into the air and the inside wall before he flipped back over. While this took place, McDowell slid up into the outside, catching Aric Almirola, sending him spinning down into Joey Logano. This crash involved 12 cars, many of whom had already taken damage from the lap 161 crash.
On the last lap, headed through the tri-oval, when Landon Cassill hooked Cole Whitt into Kevin Harvick, sending Harvick into the outside wall and into Ricky Stenhouse Jr., putting Harvick on his side before landing back on four wheels. Also collected were Martin Truex Jr. and A. J. Allmendinger as Brad Keselowski crossed the line to take the win. In total, 35 of the 40 cars received some damage during the race, and the first lapped car at the end of the race was Johnson, who finished six laps behind in 22nd.
2016 AAA 400 Drive for Autism:
On a restart on lap 354, race leader Jimmie Johnson was unable to get his car into third gear and was rear ended by Martin Truex Jr., stacking up the field behind him. A total of 18 cars were collected in the wreck. In addition to Johnson and Truex Jr., Kevin Harvick, Jamie McMurray, Ryan Newman, A. J. Allmendinger, Ricky Stenhouse Jr., Kyle Busch, Aric Almirola, Denny Hamlin, Greg Biffle, Casey Mears, Dale Earnhardt Jr., Clint Bowyer, Trevor Bayne, Paul Menard, and Michael McDowell were involved.
2017 Daytona 500:
On lap 129, Jimmie Johnson went from the outside lane to block Trevor Bayne on the inside, as a result, Johnson was spun around, collecting 17 cars including Denny Hamlin, Clint Bowyer, Chris Buescher, Danica Patrick, Parker Kligerman, among many others.
On lap 143, after Chase Elliott almost went around in front of the field, Jamie McMurray was turned around, collecting 11 cars including Brad Keselowski, Jeffrey Earnhardt, Ryan Newman, Daniel Suárez, Landon Cassill and Ty Dillon.
2017 GEICO 500:
On Lap 169, as A. J. Allmendinger tried to bump draft Chase Elliott down the backstretch, Allmendinger inadvertently rammed into Elliott, and both cars went airborne off Turn 2, turning Allmendinger over (after contact from Joey Logano), and collected an additional 15 cars including Erik Jones, Trevor Bayne, Austin Dillon, Matt Kenseth, and Danica Patrick. Others in the wreck, including Brad Keselowski, were able to beat the five-minute crash clock under NASCAR's new damaged vehicle policy to rally and finish 7th in the race. The race was red-flagged while crews extricated Allmendinger from his car.
2017 Alabama 500:
On Lap 171, entering turn 3, Martin Truex Jr. tried to go four wide and clipped David Ragan, causing Ragan to spin into Kurt Busch and Jimmie Johnson and collect an additional 16 cars including Kyle Busch, Kevin Harvick, Matt Kenseth, Austin Dillon, Landon Cassill, Dale Earnhardt Jr., Matt DiBenedetto, Danica Patrick, Ty Dillon, Ricky Stenhouse Jr., Brendan Gaughan, and Michael McDowell. Denny Hamlin and race winner Brad Keselowski were among a few lucky drivers to drive through the crash unscathed. Earnhardt Jr. spun into the infield grass at the start of the crash, but avoided contact with other cars and was able to recover to finish 7th in his final restrictor plate start. This resulted in a lengthy red flag for cleanup.
2018 Daytona 500:
On Lap 60 coming to the end of stage one, Ricky Stenhouse Jr. was clipped by Ryan Blaney, although Stenhouse was able to regain control, Erik Jones got loose behind him and spun around, collecting 9 cars in total including William Byron, Ty Dillon, Jimmie Johnson, Martin Truex Jr., Kyle Larson, and Daniel Suárez.
On lap 103, Brad Keselowski and Chase Elliott made slight contact, sending Elliott into the wall spinning wildly collecting seven cars in total, including Danica Patrick (in her final NASCAR race), Kevin Harvick, Kasey Kahne, David Ragan, and Martin Truex Jr.
On lap 199, Kurt Busch was unable to block Ryan Blaney from passing him, resulting in Busch spinning and collecting 10 additional cars, which included Matt DiBenedetto, Martin Truex Jr., Ricky Stenhouse Jr., Brendan Gaughan, Alex Bowman, Jeffrey Earnhardt, Ryan Newman, A. J. Allmendinger, Darrell Wallace Jr., and Joey Logano.
2018 Coke Zero Sugar 400:
On Lap 54, on the backstretch, William Byron blocked Brad Keselowski, causing him to slow. Ricky Stenhouse Jr., however, failed to do the same, ramming into Keselowski's bumper and sending him into the outside wall and collecting 26 cars. This was one of two big wrecks set off by Stenhouse, who would later have to be escorted by security after the race for protection due to the negative backlash.
On lap 65, following the restart for the previous crash, Stenhouse attempted to side draft Kyle Busch, resulting in Stenhouse Jr. clipping Busch and shooting his car up into the wall, collecting seven cars in total, including William Byron, Trevor Bayne, Jamie McMurray, Erik Jones (who went on to win), and Corey LaJoie.
On lap 163, as Martin Truex Jr. was coming to take the white flag, Clint Bowyer was turned by Darrell "Bubba" Wallace, causing 10 other cars to crash behind him including Kevin Harvick, Matt DiBenedetto, Jimmie Johnson, Ray Black Jr., Ryan Newman, Ross Chastain, Trevor Bayne, Ricky Stenhouse Jr., Brendan Gaughan, and Alex Bowman.
2018 Bank of America Roval 400:
On a restart, Brad Keselowski went too hard into Turn 1, collecting William Byron, Paul Menard, Kyle Larson and Kyle Busch. Busch went up the track and Daniel Hemric was hit. Hemric spun and collected Trevor Bayne, Ty Dillon, Aric Almirola, Darrell Wallace Jr., Michael McDowell, eventual race winner Ryan Blaney, Ryan Newman, and Ross Chastain.
2019 Advance Auto Parts Clash:
On lap 55, Jimmie Johnson attempted to pass Paul Menard for the lead entering turn 3. However, the two drivers made contact and Menard spun out across the track, triggering a 16-car wreck that also involved Kyle Busch, Martin Truex Jr., Brad Keselowski, Kyle Larson, Jamie McMurray, Ryan Newman, Daniel Suarez, Denny Hamlin, Clint Bowyer, Kevin Harvick, Erik Jones, Chase Elliott, Aric Almirola, and Austin Dillon. Shortly after the wreck, the race was called short due to rain, and Johnson was declared the winner.
2019 Daytona 500:
On lap 190, Paul Menard clipped Matt DiBenedetto and caused a 21-car crash which involved the likes of defending Cup Series champion Joey Logano, Martin Truex Jr., Jimmie Johnson, and Chase Elliott, among others.
2020 Daytona 500:
With 17 laps to go, Joey Logano attempted to push Aric Almirola forward down the backstretch into Brad Keselowski. Keselowski lost control of his car upon contact, and a 19-car wreck ensued that also involved Martin Truex Jr., Bubba Wallace, Alex Bowman, Tyler Reddick, Matt DiBenedetto, Ross Chastain, Austin Dillon, Kurt Busch, Justin Haley, Ryan Blaney, Ty Dillon, Chris Buescher, Brendan Gaughan, John Hunter Nemechek, and Jimmie Johnson, who was racing in his last Daytona 500. Kyle Busch also dropped out at that point, but he was not part of the wreck; his engine died. This wreck brought out the first of two red flags not caused by rain and was overshadowed by Ryan Newman’s fiery crash on the final lap of the race.
2020 O'Reilly Auto Parts 500:
On lap 219, Ryan Blaney had checked up on turn 3 off of a restart. That incident had bunched up the field and on the frontstretch, Aric Almirola had tapped Martin Truex Jr. and he flung across the track into the inside wall. Behind the spinning Truex, several cars had gotten into the grass kicking up dirt and debris and virtually blocking up the track. There were 12 cars involved in this wreck, the others being Kyle Busch, Chris Buescher, Matt Kenseth, Cole Custer, Kurt Busch, William Byron, Ryan Preece, Ricky Stenhouse Jr., Bubba Wallace, and Kevin Harvick.
2021 Daytona 500:
On lap 13, Christopher Bell bumped Aric Almirola which turned him into Alex Bowman on the backstretch. 14 other cars were collected those being Kurt Busch, Ryan Newman, Tyler Reddick, Ryan Blaney, Chris Buescher, Martin Truex Jr., Matt DiBenedetto, William Byron, David Ragan, Anthony Alfredo, Erik Jones, Jamie McMurray, and Daniel Suarez.
On the last lap, Brad Keselowski attempted to pass Joey Logano on the backstretch but the two collided, creating a fiery crash sending Keselowski into the catchfence and collecting Kyle Busch, Bubba Wallace, Austin Cindric, Kyle Larson, Ryan Preece, Ross Chastain, and Cole Custer. Michael McDowell, who was third at the time, dodged the final lap crash to win his first career victory under caution as well as earning Front Row Motorsports' third Cup victory.
2021 Coke Zero Sugar 400:
On lap 145, during a major check up, Martin Truex Jr. turned into the backstretch wall after trying to block Ricky Stenhouse Jr. and made contact with William Byron. Then Truex Jr turned left and was rear ended by Tyler Reddick. Other cars involved were Daniel Suarez, Landon Cassill, Chase Briscoe, and Anthony Alfredo.
On lap 156, entering turn 4, Matt DiBenedetto getting a push from Denny Hamlin, got himself loose and brought him, Hamlin, and Chase Elliott up towards the wall, and collected an additional seven cars including Cole Custer, Brad Keselowski, Christopher Bell, Kyle Busch, Ross Chastain, Ricky Stenhouse Jr., and Ryan Preece. This crash sent the race into an overtime.
After a late race caution forcing an overtime to occur, Kurt Busch hooked Daniel Suarez and Kevin Harvick in turn 3, causing a fiery crash similar to the 2021 Daytona 500 earlier in the year. This crash involved Austin Dillon, Corey Lajoie, Ross Chastain, Erik Jones, Ryan Preece, and Kyle Larson.
Xfinity Series
1999 Touchstone Energy 300:
On lap 68, a massive melee involving 23 cars erupted in turn one. It started when Kelly Denton rammed into Ken Schrader, spinning Schrader four times before his car burst into flames. The other 22 cars who were trying to evade Schrader got into a huge pile-up when Mike Dillon blew a tire.
2002 Aaron's 312 at Talladega:
On lap 14, the largest crash in modern NASCAR history (1972–present) took place at the exit of turn two, with 31 cars being involved. Three cars (Stacy Compton, Jason Keller, and Kenny Wallace) had cleared pole-sitter Johnny Sauter as the field started down the back-straightaway. Scott Riggs (fourth on the outside) tried to pass Wallace on the outside, but checked up, causing Shane Hmiel to get in the back of him. Subsequently, Kevin Grubb bumped Hmiel, causing both Riggs and Hmiel to turn sideways down the track and hit the right-rear of Sauter and the right-front of Joe Nemechek, respectively. The impact from Riggs' car caused Sauter's car to turn sideways and flip twice in the middle of the track, thus blocking the track and causing a massive pile-up behind. The drivers involved were Riggs, Hmiel, Grubb, Sauter, Nemechek, Todd Bodine, Larry Foyt, Jack Sprague, Jeff Purvis, Jimmy Kitchens, Randy Lajoie, Kerry Earnhardt, Tony Raines, Bobby Hamilton Jr., Ashton Lewis, Mike McLaughlin, Lyndon Amick, Greg Biffle, Jamie McMurray, Scott Wimmer, Ron Hornaday Jr., Shane Hall, Tim Sauter, Jay Sauter, Michael Waltrip, Joe Ruttman, Jimmy Spencer, Mike Wallace, Mike Harmon, Jeff Fuller, and Coy Gibbs. At the time of the crash, 41 of the 43 cars were on the track. Of those, only Compton, Keller, and Wallace (who were in front of the crash) and C.W. Smith, Hank Parker Jr., Casey Mears, Andy Kirby, Tim Fedewa, Larry Gunselman, and Chad Chaffin (all of whom either got slowed down in time to miss the crash or had lost the lead draft altogether and were elsewhere on the track) made it through without damage. This crash brought out a 40-minute red flag and caused one minor injury to Mike Harmon (required stitches for biting through his tongue).
2008 Aaron's 312:
On lap 70, Kevin Lepage had returned to the track following a pit stop and merged onto the track right in front of the field. A few of the lead cars went around Lepage on the outside, but Carl Edwards ran over the back end of Lepage's car, causing Edwards to catch air and set off a 15-car pile up, including Kyle Busch, David Reutimann, Reed Sorenson, Brad Keselowski, Cale Gale, Patrick Carpentier, Mike Wallace, Kenny Wallace, Steve Wallace, Marcos Ambrose, Stephen Leicht, Kyle Krisiloff, and Kelly Bires.
2012 DRIVE4COPD 300:
In turn 4 on the last lap, leader Kurt Busch attempted to block the two two-car drafts of Joey Logano and Trevor Bayne, and Tony Stewart and Elliott Sadler, both of whom had runs on Busch and drafting partner Kyle Busch. They all made contact, with Kurt Busch ending up sideways against the outside wall, Stewart and Sadler being pinned to the wall by Bayne, and Logano being sent spinning across the track as a result of left-rear contact with Kurt Busch's sideways car. Kyle Busch and Ricky Stenhouse Jr. both moved to the bottom of the track, but Stenhouse turned Busch into the outside wall as they tried to miss the spinning Logano. A similar fate befell Kasey Kahne and Cole Whitt (who were just behind Busch and Stenhouse), with Kahne moving down into and spinning Whitt. Brad Keselowski, who was behind Whitt, received contact from Kahne and Whitt, causing his car to become out of control. James Buescher, who was 11th when the crash started, got through the crash on the track apron and slipped around Keselowski (as he was trying to regain control of his car) to win, followed by Sadler and Keselowski.
2013 DRIVE4COPD 300:
In the trioval, coming to the checkered flag on lap 120, leader Regan Smith was turned into the outside wall by second-place Brad Keselowski. Chaos ensued behind as 14 out of the 15 lead cars crashed in total. After hitting Smith, Keselowski himself was turned around by Sam Hornish Jr. and went up the track in front of Kyle Larson, with Larson being turned sideways after he was hit in the back by Dale Earnhardt Jr. Larson pushed Keselowski's car right-side first into the wall just as two cars (Brian Scott and Justin Allgaier) from behind this crash impacted the right side Larson's car after they had hit the spinning Regan Smith, causing Larson's car to go airborne and fly up into the catchfence. The front tires and the engine of his car were torn out and landed on the spectator side of the fence as part the fence was torn down by the impact of Larson's car. Simultaneously, Elliott Sadler impacted Regan Smith's spinning car, almost causing it to go airborne as well. Also, past the start-finish line, Alex Bowman spun through the infield and across the track, making hard contact with the outside wall. After Bowman hit the wall, Earnhardt Jr. drove under him, jacking the rear of Bowman's car up in the air (very similar to Kyle Busch's crash in the 2009 Coke Zero 400 when Kasey Kahne drove under him). The drivers involved were Smith, Keselowski, Earnhardt, Hornish, Larson, Scott, Bowman, Sadler, Allgaier, Travis Pastrana, Parker Kligerman, Eric McClure, Robert Richardson Jr., and Nelson Piquet Jr. Race winner Tony Stewart cut down through the infield and back up on the track to escape the melee. 28 spectators were injured, 14 of whom were treated at the infield care center and 14 of whom were taken to nearby hospitals, including seven taken to Halifax Health Medical Center in Daytona Beach, six more being taken to Halifax Health Medical Center in Port Orange, and one being taken to another area hospital. Six of those spectators sustained serious injuries.
2018 PowerShares QQQ 300:
Lap 122: During a NASCAR overtime, on the back straightaway of one of the five overtimes that occurred during the race, Aric Almirola was turned into the outside wall by second-place Kyle Larson, triggering a massive 18 car melee that collected big names, including Justin Allgaier, Joey Logano, and Brandon Jones. The race was eventually had a photo finish in the fifth overtime, between Elliott Sadler and Tyler Reddick.
2018 Coca-Cola Firecracker 250:
On lap 83, in the middle of three wide racing, Austin Cindric attempted to move down and block Matt Tifft, resulting in Tifft spinning Cindric into the front of the field and soon barrel rolling after making contact with Tyler Reddick, collecting 17 cars in total including Daniel Hemric, Tyler Reddick, Joey Gase, Jeremy Clements, Alex Labbé, David Starr, Chad Finchum, Brandon Jones, Ryan Reed, Ray Black Jr., and Garrett Smithley.
2019 Circle K Firecracker 250:
On lap 74, amidst a battle going on mid-pack, Scott Lagasse Jr. was turned by Brandon Brown, Lagasse bounced off of the wall and collected 9 other cars, which included Chad Finchum, Shane Lee, Chris Cockrum, David Starr, Sheldon Creed, Christopher Bell, and B. J. McLeod.
On lap 88, Michael Annett was clipped and turned into the wall by Christopher Bell, this caused the field to stack up and 15 cars were collected in the crash, which included Joe Graf Jr., Josh Williams, Timmy Hill, Noah Gragson, A. J. Allmendinger, Austin Cindric, Cole Custer, Chad Finchum, Caesar Bacarella, and others.
2022 Beef. It's What's For Dinner. 300:
On Lap 120, the final lap, Myatt Snider got turned from behind as the field went down the backstretch of Daytona. The ensuing crash took out eight cars and sent Snider into the catch fence violently. The crash was so extreme, the engine was torn from the car. The crash collected Snider, Matt Mills, Jade Buford, Tommy Joe Martins, Anthony Alfredo, Jeb Burton, Landon Cassill, and Ty Gibbs.
NASCAR Craftsman Truck Series
2000 Daytona 250
On lap 57, Kurt Busch and Rob Morgan made contact sending Geoff Bodine's No. 15 truck into the catchfence, destroying it in the process. The crash collected 12 other trucks.
2021 Chevy Silverado 250 (Love's RV Stop 250)
With 37 laps to go, Austin Hill received a push from Todd Gilliland which turned Hill into Zane Smith. Both drivers would hit the outside wall and go back into traffic, collecting 20 other trucks.
2022 NextEra Energy 250
Coming to the white flag, Tyler Ankrum was turned after a late block from Christian Eckes, resulting in nearly 20 trucks crashing making it one of the biggest wrecks in the history of the NASCAR Craftsman Truck Series.
IndyCar Series
2011 IZOD IndyCar World Championship:
On lap 11, Wade Cunningham clipped James Hinchcliffe and then made contact with J. R. Hildebrand, initiating a 15-vehicle collision that killed Dan Wheldon and seriously injured Hildebrand, Pippa Mann, and Will Power. Wheldon was racing at and struck Charlie Kimball while trying to avoid the collision, sending his car airborne. It flew a distance of about and hit the catch fence cockpit first before landing back on the racing surface and coming to a stop near the SAFER barrier.
2017 Rainguard Water Sealers 600:
After a series of incidents with both the INDYCAR (part of the race was run on one day, then the other half a few months later, largely due to a combination of rain, weepers, and a day-one crash between Conor Daly and Josef Newgarden that injured the latter) and NASCAR (rain and weepers) in 2016, Texas Motor Speedway officials repaved and reconfigured the circuit to reduce weeper issues. On lap 152, Tony Kanaan made contact with James Hinchcliffe, triggering a major collision that forced seven other drivers to leave the race. During the ensuing red flag that followed, INDYCAR officials and Bridgestone engineers agreed to use competition cautions and mandatory tire changes for the remainder of the race in response to continuing issues with blistering tires from the repaved circuit. Kanaan was assessed a 20-second hold penalty for his role in the crash.
2018 ABC Supply 500
On lap 6, Ryan Hunter-Reay and Robert Wickens made contact, sending Wickens' car spinning violently into the catchfence. James Hinchcliffe spun while trying to miss the accident and was hit by Pietro Fittipaldi, who would also go in the air briefly. Takuma Sato was also involved. Wickens would be paralyzed from the chest down after the accident and would not step back into a racecar until 2022.
See also
1973 Winston 500#"The Big One"
References
External links
"The Big One"- 10 Notorious Talladega Crashes
NASCAR races at Daytona International Speedway
NASCAR races at Talladega Superspeedway
NASCAR terminology |
Marguerite Bay is a natural bay off the island of Newfoundland in the province of Newfoundland and Labrador, Canada.
References
Bays of Newfoundland and Labrador |
Ravenscroft School, also known as Chateau Nollman, is a historic school building located at Asheville, Buncombe County, North Carolina. The oldest section was built about 1845, and is a two- to three-story brick building in the Greek Revival style. It consists of a squat, three-story, pyramidal-roofed tower with projecting two-story rectangular wings. The building has a number of later additions including a two-story brick wing and two-story frame wing. It was originally built as a residence, and housed a school from 1856 to the turn of the 20th century. It was used as a boarding or rooming house until 1977. The building is currently used as office space.
It was listed on the National Register of Historic Places in 1978. It is located in the Downtown Asheville Historic District.
References
School buildings on the National Register of Historic Places in North Carolina
Greek Revival architecture in North Carolina
School buildings completed in 1845
Buildings and structures in Asheville, North Carolina
National Register of Historic Places in Buncombe County, North Carolina
Historic district contributing properties in North Carolina |
Conchalí () is a commune of Chile located in Santiago Province, Santiago Metropolitan Region. It is a northwestern suburb of Santiago.
Demographics
According to the 2002 census of the National Statistics Institute, Conchalí spans an area of and has 133,256 inhabitants (64,973 men and 68,283 women), and the commune is an entirely urban area. The population fell by 12.9% (19663 persons) between the 1992 and 2002 censuses. Its 2006 population was projected at 120,151 persons.
Stats
Average annual household income: US$24,396 (PPP, 2006)
Population below poverty line: 8.0% (2006)
Regional quality of life index: 78.61, mid-high, 16 out of 52 (2005)
Human Development Index: 0.707, 118 out of 341 (2003)
Administration
As a commune, Conchalí is a third-level administrative division of Chile administered by a municipal council, headed by an alcalde who is directly elected every four years. The 2008-2012 alcalde was Rubén Malvoa Hernández (RN). The current incumbent is Carlos Sottolichio Urquiza (PPD), who was also mayor from 1992-2000 and 2003-2008. The communal council has the following members:
Rubén Carvacho Rivera (UDI)
Cecilia Delgado Delgado (PPD)
María Guajardo Silva (PS)
Ricardo Montero Riveros (PC)
Máximo Pavez Cantillano (UDI)
Paulina Rodríguez Gómez (RN)
Alejandra Saa Carrasco (PPD)
Alejandro Vargas González (DC)
Within the electoral divisions of Chile, Conchalí is represented in the Chamber of Deputies by Karla Rubilar (RN) and Daniel Farcas Guendelman (PPD) as part of the 17th electoral district, (together with Renca and Huechuraba). The commune is represented in the Senate by Guido Girardi Lavín (PPD) and Andrés Allamand Zavala (RN) as part of the 7th senatorial constituency (Santiago-West).
References
External links
Municipality of Conchalí
Populated places in Santiago Province, Chile
Communes of Chile
Geography of Santiago, Chile
Populated places established in 1927
1927 establishments in Chile |
The Harmony Silk Factory (2005) is Tash Aw's critically acclaimed first novel, set in 1940s British-ruled Malaya, which is now called Malaysia. It was longlisted for the Man Booker Prize, and won the Whitbread Book Awards for First Novel Award. The novel incorporates some historical events, and its characters may temporarily take the roles of real people, for example Johnny Lim acts as Lai Teck in the Batu Caves massacre, though there is otherwise little similarity between them.
Synopsis
Between the wars, Johnny Lim becomes a successful businessman running Tiger Tan’s textile shop in Kampar, a town near Ipoh in the tin-mining Kinta Valley of Malaysia. He marries Snow Soong, the beautiful daughter of TK Soong, the richest man in the valley. They go on a belated honeymoon to the mysterious Seven Maidens islands. Accompanying them are Kunichika Mamoru, a Japanese academic, who will become head of the Kempeitai, the secret police, during the Japanese occupation; Peter Wormwood, an English drifter who has become Johnny’s friend and confidante; and Frederick Honey, a tin mine manager. Later, the shop burns down, and Johnny opens the Harmony Silk Factory, which does very well during the occupation and after. In 1942, Snow dies giving birth to her son, Jasper.
The novel is narrated in three overlapping sections. First, Jasper tells what he knows of his father’s life. Then we read extracts from Snow’s diary, which was handed to Jasper at his father’s funeral. In the third, Peter is now old and living in a care home. He remembers his friendship with Johnny, and what happened on the trip to the Seven Maidens, where he swiped Snow’s diary.
Reception
Booklist called The Harmony Silk Factory "an impressive contribution to a literature for which Conrad and Maugham are famous". The Guardian said the book was "a little rough and transparent in places", but that Aw "writes with what seems like effortless fluidity". Time Magazine wrote that Aw "produced a tale of love and betrayal that transcends mere location". Publishers Weekly also reviewed the book, writing "Aw's prose, though often witty and taut, is not equally convincing in all its guises".
References
Novels by Tash Aw
2005 British novels
English novels
Historical novels
Novels set in the 1940s
Novels set in Malaysia
Malaysian novels
English-language novels
2005 debut novels
HarperCollins books |
Dablo is a department or commune of Sanmatenga Province in central Burkina Faso. Its capital lies at the town of Dablo.
Towns and villages
References
Departments of Burkina Faso
Sanmatenga Province |
Tamara Orejuela (born 23 June 1953) is an Ecuadorian former swimmer. She competed in two events at the 1968 Summer Olympics. She was the first woman to represent Ecuador at the Olympics.
References
External links
1953 births
Living people
Ecuadorian female swimmers
Olympic swimmers for Ecuador
Swimmers at the 1968 Summer Olympics
Swimmers at the 1967 Pan American Games
Pan American Games competitors for Ecuador
Sportspeople from Guayaquil
20th-century Ecuadorian women |
Gino Ferrer Callegari (April 14, 1911 in Padua – April 14, 1954 in Genoa) was an Italian professional football player and coach.
He played for 10 seasons (198 games, 11 goals) in the Serie A for Calcio Padova, A.S. Roma, Sampierdarenese, A.S. Lucchese Libertas 1905 and A.C. Liguria.
1911 births
1954 deaths
Deaths from leukemia
Deaths from cancer in Liguria
Italian men's footballers
Serie A players
Calcio Padova players
AS Roma players
UC Sampdoria players
Lucchese 1905 players
Italian football managers
Men's association football midfielders
Footballers from Padua |
The Treaty of Dayton may refer to:
Dayton Agreement, a peace agreement for Bosnia and Herzegovina made in Dayton, Ohio
Treaty with the Kalapuya, etc., a U.S./Native American treaty made in Dayton, Oregon |
Rodrigo Arocena Linn (born February 23, 1947, in Montevideo) is an Uruguayan mathematician, and rector of the University of the Republic since July 2006.
Biography
Son of Germán Arocena Capurro and Mercedes Linn Davie, he comes from an Uruguayan upper-class family. His only brother Ignacio Arocena Linn disappeared on 20 August 1978 in Argentina, under circumstances surrounding the military regime. He began his academic life in the Faculty of Engineering at the University of the Republic of Uruguay. After a short time he began to teach at the Institute of Mathematics and Statistics, today called "Rafael Laguardia". During the military dictatorship in Uruguay, Arocena was exiled from the country, after spending a period in prison. After a journey to Buenos Aires he migrated to Caracas and obtained his doctorate in mathematics in 1979 from the Central University of Venezuela (UCV), under the direction of Mischa Cotlar in the area of functional analysis. More recently, Arocena changed the direction of his studies, dedicating himself to social sciences, obtaining at the UCV a second doctorate in development studies, in 1990. He acted as Professor of Science and Development at the Faculty of Science until his election as vice-chancellor of the University of the Republic of Uruguay. In 2007 the LGBT collective "Ovejas Negras" (Black Sheep) recognized him as Person of the Year.
Publications
He is the author of more than 30 articles in the area of social science, dedicated to the study of the science in Uruguay and Latin America, and the themes of exile and technology. He has published 16 books (as author, co-author, or editor) regarding similar social themes. In the area of mathematics, between the years 1979 and 1998, he published some 40 articles about functional and harmonic analysis, unary operators and advancements.
Vice-chancellor of the University
Rodrigo Arocena was elected vice-chancellor of the University of the Republic of Uruguay in the third vote (the last possible moment) in the General Assembly of the Senate. After the withdrawal of several candidates, opinions were divided between Rodrigo Arocena and Roberto Markarian, another mathematician who also began teaching in the Rafael Laguardia Institute of Mathematics and Statistics at the same time as Arocena. Arocena counted on the support of the majority of the students from the Federation of University Students of Uruguay in the General Assembly of the Senate to boost his candidacy, while Markarian had backing from the Teacher's Association of the University of the Republic (ADUR).
References
External links
list of publications from Yale University retrieved 17/09/2011
Curriculum Vitae de Rodrigo Arocena in Spanish.
University of the Republic, Uruguay in Spanish.
Federation of University Students of Uruguay (FEUU) in Spanish.
Association of Teachers of the University of the Republic (ADUR) in Spanish.
1947 births
Living people
20th-century Uruguayan mathematicians
University of the Republic (Uruguay) rectors
21st-century Uruguayan mathematicians |
```smalltalk
using UnityEngine;
using System.Collections;
using System.Collections.Generic;
using System;
public delegate void EventHandle(params object[] args);
public delegate void EventHandle<T>(T e, params object[] args);
public class GlobalEvent
{
#region EnumKey
private static Dictionary<Enum, EventHandle> mEventDic = new Dictionary<Enum, EventHandle>();
private static Dictionary<Enum, List<EventHandle>> mUseOnceEventDic = new Dictionary<Enum, List<EventHandle>>();
/// <summary>
///
/// </summary>
/// <param name="type"></param>
/// <param name="handle"></param>
/// <param name="isUseOnce"></param>
public static void AddEvent(Enum type, EventHandle handle, bool isUseOnce = false)
{
if (isUseOnce)
{
if (mUseOnceEventDic.ContainsKey(type))
{
if (!mUseOnceEventDic[type].Contains(handle))
mUseOnceEventDic[type].Add(handle);
else
Debug.LogWarning("already existing EventType: " + type + " handle: " + handle);
}
else
{
List<EventHandle> temp = new List<EventHandle>();
temp.Add(handle);
mUseOnceEventDic.Add(type, temp);
}
}
else
{
if (mEventDic.ContainsKey(type))
{
mEventDic[type]+= handle;
}
else
{
mEventDic.Add(type, handle);
}
}
}
internal static void AddTypeEvent<T>(string v)
{
throw new NotImplementedException();
}
/// <summary>
///
/// </summary>
/// <param name="type"></param>
/// <param name="handle"></param>
public static void RemoveEvent(Enum type, EventHandle handle)
{
if (mUseOnceEventDic.ContainsKey(type))
{
if (mUseOnceEventDic[type].Contains(handle))
{
mUseOnceEventDic[type].Remove(handle);
if (mUseOnceEventDic[type].Count == 0)
{
mUseOnceEventDic.Remove(type);
}
}
}
if (mEventDic.ContainsKey(type))
{
mEventDic[type]-= handle;
}
}
internal static void AddTypeEvent<T>()
{
throw new NotImplementedException();
}
/// <summary>
///
/// </summary>
/// <param name="type"></param>
public static void RemoveEvent(Enum type)
{
if (mUseOnceEventDic.ContainsKey(type))
{
mUseOnceEventDic.Remove(type);
}
if (mEventDic.ContainsKey(type))
{
mEventDic.Remove(type);
}
}
/// <summary>
///
/// </summary>
/// <param name="type"></param>
/// <param name="args"></param>
public static void DispatchEvent(Enum type, params object[] args)
{
if (mEventDic.ContainsKey(type))
{
try
{
if (mEventDic[type] != null)
{
mEventDic[type](args);
}
}
catch (Exception e)
{
Debug.LogError(e.ToString());
}
}
if (mUseOnceEventDic.ContainsKey(type))
{
for (int i = 0; i < mUseOnceEventDic[type].Count; i++)
{
//
foreach (EventHandle callBack in mUseOnceEventDic[type][i].GetInvocationList())
{
try
{
callBack(args);
}
catch (Exception e)
{
Debug.LogError(e.ToString());
}
}
}
RemoveEvent(type);
}
}
#endregion
#region StringKey
private static Dictionary<string, List<EventHandle>> m_stringEventDic = new Dictionary<string, List<EventHandle>>();
private static Dictionary<string, List<EventHandle>> m_stringOnceEventDic = new Dictionary<string, List<EventHandle>>();
/// <summary>
///
/// </summary>
/// <param name="type"></param>
/// <param name="handle"></param>
/// <param name="isUseOnce"></param>
public static void AddEvent(string eventKey, EventHandle handle, bool isUseOnce = false)
{
if (isUseOnce)
{
if (m_stringOnceEventDic.ContainsKey(eventKey))
{
if (!m_stringOnceEventDic[eventKey].Contains(handle))
m_stringOnceEventDic[eventKey].Add(handle);
else
Debug.LogWarning("already existing EventType: " + eventKey + " handle: " + handle);
}
else
{
List<EventHandle> temp = new List<EventHandle>();
temp.Add(handle);
m_stringOnceEventDic.Add(eventKey, temp);
}
}
else
{
if (m_stringEventDic.ContainsKey(eventKey))
{
if (!m_stringEventDic[eventKey].Contains(handle))
m_stringEventDic[eventKey].Add(handle);
else
Debug.LogWarning("already existing EventType: " + eventKey + " handle: " + handle);
}
else
{
List<EventHandle> temp = new List<EventHandle>();
temp.Add(handle);
m_stringEventDic.Add(eventKey, temp);
}
}
}
internal static void AddEvent<T>(object onRequestRealNameResult)
{
throw new NotImplementedException();
}
/// <summary>
///
/// </summary>
/// <param name="type"></param>
/// <param name="handle"></param>
public static void RemoveEvent(string eventKey, EventHandle handle)
{
if (m_stringEventDic.ContainsKey(eventKey))
{
if (m_stringEventDic[eventKey].Contains(handle))
{
m_stringEventDic[eventKey].Remove(handle);
//if (m_stringEventDic[eventKey].Count == 0)
//{
// m_stringEventDic.Remove(eventKey);
//}
}
}
if (m_stringOnceEventDic.ContainsKey(eventKey))
{
if (m_stringOnceEventDic[eventKey].Contains(handle))
{
m_stringOnceEventDic[eventKey].Remove(handle);
//if (m_stringOnceEventDic[eventKey].Count == 0)
//{
// m_stringOnceEventDic.Remove(eventKey);
//}
}
}
}
/// <summary>
///
/// </summary>
/// <param name="eventKey"></param>
public static void RemoveEvent(string eventKey)
{
if (m_stringEventDic.ContainsKey(eventKey))
{
m_stringEventDic.Remove(eventKey);
}
if (m_stringOnceEventDic.ContainsKey(eventKey))
{
m_stringOnceEventDic.Remove(eventKey);
}
}
/// <summary>
///
/// </summary>
public static void RemoveAllEvent()
{
mUseOnceEventDic.Clear();
mEventDic.Clear();
m_stringEventDic.Clear();
}
/// <summary>
///
/// </summary>
/// <param name="eventKey"></param>
/// <param name="args"></param>
public static void DispatchEvent(string eventKey, params object[] args)
{
if (m_stringEventDic.ContainsKey(eventKey))
{
for (int i = 0; i < m_stringEventDic[eventKey].Count; i++)
{
//
foreach (EventHandle callBack in m_stringEventDic[eventKey][i].GetInvocationList())
{
try
{
callBack(args);
}
catch (Exception e)
{
Debug.LogError(e.ToString());
}
}
}
}
if (m_stringOnceEventDic.ContainsKey(eventKey))
{
for (int i = 0; i < m_stringOnceEventDic[eventKey].Count; i++)
{
//
foreach (EventHandle callBack in m_stringOnceEventDic[eventKey][i].GetInvocationList())
{
try
{
callBack(args);
}
catch (Exception e)
{
Debug.LogError(e.ToString());
}
}
}
RemoveEvent(eventKey);
}
}
#endregion
#region TypeKey
private static Dictionary<Type, EventDispatcher> mTypeEventDic = new Dictionary<Type, EventDispatcher>();
private static Dictionary<Type, EventDispatcher> mTypeUseOnceEventDic = new Dictionary<Type, EventDispatcher>();
/// <summary>
///
/// </summary>
/// <param name="type"></param>
/// <param name="handle"></param>
/// <param name="isUseOnce"></param>
public static void AddTypeEvent<T>( EventHandle<T> handle, bool isUseOnce = false)
{
GetEventDispatcher<T>(isUseOnce).m_CallBack += handle;
}
/// <summary>
///
/// </summary>
/// <param name="type"></param>
/// <param name="handle"></param>
public static void RemoveTypeEvent<T>(EventHandle<T> handle, bool isUseOnce = false)
{
GetEventDispatcher<T>(isUseOnce).m_CallBack -= handle;
}
/// <summary>
///
/// </summary>
/// <param name="type"></param>
public static void RemoveTypeEvent<T>(bool isUseOnce = false)
{
GetEventDispatcher<T>(isUseOnce).m_CallBack = null;
}
/// <summary>
///
/// </summary>
/// <param name="type"></param>
/// <param name="args"></param>
public static void DispatchTypeEvent<T>(T e, params object[] args)
{
GetEventDispatcher<T>(false).Call(e,args);
//
GetEventDispatcher<T>(true).Call(e, args);
GetEventDispatcher<T>(true).m_CallBack = null;
}
static EventDispatcher<T> GetEventDispatcher<T>(bool isOnce)
{
Type type = typeof(T);
if (isOnce)
{
if (mTypeUseOnceEventDic.ContainsKey(type))
{
return (EventDispatcher<T>)mTypeUseOnceEventDic[type];
}
else
{
EventDispatcher<T> temp = new EventDispatcher<T>();
mTypeUseOnceEventDic.Add(type, temp);
return temp;
}
}
else
{
if (mTypeEventDic.ContainsKey(type))
{
return (EventDispatcher<T>)mTypeEventDic[type];
}
else
{
EventDispatcher<T> temp = new EventDispatcher<T>();
mTypeEventDic.Add(type, temp);
return temp;
}
}
}
abstract class EventDispatcher{}
class EventDispatcher<T> : EventDispatcher
{
public EventHandle<T> m_CallBack;
public void Call(T e,params object[] args)
{
if(m_CallBack != null)
{
try
{
m_CallBack(e, args);
}
catch(Exception exc)
{
Debug.LogError(exc.ToString());
}
}
}
}
#endregion
}
public class EventHandRegisterInfo
{
public Enum m_EventKey;
public EventHandle m_hande;
public void RemoveListener()
{
GlobalEvent.RemoveEvent(m_EventKey, m_hande);
}
}
``` |
Seosamh Ó Maoileoin (born Joseph Malone) is an Irish Republican from Meedin, Tyrrellspass, County Westmeath. He has been the president of Republican Sinn Féin since November 2018 following the resignation of Des Dalton.
Family
Seosamh is from a notable Republican family, his uncles Tomás Malone and Séamas participated in the Easter Rising, Irish War of Independence and the following Irish Civil War.
References
Irish republicans
Living people
Republican Sinn Féin members
Year of birth missing (living people)
People from Tyrrellspass
Politicians from County Westmeath |
Fyksesund Landscape Park is a landscape park in Kvam Municipality in Vestland county, Norway. It is located around the Fyksesund fjord, an arm of the Hardangerfjord. Fyksesund Landscape Park is coordinated by the organisation: Landskapspark Hordaland. It is one of three landscape parks in the Hardanger region, the other two being Herand Landscape Park, located on the southern side of the Hardangerfjord in Ullensvang (directly across from Fyksesund) and Vikebygdkrinsen Landscape Park in Vikebygd, north of the town of Odda.
The term "landscape park" is defined by Landskapspark Hordaland, which was founded and is funded by the county government of Hordaland, as "unique natural and cultural landscapes, delimited by common culture and identity". According to the organisation, "local communities and businesses are developed together in order to make the areas attractive as places of residence and for visiting".
Fyksesund Landscape Park encompasses several small communities, including Steinstø, Fykse, Klyve, Porsmyr, Rykkje, Flotve and Soldal, with a total population of approximately 400 people. The communities around the inner part of the fjord do not have road connections, and can only be reached by boat or foot. One of the mostly abandoned roadless villages is Botnen, through which a bicycle path runs, known for manufacturing of Hardanger fiddles in past times.
References
External links
Fyksesund landskapspark
Geography of Vestland
Kvam |
Endoclita signifer is a species of moth of the family Hepialidae. It is found in eastern Asia, including Japan, Taiwan, Sylhet, Burma, Borneo and Java.
The larvae bore in Fraxinus species and Paulownia tomentosa. It takes two years to complete its life cycle with adults appearing in September.
References
Moths described in 1856
Hepialidae |
There are forty-four colleges and universities in the U.S. state of West Virginia that are listed under the Carnegie Classification of Institutions of Higher Education. These institutions include two research universities, five master's universities, and fourteen baccalaureate colleges, as well as twenty-one associate's colleges. In addition, there are three institutions classified as special-focus institutions.
West Virginia's oldest surviving post-secondary institution is Bethany College, founded on March 2, 1840 by Alexander Campbell. Marshall University and West Liberty University were both established in 1837, but as private subscription schools. Founded in 1867, West Virginia University is the state's largest public institution of higher learning in terms of enrollment, as it had 29,707 students as of spring 2013. Eastern West Virginia Community and Technical College is the state's smallest, with an enrollment of 822. With an enrollment of 1,549 students, Wheeling University is West Virginia's largest traditional private post-secondary institution, while Valley College–Princeton is the state's smallest, with an enrollment of 72. The American Public University System, a private for-profit, distance education institution based in Charles Town, has the largest enrollment of any post-secondary institution in West Virginia, with 31,331 students. Catholic Distance University, a fully online non-profit university in Charles Town, educates undergraduate students in Liberal Arts and theology and graduate students in theology and educational ministry.
West Virginia has two land-grant universities: West Virginia State University and West Virginia University. West Virginia University is also the state's sole participant university in the National Space Grant College and Fellowship Program. In addition, West Virginia has two historically black colleges and universities that are members of the Thurgood Marshall College Fund: Bluefield State University and West Virginia State University.
West Virginia has three medical schools: Marshall University Joan C. Edwards School of Medicine, West Virginia School of Osteopathic Medicine, and West Virginia University School of Medicine. It has one law school, West Virginia University College of Law, which is accredited by the American Bar Association. The majority (thirty-three) of West Virginia's post-secondary institutions are accredited by the Higher Learning Commission (HLC). Most are accredited by multiple agencies or have specific programs or units accredited by agency, including as the Accreditation Commission for Education in Nursing (ACEN), the American Physical Therapy Association (APTA), the Commission on Collegiate Nursing Education (CCNE), and the Council for the Accreditation of Educator Preparation (CAEP).
Institutions
Defunct institutions
See also
Higher education in the United States
List of college athletic programs in West Virginia
List of recognized higher education accreditation organizations
Lists of American institutions of higher education
References
Explanatory notes
Citations
Bibliography
External links
United States Department of Education listing of accredited institutions in West Virginia
Lists of universities and colleges by U.S. state
Universities and colleges |
Overseas China Education Foundation (OCEF) is an independent, non-political, non-religious and non-profit charity organization, founded in October 1992 by a group of Chinese students and scholars in California. Formerly known as SOS China Education Fund (SOSCEF), OCEF changed to its current name and was registered in Texas in April 2001 as a 501(c)(3) non-profit organization. OCEF's sole mission is to help underprivileged children in impoverished rural areas of China receive education and improve the quality of education in rural China.
Overview
OCEF is headquartered in Houston, Texas and has local chapters in many cities across the U.S., including Boston, Chicago, Dallas, Houston, New York, San Diego, San Francisco, and UIUC.
OCEF raises funds primarily via donations from individuals, corporations and foundations in the U.S., then distributes them directly to the students, teachers and schools in rural China, through the volunteers in China (run by OCEF's China Affairs group), without any interference by governments or other organizations. The distribution process is completely transparent and discussed in details on OCEF's BBS forum.
Operated predominantly by unpaid volunteers, OCEF keeps operational costs minimal (3.4% of annual donation receipts in 2011). In its 20-year journey (1992 through spring 2012), OCEF has made continuous achievements through steady steps.
Raised over $3 million donations
Distributed over RMB 14 million across 27 provinces in China
Sponsored 41,610 students and teachers
Built 412 libraries
Donated 373,019 books
In 2012, OCEF celebrated its 20th anniversary through a series of events around the world, in Beijing,
New York,
Chicago,
San Francisco,
and the main event on November 4, 2012, in Houston.
OCEF Programs
OCEF offers a variety of funding programs across over 20 provinces in rural China and has developed comprehensive operational procedures that ensure all OCEF funds are distributed diligently and transparently.
Comprehensive Support Program
Financial Aid Program
High School Scholarship Program
Teacher Aid Program
Library Program
School Building Program
OCEF conducts site-visits to inspect OCEF sponsored programs, during which the inspectors examine the status of aid recipients, confirm the proper use of all aid money, and verify that the schools have followed OCEF policies in the pre-screening of aid applicants and in the disbursement of aid. The majority of the local funding programs are inspected every other year.
Publications
OCEF regularly publishes reports, journals, newsflashes, etc. for its supported students, donors, members and volunteers.
Awards and Prizes
In April 2005, OCEF received Top 10 Reading Advocate Award from the Library Society of China.
In November 2009, OCEF received the $50,000 grand prize in the America's Giving Challenge sponsored by the Case Foundation, Parade magazine and the Facebook Causes application, for the most donations received over the 30-day period. OCEF received 13,772 donations and raised $156,637 in addition to the $50,000 award money.
In December 2009, OCEF received a $25,000 prize in the Chase Community Giving Contest, following Facebook users' voting.
In May 2010, Socialbrite named OCEF second place in its list of top ten most successful NGOs at Causes.
References
501(c)(3) organizations
Non-profit organizations based in Texas |
Halobellus (common abbreviation: Hbs.) is a genus of halophilic archaea.
References
Euryarchaeota
Taxa described in 2011 |
Steven James Janaszak (born January 7, 1957) is an American former ice hockey goaltender who played three games in the National Hockey League (NHL) with the Minnesota North Stars and Colorado Rockies between 1980 and 1982.
Amateur career
Janaszak first became known in the hockey world as the star goaltender for Hill-Murray School on the East Side of Saint Paul. Janaszak attended the University of Minnesota where he was a goaltender for the Minnesota Golden Gophers. He was voted most valuable player in the 1979 national championship tournament as the Gophers won the NCAA title. Janaszak is best known for being the back-up goalie to Jim Craig on the Miracle on Ice 1980 U.S. Olympic hockey team that won the gold medal. Janaszak was the only member of the team to not appear in any of the games at the Olympics.
Professional career
Janaszak signed a free agent contract with the North Stars after the Olympics and appeared in one regular season game that season, a solid 2–2 draw against the Buffalo Sabres. Unfortunately for Janaszak, the North Stars already had two quality goaltenders in Gilles Meloche and Gary Edwards, so there was no room for him. After spending the next season in the minor leagues, Janaszak returned to the NHL with the Colorado Rockies, who had signed him as a free agent soon after the end of the 1979-80 season. He also played three games for Team USA as Glenn Resch's backup at the 1982 Ice Hockey World Championship tournament in Helsinki, before retiring from the game after the 1982–83 season.
In popular culture
In the 1981 TV movie about the gold medal-winning U.S. hockey team called Miracle on Ice, Janaszak does not appear as a character, but rather in archival footage of the gold medal ceremony.
He is played by Sam Skoryna in the 2004 Disney film Miracle.
Life outside sports
He met his future wife, who was working as an interpreter during the 1980 Olympics in the athlete village, and they were married a year later. He works as an investment manager on Long Island, N.Y.
Career statistics
Regular season and playoffs
International
Awards and achievements
References
External links
1959 births
1980 US Olympic ice hockey team
American men's ice hockey goaltenders
Baltimore Clippers (1979–81) players
Colorado Rockies (NHL) players
Fort Wayne Komets players
Fort Worth Texans players
Ice hockey people from Saint Paul, Minnesota
Ice hockey players at the 1980 Winter Olympics
Living people
Medalists at the 1980 Winter Olympics
Minnesota Golden Gophers men's ice hockey players
Minnesota North Stars players
Oklahoma City Stars players
Olympic gold medalists for the United States in ice hockey
Tulsa Oilers (1964–1984) players
Undrafted National Hockey League players
Wichita Wind players
NCAA men's ice hockey national champions |
Susan or Sue Brown may refer to:
Susan Brown (mathematician) (1937–2017), British professor of mathematics
L. Susan Brown (born 1959), Canadian anarcha-feminist writer
Susan Brown (minister) (born 1958), Scottish minister
Susan Brown (English actress) (born 1946)
Susan Brown (American actress) (1932–2018)
Susan E. Brown, American medical anthropologist and nutritionist
Sue Brown (cricketer) (born 1958), New Zealand cricketer
Sue Brown (rowing) (born 1958), first woman to take part in The Boat Race (Oxford cox in 1981 and 1982)
Sue Ellen Brown (born 1954), American artist
Sue K. Brown (born 1948), American ambassador to Montenegro
Sue M. Wilson Brown (1877–1941), African-American activist for women's suffrage
Susan Brown (judge), judge of the Supreme Court of Queensland, Australia |
```kotlin
package de.westnordost.streetcomplete.data.osm.edits
import de.westnordost.streetcomplete.data.osm.geometry.ElementGeometry
import de.westnordost.streetcomplete.data.osm.mapdata.ElementKey
import de.westnordost.streetcomplete.data.osm.mapdata.MapDataUpdates
import de.westnordost.streetcomplete.data.preferences.Preferences
import de.westnordost.streetcomplete.util.Listeners
import de.westnordost.streetcomplete.util.ktx.nowAsEpochMilliseconds
import de.westnordost.streetcomplete.util.logs.Log
class ElementEditsController(
private val editsDB: ElementEditsDao,
private val editElementsDB: EditElementsDao,
private val elementIdProviderDB: ElementIdProviderDao,
private val prefs: Preferences
) : ElementEditsSource, AddElementEditsController {
/* Must be a singleton because there is a listener that should respond to a change in the
* database table */
private val listeners = Listeners<ElementEditsSource.Listener>()
/* ----------------------- Unsynced edits and syncing them -------------------------------- */
/** Add new unsynced edit to the to-be-uploaded queue */
override fun add(
type: ElementEditType,
geometry: ElementGeometry,
source: String,
action: ElementEditAction,
isNearUserLocation: Boolean
) {
Log.d(TAG, "Add ${type.name} for ${action.elementKeys.joinToString()}")
add(ElementEdit(0, type, geometry, source, nowAsEpochMilliseconds(), false, action, isNearUserLocation))
}
override fun get(id: Long): ElementEdit? =
editsDB.get(id)
override fun getAll(): List<ElementEdit> =
editsDB.getAll()
override fun getAllUnsynced(): List<ElementEdit> =
editsDB.getAllUnsynced()
fun getOldestUnsynced(): ElementEdit? =
editsDB.getOldestUnsynced()
fun getIdProvider(id: Long): ElementIdProvider =
elementIdProviderDB.get(id)
/** Delete old synced (aka uploaded) edits older than the given timestamp. Used to clear
* the undo history */
fun deleteSyncedOlderThan(timestamp: Long): Int {
val deletedCount: Int
val deleteEdits: List<ElementEdit>
synchronized(this) {
deleteEdits = editsDB.getSyncedOlderThan(timestamp)
if (deleteEdits.isEmpty()) return 0
val ids = deleteEdits.map { it.id }
deletedCount = editsDB.deleteAll(ids)
editElementsDB.deleteAll(ids)
}
onDeletedEdits(deleteEdits)
/* must be deleted after the callback because the callback might want to get the id provider
for that edit */
elementIdProviderDB.deleteAll(deleteEdits.map { it.id })
return deletedCount
}
override fun getUnsyncedCount(): Int =
editsDB.getUnsyncedCount()
override fun getPositiveUnsyncedCount(): Int {
val unsynced = editsDB.getAllUnsynced().map { it.action }
return unsynced.filter { it !is IsRevertAction }.size - unsynced.filter { it is IsRevertAction }.size
}
fun markSynced(edit: ElementEdit, elementUpdates: MapDataUpdates) {
val idUpdatesMap = elementUpdates.idUpdates.associate {
ElementKey(it.elementType, it.oldElementId) to it.newElementId
}
val syncSuccess: Boolean
synchronized(this) {
val editIdsToUpdate = elementUpdates.idUpdates.flatMapTo(HashSet()) {
editElementsDB.getAllByElement(it.elementType, it.oldElementId)
}
for (id in editIdsToUpdate) {
val oldEdit = editsDB.get(id) ?: continue
val updatedEdit = oldEdit.copy(action = oldEdit.action.idsUpdatesApplied(idUpdatesMap))
editsDB.put(updatedEdit)
// must clear first because the element ids associated with this id are different now
editElementsDB.delete(id)
editElementsDB.put(id, updatedEdit.action.elementKeys)
}
syncSuccess = editsDB.markSynced(edit.id)
}
if (syncSuccess) onSyncedEdit(edit.copy(isSynced = true))
elementIdProviderDB.updateIds(elementUpdates.idUpdates)
}
fun markSyncFailed(edit: ElementEdit) {
delete(edit)
}
/* ----------------------- Undoable edits and undoing them -------------------------------- */
/** Undo edit with the given id. If unsynced yet, will delete the edit if it is undoable. If
* already synced, will add a revert of that edit as a new edit, if possible */
fun undo(edit: ElementEdit): Boolean {
if (edit.isSynced) {
// already uploaded
val action = edit.action
if (action !is IsActionRevertable) return false
// first create the revert action, as ElementIdProvider will be deleted when deleting the edit
val reverted = action.createReverted(getIdProvider(edit.id))
Log.d(TAG, "Add revert ${edit.type.name} for ${edit.action.elementKeys.joinToString()}")
// need to delete the original edit from history because this should not be undoable anymore
delete(edit)
// ... and add a new revert to the queue
add(ElementEdit(0, edit.type, edit.originalGeometry, edit.source, nowAsEpochMilliseconds(), false, reverted, edit.isNearUserLocation))
} else {
// not uploaded yet
Log.d(TAG, "Undo ${edit.type.name} for ${edit.action.elementKeys.joinToString()}")
delete(edit)
}
return true
}
/* ------------------------------------ add/sync/delete ------------------------------------- */
private fun add(edit: ElementEdit) {
synchronized(this) {
editsDB.put(edit)
editElementsDB.put(edit.id, edit.action.elementKeys)
val createdElementsCount = edit.action.newElementsCount
elementIdProviderDB.assign(
edit.id,
createdElementsCount.nodes,
createdElementsCount.ways,
createdElementsCount.relations
)
}
onAddedEdit(edit)
}
private fun delete(edit: ElementEdit) {
val edits = mutableListOf<ElementEdit>()
val ids: List<Long>
synchronized(this) {
edits.addAll(getEditsBasedOnElementsCreatedByEdit(edit))
ids = edits.map { it.id }
editsDB.deleteAll(ids)
editElementsDB.deleteAll(ids)
}
onDeletedEdits(edits)
/* must be deleted after the callback because the callback might want to get the id provider
for that edit */
elementIdProviderDB.deleteAll(ids)
}
private fun getEditsBasedOnElementsCreatedByEdit(edit: ElementEdit): List<ElementEdit> {
val result = mutableListOf<ElementEdit>()
val createdElementKeys = elementIdProviderDB.get(edit.id).getAll()
val editsBasedOnThese = createdElementKeys
.flatMapTo(HashSet()) { editElementsDB.getAllByElement(it.type, it.id) }
.mapNotNull { editsDB.get(it) }
.filter { it.id != edit.id }
// deep first
for (e in editsBasedOnThese) {
result += getEditsBasedOnElementsCreatedByEdit(e)
}
result += edit
return result
}
/* ------------------------------------ Listeners ------------------------------------------- */
override fun addListener(listener: ElementEditsSource.Listener) {
listeners.add(listener)
}
override fun removeListener(listener: ElementEditsSource.Listener) {
listeners.remove(listener)
}
private fun onAddedEdit(edit: ElementEdit) {
prefs.lastEditTime = nowAsEpochMilliseconds()
listeners.forEach { it.onAddedEdit(edit) }
}
private fun onSyncedEdit(edit: ElementEdit) {
listeners.forEach { it.onSyncedEdit(edit) }
}
private fun onDeletedEdits(edits: List<ElementEdit>) {
listeners.forEach { it.onDeletedEdits(edits) }
}
companion object {
private const val TAG = "ElementEditsController"
}
}
``` |
```ruby
# frozen_string_literal: true
require "spec_helper"
module Decidim
module Comments
describe LeaveUserGroup do
describe "call" do
let(:organization) { create(:organization) }
let(:membership) { create(:user_group_membership, role:) }
let(:role) { :admin }
let(:user) { membership.user }
let(:user_group) { membership.user_group }
let(:command) { described_class.new(user, user_group) }
context "when the user is the creator" do
let(:role) { :creator }
it "broadcasts last admin cannot leave group" do
expect { command.call }.to broadcast(:last_admin)
end
context "and there is another admin in the group" do
let!(:another_membership) { create(:user_group_membership, user_group:, role: :admin) }
it "broadcasts ok" do
expect { command.call }.to broadcast(:ok)
end
end
context "and there is another member in the group" do
let!(:another_membership) { create(:user_group_membership, user_group:, role: :member) }
it "does not allow last admin to leave the group" do
expect { command.call }.to broadcast(:last_admin)
end
end
end
context "when the user has no membership with the group" do
let(:user) { create(:user) }
let(:user_group) { create(:user_group) }
it "broadcasts invalid" do
expect { command.call }.to broadcast(:invalid)
end
end
context "when the data is valid" do
let(:role) { :member }
it "broadcasts ok" do
expect { command.call }.to broadcast(:ok)
end
it "deletes the membership" do
membership
expect do
command.call
end.to change(Decidim::UserGroupMembership, :count).by(-1)
expect do
membership.reload
end.to raise_error(ActiveRecord::RecordNotFound)
end
end
end
end
end
end
``` |
The 1909–10 season was the 33rd Scottish football season in which Dumbarton competed at national level, entering the Scottish Football League, the Scottish Cup and the Scottish Qualifying Cup. In addition Dumbarton played in the Dumbartonshire Cup.
Story of the season
August
On 16 August Dumbarton opened the season at Boghead with a friendly against county champions Renton. The team lined up as follows: Forrester (goal); Muirhead and Gordon (full backs); Hynds, Lipton and Kane (half backs) and Ritchie, Brander, Gibson, NcNee and Hill (forwards). Two Brander goals were enough to see the home side began the season with a win.
The opening league tie of the season was played at Boghead on 21 August against Vale of Leven. Hill came in to replace Gibson at centre forward and new signing Spence took over at inside left. The new man scored the opener, but Vale equalised. Dumbarton had the chance to win late on from a penalty and while Ritchie scored, the kick was ordered to be retaken, and he was unable to repeat the task. The game finished 1-1.
The second league fixture was against Raith Rovers a week later at Kirkcaldy. Gordon replaced Kane at left half and O’Neill stepped in at left back, while Hill went to the left wing and Gibson returned at centre forward. Both teams played attacking football, but Raith scored first after a Forrester blunder in goals. Brander equalised before half time but it was the home side who snatched both points with the winning goal in the second half.
September
On 4 September Dumbarton commenced their Qualifying Cup campaign at Millburn Park against the current holders Vale of Leven. An unchanged side took to the field and began strongly with Hill scoring after 20 minutes. Ritchie scored a second in the second half, and despite the Vale replying with a goal five minutes from time the Sons held on to win 2–1.
It was back to league business a week later as Arthurlie were the visitors to Boghead. For the third week running the same team was fielded and despite having the better of the opening play it was Arthurlie who scored first. Hill however replied within five minutes, and at the interval the scores were level. Spence gave Dumbarton back the lead and then Arthurlie equalised once more. However, the Sons had the last word as Ritchie scored the winner in a 3–2 victory.
On 18 September Johnstone were the opponents at Boghead in the second round of the Qualifying Cup. Again no changes were made to the team. The teams met at the same stage of the competition last season when Dumbarton ran out 4-1 winners and this time they went one better. Hill was first to find the mark and although Johnstone equalised it was one way traffic thereafter with Hill again, Ritchie, Brander and Gibson all scoring in a 5–1 win. Johnstone's task was not helped by one of their backs being hampered by an injury throughout the second half.
During the week Dumbarton signed former internationalist Finlay Speedie (ex Bradford Park Avenue) and goalkeeper Jim McCormick (ex Arthurlie) and both featured in the league match against St Bernards on 25 September at the Gymnasium. Hynds made way for Speedie, while Gordon replaced Muirhead in the back line with Kane taking over at left half. The home side went into the lead within two minutes, but Gibson equalised and that was all the scoring at half time. The Sons continued to press for a winner in the second half but were unable to break the Saints defence and were caught by a breakaway goal and lost by 2–1.
After four games Dumbarton found themselves down in 9th place in the league with just 3 points – Cowdenbeath led with 9 points from 5 played.
October
On 2 October Dykehead were Dumbarton's opponents in the third round of the Qualifying Cup at Boghead. Muirhead and Hynds returned to the team. New boy Speedie netted his first of the season followed by a second from Gibson. Although the visitors got a goal back before the interval, Brander scored Dumbarton's third just a minute into the second half, and with no further goals the Sons won 3–1.
The following week Dumbarton commenced their county cup programme with a home game against Lennox Amateurs. A couple of squad changes were made with Gordon replacing O’Neil in the back line and McNee coming back in place of Gibson at centre forward. The match was a one-sided affair with Dumbarton handing out a 8-0 thrashing. McNee scored four of the goals, Brander had a hat trick, and Spence got the other.
Dumbarton were drawn away to play Bo’ness in the fourth round of the Qualifying Cup on 16 October. An unchanged side was selected. The game was a closely contested affair with only a single goal separating the teams – Ritchie (under the pseudonym Murray) scoring just before half time. McNee was injured and retired with ten minutes of the match to go and Bo’ness missed a penalty.
On 23 October it was back to league business with a home match against Abercorn. During the week Dumbarton had signed half back Willie Lithgow (ex Glasgow Perthshire) and forward David Anderson (ex Ayr). Lithgow replaced Gordon at left back with Gordon being played at right half and Anderson took the place of the injured McNee. In another tough tussle, the goals came in a five-minute spell just after the interval with Hill opening for the Sons and Abercorn equalising – the match ending in a 1–1 draw.
Ayr were next up on 30 October in the last eight of the Qualifying Cup. A number of changes were made to the team – Hynds and Gibson returned in place of Lithgow and Spence respectively. Returnee Gibson struck the only goal which took Dumbarton through to the semi-final.
As October came to a close Dumbarton found themselves at the foot of the league table with 4 points from five matches played – but with games in hand over their nearest challengers. Raith Rovers led the way with 11 points.
November
Albion Rovers were the hosts in a league fixture on 6 November. Three changes were made to the team, Lithgow in the defence, Lipton in the half back line and Spence in the attack all returned. The match turned out to be a disappointing one for Dumbarton as the Rovers left wing was in sparking form scoring a hat trick. Brander got a goal back but the game finished in a 3–1 defeat.
On 13 October Dumbarton travelled to line up against Bathgate in the semi-final of the Qualifying Cup. More changes were made by the selection committee with the return of O’Neil, Gordon and Anderson. As expected the match was a close contest but the Sons found the Bathgate defence in their best form. Bathgate scored late in the first half but despite chances at both ends this was to be the only score.
Dumbarton resumed league duty on 20 October with the return fixture against Vale of Leven at Millburn Park. Arthur Urquhart had joined the Sons from Johnstone and he was added to the team on the right wing. In the first half Speedie then Brander had Dumbarton two goals to the good, but Vale rallied and had equalised before half time. Vale continued to pressurise the Sons defence in the second half and took the lead, only for Speedie to equalise from a penalty kick. Vale lost their keeper to injury ten minutes from time but held out for a 3–3 draw.
A week later Dumbarton were at home to play Ayr in the league. Kane replacing Anderson at left half was the only team change. The visitors began brightly but rarely tested McCormick in goals. Play switched to the other end and Lipton scored for Dumbarton but Ayr came back to equalise just before half time. This was the state of affairs with 20 minutes to go but a change in the attack by Dumbarton with Hill switching to centre forward had the desired effect as first Brander and then Hill scored for a 3–1 win.
At the end of the month Dumbarton had lifted themselves off the bottom of the league table with 7 points from 8 games played – Raith maintained the lead with 16 points.
December
It was another league match on 4 December as Dumbarton travelled to take on Arthurlie. Lithgow replaced Kane and Gibson took over the centre forward's position from Lipton. The home side were quickly into their stride and scored within five minutes, although Anderson then Brander had the Sons in the lead before half time. No further scoring took place, and Dumbarton took the win 2-1 and both points.
On 11 December Albion Rovers came to Boghead to fulfil their return league fixture. Lipton was the only change coming back in place of Hill. Both teams played well on a difficult surface and had chances with no scoring taking place at half time. Rovers lost a player due to injury and played the whole of the second half with 10 men, but Dumbarton failed to find a way through and the game ended in a 0–0 draw.
A week later it was a trip to Falkirk to play East Stirling in the league. O’Neil returned to the defence as did captain Hill to the attack. The game started in favour of the Sons with Gibson scoring twice to give Dumbarton an early 2–0 lead. The Shire came back to score their first goal and shortly thereafter Brander was injured and could take no further part in the game. Just before the interval East Stirling equalised. The ten-man Dumbarton side could not prevent a further shire goal and the game was lost by 3–2.
On Christmas Day Dumbarton were in Fife to play their league fixture against Cowdenbeath. The only change to the team was Lipton returning at centre half. The first goal was a strange one as a Cowdenbeath player was charged and the whistle went. Everyone stopped apart from Hill who ran on and scored easily. Despite protests the score stood. Then before the interval Brander scored. Although the Fifers came back with a goal Speedie wrapped things up from a penalty for a 3–1 win.
The final game of the year was a benefit for long-serving player Bob Gordon against Vale of Leven on 31 December. The game was won by the Vale by 1–0.
As 1909 came to an end Dumbarton had improved another place in the league to 10th with 12 points from 12 games – Raith were still top with 23 points.
January
On New Year's Day Dumbarton welcomed league leaders Raith Rovers to Boghead. Gordon replaced Lipton in an otherwise unchanged team. The Sons had an easy time of it and were 4-0 up by half time – captain Hill adding another 2 to his season's total. Due to injury Raith played all of the second half with 10 men, but despite continued pressure their defence held firm, and late in the game scored a consolation goal from the penalty spot.
Two days later Dumbarton Harp were the visitors to Boghead in a county cup tie. On the day goals by Hill and Speedie were sufficient for a 2–1 win.
On 5 January Dumbarton played at Renton in a benefit match for one of the Renton players and with both sides playing under strength teams the home side came out on top 4–3.
After their New Year games, Dumbarton's next competitive match was at home on 15 January in the league against Leith Athletic. New signing Alister Gordon (ex Hearts) was introduced on the right wing. Dumbarton started the better and were a goal ahead at the interval. The pressure from the Sons continued until 15 minutes from the end when both Ritchie and Urquhart had to retire injured. Leith took full advantage and scored late on for a 1–1 draw.
A week later Dumbarton faced their toughest challenge for a number of years as Celtic were the visitors in the first round of the Scottish Cup. A team reshuffle was required to accommodate the cup-tied Urquhart with Muirhead returning. The Sons showed up well in the early stages and only a goalkeeping mistake by McCormick had the Celts a goal ahead at the interval. In the second half Dumbarton pushed forward, and new boy Alister Gordon pulled them level. But just as a draw seemed likely Celtic scored a late winner.
Dumbarton's league match against Ayr on 29 January was postponed due to bad weather.
So at the end of January Dumbarton continued to climb the league table – now in 7th place with 15 points from 14 matches played. Raith remained leaders with 23 points.
February
On 5 February Ayr Parkhouse were at Boghead to fulfil their first league fixture of the season against Dumbarton. Forrester and Urquhart took the places of injured McCormick and Hill. The game turned out to be an easy one for the Sons who were two ahead within 6 minutes. A penalty just before half time was followed by two more in the second half for a comprehensive 5–0 victory.
A week later Dumbarton travelled to Paisley to play Abercorn in the league. Speedie made way for the returning Hill. In the first half the play was fairly even, but the Sons managed to reach the interval with a 2–1 lead. The second half however was all Abercorn as they added four goals for a 5–2 win.
St Bernards were the visitors to Boghead on 19 February for their return league match. After the previous week's showing changes were made with McCormick, Speedie and Kane returning to the team. During the game, a howling gale blew down the pitch. It was not until 15 minutes from the end that Dumbarton, playing with the wind, scored the winner.
On 26 February the return fixture against Ayr Parkhouse was played. Lipton and Ritchie returned to the team. Only three weeks previously the Sons had easily disposed of the Parkies at Boghead, but nevertheless Parkhouse produced the performance of their season so far. Despite going a goal down early on, they played confidently throughout and went on to win 4–2.
February ended with Dumbarton improving to 6th place in the league with 19 points from 18 games played. Still it was Raith at the top with 26 points.
March
Dumbarton played their third county cup fixture on 5 March at Boghead against cup holders Renton. Bob Gordon and Speedie returned to the team. The match was a tough encounter with the referee having a busy time. Half time arrived goalless but Hill put the Sons ahead after 65 minutes. Shortly thereafter the Sons were awarded a penalty, and so infuriated was the Renton half back that he kicked the ball away. When he refused to retrieve it he was ordered from the field. The penalty kick was scored, and a third late in the game gave Dumbarton a 3–0 win.
On 12 March Dumbarton travelled to Edinburgh to play Leith Athletic in the league. The only change to the team was Urquhart taking Brander's place at inside right. A bright start by the Sons was rewarded by an Alister Gordon goal and this lead was held till just before half time when Leith equalised. The home team opened the second half strongly and went ahead early on. Dumbarton's problems were increased when Ritchie retired from the field injured, and despite chances at both ends the game finished at 2–1 in favour of Leith.
A week later Dumbarton were on their travels again this time to play Ayr in their return league fixture. The selectors refreshed the attack line with Brander, Urquhart and Gibson coming back into the team. The Sons had already beaten Ayr twice during the season, but it was to be third time lucky for Ayr, and with an early goal the home side dominated the play to run out 3-1 winners.
Dumbarton played their first away tie in the county cup competition on 26 March with a game against Vale of Leven. Bob Gordon returned to left back whilst Ritchie came back on the left wing. The game was a close contest from start to finish, but Dumbarton found the Vale keeper unbeatable, and the game ended in a 0–0 draw.
The league at the end of the month showed new leaders with Leith Athletic taking over at the top with 30 points. Dumbarton had slipped to 7th with 19 points from the 20 matches played.
April
Dumbarton played their penultimate league match at home against Cowdenbeath on 2 April. Lipton and Urquhart were back in the team in place of Lithgow and Alister Gordon. Speedie scored in the first half for the Sons but later had to retire injured. In the second half Dumbarton also lost Ritchie to injury, but the nine men held out for a 1–0 win, with Cowdenbeath missing a late penalty.
After a free weekend, Dumbarton returned to county cup qualification with the return tie against Vale of Leven at Boghead. Alister Gordon took injured Ritchie's place in the team. The Sons led twice in the first half only for the Vale to equalise both times but in the second half a further two goals for Dumbarton settled the issue for a 4–2 win.
The following Tuesday evening Dumbarton visited Meadow Park for the return county cup fixture against Dumbarton Harp. Lithgow and Gibson returned to the team that fought out a goalless draw.
Then two days later the final qualifying tie of the county cup was played against Renton at Tontine Park. Having already booked their place in the final Dumbarton played a couple of trialists and in the end lost their first game of the competition.
On 23 April the final league game of the season was played at Boghead against East Stirling. Ritchie returned from injury and Gibson was also brought back into the team. While the Shire equalised an early Hill goal, from then on it was all Dumbarton as they piled on four more goals before East Stirling scored a late consolation – the game ending in a 5–2 win. The result raised Dumbarton to finish in 4th place with 23 points from their 22 games.
The final game of the season took place on 30 April at Tontine Park. Dumbarton Harp were the opponents in the county cup final. The Harp had been having a great season doing well in both the Qualifying and Consolation Cups while at the same time had won the Union league. Dumbarton fielded a full strength team. No goals were scored by half time, despite numerous chances for both sides. Hill opened the scoring for Dumbarton but the Harp came back and scored twice before the final whistle and so for the fifth successive season Dumbarton were runners up.
May
Leith Athletic won the Second Division title but decided not to put their names forward for election to the top fight. Dumbarton, along with runners up Raith Rovers, Ayr and Abercorn went into the election together with Morton having finished second to bottom of the First Division. Port Glasgow Athletic had finished at the bottom and resigned from the league with Raith taking their place – full results as follows:
Match results
Scottish League
Scottish Cup
Scottish Qualifying Cup
Dumbartonshire Cup
League table
Friendlies and other matches
Player statistics
|}
Source:
Transfers
Players in
Players out
Source:
In addition Edward Kane, John O'Neill and Daniel Forrester played their final 'first XI' games in Dumbarton colours.
References
Dumbarton F.C. seasons
Scottish football clubs 1909–10 season |
Usta wallengrenii is a species of moth in the family Saturniidae. It is found in Ethiopia, Kenya, Namibia and South Africa.
References
Moths described in 1859
wallengrenii
Moths of Africa |
Robert Schollum (22 August 1913 – 30 September 1987) was an Austrian composer, conductor, music educator, music critic, musicographer and academic scholar. He was president of the for several years in the 1960s and 1980s.
Life and career
Education
Born in Vienna, Schollum studied composition with Joseph Marx, music theory with Egon Lustgarten and organ and piano with Carl Lafite at the Neues Wiener Konservatorium and the University of Music and Performing Arts Vienna. He taught as assistant to Anton Maria Klafsky at the New Vienna Conservatory and gave piano lessons at the Conservatory for Folk Music.
National Socialism
In 1932, Schollum joined the Hitler Youth, later also the SA. From 1933, he performed as a conductor. From 1939 to 1945, he did military service with the Wehrmacht, and after being wounded, he served as a purser on the Russian Front. In addition, he worked as a pianist, conductor and choir director for the Hitler Youth and was a district commissioner of the Reich Chamber of Music for music education. After the airstrike of his Vienna flat in 1944, he moved to Ottensheim near Linz.
Career after the Second World War
From 1945, Schollum was choirmaster at the Old Cathedral, Linz and also directed the Ignatius Choir, the Sängerbund "Frohsinn" and the Linz Chamber Orchestra. In 1946, he became head of the Linz Municipal Music Directorate, in 1952 music advisor to the Department of Culture and in 1953 municipal music director. He founded the Linz section of the International Society for New Music, whose "Arnold Schönberg Medal" he received in 1953.
From 1955, Schollum conducted the Vienna City Serenade, in the same year he founded the . In 1956, he became regional choir master of the . In Linz as well as in Vienna he made radio broadcasts on a case-by-case basis.
In 1958 he was awarded the , the following year he was appointed Professor of Lied and Oratorio at the University of Music and Performing Arts Vienna; he held this post until 1983. In 1960, he was awarded the Honorary Prize of the Federal Ministry of Education, Science and Culture for outstanding achievements in the field of popular education; in 1961, he received the State Prize for Music and in 1971 the .
From 1963, Schollum was the national choir director of the Workers' Singers' Association. From 1965 to 1969 and from 1983 to 1984, he was president of the Austrian Composers' Association. In 1973, he was made an honorary member. In 1978, he was awarded the Austrian Decoration for Science and Art and the in gold.
Schollum died in Vienna at the age of 74. He is buried in an honorary grave (group 40, number 157) at the Vienna Central Cemetery.
Work
Already as a student, Schollum composed more than 100 Volkslied movements. Later, his compositions were first in the tradition of Claude Debussy, then in that of Béla Bartók and Darius Milhaud. In the 1950s, he then moved on to partly tonally bound serial compositions. His oeuvre encompasses almost all genres from instrumental solo works, chamber music, choral works and songs to instrumental concertos and symphonies. His estate is housed in the music collection of the Austrian National Library.
Publications
Musik in der Volksbildung (1959)
Egon Wellesz (1964)
Das kleine Wiener Jazzbuch (1969)
Die Wiener Schule (1969)
Das österreichische Lied des 20. Jahrhunderts (1977)
References
External links
Robert Schollum im Musiklexikon der Österreichischen Akademie der Wissenschaften
Christian Heindl: Robert Schollum, KDG – Komponisten der Gegenwart, in Munzinger-Archiv ([https://www.munzinger.de/search/go/document.jsp?id=17000000754 Start of article freely available)
Regina Thumser: Robert Schollum. 2008, [https://austria-forum.org/af/AEIOU/Schollum,_Robert pdf on Austria-Forum
20th-century Austrian composers
20th-century Austrian male musicians
Austrian conductors (music)
Austrian music educators
University of Music and Performing Arts Vienna alumni
Academic staff of the University of Music and Performing Arts Vienna
Recipients of the Austrian Cross of Honour for Science and Art
1913 births
1987 deaths
Musicians from Vienna |
Michal Plocek (born 17 April 1994 in Uherské Hradiště; dead 28 November 2016 in Prague) was a Czech rower.
He won the gold medal at the 2012 World Rowing Junior Championships.
He participated at the 2015 World Rowing Championships.
References
External links
World Rowing
1994 births
2016 deaths
Czech male rowers |
SS Sirdhana was one of the larger S-class passenger ships of the British India Steam Navigation Company. The ship entered service in 1947 and was scrapped in Taiwan in 1972.
References
External links
Ships of the British India Steam Navigation Company
1947 ships |
David Egan is a retired American soccer player. He played professionally in the North American Soccer League and Major Indoor Soccer League.
Egan attended Yale University, playing on the men’s soccer team from 1975 to 1977. On May 5, 1978, the New England Tea Men of the North American Soccer League signed Egan. The Tea Men released Egan on December 23, 1978. Egan then signed with the Pittsburgh Spirit of the Major Indoor Soccer League.
External links
Career stats
References
Living people
American men's soccer players
Major Indoor Soccer League (1978–1992) players
New England Tea Men players
North American Soccer League (1968–1984) players
Pittsburgh Spirit players
Yale Bulldogs men's soccer players
Men's association football defenders
Year of birth missing (living people) |
Bolland & Bolland are two Dutch music producers and brothers, Rob Bolland (born 17 April 1955) and Ferdi Bolland (born on 5 August 1956). They were born in Port Elizabeth in South Africa.
Career
They produced and wrote for such artists as Falco (including his Number 1 hit "Rock Me Amadeus"), Samantha Fox ("Love House"), and wrote the Status Quo hit "In the Army Now" – which they released under their own name in 1981 and which was also recorded by Gerard Joling. As musicians in their own right, they released their first album "Florida" in 1972.
Their hit singles career started as early as 1972, with "Summer of '71" in a folk, a cappella-style following the success of Simon and Garfunkel and their Dutch equivalents Greenfield and Cook. When, in 1976, their success started to wane, they turned towards a more electronic sound, an early example of which can be heard in "Spaceman", a 1978 hit in the Netherlands.
Outside the Netherlands, they shortened their name to Bolland and established their name internationally with the release of the concept album The Domino Theory. The edgy, tuneful album is a critical look at war and US intervention in foreign conflicts from the viewpoint of the foot soldier. It contains the single "In the Army Now", which reached number 1 in Norway and held the top spot for six consecutive weeks. In South Africa, the single peaked at number 9 in May 1982, boosted by increased conscription due to the South African Border War. Francis Rossi, lead singer of Status Quo, is widely quoted as having heard the song while on the Autobahn in Germany. He eventually persuaded Quo to record it, and the single reached number 2 in the UK in 1986.
They are the owners of Bolland Studios, located in Blaricum, in the Dutch countryside. It was one of the first studios in the Netherlands to host an SSL SL4040 E Series.
In 1984 they released the album Silent Partners. The biggest hit from this album was called "Ten American Girls". Subsequent albums followed through the 1990s. In 1997, Daniella's Daze released an electronic rock album called Slut on the heavy metal label Roadrunner Records. The Bolland brothers produced, arranged and mixed, with lyrics by them and Australian singer Daniella Porsius. The only single, "100% Jesus", received good radio airplay in Australia, but no further releases by the collective followed.
Discography
Albums
1972 – Florida
1973 – Greatest Hits
1974 – The Best
1975 – Bolland & Bolland
1981 – The Domino Theory
1984 – Silent Partners
1987 – Brotherology
1990 – Pop Art
1991 – Dream Factory
1991 – The Bolland Project (Darwin the Evolution)
1995 – Pure
1996 – Good for Gold (Best of 1972–1978)
2017 – The Golden Years of Dutch Pop Music
Singles
1972 – "Summer of '71"
1972 – "Wait for the Sun"
1972 – "Florida"
1973 – "Ooh La La"
1973 – "Leaving Tomorrow"
1973 – "I Won't Go Anywhere"
1974 – "Mexico, I Can't Say Goodbye"
1974 – "Train to Your Heart"
1974 – "Dream Girl"
1975 – "You Make Me Feel So High"
1975 – "Holiday"
1976 – "Souvenir"
1976 – "The Last Apache"
1977 – "Time of Your Life"
1978 – "Spaceman"
1978 – "UFO (We're Not Alone)"
1978 – "Hold On"
1979(?) – "Liverpool Eyes"
1979 – "Melodrama"
1980 – "The Music Man"
1980 – "Way Back in the Sixties"
1981 – "In the Army" / "Let's Help A.R.V.I.N. Out" / "The Domino Theory Theme"
1982 – "Cambodia Moon"
1983 – "Heaven Can Wait" / "You're in the Army Now" (Special New Extended Version)
1984 – "Ten American Girls" / "Night of the Shooting Stars"
1984 – "Tora Tora Tora" (released under the name Numero Uno)
1984 – "Imagination" / "Night of the Shooting Stars" (A&M Records)
1984 – "Imagination" / "The Boat" (F1 Team)
1984 – "Imagination" / "Feels So Good" (Teldec)
1985 – "The Boat" / "A Bordo" / "Le Bateau / Das Boot"
1985 – "The Boat" (Remix) / "All Systems Go Go"
1987 – "Tears of Ice" / "Tears of Ice" (Instrumental)
1987 – "Best Love of My Life" / "Rhapsody in Rock"
1988 – "And the World Turns On" (Remixes)
1989 – "The Wall Came Tumbling Down" (Remixes) / "Stormwarning"
1990 – "Charge of the Love Brigade" (Club Mix)
1991 – "The Lost Boys" / "Monty – A Place in the Sun"
1991 – "Broadcast News" / "Hollywood Kids"
1991 – "A Man Man with a Vision Dream Factory" / "Summer of '71" (Live-Version)
1992 – The Bolland Project – "Stand Up" / "Is It Really True"
1992 – The Bolland Project – "Emma My Dear" / "For a Moment in Time"
1992 – The Bolland Project – "Hey Charly" / "For a Moment in Time"
1994 – "Love Somebody Now" / "Let's Fly" / "No More Lies"
1994 – "The Good Die Young"
1995 – "You're in the Army Now" [Maxi-Single]
1995 – "A Few Good Men" (Live-Version & Sing Along Version)
1996 – "A Night with Sharon Stone" / "Timemachine"
1997 – "You're in the Army Now" (Remixes)
1998 – The Bolland Project – "Tribute to Falco" / "We Say Goodbye" / "So Lonely"
Productions
Singles
1975 – Ginny Royce – "Wonderboy" / "If the World Needs Love"
1984 – Numero Uno – "Tora Tora Tora" / "Tiger" (Instrumental)
1985 – Numero Uno – "Madonna" / "Madonna" (Instrumental)
1986 – Alexander Robinson – "Perfection" / "It's Paradise"
1986 – Bon Bon – "My Boyfriend's Back in Town" / "Mechanical Disco"
1986 – Amii Stewart – "Break These Chains"
1987 – Numero Uno – "Tattoo" / "Tattoo" (Instrumental)
1987 – Roger Chapman – "The Drum" / "Red Moon & New Shoes"
1988 – Frank Boyen – "Heut´ Nacht" / "Lass Mich Allein"
1988 – Suzy Quatro – "We Found Love"
1988 – Samantha Fox – "Love House"
1988 – Johnny Logan – "Lonely Lovers" / "(Love You) Just a Little Bit More"
1989 – Amanda Redington – "Fatal Attraction"
1989 – Suzi Quatro – "Baby You're a Star"
1989 – Vicky Larraz – "Besame (Superman)"
1989 – Shaun Cassidy – "Memory Girl"
1991 – Suzi Quatro – "Kiss Me Goodbye"
1991 – Marvin & Marcello – "Guess I'm In Love"
1992 – Goddess – "Sexual"
1993 – Goddess – "In My Bed"
1993 – Goddess – "Je t'aime"
1993 – Goddess – "Get Loud (Racism Beat It)"
1994 – Goddess – "Spirits in the Night"
1994 – Goddess – "Tapdancer (I Wanna See You Mooove)"
1994 – Ahmex – "Paparazzi!"
1995 – Fancy – "I Can Give You Love"
1995 – Ahmex – "Girl"
1997 – WOW! – "Keer Op Keer"
1997 – WOW! – "Zomer"
1997 – WOW! – "Lekker Lang Lekker"
1997 – Daniella's Daze – "100% Jesus"
1998 – Hard Blauw – "De Wereld Is Van Jou"
1998 – WOW! – "Big Beat Boy"
1998 – Ian Gillan & Ray Slijngaard – "Smoke on the Water (Rock 'N' Rap Extravaganza)"
1998 – So Cheeky – "Super Model"
1999 – Dana International – "Free"
1999 – WOW! – "The Night Before You Came" / "Music Box Lover"
2000 – Follow That Dream – "Follow That Dream"
2000 – Rob Bolland & Brigitte Kaandorp & Babs Boys & V.I.G. – "Hoeveel Vrouwen"
Albums
1985 – Numero Uno – Uno
1985 – Falco – Falco 3
1986 – Falco – Emotional
1986 – Amii Stewart – Amii
1987 – Roger Chapman – Techno-Prisoners
1988 – Samantha Fox – I Wanna Have Some Fun (two tracks)
1988 – Falco – Wiener Blut
1989 – Rudi Carell Show – one track: "Laß dich überraschen"
1989 – Vicky Larraz – Huracan (four tracks, "Besame", "Cables de alta tensión", "Celos", "Solo promesas")
1991 – Suzi Quatro – Oh, Suzi Q (included new version of "We Live Forever" from the Brotherlogy album)
1992 – Goddess – The Sexual Album
1992 – Falco – Nachtflug
1995 – Fancy – Blue Planet Zikastar
1995 – Ahmex – The Wicked Album
1996 – Herman Brood – 50 The Soundtrack
1997 – B.E.D.
1997 – WOW! – Wild + Ondeugend
1997 – Daniella's Daze – Slut
1998 – David Vermeulen – Same
1999 – Dana International – Free
1999 – Falco – Verdammt wir leben noch
2000 – Follow That Dream – The Album
2000 – Babs (Soundtrack)
References
External links
from Italian TV musical program: "Discoring" 1985
"Bolland & Bolland Discography"
Living people
Dutch record producers
Dutch male singer-songwriters
Dutch singer-songwriters
People from Port Elizabeth
Sibling duos
South African emigrants to the Netherlands
Year of birth missing (living people)
Nationaal Songfestival contestants |
```javascript
import { CodedError, Platform } from 'expo-modules-core';
import { KeepAwakeEventState } from './KeepAwake.types';
const wakeLockMap = {};
/** Wraps the webWakeLock API path_to_url */
export default {
async isAvailableAsync() {
if (Platform.isDOMAvailable) {
return 'wakeLock' in navigator;
}
return false;
},
async activate(tag) {
if (!Platform.isDOMAvailable) {
return;
}
const wakeLock = await navigator.wakeLock.request('screen');
wakeLockMap[tag] = wakeLock;
},
async deactivate(tag) {
if (!Platform.isDOMAvailable) {
return;
}
if (wakeLockMap[tag]) {
wakeLockMap[tag].release?.();
delete wakeLockMap[tag];
}
else {
throw new CodedError('ERR_KEEP_AWAKE_TAG_INVALID', `The wake lock with tag ${tag} has not activated yet`);
}
},
addListenerForTag(tag, listener) {
const eventListener = () => {
listener({ state: KeepAwakeEventState.RELEASE });
};
const sentinel = wakeLockMap[tag];
if (sentinel) {
if ('addEventListener' in sentinel) {
sentinel.addEventListener?.('release', eventListener);
}
else {
sentinel.onrelease = eventListener;
}
}
return {
remove: () => {
const sentinel = wakeLockMap[tag];
if (sentinel) {
if (sentinel.removeEventListener) {
sentinel.removeEventListener('release', eventListener);
}
else {
sentinel.onrelease = null;
}
}
},
};
},
};
//# sourceMappingURL=ExpoKeepAwake.web.js.map
``` |
```shell
#!/bin/bash
set -ex
CHPC_CHECK_START_TIMESTAMP="$(date +%s)"
export CHPC_CHECK_START_TIMESTAMP
S3_URL=${S3_URL:="path_to_url"}
BUILD_NAME=${BUILD_NAME:-package_release}
export S3_URL BUILD_NAME
SCRIPT_DIR="$(dirname "$(readlink -f "$0")")"
# Sometimes AWS responds with DNS error and it's impossible to retry it with
# current curl version options.
function curl_with_retry
{
for _ in 1 2 3 4 5 6 7 8 9 10; do
if curl --fail --head "$1"
then
return 0
else
sleep 1
fi
done
return 1
}
# Use the packaged repository to find the revision we will compare to.
function find_reference_sha
{
git -C right/ch log -1 origin/master
git -C right/ch log -1 pr
# Go back from the revision to be tested, trying to find the closest published
# testing release. The PR branch may be either pull/*/head which is the
# author's branch, or pull/*/merge, which is head merged with some master
# automatically by Github. We will use a merge base with master as a reference
# for tesing (or some older commit). A caveat is that if we're testing the
# master, the merge base is the tested commit itself, so we have to step back
# once.
start_ref=$(git -C right/ch merge-base origin/master pr)
if [ "$PR_TO_TEST" == "0" ]
then
start_ref=$start_ref~
fi
# Loop back to find a commit that actually has a published perf test package.
while :
do
# FIXME the original idea was to compare to a closest testing tag, which
# is a version that is verified to work correctly. However, we're having
# some test stability issues now, and the testing release can't roll out
# for more that a weak already because of that. Temporarily switch to
# using just closest master, so that we can go on.
#ref_tag=$(git -C ch describe --match='v*-testing' --abbrev=0 --first-parent "$start_ref")
ref_tag="$start_ref"
echo Reference tag is "$ref_tag"
# We use annotated tags which have their own shas, so we have to further
# dereference the tag to get the commit it points to, hence the '~0' thing.
REF_SHA=$(git -C right/ch rev-parse "$ref_tag~0")
# FIXME sometimes we have testing tags on commits without published builds.
# Normally these are documentation commits. Loop to skip them.
# Historically there were various path for the performance test package,
# test all of them.
unset found
declare -a urls_to_try=(
"$S3_URL/PRs/0/$REF_SHA/$BUILD_NAME/performance.tar.zst"
"$S3_URL/0/$REF_SHA/$BUILD_NAME/performance.tar.zst"
"$S3_URL/0/$REF_SHA/$BUILD_NAME/performance.tgz"
)
for path in "${urls_to_try[@]}"
do
if curl_with_retry "$path"
then
found="$path"
break
fi
done
if [ -n "$found" ] ; then break; fi
start_ref="$REF_SHA~"
done
REF_PR=0
}
chown nobody workspace output
chgrp nogroup workspace output
chmod 777 workspace output
cd workspace
[ ! -e "/artifacts/performance.tar.zst" ] && echo "ERROR: performance.tar.zst not found" && exit 1
mkdir -p right
tar -xf "/artifacts/performance.tar.zst" -C right --no-same-owner --strip-components=1 --zstd --extract --verbose
# Find reference revision if not specified explicitly
if [ "$REF_SHA" == "" ]; then find_reference_sha; fi
if [ "$REF_SHA" == "" ]; then echo Reference SHA is not specified ; exit 1 ; fi
if [ "$REF_PR" == "" ]; then echo Reference PR is not specified ; exit 1 ; fi
# Show what we're testing
(
git -C right/ch log -1 --decorate "$REF_SHA" ||:
) | tee left-commit.txt
(
git -C right/ch log -1 --decorate "$SHA_TO_TEST" ||:
echo
echo Real tested commit is:
git -C right/ch log -1 --decorate "pr"
) | tee right-commit.txt
if [ "$PR_TO_TEST" != "0" ]
then
# If the PR only changes the tests and nothing else, prepare a list of these
# tests for use by compare.sh. Compare to merge base, because master might be
# far in the future and have unrelated test changes.
base=$(git -C right/ch merge-base pr origin/master)
git -C right/ch diff --name-only "$base" pr -- . | tee all-changed-files.txt
git -C right/ch diff --name-only --diff-filter=d "$base" pr -- tests/performance/*.xml | tee changed-test-definitions.txt
git -C right/ch diff --name-only "$base" pr -- :!tests/performance/*.xml :!docker/test/performance-comparison | tee other-changed-files.txt
fi
# Set python output encoding so that we can print queries with non-ASCII letters.
export PYTHONIOENCODING=utf-8
# By default, use the main comparison script from the tested package, so that we
# can change it in PRs.
script_path="right/scripts"
if [ -v CHPC_LOCAL_SCRIPT ]
then
script_path=".."
fi
# Even if we have some errors, try our best to save the logs.
set +e
# Use clickhouse-client and clickhouse-local from the right server.
PATH="$(readlink -f right/)":"$PATH"
export PATH
export REF_PR
export REF_SHA
# Try to collect some core dumps.
# At least we remove the ulimit and then try to pack some common file names into output.
ulimit -c unlimited
cat /proc/sys/kernel/core_pattern
# Start the main comparison script.
{
time $SCRIPT_DIR/download.sh "$REF_PR" "$REF_SHA" "$PR_TO_TEST" "$SHA_TO_TEST" && \
time stage=configure "$script_path"/compare.sh ; \
} 2>&1 | ts "$(printf '%%Y-%%m-%%d %%H:%%M:%%S\t')" | tee compare.log
# Stop the servers to free memory. Normally they are restarted before getting
# the profile info, so they shouldn't use much, but if the comparison script
# fails in the middle, this might not be the case.
for _ in {1..30}
do
killall clickhouse || break
sleep 1
done
dmesg -T > dmesg.log
ls -lath
7z a '-x!*/tmp' /output/output.7z ./*.{log,tsv,html,txt,rep,svg,columns} \
{right,left}/{performance,scripts} {{right,left}/db,db0}/preprocessed_configs \
report analyze benchmark metrics \
./*.core.dmp ./*.core
# If the files aren't same, copy it
cmp --silent compare.log /output/compare.log || \
cp compare.log /output
``` |
The Sid Williams Theatre is a performance theatre in the Comox Valley, Canada. It is in downtown Courtenay, British Columbia. The theatre was first called 'The Gaiety Theatre' in the 1920s. It was then called 'The Bickle Theatre' in the 1930s. It was originally opened as a movie theatre. The stage of the Bickle Theatre was used for plays and musical events before it became an auction house. In 1998, the theatre closed for extensive renovations and earthquake upgrading. The current technical director is Patrick Emery; he has won numerous lighting design awards for his work with the Courtenay Little Theatre. The Sid Williams Theatre created The Blue Circle Series in 2019, a series of online and live concerts spanning from September to early June annually, showcasing professional talent from all over Canada. Blue is the colour of inspiration. The circle celebrates inclusion. It represents the infinite nature of energy. It symbolizes the cycles of time, and the movements of seasons. The circle is sacred to many cultures, and beckons the viewer to be drawn in, like a spotlight on stage.
References
External links
Theatres in British Columbia
Courtenay, British Columbia |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.