text
stringlengths 1
22.8M
|
|---|
The Boteti Regional Football Association Division One League, also known as the BORFA Division One, is one of the regional leagues that make up the third tier of Botswana football. It is administered by the Boteti Regional Football Association and features teams from Boteti region.
Sponsorship
In 2019 the league secured a two-year sponsorship from Lucara Botswana, making Boteti Division One the first Botswana Division One league to be sponsored. Below is a list of all the sponsors to date:
2019-2021: Lucara
Past seasons
References
Football leagues in Botswana
|
The Orto Botanico dell'Università Politecnica delle Marche (5 hectares), also known as the Orto Botanico di Ancona and La Selva di Gallignano, is a nature preserve and botanical garden maintained by the Facoltà di Agraria of the Marche Polytechnic University (previously the University of Ancona), and located in Gallignano, Ancona, Province of Ancona, Marche, Italy.
The garden was established in the 1990s on municipal land, and now occupies the northern side of a hill at 100–200 meters altitude. It is a wooded area with wildlife.
See also
List of botanical gardens in Italy
References
Orto Botanico dell'Università Politecnica delle Marche
Horti entry (Italian)
Botanical gardens in Italy
Gardens in Marche
|
Pahi is a settlement in Northland, New Zealand. It is at the end of a peninsula in the Kaipara Harbour, bounded by inlets to the Paparoa Creek to the west and the Pahi River to the east. Paparoa is 6 km to the north, and Matakohe is 4 km to the north-west.
Pahi was one of several Kaipara settlements established by a religious group known as Albertlanders. Port Albert near Wellsford was the main settlement, and Matakohe was another. After the Paparoa Block was settled in 1863, a road was constructed to the port at Pahi in 1865.
The steamer Minnie Casey ran a weekly service from Pahi to Helensville on the south side of the Kaipara from 1882, and the S.S. Ethel took over from 1891 to 1895, after which services went only to Matakohe and Pahi.
Pahi is best known for its annual regatta; the Pahi Regatta Club was established in 1887, and a regatta has been held every year except 1925. Taking place over three days, events included sailing and later motorboat races, children's sports, foot races, aquatic events, rowing, and horse-swimming races across the strait to Whakapirau and back. Horse-swimming races ceased after a horse and rider drowned.
The Pahi Reserve and Campground contains a Moreton Bay fig tree (Ficus macrophylla) with a girth of over , one of the largest specimens of this species in the world, and considered "one of the ten finest exotic [trees] in New Zealand."
Demographics
Statistics New Zealand describes Pahi as a rural settlement, which covers and had an estimated population of as of with a population density of people per km2. Pahi is part of the larger Otamatea statistical area.
Pahi had a population of 255 at the 2018 New Zealand census, an increase of 75 people (41.7%) since the 2013 census, and an increase of 57 people (28.8%) since the 2006 census. There were 99 households, comprising 120 males and 132 females, giving a sex ratio of 0.91 males per female. The median age was 57.5 years (compared with 37.4 years nationally), with 42 people (16.5%) aged under 15 years, 15 (5.9%) aged 15 to 29, 105 (41.2%) aged 30 to 64, and 90 (35.3%) aged 65 or older.
Ethnicities were 95.3% European/Pākehā, 21.2% Māori, and 1.2% Asian. People may identify with more than one ethnicity.
Although some people chose not to answer the census's question about religious affiliation, 48.2% had no religion, 40.0% were Christian and 4.7% had other religions.
Of those at least 15 years old, 21 (9.9%) people had a bachelor's or higher degree, and 57 (26.8%) people had no formal qualifications. The median income was $21,000, compared with $31,800 nationally. 15 people (7.0%) earned over $70,000 compared to 17.2% nationally. The employment status of those at least 15 was that 66 (31.0%) people were employed full-time, 39 (18.3%) were part-time, and 12 (5.6%) were unemployed.
Gallery
References
Kaipara District
Populated places in the Northland Region
Populated places around the Kaipara Harbour
|
```text
Alternative Names
0
PARAM.SFO
/*
Shirokishi Monogatari Hikari To Yami No Kakusei
*/
#
Gain + Loss of Item Gets 255
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 003EA5B4 380000FF
#
HP + MP Recover When Drawing Weapon
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 00583EDC 8009005C
0 00583EE0 2F800001
#
Unlimited Skill Points
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 0038E5D0 60000000
0 0038E5F4 60000000
0 01048618 60000000
#
Normal Attack Refills AC
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 00591A74 3C0042C8
0 00591A78 90091560
#
GPx255
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 003B83C8 1F6400FF
#
Max Money
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 003FBF2C 60000000
#
Max Dahlia
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 003FD69C 4800
#
Max Level Permitted by Guild with 1 Kill
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 003945A0 4800
#
Guild Points Multiplier
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 003BA110 1F64Z
[Z]000A=10x;0064=100x;03E8=1000x;2710=10000x[/Z]
#
Synthesis without the Materials (Weapons not included)
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 0085AD64 60000000
0 00874CE0 60000000
0 008433E0 4BFF
#
Movement Speed Modifier
0
hnop.blog11.fc2.com, yuzuru.2ch.net/test/read.cgi/gameurawaza/1296550258/l50, kaede132
0 011C0AA0 Z
0 011C0AA4 Z
0 011C0AA8 Z
[Z]3F800000=Normal;3F000000=0.5x;3F400000=0.75x;3F600000=0.875x;3FA00000=1.25x;3FC00000=1.5x;3FE00000=1.75x;40000000=2x;40400000=3x;40800000=4x;40A00000=5x[/Z]
#
Max Money
0
Medo
0 30564500 3B9AC9FF
#
Max Dahlia
0
Medo
0 304DFEBC 3B9AC9FF
#
Max Exp
0
Medo
0 305283E8 7FFFFFFF
#
Max GR
0
Medo
0 305296B8 00C65D3E
#
Infinite HP and MP
0
Medo
0 30528408 270F270F
#
Infinite Action Chips
0
Medo
0 305283E4 000F0020
#
100% Critical Hit
0
Medo
0 30528440 7FE00003
0 30528444 7FE00000
#
Max All Stats Avatar
0
Medo
0 3052840C 270F270F
0 30528410 270F270F
0 30528414 270F270F
0 30528418 270F270F
0 3052841C 270F270F
0 30528420 270F270F
0 30528424 270F270F
0 305293C0 436F6465
0 305293C4 6D617374
0 305293C8 65727320
0 305293CC 50726F6A
0 305293D0 65637400
0 305296C4 1E01436F
0 305296C8 64656D61
0 305296CC 73746572
0 305296D0 73000000
0 305296D8 0000436F
0 305296DC 64656D61
0 305296E0 73746572
0 305296E4 73000000
#
Max Resistances Avatar
0
Medo
0 30528494 63636363
0 30528498 63636363
0 3052849C 63636363
0 305284B8 63636363
0 305284C0 63636363
0 305284C8 63636363
#
Max All Stats Avatar Knight
0
Medo
0 30529100 270F270F
0 30529104 270F270F
0 30529108 270F270F
0 3052910C 270F270F
0 30529110 270F270F
0 30529114 270F270F
0 30529118 270F270F
0 3052911C 270F270F
0 30529120 270F270F
0 30529124 270F270F
0 30529128 270F270F
0 3052912C 270F270F
#
Max Resistance Avatar Knight
0
Medo
0 30529190 63636363
0 30529194 63636363
0 30529198 63636363
0 305291B4 64646464
0 305291B8 64000000
0 305291BC 64646464
0 305291C0 64000000
0 305291C4 64646464
0 305291C8 64000000
#
Yulie Max Stats and Infinite HP + MP
0
Medo
0 3051D3F8 270F270F
0 3051D3FC 270F270F
0 3051D400 270F270F
0 3051D404 270F270F
0 3051D408 270F270F
0 3051D40C 270F270F
0 3051D410 270F270F
#
Leonard Max Stats and Infinite HP + MP
0
Medo
0 3051C3F8 270F270F
0 3051C3FC 270F270F
0 3051C400 270F270F
0 3051C404 270F270F
0 3051C408 270F270F
0 3051C40C 270F270F
0 3051C410 270F270F
#
Caesar Max Stats and Infinite HP + MP
0
Medo
0 305203F8 270F270F
0 305203FC 270F270F
0 30520400 270F270F
0 30520404 270F270F
0 30520408 270F270F
0 3052040C 270F270F
0 30520410 270F270F
#
Eldore Max Stats and Infinite HP + MP
0
Medo
0 3051E3F8 270F270F
0 3051E3FC 270F270F
0 3051E400 270F270F
0 3051E404 270F270F
0 3051E408 270F270F
0 3051E40C 270F270F
0 3051E410 270F270F
#
Kara Max Stats and Infinite HP + MP
0
Medo
0 3051F3F8 270F270F
0 3051F3FC 270F270F
0 3051F400 270F270F
0 3051F404 270F270F
0 3051F408 270F270F
0 3051F40C 270F270F
0 3051F410 270F270F
#
Wizel (White Knight) Max Stats and Infinite HP + MP
0
Medo
0 3051D0FC 270F270F
0 3051D100 270F270F
0 3051D104 270F270F
0 3051D108 270F270F
0 3051D10C 270F270F
0 3051D110 270F270F
0 3051D114 270F270F
0 3051D118 270F270F
0 3051D11C 270F270F
0 3051D120 270F270F
0 3051D124 270F270F
0 3051D128 270F270F
0 3051D12C 270F270F
0 3051D130 012C012C
#
Laravayne (Dragon Knight) Max Stats and Infinite HP + MP
0
Medo
0 305210FC 270F270F
0 30521100 270F270F
0 30521104 270F270F
0 30521108 270F270F
0 3052110C 270F270F
0 30521110 270F270F
0 30521114 270F270F
0 30521118 270F270F
0 3052111C 270F270F
0 30521120 270F270F
0 30521124 270F270F
0 30521128 270F270F
0 3052112C 270F270F
0 30521130 012C012C
#
Luthia (Moon Maiden) Max Stats and Infinite HP + MP
0
Medo
0 3051E0FC 270F270F
0 3051E100 270F270F
0 3051E104 270F270F
0 3051E108 270F270F
0 3051E10C 270F270F
0 3051E110 270F270F
0 3051E114 270F270F
0 3051E118 270F270F
0 3051E11C 270F270F
0 3051E120 270F270F
0 3051E124 270F270F
0 3051E128 270F270F
0 3051E12C 270F270F
0 3051E130 012C012C
#
```
|
```css
/*
Original style from softwaremaniacs.org (c) Ivan Sagalaev <Maniac@SoftwareManiacs.Org>
*/
.hljs {
display: block;
overflow-x: auto;
padding: 0.5em;
background: white;
color: black;
-webkit-text-size-adjust: none;
}
.hljs-string,
.hljs-tag .hljs-value,
.hljs-filter .hljs-argument,
.hljs-addition,
.hljs-change,
.hljs-name,
.apache .hljs-tag,
.apache .hljs-cbracket,
.nginx .hljs-built_in,
.tex .hljs-formula {
color: #888;
}
.hljs-comment,
.hljs-shebang,
.hljs-doctype,
.hljs-pi,
.hljs-deletion,
.apache .hljs-sqbracket {
color: #ccc;
}
.hljs-keyword,
.hljs-tag .hljs-title,
.ini .hljs-title,
.lisp .hljs-title,
.http .hljs-title,
.nginx .hljs-title,
.css .hljs-tag,
.hljs-winutils,
.hljs-flow,
.apache .hljs-tag,
.tex .hljs-command,
.hljs-request,
.hljs-status {
font-weight: bold;
}
```
|
The 2015 Cup of Nations was the third Cup of Nations tournament, but the first held outside the United Arab Emirates. Unlike 2011 and 2012, the Cup of Nations was staged in Hong Kong at the Hong Kong Football Club Stadium from November 13 to 21. The tournament acted as a year ending tournament for tier 3 teams from different continents and provides greater preparation for teams to play in their regional competitions, especially this year participants who aim to qualify for the 2019 Rugby World Cup haven failed to qualify for the 2015 Rugby World Cup.
The four competing teams were hosts Hong Kong, who won the tournament in 2011, Zimbabwe who competed in 2012, while Portugal and Russia are new to the tournament having not competed in either of the 2015 World Rugby Tbilisi Cup or 2015 World Rugby Nations Cup.
Format
The tournament is being played as a single round-robin, with the winner being the leading team after the third round of fixtures.
The points for the tournament were awarded for:
Win = 4 points
Draw = 2 points
Loss = 1 point
Scoring 4 or more tries in one game = 1 bonus point
Losing by 7 or less points = 1 bonus point
Standings
Pre-tournament rankings in parentheses
Fixtures
Round 1
Round 2
Round 3
See also
2015 end-of-year rugby union internationals
References
2015
2015 rugby union tournaments for national teams
International rugby union competitions hosted by Hong Kong
rugby union
2015 in Asian rugby union
2015 in Russian rugby union
rugby union
rugby union
November 2015 sports events in China
|
```go
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// Code generated by the FlatBuffers compiler. DO NOT EDIT.
package flatbuf
import (
flatbuffers "github.com/google/flatbuffers/go"
)
// / Same as List, but with 64-bit offsets, allowing to represent
// / extremely large data values.
type LargeList struct {
_tab flatbuffers.Table
}
func GetRootAsLargeList(buf []byte, offset flatbuffers.UOffsetT) *LargeList {
n := flatbuffers.GetUOffsetT(buf[offset:])
x := &LargeList{}
x.Init(buf, n+offset)
return x
}
func (rcv *LargeList) Init(buf []byte, i flatbuffers.UOffsetT) {
rcv._tab.Bytes = buf
rcv._tab.Pos = i
}
func (rcv *LargeList) Table() flatbuffers.Table {
return rcv._tab
}
func LargeListStart(builder *flatbuffers.Builder) {
builder.StartObject(0)
}
func LargeListEnd(builder *flatbuffers.Builder) flatbuffers.UOffsetT {
return builder.EndObject()
}
```
|
is a manga written in 1999 by Yusaku Hanakuma. It was subsequently made into a 2005 Japanese film written and directed by Sakichi Sato. The films stars Tadanobu Asano, Show Aikawa, and Erika Okuda. The film was released in North America, UK and later Australia and New Zealand in 2009.
Plot
Fujio and Mitsuo are two full-time slackers who work in a fire extinguisher factory. The two spend their lunch hours training to fulfill their dreams of being jujitsu champions. One day, they murder their boss and dump his body on a Tokyo toxic waste dump known as "Black Fuji".
Things suddenly become worse when an army of the undead rises from the waste dump and begin to attack the living. In order to survive, they will have to employ their limited jujitsu skills, to either help or escape Tokyo.
Film cast
Tadanobu Asano – Fujio
Show Aikawa – Mitsuo
Erika Okuda – Yoko
Arata Furuta – Ishihara
Kazuo Umezu – Akiyama / Prince
Hina Matsuoka – Fumiyo
Maria Takagi – Yocchan's sister
Reception
In a list of "10 Great Zombie Manga", Anime News Network's Jason Thompson placed Tokyo Zombie in ninth place, calling it "good, cheesy, ultraviolent entertainment".
References
External links
1999 manga
1999 comics endings
2000s Japanese-language films
Zombie comedy films
2005 films
Japanese horror films
Manga adapted into films
Live-action films based on manga
Zombies in anime and manga
Zombies in comics
2005 comedy horror films
Japanese zombie films
2000s Japanese films
Comics set in Tokyo
|
Arnall is a surname. Notable people with the surname include:
Ellis Arnall (1907–1992), American politician, 69th Governor of Georgia from 1943 to 1947
Julia Arnall (1928–2018), Austrian actress
Roland Arnall (1939–2008), French-born American businessman and diplomat
William Arnall (died 1736), English political writer
See also
Arnall Patz (1920–2010), American medical doctor and research professor at Johns Hopkins University
Arnall Middle School, middle school located in Newnan, Georgia but serves parts of Sharpsburg, Georgia
de:Arnall
|
Land o' Lakes is a town in Vilas County, Wisconsin, United States. The population was 861 at the 2010 census. The unincorporated community of Land o' Lakes is located in the town.
History
On January 4, 1907, the Town of State Line was created. On April 28, 1948, the name of the town was changed to the Town of Land o' Lakes.
Geography
The Town of Land o' Lakes is located in north-central Vilas County along the border with the Upper Peninsula of Michigan. The headwaters of a branch of the Ontonagon River is located in the town at the Cisco Chain of lakes, and the upper part of the Wisconsin River flows through the town, with the headwaters being located just to the east at Lac Vieux Desert. According to the United States Census Bureau, the town has a total area of 95.3 square miles (246.9 km2) of which 83.1 square miles (215.2 km2) is land and 12.2 square miles (31.7 km2) (12.83%) is water. The town is very long and narrow, with the town center, government offices, and most services located in the unincorporated community of Land o' Lakes at the far eastern end of the town.
Demographics
At the 2010 census, there were 861 people, 433 households and 264 families residing in the town. The population density was 10.6 per square mile (4.1/km2). There were 1,337 housing units at an average density of 16.1 per square mile (6.2/km2). The racial makeup of the town was 98.41% White, 0.68% Native American, 0.34% Asian, 0.45% from other races, and 0.11% from two or more races. Hispanic or Latino of any race were 0.45% of the population.
There were 433 households, of which 14.5% had children under the age of 18 living with them, 48.5% were married couples living together, 5.3% had a female householder with no husband present, and 43.6% were non-families. 37.2% of all households were made up of individuals, and 16.0% had someone living alone who was 65 years of age or older. The average household size was 1.99 and the average family size was 2.57.
Age distribution was 13.5% under the age of 18, 7.0% from 15 to 24, 15.2% from 25 to 44, 38.3% from 45 to 64, and 28.9% who were 65 years of age or older. The median age was 54 years. For every 100 males there were 88.4 females.
The median household income was $29,792, and the median family income was $40,938. Males had a median income of $30,357 versus $21,250 for females. The per capita income for the town was $18,765. About 5.5% of families and 7.5% of the population were below the poverty line, including 3.2% of those under age 18 and 5.9% of those age 65 or over.
Education
Most of Land o' Lakes is part of the Northland Pines School District and there is an elementary school that serves students from kindergarten to fifth grade in the unincorporated community of Land o' Lakes. Students travel to the nearby city of Eagle River, Wisconsin, for middle school and high school. Conserve School, a private semester school for high school juniors that focuses on environmental stewardship and outdoor activities, is located on the shore of Black Oak Lake. Some students in far southwestern parts of the Town attend North Lakeland Elementary School and Lakeland Union High School.
Transportation
Roads and highways
The Town of Land o' Lakes is served by USH 45, STH 32, and three Vilas County Trunk Highways. USH 45 runs north-south in the eastern part of the town, serving the unincorporated community of Land o' Lakes. It proceeds northward into the Upper Peninsula of Michigan to Watersmeet and a connection to US 2. USH 45 proceeds southward through Conover to Eagle River and points south. STH 32 begins at the Michigan border and proceeds southward concurrently with USH 45. CTH B runs the length of the town and serves as the main street of the unincorporated community of Land o' Lakes. It proceeds west to Presque Isle and a connection with M-64. CTH B meets CTH M – which provides access to Boulder Junction. CTH S proceeds south from a junction with CTH B approximately 5 miles from the unincorporated community of Land o' Lakes and serves the areas around Clair and Joyce Lakes before entering the Town of Conover. CTH E proceeds eastward from a junction with USH45/STH 32 in the southeast corner of the town and provides access to Lac Vieux Desert and Phelps, where it meets STH 17. Thousand Island Lake Road—a town road—provides a southern entrance to the Sylvania Wilderness.
Airport
Land o' Lakes is served by Kings Land o' Lakes Airport (KLNL). Located in the southeast corner of the town, the airport handles approximately 8,000 operations per year, with roughly 99% general aviation and 1% air taxi. The airport has a 4,001 foot asphalt runway with approved GPS approaches (Runway 14–32).
Notable people
Wendy Lansbach Boglioli, Olympic gold medal swimmer, grew up in Land o' Lakes
Climate
The climate is described as Humid Continental by the Köppen Climate System, abbreviated as Dfb.
References
External links
Land o' Lakes Wisconsin town website
Land o' Lakes Wisconsin Chamber of Commerce
Land o' Lakes Historical Society
Towns in Vilas County, Wisconsin
Towns in Wisconsin
Populated places established in 1907
1907 establishments in Wisconsin
|
```html
<!DOCTYPE html>
<html lang="en">
<head>
<title>EntityBuilder Class Reference</title>
<link rel="stylesheet" type="text/css" href="../css/jazzy.css" />
<link rel="stylesheet" type="text/css" href="../css/highlight.css" />
<meta charset='utf-8'>
<script src="../js/jquery.min.js" defer></script>
<script src="../js/jazzy.js" defer></script>
</head>
<body>
<a name="//apple_ref/swift/Class/EntityBuilder" class="dashAnchor"></a>
<a title="EntityBuilder Class Reference"></a>
<header>
<div class="content-wrapper">
<p><a href="../index.html"> Docs</a> (74% documented)</p>
</div>
</header>
<div class="content-wrapper">
<p id="breadcrumbs">
<a href="../index.html"> Reference</a>
<img id="carat" src="../img/carat.png" />
EntityBuilder Class Reference
</p>
</div>
<div class="content-wrapper">
<nav class="sidebar">
<ul class="nav-groups">
<li class="nav-group-name">
<a href="../Classes.html">Classes</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Classes/ColResult.html">ColResult</a>
</li>
<li class="nav-group-task">
<a href="../Classes/ColResultIterator.html">ColResultIterator</a>
</li>
<li class="nav-group-task">
<a href="../Classes/EntityBuilder.html">EntityBuilder</a>
</li>
<li class="nav-group-task">
<a href="../Classes/InProgress.html">InProgress</a>
</li>
<li class="nav-group-task">
<a href="../Classes/InProgressBuilder.html">InProgressBuilder</a>
</li>
<li class="nav-group-task">
<a href="../Classes/Mentat.html">Mentat</a>
</li>
<li class="nav-group-task">
<a href="../Classes/OptionalRustObject.html">OptionalRustObject</a>
</li>
<li class="nav-group-task">
<a href="../Classes/Query.html">Query</a>
</li>
<li class="nav-group-task">
<a href="../Classes/RelResult.html">RelResult</a>
</li>
<li class="nav-group-task">
<a href="../Classes/RelResultIterator.html">RelResultIterator</a>
</li>
<li class="nav-group-task">
<a href="../Classes/RustObject.html">RustObject</a>
</li>
<li class="nav-group-task">
<a href="../Classes/TupleResult.html">TupleResult</a>
</li>
<li class="nav-group-task">
<a href="../Classes/TxReport.html">TxReport</a>
</li>
<li class="nav-group-task">
<a href="../Classes/TypedValue.html">TypedValue</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Enums.html">Enumerations</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Enums/CacheDirection.html">CacheDirection</a>
</li>
<li class="nav-group-task">
<a href="../Enums/PointerError.html">PointerError</a>
</li>
<li class="nav-group-task">
<a href="../Enums/QueryError.html">QueryError</a>
</li>
<li class="nav-group-task">
<a href="../Enums/ResultError.html">ResultError</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Extensions.html">Extensions</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Extensions/Date.html">Date</a>
</li>
<li class="nav-group-task">
<a href="../Extensions/Result.html">Result</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Protocols.html">Protocols</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Protocols/Observable.html">Observable</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/Observing.html">Observing</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Structs.html">Structures</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Structs.html#/s:6Mentat0A5ErrorV">MentatError</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Typealiases.html">Type Aliases</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Typealiases.html#/s:6Mentat5Entida">Entid</a>
</li>
</ul>
</li>
</ul>
</nav>
<article class="main-content">
<section>
<section class="section">
<h1>EntityBuilder</h1>
<div class="declaration">
<div class="language">
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">class</span> <span class="kt">EntityBuilder</span> <span class="p">:</span> <span class="kt"><a href="../Classes/OptionalRustObject.html">OptionalRustObject</a></span></code></pre>
</div>
</div>
<p>This class wraps a raw pointer that points to a Rust <code>EntityBuilder<InProgressBuilder></code> object.</p>
<p><code>EntityBuilder</code> provides a programmatic interface to performing assertions on a specific entity.
It provides functions for adding and retracting values for attributes for an entity within
an in progress transaction.</p>
<p>The <code>transact</code> function will transact the assertions that have been added to the <code>EntityBuilder</code>
and pass back the <code><a href="../Classes/TxReport.html">TxReport</a></code> that was generated by this transact and the <code><a href="../Classes/InProgress.html">InProgress</a></code> that was
used to perform the transact. This enables you to perform further transacts on the same <code><a href="../Classes/InProgress.html">InProgress</a></code>
before committing.</p>
<pre class="highlight swift"><code><span class="k">let</span> <span class="nv">aEntid</span> <span class="o">=</span> <span class="n">txReport</span><span class="o">.</span><span class="nf">entid</span><span class="p">(</span><span class="nv">forTempId</span><span class="p">:</span> <span class="s">"a"</span><span class="p">)</span>
<span class="k">let</span> <span class="nv">bEntid</span> <span class="o">=</span> <span class="n">txReport</span><span class="o">.</span><span class="nf">entid</span><span class="p">(</span><span class="nv">forTempId</span><span class="p">:</span> <span class="s">"b"</span><span class="p">)</span>
<span class="k">do</span> <span class="p">{</span>
<span class="k">let</span> <span class="nv">builder</span> <span class="o">=</span> <span class="k">try</span> <span class="n">mentat</span><span class="o">.</span><span class="nf">entityBuilder</span><span class="p">(</span><span class="nv">forEntid</span><span class="p">:</span> <span class="n">bEntid</span><span class="p">)</span>
<span class="k">try</span> <span class="n">builder</span><span class="o">.</span><span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="s">":foo/boolean"</span><span class="p">,</span> <span class="nv">boolean</span><span class="p">:</span> <span class="kc">true</span><span class="p">)</span>
<span class="k">try</span> <span class="n">builder</span><span class="o">.</span><span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="s">":foo/instant"</span><span class="p">,</span> <span class="nv">date</span><span class="p">:</span> <span class="n">newDate</span><span class="p">)</span>
<span class="k">let</span> <span class="p">(</span><span class="nv">inProgress</span><span class="p">,</span> <span class="nv">report</span><span class="p">)</span> <span class="o">=</span> <span class="k">try</span> <span class="n">builder</span><span class="o">.</span><span class="nf">transact</span><span class="p">()</span>
<span class="k">try</span> <span class="n">inProgress</span><span class="o">.</span><span class="nf">transact</span><span class="p">(</span><span class="nv">transaction</span><span class="p">:</span> <span class="s">"[[:db/add </span><span class="se">\(</span><span class="n">aEntid</span><span class="se">)</span><span class="s"> :foo/long 22]]"</span><span class="p">)</span>
<span class="k">try</span> <span class="n">inProgress</span><span class="o">.</span><span class="nf">commit</span><span class="p">()</span>
<span class="p">}</span> <span class="k">catch</span> <span class="p">{</span>
<span class="o">...</span>
<span class="p">}</span>
</code></pre>
<p>The <code>commit</code> function will transact and commit the assertions that have been added to the <code>EntityBuilder</code>.
It will consume the <code><a href="../Classes/InProgress.html">InProgress</a></code> used to perform the transact. It returns the <code><a href="../Classes/TxReport.html">TxReport</a></code> generated by
the transact. After calling <code>commit</code>, a new transaction must be started by calling <code><a href="../Classes/Mentat.html#/s:6MentatAAC16beginTransactionAA10InProgressCyKF">Mentat.beginTransaction()</a></code>
in order to perform further actions.</p>
<pre class="highlight swift"><code><span class="k">let</span> <span class="nv">aEntid</span> <span class="o">=</span> <span class="n">txReport</span><span class="o">.</span><span class="nf">entid</span><span class="p">(</span><span class="nv">forTempId</span><span class="p">:</span> <span class="s">"a"</span><span class="p">)</span>
<span class="k">do</span> <span class="p">{</span>
<span class="k">let</span> <span class="nv">builder</span> <span class="o">=</span> <span class="k">try</span> <span class="n">mentat</span><span class="o">.</span><span class="nf">entityBuilder</span><span class="p">(</span><span class="nv">forEntid</span><span class="p">:</span> <span class="n">aEntid</span><span class="p">)</span>
<span class="k">try</span> <span class="n">builder</span><span class="o">.</span><span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="s">":foo/boolean"</span><span class="p">,</span> <span class="nv">boolean</span><span class="p">:</span> <span class="kc">true</span><span class="p">)</span>
<span class="k">try</span> <span class="n">builder</span><span class="o">.</span><span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="s">":foo/instant"</span><span class="p">,</span> <span class="nv">date</span><span class="p">:</span> <span class="n">newDate</span><span class="p">)</span>
<span class="k">let</span> <span class="nv">report</span> <span class="o">=</span> <span class="k">try</span> <span class="n">builder</span><span class="o">.</span><span class="nf">commit</span><span class="p">()</span>
<span class="o">...</span>
<span class="p">}</span> <span class="k">catch</span> <span class="p">{</span>
<span class="o">...</span>
<span class="p">}</span>
</code></pre>
</section>
<section class="section task-group-section">
<div class="task-group">
<ul>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC3addySS7keyword_s5Int64V4longtKF"></a>
<a name="//apple_ref/swift/Method/add(keyword:long:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC3addySS7keyword_s5Int64V4longtKF">add(keyword:long:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Asserts the value of attribute <code>keyword</code> to be the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/long</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">long</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Int64</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be asserted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC3addySS7keyword_s5Int64V9referencetKF"></a>
<a name="//apple_ref/swift/Method/add(keyword:reference:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC3addySS7keyword_s5Int64V9referencetKF">add(keyword:reference:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Asserts the value of attribute <code>keyword</code> to be the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/ref</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">reference</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Int64</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be asserted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC3addySS7keyword_SSAEtKF"></a>
<a name="//apple_ref/swift/Method/add(keyword:keyword:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC3addySS7keyword_SSAEtKF">add(keyword:keyword:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Asserts the value of attribute <code>keyword</code> to be the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/keyword</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">keyword</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">String</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be asserted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC3addySS7keyword_Sb7booleantKF"></a>
<a name="//apple_ref/swift/Method/add(keyword:boolean:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC3addySS7keyword_Sb7booleantKF">add(keyword:boolean:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Asserts the value of attribute <code>keyword</code> to be the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/boolean</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">boolean</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Bool</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be asserted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC3addySS7keyword_Sd6doubletKF"></a>
<a name="//apple_ref/swift/Method/add(keyword:double:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC3addySS7keyword_Sd6doubletKF">add(keyword:double:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Asserts the value of attribute <code>keyword</code> to be the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/double</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">double</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Double</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be asserted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hashF"></a>
<a name="//apple_ref/swift/Method/add(keyword:date:)" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hashF">add(keyword:date:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Asserts the value of attribute <code>keyword</code> to be the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/instant</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">date</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Date</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be asserted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC3addySS7keyword_SS6stringtKF"></a>
<a name="//apple_ref/swift/Method/add(keyword:string:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC3addySS7keyword_SS6stringtKF">add(keyword:string:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Asserts the value of attribute <code>keyword</code> to be the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/string</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">string</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">String</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be asserted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hashF"></a>
<a name="//apple_ref/swift/Method/add(keyword:uuid:)" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hashF">add(keyword:uuid:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Asserts the value of attribute <code>keyword</code> to be the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/uuid</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">add</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">uuid</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">UUID</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be asserted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC7retractySS7keyword_s5Int64V4longtKF"></a>
<a name="//apple_ref/swift/Method/retract(keyword:long:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC7retractySS7keyword_s5Int64V4longtKF">retract(keyword:long:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Retracts the value of attribute <code>keyword</code> from the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/long</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">retract</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">long</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Int64</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be retracted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hash></a>
<a name="//apple_ref/swift/Method/retract(keyword:reference:)" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hash>retract(keyword:reference:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Retracts the value of attribute <code>keyword</code> from the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/ref</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">retract</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">reference</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Int64</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be retracted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC7retractySS7keyword_SSAEtKF"></a>
<a name="//apple_ref/swift/Method/retract(keyword:keyword:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC7retractySS7keyword_SSAEtKF">retract(keyword:keyword:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Retracts the value of attribute <code>keyword</code> from the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/keyword</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">retract</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">keyword</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">String</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be retracted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC7retractySS7keyword_Sb7booleantKF"></a>
<a name="//apple_ref/swift/Method/retract(keyword:boolean:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC7retractySS7keyword_Sb7booleantKF">retract(keyword:boolean:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Retracts the value of attribute <code>keyword</code> from the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/boolean</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">retract</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">boolean</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Bool</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be retracted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC7retractySS7keyword_Sd6doubletKF"></a>
<a name="//apple_ref/swift/Method/retract(keyword:double:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC7retractySS7keyword_Sd6doubletKF">retract(keyword:double:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Retracts the value of attribute <code>keyword</code> from the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/double</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">retract</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">double</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Double</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be retracted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hashtetKF"></a>
<a name="//apple_ref/swift/Method/retract(keyword:date:)" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hashtetKF">retract(keyword:date:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Retracts the value of attribute <code>keyword</code> from the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/instant</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">retract</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">date</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">Date</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be retracted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC7retractySS7keyword_SS6stringtKF"></a>
<a name="//apple_ref/swift/Method/retract(keyword:string:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC7retractySS7keyword_SS6stringtKF">retract(keyword:string:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Retracts the value of attribute <code>keyword</code> from the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/string</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">retract</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">string</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">String</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be retracted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hashidtKF"></a>
<a name="//apple_ref/swift/Method/retract(keyword:uuid:)" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hashidtKF">retract(keyword:uuid:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Retracts the value of attribute <code>keyword</code> from the provided <code>value</code>.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.</p>
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if the attribute is not present in the schema or the attribute value type
is not <code>:db.type/uuid</code>.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">retract</span><span class="p">(</span><span class="nv">keyword</span><span class="p">:</span> <span class="kt">String</span><span class="p">,</span> <span class="n">uuid</span> <span class="nv">value</span><span class="p">:</span> <span class="kt">UUID</span><span class="p">)</span> <span class="k">throws</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>keyword</em>
</code>
</td>
<td>
<div>
<p>The name of the attribute in the format <code>:namespace/name</code>.</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>value</em>
</code>
</td>
<td>
<div>
<p>The value to be retracted</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hashKF"></a>
<a name="//apple_ref/swift/Method/transact()" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hashKF">transact()</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Transacts the added assertions. This consumes the pointer associated with this <code>EntityBuilder</code>
such that no further assertions can be added after the <code>transact</code> has completed. To perform
further assertions, use the <code><a href="../Classes/InProgress.html">InProgress</a></code> returned from this function.</p>
<p>This does not commit the transaction. In order to do so, <code>commit</code> can be called on the <code><a href="../Classes/InProgress.html">InProgress</a></code> returned
from this function.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if an error occured during the execution of the transact.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">transact</span><span class="p">()</span> <span class="k">throws</span> <span class="o">-></span> <span class="p">(</span><span class="kt"><a href="../Classes/InProgress.html">InProgress</a></span><span class="p">,</span> <span class="kt"><a href="../Classes/TxReport.html">TxReport</a></span><span class="p">?)</span></code></pre>
</div>
</div>
<div>
<h4>Return Value</h4>
<p>The current <code><a href="../Classes/InProgress.html">InProgress</a></code> and the <code><a href="../Classes/TxReport.html">TxReport</a></code> generated by the transact.</p>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC6commitAA8TxReportCyKF"></a>
<a name="//apple_ref/swift/Method/commit()" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC6commitAA8TxReportCyKF">commit()</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Transacts the added assertions and commits. This consumes the pointer associated with this <code>EntityBuilder</code>
and the associated <code><a href="../Classes/InProgress.html">InProgress</a></code> such that no further assertions can be added after the <code>commit</code> has completed.
To perform further assertions, a new <code><a href="../Classes/InProgress.html">InProgress</a></code> or <code>EntityBuilder</code> should be created.</p>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<code><a href="../Enums/PointerError.html#/s:6Mentat12PointerErrorO15pointerConsumedA2CmF">PointerError.pointerConsumed</a></code> if the underlying raw pointer has already consumed, which will occur if the builder
has already been transacted or committed.
</div>
<div class="aside aside-throws">
<p class="aside-title">Throws</p>
<p><code><a href="../Enums/ResultError.html#/s:6Mentat11ResultErrorO5errorACSS7message_tcACmF">ResultError.error</a></code> if an error occured during the execution of the transact.</p>
</div>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="kd">open</span> <span class="kd">func</span> <span class="nf">commit</span><span class="p">()</span> <span class="k">throws</span> <span class="o">-></span> <span class="kt"><a href="../Classes/TxReport.html">TxReport</a></span></code></pre>
</div>
</div>
<div>
<h4>Return Value</h4>
<p>The <code><a href="../Classes/TxReport.html">TxReport</a></code> generated by the transact.</p>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:6Mentat13EntityBuilderC7cleanupys13OpaquePointerV7pointer_tF"></a>
<a name="//apple_ref/swift/Method/cleanup(pointer:)" class="dashAnchor"></a>
<a class="token" href="#/s:6Mentat13EntityBuilderC7cleanupys13OpaquePointerV7pointer_tF">cleanup(pointer:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Undocumented</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight swift"><code><span class="k">override</span> <span class="kd">open</span> <span class="kd">func</span> <span class="nf">cleanup</span><span class="p">(</span><span class="nv">pointer</span><span class="p">:</span> <span class="kt">OpaquePointer</span><span class="p">)</span></code></pre>
</div>
</div>
</section>
</div>
</li>
</ul>
</div>
</section>
</section>
<section id="footer">
<p>© 2018 <a class="link" href="" target="_blank" rel="external"></a>. All rights reserved. (Last updated: 2018-06-21)</p>
<p>Generated by <a class="link" href="path_to_url" target="_blank" rel="external">jazzy v0.9.2</a>, a <a class="link" href="path_to_url" target="_blank" rel="external">Realm</a> project.</p>
</section>
</article>
</div>
</body>
</div>
</html>
```
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package io.camunda.zeebe.model.bpmn.builder;
import io.camunda.zeebe.model.bpmn.BpmnModelInstance;
import io.camunda.zeebe.model.bpmn.instance.ActivationCondition;
import io.camunda.zeebe.model.bpmn.instance.ComplexGateway;
import io.camunda.zeebe.model.bpmn.instance.SequenceFlow;
/**
* @author Sebastian Menski
*/
public class AbstractComplexGatewayBuilder<B extends AbstractComplexGatewayBuilder<B>>
extends AbstractGatewayBuilder<B, ComplexGateway> {
protected AbstractComplexGatewayBuilder(
final BpmnModelInstance modelInstance,
final ComplexGateway element,
final Class<?> selfType) {
super(modelInstance, element, selfType);
}
/**
* Sets the default sequence flow for the build complex gateway.
*
* @param sequenceFlow the default sequence flow to set
* @return the builder object
*/
public B defaultFlow(final SequenceFlow sequenceFlow) {
element.setDefault(sequenceFlow);
return myself;
}
/**
* Sets the activation condition expression for the build complex gateway
*
* @param conditionExpression the activation condition expression to set
* @return the builder object
*/
public B activationCondition(final String conditionExpression) {
final ActivationCondition activationCondition = createInstance(ActivationCondition.class);
activationCondition.setTextContent(conditionExpression);
element.setActivationCondition(activationCondition);
return myself;
}
}
```
|
```java
/**
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package io.pravega.segmentstore.server;
import io.pravega.common.util.BufferView;
import lombok.Data;
import lombok.NonNull;
import java.time.Duration;
import java.util.List;
import java.util.concurrent.CompletableFuture;
import java.util.function.Function;
/**
* The {@link ContainerEventProcessor} is a sub-component in a Segment Container that aims at providing a durable,
* FIFO-like queue abstraction over an internal, system-critical Segment. The {@link ContainerEventProcessor} can manage
* one or more {@link EventProcessor}s, which are the ones that append events to the queue and handle events read.
*/
public interface ContainerEventProcessor extends AutoCloseable {
/**
* Instantiates a new {@link EventProcessor}. If the internal Segment exists, the {@link EventProcessor} will re-use
* it. If not, a new internal Segment will be created. Multiple calls to this method for the same name should result
* in returning the same {@link EventProcessor} object.
*
* @param name Name of the {@link EventProcessor} object.
* @param handler Function that will be invoked when one or more events have been read from the internal Segment.
* @param config {@link EventProcessorConfig} for this {@link EventProcessor}.
* @return A {@link CompletableFuture} that, when completed, returns a new {@link EventProcessor} object associated
* to its own internal Segment.
*/
CompletableFuture<EventProcessor> forConsumer(@NonNull String name,
@NonNull Function<List<BufferView>, CompletableFuture<Void>> handler,
@NonNull EventProcessorConfig config);
/**
* Instantiates a new {@link EventProcessor} that only enables to add new data to the internal Segment. This may be
* useful when a user needs to store events, but it is not clear how the best approach to process them will be. This
* append-only {@link EventProcessor} can be replaced in the future by a regular one with a handler function that
* will consume all the events in the internal Segment. If the internal Segment exists, the {@link EventProcessor}
* will re-use it. If not, a new internal Segment will be created. Multiple calls to this method for the same name
* should result in returning the same {@link EventProcessor} object.
*
* @param name Name of the {@link EventProcessor} object.
* @return A {@link CompletableFuture} that, when completed, returns a new {@link EventProcessor} object associated
* to its own internal Segment.
*/
CompletableFuture<EventProcessor> forDurableQueue(@NonNull String name);
/**
* The {@link EventProcessor} is a service that takes care of adding and processing events from a durable queue. It
* is expected to be unique within a {@link ContainerEventProcessor} (e.g., identified by name), allow callers to
* add new elements to the durable queue, and perform ordered, offline processing of events by invoking the handler.
* The processing limits of any implementation of this class should be guided by {@link EventProcessorConfig}.
*/
interface EventProcessor extends AutoCloseable {
/**
* Persist a new event to the {@link EventProcessor}'s durable queue. Once the return future completes, it
* returns the amount of outstanding byes for this {@link EventProcessor} object.
*
* @param event Event to be added to the {@link EventProcessor}'s durable queue.
* @param timeout Maximum amount of time for this operation to be completed.
* @return A {@link CompletableFuture} that, when completed, will acknowledge that the event has been
* durably stored and returns the amount of outstanding bytes for this {@link EventProcessor}.
* @throws TooManyOutstandingBytesException if the {@link EventProcessor} has reached the maximum configured
* outstanding bytes.
*/
CompletableFuture<Long> add(@NonNull BufferView event, Duration timeout) throws TooManyOutstandingBytesException;
}
/**
* This class provides configuration settings for {@link EventProcessor}.
*/
@Data
class EventProcessorConfig {
/**
* Maximum number of events to be processed at once per processing iteration.
*/
private final int maxItemsAtOnce;
/**
* Maximum number of outstanding bytes that can be accumulated for a given {@link EventProcessor}.
*/
private final long maxProcessorOutstandingBytes;
/**
* Amount of processed data to be accumulated to truncate the internal Segment.
*/
private final long processedDataTruncationSizeInBytes;
}
/**
* Exception thrown when an {@link EventProcessor} backlog reaches the maximum limit of bytes configured.
* Usually, this may indicate that either the handler configured is failing and cannot process events or that the
* amount of events being ingested is too much compared to the processing speed.
*/
class TooManyOutstandingBytesException extends RuntimeException {
private static final long serialVersionUID = 1L;
/**
* Creates an new instance of the TooManyOutstandingBytesException class.
*
* @param eventProcessorId The Id of the {@link EventProcessor} that reached the outstanding byte limit.
*/
public TooManyOutstandingBytesException(String eventProcessorId) {
super(String.format("%s reached its maximum outstanding bytes limit.", eventProcessorId));
}
}
}
```
|
That’s Live is a live album by Eric Burdon and his band, recorded live in Karlsruhe, Germany, on 8 March 1985, during a European tour. It was originally marked Limited Compact Disc Reference Edition in 1985, and achieved more widespread release in 1992.
That’s Live is the only recording made of this line-up which, during the immediately prior period of 1981-84, had been one of the first Western rock acts to play extensively in the Eastern Bloc, including pre-unification East Germany, where, according to bassist Rob Burns, the band were "treated like royalty".
Track listing
"Intro" – 0:24
"Don’t Let Me Be Misunderstood" (Bennie Benjamin, Gloria Caldwell, Sol Marcus) – 6:24
"When I Was Young" (Eric Burdon, Vic Briggs, John Weider, Barry Jenkins, Danny McCulloch) – 7:41
"Working Life" [aka "Factory"] (Bruce Springsteen), featuring Robbie Burns, bass – 10:40
"We Got To Get Out Of This Place" (Barry Mann, Cynthia Weil) – 10:20
"Poor Man" (Woody Guthrie), featuring Tom Blades, guitar – 7:52
"River Deep, Mountain High" (Phil Spector) – 7:06
"I‘m Crying" (Eric Burdon, Alan Price), featuring Mitch Harwood, drums – 10:09
"Lawdy Miss Clawdy" (Lloyd Price) – 8:50
Personnel
Performance
Eric Burdon - vocals
Tom Blades - keyboard and guitar
Rob Burns - bass
Mitch Harwood - drums
Production
Alex Manninger - executive producer, cutting consultant
Andre Ulmann - recording engineer
Harald Hassler - technical assistant
Dr. Benjamin Bernfeld - cutting engineer
Günther Sümser - photos
Bruno Kassel - cover photo
wachner design/Freiberg - design
Sanyo Electric/Japan - manufacturer
References
External links
Eric Burdon albums
1985 live albums
|
```javascript
'use strict';
const {
Array,
FunctionPrototypeBind,
} = primordials;
const {
// For easy access to the nextTick state in the C++ land,
// and to avoid unnecessary calls into JS land.
tickInfo,
// Used to run V8's micro task queue.
runMicrotasks,
setTickCallback,
enqueueMicrotask
} = internalBinding('task_queue');
const {
setHasRejectionToWarn,
hasRejectionToWarn,
listenForRejections,
processPromiseRejections
} = require('internal/process/promises');
const {
getDefaultTriggerAsyncId,
newAsyncId,
initHooksExist,
destroyHooksExist,
emitInit,
emitBefore,
emitAfter,
emitDestroy,
symbols: { async_id_symbol, trigger_async_id_symbol }
} = require('internal/async_hooks');
const {
ERR_INVALID_CALLBACK,
ERR_INVALID_ARG_TYPE
} = require('internal/errors').codes;
const FixedQueue = require('internal/fixed_queue');
// *Must* match Environment::TickInfo::Fields in src/env.h.
const kHasTickScheduled = 0;
function hasTickScheduled() {
return tickInfo[kHasTickScheduled] === 1;
}
function setHasTickScheduled(value) {
tickInfo[kHasTickScheduled] = value ? 1 : 0;
}
const queue = new FixedQueue();
// Should be in sync with RunNextTicksNative in node_task_queue.cc
function runNextTicks() {
if (!hasTickScheduled() && !hasRejectionToWarn())
runMicrotasks();
if (!hasTickScheduled() && !hasRejectionToWarn())
return;
processTicksAndRejections();
}
function processTicksAndRejections() {
let tock;
do {
while (tock = queue.shift()) {
const asyncId = tock[async_id_symbol];
emitBefore(asyncId, tock[trigger_async_id_symbol], tock);
try {
const callback = tock.callback;
if (tock.args === undefined) {
callback();
} else {
const args = tock.args;
switch (args.length) {
case 1: callback(args[0]); break;
case 2: callback(args[0], args[1]); break;
case 3: callback(args[0], args[1], args[2]); break;
case 4: callback(args[0], args[1], args[2], args[3]); break;
default: callback(...args);
}
}
} finally {
if (destroyHooksExist())
emitDestroy(asyncId);
}
emitAfter(asyncId);
}
runMicrotasks();
} while (!queue.isEmpty() || processPromiseRejections());
setHasTickScheduled(false);
setHasRejectionToWarn(false);
}
// `nextTick()` will not enqueue any callback when the process is about to
// exit since the callback would not have a chance to be executed.
function nextTick(callback) {
if (typeof callback !== 'function')
throw new ERR_INVALID_CALLBACK(callback);
if (process._exiting)
return;
let args;
switch (arguments.length) {
case 1: break;
case 2: args = [arguments[1]]; break;
case 3: args = [arguments[1], arguments[2]]; break;
case 4: args = [arguments[1], arguments[2], arguments[3]]; break;
default:
args = new Array(arguments.length - 1);
for (let i = 1; i < arguments.length; i++)
args[i - 1] = arguments[i];
}
if (queue.isEmpty())
setHasTickScheduled(true);
const asyncId = newAsyncId();
const triggerAsyncId = getDefaultTriggerAsyncId();
const tickObject = {
[async_id_symbol]: asyncId,
[trigger_async_id_symbol]: triggerAsyncId,
callback,
args
};
if (initHooksExist())
emitInit(asyncId, 'TickObject', triggerAsyncId, tickObject);
queue.push(tickObject);
}
let AsyncResource;
const defaultMicrotaskResourceOpts = { requireManualDestroy: true };
function createMicrotaskResource() {
// Lazy load the async_hooks module
if (AsyncResource === undefined) {
AsyncResource = require('async_hooks').AsyncResource;
}
return new AsyncResource('Microtask', defaultMicrotaskResourceOpts);
}
function runMicrotask() {
this.runInAsyncScope(() => {
const callback = this.callback;
try {
callback();
} finally {
this.emitDestroy();
}
});
}
function queueMicrotask(callback) {
if (typeof callback !== 'function') {
throw new ERR_INVALID_ARG_TYPE('callback', 'function', callback);
}
const asyncResource = createMicrotaskResource();
asyncResource.callback = callback;
enqueueMicrotask(FunctionPrototypeBind(runMicrotask, asyncResource));
}
module.exports = {
setupTaskQueue() {
// Sets the per-isolate promise rejection callback
listenForRejections();
// Sets the callback to be run in every tick.
setTickCallback(processTicksAndRejections);
return {
nextTick,
runNextTicks
};
},
queueMicrotask
};
```
|
```html+erb
<% add_decidim_page_title(t("decidim.meetings.directory.meetings.index.meetings")) %>
<%= append_stylesheet_pack_tag "decidim_meetings", media: "all" %>
<%= append_javascript_pack_tag "decidim_meetings" %>
<% content_for :aside do %>
<%= render partial: "decidim/meetings/shared/meetings_aside", locals: { main_action: true, search_variable:, filter_options:, component: } %>
<% end %>
<%= render layout: "layouts/decidim/shared/layout_two_col" do %>
<% if display_map %>
<div class="meeting-list__map">
<%= cell "decidim/meetings/meetings_map", search.result %>
</div>
<% end %>
<% if display_announcement %>
<%= render partial: "decidim/shared/component_announcement" %>
<% end %>
<section id="meetings" class="layout-main__section layout-main__heading">
<%= render partial: "decidim/meetings/shared/meetings", locals: { component: } %>
</section>
<% end %>
```
|
Kenneth E. Kruszewski (born February 6, 1948) is a former Democratic member of the Pennsylvania House of Representatives.
Background
Born in the city of Erie, Pennsylvania on February 6, 1945, Kruszewski graduated from Technical Memorial High School in 1963, and attended, Pennsylvania State University, Behrend, and then also attended Mercyhurst College. Employers included the United States Justice Department and Drug Enforcement Administration, University of Delaware, Pennsylvania Chiefs Association (North West Regional Narcotics Instructor), Erie Police Department (19 years: Narcotics Commander, Detective Sergeant for 9 years).
Political career
A Democrat, he was elected to the Pennsylvania House of Representatives in 1990. He then ran an unsuccessful candidate for reelection to the House in 1992.
References
1948 births
Living people
Democratic Party members of the Pennsylvania House of Representatives
Politicians from Erie, Pennsylvania
|
The Christian Lutheran Church of Honduras (, abbreviated ICLH) is a Lutheran denomination in Honduras. Lutheran missions in Honduras began in 1951, when missionaries from El Salvador began ministering in the community of San Nicolás Olancho. Three decades later, in 1981, two Guatemalan missionaries began serving congregations in San Pedro Sula and Tegucigalpa. Two years later, the ICLH was officially founded under the leadership of the Lutheran Church–Missouri Synod. The ICLH joined the Lutheran World Federation in 1994. Today, the church body numbers some 1,200 members in nine congregations.
References
External links
Lutheran World Federation listing
Lutheran denominations
Lutheranism in South America
Churches in Honduras
Lutheran World Federation members
|
Diana Nyad (née Sneed; born August 22, 1949) is an American author, journalist, motivational speaker, and long-distance swimmer. Nyad gained national attention in 1975 when she swam around Manhattan () in record time, and in 1979 when she swam from North Bimini, The Bahamas, to Juno Beach, Florida (). In 2013, on her fifth attempt and at age 64, she succeeded in swimming from Havana, Cuba to Key West, Florida, completing the third known swim crossing of the Florida Straits after Walter Poenisch in 1978, and Susie Maroney in 1997. Both of those earlier efforts involved a shark cage and, in Poenisch's case, fins and several short rests on his escort craft. Nyad completed the crossing without these aids, but did use a protective jellyfish suit, shark divers, and electronic shark repellent devices. The crossing has not been formally ratified by any recognized marathon swimming organization, but a comprehensive report by the World Open Water Swimming Association (WOWSA) suggests that Nyad did complete this assisted swim under her own power.
Early life and education
Nyad was born in New York City on August 22, 1949, to her mother Lucy Winslow Curtis (1925–2007). and stockbroker William L. Sneed Jr. Her mother was a great-granddaughter of Charlotte N. Winslow, the inventor of Mrs Winslow's Soothing Syrup, a popular morphine-based medicine for children teething that was manufactured from 1849 until the 1930s. She is also a great-grandniece of women's-rights activist Laura Curtis Bullard.
The Sneeds divorced in 1952, after which Lucy Sneed married Aristotle Z. Nyad, a Greek-Egyptian land developer, who adopted Diana. The family moved to Fort Lauderdale, Florida, where she began swimming seriously in seventh grade.
She was enrolled at the private Pine Crest School in the mid-1960s, swimming under the tutelage of Olympian and Hall of Fame coach Jack Nelson who, she has said, molested her beginning when she was fourteen years old and continuing until she graduated from high school, as he did with other girls he coached. She won three Florida state high school championships in the backstroke at 100 yards. She dreamed of swimming in the 1968 Summer Olympics, but in 1966 she spent three months in bed with endocarditis, an infection of the heart, and when she began swimming again she had lost speed.
After graduating from Pine Crest School in 1967, she entered Emory University, but was eventually expelled for jumping out a fourth-floor dormitory window wearing a parachute. She then enrolled at Lake Forest College in Illinois, where she resumed swimming, concentrating on distance events. She soon came to the attention of Buck Dawson, director of the International Swimming Hall of Fame in Florida, who introduced her to marathon swimming. She began training at his Camp Ak-O-Mak in Magnetawan, Ontario and set a women's course record of 4 hours and 22 minutes in her first race, a swim in Lake Ontario in July 1970, finishing 10th overall. After graduating from Lake Forest College in 1973 with a degree in English and French, Nyad then enrolled in a PhD program for Comparative Literature at New York University in 1973 and also pursued her marathon swimming career.
Career
Nyad has written four books: Other Shores (Random House: September 1978) about her life and distance swimming, Basic Training for Women (Harmony Books: 1981), Boss of Me: The Keyshawn Johnson Story (1999) about an NFL wide receiver, and Find a Way (Knopf Publishing Group: 2015). She has also written for The New York Times, NPR's "All Things Considered," Newsweek magazine, and other publications. Nyad and former professional racquetball player Bonnie Stoll formed a company called BravaBody which is aimed at providing online exercise advice to women over 40.
Nyad formerly hosted the public radio program "The Savvy Traveler." In addition, she was the subject of a short documentary "Diana" by the digital channel WIGS in 2012. As of 2006, she was a (long-time) weekly contributor to National Public Radio's afternoon news show All Things Considered (appearing on Thursdays), as well as the "business of sport" commentator for American Public Media's public radio program Marketplace business news. She was also a regular contributor to the CBS News television show Sunday Morning.
An analysis of Nyad's ability to dissociate during her marathon swims was covered by James W. Pipkin.
An independently produced documentary film, The Other Shore, was released in early 2013, some months before Nyad's first successful swim from Cuba to Florida. In her 1978 autobiography, Nyad described marathon swimming as a battle for survival against a brutal foe—the sea—and the only victory possible is to "touch the other shore."
Distance swimming
Over two days in 1979, Nyad swam from Bimini to Florida, setting a distance record for non-stop swimming without a wetsuit. In 1975 she broke the 45-year-old record for circling Manhattan Island (7 hrs, 57 min).
1974: In June 1974, Nyad set a women's record of 8 hours, 11 minutes in the Gulf of Naples race.
1975: At age 26, Nyad swam around the island of Manhattan (New York City) in just under 8 hours (7 hours 57 minutes.) An account of her swim, published the next day, stated Nyad was tall (1.7 m) and weighed .
1978: At age 28 she first attempted to swim from Havana, Cuba to Key West, one year after the Kennedy-era travel restrictions were lifted. Diving into the ocean at 2PM on Sunday, August 13 from Ortegosa Beach ( west of Havana), she swam inside a steel shark cage for nearly 42 hours, before team doctors removed her during the 7 o'clock hour on the morning of Tuesday, August 15 due to strong Westerly winds and swells that were slamming her against the cage and pushing her off-course towards Texas. She had covered about , but not in a straight line.
1979: On her 30th birthday (August 21–22, 1979), in what was to be her last "competitive" swim, she set a world record for distance swimming (both men and women) over open water by swimming from North Bimini Island, Bahamas, to Juno Beach, Florida (without the use of protective shark cage). Thanks to favorable winds and a following sea she averaged and completed the swim in 27 and one-half hours.
Several experts who attended the 2011 Global Open Water Swimming Conference in New York City on June 17–19, 2011 expressed their strong belief that Nyad had both the physical ability and, more importantly, the positive mental stamina to be able to complete the Cuba-to-Florida swim: sports physiology studies have shown that in "extreme" marathon-type activities mental determination is a more important factor than the physical energy of youth.
Cuba to Florida swim attempts in 2011–2013
Preparations
By early January 2010 Nyad began training for a summer attempt to swim from Cuba to Florida. Taking up residence in the Caribbean island of St. Maarten, from January through June, she would go for 8-, 10-, 12-, and 14-hour-long swims every other week. She then moved her training to Key West and, while waiting for favorable weather conditions, she embarked on a 24-hour swim. On July 10, she reserved a 35-foot fishing vessel to take her out to sea. At 8:19 AM she jumped overboard and began swimming back towards Key West, with the boat following her. At 8:19 AM the next day her handlers helped her back on board, still about from land: she said she felt "tired and dehydrated" but still "strong" and "easily able to swim another 20 hours without any problem."
On July 10, 2010, at the age of 60, she began open water training in preparation for a 60-hour, swim from Cuba to Florida, a task she had failed to accomplish thirty years prior. When asked about her motivation, she answered, "Because I'd like to prove to the other 60 year-olds that it is never too late to start your dreams." She was scheduled to make the swim in August/September 2010, but bad weather forced her to cancel; she rescheduled for July 2011. In an October 15, 2010 interview with CNN, Nyad said she was trained and ready to swim by July 23, but a record stretch of high winds and dropping water temperatures prevented her from making the attempt.
While training in St. Maarten, she sat for an interview that was published March 25, 2011 by the island's online news agency, The Daily Herald, remarking that "It's a large operation, like an expedition. We've got about 25 people, navigators, managers, boat crew, weather routers, medical people, shark experts, you name it. That's the time also when the water starts to get to its hottest. I need the hottest possible ocean. As soon as we hit the right forecast, we'll be off to Havana. We won't know the exact starting point probably until the night before. And we don't know exactly where landfall will be...I'd love to wind up in Key West, but it will depend on trajectory of the Gulf Stream." Nyad estimated that the cost of her "expedition" was about $500,000.
Nyad moved her training site from the Caribbean island of St. Maarten to Key West, Florida, in June 2011. She was joined by key members of her support team on June 28, to wait for ideal weather conditions that typically occur only during the summer doldrums in July and August. For the marathon swim to be feasible, two main weather conditions needed to come together at the same time: a combination of low-to-light winds (to minimize sea chop), and water temperatures in the high 80s °F (high 20s/low 30s °C). These relatively "high" water temperatures produce a twin challenge: in the first half of her swim the warm water will dehydrate her body, while in the second half her body temperature will drop and she will face potential hypothermia. Nyad had bulked up her physique to about 150 pounds/70 kg (15 pounds/7 kg more than she weighed in 2010) to help counter the loss of body mass during her grueling swim.
Nyad was escorted by a paddler in a kayak equipped with an electronic shark repellent known as a Shark Shield.
To keep Nyad swimming in a straight line, her specially designed, slow-moving catamaran support boat deployed a streamer: a long pole keeps the streamer several yards away from the boat, and the streamer is designed to remain about 5 feet underwater, so that Nyad can swim above it, much like following a lane line in a swimming pool. At night, the white streamer was replaced by a string of red LED lights. Writing in her blog in July 2011, Nyad stated that the development of the submerged guide streamer, in early summer 2011, may be the single greatest aid to her marathon swim. In all of her previous swims, she had trouble keeping the support boat in sight and was prone to veer off-course. Keeping a boat headed in a straight line, in the ocean, while moving at only 1 to 2 knots is very difficult, and her catamaran is equipped with thrusters and a special sea anchor (in case of following seas) to stabilize its course.
Second attempt
Thirty-three years after her first attempt in 1978, Nyad entered the water again at Havana on August 7, 2011, at 7:45PM, with a CNN news team on board her support ship to provide live coverage of her swim, which involved electronic "Shark Shields" but no shark cage. Nyad stopped her attempt early in the morning on August 9 at 12:45AM after 29 hours in the water, after encountering strong currents and winds that pushed her miles off course to the east. Nyad also said she had been suffering shoulder pain since her third hour in the water, but what made her abandon the effort was a flare-up of her asthma, such that, throughout the final hour, she could only swim a few strokes before repeatedly having to roll on her back to catch her breath.
Third attempt
On September 23, 2011, Nyad began a third attempt at the Cuba-to-Florida swim, again without a shark cage, but stopped after 41 hours, about through the passage, because of jellyfish and Portuguese man-of-war stings and after currents pushed her off course. Nyad's October 2011 TED talk described how box jellyfish stings on her forearm and neck caused respiratory distress that eventually caused the swim to end.
Fourth attempt
On August 18, 2012, Nyad began her fourth attempt, without a protective shark cage. Nyad and her team ended the swim at 12:55 a.m. on August 21, 2012, reportedly because of two storms and nine jellyfish stings, after having covered more distance than her three previous attempts.
Fifth attempt
On the morning of August 31, 2013, Nyad began her fifth bid to swim from Havana, Cuba to Florida, a distance of about , accompanied by a 35-person support team, swimming without a shark cage but protected from jellyfish by a silicone mask, a full bodysuit, gloves and booties. She was also accompanied by vessels using electronic 'Shark Shield' deterrent devices, and at times by shark divers. At approximately 1:55 pm EDT on September 2, 2013, Nyad reached the beach in Key West, about 53 hours after she began her journey.
While not directly questioning the authenticity of her story, some skeptics, including experienced marathon swimmers, requested the swim's GPS history, surface current, weather, and Nyad's eating and drinking data. The swim's published GPS data were analyzed and graphed on September 8 by The New York Times. After Nyad's September 10 response to questions and her publishing path data and notes from her navigator and two observers, a University of Miami oceanography professor, Tamay Ozgokmen, confirmed the navigator's assertion that favorable Gulf Stream currents explained Nyad's apparently incredible total velocity during certain portions of the swim. On September 10, 2013, Nyad appeared on The Ellen DeGeneres Show explaining that while she swims she remembers Stephen Hawking books, sings, counts numbers, and has vivid hallucinations of The Wizard of Oz and the yellow brick road. On September 12, 2013, Nyad said, “We swam fair and square, squeaky clean across that thing".
The New York Times public editor observed on September 19 that the focus had shifted from serious questions about possibly resting aboard a boat, to more technical issues relating to whether her crew members touching her, and her wearing a protective suit, rendered the swim "assisted". Nyad has expressed her belief that wearing the jellyfish-protection suit was a life-and-death measure that for her superseded the traditions of the sport. As of 2023, the swim has not been ratified by any marathon swimming organization, although in 2022 the World Open Water Swimming Association did issue a comprehensive report, updated in 2023, amassing a trove of information available detailing Nyad's 2013 crossing.
Dancing with the Stars performances
On March 4, 2014, Nyad was announced as one of the celebrities to compete on the 18th season of Dancing with the Stars, in which she finished in last place. She was partnered with professional dancer Henry Byalikov.
Other media appearances
In 1989, Nyad was a guest correspondent on an episode of Unsolved Mysteries about Alcatraz. She assisted on a segment that detailed real-life, current reenactments of both kayakers and a swimmer attempting to traverse San Francisco Bay.
Nyad appeared in the Macy Gray music video for the song “Bang, Bang” in 2014.
Also in 2014, Nyad performed in her solo show (which she had also written) called ONWARD – The Diana Nyad story, which premiered that year at the NoHo Arts Centre Theater in Los Angeles, directed by Josh Ravetch.
Honors, awards and distinctions
Nyad was inducted into the United States National Women's Sports Hall of Fame in 1986. She is also an International Marathon Swimming Hall of Fame Honoree (1978) and an ISHOF Al Schoenfield Media Award recipient (2002). She is a Hall of Famer at her college, Lake Forest College in Illinois, and at her high school, Pine Crest School in Fort Lauderdale.
2014
Nyad was awarded the first ESPN Sports Science Newton Award for Outstanding New Limit.
Nyad was awarded the L.A. Sports Council's Athlete of the Year award.
She was inducted into the National Gay and Lesbian Sports Hall of Fame.
Nyad received the Jack LaLanne Award.
She received the "Orden al Mérito Deportivo" [Order of Sporting Merit] Award, from Cuba.
A bronze plaque honoring Nyad was unveiled on a concrete wall bordering Smathers Beach, where she ended her successful Cuba to Florida swim.
Nyad was named one of National Geographic’s Adventurers of the Year.
2015
Nyad was shown in Marie Claire magazine's "The 8 Greatest Moments for Women in Sports."
Chapter 30 of the book The Right Side of History: 100 Years of LGBTQ Activism, written by Rita Mae Brown, was written about Nyad.
Personal life
Nyad is a lesbian, and is an atheist.
Nyad has said that overcoming her childhood sexual abuse was a factor in her determination while swimming, and she has spoken publicly about this issue.
From October 8–10, 2013, Nyad participated in "Swim for Relief" by doing a 48-hour continuous swim in New York City's Herald Square in a specially constructed, 120-foot long, two lane pool. It raised $105,001.00 for AmeriCares to benefit the victims of Hurricane Sandy.
Netflix Biopic
Annette Bening plays Nyad and Jodie Foster plays Stoll in 2023's Nyad, directed by Elizabeth Chai Vasarhelyi and Jimmy Chin.
References
External links
Official bio on American Public Media
Nyad's December 2013 TED Talk "Never, ever give up " after having completed the Cuba-to-Florida swim in September
"An Ill Wind That Blew No Good" —Sports Illustrated, August 28, 1978
1978 Nyad interview with John Calloway after her first Cuba-Florida attempt, Chicago Tonight, full video
1949 births
20th-century American non-fiction writers
20th-century American women writers
21st-century American non-fiction writers
21st-century American women writers
American atheists
American female swimmers
American long-distance swimmers
American motivational speakers
Women motivational speakers
American Public Media
American female squash players
American women journalists
Emory University alumni
Lake Forest College alumni
Lesbian sportswomen
American lesbian writers
American LGBT journalists
LGBT people from New York (state)
American LGBT sportspeople
LGBT swimmers
Living people
NFL Europe broadcasters
Swimmers from New York City
Sportswriters from New York (state)
Writers from New York City
LGBT squash players
Manhattan Island swimmers
Olympic Games broadcasters
21st-century American LGBT people
Pine Crest School alumni
|
```javascript
import macro from 'vtk.js/Sources/macros';
import vtkAbstractWidgetFactory from 'vtk.js/Sources/Widgets/Core/AbstractWidgetFactory';
import vtkPlane from 'vtk.js/Sources/Common/DataModel/Plane';
import vtkPlaneSource from 'vtk.js/Sources/Filters/Sources/PlaneSource';
import vtkResliceCursorContextRepresentation from 'vtk.js/Sources/Widgets/Representations/ResliceCursorContextRepresentation';
import * as vtkMath from 'vtk.js/Sources/Common/Core/Math';
import widgetBehavior from 'vtk.js/Sources/Widgets/Widgets3D/ResliceCursorWidget/behavior';
import stateGenerator from 'vtk.js/Sources/Widgets/Widgets3D/ResliceCursorWidget/state';
import {
boundPlane,
updateState,
transformPlane,
} from 'vtk.js/Sources/Widgets/Widgets3D/ResliceCursorWidget/helpers';
import { ViewTypes } from 'vtk.js/Sources/Widgets/Core/WidgetManager/Constants';
import { vec4, mat4 } from 'gl-matrix';
import vtkMatrixBuilder from 'vtk.js/Sources/Common/Core/MatrixBuilder';
const VTK_INT_MAX = 2147483647;
const { vtkErrorMacro } = macro;
// your_sha256_hash------------
// Factory
// your_sha256_hash------------
function vtkResliceCursorWidget(publicAPI, model) {
model.classHierarchy.push('vtkResliceCursorWidget');
model.methodsToLink = ['scaleInPixels', 'rotationHandlePosition'];
// your_sha256_hash----------
// Private methods
// your_sha256_hash----------
/**
* Compute the origin of the reslice plane prior to transformations
* It does not take into account the current view normal. (always axis aligned)
* @param {*} viewType axial, coronal or sagittal
*/
function computeReslicePlaneOrigin(viewType) {
const bounds = model.widgetState.getImage().getBounds();
const center = publicAPI.getWidgetState().getCenter();
const imageCenter = model.widgetState.getImage().getCenter();
// Offset based on the center of the image and how far from it the
// reslice cursor is. This allows us to capture the whole image even
// if we resliced in awkward places.
const offset = [];
for (let i = 0; i < 3; i++) {
offset[i] = -Math.abs(center[i] - imageCenter[i]);
offset[i] *= 2; // give us room
}
// Now set the size of the plane based on the location of the cursor so as to
// at least completely cover the viewed region
const planeSource = vtkPlaneSource.newInstance();
if (viewType === ViewTypes.XZ_PLANE) {
planeSource.setOrigin(
bounds[0] + offset[0],
center[1],
bounds[4] + offset[2]
);
planeSource.setPoint1(
bounds[1] - offset[0],
center[1],
bounds[4] + offset[2]
);
planeSource.setPoint2(
bounds[0] + offset[0],
center[1],
bounds[5] - offset[2]
);
} else if (viewType === ViewTypes.XY_PLANE) {
planeSource.setOrigin(
bounds[0] + offset[0],
bounds[2] + offset[1],
center[2]
);
planeSource.setPoint1(
bounds[1] - offset[0],
bounds[2] + offset[1],
center[2]
);
planeSource.setPoint2(
bounds[0] + offset[0],
bounds[3] - offset[1],
center[2]
);
} else if (viewType === ViewTypes.YZ_PLANE) {
planeSource.setOrigin(
center[0],
bounds[2] + offset[1],
bounds[4] + offset[2]
);
planeSource.setPoint1(
center[0],
bounds[3] - offset[1],
bounds[4] + offset[2]
);
planeSource.setPoint2(
center[0],
bounds[2] + offset[1],
bounds[5] - offset[2]
);
}
return planeSource;
}
/**
* Compute the offset between display reslice cursor position and
* display focal point position
* This will be used to keep the same offset between reslice cursor
* center and focal point when needed.
*/
function computeFocalPointOffsetFromResliceCursorCenter(viewType, renderer) {
const worldFocalPoint = renderer.getActiveCamera().getFocalPoint();
const worldResliceCenter = model.widgetState.getCenter();
const view = renderer.getRenderWindow().getViews()[0];
const dims = view.getViewportSize(renderer);
const aspect = dims[0] / dims[1];
const displayFocalPoint = renderer.worldToNormalizedDisplay(
...worldFocalPoint,
aspect
);
const displayResliceCenter = renderer.worldToNormalizedDisplay(
...worldResliceCenter,
aspect
);
const newOffset = vtkMath.subtract(
displayFocalPoint,
displayResliceCenter,
[0, 0, 0]
);
const cameraOffsets = model.widgetState.getCameraOffsets();
cameraOffsets[viewType] = newOffset;
model.widgetState.setCameraOffsets(cameraOffsets);
}
function updateCamera(
renderer,
normal,
viewType,
resetFocalPoint,
keepCenterFocalDistance
) {
// When the reslice plane is changed, update the camera to look at the
// normal to the reslice plane.
const focalPoint = renderer.getActiveCamera().getFocalPoint();
const distance = renderer.getActiveCamera().getDistance();
const estimatedCameraPosition = vtkMath.multiplyAccumulate(
focalPoint,
normal,
distance,
[0, 0, 0]
);
let newFocalPoint = focalPoint;
if (resetFocalPoint) {
// intersect with the plane to get updated focal point
const intersection = vtkPlane.intersectWithLine(
focalPoint,
estimatedCameraPosition,
model.widgetState.getCenter(), // reslice cursor center
normal
);
newFocalPoint = intersection.x;
}
// Update the estimated focal point so that it will be at the same
// distance from the reslice center
if (keepCenterFocalDistance) {
const worldResliceCenter = model.widgetState.getCenter();
const view = renderer.getRenderWindow().getViews()[0];
const dims = view.getViewportSize(renderer);
const aspect = dims[0] / dims[1];
const displayResliceCenter = renderer.worldToNormalizedDisplay(
...worldResliceCenter,
aspect
);
const realOffset = model.widgetState.getCameraOffsets()[viewType];
const displayFocal = vtkMath.add(
displayResliceCenter,
realOffset,
[0, 0, 0]
);
const worldFocal = renderer.normalizedDisplayToWorld(
...displayFocal,
aspect
);
// Reproject focal point on slice in order to keep it on the
// same plane as the reslice cursor center
const intersection2 = vtkPlane.intersectWithLine(
worldFocal,
estimatedCameraPosition,
worldResliceCenter,
normal
);
newFocalPoint[0] = intersection2.x[0];
newFocalPoint[1] = intersection2.x[1];
newFocalPoint[2] = intersection2.x[2];
}
renderer
.getActiveCamera()
.setFocalPoint(newFocalPoint[0], newFocalPoint[1], newFocalPoint[2]);
const newCameraPosition = vtkMath.multiplyAccumulate(
newFocalPoint,
normal,
distance,
[0, 0, 0]
);
renderer
.getActiveCamera()
.setPosition(
newCameraPosition[0],
newCameraPosition[1],
newCameraPosition[2]
);
// Don't clip away any part of the data.
// Renderer may not have yet actor bounds
const bounds = model.widgetState.getImage().getBounds();
if (resetFocalPoint) {
renderer.resetCamera(bounds);
}
renderer.resetCameraClippingRange(bounds);
}
// your_sha256_hash----------
// initialization
// your_sha256_hash----------
model.behavior = widgetBehavior;
model.widgetState = stateGenerator();
publicAPI.getRepresentationsForViewType = (viewType) => {
switch (viewType) {
case ViewTypes.XY_PLANE:
return [
{
builder: vtkResliceCursorContextRepresentation,
labels: ['AxisXinZ', 'AxisYinZ'],
initialValues: {
axis1Name: 'AxisXinZ',
axis2Name: 'AxisYinZ',
viewType: ViewTypes.XY_PLANE,
rotationEnabled: model.widgetState.getEnableRotation(),
},
},
];
case ViewTypes.XZ_PLANE:
return [
{
builder: vtkResliceCursorContextRepresentation,
labels: ['AxisXinY', 'AxisZinY'],
initialValues: {
axis1Name: 'AxisXinY',
axis2Name: 'AxisZinY',
viewType: ViewTypes.XZ_PLANE,
rotationEnabled: model.widgetState.getEnableRotation(),
},
},
];
case ViewTypes.YZ_PLANE:
return [
{
builder: vtkResliceCursorContextRepresentation,
labels: ['AxisYinX', 'AxisZinX'],
initialValues: {
axis1Name: 'AxisYinX',
axis2Name: 'AxisZinX',
viewType: ViewTypes.YZ_PLANE,
rotationEnabled: model.widgetState.getEnableRotation(),
},
},
];
case ViewTypes.DEFAULT:
case ViewTypes.GEOMETRY:
case ViewTypes.SLICE:
case ViewTypes.VOLUME:
default:
return [];
}
};
publicAPI.setImage = (image) => {
model.widgetState.setImage(image);
const center = image.getCenter();
model.widgetState.setCenter(center);
updateState(model.widgetState);
};
publicAPI.setCenter = (center) => {
model.widgetState.setCenter(center);
updateState(model.widgetState);
publicAPI.modified();
};
// your_sha256_hash----------
// Methods
// your_sha256_hash----------
publicAPI.updateCameraPoints = (
renderer,
viewType,
resetFocalPoint,
keepCenterFocalDistance,
computeFocalPointOffset
) => {
publicAPI.resetCamera(
renderer,
viewType,
resetFocalPoint,
keepCenterFocalDistance
);
if (computeFocalPointOffset) {
computeFocalPointOffsetFromResliceCursorCenter(viewType, renderer);
}
};
/**
*
* @param {*} renderer
* @param {*} viewType
* @param {*} resetFocalPoint Defines if the focal point is reset to the image center
* @param {*} keepCenterFocalDistance Defines if the estimated focal point has to be updated
* in order to keep the same distance to the center (according to the computed focal point
* shift)
*/
publicAPI.resetCamera = (
renderer,
viewType,
resetFocalPoint,
keepCenterFocalDistance
) => {
const center = model.widgetState.getImage().getCenter();
const focalPoint = renderer.getActiveCamera().getFocalPoint();
const position = renderer.getActiveCamera().getPosition();
// Distance is preserved
const distance = Math.sqrt(
vtkMath.distance2BetweenPoints(position, focalPoint)
);
const normal = publicAPI.getPlaneNormalFromViewType(viewType);
// ResetFocalPoint will reset focal point to the center of the image
const estimatedFocalPoint = resetFocalPoint ? center : focalPoint;
const estimatedCameraPosition = vtkMath.multiplyAccumulate(
estimatedFocalPoint,
normal,
distance,
[0, 0, 0]
);
renderer.getActiveCamera().setFocalPoint(...estimatedFocalPoint);
renderer.getActiveCamera().setPosition(...estimatedCameraPosition);
renderer
.getActiveCamera()
.setViewUp(model.widgetState.getPlanes()[viewType].viewUp);
// Project focalPoint onto image plane and preserve distance
updateCamera(
renderer,
normal,
viewType,
resetFocalPoint,
keepCenterFocalDistance
);
};
publicAPI.updateReslicePlane = (imageReslice, viewType) => {
// Calculate appropriate pixel spacing for the reslicing
const spacing = model.widgetState.getImage().getSpacing();
// Compute original (i.e. before rotation) plane (i.e. origin, p1, p2)
// centered on cursor center.
const planeSource = computeReslicePlaneOrigin(viewType);
const { normal, viewUp } = model.widgetState.getPlanes()[viewType];
// Adapt plane orientation in order to fit the correct viewUp
// so that the rotations will be more understandable than now.
transformPlane(planeSource, model.widgetState.getCenter(), normal, viewUp);
// Clip to bounds
const boundedOrigin = [...planeSource.getOrigin()];
const boundedP1 = [...planeSource.getPoint1()];
const boundedP2 = [...planeSource.getPoint2()];
boundPlane(
model.widgetState.getImage().getBounds(),
boundedOrigin,
boundedP1,
boundedP2
);
planeSource.setOrigin(...boundedOrigin);
planeSource.setPoint1(...boundedP1);
planeSource.setPoint2(...boundedP2);
const o = planeSource.getOrigin();
const p1 = planeSource.getPoint1();
const planeAxis1 = [];
vtkMath.subtract(p1, o, planeAxis1);
const p2 = planeSource.getPoint2();
const planeAxis2 = [];
vtkMath.subtract(p2, o, planeAxis2);
// The x,y dimensions of the plane
const planeSizeX = vtkMath.normalize(planeAxis1);
const planeSizeY = vtkMath.normalize(planeAxis2);
const newResliceAxes = mat4.identity(new Float64Array(16));
for (let i = 0; i < 3; i++) {
newResliceAxes[4 * i + 0] = planeAxis1[i];
newResliceAxes[4 * i + 1] = planeAxis2[i];
newResliceAxes[4 * i + 2] = normal[i];
}
const spacingX =
Math.abs(planeAxis1[0] * spacing[0]) +
Math.abs(planeAxis1[1] * spacing[1]) +
Math.abs(planeAxis1[2] * spacing[2]);
const spacingY =
Math.abs(planeAxis2[0] * spacing[0]) +
Math.abs(planeAxis2[1] * spacing[1]) +
Math.abs(planeAxis2[2] * spacing[2]);
const planeOrigin = [...planeSource.getOrigin(), 1.0];
const originXYZW = [];
const newOriginXYZW = [];
vec4.transformMat4(originXYZW, planeOrigin, newResliceAxes);
mat4.transpose(newResliceAxes, newResliceAxes);
vec4.transformMat4(newOriginXYZW, originXYZW, newResliceAxes);
newResliceAxes[4 * 3 + 0] = newOriginXYZW[0];
newResliceAxes[4 * 3 + 1] = newOriginXYZW[1];
newResliceAxes[4 * 3 + 2] = newOriginXYZW[2];
// Compute a new set of resliced extents
let extentX = 0;
let extentY = 0;
// Pad extent up to a power of two for efficient texture mapping
// make sure we're working with valid values
const realExtentX =
spacingX === 0 ? Number.MAX_SAFE_INTEGER : planeSizeX / spacingX;
// Sanity check the input data:
// * if realExtentX is too large, extentX will wrap
// * if spacingX is 0, things will blow up.
const value = VTK_INT_MAX >> 1; // eslint-disable-line no-bitwise
if (realExtentX > value) {
vtkErrorMacro(
'Invalid X extent: ',
realExtentX,
' on view type : ',
viewType
);
extentX = 0;
} else {
extentX = 1;
while (extentX < realExtentX) {
extentX <<= 1; // eslint-disable-line no-bitwise
}
}
// make sure extentY doesn't wrap during padding
const realExtentY =
spacingY === 0 ? Number.MAX_SAFE_INTEGER : planeSizeY / spacingY;
if (realExtentY > value) {
vtkErrorMacro(
'Invalid Y extent:',
realExtentY,
' on view type : ',
viewType
);
extentY = 0;
} else {
extentY = 1;
while (extentY < realExtentY) {
extentY <<= 1; // eslint-disable-line no-bitwise
}
}
const outputSpacingX = extentX === 0 ? 1.0 : planeSizeX / extentX;
const outputSpacingY = extentY === 0 ? 1.0 : planeSizeY / extentY;
let modified = imageReslice.setResliceAxes(newResliceAxes);
modified =
imageReslice.setOutputSpacing([outputSpacingX, outputSpacingY, 1]) ||
modified;
modified =
imageReslice.setOutputOrigin([
0.5 * outputSpacingX,
0.5 * outputSpacingY,
0,
]) || modified;
modified =
imageReslice.setOutputExtent([0, extentX - 1, 0, extentY - 1, 0, 0]) ||
modified;
return { modified, origin: o, point1: p1, point2: p2 };
};
/**
* Returns a plane source with origin at cursor center and
* normal from the view.
* @param {ViewType} type: Axial, Coronal or Sagittal
*/
publicAPI.getPlaneSourceFromViewType = (type) => {
const planeSource = vtkPlaneSource.newInstance();
const origin = publicAPI.getWidgetState().getCenter();
const planeNormal = publicAPI.getPlaneNormalFromViewType(type);
planeSource.setNormal(planeNormal);
planeSource.setOrigin(origin);
return planeSource;
};
publicAPI.getPlaneNormalFromViewType = (viewType) =>
publicAPI.getWidgetState().getPlanes()[viewType].normal;
/**
* Returns the normals of the planes that are not viewType.
* @param {ViewType} viewType ViewType to extract other normals
*/
publicAPI.getOtherPlaneNormals = (viewType) =>
[ViewTypes.YZ_PLANE, ViewTypes.XZ_PLANE, ViewTypes.XY_PLANE]
.filter((vt) => vt !== viewType)
.map((vt) => publicAPI.getPlaneNormalFromViewType(vt));
/**
* Return the reslice cursor matrix built as such: [YZ, XZ, XY, center]
*/
publicAPI.getResliceMatrix = () => {
const resliceMatrix = mat4.identity(new Float64Array(16));
for (let i = 0; i < 3; i++) {
resliceMatrix[4 * i + 0] = publicAPI.getPlaneNormalFromViewType(
ViewTypes.YZ_PLANE
)[i];
resliceMatrix[4 * i + 1] = publicAPI.getPlaneNormalFromViewType(
ViewTypes.XZ_PLANE
)[i];
resliceMatrix[4 * i + 2] = publicAPI.getPlaneNormalFromViewType(
ViewTypes.XY_PLANE
)[i];
}
const origin = publicAPI.getWidgetState().getCenter();
const m = vtkMatrixBuilder
.buildFromRadian()
.translate(...origin)
.multiply(resliceMatrix)
.translate(...vtkMath.multiplyScalar([...origin], -1))
.getMatrix();
return m;
};
}
// your_sha256_hash------------
const DEFAULT_VALUES = {};
// your_sha256_hash------------
export function extend(publicAPI, model, initialValues = {}) {
Object.assign(model, DEFAULT_VALUES, initialValues);
vtkAbstractWidgetFactory.extend(publicAPI, model, initialValues);
vtkResliceCursorWidget(publicAPI, model);
}
// your_sha256_hash------------
export const newInstance = macro.newInstance(extend, 'vtkResliceCursorWidget');
// your_sha256_hash------------
export default { newInstance, extend };
```
|
Mones Quintela is a small town in the Artigas Department of northern Uruguay.
Geography
The town is located about south of Bella Unión, on the shores of the Uruguay River and the stream Arroyo Itacumbú, just northeast of Cainsa. It is connected to the Route 3 by a local road.
Origin of name and history
The town takes its name from Alfredo Mones Quintela, an agricultural engineer, once a director of the National Federation of Agricultural Cooperative in the 1950s. The CALPICA sugar plant supported the vast majority of the population for a few decades, and was converted into a cooperative irrigation for vegetable and fruit crops and industrial plant is now used as a deposit for rice.
On 5 and 6 November 2010, Mones Quintela held the first festival of sugarcane in Uruguay and commemorated the 25th anniversary of the denomination of Mones Quintela as a town.
Population
In 2011 Mones Quintela had a population of 531.
Source: Instituto Nacional de Estadística de Uruguay
References
External links
INE map of Mones Quintela
Populated places in the Artigas Department
|
Immanuel Benveniste (also Manuel Benveniste) (1608 in Venice – c. 1660 in Amsterdam) was an Italian Jewish printer in Amsterdam who printed many Hebrew works including an edition of the Talmud from 1644-48. He was one of a number of notable Portuguese Jewish printers at Amsterdam in the seventeenth century, including Manasseh ben Israel, David de Castro Tartas, and Joseph and Immanuel Athias. Benveniste also published the sermons of Saul Levi Morteira in 1652.
Benveniste’s printer’s device (which may have been the family escutcheon) showed an upright lion facing a tower with a star above. Apparently, later printers often “borrowed” this mark for various reasons. The first to do so were Ben Judah ben Mordecai of Posen and Samuel ben Moses ha-Levi, Ashkenazic printers who had previously worked for Benveniste. In their case, Benveniste presumably allowed them to use the mark, perhaps as a show of support for his former employees.
References
1608 births
1660 deaths
17th-century printers
17th-century Sephardi Jews
Dutch Sephardi Jews
Dutch printers
Jewish printing and publishing
Businesspeople from Amsterdam
Republic of Venice printers
17th-century Dutch businesspeople
|
```shell
#!/bin/bash
# Executed within a fresh Docker container to test installation and execution of Yarn.
set -ex
. /etc/lsb-release
# Set proxy if one was passed in (eg. if caching on the host machine using apt-cacher-ng)
if [ -n "$APT_PROXY" ]; then
echo 'Acquire::http::proxy "path_to_url";' > /etc/apt/apt.conf.d/02proxy
fi;
# Add Yarn repo
apt-key adv --fetch-keys path_to_url
echo "deb path_to_url nightly main" > /etc/apt/sources.list.d/yarn.list
# Check if this is an old Ubuntu version that needs the NodeSource repo
if [ "$DISTRIB_RELEASE" == '14.04' ]; then
apt-key adv --fetch-keys path_to_url
echo 'deb path_to_url trusty main' > /etc/apt/sources.list.d/nodesource.list
elif [ "$DISTRIB_RELEASE" == '12.04' ]; then
apt-key adv --fetch-keys path_to_url
echo 'deb path_to_url precise main' > /etc/apt/sources.list.d/nodesource.list
fi;
apt-get update -y
# TODO: Remove ca-certificates from this list once path_to_url is fixed
apt-get install yarn ca-certificates -y
./run-yarn-test.sh
```
|
Portuguese Cove is a rural community in the Halifax Regional Municipality, Nova Scotia on Route 349 on the Chebucto Peninsula .
History
The name comes from the Portuguese fishermen who for many years sailed in the summer months fishing in the 18th century. During the War of 1812, the community received the 133 passengers from the wreck of . A local fishing vessel discovered the passengers in three small vessels stranded in the fog and guided them to safety at Portuguese Cove. Captain Hickey reported, the "inhabitants of Portuguese cove behaved towards us all with every possible mark of hospitality, kindness, and attention, that humanity could dictate."
References
External links
Destination Nova Scotia
Explore HRM
Communities in Halifax, Nova Scotia
General Service Areas in Nova Scotia
|
```objective-c
// Aseprite Document Library
//
// This file is released under the terms of the MIT license.
// Read LICENSE.txt for more information.
#pragma once
#include "doc/frame.h"
namespace doc {
class FrameTag;
class Sprite;
frame_t calculate_next_frame(
const Sprite* sprite,
frame_t frame,
frame_t frameDelta,
const FrameTag* tag,
bool& pingPongForward);
} // namespace doc
```
|
```objective-c
//
//
/***
*internal.h - contains declarations of internal routines and variables
*
*
*Purpose:
* Declares routines and variables used internally by the C run-time.
*
* [Internal]
*
****/
#if _MSC_VER > 1000
#pragma once
#endif /* _MSC_VER > 1000 */
#ifndef _INC_INTERNAL
#define _INC_INTERNAL
#include <crtdefs.h>
#ifdef __cplusplus
extern "C" {
#endif /* __cplusplus */
#include <cruntime.h>
#include <limits.h>
/*
* Conditionally include windows.h to pick up the definition of
* CRITICAL_SECTION.
*/
#include <windows.h>
#ifdef _MSC_VER
#pragma pack(push,_CRT_PACKING)
#endif /* _MSC_VER */
/* Define function types used in several startup sources */
typedef void (__cdecl *_PVFV)(void);
typedef int (__cdecl *_PIFV)(void);
typedef void (__cdecl *_PVFI)(int);
#if _MSC_VER >= 1400 && defined(_M_CEE)
typedef const void* (__clrcall *_PVFVM)(void);
typedef int (__clrcall *_PIFVM)(void);
typedef void (__clrcall *_CPVFV)(void);
#endif /* _MSC_VER >= 1400 && defined(_M_CEE) */
#if defined (_M_CEE_PURE) || (defined (_DLL) && defined (_M_IX86))
/* Retained for compatibility with VC++ 5.0 and earlier versions */
_CRTIMP int * __cdecl __p__commode(void);
#endif /* defined (_M_CEE_PURE) || (defined (_DLL) && defined (_M_IX86)) */
#if defined (SPECIAL_CRTEXE) && defined (_DLL)
extern int _commode;
#else /* defined (SPECIAL_CRTEXE) && defined (_DLL) */
#ifndef _M_CEE_PURE
_CRTIMP extern int _commode;
#else /* _M_CEE_PURE */
#define _commode (*__p___commode())
#endif /* _M_CEE_PURE */
#endif /* defined (SPECIAL_CRTEXE) && defined (_DLL) */
#define __IOINFO_TM_ANSI 0 /* Regular Text */
#define __IOINFO_TM_UTF8 1 /* UTF8 Encoded */
#define __IOINFO_TM_UTF16LE 2 /* UTF16 Little Endian Encoded */
/*
* Control structure for lowio file handles
*/
typedef struct {
intptr_t osfhnd; /* underlying OS file HANDLE */
char osfile; /* attributes of file (e.g., open in text mode?) */
char pipech; /* one char buffer for handles opened on pipes */
int lockinitflag;
CRITICAL_SECTION lock;
#ifndef _SAFECRT_IMPL
/* Not used in the safecrt downlevel. We do not define them, so we cannot use them accidentally */
char textmode : 7; /* __IOINFO_TM_ANSI or __IOINFO_TM_UTF8 or __IOINFO_TM_UTF16LE */
char unicode : 1; /* Was the file opened as unicode? */
char pipech2[2]; /* 2 more peak ahead chars for UNICODE mode */
#endif /* _SAFECRT_IMPL */
} ioinfo;
/*
* Definition of IOINFO_L2E, the log base 2 of the number of elements in each
* array of ioinfo structs.
*/
#define IOINFO_L2E 5
/*
* Definition of IOINFO_ARRAY_ELTS, the number of elements in ioinfo array
*/
#define IOINFO_ARRAY_ELTS (1 << IOINFO_L2E)
/*
* Definition of IOINFO_ARRAYS, maximum number of supported ioinfo arrays.
*/
#define IOINFO_ARRAYS 64
#define _NHANDLE_ (IOINFO_ARRAYS * IOINFO_ARRAY_ELTS)
#define _TZ_STRINGS_SIZE 64
/*
* Access macros for getting at an ioinfo struct and its fields from a
* file handle
*/
#define _pioinfo(i) ( __pioinfo[(i) >> IOINFO_L2E] + ((i) & (IOINFO_ARRAY_ELTS - \
1)) )
#define _osfhnd(i) ( _pioinfo(i)->osfhnd )
#define _osfile(i) ( _pioinfo(i)->osfile )
#define _pipech(i) ( _pioinfo(i)->pipech )
#define _pipech2(i) ( _pioinfo(i)->pipech2 )
#define _textmode(i) ( _pioinfo(i)->textmode )
#define _tm_unicode(i) ( _pioinfo(i)->unicode )
/*
* Safer versions of the above macros. Currently, only _osfile_safe is
* used.
*/
#define _pioinfo_safe(i) ( (((i) != -1) && ((i) != -2)) ? _pioinfo(i) : &__badioinfo )
#define _osfhnd_safe(i) ( _pioinfo_safe(i)->osfhnd )
#define _osfile_safe(i) ( _pioinfo_safe(i)->osfile )
#define _pipech_safe(i) ( _pioinfo_safe(i)->pipech )
#define _pipech2_safe(i) ( _pioinfo_safe(i)->pipech2 )
#ifdef _SAFECRT_IMPL
/* safecrt does not have support for textmode, so we always return __IOINFO_TM_ANSI */
#define _textmode_safe(i) __IOINFO_TM_ANSI
#define _tm_unicode_safe(i) 0
#else /* _SAFECRT_IMPL */
#define _textmode_safe(i) ( _pioinfo_safe(i)->textmode )
#define _tm_unicode_safe(i) ( _pioinfo_safe(i)->unicode )
#endif /* _SAFECRT_IMPL */
#ifndef _M_CEE_PURE
#ifdef _SAFECRT_IMPL
/* We need to get this from the downlevel DLL, even when we build safecrt.lib */
extern __declspec(dllimport) ioinfo __badioinfo;
extern __declspec(dllimport) ioinfo * __pioinfo[];
#else /* _SAFECRT_IMPL */
/*
* Special, static ioinfo structure used only for more graceful handling
* of a C file handle value of -1 (results from common errors at the stdio
* level).
*/
extern _CRTIMP ioinfo __badioinfo;
/*
* Array of arrays of control structures for lowio files.
*/
extern _CRTIMP ioinfo * __pioinfo[];
#endif /* _SAFECRT_IMPL */
#endif /* _M_CEE_PURE */
/*
* Current number of allocated ioinfo structures (_NHANDLE_ is the upper
* limit).
*/
extern int _nhandle;
int __cdecl _alloc_osfhnd(void);
int __cdecl _free_osfhnd(int);
int __cdecl _set_osfhnd(int, intptr_t);
/*
fileno for stdout, stdin & stderr when there is no console
*/
#define _NO_CONSOLE_FILENO (intptr_t)-2
extern const char __dnames[];
extern const char __mnames[];
extern int _days[];
extern int _lpdays[];
extern __time32_t __cdecl __loctotime32_t(int, int, int, int, int, int, int);
extern __time64_t __cdecl __loctotime64_t(int, int, int, int, int, int, int);
#ifdef _TM_DEFINED
extern int __cdecl _isindst(__in struct tm * _Time);
#endif /* _TM_DEFINED */
extern void __cdecl __tzset(void);
extern int __cdecl _validdrive(unsigned);
/*
* If we are only interested in years between 1901 and 2099, we could use this:
*
* #define IS_LEAP_YEAR(y) (y % 4 == 0)
*/
#define IS_LEAP_YEAR(y) (((y) % 4 == 0 && (y) % 100 != 0) || (y) % 400 == 0)
/*
* get the buffer used by gmtime
*/
struct tm * __cdecl __getgmtimebuf ();
/*
* This variable is in the C start-up; the length must be kept synchronized
* It is used by the *cenvarg.c modules
*/
extern char _acfinfo[]; /* "_C_FILE_INFO=" */
#define CFI_LENGTH 12 /* "_C_FILE_INFO" is 12 bytes long */
/*
* stdio internals
*/
#ifndef _FILE_DEFINED
struct _iobuf {
char *_ptr;
int _cnt;
char *_base;
int _flag;
int _file;
int _charbuf;
int _bufsiz;
char *_tmpfname;
};
typedef struct _iobuf FILE;
#define _FILE_DEFINED
#endif /* _FILE_DEFINED */
#if !defined (_FILEX_DEFINED) && defined (_WINDOWS_)
/*
* Variation of FILE type used for the dynamically allocated portion of
* __piob[]. For single thread, _FILEX is the same as FILE. For multithread
* models, _FILEX has two fields: the FILE struct and the CRITICAL_SECTION
* struct used to serialize access to the FILE.
*/
typedef struct {
FILE f;
CRITICAL_SECTION lock;
} _FILEX;
#define _FILEX_DEFINED
#endif /* !defined (_FILEX_DEFINED) && defined (_WINDOWS_) */
/*
* Number of entries supported in the array pointed to by __piob[]. That is,
* the number of stdio-level files which may be open simultaneously. This
* is normally set to _NSTREAM_ by the stdio initialization code.
*/
extern int _nstream;
/*
* Pointer to the array of pointers to FILE/_FILEX structures that are used
* to manage stdio-level files.
*/
extern void **__piob;
FILE * __cdecl _getstream(void);
FILE * __cdecl _openfile(__in_z const char * _Filename, __in_z const char * _Mode, __in int _ShFlag, __out FILE * _File);
FILE * __cdecl _wopenfile(__in_z const char16_t * _Filename, __in_z const char16_t * _Mode, __in int _ShFlag, __out FILE * _File);
void __cdecl _getbuf(__out FILE * _File);
int __cdecl _filwbuf (__inout FILE * _File);
int __cdecl _flswbuf(__in int _Ch, __inout FILE * _File);
void __cdecl _freebuf(__inout FILE * _File);
int __cdecl _stbuf(__inout FILE * _File);
void __cdecl _ftbuf(int _Flag, __inout FILE * _File);
#ifdef _SAFECRT_IMPL
int __cdecl _output(__inout FILE * _File, __in_z __format_string const char *_Format, va_list _ArgList);
int __cdecl _woutput(__inout FILE * _File, __in_z __format_string const char16_t *_Format, va_list _ArgList);
int __cdecl _output_s(__inout FILE * _File, __in_z __format_string const char *_Format, va_list _ArgList);
int __cdecl _output_p(__inout FILE * _File, __in_z __format_string const char *_Format, va_list _ArgList);
int __cdecl _woutput_s(__inout FILE * _File, __in_z __format_string const char16_t *_Format, va_list _ArgList);
int __cdecl _woutput_p(__inout FILE * _File, __in_z __format_string const char16_t *_Format, va_list _ArgList);
typedef int (*OUTPUTFN)(FILE *, const char *, va_list);
typedef int (*WOUTPUTFN)(FILE *, const char16_t *, va_list);
#else /* _SAFECRT_IMPL */
int __cdecl _output_l(__inout FILE * _File, __in_z __format_string const char *_Format, __in_opt _locale_t _Locale, va_list _ArgList);
int __cdecl _woutput_l(__inout FILE * _File, __in_z __format_string const char16_t *_Format, __in_opt _locale_t _Locale, va_list _ArgList);
int __cdecl _output_s_l(__inout FILE * _File, __in_z __format_string const char *_Format, __in_opt _locale_t _Locale, va_list _ArgList);
int __cdecl _output_p_l(__inout FILE * _File, __in_z __format_string const char *_Format, __in_opt _locale_t _Locale, va_list _ArgList);
int __cdecl _woutput_s_l(__inout FILE * _File, __in_z __format_string const char16_t *_Format, __in_opt _locale_t _Locale, va_list _ArgList);
int __cdecl _woutput_p_l(__inout FILE * _File, __in_z __format_string const char16_t *_Format, __in_opt _locale_t _Locale, va_list _ArgList);
typedef int (*OUTPUTFN)(__inout FILE * _File, const char *, _locale_t, va_list);
typedef int (*WOUTPUTFN)(__inout FILE * _File, const char16_t *, _locale_t, va_list);
#endif /* _SAFECRT_IMPL */
#ifdef _SAFECRT_IMPL
int __cdecl _input(__in FILE * _File, __in_z __format_string const unsigned char * _Format, va_list _ArgList);
int __cdecl _winput(__in FILE * _File, __in_z __format_string const char16_t * _Format, va_list _ArgList);
int __cdecl _input_s(__in FILE * _File, __in_z __format_string const unsigned char * _Format, va_list _ArgList);
int __cdecl _winput_s(__in FILE * _File, __in_z __format_string const char16_t * _Format, va_list _ArgList);
typedef int (*INPUTFN)(FILE *, const unsigned char *, va_list);
typedef int (*WINPUTFN)(FILE *, const char16_t *, va_list);
#else /* _SAFECRT_IMPL */
int __cdecl _input_l(__inout FILE * _File, __in_z __format_string const unsigned char *, __in_opt _locale_t _Locale, va_list _ArgList);
int __cdecl _winput_l(__inout FILE * _File, __in_z __format_string const char16_t *, __in_opt _locale_t _Locale, va_list _ArgList);
int __cdecl _input_s_l(__inout FILE * _File, __in_z __format_string const unsigned char *, __in_opt _locale_t _Locale, va_list _ArgList);
int __cdecl _winput_s_l(__inout FILE * _File, __in_z __format_string const char16_t *, __in_opt _locale_t _Locale, va_list _ArgList);
typedef int (*INPUTFN)(FILE *, const unsigned char *, _locale_t, va_list);
typedef int (*WINPUTFN)(FILE *, const char16_t *, _locale_t, va_list);
#ifdef _UNICODE
#define TINPUTFN WINPUTFN
#else /* _UNICODE */
#define TINPUTFN INPUTFN
#endif /* _UNICODE */
#endif /* _SAFECRT_IMPL */
int __cdecl _flush(__inout FILE * _File);
void __cdecl _endstdio(void);
errno_t __cdecl _sopen_helper(__in_z const char * _Filename,
__in int _OFlag, __in int _ShFlag, __in int _PMode,
__out int * _PFileHandle, int _BSecure);
errno_t __cdecl _wsopen_helper(__in_z const char16_t * _Filename,
__in int _OFlag, __in int _ShFlag, __in int _PMode,
__out int * _PFileHandle, int _BSecure);
#ifndef CRTDLL
extern int _cflush;
#endif /* CRTDLL */
extern unsigned int _tempoff;
extern unsigned int _old_pfxlen;
extern int _umaskval; /* the umask value */
extern char _pipech[]; /* pipe lookahead */
extern char _exitflag; /* callable termination flag */
extern int _C_Termination_Done; /* termination done flag */
char * __cdecl _getpath(__in_z const char * _Src, __out_ecount_z(_SizeInChars) char * _Dst, __in size_t _SizeInChars);
char16_t * __cdecl _wgetpath(__in_z const char16_t * _Src, __out_ecount_z(_SizeInWords) char16_t * _Dst, __in size_t _SizeInWords);
extern int _dowildcard; /* flag to enable argv[] wildcard expansion */
#ifndef _PNH_DEFINED
typedef int (__cdecl * _PNH)( size_t );
#define _PNH_DEFINED
#endif /* _PNH_DEFINED */
#if _MSC_VER >= 1400 && defined(_M_CEE)
#ifndef __MPNH_DEFINED
typedef int (__clrcall * __MPNH)( size_t );
#define __MPNH_DEFINED
#endif /* __MPNH_DEFINED */
#endif /* _MSC_VER >= 1400 && defined(_M_CEE) */
/* calls the currently installed new handler */
int __cdecl _callnewh(__in size_t _Size);
extern int _newmode; /* malloc new() handler mode */
/* pointer to initial environment block that is passed to [w]main */
#ifndef _M_CEE_PURE
extern _CRTIMP char16_t **__winitenv;
extern _CRTIMP char **__initenv;
#endif /* _M_CEE_PURE */
/* _calloca helper */
#define _calloca(count, size) ((count<=0 || size<=0 || ((((size_t)_HEAP_MAXREQ) / ((size_t)count)) < ((size_t)size)))? NULL : _malloca(count * size))
/* startup set values */
extern char *_aenvptr; /* environment ptr */
extern char16_t *_wenvptr; /* wide environment ptr */
/* command line */
#if defined (_DLL)
_CRTIMP char ** __cdecl __p__acmdln(void);
_CRTIMP char16_t ** __cdecl __p__wcmdln(void);
#endif /* defined (_DLL) */
#ifndef _M_CEE_PURE
_CRTIMP extern char *_acmdln;
_CRTIMP extern char16_t *_wcmdln;
#else /* _M_CEE_PURE */
#define _acmdln (*__p__acmdln())
#define _wcmdln (*__p__wcmdln())
#endif /* _M_CEE_PURE */
/*
* prototypes for internal startup functions
*/
int __cdecl _cwild(void); /* wild.c */
int __cdecl _wcwild(void); /* wwild.c */
int __cdecl _mtinit(void); /* tidtable.c */
void __cdecl _mtterm(void); /* tidtable.c */
int __cdecl _mtinitlocks(void); /* mlock.c */
void __cdecl _mtdeletelocks(void); /* mlock.c */
int __cdecl _mtinitlocknum(int); /* mlock.c */
/* Wrapper for InitializeCriticalSection API, with default spin count */
int __cdecl __crtInitCritSecAndSpinCount(PCRITICAL_SECTION, DWORD);
#define _CRT_SPINCOUNT 4000
/*
* C source build only!!!!
*
* more prototypes for internal startup functions
*/
void __cdecl _amsg_exit(int); /* crt0.c */
void __cdecl __crtExitProcess(int); /* crt0dat.c */
void __cdecl __crtCorExitProcess(int); /* crt0dat.c */
void __cdecl __crtdll_callstaticterminators(void); /* crt0dat.c */
/*
_cinit now allows the caller to suppress floating point precision init
This allows the DLLs that use the CRT to not initialise FP precision,
allowing the EXE's setting to persist even when a DLL is loaded
*/
int __cdecl _cinit(int /* initFloatingPrecision */); /* crt0dat.c */
void __cdecl __doinits(void); /* astart.asm */
void __cdecl __doterms(void); /* astart.asm */
void __cdecl __dopreterms(void); /* astart.asm */
void __cdecl _FF_MSGBANNER(void);
void __cdecl _fpmath(int /*initPrecision*/);
void __cdecl _fpclear(void);
void __cdecl _fptrap(void); /* crt0fp.c */
int __cdecl _heap_init(int);
void __cdecl _heap_term(void);
void __cdecl _heap_abort(void);
void __cdecl __initconin(void); /* initcon.c */
void __cdecl __initconout(void); /* initcon.c */
int __cdecl _ioinit(void); /* crt0.c, crtlib.c */
void __cdecl _ioterm(void); /* crt0.c, crtlib.c */
char * __cdecl _GET_RTERRMSG(int);
void __cdecl _NMSG_WRITE(int);
int __CRTDECL _setargv(void); /* setargv.c, stdargv.c */
int __CRTDECL __setargv(void); /* stdargv.c */
int __CRTDECL _wsetargv(void); /* wsetargv.c, wstdargv.c */
int __CRTDECL __wsetargv(void); /* wstdargv.c */
int __cdecl _setenvp(void); /* stdenvp.c */
int __cdecl _wsetenvp(void); /* wstdenvp.c */
void __cdecl __setmbctable(unsigned int); /* mbctype.c */
#ifdef MRTDLL
_MRTIMP int __cdecl _onexit_process(_CPVFV);
_MRTIMP int __cdecl _onexit_app_domain(_CPVFV);
#endif /* MRTDLL */
#ifdef _MBCS
int __cdecl __initmbctable(void); /* mbctype.c */
#endif /* _MBCS */
#ifndef _MANAGED_MAIN
int __CRTDECL main(__in int _Argc, __in_ecount_z(_Argc) char ** _Argv, __in_z char ** _Env);
int __CRTDECL wmain(__in int _Argc, __in_ecount_z(_Argc) char16_t ** _Argv, __in_z char16_t ** _Env);
#endif /* _MANAGED_MAIN */
/* helper functions for wide/multibyte environment conversion */
int __cdecl __mbtow_environ (void);
int __cdecl __wtomb_environ (void);
/* These two functions take a char ** for the environment option
At some point during their execution, they take ownership of the
memory block passed in using option. At this point, they
NULL out the incoming char * / char16_t * to ensure there is no
double-free
*/
int __cdecl __crtsetenv (__deref_inout_opt char ** _POption, __in const int _Primary);
int __cdecl __crtwsetenv (__deref_inout_opt char16_t ** _POption, __in const int _Primary);
#ifndef _M_CEE_PURE
_CRTIMP extern void (__cdecl * _aexit_rtn)(int);
#endif /* _M_CEE_PURE */
#if defined (_DLL) || defined (CRTDLL)
#ifndef _STARTUP_INFO_DEFINED
typedef struct
{
int newmode;
} _startupinfo;
#define _STARTUP_INFO_DEFINED
#endif /* _STARTUP_INFO_DEFINED */
_CRTIMP int __cdecl __getmainargs(__out int * _Argc, __deref_out_ecount(*_Argc) char *** _Argv,
__deref_out_opt char *** _Env, __in int _DoWildCard,
__in _startupinfo * _StartInfo);
_CRTIMP int __cdecl __wgetmainargs(__out int * _Argc, __deref_out_ecount(*_Argc)char16_t *** _Argv,
__deref_out_opt char16_t *** _Env, __in int _DoWildCard,
__in _startupinfo * _StartInfo);
#endif /* defined (_DLL) || defined (CRTDLL) */
/*
* Prototype, variables and constants which determine how error messages are
* written out.
*/
#define _UNKNOWN_APP 0
#define _CONSOLE_APP 1
#define _GUI_APP 2
extern int __app_type;
#if !defined (_M_CEE_PURE)
extern Volatile<void*> __native_startup_lock;
#define __NO_REASON UINT_MAX
extern Volatile<unsigned int> __native_dllmain_reason;
extern Volatile<unsigned int> __native_vcclrit_reason;
#if defined (__cplusplus)
#pragma warning(push)
#pragma warning(disable: 4483)
#if _MSC_FULL_VER >= 140050415
#define _NATIVE_STARTUP_NAMESPACE __identifier("<CrtImplementationDetails>")
#else /* _MSC_FULL_VER >= 140050415 */
#define _NATIVE_STARTUP_NAMESPACE __CrtImplementationDetails
#endif /* _MSC_FULL_VER >= 140050415 */
namespace _NATIVE_STARTUP_NAMESPACE
{
class NativeDll
{
private:
static const unsigned int ProcessDetach = 0;
static const unsigned int ProcessAttach = 1;
static const unsigned int ThreadAttach = 2;
static const unsigned int ThreadDetach = 3;
static const unsigned int ProcessVerifier = 4;
public:
inline static bool IsInDllMain()
{
return (__native_dllmain_reason != __NO_REASON);
}
inline static bool IsInProcessAttach()
{
return (__native_dllmain_reason == ProcessAttach);
}
inline static bool IsInProcessDetach()
{
return (__native_dllmain_reason == ProcessDetach);
}
inline static bool IsInVcclrit()
{
return (__native_vcclrit_reason != __NO_REASON);
}
inline static bool IsSafeForManagedCode()
{
if (!IsInDllMain())
{
return true;
}
if (IsInVcclrit())
{
return true;
}
return !IsInProcessAttach() && !IsInProcessDetach();
}
};
}
#pragma warning(pop)
#endif /* defined (__cplusplus) */
#endif /* !defined (_M_CEE_PURE) */
extern int __error_mode;
_CRTIMP void __cdecl __set_app_type(int);
#if defined (CRTDLL) && !defined (_SYSCRT)
/*
* All these function pointer are used for creating global state of CRT
* functions. Either all of them will be set or all of them will be NULL
*/
typedef void (__cdecl *_set_app_type_function)(int);
typedef int (__cdecl *_get_app_type_function)();
extern _set_app_type_function __set_app_type_server;
extern _get_app_type_function __get_app_type_server;
#endif /* defined (CRTDLL) && !defined (_SYSCRT) */
/*
* C source build only!!!!
*
* map Win32 errors into Xenix errno values -- for modules written in C
*/
_CRTIMP void __cdecl _dosmaperr(unsigned long);
extern int __cdecl _get_errno_from_oserr(unsigned long);
/*
* internal routines used by the exec/spawn functions
*/
extern intptr_t __cdecl _dospawn(__in int _Mode, __in_z_opt const char * _Name, __inout_z char * _Cmd, __in_z_opt char * _Env);
extern intptr_t __cdecl _wdospawn(__in int _Mode, __in_z_opt const char16_t * _Name, __inout_z char16_t * _Cmd, __in_z_opt char16_t * _Env);
extern int __cdecl _cenvarg(__in_z const char * const * _Argv, __in_z_opt const char * const * _Env,
__deref_out_opt char ** _ArgBlk, __deref_out_opt char ** _EnvBlk, __in_z const char *_Name);
extern int __cdecl _wcenvarg(__in_z const char16_t * const * _Argv, __in_z_opt const char16_t * const * _Env,
__deref_out_opt char16_t ** _ArgBlk, __deref_out_opt char16_t ** _EnvBlk, __in_z const char16_t * _Name);
#ifndef _M_IX86
extern char ** _capture_argv(__in va_list *, __in_z const char * _FirstArg, __out_ecount_z(_MaxCount) char ** _Static_argv, __in size_t _MaxCount);
extern char16_t ** _wcapture_argv(__in va_list *, __in_z const char16_t * _FirstArg, __out_ecount_z(_MaxCount) char16_t ** _Static_argv, __in size_t _MaxCount);
#endif /* _M_IX86 */
/*
* internal routine used by the abort
*/
extern _PHNDLR __cdecl __get_sigabrt(void);
/*
* Type from ntdef.h
*/
typedef LONG NTSTATUS;
/*
* Exception code used in _invalid_parameter
*/
#ifndef STATUS_INVALID_PARAMETER
#define STATUS_INVALID_PARAMETER ((NTSTATUS)0xC000000DL)
#endif /* STATUS_INVALID_PARAMETER */
/*
* Exception code used for abort and _CALL_REPORTFAULT
*/
#ifndef STATUS_FATAL_APP_EXIT
#define STATUS_FATAL_APP_EXIT ((NTSTATUS)0x40000015L)
#endif /* STATUS_FATAL_APP_EXIT */
/*
* Validate functions
*/
#include <crtdbg.h> /* _ASSERTE */
#include <errno.h>
#define __STR2WSTR(str) L##str
#define _STR2WSTR(str) __STR2WSTR(str)
#define __FILEW__ _STR2WSTR(__FILE__)
#define __FUNCTIONW__ _STR2WSTR(__FUNCTION__)
/* We completely fill the buffer only in debug (see _SECURECRT__FILL_STRING
* and _SECURECRT__FILL_BYTE macros).
*/
#if !defined (_SECURECRT_FILL_BUFFER)
#ifdef _DEBUG
#define _SECURECRT_FILL_BUFFER 1
#else /* _DEBUG */
#define _SECURECRT_FILL_BUFFER 0
#endif /* _DEBUG */
#endif /* !defined (_SECURECRT_FILL_BUFFER) */
#ifndef _SAFECRT_IMPL
/* _invalid_parameter is already defined in safecrt.h and safecrt.lib */
#if !defined (_NATIVE_char16_t_DEFINED) && defined (_M_CEE_PURE)
extern "C++"
#endif /* !defined (_NATIVE_char16_t_DEFINED) && defined (_M_CEE_PURE) */
_CRTIMP
#endif /* _SAFECRT_IMPL */
void __cdecl _invalid_parameter(__in_z_opt const char16_t *, __in_z_opt const char16_t *, __in_z_opt const char16_t *, unsigned int, uintptr_t);
#if !defined (_NATIVE_char16_t_DEFINED) && defined (_M_CEE_PURE)
extern "C++"
#endif /* !defined (_NATIVE_char16_t_DEFINED) && defined (_M_CEE_PURE) */
_CRTIMP
void __cdecl _invoke_watson(__in_z_opt const char16_t *, __in_z_opt const char16_t *, __in_z_opt const char16_t *, unsigned int, uintptr_t);
#ifndef _DEBUG
#if !defined (_NATIVE_char16_t_DEFINED) && defined (_M_CEE_PURE)
extern "C++"
#endif /* !defined (_NATIVE_char16_t_DEFINED) && defined (_M_CEE_PURE) */
_CRTIMP
void __cdecl _invalid_parameter_noinfo(void);
#endif /* _DEBUG */
/* Invoke Watson if _ExpressionError is not 0; otherwise simply return _EspressionError */
__forceinline
void _invoke_watson_if_error(
errno_t _ExpressionError,
const char16_t *_Expression,
const char16_t *_Function,
const char16_t *_File,
unsigned int _Line,
uintptr_t _Reserved
)
{
if (_ExpressionError == 0)
{
return;
}
_invoke_watson(_Expression, _Function, _File, _Line, _Reserved);
}
/* Invoke Watson if _ExpressionError is not 0 and equal to _ErrorValue1 or _ErrorValue2; otherwise simply return _EspressionError */
__forceinline
errno_t _invoke_watson_if_oneof(
errno_t _ExpressionError,
errno_t _ErrorValue1,
errno_t _ErrorValue2,
const char16_t *_Expression,
const char16_t *_Function,
const char16_t *_File,
unsigned int _Line,
uintptr_t _Reserved
)
{
if (_ExpressionError == 0 || (_ExpressionError != _ErrorValue1 && _ExpressionError != _ErrorValue2))
{
return _ExpressionError;
}
_invoke_watson(_Expression, _Function, _File, _Line, _Reserved);
return _ExpressionError;
}
/*
* Assert in debug builds.
* set errno and return
*
*/
#ifdef _DEBUG
#define _CALL_INVALID_PARAMETER_FUNC(funcname, expr) funcname(expr, __FUNCTIONW__, __FILEW__, __LINE__, 0)
#define _INVOKE_WATSON_IF_ERROR(expr) _invoke_watson_if_error((expr), __STR2WSTR(#expr), __FUNCTIONW__, __FILEW__, __LINE__, 0)
#define _INVOKE_WATSON_IF_ONEOF(expr, errvalue1, errvalue2) _invoke_watson_if_oneof(expr, (errvalue1), (errvalue2), __STR2WSTR(#expr), __FUNCTIONW__, __FILEW__, __LINE__, 0)
#else /* _DEBUG */
#define _CALL_INVALID_PARAMETER_FUNC(funcname, expr) funcname(NULL, NULL, NULL, 0, 0)
#define _INVOKE_WATSON_IF_ERROR(expr) _invoke_watson_if_error(expr, NULL, NULL, NULL, 0, 0)
#define _INVOKE_WATSON_IF_ONEOF(expr, errvalue1, errvalue2) _invoke_watson_if_oneof((expr), (errvalue1), (errvalue2), NULL, NULL, NULL, 0, 0)
#endif /* _DEBUG */
#define _INVALID_PARAMETER(expr) _CALL_INVALID_PARAMETER_FUNC(_invalid_parameter, expr)
#define _VALIDATE_RETURN_VOID( expr, errorcode ) \
{ \
int _Expr_val=!!(expr); \
_ASSERT_EXPR( ( _Expr_val ), _CRT_WIDE(#expr) ); \
if ( !( _Expr_val ) ) \
{ \
errno = errorcode; \
_INVALID_PARAMETER(_CRT_WIDE(#expr)); \
return; \
} \
}
/*
* Assert in debug builds.
* set errno and return value
*/
#ifndef _VALIDATE_RETURN
#define _VALIDATE_RETURN( expr, errorcode, retexpr ) \
{ \
int _Expr_val=!!(expr); \
_ASSERT_EXPR( ( _Expr_val ), _CRT_WIDE(#expr) ); \
if ( !( _Expr_val ) ) \
{ \
errno = errorcode; \
_INVALID_PARAMETER(_CRT_WIDE(#expr) ); \
return ( retexpr ); \
} \
}
#endif /* _VALIDATE_RETURN */
#ifndef _VALIDATE_RETURN_NOEXC
#define _VALIDATE_RETURN_NOEXC( expr, errorcode, retexpr ) \
{ \
if ( !(expr) ) \
{ \
errno = errorcode; \
return ( retexpr ); \
} \
}
#endif /* _VALIDATE_RETURN_NOEXC */
/*
* Assert in debug builds.
* set errno and set retval for later usage
*/
#define _VALIDATE_SETRET( expr, errorcode, retval, retexpr ) \
{ \
int _Expr_val=!!(expr); \
_ASSERT_EXPR( ( _Expr_val ), _CRT_WIDE(#expr) ); \
if ( !( _Expr_val ) ) \
{ \
errno = errorcode; \
_INVALID_PARAMETER(_CRT_WIDE(#expr)); \
retval=( retexpr ); \
} \
}
#define _CHECK_FH_RETURN( handle, errorcode, retexpr ) \
{ \
if(handle == _NO_CONSOLE_FILENO) \
{ \
errno = errorcode; \
return ( retexpr ); \
} \
}
/*
We use _VALIDATE_STREAM_ANSI_RETURN to ensure that ANSI file operations(
fprintf etc) aren't called on files opened as UNICODE. We do this check
only if it's an actual FILE pointer & not a string
*/
#define _VALIDATE_STREAM_ANSI_RETURN( stream, errorcode, retexpr ) \
{ \
FILE *_Stream=stream; \
_VALIDATE_RETURN(( (_Stream->_flag & _IOSTRG) || \
( (_textmode_safe(_fileno(_Stream)) == __IOINFO_TM_ANSI) && \
!_tm_unicode_safe(_fileno(_Stream)))), \
errorcode, retexpr) \
}
/*
We use _VALIDATE_STREAM_ANSI_SETRET to ensure that ANSI file operations(
fprintf etc) aren't called on files opened as UNICODE. We do this check
only if it's an actual FILE pointer & not a string. It doesn't actually return
immediately
*/
#define _VALIDATE_STREAM_ANSI_SETRET( stream, errorcode, retval, retexpr) \
{ \
FILE *_Stream=stream; \
_VALIDATE_SETRET(( (_Stream->_flag & _IOSTRG) || \
( (_textmode_safe(_fileno(_Stream)) == __IOINFO_TM_ANSI) && \
!_tm_unicode_safe(_fileno(_Stream)))), \
errorcode, retval, retexpr) \
}
/*
* Assert in debug builds.
* Return value (do not set errno)
*/
#define _VALIDATE_RETURN_NOERRNO( expr, retexpr ) \
{ \
int _Expr_val=!!(expr); \
_ASSERT_EXPR( ( _Expr_val ), _CRT_WIDE(#expr) ); \
if ( !( _Expr_val ) ) \
{ \
_INVALID_PARAMETER(_CRT_WIDE(#expr)); \
return ( retexpr ); \
} \
}
/*
* Assert in debug builds.
* set errno and return errorcode
*/
#define _VALIDATE_RETURN_ERRCODE( expr, errorcode ) \
{ \
int _Expr_val=!!(expr); \
_ASSERT_EXPR( ( _Expr_val ), _CRT_WIDE(#expr) ); \
if ( !( _Expr_val ) ) \
{ \
errno = errorcode; \
_INVALID_PARAMETER(_CRT_WIDE(#expr)); \
return ( errorcode ); \
} \
}
#define _VALIDATE_RETURN_ERRCODE_NOEXC( expr, errorcode ) \
{ \
if (!(expr)) \
{ \
errno = errorcode; \
return ( errorcode ); \
} \
}
#define _VALIDATE_CLEAR_OSSERR_RETURN( expr, errorcode, retexpr ) \
{ \
int _Expr_val=!!(expr); \
_ASSERT_EXPR( ( _Expr_val ), _CRT_WIDE(#expr) ); \
if ( !( _Expr_val ) ) \
{ \
_doserrno = 0L; \
errno = errorcode; \
_INVALID_PARAMETER(_CRT_WIDE(#expr) ); \
return ( retexpr ); \
} \
}
#define _CHECK_FH_CLEAR_OSSERR_RETURN( handle, errorcode, retexpr ) \
{ \
if(handle == _NO_CONSOLE_FILENO) \
{ \
_doserrno = 0L; \
errno = errorcode; \
return ( retexpr ); \
} \
}
#define _VALIDATE_CLEAR_OSSERR_RETURN_ERRCODE( expr, errorcode ) \
{ \
int _Expr_val=!!(expr); \
_ASSERT_EXPR( ( _Expr_val ), _CRT_WIDE(#expr) ); \
if ( !( _Expr_val ) ) \
{ \
_doserrno = 0L; \
errno = errorcode; \
_INVALID_PARAMETER(_CRT_WIDE(#expr)); \
return ( errorcode ); \
} \
}
#define _CHECK_FH_CLEAR_OSSERR_RETURN_ERRCODE( handle, retexpr ) \
{ \
if(handle == _NO_CONSOLE_FILENO) \
{ \
_doserrno = 0L; \
return ( retexpr ); \
} \
}
#ifdef _DEBUG
extern size_t __crtDebugFillThreshold;
#endif /* _DEBUG */
#if !defined (_SECURECRT_FILL_BUFFER_THRESHOLD)
#ifdef _DEBUG
#define _SECURECRT_FILL_BUFFER_THRESHOLD __crtDebugFillThreshold
#else /* _DEBUG */
#define _SECURECRT_FILL_BUFFER_THRESHOLD ((size_t)0)
#endif /* _DEBUG */
#endif /* !defined (_SECURECRT_FILL_BUFFER_THRESHOLD) */
#if _SECURECRT_FILL_BUFFER
#define _SECURECRT__FILL_STRING(_String, _Size, _Offset) \
if ((_Size) != ((size_t)-1) && (_Size) != INT_MAX && \
((size_t)(_Offset)) < (_Size)) \
{ \
memset((_String) + (_Offset), \
_SECURECRT_FILL_BUFFER_PATTERN, \
(_SECURECRT_FILL_BUFFER_THRESHOLD < ((size_t)((_Size) - (_Offset))) ? \
_SECURECRT_FILL_BUFFER_THRESHOLD : \
((_Size) - (_Offset))) * sizeof(*(_String))); \
}
#else /* _SECURECRT_FILL_BUFFER */
#define _SECURECRT__FILL_STRING(_String, _Size, _Offset)
#endif /* _SECURECRT_FILL_BUFFER */
#if _SECURECRT_FILL_BUFFER
#define _SECURECRT__FILL_BYTE(_Position) \
if (_SECURECRT_FILL_BUFFER_THRESHOLD > 0) \
{ \
(_Position) = _SECURECRT_FILL_BUFFER_PATTERN; \
}
#else /* _SECURECRT_FILL_BUFFER */
#define _SECURECRT__FILL_BYTE(_Position)
#endif /* _SECURECRT_FILL_BUFFER */
#ifdef __cplusplus
#define _REDIRECT_TO_L_VERSION_FUNC_PROLOGUE extern "C"
#else /* __cplusplus */
#define _REDIRECT_TO_L_VERSION_FUNC_PROLOGUE
#endif /* __cplusplus */
/* helper macros to redirect an mbs function to the corresponding _l version */
#define _REDIRECT_TO_L_VERSION_1(_ReturnType, _FunctionName, _Type1) \
_REDIRECT_TO_L_VERSION_FUNC_PROLOGUE \
_ReturnType __cdecl _FunctionName(_Type1 _Arg1) \
{ \
return _FunctionName##_l(_Arg1, NULL); \
}
#define _REDIRECT_TO_L_VERSION_2(_ReturnType, _FunctionName, _Type1, _Type2) \
_REDIRECT_TO_L_VERSION_FUNC_PROLOGUE \
_ReturnType __cdecl _FunctionName(_Type1 _Arg1, _Type2 _Arg2) \
{ \
return _FunctionName##_l(_Arg1, _Arg2, NULL); \
}
#define _REDIRECT_TO_L_VERSION_3(_ReturnType, _FunctionName, _Type1, _Type2, _Type3) \
_REDIRECT_TO_L_VERSION_FUNC_PROLOGUE \
_ReturnType __cdecl _FunctionName(_Type1 _Arg1, _Type2 _Arg2, _Type3 _Arg3) \
{ \
return _FunctionName##_l(_Arg1, _Arg2, _Arg3, NULL); \
}
#define _REDIRECT_TO_L_VERSION_4(_ReturnType, _FunctionName, _Type1, _Type2, _Type3, _Type4) \
_REDIRECT_TO_L_VERSION_FUNC_PROLOGUE \
_ReturnType __cdecl _FunctionName(_Type1 _Arg1, _Type2 _Arg2, _Type3 _Arg3, _Type4 _Arg4) \
{ \
return _FunctionName##_l(_Arg1, _Arg2, _Arg3, _Arg4, NULL); \
}
#define _REDIRECT_TO_L_VERSION_5(_ReturnType, _FunctionName, _Type1, _Type2, _Type3, _Type4, _Type5) \
_REDIRECT_TO_L_VERSION_FUNC_PROLOGUE \
_ReturnType __cdecl _FunctionName(_Type1 _Arg1, _Type2 _Arg2, _Type3 _Arg3, _Type4 _Arg4, _Type5 _Arg5) \
{ \
return _FunctionName##_l(_Arg1, _Arg2, _Arg3, _Arg4, _Arg5, NULL); \
}
#define _REDIRECT_TO_L_VERSION_6(_ReturnType, _FunctionName, _Type1, _Type2, _Type3, _Type4, _Type5, _Type6) \
_REDIRECT_TO_L_VERSION_FUNC_PROLOGUE \
_ReturnType __cdecl _FunctionName(_Type1 _Arg1, _Type2 _Arg2, _Type3 _Arg3, _Type4 _Arg4, _Type5 _Arg5, _Type6 _Arg6) \
{ \
return _FunctionName##_l(_Arg1, _Arg2, _Arg3, _Arg4, _Arg5, _Arg6, NULL); \
}
/* internal helper functions for encoding and decoding pointers */
void __cdecl _init_pointers();
_CRTIMP void * __cdecl _encode_pointer(void *);
_CRTIMP void * __cdecl _encoded_null();
_CRTIMP void * __cdecl _decode_pointer(void *);
/* internal helper function for communicating with the debugger */
BOOL DebuggerKnownHandle();
/* Macros to simplify the use of Secure CRT in the CRT itself.
* We should use [_BEGIN/_END]_SECURE_CRT_DEPRECATION_DISABLE sparingly.
*/
#define _BEGIN_SECURE_CRT_DEPRECATION_DISABLE \
__pragma(warning(push)) \
__pragma(warning(disable:4996))
#define _END_SECURE_CRT_DEPRECATION_DISABLE \
__pragma(warning(pop))
#define _ERRCHECK(e) \
_INVOKE_WATSON_IF_ERROR(e)
#define _ERRCHECK_EINVAL(e) \
_INVOKE_WATSON_IF_ONEOF(e, EINVAL, EINVAL)
#define _ERRCHECK_EINVAL_ERANGE(e) \
_INVOKE_WATSON_IF_ONEOF(e, EINVAL, ERANGE)
#define _ERRCHECK_SPRINTF(_PrintfCall) \
{ \
errno_t _SaveErrno = errno; \
errno = 0; \
if ( ( _PrintfCall ) < 0) \
{ \
_ERRCHECK_EINVAL_ERANGE(errno); \
} \
errno = _SaveErrno; \
}
/* internal helper function to access environment variable in read-only mode */
const char16_t * __cdecl _wgetenv_helper_nolock(const char16_t *);
const char * __cdecl _getenv_helper_nolock(const char *);
/* internal helper routines used to query a PE image header. */
BOOL __cdecl _ValidateImageBase(PBYTE pImageBase);
PIMAGE_SECTION_HEADER __cdecl _FindPESection(PBYTE pImageBase, DWORD_PTR rva);
BOOL __cdecl _IsNonwritableInCurrentImage(PBYTE pTarget);
#ifdef __cplusplus
}
#endif /* __cplusplus */
#ifdef _MSC_VER
#pragma pack(pop)
#endif /* _MSC_VER */
#endif /* _INC_INTERNAL */
```
|
Joseph Brennan (born 23 January 1986) is an Australian author, best known for his academic writing on male sexuality in the media studies fields of fan and porn studies, his work on queerbaiting, slash fiction and manips, and gay pornography in particular. He serves on the editorial board of Psychology and Sexuality.
Career
Brennan earned a bachelor's degree in Media from Macquarie University in 2008. He then moved to the University of Sydney, where he earned a honours degree with university medal in Media and Communications in 2009, followed by a PhD in 2014.
In 2013 he chaired a panel on fan fiction at the Sydney Writers’ Festival devoted to the origins of E. L. James’ Fifty Shades series, which formed the basis of research published in Media International Australia. He is a frequent commentator on issues of fandom, LGBT culture and pornography, having been interviewed by Australian media outlets like ABC Radio National and SBS World News.
Brennan is the author of numerous academic journal articles and book chapters, as well as magazine articles on gay male culture, published in venues such as DNA. He was guest editor of the Journal of Fandom Studies in 2018 and edited the book Queerbaiting and Fandom: Teasing Fans through Homoerotic Possibilities in 2019.
In 2020, Brennan participated in episode six of the ABC Television series Reputation Rehab, in which a journal article he had authored on the viral image scandal of Australian rugby league player Todd Carney was a focus.
References
External links
1986 births
21st-century Australian male writers
Relationships and sexuality writers
Macquarie University alumni
University of Sydney alumni
Living people
|
```javascript
// scene/demo-specific variables go here
// called automatically from within initTHREEjs() function (located in InitCommon.js file)
function initSceneData()
{
demoFragmentShaderFileName = 'CSG_Museum_2_Fragment.glsl';
// scene/demo-specific three.js objects setup goes here
sceneIsDynamic = false;
cameraFlightSpeed = 70;
// pixelRatio is resolution - range: 0.5(half resolution) to 1.0(full resolution)
pixelRatio = mouseControl ? 0.75 : 0.75;
EPS_intersect = 0.01;
// set camera's field of view
worldCamera.fov = 60;
focusDistance = 153.0;
apertureChangeSpeed = 5;
// position and orient camera
cameraControlsObject.position.set(0, 20, 150);
///cameraControlsYawObject.rotation.y = 0.0;
// look slightly downward
///cameraControlsPitchObject.rotation.x = -0.4;
} // end function initSceneData()
// called automatically from within the animate() function (located in InitCommon.js file)
function updateVariablesAndUniforms()
{
// clamp camera height for walking on Museum floor
cameraControlsObject.position.y = 20;
// INFO
cameraInfoElement.innerHTML = "FOV: " + worldCamera.fov + " / Aperture: " + apertureSize.toFixed(2) + " / FocusDistance: " + focusDistance + "<br>" + "Samples: " + sampleCounter;
} // end function updateUniforms()
init(); // init app and start animating
```
|
```go
// +build linux
package aufs
import (
"bufio"
"io/ioutil"
"os"
"path"
)
// Return all the directories
func loadIds(root string) ([]string, error) {
dirs, err := ioutil.ReadDir(root)
if err != nil {
return nil, err
}
out := []string{}
for _, d := range dirs {
if !d.IsDir() {
out = append(out, d.Name())
}
}
return out, nil
}
// Read the layers file for the current id and return all the
// layers represented by new lines in the file
//
// If there are no lines in the file then the id has no parent
// and an empty slice is returned.
func getParentIDs(root, id string) ([]string, error) {
f, err := os.Open(path.Join(root, "layers", id))
if err != nil {
return nil, err
}
defer f.Close()
out := []string{}
s := bufio.NewScanner(f)
for s.Scan() {
if t := s.Text(); t != "" {
out = append(out, s.Text())
}
}
return out, s.Err()
}
func (a *Driver) getMountpoint(id string) string {
return path.Join(a.mntPath(), id)
}
func (a *Driver) mntPath() string {
return path.Join(a.rootPath(), "mnt")
}
func (a *Driver) getDiffPath(id string) string {
return path.Join(a.diffPath(), id)
}
func (a *Driver) diffPath() string {
return path.Join(a.rootPath(), "diff")
}
```
|
Romecke is a small river of North Rhine-Westphalia, Germany. It is a right tributary of the Möhne near Rüthen.
See also
List of rivers of North Rhine-Westphalia
References
Rivers of North Rhine-Westphalia
Rivers of Germany
|
```xml
import * as React from 'react';
import createSvgIcon from '../utils/createSvgIcon';
const GridViewSmallIcon = createSvgIcon({
svg: ({ classes }) => (
<svg xmlns="path_to_url" viewBox="0 0 2048 2048" className={classes.svg} focusable="false">
<path d="M1792 128v1664H128V128h1664zm-128 128h-384v384h384V256zm-512 896V768H768v384h384zm-384 128v384h384v-384H768zM640 768H256v384h384V768zm512-128V256H768v384h384zm128 512h384V768h-384v384zM256 256v384h384V256H256zm0 1408h384v-384H256v384zm1408 0v-384h-384v384h384z" />
</svg>
),
displayName: 'GridViewSmallIcon',
});
export default GridViewSmallIcon;
```
|
```java
package org.hswebframework.web.dictionary.webflux;
import io.swagger.v3.oas.annotations.Operation;
import io.swagger.v3.oas.annotations.media.Schema;
import io.swagger.v3.oas.annotations.tags.Tag;
import io.swagger.v3.oas.annotations.Parameter;
import org.hswebframework.web.api.crud.entity.QueryParamEntity;
import org.hswebframework.web.api.crud.entity.QueryNoPagingOperation;
import org.hswebframework.web.authorization.annotation.Authorize;
import org.hswebframework.web.authorization.annotation.Resource;
import org.hswebframework.web.crud.service.ReactiveCrudService;
import org.hswebframework.web.crud.web.reactive.ReactiveServiceCrudController;
import org.hswebframework.web.dict.DictDefine;
import org.hswebframework.web.dict.DictDefineRepository;
import org.hswebframework.web.dict.EnumDict;
import org.hswebframework.web.dictionary.entity.DictionaryEntity;
import org.hswebframework.web.dictionary.service.DefaultDictionaryService;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.web.bind.annotation.*;
import reactor.core.publisher.Flux;
import reactor.core.publisher.Mono;
@RestController
@RequestMapping("/dictionary")
@Resource(id = "dictionary", name = "")
@Tag(name = "")
public class WebfluxDictionaryController implements ReactiveServiceCrudController<DictionaryEntity, String> {
@Autowired
private DefaultDictionaryService dictionaryService;
@Autowired
private DictDefineRepository repository;
@Override
public ReactiveCrudService<DictionaryEntity, String> getService() {
return dictionaryService;
}
@GetMapping("/detail/_query")
@QueryNoPagingOperation(summary = "GET")
public Flux<DictionaryEntity> getItemDefineById(@Parameter(hidden = true) QueryParamEntity query) {
return dictionaryService
.findAllDetail(query, true);
}
@PostMapping("/detail/_query")
@Operation(summary = "POST")
public Flux<DictionaryEntity> getItemDefineById(@RequestBody Mono<QueryParamEntity> query) {
return query
.flatMapMany(param -> dictionaryService
.findAllDetail(param, true));
}
@GetMapping("/{id:.+}/items")
@Authorize(merge = false)
@Operation(summary = "")
public Flux<EnumDict<?>> getItemDefineById(@PathVariable String id) {
return repository
.getDefine(id)
.flatMapIterable(DictDefine::getItems);
}
@GetMapping("/_all")
@Authorize(merge = false)
@Schema(description = "")
public Flux<DictDefine> getAllDict() {
return repository.getAllDefine();
}
}
```
|
Angélique Lalonde is a Canadian short story writer from British Columbia, whose debut collection Glorious Frazzled Beings was shortlisted for the 2021 Giller Prize.
She previously won the Journey Prize in 2019 for the short story "Pooka".
Lalonde, who is of Québécois descent, received a Ph.D. in anthropology from the University of Victoria in 2013.
References
External links
21st-century Canadian short story writers
21st-century Canadian women writers
Canadian women short story writers
Franco-Columbian people
Métis writers
Writers from British Columbia
University of Victoria alumni
Living people
Year of birth missing (living people)
|
Stephen Tai Tak-fung GBM, GBS, JP (; born 1948) is the founder and chairman of the Four Seas Group and the member of the Standing Committee of both the National and the Guangdong Provincial Committee of the Chinese People's Political Consultative Conference (CPPCC).
Career
He founded the Four Seas Group in 1971, a conglomerate specialising in raw material supply, food manufacturing, food trading and distribution, as well as cafes, chain restaurants and investment holdings business. He has also been Executive Director of Hong Kong Food Investment Holdings Limited since May 1997.
Tai holds several public positions, including the President of Hong Kong Foodstuffs Association Limited, the President of Hong Kong Japan Confectionery, Biscuit & Foodstuff Association, the Consultant of China National Food Industry Association.
He is currently a Member of the Chinese People’s Political Consultative Conference, a Member of the Chinese People’s Political Consultative Conference Canton Standing Committee and the International Economic Adviser of the People’s Government of Hebei Province. He is a Member of the Greater Pearl River Delta Business Council and the Trade and Industry Advisory Board of HKSAR. He has been awarded the Grand Bauhinia Medal, Gold Bauhinia Star, Silver Bauhinia Star and Justice of the Peace.
Education
He holds Honorary Professor of Canadian Chartered Institute of Business Administration in Canada, the Visiting Professor of South China Normal University, Honorary Doctorate of Philosophy of Morrison University in the United States and Doctor of Philosophy in Business Administration (honoris causa) of Southern California University for Professional Studies in the United States.
Awards and honours
He received a number of awards and accolades, including the World Outstanding Chinese Award, the 30th Food Industry Distinguished Service Award, Letter of Appreciation from the Food & Marketing Bureau of the Ministry of Agriculture, Forestry and Fishery of Japan, the Outstanding Contribution Award of China National Food Industry, the Top 10 Outstanding People of Asia Management Innovation Award, the Top 10 Famous People of China Innovative Branding Award, “Honourable Citizen of Shantou” and “Honourable Citizen of Guangzhou” in Mainland China.
References
1948 births
Living people
Hong Kong businesspeople
Members of the National Committee of the Chinese People's Political Consultative Conference
Recipients of the Silver Bauhinia Star
Recipients of the Gold Bauhinia Star
Recipients of the Grand Bauhinia Medal
Members of the Election Committee of Hong Kong, 2007–2012
Members of the Election Committee of Hong Kong, 2012–2017
Members of the Election Committee of Hong Kong, 2017–2021
Members of the Election Committee of Hong Kong, 2021–2026
|
Simard is a surname from Germanic sig (victory) and mar (famous), and may refer to:
Albert Simard
Amanda Simard
Christian Simard
Claude A. Simard
Francis Simard
Georges-Honoré Simard
Ive Simard (tanguero and choreographer)
Mario Simard
Nathalie Simard
Raymond Simard
Réal Simard
René Simard
René Simard (health professional)
Sophie Simard
Suzanne Simard
Sylvain Simard
Télesphore Simard (mayor)
Télesphore Simard (MNA)
Places
Simard, Saône-et-Loire, a commune in the French region of Bourgogne
Simard Lake (disambiguation)
French-language surnames
|
The 2. Rugby-Bundesliga is the second-highest level of Germany's Rugby union league system, organised by the German Rugby Federation. Its set below the Rugby-Bundesliga, the top-tier of German rugby, and above the Rugby-Regionalliga, the third tier.
The league was undergoing a major revamp for the 2012-13 season with the number of clubs expanded from 20 to 24 and the league divided into four regional divisions of six teams each. Above the 2nd Bundesliga the Bundesliga was organised in a similar fashion.
History
The Second Bundesligas were formed after the German reunion in the early 1990s, originally as four regional leagues, North, East, West and South. Later, the four leagues were merged to form two leagues, South/West and North/East. By 2017 the league structure had been again divided into four groups.
Since 2002, the two champions of the leagues play a 2nd Bundesliga championship final which also determines the clubs promoted to the Bundesliga.
The bottom clubs in the league are relegated to the Rugby-Regionalliga, the third tier of rugby in Germany. The top-teams of the Regionalliga are promoted in turn.
The four groups cover the following states in 2017:
In the 2008-09 season, only nine of the sixteen German states have clubs at this level. Bremen, Mecklenburg-Vorpommern, Saxony, Saxony-Anhalt, Schleswig-Holstein, Thuringia and Saarland have no 2nd Bundesliga club.
With the RC Luxembourg, a team from Luxembourg, a non-German side competes in the league. The inclusion of this side in the 2009 promotion round to the 2nd Bundesliga caused some debate in regards to its legality, as the club had not qualified through the German league system and was not a member of any of the German regional rugby federations. However, RC Luxembourg's application was declared valid in regards to the German rugby federations rules and regulations and the team finished second in the promotion round, earning a place in the 2nd Bundesliga for 2009-10.
As a sign of the gap between the Bundesliga and the 2nd Bundesliga, TSV Victoria Linden, who only won the 2009-10 North/East division in the last round of the championship, declined promotion, citing the additional cost of travelling and the limited player pool as their reason. The South/West champion, Stuttgarter RC, has also indicated that it would not take up promotion, leaving the Bundesliga with only eight clubs for the next season. It also meant, for the first time ever, that no club from Hanover would compete at the top level of German rugby. DSV 78 protested the decision to reduce the league to eight teams again and thereby relegating the club. For the 2nd Bundesliga, this also meant, only one team each would be promoted to the two regional divisions to keep the strength at ten teams per league. In the North/East, this was SC Siemensstadt, the club being directly promoted, while, in the South/West, TV Pforzheim won the promotion tournament of the five southern Regionalliga champions in Nuremberg on 12 June 2010.
On 22 August 2011, five days before the 2011-12 season start, the RG Heidelberg withdrew its reserve team from the 2nd Rugby-Bundesliga South/West, citing inability to guarantee a full player squad for the whole season and thereby forcing the South/West division to compete with nine clubs only. The Berliner RC II withdrew during the season, also citing a lack of players as the reason while the RU Hohen Neuendorf was disqualified after not fielding a team in two league games.
In mid-July 2012 the Deutsche Rugby Tag, the annual general meeting of the DRV decided to approve a league reform proposed by German international Manuel Wilhelm. The new system saw the number of clubs in the 2nd Bundesliga increased from 20 to 24 and the league divided into four regional divisions of six clubs each. One of the main aims of the reform was to reduce the number of kilometres travelled by individual teams and therefore reduce the travel expenses. The system will remain mostly unchanged for the 2013-14 season. The only changes will be a play-off between the fourth and fifth placed teams in each group after the first stage to determine the clubs advancing to the second stage. The championship play-offs after the second stage will be reduced from sixteen to twelve clubs with the top two teams in each group advancing directly to the quarter-finals while the remaining eight will play a wild card round to determine the other four quarter finalists.
From 2015 onwards the Bundesliga was reduced to sixteen clubs while the 2. Bundesliga remains at twenty four, divided into four regional groups. The winners of these four divisions would play each other for two direct promotion spots to the Bundesliga while the two losers of these games would face the seventh placed clubs from the Bundesliga.
Clubs Participating in 2018
2nd Bundesliga championship finals
Winner in bold.
2nd Bundesliga champions until 2001
Before the establishment of the single-division Bundesliga, the two 2nd Bundesligas determined their champion in the autumn half of the season before splitting each division into two groups, the upper half playing for Bundesliga promotion together with the bottom clubs of the Bundesliga, and the lower half against 2nd Bundesliga relegation. Teams from the two regional divisions did not meet and now country-wide 2nd Bundesliga championship as such was played. The autumn champions were:
Placings in the 2nd Bundesliga since 2001
Since 1998, the following clubs have played in the league. From 1999 to 2001, the league consisted of two regional divisions of six teams each. After an autumn (A) round, the top three from each group would reach the championship finals round in spring (S). The bottom three, together with the top three from each of the two 2nd Bundesligas would play a promotion round in spring with the top three in each group playing in the Bundesliga the following autumn. In 1997-98 and from 2001 to 2012, the league has been played in a single-division format. From 2012–13 to 2014–15 it had been divided into a first (I) and second round (II), followed by play-offs:
North/East
1 DSV 78 Hannover and SV 08 Ricklingen fielded a combined team, the DSV 78/08 Ricklingen, from 2003 to 2009.
2 Post SV Berlin Rugby left the Post SV Berlin club in 2003 to form RK 03 Berlin.
3 The SG Schwalbe/DRC Hannover II was a combined team of FC Schwalbe Hannover and the reserve team of DRC Hannover for the 2008-09 season.
4 SV Odin Hannover and VfR Döhren field a combined team, the SG SV Odin/VfR Döhren, from 2008 onwards.
South/West
5 The SG Heidelberger TV/SC Neuenheim II was a combined team of Heidelberger TV and the reserve team of SC Neuenheim for the 2008-09 season.
Key
See also
Rugby union in Germany
German rugby union cup
References
External links
German Rugby Union
Scrum.de - Result archive
Rugbyweb.de - Result archive
Rugby union leagues in Germany
Rugby-Bundesliga
Germany
|
```python
import numpy as np
import cv2
import tensorflow as tf
import time
import sys
import os
import pdb
class YOLO_TF:
fromfile = None
tofile_img = 'test/output.jpg'
tofile_txt = 'test/output.txt'
imshow = False
filewrite_img = False
filewrite_txt = False
disp_console = True
weights_file = 'weights/YOLO_tiny.ckpt'
alpha = 0.1
threshold = 0.2
iou_threshold = 0.5
num_class = 20
num_box = 2
grid_size = 7
classes = ["aeroplane", "bicycle", "bird", "boat", "bottle", "bus", "car", "cat", "chair", "cow", "diningtable", "dog", "horse", "motorbike", "person", "pottedplant", "sheep", "sofa", "train","tvmonitor"]
w_img = 640
h_img = 480
def __init__(self,argvs = []):
self.detected = 0
self.overall_pics = 0
self.argv_parser(argvs)
self.build_networks()
if self.fromfile is not None: self.detect_from_file(self.fromfile)
print(self.fromfolder)
if self.fromfolder is not None:
filename_list = os.listdir(self.fromfolder)
for filename in filename_list:
print("Pics number:",self.overall_pics)
self.overall_pics+=1
self.detect_from_file(self.fromfolder+"/"+filename)
print("Accuracy:", self.detected/self.overall_pics)
def argv_parser(self,argvs):
for i in range(1,len(argvs),2):
if argvs[i] == '-fromfile' : self.fromfile = argvs[i+1]
if argvs[i] == '-fromfolder' :
self.fromfolder = argvs[i+1]
else:
self.fromfolder = No
if argvs[i] == '-tofile_img' : self.tofile_img = argvs[i+1] ; self.filewrite_img = True
if argvs[i] == '-tofile_txt' : self.tofile_txt = argvs[i+1] ; self.filewrite_txt = True
if argvs[i] == '-imshow' :
if argvs[i+1] == '1' :self.imshow = True
else : self.imshow = False
if argvs[i] == '-disp_console' :
if argvs[i+1] == '1' :self.disp_console = True
else : self.disp_console = False
def build_networks(self):
if self.disp_console : print "Building YOLO_tiny graph..."
self.x = tf.placeholder('float32',[None,448,448,3])
self.conv_1 = self.conv_layer(1,self.x,16,3,1)
self.pool_2 = self.pooling_layer(2,self.conv_1,2,2)
self.conv_3 = self.conv_layer(3,self.pool_2,32,3,1)
self.pool_4 = self.pooling_layer(4,self.conv_3,2,2)
self.conv_5 = self.conv_layer(5,self.pool_4,64,3,1)
self.pool_6 = self.pooling_layer(6,self.conv_5,2,2)
self.conv_7 = self.conv_layer(7,self.pool_6,128,3,1)
self.pool_8 = self.pooling_layer(8,self.conv_7,2,2)
self.conv_9 = self.conv_layer(9,self.pool_8,256,3,1)
self.pool_10 = self.pooling_layer(10,self.conv_9,2,2)
self.conv_11 = self.conv_layer(11,self.pool_10,512,3,1)
self.pool_12 = self.pooling_layer(12,self.conv_11,2,2)
self.conv_13 = self.conv_layer(13,self.pool_12,1024,3,1)
self.conv_14 = self.conv_layer(14,self.conv_13,1024,3,1)
self.conv_15 = self.conv_layer(15,self.conv_14,1024,3,1)
self.fc_16 = self.fc_layer(16,self.conv_15,256,flat=True,linear=False)
self.fc_17 = self.fc_layer(17,self.fc_16,4096,flat=False,linear=False)
#skip dropout_18
self.fc_19 = self.fc_layer(19,self.fc_17,1470,flat=False,linear=True)
self.sess = tf.Session()
self.sess.run(tf.initialize_all_variables())
self.saver = tf.train.Saver()
self.saver.restore(self.sess,self.weights_file)
if self.disp_console : print "Loading complete!" + '\n'
def conv_layer(self,idx,inputs,filters,size,stride):
channels = inputs.get_shape()[3]
weight = tf.Variable(tf.truncated_normal([size,size,int(channels),filters], stddev=0.1))
biases = tf.Variable(tf.constant(0.1, shape=[filters]))
pad_size = size//2
pad_mat = np.array([[0,0],[pad_size,pad_size],[pad_size,pad_size],[0,0]])
inputs_pad = tf.pad(inputs,pad_mat)
conv = tf.nn.conv2d(inputs_pad, weight, strides=[1, stride, stride, 1], padding='VALID',name=str(idx)+'_conv')
conv_biased = tf.add(conv,biases,name=str(idx)+'_conv_biased')
if self.disp_console : print ' Layer %d : Type = Conv, Size = %d * %d, Stride = %d, Filters = %d, Input channels = %d' % (idx,size,size,stride,filters,int(channels))
return tf.maximum(self.alpha*conv_biased,conv_biased,name=str(idx)+'_leaky_relu')
def pooling_layer(self,idx,inputs,size,stride):
if self.disp_console : print ' Layer %d : Type = Pool, Size = %d * %d, Stride = %d' % (idx,size,size,stride)
return tf.nn.max_pool(inputs, ksize=[1, size, size, 1],strides=[1, stride, stride, 1], padding='SAME',name=str(idx)+'_pool')
def fc_layer(self,idx,inputs,hiddens,flat = False,linear = False):
input_shape = inputs.get_shape().as_list()
if flat:
dim = input_shape[1]*input_shape[2]*input_shape[3]
inputs_transposed = tf.transpose(inputs,(0,3,1,2))
inputs_processed = tf.reshape(inputs_transposed, [-1,dim])
else:
dim = input_shape[1]
inputs_processed = inputs
weight = tf.Variable(tf.truncated_normal([dim,hiddens], stddev=0.1))
biases = tf.Variable(tf.constant(0.1, shape=[hiddens]))
if self.disp_console : print ' Layer %d : Type = Full, Hidden = %d, Input dimension = %d, Flat = %d, Activation = %d' % (idx,hiddens,int(dim),int(flat),1-int(linear))
if linear : return tf.add(tf.matmul(inputs_processed,weight),biases,name=str(idx)+'_fc')
ip = tf.add(tf.matmul(inputs_processed,weight),biases)
return tf.maximum(self.alpha*ip,ip,name=str(idx)+'_fc')
def detect_from_cvmat(self,img):
s = time.time()
self.h_img,self.w_img,_ = img.shape
img_resized = cv2.resize(img, (448, 448))
img_RGB = cv2.cvtColor(img_resized,cv2.COLOR_BGR2RGB)
img_resized_np = np.asarray( img_RGB )
inputs = np.zeros((1,448,448,3),dtype='float32')
inputs[0] = (img_resized_np/255.0)*2.0-1.0
in_dict = {self.x: inputs}
net_output = self.sess.run(self.fc_19,feed_dict=in_dict)
self.result = self.interpret_output(net_output[0])
self.show_results(img,self.result)
strtime = str(time.time()-s)
if self.disp_console : print 'Elapsed time : ' + strtime + ' secs' + '\n'
def detect_from_file(self,filename):
if self.disp_console : print 'Detect from ' + filename
img = cv2.imread(filename)
#img = misc.imread(filename)
self.detect_from_cvmat(img)
def detect_from_crop_sample(self):
self.w_img = 640
self.h_img = 420
f = np.array(open('person_crop.txt','r').readlines(),dtype='float32')
inputs = np.zeros((1,448,448,3),dtype='float32')
for c in range(3):
for y in range(448):
for x in range(448):
inputs[0,y,x,c] = f[c*448*448+y*448+x]
in_dict = {self.x: inputs}
net_output = self.sess.run(self.fc_19,feed_dict=in_dict)
self.boxes, self.probs = self.interpret_output(net_output[0])
img = cv2.imread('person.jpg')
self.show_results(self.boxes,img)
def interpret_output(self,output):
probs = np.zeros((7,7,2,20))
class_probs = np.reshape(output[0:980],(7,7,20))
scales = np.reshape(output[980:1078],(7,7,2))
boxes = np.reshape(output[1078:],(7,7,2,4))
offset = np.transpose(np.reshape(np.array([np.arange(7)]*14),(2,7,7)),(1,2,0))
boxes[:,:,:,0] += offset
boxes[:,:,:,1] += np.transpose(offset,(1,0,2))
boxes[:,:,:,0:2] = boxes[:,:,:,0:2] / 7.0
boxes[:,:,:,2] = np.multiply(boxes[:,:,:,2],boxes[:,:,:,2])
boxes[:,:,:,3] = np.multiply(boxes[:,:,:,3],boxes[:,:,:,3])
boxes[:,:,:,0] *= self.w_img
boxes[:,:,:,1] *= self.h_img
boxes[:,:,:,2] *= self.w_img
boxes[:,:,:,3] *= self.h_img
for i in range(2):
for j in range(20):
probs[:,:,i,j] = np.multiply(class_probs[:,:,j],scales[:,:,i])
filter_mat_probs = np.array(probs>=self.threshold,dtype='bool')
filter_mat_boxes = np.nonzero(filter_mat_probs)
boxes_filtered = boxes[filter_mat_boxes[0],filter_mat_boxes[1],filter_mat_boxes[2]]
probs_filtered = probs[filter_mat_probs]
classes_num_filtered = np.argmax(filter_mat_probs,axis=3)[filter_mat_boxes[0],filter_mat_boxes[1],filter_mat_boxes[2]]
argsort = np.array(np.argsort(probs_filtered))[::-1]
boxes_filtered = boxes_filtered[argsort]
probs_filtered = probs_filtered[argsort]
classes_num_filtered = classes_num_filtered[argsort]
for i in range(len(boxes_filtered)):
if probs_filtered[i] == 0 : continue
for j in range(i+1,len(boxes_filtered)):
if self.iou(boxes_filtered[i],boxes_filtered[j]) > self.iou_threshold :
probs_filtered[j] = 0.0
filter_iou = np.array(probs_filtered>0.0,dtype='bool')
boxes_filtered = boxes_filtered[filter_iou]
probs_filtered = probs_filtered[filter_iou]
classes_num_filtered = classes_num_filtered[filter_iou]
result = []
for i in range(len(boxes_filtered)):
result.append([self.classes[classes_num_filtered[i]],boxes_filtered[i][0],boxes_filtered[i][1],boxes_filtered[i][2],boxes_filtered[i][3],probs_filtered[i]])
return result
def show_results(self,img,results):
img_cp = img.copy()
if self.filewrite_txt :
ftxt = open(self.tofile_txt,'w')
class_results_set = set()
for i in range(len(results)):
x = int(results[i][1])
y = int(results[i][2])
w = int(results[i][3])//2
h = int(results[i][4])//2
class_results_set.add(results[i][0])
if self.disp_console : print ' class : ' + results[i][0] + ' , [x,y,w,h]=[' + str(x) + ',' + str(y) + ',' + str(int(results[i][3])) + ',' + str(int(results[i][4]))+'], Confidence = ' + str(results[i][5])
if self.filewrite_img or self.imshow:
cv2.rectangle(img_cp,(x-w,y-h),(x+w,y+h),(0,255,0),2)
cv2.rectangle(img_cp,(x-w,y-h-20),(x+w,y-h),(125,125,125),-1)
cv2.putText(img_cp,results[i][0] + ' : %.2f' % results[i][5],(x-w+5,y-h-7),cv2.FONT_HERSHEY_SIMPLEX,0.5,(0,0,0),1)
if self.filewrite_txt :
ftxt.write(results[i][0] + ',' + str(x) + ',' + str(y) + ',' + str(w) + ',' + str(h)+',' + str(results[i][5]) + '\n')
if "person" in class_results_set:
self.detected+=1
# new_img_path=self.fromfolder[:-14]+"test7/selected_ImageNet_person/"+str(self.detected)+"_white_margin_orgin_pic.jpg"
# cv2.imwrite(new_img_path,img_cp)
if self.filewrite_img :
if self.disp_console : print ' image file writed : ' + self.tofile_img
is_saved = cv2.imwrite(self.tofile_img,img_cp)
if is_saved == True:
print("Saved under:",self.tofile_img)
else:
print("Saving error!s")
if self.imshow :
cv2.imshow('YOLO_tiny detection',img_cp)
cv2.waitKey(1)
if self.filewrite_txt :
if self.disp_console : print ' txt file writed : ' + self.tofile_txt
ftxt.close()
def iou(self,box1,box2):
tb = min(box1[0]+0.5*box1[2],box2[0]+0.5*box2[2])-max(box1[0]-0.5*box1[2],box2[0]-0.5*box2[2])
lr = min(box1[1]+0.5*box1[3],box2[1]+0.5*box2[3])-max(box1[1]-0.5*box1[3],box2[1]-0.5*box2[3])
if tb < 0 or lr < 0 : intersection = 0
else : intersection = tb*lr
return intersection / (box1[2]*box1[3] + box2[2]*box2[3] - intersection)
def training(self): #TODO add training function!
return None
def main(argvs):
yolo = YOLO_TF(argvs)
cv2.waitKey(1000)
if __name__=='__main__':
main(sys.argv)
```
|
"Volume III" a.k.a. "Stars on 45 Volume 3" is a song issued in 1981 by the Dutch studio group Stars on 45, in the UK credited to 'Starsound'. It was the second single from the band's second full-length release Longplay Album - Volume II (UK title: Stars On 45 - The Album - Volume 2, US title: Stars on Longplay II).
The "Volume III" medley is the opening track on Longplay Album - Volume II and then had the title "Star Wars And Other Hits", in the UK it was named "Instrumental Medley" and in the US "Introductions"; the very same recording was consequently released under no less than five different titles throughout the world. The medley featured instrumental intros to hits from a wide variety of genres, from well known movie themes like "Star Wars" and "The Good, The Bad and the Ugly", 60's and 70's hits by The Stylistics, Boney M., Eric Clapton, The Village People and The Pointer Sisters to the overture from The Who's musical Tommy and the main theme from Jeff Wayne's musical version of "The War of the Worlds".
The slightly edited 7" version omitted two of the medley's nineteen titles - The Walker Brothers' "The Sun Ain't Gonna Shine Anymore" and the overture from "Tommy" - while the slightly extended 12" single featured a longer ”Get Off” section (taken from the B-side) before the Stars on 45 theme. The B-side of both editions was entitled "'Stars on' Theme" and was an alternate mix of an instrumental part of the album track "'45 Stars Get Ready". Both 7" and 12" versions were re-released digitally in September 2021.
"Volume III"/"Stars on 45 Volume 3" became Stars on 45/Starsound's third Top 20 single in the UK and Ireland, peaking at #17 and #11 respectively, and their third Top 10 single in the Netherlands.
Track listing 7" single
Side A
"Volume III" (7" Mix) - 4:33
"Star Wars Main Title" (Williams)
"Can't Give You Anything (But My Love)" (Creatore, Perreti, Weiss)
"Kung Fu Fighting" (Douglas, Hawke)
"Layla" (Clapton, Gordon)
"All Right Now" (Fraser, Rodgers)
"Fire" (Springsteen)
"Da Ya Think I'm Sexy?" (Stewart, Appice)
"Ma Baker" (Farian, Reyam, Jay)
"Y.M.C.A" (Belolo, Morali, Willis)
"The Good, The Bad And The Ugly" (Morricone)
"Don't Stop 'Til You Get Enough" (Jackson)
"Theme From M.A.S.H. (Suicide Is Painless)" (Mandel, Altman)
"Get Off" (Driggs, Ledesma)
"Stars On 45" (Eggermont, Duiser)
"Baker Street" (Rafferty)
"Bette Davis Eyes" (DeShannon, Weiss)
"Eve of the War" (Wayne)
Side B
"'Stars on' Theme" (7" Mix) (Eggermont, Duiser) - 4:00
Track listing 12" single
Side A
"Volume III" (12” Mix) - 5:47
"Star Wars Main Title" (Williams)
"Can't Give You Anything (But My Love)" (Creatore, Perreti, Weiss)
"Kung Fu Fighting" (Douglas, Hawke)
"Layla" (Clapton, Gordon)
"All Right Now" (Fraser, Rodgers)
"Fire" (Springsteen)
"Da Ya Think I'm Sexy?" (Stewart, Appice)
"Ma Baker" (Farian, Reyam, Jay)
"Y.M.C.A" (Belolo, Morali, Willis)
"The Good, The Bad And The Ugly" (Morricone)
"Don't Stop 'Til You Get Enough" (Jackson)
"Theme From M.A.S.H. (Suicide Is Painless)" (Mandel, Altman)
"The Sun Ain't Gonna Shine (Anymore)" (Crewe, Gaudio)
"Overture From Tommy" (Townshend)
"Get Off" (Driggs, Ledesma)
"Stars On 45" (Eggermont, Duiser)
"Baker Street" (Rafferty)
"Bette Davis Eyes" (DeShannon, Weiss)
"Eve of the War" (Wayne)
Side B
"'Stars on' Theme" (12" Mix) (Eggermont, Duiser) - 5:05
Charts
Weekly charts
Year-end charts
Sources and external links
Rateyourmusic.com biography and discography
The Dutch Stars on 45 fansite
Top40.nl
UK Top 40
Irish Charts.ie
References
1981 singles
Stars on 45 songs
CNR Music singles
CBS Records singles
|
```javascript
/**
* For commercial licenses see path_to_url
*
* Version: 5.7.1 (2021-03-17)
*/
!function(){"use strict";var n=tinymce.util.Tools.resolve("tinymce.PluginManager"),i=function(n,e){for(var a="",o=0;o<e;o++)a+=n;return a},r=function(n,e){var a,o=n.getParam("nonbreaking_wrap",!0,"boolean")||n.plugins.visualchars?'<span class="'+((a=n).plugins.visualchars&&a.plugins.visualchars.isEnabled()?"mce-nbsp-wrap mce-nbsp":"mce-nbsp-wrap")+'" contenteditable="false">'+i(" ",e)+"</span>":i(" ",e);n.undoManager.transact(function(){return n.insertContent(o)})},c=tinymce.util.Tools.resolve("tinymce.util.VK");n.add("nonbreaking",function(n){var e,a,o,i,t;(e=n).addCommand("mceNonBreaking",function(){r(e,1)}),(a=n).ui.registry.addButton("nonbreaking",{icon:"non-breaking",tooltip:"Nonbreaking space",onAction:function(){return a.execCommand("mceNonBreaking")}}),a.ui.registry.addMenuItem("nonbreaking",{icon:"non-breaking",text:"Nonbreaking space",onAction:function(){return a.execCommand("mceNonBreaking")}}),0<(t="boolean"==typeof(i=(o=n).getParam("nonbreaking_force_tab",0))?!0===i?3:0:i)&&o.on("keydown",function(n){if(n.keyCode===c.TAB&&!n.isDefaultPrevented()){if(n.shiftKey)return;n.preventDefault(),n.stopImmediatePropagation(),r(o,t)}})})}();
```
|
```smalltalk
#if EFCORE
using Microsoft.EntityFrameworkCore;
using Microsoft.EntityFrameworkCore.DynamicLinq;
#else
using System.Data.Entity;
using EntityFramework.DynamicLinq;
#endif
using System.Linq.Expressions;
using System.Threading.Tasks;
using System.Linq.Dynamic.Core.Tests.Helpers.Entities;
using Xunit;
namespace System.Linq.Dynamic.Core.Tests;
public partial class EntitiesTests
{
[Fact]
public async Task Entities_CountAsync_Predicate_Args()
{
// Arrange
const string search = "a";
Expression<Func<Blog, bool>> predicate = b => b.Name.Contains(search);
#if EFCORE
var expected = await EntityFrameworkQueryableExtensions.CountAsync(_context.Blogs, predicate);
#else
var expected = await QueryableExtensions.CountAsync(_context.Blogs, predicate);
#endif
//Act
int result = await (_context.Blogs as IQueryable).CountAsync("Name.Contains(@0)", search);
//Assert
Assert.Equal(expected, result);
}
}
```
|
```xml
<Project Sdk="Microsoft.NET.Sdk">
<PropertyGroup>
<TargetFramework>net8.0</TargetFramework>
<AssemblyName>Volo.Abp.IdentityServer.EntityFrameworkCore.Tests</AssemblyName>
<PackageId>Volo.Abp.IdentityServer.EntityFrameworkCore.Tests</PackageId>
<GenerateRuntimeConfigurationFiles>true</GenerateRuntimeConfigurationFiles>
<GenerateAssemblyConfigurationAttribute>false</GenerateAssemblyConfigurationAttribute>
<GenerateAssemblyCompanyAttribute>false</GenerateAssemblyCompanyAttribute>
<GenerateAssemblyProductAttribute>false</GenerateAssemblyProductAttribute>
<RootNamespace />
</PropertyGroup>
<ItemGroup>
<ProjectReference Include="..\..\src\Volo.Abp.IdentityServer.EntityFrameworkCore\Volo.Abp.IdentityServer.EntityFrameworkCore.csproj" />
<ProjectReference Include="..\..\..\..\modules\identity\src\Volo.Abp.Identity.EntityFrameworkCore\Volo.Abp.Identity.EntityFrameworkCore.csproj" />
<ProjectReference Include="..\Volo.Abp.IdentityServer.TestBase\Volo.Abp.IdentityServer.TestBase.csproj" />
<ProjectReference Include="..\..\..\..\framework\src\Volo.Abp.EntityFrameworkCore.Sqlite\Volo.Abp.EntityFrameworkCore.Sqlite.csproj" />
<ProjectReference Include="..\..\..\..\modules\permission-management\src\Volo.Abp.PermissionManagement.EntityFrameworkCore\Volo.Abp.PermissionManagement.EntityFrameworkCore.csproj" />
</ItemGroup>
<ItemGroup>
<PackageReference Include="Microsoft.NET.Test.Sdk" />
<PackageReference Include="NSubstitute" />
<PackageReference Include="Shouldly" />
<PackageReference Include="xunit" />
<PackageReference Include="xunit.extensibility.execution" />
<PackageReference Include="xunit.runner.visualstudio" />
</ItemGroup>
</Project>
```
|
Governor Chacón may refer to:
José María Chacón (1749–1833), last Spanish Governor of Trinidad from 1783 to 1797
Fernando Chacón, Governor of New Mexico from 1794 to 1804
Jose Chacón Medina Salazar y Villaseñor, Governor of New Mexico from 1707 to 1712
|
Arabella Field (born February 5, 1965) is an American actress and film producer known for her roles in films such as Dante's Peak, Feeling Minnesota, Godzilla, National Treasure, Paper Man and as Melinda Bitterman in the animated television version of Rick Kirkman and Jerry Scott's daily comic strip Baby Blues.
Career
She has guest starred in a number of notable television series, including The Sopranos, Seinfeld, Law & Order, Numb3rs, House, Rules of Engagement, In Case of Emergency and other shows. She had a recurring role playing Patsi Moosekian in the show Under Suspicion.
In 2010, Field starred in the web series Sex and the Austen Girl on Babelgum, produced and directed by her husband, Brian Gerber. Field and Gerber had two children together before his death, by suicide, in 2012.
Filmography
Film
Television
References
External links
1965 births
American film actresses
American television actresses
Living people
Actresses from New York City
21st-century American women
|
```scheme
(define eval-expo
(lambda (exp env val)
(conde
((fresh (rator rand x body env^ a)
(== `(,rator ,rand) exp)
(eval-expo rator env `(closure ,x ,body ,env^))
(eval-expo rand env a)
(eval-expo body `((,x . ,a) . ,env^) val)))
((fresh (x body)
(== `(lambda (,x) ,body) exp)
(symbolo x)
(== `(closure ,x ,body ,env) val)
(not-in-envo 'lambda env)))
((symbolo exp) (lookupo exp env val)))))
(define not-in-envo
(lambda (x env)
(conde
((== '() env))
((fresh (y v rest)
(== `((,y . ,v) . ,rest) env)
(=/= y x)
(not-in-envo x rest))))))
(define lookupo
(lambda (x env t)
(conde
((fresh (y v rest)
(== `((,y . ,v) . ,rest) env) (== y x)
(== v t)))
((fresh (y v rest)
(== `((,y . ,v) . ,rest) env) (=/= y x)
(lookupo x rest t))))))
(test "running backwards"
(run 5 (q) (eval-expo q '() '(closure y x ((x . (closure z z ()))))))
'(((lambda (x) (lambda (y) x)) (lambda (z) z))
((lambda (x) (x (lambda (y) x))) (lambda (z) z))
(((lambda (x) (lambda (y) x))
((lambda (_.0) _.0) (lambda (z) z)))
(sym _.0))
(((lambda (_.0) _.0)
((lambda (x) (lambda (y) x)) (lambda (z) z)))
(sym _.0))
((((lambda (_.0) _.0) (lambda (x) (lambda (y) x)))
(lambda (z) z))
(sym _.0))))
(define lookupo
(lambda (x env t)
(fresh (rest y v)
(== `((,y . ,v) . ,rest) env)
(conde
((== y x) (== v t))
((=/= y x) (lookupo x rest t))))))
(test "eval-exp-lc 1"
(run* (q) (eval-expo '(((lambda (x) (lambda (y) x)) (lambda (z) z)) (lambda (a) a)) '() q))
'((closure z z ())))
(test "eval-exp-lc 2"
(run* (q) (eval-expo '((lambda (x) (lambda (y) x)) (lambda (z) z)) '() q))
'((closure y x ((x . (closure z z ()))))))
(test "running backwards"
(run 5 (q) (eval-expo q '() '(closure y x ((x . (closure z z ()))))))
'(((lambda (x) (lambda (y) x)) (lambda (z) z))
((lambda (x) (x (lambda (y) x))) (lambda (z) z))
(((lambda (x) (lambda (y) x))
((lambda (_.0) _.0) (lambda (z) z)))
(sym _.0))
((((lambda (_.0) _.0) (lambda (x) (lambda (y) x)))
(lambda (z) z))
(sym _.0))
(((lambda (_.0) _.0)
((lambda (x) (lambda (y) x)) (lambda (z) z)))
(sym _.0))))
(test "fully-running-backwards"
(run 5 (q)
(fresh (e v)
(eval-expo e '() v)
(== `(,e ==> ,v) q)))
'((((lambda (_.0) _.1)
==> (closure _.0 _.1 ())) (sym _.0))
((((lambda (_.0) _.0) (lambda (_.1) _.2))
==>
(closure _.1 _.2 ()))
(sym _.0 _.1))
((((lambda (_.0) (lambda (_.1) _.2)) (lambda (_.3) _.4))
==>
(closure _.1 _.2 ((_.0 . (closure _.3 _.4 ())))))
(=/= ((_.0 lambda)))
(sym _.0 _.1 _.3))
((((lambda (_.0) (_.0 _.0)) (lambda (_.1) _.1))
==>
(closure _.1 _.1 ()))
(sym _.0 _.1))
((((lambda (_.0) (_.0 _.0))
(lambda (_.1) (lambda (_.2) _.3)))
==>
(closure _.2 _.3 ((_.1 . (closure _.1 (lambda (_.2) _.3) ())))))
(=/= ((_.1 lambda)))
(sym _.0 _.1 _.2))))
```
|
Claire Grogan is a camogie (women's hurling) player, winner of three All-Star awards in 2004, 2005 and 2007 and a Lynchpin award, predecessor of the All Star awards, in 2003. She was short-listed for further All-Star awards in 2004, 2006, 2008 and 2009.
Career
In 2000, she became the youngest player to figure in an All-Ireland senior final since the mid-1950s at the age of 14, something that is no longer possible under camogie rules. She was the outstanding player in that year’s minor championship.
It was the first of seven successive All Ireland finals in which she played for Tipperary, and she set up Emily Hayden for the opening goal after four minutes. She won five All Ireland medals, hitting the point of the match in 2000, scoring a goal in 2001, 2002, 2003 and scoring nine points in 2004.
In the 2001 All Ireland club final she scored a late equaliser for Cashel against their Galway opponents only for Pearses to win the title by a point. She won her first All Ireland senior club medal with Cashel in 2007 and captained the team to victory against Athenry in 2009.
She also won a National League medal in 2004.
References
Living people
Tipperary camogie players
Year of birth missing (living people)
|
```smalltalk
using SixLabors.ImageSharp.PixelFormats;
namespace SixLabors.ImageSharp.Formats.Webp;
/// <summary>
/// Provides Webp specific metadata information for the image.
/// </summary>
public class WebpMetadata : IFormatMetadata<WebpMetadata>
{
/// <summary>
/// Initializes a new instance of the <see cref="WebpMetadata"/> class.
/// </summary>
public WebpMetadata()
{
}
/// <summary>
/// Initializes a new instance of the <see cref="WebpMetadata"/> class.
/// </summary>
/// <param name="other">The metadata to create an instance from.</param>
private WebpMetadata(WebpMetadata other)
{
this.BitsPerPixel = other.BitsPerPixel;
this.ColorType = other.ColorType;
this.FileFormat = other.FileFormat;
this.RepeatCount = other.RepeatCount;
this.BackgroundColor = other.BackgroundColor;
}
/// <summary>
/// Gets or sets the number of bits per pixel.
/// </summary>
public WebpBitsPerPixel BitsPerPixel { get; set; } = WebpBitsPerPixel.Bit32;
/// <summary>
/// Gets or sets the color type.
/// </summary>
public WebpColorType ColorType { get; set; } = WebpColorType.Rgba;
/// <summary>
/// Gets or sets the webp file format used. Either lossless or lossy.
/// </summary>
public WebpFileFormatType FileFormat { get; set; } = WebpFileFormatType.Lossy;
/// <summary>
/// Gets or sets the loop count. The number of times to loop the animation. 0 means infinitely.
/// </summary>
public ushort RepeatCount { get; set; } = 1;
/// <summary>
/// Gets or sets the default background color of the canvas when animating.
/// This color may be used to fill the unused space on the canvas around the frames,
/// as well as the transparent pixels of the first frame.
/// The background color is also used when the Disposal method is <see cref="FrameDisposalMode.RestoreToBackground"/>.
/// </summary>
public Color BackgroundColor { get; set; }
/// <inheritdoc/>
public static WebpMetadata FromFormatConnectingMetadata(FormatConnectingMetadata metadata)
{
WebpBitsPerPixel bitsPerPixel;
WebpColorType color;
PixelColorType colorType = metadata.PixelTypeInfo.ColorType;
switch (colorType)
{
case PixelColorType.RGB:
case PixelColorType.BGR:
color = WebpColorType.Rgb;
bitsPerPixel = WebpBitsPerPixel.Bit24;
break;
case PixelColorType.YCbCr:
color = WebpColorType.Yuv;
bitsPerPixel = WebpBitsPerPixel.Bit24;
break;
default:
if (colorType.HasFlag(PixelColorType.Alpha))
{
color = WebpColorType.Rgba;
bitsPerPixel = WebpBitsPerPixel.Bit32;
break;
}
color = WebpColorType.Rgb;
bitsPerPixel = WebpBitsPerPixel.Bit24;
break;
}
return new()
{
BitsPerPixel = bitsPerPixel,
ColorType = color,
BackgroundColor = metadata.BackgroundColor,
RepeatCount = metadata.RepeatCount,
FileFormat = metadata.EncodingType == EncodingType.Lossless ? WebpFileFormatType.Lossless : WebpFileFormatType.Lossy
};
}
/// <inheritdoc/>
public PixelTypeInfo GetPixelTypeInfo()
{
int bpp;
PixelColorType colorType;
PixelAlphaRepresentation alpha = PixelAlphaRepresentation.None;
PixelComponentInfo info;
switch (this.ColorType)
{
case WebpColorType.Yuv:
bpp = 24;
colorType = PixelColorType.YCbCr;
info = PixelComponentInfo.Create(3, bpp, 8, 8, 8);
break;
case WebpColorType.Rgb:
bpp = 24;
colorType = PixelColorType.RGB;
info = PixelComponentInfo.Create(3, bpp, 8, 8, 8);
break;
case WebpColorType.Rgba:
default:
bpp = 32;
colorType = PixelColorType.RGB | PixelColorType.Alpha;
info = PixelComponentInfo.Create(4, bpp, 8, 8, 8, 8);
alpha = PixelAlphaRepresentation.Unassociated;
break;
}
return new PixelTypeInfo(bpp)
{
AlphaRepresentation = alpha,
ColorType = colorType,
ComponentInfo = info,
};
}
/// <inheritdoc/>
public FormatConnectingMetadata ToFormatConnectingMetadata()
=> new()
{
EncodingType = this.FileFormat == WebpFileFormatType.Lossless ? EncodingType.Lossless : EncodingType.Lossy,
PixelTypeInfo = this.GetPixelTypeInfo(),
ColorTableMode = FrameColorTableMode.Global,
RepeatCount = this.RepeatCount,
BackgroundColor = this.BackgroundColor
};
/// <inheritdoc/>
public void AfterImageApply<TPixel>(Image<TPixel> destination)
where TPixel : unmanaged, IPixel<TPixel>
{
}
/// <inheritdoc/>
IDeepCloneable IDeepCloneable.DeepClone() => this.DeepClone();
/// <inheritdoc/>
public WebpMetadata DeepClone() => new(this);
}
```
|
```java
package tech.mlsql.nativelib.runtime;
import com.google.common.base.Preconditions;
import com.google.common.collect.Sets;
import com.sun.jna.NativeLibrary;
import org.apache.commons.io.FileUtils;
import org.apache.commons.lang3.SystemUtils;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import tech.mlsql.common.utils.path.PathFun;
import java.io.File;
import java.io.IOException;
import java.io.InputStream;
import java.io.RandomAccessFile;
import java.nio.channels.FileLock;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.Set;
/**
* 19/10/2020 WilliamZhu(allwefantasy@gmail.com)
*/
public class JniUtils {
private static final Logger LOGGER = LoggerFactory.getLogger(JniUtils.class);
private static Set<String> loadedLibs = Sets.newHashSet();
public static final String MLSQL_NATIVE_LIB = "mlsql_runtime_native_lib";
public static synchronized void loadLibrary(String libraryName) {
try {
loadLibrary(libraryName, true, null);
} catch (Exception e) {
LOGGER.info("Fail to loading native library {}.", libraryName);
}
}
public static synchronized void loadLibrary(String libraryName, boolean exportSymbols, String testPath) {
if (!loadedLibs.contains(libraryName)) {
LOGGER.info("Loading native library {}.", libraryName);
// Load native library.
String fileName = System.mapLibraryName(libraryName);
if (testPath != null) {
PathFun pf = new PathFun(testPath);
fileName = pf.add(fileName).toPath();
}
final String sessionDir = "./native/";
final File file = getNativeFile(sessionDir, fileName);
if (exportSymbols) {
// Expose library symbols using RTLD_GLOBAL which may be depended by other shared
// libraries.
NativeLibrary.getInstance(file.getAbsolutePath());
}
System.load(file.getAbsolutePath());
LOGGER.info("Native library loaded.");
loadedLibs.add(libraryName);
}
}
public static File getNativeFile(String destDir, String fileName) {
if (fileName.startsWith("/")) {
return new File(fileName);
}
final File dir = new File(destDir);
if (!dir.exists()) {
try {
FileUtils.forceMkdir(dir);
} catch (IOException e) {
throw new RuntimeException("Couldn't make directory: " + dir.getAbsolutePath(), e);
}
}
String lockFilePath = destDir + File.separator + "file_lock";
try (FileLock ignored = new RandomAccessFile(lockFilePath, "rw")
.getChannel().lock()) {
String resourceDir;
if (SystemUtils.IS_OS_MAC) {
resourceDir = "native/darwin/";
} else if (SystemUtils.IS_OS_LINUX) {
resourceDir = "native/linux/";
} else {
throw new UnsupportedOperationException("Unsupported os " + SystemUtils.OS_NAME);
}
String resourcePath = resourceDir + fileName;
File file = new File(String.format("%s/%s", destDir, fileName));
if (file.exists()) {
return file;
}
// File does not exist.
try (InputStream is = JniUtils.class.getResourceAsStream("/" + resourcePath)) {
Preconditions.checkNotNull(is, "{} doesn't exist.", resourcePath);
Files.copy(is, Paths.get(file.getCanonicalPath()));
} catch (IOException e) {
throw new RuntimeException("Couldn't get temp file from resource " + resourcePath, e);
}
return file;
} catch (IOException e) {
throw new RuntimeException(e);
}
}
public static void loadLibrary(String mlsqlNativeLib, String s) {
loadLibrary(mlsqlNativeLib, true, s);
}
}
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var isIteratorLike = require( '@stdlib/assert/is-iterator-like' );
var format = require( '@stdlib/string/format' );
// MAIN //
/**
* Consumes an iterator and returns the last iterated value.
*
* @param {Iterator} iterator - input iterator
* @throws {TypeError} must provide an iterator
* @returns {*} last iterated value
*
* @example
* var array2iterator = require( '@stdlib/array/to-iterator' );
*
* var it = array2iterator( [ 0, 0, 0, 0, 1 ] );
*
* var v = iterLast( it );
* // returns 1
*/
function iterLast( iterator ) {
var last;
var v;
if ( !isIteratorLike( iterator ) ) {
throw new TypeError( format( 'invalid argument. Must provide an iterator. Value: `%s`.', iterator ) );
}
while ( true ) {
v = iterator.next();
if ( v.done ) {
return last;
}
last = v.value;
}
}
// EXPORTS //
module.exports = iterLast;
```
|
```scala
package org.thp.thehive.controllers.v1
import org.thp.scalligraph.EntityIdOrName
import org.thp.scalligraph.controllers.{Entrypoint, FieldsParser}
import org.thp.scalligraph.models.Database
import org.thp.scalligraph.query._
import org.thp.scalligraph.traversal.TraversalOps._
import org.thp.scalligraph.traversal.{IteratorOutput, Traversal}
import org.thp.thehive.controllers.v0.Conversion._
import org.thp.thehive.dto.v0.InputDashboard
import org.thp.thehive.models.{Dashboard, RichDashboard}
import org.thp.thehive.services.DashboardOps._
import org.thp.thehive.services.OrganisationOps._
import org.thp.thehive.services.UserOps._
import org.thp.thehive.services.{DashboardSrv, OrganisationSrv, UserSrv}
import play.api.mvc.{Action, AnyContent, Results}
import javax.inject.{Inject, Singleton}
import scala.util.Success
@Singleton
class DashboardCtrl @Inject() (
entrypoint: Entrypoint,
properties: Properties,
db: Database,
dashboardSrv: DashboardSrv,
userSrv: UserSrv,
organisationSrv: OrganisationSrv
) extends QueryableCtrl {
override val entityName: String = "dashboard"
override val publicProperties: PublicProperties = properties.dashboard
override val initialQuery: Query =
Query.init[Traversal.V[Dashboard]](
"listDashboard",
(graph, authContext) =>
graph
.union(
organisationSrv.filterTraversal(_).get(authContext.organisation).dashboards,
userSrv.filterTraversal(_).getByName(authContext.userId).dashboards
)
.dedup
)
override val getQuery: ParamQuery[EntityIdOrName] = Query.initWithParam[EntityIdOrName, Traversal.V[Dashboard]](
"getDashboard",
(idOrName, graph, authContext) => dashboardSrv.get(idOrName)(graph).visible(authContext)
)
override def pageQuery(limitedCountThreshold: Long): ParamQuery[OutputParam] =
Query.withParam[OutputParam, Traversal.V[Dashboard], IteratorOutput](
"page",
(range, dashboardSteps, authContext) =>
dashboardSteps.richPage(range.from, range.to, withTotal = true, limitedCountThreshold)(_.richDashboard(authContext))
)
override val outputQuery: Query = Query.outputWithContext[RichDashboard, Traversal.V[Dashboard]](_.richDashboard(_))
def create: Action[AnyContent] =
entrypoint("create dashboard")
.extract("dashboard", FieldsParser[InputDashboard])
.authTransaction(db) { implicit request => implicit graph =>
val dashboard: InputDashboard = request.body("dashboard")
dashboardSrv
.create(dashboard.toDashboard)
.flatMap {
case richDashboard if dashboard.status == "Shared" =>
dashboardSrv
.share(richDashboard.dashboard, request.organisation, writable = true)
.flatMap(_ => dashboardSrv.get(richDashboard.dashboard).richDashboard.getOrFail("Dashboard"))
case richDashboard => Success(richDashboard)
}
.map(richDashboard => Results.Created(richDashboard.toJson))
}
def get(dashboardId: String): Action[AnyContent] =
entrypoint("get dashboard")
.authRoTransaction(db) { implicit request => implicit graph =>
dashboardSrv
.get(EntityIdOrName(dashboardId))
.visible
.richDashboard
.getOrFail("Dashboard")
.map(dashboard => Results.Ok(dashboard.toJson))
}
def update(dashboardId: String): Action[AnyContent] =
entrypoint("update dashboard")
.extract("dashboard", FieldsParser.update("dashboard", publicProperties))
.authTransaction(db) { implicit request => implicit graph =>
val propertyUpdaters: Seq[PropertyUpdater] = request.body("dashboard")
dashboardSrv
.update(_.get(EntityIdOrName(dashboardId)).canUpdate, propertyUpdaters) // TODO check permission
.flatMap { case (dashboardSteps, _) => dashboardSteps.richDashboard.getOrFail("Dashboard") }
.map(dashboard => Results.Ok(dashboard.toJson))
}
def delete(dashboardId: String): Action[AnyContent] =
entrypoint("delete dashboard")
.authTransaction(db) { implicit request => implicit graph =>
dashboardSrv
.get(EntityIdOrName(dashboardId))
.canUpdate
.getOrFail("Dashboard")
.map { dashboard =>
dashboardSrv.remove(dashboard)
Results.NoContent
}
}
}
```
|
Oteake Conservation Park is a protected area in the Waitaki District and Otago Region of New Zealand's South Island.
The park is managed by the New Zealand Department of Conservation.
Geography
The park covers .
It is located south of Omarama, Otematata and Lake Benmore.
History
The park was established in 2010.
References
Parks in Otago
Waitaki District
2010 establishments in New Zealand
Protected areas established in 2010
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var tape = require( 'tape' );
var Int8Array = require( '@stdlib/array/int8' );
var Uint8Array = require( '@stdlib/array/uint8' );
var Uint8ClampedArray = require( '@stdlib/array/uint8c' );
var Int16Array = require( '@stdlib/array/int16' );
var Uint16Array = require( '@stdlib/array/uint16' );
var Int32Array = require( '@stdlib/array/int32' );
var Uint32Array = require( '@stdlib/array/uint32' );
var Float32Array = require( '@stdlib/array/float32' );
var Float64Array = require( '@stdlib/array/float64' );
var allocUnsafe = require( '@stdlib/buffer/alloc-unsafe' );
var isNumericArray = require( './../lib' );
// TESTS //
tape( 'main export is a function', function test( t ) {
t.ok( true, __filename );
t.strictEqual( typeof isNumericArray, 'function', 'main export is a function' );
t.end();
});
tape( 'the function returns `true` if provided a numeric array', function test( t ) {
var values;
var i;
values = [
new Int8Array( 10 ),
new Uint8Array( 10 ),
new Uint8ClampedArray( 10 ),
new Int16Array( 10 ),
new Uint16Array( 10 ),
new Int32Array( 10 ),
new Uint32Array( 10 ),
new Float32Array( 10 ),
new Float64Array( 10 ),
[ 1, 2, 3 ]
];
for ( i = 0; i < values.length; i++ ) {
t.equal( isNumericArray( values[i] ), true, 'returns true when provided '+values[i] );
}
t.end();
});
tape( 'the function returns `false` if not provided a numeric array', function test( t ) {
var values;
var i;
values = [
'5',
5,
NaN,
null,
void 0,
true,
[],
[5, null],
[5, '5' ],
{},
function noop() {},
allocUnsafe( 10 )
];
for ( i = 0; i < values.length; i++ ) {
t.equal( isNumericArray( values[i] ), false, 'returns false when provided '+values[i] );
}
t.end();
});
```
|
```c++
//
// Aspia Project
//
// This program is free software: you can redistribute it and/or modify
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
//
// along with this program. If not, see <path_to_url
//
#include "base/files/base_paths.h"
#include "base/logging.h"
#if defined(OS_POSIX)
#include "base/environment.h"
#include <unistd.h>
#endif // defined(OS_POSIX)
#if defined(OS_LINUX)
#include "third_party/xdg_user_dirs/xdg_user_dir_lookup.h"
#include <linux/limits.h>
#endif // defined(OS_LINUX)
#if defined(OS_WIN)
#include <ShlObj.h>
#endif // defined(OS_WIN)
#if defined(OS_MAC)
#include <mach-o/dyld.h>
#include <sys/syslimits.h>
#endif // defined(OS_MAC)
namespace base {
namespace {
#if defined(OS_LINUX)
//your_sha256_hash----------------------------------
std::filesystem::path xdgUserDirectory(const char* dir_name, const char* fallback_dir)
{
std::filesystem::path path;
char* xdg_dir = xdg_user_dir_lookup(dir_name);
if (xdg_dir)
{
path = std::filesystem::path(xdg_dir);
free(xdg_dir);
}
else
{
BasePaths::userHome(&path);
path.append(fallback_dir);
}
return path;
}
#endif
} // namespace
#if defined(OS_WIN)
//your_sha256_hash----------------------------------
// static
bool BasePaths::windowsDir(std::filesystem::path* result)
{
DCHECK(result);
wchar_t buffer[MAX_PATH] = { 0 };
if (!GetWindowsDirectoryW(buffer, static_cast<UINT>(std::size(buffer))))
{
PLOG(LS_ERROR) << "GetWindowsDirectoryW failed";
return false;
}
result->assign(buffer);
return true;
}
//your_sha256_hash----------------------------------
// static
bool BasePaths::systemDir(std::filesystem::path* result)
{
DCHECK(result);
wchar_t buffer[MAX_PATH] = { 0 };
if (!GetSystemDirectoryW(buffer, static_cast<UINT>(std::size(buffer))))
{
PLOG(LS_ERROR) << "GetSystemDirectoryW failed";
return false;
}
result->assign(buffer);
return true;
}
#endif // defined(OS_WIN)
#if !defined(OS_MAC)
//your_sha256_hash----------------------------------
// static
bool BasePaths::userAppData(std::filesystem::path* result)
{
DCHECK(result);
#if defined(OS_WIN)
wchar_t buffer[MAX_PATH] = { 0 };
HRESULT hr = SHGetFolderPathW(nullptr, CSIDL_APPDATA, nullptr, SHGFP_TYPE_CURRENT, buffer);
if (FAILED(hr))
{
LOG(LS_ERROR) << "SHGetFolderPathW failed: " << SystemError::toString(hr);
return false;
}
result->assign(buffer);
return true;
#elif (OS_LINUX)
std::string value;
if (!Environment::get("XDG_DATA_HOME", &value) || value.empty())
{
if (!userHome(result))
return false;
result->append(".local/share");
return true;
}
result->assign(value);
return true;
#else
NOTIMPLEMENTED();
return false;
#endif
}
#endif
#if !defined(OS_MAC)
//your_sha256_hash----------------------------------
// static
bool BasePaths::userDesktop(std::filesystem::path* result)
{
DCHECK(result);
#if defined(OS_WIN)
wchar_t buffer[MAX_PATH] = { 0 };
HRESULT hr = SHGetFolderPathW(nullptr, CSIDL_DESKTOPDIRECTORY,
nullptr, SHGFP_TYPE_CURRENT, buffer);
if (FAILED(hr))
{
LOG(LS_ERROR) << "SHGetFolderPathW failed: " << SystemError::toString(hr);
return false;
}
result->assign(buffer);
return true;
#elif defined(OS_LINUX)
*result = xdgUserDirectory("DESKTOP", "Desktop");
return true;
#else
NOTIMPLEMENTED();
return false;
#endif
}
#endif
//your_sha256_hash----------------------------------
// static
bool BasePaths::userHome(std::filesystem::path* result)
{
DCHECK(result);
#if defined(OS_WIN)
wchar_t buffer[MAX_PATH] = { 0 };
HRESULT hr = SHGetFolderPathW(nullptr, CSIDL_PROFILE, nullptr, SHGFP_TYPE_CURRENT, buffer);
if (FAILED(hr))
{
LOG(LS_ERROR) << "SHGetFolderPathW failed: " << SystemError::toString(hr);
return false;
}
result->assign(buffer);
return true;
#elif (OS_POSIX)
std::string value;
if (!Environment::get("HOME", &value))
return false;
result->assign(value);
return true;
#else
NOTIMPLEMENTED();
return false;
#endif
}
#if !defined(OS_MAC)
//your_sha256_hash----------------------------------
// static
bool BasePaths::commonAppData(std::filesystem::path* result)
{
DCHECK(result);
#if defined(OS_WIN)
wchar_t buffer[MAX_PATH] = { 0 };
HRESULT hr = SHGetFolderPathW(nullptr, CSIDL_COMMON_APPDATA,
nullptr, SHGFP_TYPE_CURRENT, buffer);
if (FAILED(hr))
{
LOG(LS_ERROR) << "SHGetFolderPathW failed: " << SystemError::toString(hr);
return false;
}
result->assign(buffer);
return true;
#elif defined(OS_LINUX)
*result = "/etc";
return true;
#else
NOTIMPLEMENTED();
return false;
#endif
}
#endif
#if !defined(OS_MAC)
//your_sha256_hash----------------------------------
// static
bool BasePaths::commonDesktop(std::filesystem::path* result)
{
DCHECK(result);
#if defined(OS_WIN)
wchar_t buffer[MAX_PATH] = { 0 };
HRESULT hr = SHGetFolderPathW(nullptr, CSIDL_COMMON_DESKTOPDIRECTORY,
nullptr, SHGFP_TYPE_CURRENT, buffer);
if (FAILED(hr))
{
LOG(LS_ERROR) << "SHGetFolderPathW failed: " << SystemError::toString(hr);
return false;
}
result->assign(buffer);
return true;
#elif defined(OS_LINUX)
return userDesktop(result);
#else
NOTIMPLEMENTED();
return false;
#endif
}
#endif
//your_sha256_hash----------------------------------
// static
bool BasePaths::currentExecDir(std::filesystem::path* result)
{
DCHECK(result);
std::filesystem::path exe_path;
if (!currentExecFile(&exe_path))
{
LOG(LS_ERROR) << "currentExecFile failed";
return false;
}
*result = exe_path.parent_path();
return true;
}
//your_sha256_hash----------------------------------
// static
bool BasePaths::currentExecFile(std::filesystem::path* result)
{
DCHECK(result);
#if defined(OS_WIN)
wchar_t buffer[MAX_PATH] = { 0 };
if (!GetModuleFileNameW(nullptr, buffer, static_cast<DWORD>(std::size(buffer))))
{
PLOG(LS_ERROR) << "GetModuleFileNameW failed";
return false;
}
result->assign(buffer);
return true;
#elif defined(OS_LINUX)
char buffer[PATH_MAX] = { 0 };
ssize_t count = readlink("/proc/self/exe", buffer, std::size(buffer));
if (count == -1)
return false;
result->assign(buffer);
return true;
#elif defined(OS_MAC)
char buffer[PATH_MAX] = { 0 };
uint32_t buffer_size = std::size(buffer);
if (_NSGetExecutablePath(buffer, &buffer_size) != 0)
return false;
result->assign(buffer);
return true;
#else
NOTIMPLEMENTED();
return false;
#endif
}
} // namespace base
```
|
```objective-c
#pragma once
#include <c10/util/ArrayRef.h>
#include <c10/util/DimVector.h>
#include <algorithm>
namespace c10 {
// Computes the contiguous strides of a tensor, given its sizes.
inline DimVector contiguous_strides(const IntArrayRef sizes) {
using Int = IntArrayRef::value_type;
const Int dims = static_cast<Int>(sizes.size());
// With this initialisation we get the case dim == 0 or 1 right
DimVector strides(dims, 1);
for (auto i = dims - 2; i >= 0; --i) {
// Strides can't be 0 even if sizes are 0.
strides[i] = strides[i + 1] * std::max(sizes[i + 1], Int{1});
}
return strides;
}
} // namespace c10
```
|
Viv Efosa Solomon-Otabor (born 2 January 1996) is an English professional footballer who plays as a winger for Rukh Lviv.
He joined Birmingham City as a 16-year-old, and made his senior debut while on loan at Conference North club Oxford City in 2014. He first played for Birmingham in the League Cup in August 2015, and spent time on loan to League One clubs Bolton Wanderers in 2016–17, Blackpool for the 2017–18 season, and Portsmouth in 2018–19. He made 33 appearances in the Championship for Birmingham, and turned down their offer of a new contract in 2019. He spent the 2019–20 season with Bulgarian First League club CSKA Sofia before returning to England for a season with another League One club, Wigan Athletic.
Solomon-Otabor was born in England to Nigerian parents, and was an unused substitute for the Nigerian national team in October 2019.
Personal life
Solomon-Otabor was born in London to parents originally from Edo State, Nigeria. He is the nephew of Nigerian international footballer Thompson Oliha, and his father, Victor-Banks Otabor, played domestically for Bendel Insurance, NNPC and Eagle Oil. He attended Bishop Thomas Grant School, Streatham, and supported Manchester United as a boy; his friends included fellow future Anglo-Nigerian footballer Joe Aribo.
Club career
Early career
As a youngster, Solomon-Otabor played football with Hampton & Richmond Borough, and was a member of Crystal Palace's academy, before taking up a scholarship with Birmingham City in July 2012. In February 2014, he joined Conference North club Oxford City on a youth loan until the end of the season. He played 12 league matches, 7 as a member of the starting eleven, and scored once, in a 2–0 win away to Gloucester City, as Oxford City finished 20th.
Solomon-Otabor signed his first professional contract with Birmingham, of one year with the option of a second, in June 2014. In November, he described his strengths as speed, dribbling, and ability to play with both feet. He was a regular in the development squad over the season, and was a member of the team that won the Birmingham Senior Cup. His under-21 coach, Richard Beale, believed the player had the potential to progress to the first team but needed to work harder at the defensive aspects of the game.
Birmingham City
Birmingham took up the option for a further year on his contract, and he showed enough progress in pre-season and into the start of the 2015–16 season that manager Gary Rowett decided to keep him at the club instead of allowing him out on loan again. Rowett remarked on his physical development and his improved defensive work, rated him as "probably the quickest player we have got in the squad", and highlighted his having "roasted first team defenders in training". Solomon-Otabor was given a squad number "with a view to participation in" the second-round League Cup tie at home to Gillingham on 25 August 2015. He did indeed participate, as a second-half substitute, replacing Koby Arthur after 77 minutes. Birmingham won 2–0. He made his Football League debut on 15 September at home to Nottingham Forest, replacing David Cotterill for the last ten minutes of what proved to be Birmingham's first defeat of the season.
With Birmingham 3–2 ahead away at Fulham on 7 November, Solomon-Otabor came on as an 80th-minute substitute for Jon Toral. Deep into stoppage time, he scored his first senior professional goal, a solo effort that completed a 5–2 win: after a run down the left, "a neat turn that left Richard Stearman on his backside was followed by a clinical finish". After twelve substitute appearances in all competitions, Solomon-Otabor made his first start on 28 December, replacing the rested Demarai Gray for the visit of MK Dons. The Milton Keynes Citizen reported that Dons were lucky not to concede a penalty when a defender appeared to handle Solomon-Otabor's 36th-minute cross. Rowett "thought Viv looked a little bit nervous, which is understandable, but he's worked hard in the second-half and contributed to some of the moments and certainly the performance. ... Every time he comes on the pitch, he does what we ask him to do; he stays wide, he crosses the ball, he gets into good positions.
He remained in the starting eleven for the next match, at home to Brentford, with Gray about to complete his transfer to Leicester City of the Premier League, and a few days later signed a three-and-a-half-year contract, due to expire at the end of the 2018–19 season. Those were his only starts; he made eleven more appearances over the season, but all were as a substitute. Nevertheless, his performances earned him the club's Young Player of the Season award for 2015–16.
Loan spells
Having played little during 2016–17, Solomon-Otabor joined League One club Bolton Wanderers on 31 January 2017 on loan until the end of the season. Birmingham manager Gianfranco Zola hoped he would be able to progress a conversion from winger to striker. He made only four appearances, all as a substitute, before his loan expired.
In late July 2017, Solomon-Otabor signed for Blackpool, newly promoted to League One, on loan until 6 January 2018. He made his debut as a second-half substitute in the opening fixture of the season, and put in what the Blackpool Gazette called a "lively" performance in the next match, the EFL Cup defeat away to Wigan Athletic. He played regularly through the first half of the campaign, and his loan was extended to the end of the season. He went on to make 47 appearances (44 in League One) in which he scored five goals.
Behind Jota, Jacques Maghoma and loanee Connor Mahoney in the pecking order, Solomon-Otabor was used sparingly by Birmingham in the early part of the 2018–19 season. His last appearance was in November against Hull City: he came on in the first half for the injured Jota and was himself substituted after 65 minutes. Solomon-Otabor joined League One club Portsmouth on 31 January 2019 on loan until the end of the season. He did not become a regular in the side: he made seven league appearances, scored once, and played in both legs of Portsmouth's play-off semi-final defeat to Sunderland.
CSKA Sofia
On his return to Birmingham, the club offered him a one-year contract, which he chose to decline, instead signing a three-year deal with CSKA Sofia of the Bulgarian First League. He made 22 appearances in all competitions, scored once in 19 First League matches, and represented CSKA Sofia in the UEFA Europa League, before Bulgarian football was suspended in mid March 2020 because of the COVID-19 pandemic. Solomon-Otabor's contract was cancelled for financial reasons during the hiatus.
Following a controversial international match between England and Bulgaria in October 2019, he became a target for racial abuse from supporters of opposing clubs and of his own; the club itself spoke out in support of him.
Return to British football
Solomon-Otabor signed a short-term deal with Wigan Athletic, newly relegated to League One after entering administration, on 4 September 2020. He made his debut the next day in a 3–2 EFL Cup defeat away to Fleetwood Town. On 5 October 2020, Solomon-Otabor extended his contract with Wigan until January 2021, but soon afterwards he injured an ankle, required surgery, and his contract expired before he was able to play again. Having proved his fitness to Wigan's satisfaction at the end of January 2021, he signed on again to the end of the season, and returned to competitive action on 6 February. His first goal for the club opened the scoring in a 2–0 win away to Plymouth Argyle on 9 March. He finished the season with two goals from 31 appearances in all competitions.
Wigan made him an offer of terms for the coming season, but he had not accepted it by the time his existing contract expired at the end of June. After a period without a team, Solomon-Otabor signed for Scottish Premiership club St Johnstone on 24 November 2021 on a short-term contract until January 2022. After making two starts and five appearances as a substitute, he left the club upon the completion of his contract.
Rukh Lviv
In January 2022, Solomon-Otabor signed for Rukh Lviv of the Ukrainian Premier League. After joining his teammates at a training camp in Turkey, he had been in Ukraine for only one training session when 2022 Russian invasion of Ukraine led to the postponement of the football season. Travelling with two team-mates, Solomon-Otabor drove to the Polish border and managed to cross after a 10 hour wait, before heading to Krakow to fly to London.
International career
In June 2015, Solomon-Otabor was invited to attend trials for Nigeria's Olympic team, and trained with the team ahead of their 2015 All-Africa Games campaign.
In October 2019 he received his first call up for Nigeria, as a replacement for the injured Samuel Kalu for a friendly against Brazil in Singapore. He remained an unused substitute.
Career statistics
Honours
Individual
Birmingham City Young Player of the Season: 2015–16
References
External links
Profile at the Wigan Athletic F.C. website
1996 births
Living people
Footballers from Greater London
English men's footballers
Nigerian men's footballers
Men's association football wingers
Hampton & Richmond Borough F.C. players
Crystal Palace F.C. players
Birmingham City F.C. players
Oxford City F.C. players
Bolton Wanderers F.C. players
Blackpool F.C. players
Portsmouth F.C. players
PFC CSKA Sofia players
Wigan Athletic F.C. players
St Johnstone F.C. players
FC Rukh Lviv players
National League (English football) players
English Football League players
First Professional Football League (Bulgaria) players
Scottish Professional Football League players
English expatriate men's footballers
Expatriate men's footballers in Bulgaria
English expatriate sportspeople in Bulgaria
Expatriate men's footballers in Ukraine
English expatriate sportspeople in Ukraine
English sportspeople of Nigerian descent
Black British sportsmen
Ukrainian Premier League players
|
Desertores Islands are a group of islands in the Sea of Chiloé, between Chiloé Island and the mainland of Chile. They are the easternmost islands of the Chiloé Archipelago. They are administered as part of the Chaitén commune, in the Palena Province, unlike the rest of the Archipelago, which forms Chiloé Province. Talcan, the biggest and easternmost of the Desertores Islands, is just six km from the mainland.
The six main islands are Auten, Chuit, Chulin, Imerquiña, Nayahue and Talcan. There are several smaller islands, including Silla del Diablo, which lies halfway between Chulin and the mainland.
Archipelagoes of Chile
Islands of Chiloé Archipelago
Islands of Los Lagos Region
Archipelagoes of the Pacific Ocean
|
```objective-c
/*
==============================================================================
MultiplexIndexConditionEditor.h
Created: 15 Apr 2022 1:55:53pm
Author: bkupe
==============================================================================
*/
#pragma once
class MultiplexIndexConditionEditor :
public ConditionEditor
{
public:
MultiplexIndexConditionEditor(MultiplexIndexCondition*, bool isRoot);
virtual ~MultiplexIndexConditionEditor();
MultiplexIndexCondition* multiplexIndexCondition;
std::unique_ptr<InspectableEditor> startAt0UI;
std::unique_ptr<BaseComparatorUI> comparatorUI;
void setCollapsed(bool value, bool force = false, bool animate = true, bool doNotRebuild = false) override;
void resetAndBuild() override;
void resizedInternalContent(Rectangle<int>& r) override;
void childBoundsChanged(Component* c) override;
};
```
|
Lường Thị Thảo (born 11 May 1999) is a Vietnamese rower. She competed in the women's lightweight double sculls event at the 2020 Summer Olympics.
References
External links
1999 births
Living people
Vietnamese female rowers
Olympic rowers for Vietnam
Rowers at the 2020 Summer Olympics
Place of birth missing (living people)
Asian Games gold medalists for Vietnam
Asian Games bronze medalists for Vietnam
Asian Games medalists in rowing
Rowers at the 2018 Asian Games
Rowers at the 2022 Asian Games
Medalists at the 2018 Asian Games
Medalists at the 2022 Asian Games
21st-century Vietnamese women
21st-century Vietnamese people
|
```python
from __future__ import division, print_function, absolute_import
_have_pil = True
try:
from scipy.misc.pilutil import imread as _imread
except ImportError:
_have_pil = False
__all__ = ['imread']
# Use the implementation of `imread` in `scipy.misc.pilutil.imread`.
# If it weren't for the different names of the first arguments of
# ndimage.io.imread and misc.pilutil.imread, we could simplify this file
# by writing
# from scipy.misc.pilutil import imread
# Unfortunately, because the argument names are different, that
# introduces a backwards incompatibility.
def imread(fname, flatten=False, mode=None):
if _have_pil:
return _imread(fname, flatten, mode)
raise ImportError("Could not import the Python Imaging Library (PIL)"
" required to load image files. Please refer to"
" path_to_url for installation"
" instructions.")
if _have_pil and _imread.__doc__ is not None:
imread.__doc__ = _imread.__doc__.replace('name : str', 'fname : str')
```
|
Lavasanat District () is in Shemiranat County, Tehran province, Iran. The administrative center of the district is Lavasan.
At the 2006 National Census, its population was 22,289 in 6,615 households. The following census in 2011 counted 25,376 people in 8,196 households. At the latest census in 2016, the district had 29,860 inhabitants in 10,138 households.
During the Qajar era and early 20th century Lavasanat was the transit way between northern slopes of Elburz and Tehran with Great Lavasan (Lavasan Bozorg), Ammameh , Afjeh and Najarkala known as the most famous towns of Lavasanat.
The natives of the Lavasanat district are of Caspian origin. The local dialect or "vernacular" spoken by its natives is a mix of Persian and Caspian. In the village of Ira (as well as Veskara), this vernacular approaches Mazandarani.
References
Sources
Shemiranat County
Districts of Tehran Province
Populated places in Shemiranat County
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "path_to_url">
<plist version="1.0">
<dict>
<key>BuildMachineOSBuild</key>
<string>15G31</string>
<key>CFBundleDevelopmentRegion</key>
<string>English</string>
<key>CFBundleExecutable</key>
<string>CodecCommander</string>
<key>CFBundleGetInfoString</key>
<key>CFBundleIdentifier</key>
<string>org.tw.CodecCommander</string>
<key>CFBundleInfoDictionaryVersion</key>
<string>6.0</string>
<key>CFBundleName</key>
<string>CodecCommander</string>
<key>CFBundlePackageType</key>
<string>KEXT</string>
<key>CFBundleShortVersionString</key>
<string>2.6.2</string>
<key>CFBundleSignature</key>
<string>????</string>
<key>CFBundleSupportedPlatforms</key>
<array>
<string>MacOSX</string>
</array>
<key>CFBundleVersion</key>
<string>2.6.2</string>
<key>DTCompiler</key>
<string>com.apple.compilers.llvm.clang.1_0</string>
<key>DTPlatformBuild</key>
<string>7D175</string>
<key>DTPlatformVersion</key>
<string>GM</string>
<key>DTSDKBuild</key>
<string>10M2518</string>
<key>DTSDKName</key>
<string>macosx10.6</string>
<key>DTXcode</key>
<string>0730</string>
<key>DTXcodeBuild</key>
<string>7D175</string>
<key>IOKitPersonalities</key>
<dict>
<key>CodecCommander</key>
<dict>
<key>CFBundleIdentifier</key>
<string>org.tw.CodecCommander</string>
<key>Codec Profile</key>
<dict>
<key>1002</key>
<string>Disabled HDMI</string>
<key>10de</key>
<string>Disabled HDMI</string>
<key>10ec_0233</key>
<string>Realtek ALC283,etc</string>
<key>10ec_0235</key>
<string>Realtek ALC283,etc</string>
<key>10ec_0255</key>
<string>Realtek ALC283,etc</string>
<key>10ec_0269</key>
<string>Realtek ALC269</string>
<key>10ec_0269_HDA_1028_04d9</key>
<string>Realtek ALC269VB</string>
<key>10ec_0269_HDA_1458_fa50</key>
<string>Realtek ALC269 BRIX</string>
<key>10ec_0282</key>
<string>Realtek ALC283,etc</string>
<key>10ec_0283</key>
<string>Realtek ALC283,etc</string>
<key>10ec_0292</key>
<string>Realtek ALC292</string>
<key>10ec_0668</key>
<string>Realtek ALC668</string>
<key>10ec_0892_HDA_1458</key>
<string>Realtek ALC892 desktop</string>
<key>10ec_0892_HDA_8086</key>
<string>Realtek ALC892 desktop</string>
<key>10ec_0900</key>
<string>Realtek ALC1150</string>
<key>8086</key>
<string>Disabled HDMI</string>
<key>Default</key>
<dict>
<key>Check Infinitely</key>
<false/>
<key>Check Interval</key>
<integer>3000</integer>
<key>Custom Commands</key>
<array/>
<key>Perform Reset</key>
<true/>
<key>Perform Reset on EAPD Fail</key>
<false/>
<key>Perform Reset on External Wake</key>
<true/>
<key>Send Delay</key>
<integer>300</integer>
<key>Sleep Nodes</key>
<true/>
<key>Update Nodes</key>
<true/>
</dict>
<key>Disabled HDMI</key>
<dict>
<key>Check Infinitely</key>
<false/>
<key>Disable</key>
<true/>
<key>Sleep Nodes</key>
<false/>
<key>Update Nodes</key>
<false/>
</dict>
<key>Realtek ALC1150</key>
<dict>
<key>Custom Commands</key>
<array>
<dict>
<key>Command</key>
<data>
AgUABw==
</data>
<key>Comment</key>
<string>0x20 SET_COEF_INDEX 0x07</string>
<key>On Init</key>
<true/>
<key>On Sleep</key>
<true/>
<key>On Wake</key>
<true/>
</dict>
<dict>
<key>Command</key>
<data>
AgR8sA==
</data>
<key>Comment</key>
<string>0x20 SET_PROC_COEF 0x7CB0</string>
<key>On Init</key>
<true/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<true/>
</dict>
</array>
<key>Send Delay</key>
<integer>100</integer>
<key>Sleep Nodes</key>
<false/>
<key>Update Nodes</key>
<false/>
</dict>
<key>Realtek ALC269</key>
<dict>
<key>Custom Commands</key>
<array>
<dict>
<key>Command</key>
<data>
AVcIgw==
</data>
<key>Comment</key>
<string>0x15 SET_UNSOLICITED_ENABLE 0x83</string>
<key>On Init</key>
<true/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<true/>
</dict>
</array>
</dict>
<key>Realtek ALC269 BRIX</key>
<dict>
<key>Custom Commands</key>
<array>
<dict>
<key>Command</key>
<data>
AVcIgw==
</data>
<key>Comment</key>
<string>0x15 SET_UNSOLICITED_ENABLE 0x83</string>
<key>On Init</key>
<false/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<false/>
</dict>
</array>
</dict>
<key>Realtek ALC269VB</key>
<dict>
<key>Custom Commands</key>
<array>
<dict>
<key>Command</key>
<data>
AhcIgw==
</data>
<key>Comment</key>
<string>0x21 SET_UNSOLICITED_ENABLE 0x83</string>
<key>On Init</key>
<true/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<true/>
</dict>
</array>
<key>Send Delay</key>
<integer>20</integer>
<key>Sleep Nodes</key>
<false/>
</dict>
<key>Realtek ALC283,etc</key>
<dict>
<key>Custom Commands</key>
<array>
<dict>
<key>Command</key>
<data>
AZcHJQ==
</data>
<key>Comment</key>
<string>0x19 SET_PIN_WIDGET_CONTROL 0x25</string>
<key>On Init</key>
<true/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<true/>
</dict>
<dict>
<key>Command</key>
<data>
AhcIgw==
</data>
<key>Comment</key>
<string>0x21 SET_UNSOLICITED_ENABLE 0x83</string>
<key>On Init</key>
<true/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<true/>
</dict>
</array>
<key>Perform Reset</key>
<false/>
<key>Send Delay</key>
<integer>10</integer>
<key>Sleep Nodes</key>
<false/>
</dict>
<key>Realtek ALC292</key>
<dict>
<key>Custom Commands</key>
<array>
<dict>
<key>Command</key>
<string>0x01a70724</string>
<key>Comment</key>
<string>Node 0x1a - Pin Control (In Enable / VRefEn)</string>
<key>On Init</key>
<true/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<true/>
</dict>
<dict>
<key>Command</key>
<data>
AVcIgw==
</data>
<key>Comment</key>
<string>0x15 SET_UNSOLICITED_ENABLE 0x83</string>
<key>On Init</key>
<true/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<true/>
</dict>
</array>
<key>Perform Reset</key>
<false/>
</dict>
<key>Realtek ALC668</key>
<dict>
<key>Custom Commands</key>
<array>
<dict>
<key>Command</key>
<data>
AVcIgw==
</data>
<key>Comment</key>
<string>0x15 SET_UNSOLICITED_ENABLE 0x83</string>
<key>On Init</key>
<true/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<true/>
</dict>
<dict>
<key>Command</key>
<data>
AbcHIA==
</data>
<key>Comment</key>
<string>Node 0x1b - Pin Control (In Enable)</string>
<key>On Init</key>
<false/>
<key>On Sleep</key>
<false/>
<key>On Wake</key>
<true/>
</dict>
</array>
<key>Perform Reset</key>
<false/>
</dict>
<key>Realtek ALC892 desktop</key>
<dict>
<key>Sleep Nodes</key>
<false/>
<key>Update Nodes</key>
<false/>
</dict>
</dict>
<key>IOClass</key>
<string>CodecCommander</string>
<key>IOMatchCategory</key>
<string>CodecCommander</string>
<key>IOProviderClass</key>
<string>IOHDACodecFunction</string>
<key>IOUserClientClass</key>
<string>CodecCommanderClient</string>
</dict>
<key>CodecCommanderPowerHook</key>
<dict>
<key>CFBundleIdentifier</key>
<string>org.tw.CodecCommander</string>
<key>Codec Profile</key>
<dict>
<key>1002</key>
<string>Disabled HDMI</string>
<key>10de</key>
<string>Disabled HDMI</string>
<key>8086</key>
<string>Disabled HDMI</string>
<key>Disabled HDMI</key>
<dict>
<key>Disable</key>
<true/>
</dict>
</dict>
<key>IOClass</key>
<string>CodecCommanderPowerHook</string>
<key>IOMatchCategory</key>
<string>CodecCommanderPowerHook</string>
<key>IOProviderClass</key>
<string>AppleHDADriver</string>
</dict>
<key>CodecCommanderProbeInit</key>
<dict>
<key>CFBundleIdentifier</key>
<string>org.tw.CodecCommander</string>
<key>Codec Profile</key>
<dict>
<key>Default</key>
<dict>
<key>Custom Commands</key>
<array/>
</dict>
</dict>
<key>IOClass</key>
<string>CodecCommanderProbeInit</string>
<key>IOProbeScore</key>
<integer>5000</integer>
<key>IOProviderClass</key>
<string>IOHDACodecDevice</string>
</dict>
<key>CodecCommanderResidency</key>
<dict>
<key>CFBundleIdentifier</key>
<string>org.tw.CodecCommander</string>
<key>IOClass</key>
<string>CodecCommanderResidency</string>
<key>IOMatchCategory</key>
<string>CodecCommanderResidency</string>
<key>IOProviderClass</key>
<string>IOResources</string>
</dict>
<key>CodecCommanderVoodooHDA</key>
<dict>
<key>CFBundleIdentifier</key>
<string>org.tw.CodecCommander</string>
<key>Codec Profile</key>
<dict>
<key>1002</key>
<string>Disabled HDMI</string>
<key>10de</key>
<string>Disabled HDMI</string>
<key>8086</key>
<string>Disabled HDMI</string>
<key>Default</key>
<dict>
<key>Check Infinitely</key>
<false/>
<key>Perform Reset</key>
<false/>
<key>Perform Reset on EAPD Fail</key>
<false/>
<key>Perform Reset on External Wake</key>
<false/>
<key>Sleep Nodes</key>
<false/>
<key>Update Nodes</key>
<false/>
</dict>
<key>Disabled HDMI</key>
<dict>
<key>Check Infinitely</key>
<false/>
<key>Disable</key>
<true/>
<key>Sleep Nodes</key>
<false/>
<key>Update Nodes</key>
<false/>
</dict>
</dict>
<key>IOClass</key>
<string>CodecCommander</string>
<key>IOMatchCategory</key>
<string>CodecCommander</string>
<key>IOProviderClass</key>
<string>VoodooHDADevice</string>
<key>IOUserClientClass</key>
<string>CodecCommanderClient</string>
</dict>
</dict>
<key>OSBundleLibraries</key>
<dict>
<key>com.apple.iokit.IOACPIFamily</key>
<string>1.0d1</string>
<key>com.apple.iokit.IOAudioFamily</key>
<string>1.1</string>
<key>com.apple.iokit.IOPCIFamily</key>
<string>1.0.0b1</string>
<key>com.apple.kpi.bsd</key>
<string>9.0.0</string>
<key>com.apple.kpi.iokit</key>
<string>9.0.0</string>
<key>com.apple.kpi.libkern</key>
<string>9.0.0</string>
</dict>
<key>Source Code</key>
<string>path_to_url
</dict>
</plist>
```
|
Julius Rosemann (8 November 1878 – 4 May 1933) was a German politician of the Independent Social Democratic Party.
Life and career
Julius Rosemann was born in Essen. After attending Volksschule, he earned his living as a miner. Around 1895 he joined the Social Democratic Party (SPD). In 1905 he was married. Following the split within the SPD in 1917, he joined the left-wing faction which formed the Independent Social Democratic Party (USPD). From June 1920 until May 1924 he sat as a deputy for the USPD in the first Reichstag parliament of the Weimar Republic, in which he represented Electoral District 25 (Dusseldorf-East). In later years Rosemann worked as a trade union organizer in Hamm.
After the Nazi seizure of power in the spring of 1933, Rosemann was arrested on May 2. After severe mistreatment in prison, he allegedly took his own life in the Hamm Prison on May 4. By contrast, a contemporary source claimed Rosemann had been shot while in custody.
Memorials
Since 1992, Rosemann's name appears on one of the 96 plaques in the Memorial to the Murdered Members of the Reichstag, on the corner of Scheidemannstraße / Republic Square in Berlin near the Reichstag building.
Publications
Die Sechsstundenschicht im Bergbau. Referat und Korreferat auf der außerordentlichen Generalversammlung in Bochum, s.l.e.a. [Bochum 1920]. (with Otto Hue)
References
Links
Members of the Reichstag of the Weimar Republic
Prisoners who died in German detention
Independent Social Democratic Party politicians
Politicians from Essen
1878 births
1933 deaths
|
The 6th Airborne Division in Palestine was initially posted to the region as the Imperial Strategic Reserve. It was envisioned as a mobile peace keeping force, positioned to be able to respond quickly to any area of the British Empire. In fact the division became involved in an internal security role between 1945 and 1948.
Palestine had been a British Mandate since the end of World War I. Under the terms of the mandate, Great Britain was responsible for the government and security of the country. It had long been a stated British aim to establish a Jewish homeland in Palestine and between 1922 and 1939 over 250,000 Jewish immigrants had arrived in the country. However, Arab resistance and World War II prompted the British to curtail immigration. The time also saw the rise of the Jewish Resistance Movement, which eventually came into conflict with the British authorities.
When the British 6th Airborne Division arrived in response to increasing terrorist activity, it became involved in internal security, being responsible for cordons and search operations, guarding convoys and key installations. As the situation worsened, the men of the division had to patrol the towns and cities, enforce curfews and deal with rioting by the civilian population. They also protected Jewish and Arab settlements from sectarian violence. This was not without loss to the division and several members were killed and wounded during this time.
The end of the British mandate coincided with the post war reduction of the British Army back to peace time levels, and the division's numbers were gradually reduced. By the end of their tenure in Palestine, the division's strength was reduced in real terms, to less than brigade size. In 1948 it was disbanded soon after its withdrawal from Palestine.
Background
In July 1922, the British Mandate of Palestine was created. Under the terms of the mandate, Great Britain was responsible for the government and defence of the country and for the establishment of a Jewish homeland. Then in September 1922, the League of Nations and Great Britain decided that any Jewish homeland would not be formed in the land to the east of the River Jordan. This instead became a separate country known as the Hashemite Kingdom of Jordan.
Encouraged by the British, 265,000 Jewish immigrants, mainly from Europe, came to settle in Palestine between 1919 and 1939. Arab resistance and violence to this influx of immigrants came to a head in 1937, and the Peel Commission recommended that two states should be formed, one Arab and one Jewish, which would divide the country between them. Then in May 1939, the British restricted the number of Jewish immigrants to 75,000 in the White Paper of 1939.
By the end of 1945, Jewish immigration had almost reached the 75,000 White Paper limit. Arab concerns led to the British putting further restrictions on immigration. Even when the scale of the Holocaust became known, the British stance remained the same. This led to an inevitable confrontation between the British authorities, illegal Jewish immigrants, and militant Zionist groups. It became a widespread belief within the Jewish community that the British were practising antisemitism and were no different from Nazi Germany. However, between 1945 and 1948 a further 85,000 Jewish immigrants, mostly survivors of the Holocaust, entered the country illegally.
Jewish resistance movements
During this time the Jewish Resistance Movement was formed, comprising several pre-existing Jewish groups. In 1921, the part-time Haganah was formed and trained as a national army. Most Jewish males and some females were required to join. After the Second World War, it obtained numerous surplus weapons to equip its members. The Haganah gave priority to increasing the Jewish population by bringing immigrants into the country from Europe. It always attempted to give prior notice of an attack so that any security service personnel in the area could be evacuated.
When Axis forces posed a threat to the Middle East in the Second World War, the Haganah organized a full-time, elite force, the Palmach. By 1947, this organization numbered around 2,200 members. Palmach members were subject to military discipline; many of them had served in the British forces during the war.
In 1937, a splinter group was formed by those not happy with the Haganah methods. This group was called the National Military Organization in the Land of Israel or Irgun in short. It launched a campaign of violence against the government in 1944, carrying out several terrorist attacks. By 1945, Irgun had an estimated membership of 1,500. A third group was the Lehi, the Hebrew acronym of "Fighters for the Freedom of Israel", known in the British press as the Stern Gang. Lehi membership consisted of only around fifty men. It was the only Jewish group that contemplated working with the Italians and Germans during the war, and afterwards assassinated members of the British authorities. By 1946, both the Irgun and Lehi had declared war on Great Britain.
British 6th Airborne Division
Despite its name, the 6th Airborne Division was one of only two airborne divisions raised by the British Army during the Second World War. Before being deployed to Palestine, the division had served only in Europe. It had participated in the Normandy landings in June 1944 and later the Battle of the Bulge in December. After the Rhine crossing in March 1945, it spent six weeks advancing across Germany to the Baltic Sea.
At the end of the war in Europe, it had been planned to send the division to Burma to form an airborne corps with the 44th Indian Airborne Division. However, the atomic bombings of Hiroshima and Nagasaki, and the Japanese surrender, ended the war and changed British plans. The 6th Airborne Division was nominated to be the Imperial Strategic Reserve. Together with a Royal Air Force troop-carrier formation, they were to be located in the Middle East as a quick reaction peace keeping force for the British Empire. Initially No. 283 Wing RAF had two squadrons of transport aircraft, 620 and 644, available to provide troop transport.
By September 1945, the division was en route to the region for airborne training. However, conditions in Palestine were deteriorating. By the time the division arrived, instead of training, it was deployed on internal security.
During the Second World War, the division comprised the 3rd Parachute Brigade and 5th Parachute Brigade, both consisting of parachute infantry, and the 6th Airlanding Brigade, composed of glider infantry. However the 5th Parachute Brigade had been sent to] India ahead of the rest of the division. So when the division was dispatched to the Middle East, the 2nd Parachute Brigade was assigned to bring them up to strength. In May 1946, after the 1st Airborne Division was disbanded, the 1st Parachute Brigade joined the division, replacing the 6th Airlanding Brigade. In August 1946, the 5th Parachute Brigade returned from the Far East, and joined the division, but was disbanded soon afterwards. The next major manpower development came in 1947, when the 3rd Parachute Brigade was disbanded and the 2nd Parachute Brigade, while remaining part of the division, was withdrawn to England, then sent to Germany.
Operations
1945
Still commanded by its last wartime commander, Major General Eric Bols, the division began deployment to Palestine in 1945. The advance party arrived on 15 September, followed by the Tactical Headquarters on 24 September, then the 3rd Parachute Brigade on 3 October, the 6th Airlanding Brigade on 10 October and the 2nd Parachute Brigade on 22 October. After arriving by sea at Haifa, the newly arrived troops were sent to camps in the Gaza Subdistrict to acclimatize to the conditions, and to regain their fitness after the long sea journey from England. By the end of the month divisional headquarters was established at Bir Salim. The 2nd Parachute Brigade at remained at Gaza, the 3rd Parachute Brigade moved to the Tel Aviv and Jaffa region, while the 6th Airlanding Brigade moved to Samaria.
It was not long before the division became involved in operations, enforcing a night time curfew at the end of October after the railway in the divisional area was sabotaged. On 13 November the British Government confirmed they would examine the conditions of Jews in Europe and consult the Arabs to ensure Jewish immigration, at the time around 1,500 persons a month, was not hindered.
Unhappy that the announcement did not go far enough, the Jewish National Council arranged a twelve-hour strike for the next day. Rioting started in Tel Aviv and the Jewish part of Jerusalem, which resulted in the 3rd Parachute Brigade being deployed to patrol the streets for the following five days.
The first operation involving the 6th Airlanding Brigade followed two attacks by the Palmach on coastguard stations over the night of 24/25 November. Palestine Police Force dogs tracked the attackers to the settlements of Rishpon and Sidna Ali. In the following cordon and search operation, the police were stoned by the inhabitants, and the soldiers on the cordon had to prevent reinforcements from other settlements reaching the villages. The next day, 26 November, the police were involved in hand-to-hand fighting with the villagers and eventually withdrew, calling on the brigade to enter the settlements and enforce law and order. Leaving some men behind on the cordon to hold back the estimated 3,000 crowd, the remainder of the brigade entered the settlements. Here they carried out several baton charges and for the first time used tear gas to disperse the crowds. In the cleanup operation, 900 persons were later arrested.
Near the end of the year, over the night of 26/27 December, several attacks were carried out by the Irgun on police stations, Palestine Railways installations and one British Army armoury. The 3rd Parachute Brigade again enforced a night time curfew on Tel Aviv. Then on 29 December, it took part in Operation Pintail, the search of Ramat Gan, for Irgun members involved in the attacks. The brigade questioned the 1,500 inhabitants, arresting eighty-nine.
1946
The first mission of 1946 was Operation Hebron on 8 January. This time the objective was the cordon and search of the town of Rishon LeZion by the 3rd Parachute Brigade and the police, during which fifty-five suspects were taken into custody. For the rest of the month, the brigade was involved in several smaller operations. In Operation Pigeon on 30 January, they searched the Shapira district of Tel Aviv.
On 5 March Major General James Cassels took over command of the division. The next action involving the division was over the night of 2/3 April, when units of the Irgun attacked railway installations in the divisional area. While one attack on the Yibna railway station and police post was in progress, a mobile patrol from the 9th Parachute Battalion arrived, detonating a mine while crossing a bridge. Three of the patrol were wounded, but the others took off after the saboteurs. Reinforcements arrived from the 5th and 6th Parachute Battalions. In the morning, tracks of around thirty men were discovered leading away from the area. A spotter plane later located the men and directed a section of the 8th Parachute Battalion to intercept them. After a small battle, fourteen of the saboteurs were wounded and twenty-six prisoners taken.
In March the 1st Parachute Brigade joined the division. The 6th Airlanding Brigade left the division on 13 April, but remained in Palestine as the 31st Independent Infantry Brigade. This reduced the division's manpower by around twenty-five per cent as the strength of the airlanding brigade had been almost equal to that of two parachute brigades combined.
At 20:45 on 25 April, the Lehi carried out an attack on a divisional car park in Tel Aviv. On that night, the car park was guarded by ten men from the 5th Parachute Battalion. The attackers, around thirty men, established a fire base in a house overlooking the car park. The attack began with a bomb thrown into a guard tent. Gunfire was directed at all of the soldiers in the area, then twenty of the attackers stormed the car park. Once inside the compound, they entered the guard tents, killing four unarmed soldiers and looting the rifle racks of weapons. Another two off-duty soldiers, responding to the attack, were killed approaching the car park. In total, seven men from the division were killed.
This was the first deliberate attack by any group targeting the British Army, which had not established defences against any form of assault. During the following day seventy suspects were rounded up, but no evidence of their involvement could be found. In response to the attack, the British imposed a road curfew from 18:00 to 06:00 each night and all cafes, restaurants and public entertainment venues in Tel Aviv were closed between 20:00 and 05:00. However this was not enough for some members of the division, who attacked Jewish houses in Qastina and Be'er Tuvia, injuring some of the occupants. Those involved were later punished by the British Army.
Attacks on the security services had increased to a level that on 19 June all ranks were ordered to be armed at all times on or off duty, and to travel in pairs during the day and in threes at night. Near the end of June the division received orders for Operation Agatha, the arrest of Jewish leaders "suspected of condoning" or being involved in sabotage or murder of civil and military personnel. Agatha was a nationwide operation involving not only the 6th Airborne Division but the Palestinian Police Force and all other army units in the country. Secondary objectives were to gather intelligence and arrest any members of the Palmach that could be found.
Operation Agatha started at 04:15 on 29 June. The 2nd Parachute Brigade was responsible for Tel Aviv, the 1st Parachute Brigade for Jewish settlements around Ma'abarot and the 3rd Parachute Brigade for those around Givat Brenner. The operation ended on 1 July after 2,718 suspects had been arrested. Many had no connection to the resistance movements and were instead arrested for harassing the searchers or for refusing to give their names when asked. The 6th Airborne Division alone arrested 636 persons, 135 of them for being suspected Palmach members and ten were Jewish leaders.
The next major incident was on 22 July, when the British administrative and military headquarters located in the King David Hotel were bombed. No members of the division were directly involved, but the Royal Engineers of the 9th Airborne Squadron were called in to take charge of the search for survivors and secure the part of the building left standing. Over the next three days they located six survivors and the bodies of ninety-one victims. To assist in the search for those responsible, the 8th and 9th Parachute Battalions moved into Jerusalem on 23 July.
The British response to the bombing came on 30 July, when the division carried out Operation Shark. Believing that the bombers were being sheltered in Tel Aviv, every dwelling and building was searched for members of the Lehi and Irgun, and the population questioned. During the operation, a cordon surrounded the city and a curfew was imposed on its inhabitants. To allow the population to buy food and other essentials, the curfew was lifted for two hours every second day, until the end of the operation. The division's three parachute brigades were each given one quarter of the city to cordon and search while the fourth quarter was the responsibility of the 2nd Infantry Brigade, attached to the division for the operation. Over four days each brigade questioned around 100,000 people, and 787 were detained for further questioning. During the searches, five arms dumps were found, containing four machine guns, twenty-three mortars, 176 rifles and pistols, and 127,000 round of ammunition. Also found were £50,000 of forged bearer bonds, forging equipment and a large amount of explosives.
The division's next operations were Bream and Eel, searching for arms in Dorot and Ruhama, by the 3rd and 8th Parachute Battalions, and the 9th Airborne Squadron Royal Engineers. The two villages were cordoned at dawn on 28 August. Over the next six days the settlements were searched, during which a large quantity of assorted weapons, including heavy machine guns and mortars, were found.
Over the remaining months of the year the division carried out patrols of the rail and road networks, which were being mined. Some of the mines killed men from the division attempting to disarm them, until orders were issued to blow the mines up rather than disarm them. Then on 2 December a road mine killed four men from the 2nd Forward Observation Unit (Airborne).
A change in command occurred on 13 December when Major General Cassels left the division and was replaced by Eric Bols, now commanding the division for the second time.
1947
Between 29 December 1946 and 3 January the division's brigades carried out seven search operations in Tel Aviv, arresting 191 people. On 2 January several attacks were made on roads in the division's area. One attack wounded eight men of the 4th and 5th Parachute Battalions. Another attack on the same day was carried out by the Lehi against the 1st Parachute Battalion headquarters in Tel Aviv, killing a Jewish policeman and wounding two soldiers and another police officer. Then on 18 January the 6th Airborne and 1st Infantry Division swapped locations, the airborne division now assuming responsibility for the north of the country. Although it remained part of the division, the 2nd Parachute Brigade was withdrawn to England on 24 January.
Upon their arrival in the north, the 1st Parachute Brigade assumed responsibility for the District of Galilee, and the 3rd Parachute Brigade for the District of Haifa, with division headquarters located in the Stella Maris Monastery. The 1st Parachute Brigade also took under its command the Transjordan Frontier Force and a battalion of the Arab Legion to cover their large area. In the north the division was mainly responsible for the security of the port of Haifa, the largest in the country, where they protected oil installations, the Mosul-Haifa oil pipeline and prevented illegal immigrants from landing on the coastline. On 31 January it was announced that all non-essential British civilians were to be evacuated, due to the worsening situation. The evacuation took place from Haifa between 5 and 8 February, under the control of the 8th Parachute Battalion and the Royal Navy.
On 4 May a group of around forty men carried out the Acre Prison break, releasing forty-one Jews and 214 Arabs. At the same time a mortar attack was carried out on the 2nd Parachute Battalion's camp, as a diversion. The first unit to reach the prison was a platoon from the 1st Parachute Battalion, 35 minutes later. Other men from the battalion and some divisional units were bathing in the sea a short distance from the prison. A truck load of escaping prisoners opened fire on one unit's armoured car. The escaping truck then reached an improvised road block set up by some bathers and crashed under fire. The division's bathing party killed four attackers, four Jewish and one Arab escapee, and recaptured thirteen Jews. The bathers had eight men wounded during the short battle. While this was going on, the 1st Parachute Brigade was establishing a cordon around Acre and the surrounding area but no further escapees were caught.
The next attack was on officers from the 9th Parachute Battalion on 28 June. The officers were dining at a restaurant when two men of the Irgun approached and fired machine guns through the windows. One officer was killed outright while several others were wounded. The officers returned fire and the car the gunmen were escaping in crashed; later examination revealed at least one of them had been wounded. On 19 July two police officers on patrol in Haifa were shot in the back and killed. The following day the 3rd Parachute Brigade cordoned the area and imposed a night time curfew, which was not lifted until 30 July.
Leadership of the division changed again on 19 August, when Major General Hugh Stockwell was given command. In October the British War Office announced the division would be reduced by one brigade. The 3rd Parachute Brigade was disbanded, leaving the 1st Parachute Brigade in Palestine and the 2nd Parachute Brigade in England. The 1st Parachute Brigade assumed responsibility for Haifa and to cover all its commitments the 2nd Battalion Middlesex Regiment was attached to the brigade.
At a meeting on 29 November, the United Nations General Assembly decided to end the British Mandate on 1 August 1948. Palestine would be partitioned into separate Arab and Jewish states, with Jerusalem becoming an international city. The Jewish state would have fifty-six per cent of the land with a population of 490,000 Jews and 325,000 Arabs, while the Arab state would have 807,000 Arabs, but only 10,000 Jews. The population of Jerusalem would be around 105,000 Arabs to 100,000 Jews.
On 13 December trouble came from another quarter, in the town of Safed, opposite the Golan Heights. Fighting had started between the Arab and Jewish inhabitants. The police requested help from the army and a company from the 8th Parachute Battalion was assigned the task. Arabs fired at the British unit on 21 December without causing any injuries.
1948
Tension in the Golan Heights area remained high and on 9 January the Jewish settlements of Dan and Kfar Szold were attacked by Arab irregulars from the Arab Liberation Army, who crossed the border from Syria. The division responded by immediately sending a troop of armoured cars from the 17th/21st Lancers to each village. By the afternoon the 1st Parachute Battalion had joined the battle and air support from the Royal Air Force was called in. The battle ended with the Arabs withdrawing; their casualties are not known. Nine Jews were killed or wounded by the Arabs, the British troops uninjured.
To assist in controlling the region, an ad hoc formation called Craforce was established. Under the command of the division's commander, Royal Artillery Brigadier C. H. Colquhoun, were the division's artillery, the 17th/21st Lancers, the 1st Parachute Battalion and the 1st Battalion Irish Guards. Craforce became involved with breaking up attacks between Arab and Jewish forces. The Arabs did not directly attack the British, but did engage them when British attempted to intervene in an attack on Jewish settlements.
In February the Arab Liberation Army, under the command of Fawzi al-Qawuqji, was estimated to be around 10,000 strong. It was believed around 1,000 volunteers from neighbouring Arab states joined each month.
On 18 February it was announced that the 6th Airborne Division would be disbanded when they left Palestine. The 1st Parachute Brigade handed over Haifa to the 1st Guards Brigade on 6 April. Gradually the division's units left the country. The division's last units, comprising part of divisional headquarters, the 1st Parachute Battalion and the 1st Airborne Squadron Royal Engineers, departed on 18 May.
Aftermath
Since the end of the Second World War, the campaign in the British Mandate of Palestine had cost the British 338 dead. The numbers for the 6th Airborne Division between October 1945 and April 1948 were fifty-eight men dead and 236 wounded due to enemy action, a further ninety-nine men died, from causes not associated with a hostile act. During their searches of Jewish and Arab settlements, men from the division had located 99 mortars, 34 machine guns, 174 sub machine guns, 375 rifles, 391 pistols, 97 land mines, 2,582 hand grenades and 302,530 rounds of ammunition.
In February 1948 the 2nd Parachute Brigade moved from England to Germany, becoming part of the British Army of the Rhine. The 6th Airborne Division was disbanded in April 1948, shortly after their return to England, leaving the 2nd Parachute Brigade as the only brigade-sized airborne formation in the British Army.
On 14 May, the day before the end of the British mandate, David Ben-Gurion, chairman of the Jewish Agency for Palestine, announced the establishment of the state of Israel in parts of what was known as the British Mandate of Palestine. The announcement was the catalyst for the start of the 1948 Arab–Israeli War.
Notes
Footnotes
Citations
References
External links
The "Kalaniots" The 6th Airborne Division In Palestine at Britain's small wars
The Jewish Community Under the Mandate at The Jewish Virtual Library
First hand account of serving with the 6th Airborne Division in Palestine. Video Interview
Mandatory Palestine
Jewish insurgency in Mandatory Palestine
History of Zionism
Israel–United Kingdom relations
State of Palestine–United Kingdom relations
20th-century history of the British Army
Wars involving the United Kingdom
Airborne units and formations
|
```python
from ...backend import set_backend, get_backend
from ... import backend, base, cp_tensor, tucker_tensor, tt_tensor
from .backend import (
tensor,
is_tensor,
context,
shape,
ndim,
to_numpy,
copy,
concatenate,
reshape,
moveaxis,
transpose,
arange,
ones,
zeros,
zeros_like,
eye,
clip,
where,
max,
min,
all,
mean,
sum,
prod,
sign,
abs,
sqrt,
norm,
dot,
kron,
kr,
solve,
qr,
)
from .core import wrap
import sys
# from ...backend import _get_backend_method, _get_backend_dir
# from ...backend import backend
from ... import backend
static_items = list(sys.modules[__name__].__dict__.keys())
def __dir__():
return backend.get_backend_dir() + static_items
# return _get_backend_dir() + static_items
__getattr__ = backend.__getattribute__
# override_module_dispatch(__name__, backend_manager.__getattribute__, sparse_dir)
# override_module_dispatch(__name__, _get_backend_method, sparse_dir)
unfold = wrap(base.unfold)
fold = wrap(base.fold)
tensor_to_vec = wrap(base.tensor_to_vec)
vec_to_tensor = wrap(base.vec_to_tensor)
partial_unfold = wrap(base.partial_unfold)
partial_fold = wrap(base.partial_fold)
partial_tensor_to_vec = wrap(base.partial_tensor_to_vec)
partial_vec_to_tensor = wrap(base.partial_vec_to_tensor)
cp_to_tensor = wrap(cp_tensor.cp_to_tensor)
cp_to_unfolded = wrap(cp_tensor.cp_to_unfolded)
cp_to_vec = wrap(cp_tensor.cp_to_vec)
tucker_to_tensor = wrap(tucker_tensor.tucker_to_tensor)
tucker_to_unfolded = wrap(tucker_tensor.tucker_to_unfolded)
tucker_to_vec = wrap(tucker_tensor.tucker_to_vec)
tt_to_tensor = wrap(tt_tensor.tt_to_tensor)
tt_to_unfolded = wrap(tt_tensor.tt_to_unfolded)
tt_to_vec = wrap(tt_tensor.tt_to_vec)
```
|
```go
// Unless explicitly stated otherwise all files in this repository are licensed
// This product includes software developed at Datadog (path_to_url
package parameters
import (
"os"
"strings"
)
var _ valueStore = &envValueStore{}
type envValueStore struct {
prefix string
}
// NewEnvStore creates a new store based on environment variables
func NewEnvStore(prefix string) Store {
return newStore(newEnvValueStore(prefix))
}
func newEnvValueStore(prefix string) envValueStore {
return envValueStore{
prefix: prefix,
}
}
// Get returns parameter value.
// For env Store, the key is upper cased and added to prefix
func (s envValueStore) get(key StoreKey) (string, error) {
envValueStoreKey := strings.ToUpper(s.prefix + string(key))
val, found := os.LookupEnv(strings.ToUpper(envValueStoreKey))
if !found {
return "", ParameterNotFoundError{key: key}
}
return val, nil
}
```
|
```objective-c
/*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/**
* @file
* This file includes compile-time configurations for the Time Sync service.
*
*/
#ifndef CONFIG_TIME_SYNC_H_
#define CONFIG_TIME_SYNC_H_
/**
* @addtogroup config-time-sync
*
* @brief
* This module includes configuration variables for the Time Sync service.
*
* @{
*
*/
/**
* @def OPENTHREAD_CONFIG_TIME_SYNC_ENABLE
*
* Define as 1 to enable the time synchronization service feature.
*
*/
#ifndef OPENTHREAD_CONFIG_TIME_SYNC_ENABLE
#define OPENTHREAD_CONFIG_TIME_SYNC_ENABLE 0
#endif
/**
* @def OPENTHREAD_CONFIG_TIME_SYNC_REQUIRED
*
* Define as 1 to require time synchronization when attaching to a network. If the device is router capable
* and cannot find a neighboring router supporting time synchronization, the device will form a new partition.
* If the device is not router capable, the device will remain an orphan.
*
* Applicable only if time synchronization service feature is enabled (i.e., OPENTHREAD_CONFIG_TIME_SYNC_ENABLE is set)
*
*/
#ifndef OPENTHREAD_CONFIG_TIME_SYNC_REQUIRED
#define OPENTHREAD_CONFIG_TIME_SYNC_REQUIRED 0
#endif
/**
* @def OPENTHREAD_CONFIG_TIME_SYNC_PERIOD
*
* Specifies the default period of time synchronization, in seconds.
*
* Applicable only if time synchronization service feature is enabled (i.e., OPENTHREAD_CONFIG_TIME_SYNC_ENABLE is set).
*
*/
#ifndef OPENTHREAD_CONFIG_TIME_SYNC_PERIOD
#define OPENTHREAD_CONFIG_TIME_SYNC_PERIOD 30
#endif
/**
* @def OPENTHREAD_CONFIG_TIME_SYNC_XTAL_THRESHOLD
*
* Specifies the default XTAL threshold for a device to become Router in time synchronization enabled network, in PPM.
*
* Applicable only if time synchronization service feature is enabled (i.e., OPENTHREAD_CONFIG_TIME_SYNC_ENABLE is set)
*
*/
#ifndef OPENTHREAD_CONFIG_TIME_SYNC_XTAL_THRESHOLD
#define OPENTHREAD_CONFIG_TIME_SYNC_XTAL_THRESHOLD 300
#endif
/**
* @def OPENTHREAD_CONFIG_TIME_SYNC_JUMP_NOTIF_MIN_US
*
* This setting sets the minimum amount of time (in microseconds) that the network time must jump due to
* a time sync event for listeners to be notified of the new network time.
*
*/
#ifndef OPENTHREAD_CONFIG_TIME_SYNC_JUMP_NOTIF_MIN_US
#define OPENTHREAD_CONFIG_TIME_SYNC_JUMP_NOTIF_MIN_US 10000
#endif
/**
* @}
*
*/
#endif // CONFIG_TIME_SYNC_H_
```
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package jdk.graal.compiler.graphio;
final class DefaultGraphTypes implements GraphTypes {
static final GraphTypes DEFAULT = new DefaultGraphTypes();
private DefaultGraphTypes() {
}
@SuppressWarnings("unchecked")
@Override
public Class<?> enumClass(Object enumValue) {
if (enumValue instanceof Enum<?>) {
// check that the enum class is not actually an anonymous subclass:
Class<? extends Enum<?>> enumClass = (Class<? extends Enum<?>>) enumValue.getClass();
Enum<?>[] constants = enumClass.getEnumConstants();
if (constants == null && enumClass.isAnonymousClass()) {
enumClass = (Class<? extends Enum<?>>) enumClass.getSuperclass();
}
return enumClass;
}
return null;
}
@Override
public int enumOrdinal(Object obj) {
if (obj instanceof Enum<?>) {
return ((Enum<?>) obj).ordinal();
}
return -1;
}
@SuppressWarnings("unchecked")
@Override
public String[] enumTypeValues(Object clazz) {
if (clazz instanceof Class<?>) {
Class<? extends Enum<?>> enumClass = (Class<? extends Enum<?>>) clazz;
Enum<?>[] constants = enumClass.getEnumConstants();
if (constants != null) {
String[] names = new String[constants.length];
for (int i = 0; i < constants.length; i++) {
names[i] = constants[i].name();
}
return names;
}
}
return null;
}
@Override
public String typeName(Object clazz) {
if (clazz instanceof Class<?>) {
return ((Class<?>) clazz).getName();
}
return null;
}
}
```
|
Ramgarh Test Range is an out-door testing and evaluating facility of Terminal Ballistics Research Laboratory (TBRL).
It is spread over an area of 5500 acre of land and is located at village Ramgarh, District Panchkula, Haryana, 22 km away from Chandigarh.
Ramgarh Test Range is divided into a number of technical zones/trial areas. Each zone takes up specific types of firing trials.
Zones have been so designed and spaced as to allow the conduct of experimental trials independent of each other.
The facilities established at this range provide high-speed photography, flash radiography, blast and pressure parameters, lethality and fragmentation studies, impact phenomenon studies, etc.
The salient facilities at the Ramgarh test range include:
Rail Track Rocket Sled (3800 mtrs) .
Baffle Range for Small Arms.
Underwater Shock Pressure Tank.
See also
Pashan Test Range
Chitradurga Aeronautical Test Range
References
Ministry of Defence (India)
Defence Research and Development Organisation
Military installations of India
Panchkula district
Weapons test sites
|
```cython
# noinspection PyUnresolvedReferences
cimport numpy as np
import numpy as np
from cpython cimport array
import array
import cython
from cython.parallel import prange
from libc.stdlib cimport malloc, free
from libcpp.algorithm cimport sort
from libc.stdint cimport uint64_t
cpdef tuple k_means(float[:] data, unsigned int k=2):
cdef float[:] centers = np.empty(k, dtype=np.float32)
cdef list clusters = []
cdef set unique = set(data)
cdef unsigned long i
if len(unique) < k:
print("Warning: less different values than k")
k = len(unique)
for i in range(k):
centers[i] = unique.pop()
clusters.append([])
cdef float[:] old_centers = np.array(centers, dtype=np.float32)
cdef float distance, min_distance, error = 1.0
cdef unsigned int j, index = 0, N = len(data)
while error != 0:
for i in range(k):
clusters[i].clear()
for i in range(N):
min_distance = 999999999
for j in range(k):
distance = (centers[j] - data[i]) * (centers[j] - data[i])
if distance < min_distance:
min_distance = distance
index = j
clusters[index].append(data[i])
old_centers = np.array(centers)
for i in range(k):
centers[i] = np.mean(clusters[i])
error = 0.0
for i in range(k):
error += old_centers[i] * old_centers[i] - centers[i] * centers[i]
return centers, clusters
def segment_messages_from_magnitudes(cython.floating[:] magnitudes, float noise_threshold):
"""
Get the list of start, end indices of messages
:param magnitudes: Magnitudes of samples
:param q: Factor which controls how many samples of previous above noise plateau must be under noise to be counted as noise
:return:
"""
cdef list result = []
if len(magnitudes) == 0:
return []
cdef unsigned long i, N = len(magnitudes), start = 0
cdef unsigned long summed_message_samples = 0
# tolerance / robustness against outliers
cdef unsigned int outlier_tolerance = 10
cdef unsigned int conseq_above = 0, conseq_below = 0
# Three states: 1 = above noise, 0 = in noise, but not yet above k threshold (k * above_total), -1 = in noise
cdef int state
state = 1 if magnitudes[0] > noise_threshold else -1
cdef bint is_above_noise
for i in range(N):
is_above_noise = magnitudes[i] > noise_threshold
if state == 1:
if is_above_noise:
conseq_below = 0
else:
conseq_below += 1
elif state == -1:
if is_above_noise:
conseq_above += 1
else:
conseq_above = 0
# Perform state change if necessary
if state == 1 and conseq_below >= outlier_tolerance:
# 1 -> -1
state = -1
result.append((start, i - conseq_below))
summed_message_samples += (i-conseq_below) - start
conseq_below = conseq_above = 0
elif state == -1 and conseq_above >= outlier_tolerance:
# -1 -> 1
state = 1
start = i - conseq_above
conseq_below = conseq_above = 0
# append last message
if state == 1 and start < N - conseq_below:
result.append((start, N - conseq_below))
return result
cpdef uint64_t[:] get_threshold_divisor_histogram(uint64_t[:] plateau_lengths, float threshold=0.2):
"""
Get a histogram (i.e. count) how many times a value is a threshold divisor for other values in given data
Threshold divisible is defined as having a decimal place less than .2 (threshold)
:param plateau_lengths:
:return:
"""
cdef uint64_t i, j, x, y, minimum, maximum, num_lengths = len(plateau_lengths)
cdef np.ndarray[np.uint64_t, ndim=1] histogram = np.zeros(int(np.max(plateau_lengths)) + 1, dtype=np.uint64)
for i in range(0, num_lengths):
for j in range(i+1, num_lengths):
x = plateau_lengths[i]
y = plateau_lengths[j]
if x == 0 or y == 0:
continue
if x < y:
minimum = x
maximum = y
else:
minimum = y
maximum = x
if maximum / <double>minimum - (maximum / minimum) < threshold:
histogram[minimum] += 1
return histogram
cpdef np.ndarray[np.uint64_t, ndim=1] merge_plateaus(np.ndarray[np.uint64_t, ndim=1] plateaus,
uint64_t tolerance,
uint64_t max_count):
cdef uint64_t j, n, L = len(plateaus), current = 0, i = 1, tmp_sum
if L == 0:
return np.zeros(0, dtype=np.uint64)
cdef np.ndarray[np.uint64_t, ndim=1] result = np.empty(L, dtype=np.uint64)
if plateaus[0] <= tolerance:
result[0] = 0
else:
result[0] = plateaus[0]
while i < L and current < max_count:
if plateaus[i] <= tolerance:
# Look ahead to see whether we need to merge a larger window e.g. for 67, 1, 10, 1, 21
n = 2
while i + n < L and plateaus[i + n] <= tolerance:
n += 2
tmp_sum = 0
for j in range(i - 1, min(L, i + n)):
tmp_sum += plateaus[j]
result[current] = tmp_sum
i += n
else:
current += 1
result[current] = plateaus[i]
i += 1
return result[:current+1]
cpdef np.ndarray[np.uint64_t, ndim=1] get_plateau_lengths(float[:] rect_data, float center, int percentage=25):
if len(rect_data) == 0 or center is None:
return np.array([], dtype=np.uint64)
cdef int state, new_state
state = -1 if rect_data[0] <= center else 1
cdef unsigned long long plateau_length = 0
cdef unsigned long long current_sum = 0
cdef unsigned long long i = 0
cdef unsigned long long len_data = len(rect_data)
cdef float sample
cdef array.array result = array.array('Q', [])
for i in range(0, len_data):
if current_sum >= percentage * len_data / 100:
break
sample = rect_data[i]
new_state = -1 if sample <= center else 1
if state == new_state:
plateau_length += 1
else:
result.append(plateau_length)
current_sum += plateau_length
state = new_state
plateau_length = 1
return np.array(result, dtype=np.uint64)
cdef float median(double[:] data, unsigned long start, unsigned long data_len, unsigned int k=3) nogil:
cdef unsigned long i, j
if start + k > data_len:
k = data_len - start
cdef float* buffer = <float *>malloc(k * sizeof(float))
for i in range(0, k):
buffer[i] = data[start+i]
sort(&buffer[0], (&buffer[0]) + k)
try:
return buffer[k//2]
finally:
free(buffer)
cpdef np.ndarray[np.float32_t, ndim=1] median_filter(double[:] data, unsigned int k=3):
cdef long long start, end, i, n = len(data)
cdef np.ndarray[np.float32_t, ndim=1] result = np.zeros(n, dtype=np.float32)
for i in prange(0, n, nogil=True, schedule='static'):
if i < k // 2:
start = 0
else:
start = i - k // 2
result[i] = median(data, start=i, data_len=n, k=k)
return result
```
|
Hannington Mutebi is an Anglican bishop who serves in Uganda: since 2014 he has been Assistant Bishop of Kampala
He was appointed Chancellor of Ndejje University on December 17th 2021 at the 23rd Graduation Ceremony.
References
21st-century Anglican bishops in Uganda
Anglican bishops of Kampala
Uganda Christian University alumni
Year of birth missing (living people)
Living people
|
Bradley Green is a village in the Wychavon district of Worcestershire, England. It is located just south of the town of Redditch and south of Feckenham, Astwood Bank, Callow Hill and Inkberrow. It is also near the border with the Redditch district.
References
Villages in Worcestershire
Wychavon
|
Eleanor "Nora" Pairman, also known as Nora Brown, (8 June 1896 - 14 September 1973) was a Scottish mathematician and only the third woman to receive a doctorate in math from Radcliffe College in Massachusetts. Later in life she developed novel methods to teach mathematics to blind students.
Life and career
Pairman was born the youngest of four in Broomieknowe, Lasswade in Scotland to Helen and John Pairman who was solicitor of the Supreme Courts of Scotland. Her father died when she was very young.
She attended the Lasswade Higher Grade School (1903-1908) before going to George Watson's Ladies' College (1908-1914). After finishing her Scottish Leaving Certificate examinations in 1914, she started studying mathematics at the University of Edinburgh. She graduated with an MA in 1917 with first class honors in mathematics and natural philosophy, after which she was awarded a three-year Vans Dunlop scholarship, which permitted her to continue her studies at any university. She became a graduate student at the University of Edinburgh before moving to Karl Pearson's lab at University College London in 1918. Pairman read two papers at meetings of the Edinburgh Mathematical Society early in 1918.
One of her instructors, Cargill G. Knott, wrote a letter of recommendation saying: "With fitting opportunity she has every promise of a distinguished and useful career." Pairman arrived in New York on 12 October 1919 and went on to Cambridge, Massachusetts to study at Radcliffe College, an all-women's college closely associated with the all-male Harvard College. There she studied under George David Birkhoff. Her thesis was titled 'Expansion Theorems for Solution of a Fredholm's Linear Homogeneous Integral Equation of the Second Kind with Kernel of Special Non-Symmetric Type and was awarded a PhD in 1922. When she received her doctorate she was only the third woman to be awarded a PhD in mathematics from Radcliffe College. In that same year she married a fellow grad student, Bancroft Brown.
The couple moved to Hanover, N.H. in 1922 so Bancroft could assume a teaching position at Dartmouth College, which, at the time, was a men's school with an all-male faculty but occasionally admitting women as graduate students. Later, Pairman published a joint paper with Rudolph E. Langer in 1927.
Much later, Pairman taught math part-time at Dartmouth, from September 1955 until June 1959.
Teaching math in Braille
About 1950, Pairman started focusing on teaching mathematics to blind students, learning Braille and learning how to make diagrams using her sewing machine and other household items. Her daughter Margaret later wrote, “Geometry was a particular problem, because you really need diagrams. Braille is done on paper like thin cardstock. So she rounded up all kinds of household implements like pinking shears and pastry wheels and such and created diagrams that could be felt with the fingers, like the Braille symbols. Apparently nobody had ever done this before."
Pairman's son-in-law Thomas Streeter wrote about a visit to Hanover, when he was shown some of her work. “A graduate student at Harvard was blind and needed a particular book put into Braille, and it was full of mathematical symbols. What to do? The sewing machine, of course. She had written down the math and had it beside the machine. She put a piece of Braille paper under the foot and proceeded to reproduce the symbols by guiding the paper under the needle. It had to be the mirror image of what she had written."
In about 1959, the Hanover Gazette published an article about her saying that Pairman was in the process of transcribing two mathematical texts, one was for a freshman student at Boston College, and another, a reference book on group theory, destined for a post-graduate course at Columbia University in New York. The article went on to say that she was in regular discussions with Dartmouth math freshmen three hours each week and that apparently, by the end of the spring term, she had taken over the course instruction.
Pairman's daughter Margaret wrote later: “For all the satisfaction that she got from these [Braille] projects, the only time I saw her truly happy was when she was teaching. And she had precious little opportunity to do that, being obviously ahead of her time and also stuck in a males-only college community and in a world where it was well-nigh impossible for married ladies to function professionally.”
Personal life
On 10 August 1922, Pairman married Bancroft Huntington Brown (1894-1974) at Roselea, the Pairman home in Broomieknowe, Scotland and afterwards assumed the name Eleanor P. Brown, becoming widely known as Nora Brown'. Her husband was a Harvard graduate student who had also received his PhD in 1922. Together, they had four children, John Pairman (b. 1923), Barbara (1925-1979), Joanna (1935-1935), and Margaret Wylde (b. 1937). Her two surviving children (Joanna died as a baby) went on to earn doctorates of their own.
Pairman passed away after a long battle with breast cancer on 14 September 1973, at the age of 77, in White River Junction, Vermont. She was survived by her husband, two sisters, three children, seven grandchildren, and one great-granddaughter. Her husband passed away the following year.
Selected publications
Pairman authored or co-authored several peer-reviewed papers during her career, including:
References
1896 births
1973 deaths
Scottish mathematicians
Alumni of the University of Edinburgh
Radcliffe College alumni
Education for the blind
20th-century women mathematicians
|
Union Special (Union Special Machine Company) is an American industrial sewing machine company based in Huntley, Illinois, and is one of the oldest remaining sewing machine companies. The company opened its current factory, which was formerly a Borden milk factory, in 1948.
See also
List of sewing machine brands
References
External links
Official website
American brands
Sewing machine brands
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
package org.ballerinalang.test.types.any;
import org.ballerinalang.test.BCompileUtil;
import org.ballerinalang.test.BRunUtil;
import org.ballerinalang.test.CompileResult;
import org.testng.Assert;
import org.testng.annotations.Test;
/**
* Negative tests for 'any' type.
*/
public class BAnyTypeInvalidCastError {
@Test
public void testInvalidAnyCasting() {
CompileResult resultNegative = BCompileUtil.compile("test-src/types/any/any-type-cast-negative.bal");
Assert.assertEquals(resultNegative.getErrorCount(), 0);
Object returns = BRunUtil.invoke(resultNegative, "invalidCastingError", new Object[]{});
Assert.assertEquals(returns.toString(), "error(\"{ballerina}TypeCastError\",message=\"incompatible types: " +
"'string' cannot be cast to 'float'\")");
}
}
```
|
```dockerfile
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing,
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# specific language governing permissions and limitations
ARG base=amd64/ubuntu:20.04
FROM ${base}
SHELL ["/bin/bash", "-o", "pipefail", "-c"]
RUN echo "debconf debconf/frontend select Noninteractive" | \
debconf-set-selections
# Installs LLVM toolchain, for Gandiva and testing other compilers
#
# Note that this is installed before the base packages to improve iteration
# while debugging package list with docker build.
ARG clang_tools
ARG llvm
RUN latest_system_llvm=10 && \
if [ ${llvm} -gt ${latest_system_llvm} -o \
${clang_tools} -gt ${latest_system_llvm} ]; then \
apt-get update -y -q && \
apt-get install -y -q --no-install-recommends \
apt-transport-https \
ca-certificates \
gnupg \
lsb-release \
wget && \
wget -O - path_to_url | apt-key add - && \
code_name=$(lsb_release --codename --short) && \
if [ ${llvm} -gt 10 ]; then \
echo "deb path_to_url{code_name}/ llvm-toolchain-${code_name}-${llvm} main" > \
/etc/apt/sources.list.d/llvm.list; \
fi && \
if [ ${clang_tools} -ne ${llvm} -a \
${clang_tools} -gt ${latest_system_llvm} ]; then \
echo "deb path_to_url{code_name}/ llvm-toolchain-${code_name}-${clang_tools} main" > \
/etc/apt/sources.list.d/clang-tools.list; \
fi; \
fi && \
apt-get update -y -q && \
apt-get install -y -q --no-install-recommends \
clang-${clang_tools} \
clang-${llvm} \
clang-format-${clang_tools} \
clang-tidy-${clang_tools} \
llvm-${llvm}-dev && \
apt-get clean && \
rm -rf /var/lib/apt/lists*
# Installs C++ toolchain and dependencies
RUN apt-get update -y -q && \
apt-get install -y -q --no-install-recommends \
autoconf \
ca-certificates \
ccache \
cmake \
curl \
g++ \
gcc \
gdb \
git \
libbenchmark-dev \
libboost-filesystem-dev \
libboost-system-dev \
libbrotli-dev \
libbz2-dev \
libc-ares-dev \
libcurl4-openssl-dev \
libgflags-dev \
libgoogle-glog-dev \
libidn2-dev \
libkrb5-dev \
libldap-dev \
liblz4-dev \
libnghttp2-dev \
libprotobuf-dev \
libprotoc-dev \
libpsl-dev \
libradospp-dev \
libre2-dev \
librtmp-dev \
libsnappy-dev \
libssh-dev \
libssh2-1-dev \
libssl-dev \
libthrift-dev \
libutf8proc-dev \
libxml2-dev \
libzstd-dev \
lld \
make \
ninja-build \
nlohmann-json3-dev \
npm \
pkg-config \
protobuf-compiler \
python3-dev \
python3-pip \
python3-rados \
python3-venv \
rados-objclass-dev \
rapidjson-dev \
rsync \
tzdata \
wget && \
apt-get clean && \
rm -rf /var/lib/apt/lists*
COPY ci/scripts/install_minio.sh /arrow/ci/scripts/
RUN /arrow/ci/scripts/install_minio.sh latest /usr/local
COPY ci/scripts/install_gcs_testbench.sh /arrow/ci/scripts/
RUN /arrow/ci/scripts/install_gcs_testbench.sh default
COPY ci/scripts/install_azurite.sh /arrow/ci/scripts/
RUN /arrow/ci/scripts/install_azurite.sh
COPY ci/scripts/install_ceph.sh /arrow/ci/scripts/
RUN /arrow/ci/scripts/install_ceph.sh
COPY ci/scripts/install_sccache.sh /arrow/ci/scripts/
RUN /arrow/ci/scripts/install_sccache.sh unknown-linux-musl /usr/local/bin
# Prioritize system packages and local installation
# The following dependencies will be downloaded due to missing/invalid packages
# provided by the distribution:
# - Abseil is not packaged
# - libc-ares-dev does not install CMake config files
# - flatbuffer is not packaged
# - libgtest-dev only provide sources
# - libprotobuf-dev only provide sources
# ARROW-17051: this build uses static Protobuf, so we must also use
# static Arrow to run Flight/Flight SQL tests
ENV absl_SOURCE=BUNDLED \
ARROW_ACERO=ON \
ARROW_AZURE=OFF \
ARROW_BUILD_STATIC=ON \
ARROW_BUILD_TESTS=ON \
ARROW_DEPENDENCY_SOURCE=SYSTEM \
ARROW_DATASET=ON \
ARROW_FLIGHT=OFF \
ARROW_GANDIVA=ON \
ARROW_GCS=ON \
ARROW_HDFS=ON \
ARROW_HOME=/usr/local \
ARROW_INSTALL_NAME_RPATH=OFF \
ARROW_ORC=ON \
ARROW_PARQUET=ON \
ARROW_S3=ON \
ARROW_SUBSTRAIT=ON \
ARROW_USE_ASAN=OFF \
ARROW_USE_CCACHE=ON \
ARROW_USE_LLD=ON \
ARROW_USE_UBSAN=OFF \
ARROW_WITH_BROTLI=ON \
ARROW_WITH_BZ2=ON \
ARROW_WITH_LZ4=ON \
ARROW_WITH_OPENTELEMETRY=ON \
ARROW_WITH_SNAPPY=ON \
ARROW_WITH_ZLIB=ON \
ARROW_WITH_ZSTD=ON \
ASAN_SYMBOLIZER_PATH=/usr/lib/llvm-${llvm}/bin/llvm-symbolizer \
AWSSDK_SOURCE=BUNDLED \
Azure_SOURCE=BUNDLED \
google_cloud_cpp_storage_SOURCE=BUNDLED \
gRPC_SOURCE=BUNDLED \
GTest_SOURCE=BUNDLED \
ORC_SOURCE=BUNDLED \
PARQUET_BUILD_EXAMPLES=ON \
PARQUET_BUILD_EXECUTABLES=ON \
Protobuf_SOURCE=BUNDLED \
PATH=/usr/lib/ccache/:$PATH \
PYTHON=python3 \
xsimd_SOURCE=BUNDLED
```
|
```swift
/**
* Question Link: path_to_url
* Primary idea: Dynamic Programming, dp[i] = dp[i - 1] + dp[i - 2]
* Time Complexity: O(n), Space Complexity: O(1)
*
*/
class ClimbingStairs {
func climbStairs(_ n: Int) -> Int {
if n < 0 {
return 0
}
if n == 0 || n == 1 {
return 1
}
var prev = 0, post = 1, total = 0
for i in 1...n {
total = prev + post
prev = post
post = total
}
return total
}
}
```
|
Tivat Airport () is an international airport serving the Montenegrin coastal town of Tivat and the surrounding region.
The airport is situated south of the centre of Tivat, with the runway aligned with the Tivat Field ().
It is the busier of two international airports in Montenegro, the other being Podgorica Airport. Traffic at the airport follows the highly seasonal nature of the tourism industry in coastal Montenegro, with 80% of the total volume of passengers being handled during the peak season (May–September).
Overview
Tivat airport is located right next to the city of Tivat, from the center of Kotor, and north-west of Budva, one of the most popular tourist destinations on the eastern Adriatic coast. The sole runway of the airport ends just from the coastline of the Bay of Kotor.
Tivat Airport is assigned 4D classification by ICAO, airspace class D, and is noted for its challenging approach and landing procedures. Landing at Tivat is considered demanding due to the hilly terrain surrounding the valley in which the airport is situated, and strong prevailing crosswinds. Runway 32 approach requires a descent into the valley of Tivatsko polje, and a 20° turn for runway alignment just before landing. Runway 14 approach is even more challenging, because of the circle-to-land maneuver executed in the dramatic scenery surrounding the Bay of Kotor. It is known among pilots as the European Kai Tak because of its tricky approach and landing procedures, and also can be compared to Madeira Airport. Passengers landing at Tivat have views of the bay, the surrounding mountains and a low flyby over Porto Montenegro luxury yacht marina. The airport is commonly visited by plane spotters, as the end of the runway is easily accessible and offers unobstructed views of takeoffs and landings, with a mountain backdrop.
Year-round services from the airport include Belgrade and Moscow; however, more than 80% of the traffic is concentrated in the summer period, with the introduction of seasonal and charter flights. With the opening of Porto Montenegro and the introduction of other high-end tourist services, the airport increasingly caters to business jets.
Adriatic Highway (E65/E80) passes right by the passenger terminal, making the airport easily accessible from the entire northern part of the Montenegrin coast.
History
The airport in Tivat was opened on 30 May 1957, as a small airport with a single grass runway (1200 m × 80 m) a small apron (30 m × 30 m) and a terminal building complete with control tower. From 1957 to 1968, activity at the airport consisted mostly of domestic passenger traffic to Belgrade, Zagreb and Skopje, with JAT Douglas DC-3 and Ilyushin Il-14 aircraft.
From 1968 to 1971, the airport underwent expansion and modernization. It was reopened on 25 September 1971 with an asphalt runway (2500 m × 45 m), larger apron (450 m × 70 m), extended taxiways, and a completely new passenger terminal and control tower. After the 1979 earthquake, the airport was once again refurbished. Notably, the apron was expanded (460 m × 91.5 m) and taxiways widened, so the airport could handle wide-body aircraft.
On 23 April 2003, the ownership of the airport was transferred from Jat Airways to "Airports of Montenegro" public company, owned by the government of Montenegro. Since then, the airport was once again modernized and refurbished, with a reconstructed passenger terminal opening on 3 June 2006. In October 2007, South Korea made a government donation valued at $1 million for a new airport equipment ranging from cargo loaders to a flight information display system. Further reforms came in 2008 when several old types of passenger aircraft such as the Ilyushin Il-86 were permanently banned from flying to Tivat and subsequently redirected to Podgorica Airport due to noise abatement.
However, as passenger traffic in the mid-2010s approached the one-million mark, and strong growth continues, the passenger terminal was a bottleneck in peak summer months. Thus, a new passenger terminal was planned at Tivat Airport, along with a further expansion of airport facilities.
In December 2018, PM Duško Marković opened the newly built Terminal 2 at Tivat Airport – the first investment since 2006, when the existing airport building was built. Marković used this opportunity to point out that he sees the cooperation between the Government and the Management of Airports as an example to be followed by others in Montenegro.
Airlines and destinations
Below is a list of scheduled services throughout all seasons from Tivat Airport according to the Montenegrin Airports Authority:
Statistics
Busiest routes
See also
Aeronautical Information Publication
References
External links
Airports in Montenegro
Airports established in 1971
Tivat
1971 establishments in Yugoslavia
|
A number of related games under the Yahtzee brand have been produced. They all commonly use dice as the primary tool for game play, but all differ generally. As Yahtzee itself has been sold since 1954, the variants released over the years are more recent in comparison, with the oldest one, Triple Yahtzee, developed in 1972, eighteen years after the introduction of the parent game.
This article outlines each of Yahtzee's known variants, as well as brief descriptions of how they are played. Except for the last variant, all are ordered according to when each variant first appeared under the Yahtzee name. Some of these variants may currently be out of production as they have used older logos.
The parent game is sometimes referred to in this article as "standard Yahtzee" to differentiate it from the variant games that almost use the same mechanics and rules.
Triple Yahtzee
Triple Yahtzee, produced since 1972, is basically like playing three games of standard Yahtzee at the same time. Players score each of the thirteen Yahtzee categories three times, one for each of the scoresheet's columns marked "One," "Two," and "Three." However, players have the discretion of not only choosing the category at which to classify the current combination but also choosing which column the score would go. Combinations don't even have to appear three times in succession.
All scores entered in the three columns are entered as is. However, when the total scores for all three columns are obtained, the scores in the second and third columns are doubled and tripled respectively, and then added to the subtotal in the first column to form the grand total for the entire game.
Like in standard Yahtzee, there are differently colored chips for Bonus Yahtzees. They are awarded when all three Yahtzee boxes have scores in them and have been used either in the Upper and Lower Sections. The color of the chip, which may be colored white, blue, or red, depends on which column the Yahtzee has entered. These chips are worth 100, 200, and 300 points respectively. Since rolling Yahtzees are rare and rolling a fourth one is even rarer, bonuses are not indicated in the scoresheets and are only added to the grand total at the end of the game.
Because of the scoring process, it is possible to score 2,250 points in a single game, which is the maximum 375 points in each of the three columns and excluding Yahtzee bonuses, which are added at the end.
Triple Yahtzee is no longer sold as a game set. However, score cards for the game are still being sold (using the current logo) for owners of standard Yahtzee sets. The game is also included in GameHouse's Yahtzee game for Windows.
Challenge Yahtzee
Selling since 1974, Challenge Yahtzee was marketed as a "fast paced" variant of the parent game. It is played like the parent game, but its difference lies on the fact the players make decisions on the common rolls at the same time.
A total of 25 dice are used in this game. Five larger common dice are used only in the first roll to be used by all players. The smaller dice (called "markers" in this game) are to be used by the individual players to denote the dice one would keep for the subsequent rolls. These smaller dice are held in individual slots on the tray provided. Players have their own discretions on which of their own individual dice should be kept. The second step involves the common roll for the least amount of empty slots for each player. The result of each common roll should be duplicated by all players, depending on the empty cells each player has. The second step ends when all players have their slots filled. The third step is the same as the second, but the arrangement of the dice for each player will be the final one.
Scoring in this game is the same as in standard Yahtzee.
Word Yahtzee
In Word Yahtzee, which was produced in 1978 and developed from the game Scribbage, players roll seven dice and within one minute (hence the hourglass provided in each Word Yahtzee set) must form words which correspond to points. Each side of every die is printed like a Scrabble tile with a letter and small subscripted number on the lower right corner. One side of one die is marked with a diamond, which acts like the blank tile in Scrabble (can represent any letter, but will have no value).
The corresponding scoresheet, like the parent game, has an Upper and Lower Section. In the Upper Section, points are scored and marked for two- to six-letter words, with each word determined by the point values of its letters. The player is awarded 35 points if the total score in the Upper Section is at least 45. In the Lower Section are seven scoring categories: One Word, Two Words (at the same turn), Three Words (at the same turn), All Consonants, All Vowels (the consonant Y is considered a vowel in this game), Yahtzee Word (a seven-letter-word), and Chance.
Of course, a word has to be a valid Scrabble word before it is scored, except in the All Consonants, All Vowels and Chance categories, although the pronoun "I" and the indefinite article "a" are also considered words.
Jackpot Yahtzee
Jackpot Yahtzee, which started marketing in 1980, uses dice bearing symbols usually found in slot machines and makes use of 16-space triangular racks which are utilized much the same as the rack used in Connect Four. The aim of the game is to get the best accumulative score at the end of three rounds of play.
Four dice are rolled, having symbols which appear a certain number of sides in each die depending on their worth. Those symbols are: dollar signs, bells, oranges, and cherries. When at least two of a symbol appear on the four dice, a tile matching the symbol and inserted into the rack. Points are scored when tiles are lined horizontally or diagonally (never vertically).
Casino Yahtzee
Casino Yahtzee, which made an appearance in 1986, is said to combine the suspense of a gambling game with Yahtzee strategy, as well as keeping track of the movements of one's opponents.
Each player uses a 51-space game board. Thirty of these spaces represent the faces of the five dice used in the game: a blue die numbered 1-6, an orange one 2-7, a magenta one 3-8, a green one 4-9, and a red one 5-10. These are the player's personal places. The remaining twelve spaces are score spaces. When a player obtains a score space, he/she gains its value and its ownership by covering this score with a white chip and the others doing the same on their boards so no other player can get the same score space. A scorekeeper keeps track of the players' scores.
A player's turn consists of rolling the dice to obtain five numbers. This is done by either rolling all five dice at once or rolling at least one die several times to meet the required five numbers. Then the player covers those numbers and the colors obtained using black chips. If a number is already covered, it still counts one of the five numbers.
Points are scored by "closing a row," i.e. covering all numbers of a single color, covering a sequence of numbers or all numbers that repeat. A string corresponds to a score space, and therefore points for that player. All of a player's actions must be announced to both the scorekeeper and all other players; failure to do so might result in a player closing the same row and score those points. As mentioned earlier, only one player can use a score space.
A player can also go for a bonus by attempting to roll the five dice and show different numbers. If the roll turns up sequential numbers, a Rainbow bonus is scored, doubling the total bonus points.
The game ends when all rows are closed and scored. The scorekeeper totals all the points obtained by each player. The player with the highest score wins the game.
Showdown Yahtzee
Showdown Yahtzee, which appeared in 1991, is a board game which makes use of the concepts and scoring categories in Yahtzee. Its gameplay is divided into two parts: Placement Mode and Showdown Mode. Six dice are used in the game, five to form the combinations (the combination dice) and a differently-colored one to move a player's piece around the board (the movement die).
In Placement Mode, players take turns moving their pieces around a sixteen-space game board clockwise. The object of this mode is to place twelve cards, one for the lower twelve of the thirteen combinations in standard Yahtzee. The Yahtzee combination is not among them, but such a combination has a special purpose to be explained later.
When a player lands on a blank space, that player would roll the combination dice to establish a certain combination for that space. Once such a combination is established, a card corresponding to that combination is placed on the space and an appropriate number of chips is stacked on the card. Each chip is worth ten points. The chips also signify a player's control on that combination.
When a player lands on a covered space with an established combination, the player's reaction depends on whose chips are on that space. If the chips are the player's own, one can reroll the movement die and go further or try to increase the chips on that space by beating the previous roll. If the chips are of an opponent's, one can "steal" the card by equalling or bettering the number of chips already on that card. If successful, the chips are returned to the previous owner and the current player places his/her own chips on the card. A player's turn ends when the player succeeds or fails in increasing his score on his own card or in stealing another player's card.
When a player's piece lands on a corner space called a Wild Space, that player can choose to place a desired unestablished card on any empty space or steal any established card from an opponent. If successful, the player can move to the nearest empty space and place the won card there or move to the space to be stolen depending on the objective. The Wild Space's power also applies when a player rolls a Yahtzee; this will not affect the current space where the player's piece is placed unless the player decides to use that space.
When all twelve combination cards are in place at the board, the game shifts to Showdown Mode where players can now steal cards from each other. Rules for moving the pieces, increasing a score in one's own card, and stealing an opponent's card apply in this mode. A player's turn continues until he/she fails to steal a card.
The game ends when all players have taken one turn in Showdown Mode. The player with the most chips on the board is declared the winner.
Yahtzee Texas Hold'em
Yahtzee Texas Hold 'em, marketed in 2005, combines the concepts of the parent game and the poker variant Texas hold 'em. In this game, twenty dice are used, one set of five for each of the colors red, yellow, black, and white.
Players each pick two dice from a bag and rolls them under one's personal cup. These would be the player's personal dice. Then five "community" dice are chosen, then rolled much like same way as the cards in Texas Hold 'em poker. Players try to make the best five-dice "hand" out of the seven community and personal dice.
Combinations used in this game, ordered here from weakest to strongest, are: Two Pair, Three-of-a-Kind, Full House, Straight (five-dice sequence), Four-of-a-Kind, Flush, regular Yahtzee (a Yahtzee of differently colored dice), Straight Flush, and Yahtzee Flush (a Yahtzee of the same color).
Last Chance/Yahtzee Deluxe Poker
The game Last Chance, which started marketing in 1994, is a combination of contract bidding and Yahtzee with side betting. It was renamed Yahtzee Deluxe Poker in 2005; although the values are 30% higher and some components have a redesign, the mechanics of the game remain the same. Described below is some of the mechanics as described in Yahtzee Deluxe Poker.
There are 36 cards used in the game, each bearing a combination, the number of rolls in which the combination should be achieved, and the value of the card. Seven of these cards are placed in the tray provided and are used in the game.
A card on the tray is turned face up. Players bid for the right to roll the dice. The highest bidder would be win that right. Afterwards, the other players bet on whether the player who is rolling would achieve the combination in the rolls indicated or not. If the player who rolls achieves the combination within the number of rolls stated by the card, that player wins the value of the card, the card itself, and all bets against him. Otherwise, the rolling player loses his/her bid to the bank; the card and the dice that match it stay and the process (i.e. the right to roll for the remaining dice and all subsequent betting) is repeated until the combination on the card is achieved by any player. A new card, and therefore a new combination, then comes into play.
Certain cards have Joker spaces (denoted by the letter J) which can stand for any number. If there is more than one Joker in the card, the player must decide which value each Joker must represent.
A player can also go for the "All In" option, especially if that player is almost out of chips and/or has not won a card. This option effectively enables the player to bet all of his/her remaining chips and become the rolling player. Certain elimination from the game awaits the rolling player should that player lose. The "All In" option can only be used once, so a player must decide when it is best to use it. In Last Chance, this option is called "Last Chance" because the player who uses it would have one last chance to stay in the game, hence the original name.
A player must win at least one card in order to win the entire game. The player who has the most chips after the seven chosen cards are played and won is declared the winner.
Yahtzee Turbo
Yahtzee Turbo, released in 2006, is another fast-paced variant which makes use of 48 assorted cards, multi-colored dice, and a large die-shaped unit, called the Big Die, which acts as a timer and game host.
The 48 assorted cards indicate six types of Yahtzee hands: Three-of-a-Kind, Four-of-a-Kind, Large Straight, Small Straight, Full House, and Chance. Each player has five of these cards. The Big Die is pressed to start the timer and one player tries to roll the dice in the combination on the top card as many times as one can before the time expires. If that objective is achieved, the Big Die is again pressed to stop the timer. After the Big Die gives a congratulatory message, it then tells the player what to do next with the card. If the time expires before the objective combination is met, the Big Die simply tells the player what to do next. That player's turn ends after one performs the Big Die's instructions.
At times, the Big Die requires a player to obtain a Yahtzee within the traditional three rolls. It also adjusts its timer based on how well players do in the game.
The player who discards all of his/her cards is declared the winner.
Power Yahtzee
In 2007, Winning Moves Games developed Power Yahtzee. It includes a sixth multiplier die called a "Power die" and an expanded scoresheet.
Yahtzee Free for All
Yahtzee Free for All, designed by Richard Borg in 2008, is a variant that uses a free-for-all format for two to six players. The components come in a hexagonal box made to look like a 3D image of a die. The inner box stores the components, while the outer box, when unfolded, doubles as the playing mat. The components compose of 30 dice (a set of five for each player), a set of chips and 36 combination cards bearing the 13 Yahtzee categories with different point values.
On the onset, the combination cards (Yahtzee cards separated beforehand) are shuffled and three are laid out on the playing mat. One player aims to form one the combinations using one's set of dice in three rolls. When successful, the player takes the card and places on his part of the field, ending one's turn. A player can steal another's card by forming a higher combination than the original one that player had formed (e.g. 2-3-4-5-6 is already enough to steal the Large Straight card from someone with the 1-2-3-4-5 combination). A card held on one player's side of the mat is open for stealing until play passes back to the holder of the card, at which point, that player "banks" or keeps that card from the mat, guaranteeing points and preparing to get another combination or steal another player's card.
At any time, a Yahtzee is rolled, a Yahtzee card, worth 10 points, is awarded to the player who rolls it and is added to their total.
Chips, worth a point each, are also present in the game for increased play. A chip is laid on the center area of the mat at the front of each of the three cards there. This happens when a player "busts" (unable to make one of the combinations on the mat), steals a card, or rolls a Yahtzee. Chips are won by a player when one of the anteed combinations in the center is achieved.
Play ends when either the cards at the center or the chips are exhausted. The player with the most points, which is determined by the number of the chips and combination cards a player has won, wins the game.
Yahtzee Jr.
Yahtzee Jr. is a simplified variant meant to be played by younger children ages four and above. There are many Yahtzee Jr. products, all typically tied into several children's titles or cartoon characters, like Mickey Mouse and Pokémon. The different variants are all decorative, as they all use the same mechanics.
At the onset, players use the five tokens of the same color. Each token represents a character of each of the five dice. Points are scored by moving a token over a common scoreboard covering a column corresponding to the number of times that character appears on the dice. Only one token can occupy a scoreboard space at a time, and a different character must be scored on each turn. Also, once a token is placed on the scoreboard, it cannot be moved. The score of zero for a character is denoted by placing that character's token over its picture in the unmarked column.
Each die also includes a sixth character that acts as a wild card. If such a character appears, it can represent any of the five objective characters.
The game ends when all turns are taken and scored. Points are totaled by adding the numbers of the columns where the character tokens are placed. The player with the highest total wins. In case of a tie, the winner is determined by rolling the highest number of wild card characters.
Yahtzee Extreme
Yahtzee Extreme is a variation on the traditional game with new scoring options and themed games such as baseball, hockey, and Olympics. Some games use an additional die which allows for new scoring options such as 'Super Large', 'Super Yahtzee', 'Double Triple', and 'Triple Double'. Team-play and bonus rolls are also available. Yahtzee Extreme is available as a collection of score sheets. with all the new options and rules included.
See also
Kismet, a dice game similar to Yahtzee played with dice with 3 pip colors, utilizing a wider range of poker style combinations
Yacht (dice game) The game upon which Yahtzee is based
References
External links
Hasbro's Game and Toy Instructions, which includes rules and instruction for many Yahtzee variants.
Sequence dice games
Game variants
|
```java
/*
* :path_to_url
* QQ: 4006852216
* :ShareSDK 24
*
*/
package cn.sharesdk.onekeyshare.themes.classic;
import android.content.Context;
import android.graphics.Canvas;
import android.graphics.Paint;
import android.view.View;
/** */
public class IndicatorView extends View {
private static final int DESIGN_INDICATOR_RADIUS = 6;
private static final int DESIGN_INDICATOR_DISTANCE = 14;
private static final int DESIGN_BOTTOM_HEIGHT = 52;
/** */
private int count;
/** */
private int current;
public IndicatorView(Context context) {
super(context);
}
public void setScreenCount(int count) {
this.count = count;
}
public void onScreenChange(int currentScreen, int lastScreen) {
if (currentScreen != current) {
current = currentScreen;
postInvalidate();
}
}
protected void onDraw(Canvas canvas) {
if (count <= 1) {
this.setVisibility(View.GONE);
return;
}
float height = getHeight();
float radius = height * DESIGN_INDICATOR_RADIUS / DESIGN_BOTTOM_HEIGHT;
float distance = height * DESIGN_INDICATOR_DISTANCE / DESIGN_BOTTOM_HEIGHT;
float windowWidth = radius * 2 * count + distance * (count - 1);
float left = (getWidth() - windowWidth) / 2;
float cy = height / 2;
canvas.drawColor(0xffffffff);
Paint paint = new Paint();
paint.setAntiAlias(true);
for (int i = 0; i < count; i++) {
if (i == current) {
paint.setColor(0xff5d71a0);
} else {
paint.setColor(0xffafb1b7);
}
float cx = left + (radius * 2 + distance) * i;
canvas.drawCircle(cx, cy, radius, paint);
}
}
}
```
|
```php
<?php
declare(strict_types=1);
namespace Brick\Math;
/**
* Specifies a rounding behavior for numerical operations capable of discarding precision.
*
* Each rounding mode indicates how the least significant returned digit of a rounded result
* is to be calculated. If fewer digits are returned than the digits needed to represent the
* exact numerical result, the discarded digits will be referred to as the discarded fraction
* regardless the digits' contribution to the value of the number. In other words, considered
* as a numerical value, the discarded fraction could have an absolute value greater than one.
*/
final class RoundingMode
{
/**
* Private constructor. This class is not instantiable.
*
* @codeCoverageIgnore
*/
private function __construct()
{
}
/**
* Asserts that the requested operation has an exact result, hence no rounding is necessary.
*
* If this rounding mode is specified on an operation that yields a result that
* cannot be represented at the requested scale, a RoundingNecessaryException is thrown.
*/
public const UNNECESSARY = 0;
/**
* Rounds away from zero.
*
* Always increments the digit prior to a nonzero discarded fraction.
* Note that this rounding mode never decreases the magnitude of the calculated value.
*/
public const UP = 1;
/**
* Rounds towards zero.
*
* Never increments the digit prior to a discarded fraction (i.e., truncates).
* Note that this rounding mode never increases the magnitude of the calculated value.
*/
public const DOWN = 2;
/**
* Rounds towards positive infinity.
*
* If the result is positive, behaves as for UP; if negative, behaves as for DOWN.
* Note that this rounding mode never decreases the calculated value.
*/
public const CEILING = 3;
/**
* Rounds towards negative infinity.
*
* If the result is positive, behave as for DOWN; if negative, behave as for UP.
* Note that this rounding mode never increases the calculated value.
*/
public const FLOOR = 4;
/**
* Rounds towards "nearest neighbor" unless both neighbors are equidistant, in which case round up.
*
* Behaves as for UP if the discarded fraction is >= 0.5; otherwise, behaves as for DOWN.
* Note that this is the rounding mode commonly taught at school.
*/
public const HALF_UP = 5;
/**
* Rounds towards "nearest neighbor" unless both neighbors are equidistant, in which case round down.
*
* Behaves as for UP if the discarded fraction is > 0.5; otherwise, behaves as for DOWN.
*/
public const HALF_DOWN = 6;
/**
* Rounds towards "nearest neighbor" unless both neighbors are equidistant, in which case round towards positive infinity.
*
* If the result is positive, behaves as for HALF_UP; if negative, behaves as for HALF_DOWN.
*/
public const HALF_CEILING = 7;
/**
* Rounds towards "nearest neighbor" unless both neighbors are equidistant, in which case round towards negative infinity.
*
* If the result is positive, behaves as for HALF_DOWN; if negative, behaves as for HALF_UP.
*/
public const HALF_FLOOR = 8;
/**
* Rounds towards the "nearest neighbor" unless both neighbors are equidistant, in which case rounds towards the even neighbor.
*
* Behaves as for HALF_UP if the digit to the left of the discarded fraction is odd;
* behaves as for HALF_DOWN if it's even.
*
* Note that this is the rounding mode that statistically minimizes
* cumulative error when applied repeatedly over a sequence of calculations.
* It is sometimes known as "Banker's rounding", and is chiefly used in the USA.
*/
public const HALF_EVEN = 9;
}
```
|
```makefile
################################################################################
#
# psmisc
#
################################################################################
PSMISC_VERSION = 23.5
PSMISC_SITE = path_to_url
PSMISC_SOURCE = psmisc-$(PSMISC_VERSION).tar.xz
PSMISC_LICENSE = GPL-2.0+
PSMISC_LICENSE_FILES = COPYING
PSMISC_DEPENDENCIES = ncurses $(TARGET_NLS_DEPENDENCIES)
ifeq ($(BR2_TOOLCHAIN_HAS_SSP),)
# Don't force -fstack-protector when SSP is not available in toolchain
PSMISC_CONF_OPTS += --disable-harden-flags
endif
$(eval $(autotools-package))
```
|
Gaydon is a chanson de geste written in about 1230 AD. It recounts the story of Thierry, friend of Charlemagne in the Chanson de Roland, for whom "Gaydon" is another name. The text was first published in Paris in 1862 by on the basis of three manuscripts in the Bibliothèque nationale de France (at that time called the Bibliothèque impériale); of these, two date from the thirteenth century, and the third from the fifteenth.
References
Further reading
Wilhelm Reimann (1881). Die Chanson de Gaydon, ihre Quellen und die angevinische Thierry-Gaydon-Sage (in German). In: H. Perschmann, W. Reimann, A. Rhode (1881). Beiträge zur Kritik der französischen Karlsepen, volume III of Ausgaben und Abhandlungen aus dem Gebiete der romanischen Philologie. Marburg: N. G. Elwert'sche Verlagsbuchhandlung, pages 49–121.
William Calin (1966). The Epic Quest: Studies in Four Old French Chansons de Geste. Baltimore, Maryland: The Johns Hopkins Press.
Jean Subrenat (1974). Etude sur "Gaydon", chanson de geste du XIIIe siècle (in French). Aix-en-Provence: Editions de l'Université de Provence; Paris: Ophrys.
13th-century poems
Chansons de geste
French poems
|
```scala
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package tech.mlsql.log
import java.io.InputStream
import tech.mlsql.arrow.api.RedirectStreams
/**
* 2019-08-21 WilliamZhu(allwefantasy@gmail.com)
*/
class RedirectStreamsToSocketServer extends RedirectStreams {
var _conf: Map[String, String] = null
override def setConf(conf: Map[String, String]): Unit = _conf = conf
override def conf: Map[String, String] = _conf
override def stdOut(stdOut: InputStream): Unit = {
new RedirectLogThread(stdOut, conf, "stdout reader for logger server").start()
}
override def stdErr(stdErr: InputStream): Unit = {
new RedirectLogThread(stdErr, conf, "stderr reader for logger server").start()
}
}
class RedirectLogThread(
in: InputStream,
conf: Map[String, String],
name: String)
extends Thread(name) {
setDaemon(true)
override def run(): Unit = {
val pythonOutputEncoding = conf.getOrElse("pythonOutputEncoding","utf-8")
WriteLog.write(scala.io.Source.fromInputStream(in,pythonOutputEncoding).getLines(), conf)
}
}
object WriteLog extends BaseHttpLogClient
```
|
Dikoleps umbilicostriata is a minute species of sea snail, a marine gastropod mollusk in the family Skeneidae.
Description
The height of the shell attains 0.9 mm.
Distribution
This species occurs in the Alboran Sea and in the Western Mediterranean Sea.
References
Gaglini A., 1987: Spigolature monterosatiane; Notiziario del C.I.S.MA. 9 (10): 3–15
Gofas, S.; Le Renard, J.; Bouchet, P. (2001). Mollusca, in: Costello, M.J. et al. (Ed.) (2001). European register of marine species: a check-list of the marine species in Europe and a bibliography of guides to their identification. Collection Patrimoines Naturels, 50: pp. 180–213
External links
umbilicostriata
Gastropods described in 1987
|
```javascript
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
define('@weex-component/foo', function (require, exports, module) {
new Promise(function (fulfill, reject){
fulfill(1)
})
Promise.all([Promise.resolve(1)])
;
module.exports = {
data: function () {
return {
x: 1
}
}
}
;module.exports.style = {
"a": {
"fontSize": 12
}
}
;module.exports.template = {
"type": "container"
}
;})
bootstrap('@weex-component/foo')
```
|
```objective-c
//
// MPThreadViewController.h
// MobileProject
//
// Created by wujunyang on 2017/2/16.
//
#import <UIKit/UIKit.h>
#import "BaseViewController.h"
@interface MPThreadViewController : BaseViewController
@end
```
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<xliff xmlns="urn:oasis:names:tc:xliff:document:1.2" xmlns:xsi="path_to_url" version="1.2" xsi:schemaLocation="urn:oasis:names:tc:xliff:document:1.2 xliff-core-1.2-transitional.xsd">
<file datatype="xml" source-language="en" target-language="tr" original="../LocalizableStrings.resx">
<body>
<trans-unit id="CommandDescription">
<source>List tools installed globally or locally.</source>
<target state="translated">Genel veya yerel olarak ykl aralar listeleyin.</target>
<note />
</trans-unit>
<trans-unit id="GlobalOptionDescription">
<source>List tools installed for the current user.</source>
<target state="translated">Geerli kullanc iin yklenmi aralar listeleyin.</target>
<note />
</trans-unit>
<trans-unit id="ListToolCommandInvalidGlobalAndLocalAndToolPath">
<source>The local option(--local), the global option (--global), the tool path option (--tool-path), can only have one at a time. Specify only one of the options: {0}.</source>
<target state="translated">Yerel seenei (--local), genel seenei (--global), ara yolu seenei (--tool-path) arasndan yalnzca biri seilebilir. Seeneklerden yalnzca birini belirtin: {0}.</target>
<note />
</trans-unit>
<trans-unit id="LocalOptionDescription">
<source>List the tools installed in the local tool manifest.</source>
<target state="translated">Yerel ara bildiriminde ykl aralar listeleyin.</target>
<note />
</trans-unit>
<trans-unit id="ManifestFileColumn">
<source>Manifest</source>
<target state="translated">Bildirim</target>
<note />
</trans-unit>
<trans-unit id="PackageIdArgumentDescription">
<source>The NuGet Package Id of the tool to list</source>
<target state="translated">Listelenen aracn NuGet Paket Kimlii</target>
<note />
</trans-unit>
<trans-unit id="PackageIdArgumentName">
<source>PACKAGE_ID</source>
<target state="translated">PACKAGE_ID</target>
<note />
</trans-unit>
<trans-unit id="VersionColumn">
<source>Version</source>
<target state="translated">Srm</target>
<note />
</trans-unit>
<trans-unit id="CommandsColumn">
<source>Commands</source>
<target state="translated">Komutlar</target>
<note />
</trans-unit>
<trans-unit id="PackageIdColumn">
<source>Package Id</source>
<target state="translated">Paket Kimlii</target>
<note />
</trans-unit>
<trans-unit id="InvalidPackageWarning">
<source>Warning: tool package '{0}' is invalid, contact tool author:
{1}</source>
<target state="translated">Uyar: '{0}' ara paketi geersiz, ara yazarna bavurun:
{1}</target>
<note />
</trans-unit>
<trans-unit id="InvalidToolPathOption">
<source>Tool path '{0}' does not exist.</source>
<target state="translated">'{0}' ara yolu yok.</target>
<note />
</trans-unit>
<trans-unit id="ToolPathOptionName">
<source>PATH</source>
<target state="translated">PATH</target>
<note />
</trans-unit>
<trans-unit id="ToolPathOptionDescription">
<source>The directory containing the tools to list.</source>
<target state="translated">Listelenecek arac ieren dizin.</target>
<note />
</trans-unit>
<trans-unit id="ToolListFormatOptionDescription">
<source>The output format for the list of tools.</source>
<target state="new">The output format for the list of tools.</target>
<note />
</trans-unit>
</body>
</file>
</xliff>
```
|
Jan Šeda (born April 11, 1985) is a Czech former professional ice hockey player who last played for Naprzod Janow in the Polska Hokej Liga. He previously played with HC Pardubice in the Czech Extraliga during the 2010–11 Czech Extraliga season.
Career statistics
References
External links
1985 births
Living people
Czech ice hockey centres
HC Chrudim players
HC Dynamo Pardubice players
Naprzód Janów players
Orli Znojmo players
Ice hockey people from Pardubice
Stadion Hradec Králové players
Czech expatriate ice hockey people
Czech expatriate sportspeople in Poland
Expatriate ice hockey players in Poland
|
Vicente Tirona Paterno (November 18, 1925 – November 21, 2014) was a Filipino businessman and politician. He served as Minister of Industry from 1974 to 1979 and of Minister of Public Highways from 1979 to 1980, during the Ferdinand Marcos' government. He also served as a member of the Interim Batasang Pambansa from 1978 to 1984 and later as Senator from 1987 to 1992.
Early life
Vicente Tirona Paterno was born in Quiapo, Manila on November 18, 1925, to Jose P. Paterno and Jacoba Encarnacion Tirona.
Education
He is a graduate of De La Salle high school class 41 and later on earned his Bachelor of Science in Mechanical Engineering at the University of the Philippines Diliman in 1948 and obtained Master of Business Administration at Harvard University in 1953.
Paterno was a lecturer in graduate school of the University of the Philippines, De La Salle University and Ateneo de Manila University from 1954 to 1962.
Political career
He was elected as a representative to the Batasang Pambansa. Following his resignation from President Ferdinand Marcos's Kilusang Bagong Lipunan. He criticized the administration's assassination of opposition Sen. Benigno Aquino Jr. With Marcos, Paterno said technocrats had free reins to handle the economy except in cement prices, as he felt Marcos knew little in economics but had an edifice complex.
He became chairman of the National Citizens' Movement for Free Elections (Namfrel) during the 1986 presidential elections.
Afterwards, Paterno was appointed Deputy Secretary of Energy from April 1986 to February 1987, and Chairman of the Philippine National Oil Company from March 1986 to February 1987.
President Corazon Aquino convinced him to run for senator. He served one term from 1987 to 1992.In October 1982, he founded Philippine Seven Corp. He is known for becoming the first general manager of Phinma and the first Filipino treasurer of Meralco.
Business career
Paterno started Philippine Seven Corporation in 1982. Popularly known as 7-Eleven, the convenience store has over 1,200 branches in the country.
He served as independent director for different companies such as City Resources Phil Corp., Benpres Holdings Corp., Metro Pacific Tollways Corp., Cityland Development Corp. and of First Philippine Holdings. He eventually resigned as his health failed.
Paterno won several awards – the Order of the Sacred Treasure from the Emperor of Japan, the 1982 MAP Management Man of the Year, and the 2013 Ramon V. del Rosario Award.
Personal life
He is survived by his wife Baby, his children Judy, Mailin, Maite, Victor and Tina, and his eight grandchildren.
Death
Paterno died at 8:40 in the morning of November 21, 2014. He was 89 years old.
References
External links
The obituary of Vicente Paterno - ABS-CBN News
1925 births
2014 deaths
People from Quiapo, Manila
21st-century Filipino businesspeople
Senators of the 8th Congress of the Philippines
Secretaries of Trade and Industry of the Philippines
Secretaries of Public Works and Highways of the Philippines
University of the Philippines alumni
Ferdinand Marcos administration cabinet members
Members of the Batasang Pambansa
Harvard Business School alumni
Recipients of the Presidential Medal of Merit (Philippines)
20th-century Filipino businesspeople
|
```javascript
OC.L10N.register(
"user_status",
{
"Recent statuses" : "Nylige statuser",
"No recent status changes" : "Ingen nylige statusendringer",
"In a meeting" : "I et mte",
"Commuting" : "Pendler",
"Out sick" : "Syk",
"Vacationing" : "P ferie",
"Out of office" : "Fravrende",
"Working remotely" : "Jobber utenfra",
"In a call" : "I en samtale",
"User status" : "Brukerstatus",
"Clear status after" : "Fjern status etter",
"Emoji for your status message" : "Emoji for statusmeldingene dine",
"What is your status?" : "Hva er din status?",
"Predefined statuses" : "Forhndsdefinerte statuser",
"Previously set" : "Tidligere angitt",
"Reset status" : "Tilbakestill status",
"Set status" : "Velg status",
"Online status" : "Online-status",
"Status message" : "Statusmelding",
"Your status was set automatically" : "Statusen din ble satt",
"Clear status message" : "Fjern statusmelding",
"Set status message" : "Velg statusmelding",
"Reset status to \"{icon} {message}\"" : "Tilbakestill status til \"{icon} {message}\"",
"Reset status to \"{message}\"" : "Tilbakestill status til \"{message}\"",
"Reset status to \"{icon}\"" : "Tilbakestill status til \"{icon}\"",
"There was an error saving the status" : "Det oppsto en feil ved lagring av status",
"There was an error clearing the status" : "Det oppsto en feil ved fjerning av status",
"There was an error reverting the status" : "Det oppstod en feil under tilbakestilling av statusen",
"Don't clear" : "Ikke fjern",
"Today" : "I dag",
"This week" : "Denne uken",
"Online" : "Plogget",
"Away" : "Borte",
"Do not disturb" : "Ikke forstyrr",
"Invisible" : "Usynlig",
"Offline" : "Frakoblet",
"There was an error saving the new status" : "Det oppsto en feil ved lagring av ny status",
"30 minutes" : "30 minutter",
"1 hour" : "1 time",
"4 hours" : "4 timer",
"Mute all notifications" : "Demp alle varslinger",
"Appear offline" : "Vis som frakoblet"
},
"nplurals=2; plural=(n != 1);");
```
|
International Perspectives in Psychology: Research, Practice, Consultation is a peer-reviewed academic journal published by Division 52 of the American Psychological Association. It was established in 2011 and covers research in the psychology of "human behavior and experiences around the globe." The current editor-in-chief is Stuart Carr of Massey University.
References
External links
American Psychological Association academic journals
English-language journals
|
Bartomeu Nicolau Morlà, known as Tomeu Penya (; born 1949 in Vilafranca de Bonany, Majorca) is a Mallorcan singer-songwriter whose musical work combines Mallorcan folk music, classical rock and roll and country music.
In 1992, he earned the National Prize awarded by the Catalan government for the Sirena album.
Discography
Tomeu Penya canta a la vila (1980) (descatalogado)
Càrritx i roses (Blau 1982)
Coverbos (Blau 1984)
Illamor (Blau 1985)
D'amor i Festa (Recopilatorio en cassette, no se editó en LP, descatalogado)
Mallorquins i catalans (Blau 1986)
Tomeu (Blau 1987)
Arrels (Blau 1988)
Arrels'89 (Blau 1989)
Els cors ferits (Blau, 1990)
Sirena (álbum) (Blau, 1992)
10 anys d'èxits (Recopilatorio) (Blau, 1992)
Una aclucada d'ull (Blau, 1994)
Anuats (Picap, 1995)
Balades (Recopilatorio) (Blau, 1996)
De tot cor (Picap, 1997)
Penya al descobert (Picap, 1998)
(Recopilatorio) (1999)
Això és Pecat (Picap 2001)
Concert al Palau d'Esports de Barcelona (CD+DVD)
Fàcil (DiscMedi-Blau (2003)
Sa força d'una mirada (2004)
Bàsic (Recopilatorio) (2007)
Paraules que s'endú es vent (2007)
Tomeu Penya, 30 anys després (acústico en directo, CD+DVD) (2010)
És per tu (2012)
Arruix (2013)
Enamorant-nos (2014) (Recopilatorio con 1 tema nuevo)
Optimista'' (2015)
References
Living people
Spanish male singer-songwriters
Spanish singer-songwriters
1949 births
|
```python
import json
from sanic import Sanic, text
from sanic.application.constants import Mode
from sanic.config import Config
from sanic.log import LOGGING_CONFIG_DEFAULTS, logger
LOGGING_CONFIG = {**LOGGING_CONFIG_DEFAULTS}
LOGGING_CONFIG["formatters"]["generic"]["format"] = "%(message)s"
LOGGING_CONFIG["loggers"]["sanic.root"]["level"] = "DEBUG"
app = Sanic("FakeServer", log_config=LOGGING_CONFIG)
@app.get("/")
async def handler(request):
return text(request.ip)
@app.main_process_start
async def app_info_dump(app: Sanic, _):
app_data = {
"access_log": app.config.ACCESS_LOG,
"auto_reload": app.auto_reload,
"debug": app.debug,
"noisy_exceptions": app.config.NOISY_EXCEPTIONS,
}
logger.info(json.dumps(app_data))
@app.main_process_stop
async def app_cleanup(app: Sanic, _):
app.state.auto_reload = False
app.state.mode = Mode.PRODUCTION
app.config = Config()
@app.after_server_start
async def shutdown(app: Sanic, _):
app.stop()
def create_app():
return app
def create_app_with_args(args):
try:
logger.info(f"foo={args.foo}")
except AttributeError:
logger.info(f"target={args.target}")
return app
```
|
```objective-c
/* $OpenBSD: extern.h,v 1.15 2015/12/26 18:11:43 guenther Exp $ */
/* $NetBSD: extern.h,v 1.3 1995/03/21 09:02:16 cgd Exp $ */
/*-
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)extern.h 8.2 (Berkeley) 4/1/94
*/
typedef struct {
char *p_end; /* pointer to NULL at end of path */
char *target_end; /* pointer to end of target base */
char p_path[PATH_MAX]; /* pointer to the start of a path */
} PATH_T;
extern PATH_T to;
extern uid_t myuid;
extern int fflag, iflag, pflag;
extern mode_t myumask;
extern char *__progname;
__BEGIN_DECLS
int copy_fifo(struct stat *, int);
int copy_file(FTSENT *, int);
int copy_link(FTSENT *, int);
int copy_special(struct stat *, int);
int setfile(struct stat *, int);
void usage(void);
__END_DECLS
```
|
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
import sys
sys.path.append(sys.argv[1])
from gather_gemm_scatter_manifest import GatherGemmScatterManifest
from gather_gemm_scatter_operation import GatherGemmScatterOperation
from generator import (
ComplexTransform,
CudaToolkitVersionSatisfies,
EpilogueFunctor,
GemmKind,
SwizzlingFunctor,
TensorDescription,
)
from library import (
DataType,
LayoutType,
MathInstruction,
MathOperation,
OpcodeClass,
TileDescription,
)
from manifest import GeneratorTarget
def CreateGatherGemmScatterOperator(
manifest,
layouts,
tile_descriptions,
data_type,
complex_transforms=None,
epilogue_functor=EpilogueFunctor.LinearCombination,
swizzling_functor=SwizzlingFunctor.Identity8,
):
# To use StreamK decomposition for basic GEMMs, set `swizzling_functor = SwizzlingFunctor.StreamK`
if complex_transforms is None:
complex_transforms = [
(ComplexTransform.none, ComplexTransform.none),
]
element_a, element_b, element_c, element_epilogue = data_type
alignment_constraints = [0]
if 'f16' == element_a.name or 'bf16' == element_a.name:
alignment_constraints = [8]
elif 'f32' == element_a.name or 'tf32' == element_a.name:
alignment_constraints = [4]
elif 'f64' == element_a.name:
alignment_constraints = [1]
operations = []
for layout in layouts:
for tile_description in tile_descriptions:
for alignment in alignment_constraints:
for complex_transform in complex_transforms:
alignment_c = min(8, alignment)
A = TensorDescription(
element_a, layout[0], alignment, complex_transform[0]
)
B = TensorDescription(
element_b, layout[1], alignment, complex_transform[1]
)
C = TensorDescription(element_c, layout[2], alignment_c)
new_operation = GatherGemmScatterOperation(
GemmKind.Universal,
tile_description.minimum_compute_capability,
tile_description,
A,
B,
C,
element_epilogue,
epilogue_functor,
swizzling_functor,
)
manifest.append(new_operation)
operations.append(new_operation)
return operations
def GenerateSM80_TensorOp_16816(manifest, cuda_version, debug=False):
if not CudaToolkitVersionSatisfies(cuda_version, 11, 0):
return
layouts = [
(LayoutType.RowMajor, LayoutType.RowMajor, LayoutType.RowMajor),
]
math_instructions = [
MathInstruction(
[16, 8, 16],
DataType.f16,
DataType.f16,
DataType.f16,
OpcodeClass.TensorOp,
MathOperation.multiply_add,
),
]
min_cc = 80
max_cc = 1024
alignment_constraints = [8]
for math_inst in math_instructions:
tile_descriptions = [
TileDescription(
[256, 128, 32], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 256, 32], 3, [2, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 32], 3, [4, 1, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 32], 4, [4, 1, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 32], 4, [1, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 32], 4, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 32], 5, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 64, 32], 6, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 32], 6, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 64, 32], 10, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 128, 64], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 256, 64], 3, [2, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 64], 4, [4, 1, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 64], 4, [1, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 64], 4, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 64], 3, [4, 1, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 64], 3, [1, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 64], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 64, 64], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 64], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 64, 64], 5, [2, 2, 1], math_inst, min_cc, max_cc
),
]
if debug:
tile_descriptions = [
TileDescription(
[256, 128, 32], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
]
data_type = [
math_inst.element_a,
math_inst.element_b,
math_inst.element_accumulator,
math_inst.element_accumulator,
]
CreateGatherGemmScatterOperator(
manifest, layouts, tile_descriptions, data_type
)
# Avoid emitting two kernels if the accumulator type does not differ from the input type (e.g. F16 accumulation)
if math_inst.element_a != math_inst.element_accumulator:
data_type_mixed = [
math_inst.element_a,
math_inst.element_b,
math_inst.element_a,
math_inst.element_accumulator,
]
CreateGatherGemmScatterOperator(
manifest, layouts, tile_descriptions, data_type_mixed
)
def GenerateSM80_TensorOp_1688(manifest, cuda_version, debug=False):
if not CudaToolkitVersionSatisfies(cuda_version, 11, 0):
return
layouts = [
(LayoutType.RowMajor, LayoutType.RowMajor, LayoutType.RowMajor),
(LayoutType.RowMajor, LayoutType.ColumnMajor, LayoutType.RowMajor),
(LayoutType.ColumnMajor, LayoutType.RowMajor, LayoutType.RowMajor),
]
math_instructions = [
MathInstruction(
[16, 8, 8],
DataType.tf32,
DataType.tf32,
DataType.f32,
OpcodeClass.TensorOp,
MathOperation.multiply_add,
)
]
min_cc = 80
max_cc = 1024
for math_inst in math_instructions:
tile_descriptions = [
TileDescription(
[256, 128, 16], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 256, 16], 3, [2, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 16], 4, [4, 1, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 16], 4, [1, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 16], 5, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 16], 4, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 16], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 64, 16], 6, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 16], 6, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 64, 16], 10, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 128, 32], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 256, 32], 3, [2, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 32], 4, [4, 1, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 32], 4, [1, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 32], 4, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 64, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 64, 32], 5, [2, 2, 1], math_inst, min_cc, max_cc
),
]
if debug:
tile_descriptions = [
TileDescription(
[256, 128, 16], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
]
data_type = [
math_inst.element_a,
math_inst.element_b,
math_inst.element_accumulator,
math_inst.element_accumulator,
]
data_type_mixed = [
math_inst.element_a,
math_inst.element_b,
math_inst.element_a,
math_inst.element_accumulator,
]
CreateGatherGemmScatterOperator(
manifest, layouts, tile_descriptions, data_type
)
CreateGatherGemmScatterOperator(
manifest, layouts, tile_descriptions, data_type_mixed
)
def GenerateSM80_TensorOp_1688_fast_math(manifest, cuda_version, debug=False):
if not CudaToolkitVersionSatisfies(cuda_version, 11, 0):
return
layouts = [
(LayoutType.RowMajor, LayoutType.RowMajor, LayoutType.RowMajor),
(LayoutType.RowMajor, LayoutType.ColumnMajor, LayoutType.RowMajor),
(LayoutType.ColumnMajor, LayoutType.RowMajor, LayoutType.RowMajor),
]
math_instructions = [
MathInstruction(
[16, 8, 8],
DataType.tf32,
DataType.tf32,
DataType.f32,
OpcodeClass.TensorOp,
MathOperation.multiply_add,
),
]
min_cc = 80
max_cc = 1024
for math_inst in math_instructions:
tile_descriptions = [
TileDescription(
[256, 128, 16], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 256, 16], 3, [2, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 16], 4, [4, 1, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 16], 4, [1, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 16], 5, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 16], 4, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 16], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 64, 16], 6, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 16], 6, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 64, 16], 10, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 128, 32], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 256, 32], 3, [2, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 32], 4, [4, 1, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 32], 4, [1, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 32], 4, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 64, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 64, 32], 5, [2, 2, 1], math_inst, min_cc, max_cc
),
]
if debug:
tile_descriptions = [
TileDescription(
[256, 128, 16], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
]
data_type = [DataType.f32, DataType.f32, DataType.f32, DataType.f32]
CreateGatherGemmScatterOperator(
manifest, layouts, tile_descriptions, data_type
)
def GenerateSM80_TensorOp_1688_fast_fp32_math(
manifest, cuda_version, debug=False
):
if not CudaToolkitVersionSatisfies(cuda_version, 11, 0):
return
layouts = [
(LayoutType.RowMajor, LayoutType.RowMajor, LayoutType.RowMajor),
(LayoutType.RowMajor, LayoutType.ColumnMajor, LayoutType.RowMajor),
(LayoutType.ColumnMajor, LayoutType.RowMajor, LayoutType.RowMajor),
]
math_instructions = [
MathInstruction(
[16, 8, 8],
DataType.f32,
DataType.f32,
DataType.f32,
OpcodeClass.TensorOp,
MathOperation.multiply_add_fast_f32,
),
]
min_cc = 80
max_cc = 1024
for math_inst in math_instructions:
tile_descriptions = [
TileDescription(
[128, 128, 16], 4, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 16], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 16], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 16], 3, [2, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 64, 16], 4, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 16], 4, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 64, 16], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 32], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 32], 3, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 32], 3, [2, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 64, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 64, 32], 3, [2, 2, 1], math_inst, min_cc, max_cc
),
]
if debug:
tile_descriptions = [
TileDescription(
[128, 128, 16], 4, [4, 2, 1], math_inst, min_cc, max_cc
),
]
data_type = [DataType.f32, DataType.f32, DataType.f32, DataType.f32]
CreateGatherGemmScatterOperator(
manifest, layouts, tile_descriptions, data_type
)
def GenerateSM75_TensorOp_1688(manifest, cuda_version, debug=False):
if not CudaToolkitVersionSatisfies(cuda_version, 10, 2):
return
layouts = [
(LayoutType.RowMajor, LayoutType.RowMajor, LayoutType.RowMajor),
]
math_instructions = [
MathInstruction(
[16, 8, 8],
DataType.f16,
DataType.f16,
DataType.f32,
OpcodeClass.TensorOp,
MathOperation.multiply_add,
),
MathInstruction(
[16, 8, 8],
DataType.f16,
DataType.f16,
DataType.f16,
OpcodeClass.TensorOp,
MathOperation.multiply_add,
),
]
min_cc = 75
max_cc = 1024
for math_inst in math_instructions:
tile_descriptions = [
TileDescription(
[256, 128, 32], 2, [4, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 256, 32], 2, [2, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 128, 32], 2, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 256, 32], 2, [1, 4, 1], math_inst, min_cc, max_cc
),
TileDescription(
[256, 64, 32], 2, [4, 1, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 32], 2, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[128, 64, 32], 2, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 64, 32], 2, [2, 2, 1], math_inst, min_cc, max_cc
),
TileDescription(
[64, 128, 64], 2, [1, 2, 2], math_inst, min_cc, max_cc
),
]
if debug:
tile_descriptions = [
TileDescription(
[256, 128, 32], 2, [4, 2, 1], math_inst, min_cc, max_cc
),
]
data_type = [
math_inst.element_a,
math_inst.element_b,
math_inst.element_accumulator,
math_inst.element_accumulator,
]
CreateGatherGemmScatterOperator(
manifest, layouts, tile_descriptions, data_type
)
def GenerateSM75(manifest, cuda_version, debug=False):
GenerateSM75_TensorOp_1688(manifest, cuda_version, debug)
def GenerateSM80(manifest, cuda_version, debug=False):
GenerateSM80_TensorOp_16816(manifest, cuda_version, debug)
GenerateSM80_TensorOp_1688(manifest, cuda_version, debug)
GenerateSM80_TensorOp_1688_fast_math(manifest, cuda_version, debug)
GenerateSM80_TensorOp_1688_fast_fp32_math(manifest, cuda_version, debug)
class KernelCfg:
def __init__(
self,
architectures,
build_dir,
cuda_version,
curr_build_dir,
disable_full_archs_compilation,
filter_by_cc,
generator_target,
ignore_kernels,
interface_dir,
kernel_filter_file,
kernels,
operations,
selected_kernel_list,
):
self.architectures = architectures
self.build_dir = build_dir
self.cuda_version = cuda_version
self.curr_build_dir = curr_build_dir
self.disable_full_archs_compilation = disable_full_archs_compilation
self.filter_by_cc = filter_by_cc
self.generator_target = generator_target
self.ignore_kernels = ignore_kernels
self.interface_dir = interface_dir
self.kernel_filter_file = kernel_filter_file
self.kernels = kernels
self.operations = operations
self.selected_kernel_list = selected_kernel_list
if __name__ == "__main__":
args = KernelCfg(
architectures='80',
build_dir=sys.argv[2],
cuda_version=sys.argv[3],
curr_build_dir=sys.argv[2],
disable_full_archs_compilation=False,
filter_by_cc='True',
generator_target='library',
ignore_kernels='',
interface_dir=None,
kernel_filter_file=None,
kernels='',
operations='all',
selected_kernel_list=None,
)
manifest = GatherGemmScatterManifest(args)
debug = False
GenerateSM75(manifest, args.cuda_version, debug)
GenerateSM80(manifest, args.cuda_version, debug)
manifest.emit(GeneratorTarget.Library)
```
|
William Harold Dodd (born June 10, 1956) is an American politician who is currently serving in the California State Senate. He is a Democrat representing the 3rd Senate District, which encompasses the northern San Francisco Bay Area and Delta region.
Prior to his election to the State Senate, Dodd served in the California State Assembly representing the 4th Assembly District, which includes all or portions of Yolo, Napa, Sonoma, Lake, Solano, and Colusa Counties. Before serving in the Assembly, he served on the Napa County Board of Supervisors.
Business career
Prior to his time in elected office, Dodd was President and CEO of Diversified Water Systems, Inc. In 1978, Dodd earned a degree in Business Management from California State University, Chico.
During his time in the water industry, Dodd was active in the water quality industry's state and national trade associations. In 1985 he was elected President of the Pacific Water Quality Association and in 1994, elected to National Water Quality Association. During his tenure, the industry embraced third-party certification of water treatment products and lobbied in Sacramento on important legislation to protect consumers. He was awarded the PWQA and WQA Hall of Fame Award, Award of Merit for work in PR and Governmental affairs.
Political career
Prior to serving in the Assembly, Bill served on the Napa County Board of Supervisors for 14 years. He also represented the cities and county of Napa on the Metropolitan Transportation Commission including a two-year term as chairman. In addition, Dodd served as an Honorary Commander for the 60th Air Mobility Wing at Travis Air Force Base. Other boards and commission service included the Chair of the Local Agency Formation Commission of Napa County, Chair of the Napa County League of Governments, Chair of the Napa County Transportation Planning Agency, and Chair of the Napa County Flood Control and Water Conservation District.
During his tenure as supervisor, Dodd worked with officials and the community to improve Napa's infrastructure, foster economic development while supporting workers, and protect community services for the county's most vulnerable. Dodd helped secure nearly $100 million in funding for the Jamison Canyon Road project (Highway 12) and transportation projects in the Napa, Solano and Sonoma County corridor.
In 2013, having previously been a registered Republican, Dodd changed his affiliation to the Democratic Party. In explaining the change, Dodd described himself as "a fiscal conservative but I agree with the Democratic viewpoint on most social issues". He also described himself as a pragmatist who parted company with the Republicans on the Board of Supervisors due to the outright opposition of the party to any tax increases, while Dodd supported a property tax increase to raise additional revenue.
In 2014 Dodd ran for the District 4 Assembly seat. After gaining the most votes in the primary, Dodd defeated Republican Charlie Schaupp in a run-off election. Dodd won the seat by a 62-38 percent margin. Dodd was named to the Transportation, Water, Parks and Wildlife, Business and Professions, Agriculture and Rules Committee.
Dodd declared his candidacy for the State Senate, District 3 in July 2015 and was endorsed by Governor Jerry Brown, Lt. Governor Gavin Newsom, Attorney General Kamala Harris and Secretary of State Alex Padilla, along with the majority of members in the Senate, Assembly and local elected officials. He defeated liberal Assemblywoman Mariko Yamada with 58% of the vote to win election to the Senate.
In March 2017 Dodd coauthored California Senate Bill 649, which would remove a city's ability to control where cell towers are placed and transfer the power to the state.
Personal life
Dodd was born and raised in Napa County, where his family had 10 acres of farmland, dedicated to growing walnuts.
Dodd graduated from California State University, Chico in 1978, majoring in business administration. He was involved in student government, serving on the Policy Advisory Board and as president of the Inter-Fraternity Council.
Dodd serves on the boards of the Queen of the Valley Hospital Foundation, Justin-Siena High School, Health Care for the Poor Committee, Wolfe Center Youth Drug and Alcohol Center, Children's Health Initiative and is an honorary member of Hospice, Adult Day Services and Clinic Ole.
Dodd and wife Mary reside in Napa. They have five children and eight grandchildren.
Electoral history
2014 California State Assembly
2016 California State Senate
References
External links
Campaign website
Join California Bill Dodd
1956 births
Living people
21st-century American politicians
California Republicans
Democratic Party members of the California State Assembly
Democratic Party California state senators
County supervisors in California
California State University, Chico alumni
People from Napa, California
Democratic Party county supervisors in California
|
```javascript
//your_sha256_hash---------------------------------------
//your_sha256_hash---------------------------------------
function test0(x) {
var obj1 = {};
var func3 = function () {
};
obj1.method1 = func3;
var i8 = new Int8Array(256);
var IntArr0 = [];
var protoObj1 = Object(obj1);
for (var _strvar1 of i8) {
for (; protoObj1.method1(); d) {
if (x) {
return 2491902987445170000;
}
else {
return 1;
}
}
for (var _strvar1 of IntArr0) {
}
}
}
test0(1);
test0(0);
test0(1);
print("Passed\n");
```
|
```objective-c
//
// file LICENSE or copy at path_to_url
#ifndef CDSLIB_CONTAINER_DETAILS_MAKE_SKIP_LIST_SET_H
#define CDSLIB_CONTAINER_DETAILS_MAKE_SKIP_LIST_SET_H
#include <cds/container/details/skip_list_base.h>
#include <cds/details/binary_functor_wrapper.h>
//@cond
namespace cds { namespace container { namespace details {
template <typename GC, typename T, typename Traits>
struct make_skip_list_set
{
typedef GC gc;
typedef T value_type;
typedef Traits traits;
typedef cds::intrusive::skip_list::node< gc > intrusive_node_type;
struct node_type: public intrusive_node_type
{
typedef intrusive_node_type base_class;
typedef typename base_class::atomic_marked_ptr atomic_marked_ptr;
typedef value_type stored_value_type;
value_type m_Value;
//atomic_marked_ptr m_arrTower[] ; // allocated together with node_type in single memory block
template <typename Q>
node_type( unsigned int nHeight, atomic_marked_ptr * pTower, Q&& v )
: m_Value( std::forward<Q>( v ))
{
init_tower( nHeight, pTower );
}
template <typename Q, typename... Args>
node_type( unsigned int nHeight, atomic_marked_ptr * pTower, Q&& q, Args&&... args )
: m_Value( std::forward<Q>(q), std::forward<Args>(args)... )
{
init_tower( nHeight, pTower );
}
node_type() = delete;
private:
void init_tower( unsigned nHeight, atomic_marked_ptr* pTower )
{
if ( nHeight > 1 ) {
new ( pTower ) atomic_marked_ptr[nHeight - 1];
base_class::make_tower( nHeight, pTower );
}
}
};
typedef skip_list::details::node_allocator< node_type, traits> node_allocator;
struct node_deallocator {
void operator ()( node_type * pNode )
{
node_allocator().Delete( pNode );
}
};
typedef skip_list::details::dummy_node_builder<intrusive_node_type> dummy_node_builder;
struct value_accessor
{
value_type const& operator()( node_type const& node ) const
{
return node.m_Value;
}
};
typedef typename opt::details::make_comparator< value_type, traits >::type key_comparator;
template <typename Less>
using less_wrapper = cds::details::compare_wrapper< node_type, cds::opt::details::make_comparator_from_less<Less>, value_accessor >;
class intrusive_traits: public cds::intrusive::skip_list::make_traits<
cds::opt::type_traits< traits >
,cds::intrusive::opt::hook< intrusive::skip_list::base_hook< cds::opt::gc< gc > > >
,cds::intrusive::opt::disposer< node_deallocator >
,cds::intrusive::skip_list::internal_node_builder< dummy_node_builder >
,cds::opt::compare< cds::details::compare_wrapper< node_type, key_comparator, value_accessor > >
>::type
{};
typedef cds::intrusive::SkipListSet< gc, node_type, intrusive_traits> type;
};
}}} // namespace cds::container::details
//@endcond
#endif //#ifndef CDSLIB_CONTAINER_DETAILS_MAKE_SKIP_LIST_SET_H
```
|
WTTR (1470 AM) is a full service and classic hits broadcast radio station licensed to Westminster, Maryland, serving Carroll County, Maryland. WTTR is owned and operated by Hilltop Communications, LLC.
History
WTTR was placed on the air in 1953 by local businessman Russ Morgan, the first song broadcast was the Star Spangled Banner on the 4th of July. In the 1960s. Carroll County Broadcasting Company retained ownership of WTTR AM and FM until the station was sold to Shamrock Broadcasting in the early 1980s.
In 1981 WTTR AM changed format to Adult Contemporary, operating as a daytime only station known as Carroll Community Radio. The station had a full time news team and 3 full time DJs. In 1984, Shamrock was granted permission by the FCC to allow WTTR AM to broadcast at night, adding two additional towers at its Uniontown Road studios in Westminster. The station broadcast a successful MOR format dubbed Nightime Nastalgia hosted by DJ Steve Spencer and played Big Band Standards from the 40s and 50s.
At the same time, WTTR FM switched its long time association with the Baltimore Orioles to WTTR AM and continues their relationship with the team today.
Well known DJ Dwight Dingle, a retired school teacher joined WTTR part time in 1974 and later became Operations Manager and then General Manager in 1986 until his death in November, 2009. He was tightly involved with the community serving on the Carroll County Chamber of Commerce.
WTTR AM is also known for its local sports content broadcasting weekly high school football and basketball games as well as Western Maryland College games and Babe Ruth Baseball play by play. Dwight Dingle and Charlie Beckhardt provided the play by play. The duo also created the Carroll County High School Athlete of the Week award,honoring local athletic accomplishments.
Shamrock moved the FM to Baltimore in 1984 and constructed a new tower in Hampstead to increase its signal to Baltimore. The station changed its call letters to WGRX and debuted a Eclectic Rock format for several years. After trying a number of formats from Country to Heavy Metal, the station eventually settled on its present Classic Rock format under the call letters WZBA.
Shamrock sold WTTR to Sajak Broadcasting Corporation in 2005. In late September 2013, Sajak Broadcasting announced an agreement to sell WTTR to the newly formed Hilltop Communications, LLC. Hilltop assumed ownership on 12/19/2013.
On January 1, 2014 WTTR shifted their format from oldies to classic hits of the 1960s, '70s, and '80s.
On July 18, 2016 WTTR went live with their 102.3 FM translator frequency.
External links
1470 WTTR Online
TTR
1953 establishments in Maryland
Radio stations established in 1953
Westminster, Maryland
Full service radio stations in the United States
|
Cassiopeia ( is a 2022 South Korean drama film, directed by Shin Yeon-shick and starring Ahn Sung-ki, Seo Hyun-jin and Joo Ye-rim. The film is about dementia in which a daughter loses her memory due to Alzheimer's, and lives a new life with her father. It was released theatrically on June 1, 2022.
Synopsis
Cassiopeia is the brightest constellation and is located next to the North Star. The W-shaped constellation Cassiopeia circle around North Star in a period of 23 hours and 56 minutes. The North Star is a constellation that usually finds a way (used for navigation), it means the Cassiopeia as its parent constellation floats during the day next to the constellation that finds a way. "Cassiopeia, thus, is an important guide to finding the North Star. When you get lost, you can use Cassiopeia to find the North Star and then use the North Star to determine the direction. The same is true of the meaning of family in the work. Like the North Star, it doesn't tell you the direction of life directly, but like Cassiopeia, it indirectly supports and protects you. It implies that family is always by your side and silently protecting you when you lose your way in life."
Su-jin is a successful lawyer. After her divorce, she is having a perfect life as a lawyer and mother. She is preparing her daughter, Gina, to study in the United States. Her father In-woo lives with them and takes care of her granddaughter. She is suddenly diagnosed with Alzheimer's after a car accident. Her father protects her staying by her side as she starts gradually turning into a young child due to loss of memory and a loving accompaniment begins.
Cast
Ahn Sung-ki as In-woom, Su-jin's father
Seo Hyun-jin as Su-jin, a lawyer who lost all her memories due to Alzheimer's disease
Joo Ye-rim as Gina, Su-jin's daughter
Production
In June, 2021 the cast of the film, tentatively titled as Dementia was confirmed as Ahn Sung-ki and Seo Hyun-jin. The film directed by Shin Yeon-shick was expected to start filming in second half of 2021. With this film Shin Yeon-shick has made a comeback after 2017 film Romans 8:37. Seo Hyun-jin is working in a film after four years, since her last film was Because I Love You in 2017. Principal photography of the film began on September 9, 2021.
Release and reception
The film was released on 175 screens on June 1, 2022, in South Korea.
Box office
As per Korean Film Council (Kofic) integrated computer network, the film opened at 6th place with 5,344 admissions on the Korean box office.
it is at the 29th place among all the Korean films released in the year 2022 in South Korea, with gross of US$148,789 and 22,149 admissions.
Critical response
Kim Na-yeon of Star News reviewing the film praised the performance of the actors Seo Hyun-jin, Ahn Seong-gi and Joo Ye-rim, writing, "thanks to the brilliant performances of the actors." But, other than that Kim didn't find any hold in the film. Kim concluded, "However, it is a pity that there is no particular strength other than the acting of the actors." Lee Yoo-chae of Cine21 described the film as "parenting journal written by a man who has had a chance to make up for his failures as a father." Lee praised the performance of Seo Hyun-jin writing, "actress Seo Hyun-jin shows off her challenging acting in her first movie starring role." Concluding, Lee revealed that for Cassiopeia director Shin Yeon-sik got the idea from the similar relationship between Robert De Niro and Anne Hathaway in The Intern so for the director due to his relationship with Ahn Sung-ki, "Cassiopeia had to be the story of a woman who has her father as Ahn Sung-ki." Park Jin-young reviewing for Joy News 24 wrote about the film, "The movie captures the situation of Alzheimer's patients and their families, as well as their companionship, with a calm gaze without exaggeration or belief." Park praised the performances of Seo Hyun-jin, writing, "Seo Hyun-jin's passionate performance, which solidly depicts various roles and swirling emotions, from lawyers to maternal love to Alzheimer's, draws admiration," and Ahn Sung-ki, writing, "Ahn Sung-ki leads the play stably with a heavy presence and deep eyes."
Accolades
References
External links
2022 films
2022 drama films
2020s Korean-language films
South Korean drama films
South Korean films about Alzheimer's disease
Films about father–daughter relationships
|
```shell
#!/usr/bin/env bash
# <xbar.title>Top 5 Memory-Consuming Applications</xbar.title>
# <xbar.version>v1.0</xbar.version>
# <xbar.author>Qiansen Y</xbar.author>
# <xbar.author.github>hypersport</xbar.author.github>
# <xbar.desc>top 5 memory-consuming applications</xbar.desc>
# <xbar.image>path_to_url
# <xbar.about>top 5 memory-consuming applications</xbar.about>
ps xmo rss=,pmem=,comm= | while read -r rss pmem comm; ((n++<5)); do
size="$((rss/1024))";
short=$((4-${#size}));
size="(${size}M)";
i=0;
while ((i++ < short)); do size=" $size"; done;
pmem="${pmem%%.*}"
if [ "$pmem" -ge 20 ]; then color=$'\e[31m';
elif [ "$pmem" -ge 10 ]; then color=$'\e[33m';
else color=$'\e[32m';
fi
echo "$color$pmem% $size $(basename "$comm")"$'\e[0m'"";
done
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.