text stringlengths 1 22.8M |
|---|
```shell
What is a checksum?
Limiting log output by time
Use `short` status to make output more compact
Ignore files in git
Dates in git
``` |
Anjouin () is a commune in the Indre department in central France.
Population
See also
Communes of the Indre department
References
Communes of Indre |
```javascript
(window.webpackJsonp=window.webpackJsonp||[]).push([[108],{890:function(e,n){e.exports=function(e){var n={keyword:"if then not for in while do return else elseif break continue switch and or unless when class extends super local import export from using",literal:"true false nil",built_in:"_G _VERSION assert collectgarbage dofile error getfenv getmetatable ipairs load loadfile loadstring module next pairs pcall print rawequal rawget rawset require select setfenv setmetatable tonumber tostring type unpack xpcall coroutine debug io math os package string table"},s="[A-Za-z$_][0-9A-Za-z$_]*",a={className:"subst",begin:/#\{/,end:/}/,keywords:n},i=[e.inherit(e.C_NUMBER_MODE,{starts:{end:"(\\s*/)?",relevance:0}}),{className:"string",variants:[{begin:/'/,end:/'/,contains:[e.BACKSLASH_ESCAPE]},{begin:/"/,end:/"/,contains:[e.BACKSLASH_ESCAPE,a]}]},{className:"built_in",begin:"@__"+e.IDENT_RE},{begin:"@"+e.IDENT_RE},{begin:e.IDENT_RE+"\\\\"+e.IDENT_RE}];a.contains=i;var t=e.inherit(e.TITLE_MODE,{begin:s}),r={className:"params",begin:"\\([^\\(]",returnBegin:!0,contains:[{begin:/\(/,end:/\)/,keywords:n,contains:["self"].concat(i)}]};return{aliases:["moon"],keywords:n,illegal:/\/\*/,contains:i.concat([e.COMMENT("--","$"),{className:"function",begin:"^\\s*"+s+"\\s*=\\s*(\\(.*\\))?\\s*\\B[-=]>",end:"[-=]>",returnBegin:!0,contains:[t,r]},{begin:/[\(,:=]\s*/,relevance:0,contains:[{className:"function",begin:"(\\(.*\\))?\\s*\\B[-=]>",end:"[-=]>",returnBegin:!0,contains:[r]}]},{className:"class",beginKeywords:"class",end:"$",illegal:/[:="\[\]]/,contains:[{beginKeywords:"extends",endsWithParent:!0,illegal:/[:="\[\]]/,contains:[t]},t]},{className:"name",begin:s+":",end:":",returnBegin:!0,returnEnd:!0,relevance:0}])}}}}]);
``` |
```yaml
# Each section from every releasenote are combined when the
# CHANGELOG.rst is rendered. So the text needs to be worded so that
# it does not depend on any information only available in another
# section. This may mean repeating some details, but each section
# must be readable independently of the other.
#
# Each section note must be formatted as reStructuredText.
---
features:
- |
Addition of a gRPC server and a hostname resolution endpoint,
including a grpc-gateway that exposes said endpoint as a REST
service.
``` |
The index of MS-DOS compatible video games is split into multiple pages because of its size.
To navigate by individual letter use the table of contents below.
This list contains games.
Notes
Indexes of video game topics
Lists of PC games |
The 35th Directors Guild of America Awards, honoring the outstanding directorial achievements in film and television in 1982, were presented on March 12, 1983 at the Beverly Hilton and the Plaza Hotel. The feature film nominees were announced on January 30, 1983.
Winners and nominees
Film
Television
Commercials
D.W. Griffith Award
John Huston
Frank Capra Achievement Award
William Beaudine Jr.
William C. Gerrity
Honorary Life Member
Elia Kazan
Robert Wise
References
External links
Directors Guild of America Awards
1982 film awards
1982 television awards
Direct
Direct
Directors
Directors Guild of America Awards
Directors Guild of America Awards
Directors Guild of America Awards |
```smalltalk
using System;
namespace Microsoft.MixedReality.Toolkit.UI
{
/// <summary>
/// Describes in which axis to orient the slider
/// </summary>
[Serializable]
public enum SliderAxis
{
XAxis = 0,
YAxis,
ZAxis
}
}
``` |
The Netherlands Football League Championship 1888–1889 was the first national football championship in the Netherlands. Seven teams from the cities Amsterdam, The Hague, Haarlem and Rotterdam participated in the competition that would later be called Eerste Klasse West. But since the western football district of the Netherlands was the only one to have a competition at the time, it could be regarded as a national championship. VV Concordia from Rotterdam won the championship, however this championship was not official, since the teams had not played an equal number of matches.
League standings
Results
References
RSSSF Netherlands Football League Championships 1898-1954
Netherlands Football League Championship seasons
1888–89 in European football |
Teng Bin (; born 24 July 1985) is a Chinese former footballer.
Career statistics
Club
Notes
References
1985 births
Living people
Chinese men's footballers
Men's association football midfielders
Singapore Premier League players
Chinese Super League players
Shanghai Shenxin F.C. players |
An on-us check is a negotiable item (check) which is drawn on the same bank that it is presented to for payment.
For example, a check drawn on Bank of America, presented for deposit at another branch of Bank of America, would be considered an on-us check. The same item presented for deposit at Wells Fargo Bank would be considered a transit check. Routing numbers, as well as the bank name printed on the check, help to determine an item's classification.
References
See also
Transit check
Clearing
Clearing house
Routing number
Cheques |
Baba Amar Singh Nibbar Khemkaran was an important figure in 18th century Bandai Sikhism.
Family History
Baba Amar Singh Nibbar was born into a kamboj family of Khemkaran. In Sikh history, he is also known as Mahant Singh. His childhood name was Amar Chand but after taking Amrit, he became known as Bhai Amar Singh. His father Raghupat Rai nibbar was a big landlord of Khemkaran and came from a family whose ancestors held royal positions in the Moghul courts. According to Gyani Gyan Singh’s Panth Parkash also, Baba Amar Singh was of kamboj lineage.
Baba Amar Singh had an elder brother named Mool Chand. Bhai Mool Chand was an excellent soldier and had fought valiantly for Guru Gobind Singh in several battles prior to his martyrdom in the Battle of Nadaun on March 20, 1691.
Baba Amar Singh had a very powerful and athletic physique and measured well over six feet and half in height. He was a very fierce and formidable warrior in the battle-field and could continuously wield a double-edged sword (Kharasang or Khanda) weighing over fifty Ser (about twenty kilograms)
He was nicknamed as Bir (Knight).
note|Kirpal}} S Kipral Singh, The Kambojas Through the Ages, 2005, pp 277–278
Gyani Gyan Singh, Panth Prakash (1970), page 530
Gyani Garja Singh, Shaheed Bilaas, page 81
Prof Piara Singh Padam, Guru Kian Sakhian, Index
Gyani Gyan Singh, Panth Prakash (1970), page 530
H.S. Thind, Kamboj Itihaas (1972), page 135
Gyani Gyan Singh, Panth Prakash (1970), page 230
Gyani Gyan Singh, Panth Prakash (1970), pages 230-231
Gyani Gyan Singh, Panth Prakash, (1970), pages 230-231
Martyrdom of Banda Bahadur
During siege of the Lohgarh fort of Banda Bahadur by Mughal forces in 1716, the Sikhs got bifurcated into two divisions: the Bandai Khalsa and the Tat Khalsa whereby the Tat Khalsa parted ways leaving Lohgarh to be defended by the Bandai Khalsa alone. After a long siege, Banda was arrested by Abdus Samad Khan along with his many followers and escorted to Delhi, chained in a cage. On June 9, 1716 he was barbarously executed along with hundreds of Sikhs and became a hallowed martyr in Sikh history.
Baba Amar Singh becomes the Bandai Chief
After the martyrdom of Banda Bahadur, Baba Amar Singh had assumed the supreme leadership of the Bandai Khalsa faction.
Feud among two Panthic war-factions continues
After the Lohgarh incidence, the friction between the two Panthic factions continued unabated and at times, there had also occurred minor scuffles between the two.
In 1721, Baba Binod Singh Trehan of the Tat Khalsa sent an invitation to the entire Sikh community all over the Punjab to gather at Amritsar on Diwali day. The two factions met at Amritsar and each asserted its claim as being the true heir to Guru Gobind Singh and the Harimandir Sahib. Things looked gloomy for the Sikhs, since both military factions readied themselves for a showdown to assert their individual claims. The dangerous situation was averted at the Diwali occasion by the timely intervention of the Sikh Sangats (Congregations) but both factions continued to entertain anger and ill-will against each other.
Bhai Mani Singh appointed as Arbitrator
Mata Sundari, the widow of Guru Gobind Singh, came to learn of the trouble brewing between the two military factions at Amritsar. She appointed Bhai Mani Singh as the Granthi of the Harimandir and sent him to Amritsar with Kirpal Singh (Chand), the maternal uncle of Guru Gobind Singh to resolve the feud. The choice on Bhai Mani Singh seems to have fallen for intrinsic reasons also since Bhai Mani Singh, like Baba Baba Amar Singh was of Kamboj lineage and it was therefore hoped that he could better convince Baba Amar Singh and bring him to conciliation in the broader interests of the Khalsa Panth.
The feud resolved but......
After assuming office of the Head-Granthi in 1721, Bhai Mani Singh sent invitations to both parties to assemble on the Vaisakhi occasion. Both factions again met at Amritsar in compliance of the invitation from Bhai Mani Singh but with all the malice in their minds set against each other. At Amritsar, the Tat Khalsa took unilateral control of the Akal Bunga while the Jhanda Bunga was taken over by the Bandai Khalsa led by Baba Amar Singh.
Using a simplistic but well-intentioned procedure, Bhai Mani Singh was finally able to resolve the feud and restore peace among the warring factions and put the affairs of the Darbar Sahib in order in 1722. The final decision was that the Tat Khalsa was declared the genuine successor to Guru Gobind Singh and the Harimandir Sahib.
Death
Both parties expressed their agreement and satisfaction over the decision taken by Bhai Mani Singh and the Bandai Khalsa followers of Baba Amar Singh went to join the Tat Khalsa but unexpectedly, at the last moment, trouble flared up and a deadly showdown took place in the very Parikrama of the Harimandir Sahib. Warriors from both sides unsheathed their swords and started to wield them fiercely and relentlessly against their own brethren with all the detachment of a professional soldier. There was great pandemonium and tumult in the Harimandir Prikarma in front of the Akal Takht and many were killed. The war scenes are described in very vivid and full graphic details in the Panth Prakash by Gyani Gyan Singh .
Baba Amar Singh wielded his double-edged sword relentlessly and after having slain numerous adversaries, finally, fell dead.
The following verse describes the death of Baba Amar Singh:
tad sudhasar that darshani darwaze agey Jang |
Mach gayo masurmedh ka dhar veech keech surang ||
kar sees pag bhuj bakh sabal hath majh asaar|
chad gayee luthain pe luthain kaat marey jawaan apaar |
Jab jujh dharani pai paryo Singh Amar anekan maar ||
Bhag gaye turat Bhandai leeni fateh Singhan maar
Legacy
Baba Amar Singh was not the first Sikh who died at the hands of fellow Sikhs due to intra-Panthic differences. The phenomenon had been in existence since the time of the Gurus. However, the gory clash which occurred at the Harimandir's Parikrama between the Bandai and the Tat Khalsa would be replicated in the future as schisms would arise in the community and sometimes lead to deadly showdowns as the one involving Baba Amar Singh.
Notes and references
Gyani Gyan Singh, Panth Prakash (1970), page 530
Gyani Garja Singh, Shaheed Bilaas, page 81
Prof Piara Singh Padam, Guru Kian Sakhian, Index
Gyani Gyan Singh, Panth Prakash (1970), page 530
Gyani Gyan Singh, Panth Prakash (1970), page 230
Gyani Gyan Singh, Panth Prakash (1970), pages 230-231
Gyani Gyan Singh, Panth Prakash, (1970), pages 230-231
Year of birth missing
18th-century deaths
Sikh warriors |
The Münstersche Aa () is a river in the Münster region of Westphalia in Germany. It is a left tributary of the Ems. The Münstersche Aa begins near Havixbeck, flows southeast until Münster, and then north to Greven, where it flows into the Ems. The total length of the Münstersche Aa is about .
See also
List of rivers of North Rhine-Westphalia
References
Rivers of North Rhine-Westphalia
Rivers of Germany |
```scss
@import "./styles/variables.scss";
.dark .mat-header-cell {
background: $accent-dark !important;
font-size: 1em;
font-weight: bold;
color: $ombi-background-primary-accent;
}
.mat-form-field {
float:right;
margin-right:20px;
}
/*::ng-deep .dark .mat-form-field-label{
font-size: 1.2em;
}*/
::ng-deep .mat-form-field-infix {
width: 8em;
margin-top:1em;
}
::ng-deep .dark .mat-tab-label-active{
background: $accent-dark !important;
color: $ombi-background-primary-accent !important;
font-weight:bold;
}
::ng-deep .mat-tab-label{
opacity: 1;
}
::ng-deep .row {
margin-right:0;
margin-left:0;
}
@media (min-width: 500px) {
.justify-content-md-center {
justify-content: normal !important;
}
}
@media (min-width: 1170px){
.justify-content-md-center {
justify-content: center !important;
}
}
``` |
Rachmaninoff is an impact crater on Mercury. This basin, first imaged in its entirety during MESSENGERs third Mercury flyby, was quickly identified as a feature of high scientific interest, because of its fresh appearance, its distinctively colored interior plains, and the extensional troughs on its floor. The morphology of Rachmaninoff is similar to that of Raditladi, which is one of the youngest impact basins on Mercury. The age of Raditladi is estimated at one billion years. Rachmaninoff appears to be only slightly older.
The central part of Rachmaninoff is occupied by a peak ring 130 km in diameter and somewhat elongated in the north–south direction. The area within it is covered by bright reddish smooth plains, which are different in color from the plains outside the peak ring. These plains are likely to be of volcanic origin because they show signs of flow. They also over-topped and covered the southern portion of the peak ring itself. The lowest recorded elevation on Mercury, 5380 meters below the global average, lies within Rachmaninoff Basin. Rachmaninoff is one of 110 peak ring basins on Mercury.
The smooth plains inside the peak ring were deformed by a set of concentric graben (troughs) much like those inside Raditladi. The troughs are located at half the distance to the peak ring from the center of the crater. Rachmaninoff is the fourth impact crater on Mercury (after Caloris, Rembrandt and Raditladi), where extensional tectonic features have been observed. The formation mechanism of the graben remains unknown.
The crater is named after Sergei Rachmaninoff, a Russian composer, pianist, and conductor (1873–1943).
A distinct bright area between the inner peak ring and the rim in the southeast portion of the crater is known as Suge Facula.
Views
References
Impact craters on Mercury
Sergei Rachmaninoff |
A handbook is a type of reference work, or other collection of instructions, that is intended to provide ready reference. The term originally applied to a small or portable book containing information useful for its owner, but the Oxford English Dictionary defines the current sense as "any book ... giving information such as facts on a particular subject, guidance in some art or occupation, instructions for operating a machine, or information for tourists."
A handbook is sometimes referred to as a vade mecum (Latin, "go with me") or pocket reference. It may also be referred to as an enchiridion.
Handbooks may deal with any topic, and are generally compendiums of information in a particular field or about a particular technique. They are designed to be easily consulted and provide quick answers in a certain area. For example, the MLA Handbook for Writers of Research Papers is a reference for how to cite works in MLA style, among other things. Examples of engineering handbooks include Perry's Chemical Engineers' Handbook, Marks' Standard Handbook for Mechanical Engineers, and the CRC Handbook of Chemistry and Physics.
See also
Enchiridion
Guide book
Manual (disambiguation)
Oxford Companions
Textbook
Abramowitz and Stegun Handbook of Mathematical Functions
CRC Handbook of Chemistry and Physics
Mathematical tables
MAOL, a Finnish handbook for science
'Binas'' (book), a Dutch science handbook
Notes
External links
Vademecum in opus Saxonis et alia opera Danica compendium ex indice verborum - a Medieval Latin dictionary
Reference works
Textbooks |
Swisttal is a municipality in the Rhein-Sieg district, in North Rhine-Westphalia, Germany. Swisttal received its names from a brook named Swist, which flows in the middle of the municipality.
Geography
Swisttal is situated approximately 15 km west of Bonn. It covers an area of approx. 65 km² (of which 10 km² is forest, part of the Kottenforst, and 49 km² is used for agriculture).
Subdivisions
The municipality consists of the following parishes:
Heimerzheim
Buschhoven
Dünstekoven
Essig
Ludendorf
Miel (Swisttal)
Ollheim
Odendorf
Morenhoven
Straßfeld
as well as the hamlets of Hohn, Vershoven, Moemerzheim and Muettinghoven. The local administration is situated between the villages Ludendorf and Essig.
Buildings and places
In the vicinity of the Buschhoven is the route of the former Eifel water pipeline (Eifel Aqueduct), a Roman aqueduct built to supply Cologne with drinking water. The water castle in Morenhoven, the castle of Heimerzheim and the reconciliation church in Buschhoven with its reconditioned romance organ, are worth mentioning.
Parks
Kottenforst-Ville Nature Park, a natural preserve.
Notable residents
Helmuth Prieß
References
External links |
Chertsey Meads is a Local Nature Reserve east of Chertsey in Surrey. It is owned and managed by Runnymede Borough Council.
This is an area of floodplain meadow on the bank of the River Thames. Over 400 plant species have been recorded and 108 bird species, including lesser whitethroat, reed bunting, reed warbler and sedge warbler.
There is access from Mead Lane.
Henry VIII came to Oatlands on a progress and hunted stags on Chertsey Meads in 1514. The stage were held in pens and released one by one. Sir Philip Draycot described the hunt with greyhounds and horsemen with spears, as "the most princely sport that hath been seen".
References
Local Nature Reserves in Surrey |
Kawachi Bankan (Citrus kawachiensis), also called Mishokan and Uwa Gold, is a Citrus hybrid cultivated for its edible fruit.
Genetics
Two varieties of Kawachi Bankan have been identified: one, a hybrid between the ujukitsu (seed parent, Citrus ujukitsu) and an unidentified species (pollen parent), and the other, a hybrid between the yuge-hyoukan (seed parent, Citrus yuge-hyokan) and an unidentified species (pollen parent).
Distribution
It originated and is grown in Japan and is also grown in the United States.
Description
The Kawachi Bankan was first discovered in Kumamoto Prefecture in 1910. Since the 1980s, the acreage growing this fruit has been increasing. The fruits are large, normally weighing and are slightly conical in shape, with most having a nipple at the stem end. They contain few seeds. The rind is thick, somewhat pebbly, and yellow in color; the flesh is also yellow. The flavor is said to be sweet and slightly acidic, and the fruit is very juicy. The tree is densely branched and the leaves are elliptic in shape. The fruit matures late and is shipped at the end of May in Japan.
Chemistry
The peel of the Kawachi Bankan fruit contains many biologically active substances including naringin, narirutin, auraptene, and 3,5,6,7,8,3',4'-heptamethoxyflavone. The dried powder of the peel exerts anti-inflammatory and neuroprotective effects against aging in the brain of mice and ameliorates microglial activation, tau hyperphosphorylation, and suppression of neurogenesis in the hippocampus of senescence-accelerated mice. It also ameliorates DSS-induced body weight loss, colon shortening, increased expression of pro-inflammatory cytokines, and decreased expression of colonic tight junctions in colitic mice.
Confectionery products
A limited-edition flavor of the Japanese candy Hi-Chew is based on the Kawachi Bankan fruit.
See also
List of citrus fruits
Japanese citrus
References
Citrus
Citrus hybrids
Fruit trees
Edible fruits
Japanese fruit
Fruits originating in East Asia
Flora of Japan |
The Lian River () or Lianzhuang River () is a tributary of the Qu River in Yunnan province, southwestern China. The Lian rises in northern Shiping County and flows northwestward into the Eshan Yi Autonomous County. The river then turns northeast, passing Shuangjiang Subdistrict (the county seat of Eshan County), and flows into Qu River. Its total length is approximately .
Notes
Rivers of Yunnan
Geography of Honghe Hani and Yi Autonomous Prefecture
Geography of Yuxi |
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\DatabaseMigrationService;
class DatabaseType extends \Google\Model
{
/**
* @var string
*/
public $engine;
/**
* @var string
*/
public $provider;
/**
* @param string
*/
public function setEngine($engine)
{
$this->engine = $engine;
}
/**
* @return string
*/
public function getEngine()
{
return $this->engine;
}
/**
* @param string
*/
public function setProvider($provider)
{
$this->provider = $provider;
}
/**
* @return string
*/
public function getProvider()
{
return $this->provider;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(DatabaseType::class, 'Google_Service_DatabaseMigrationService_DatabaseType');
``` |
Khirbat al-Duhayriyya was a Palestinian Arab village in the Ramle Subdistrict. It was depopulated during the 1948 Arab-Israeli War on July 10, 1948, by the Givati Brigade under the first phase of Operation Dani. It was located 6 km northeast of Ramla.
History
In 1874 Clermont-Ganneau noted the site, called Kh. edh Dh'heiriyeh, located about half an hour east of Lydda.
In 1882, the PEF's Survey of Western Palestine found at Khurbet edh Dhaheriyeh: "Foundations of buildings, apparently modern. Ruined kubbeh."
British Mandate era
At the time of the 1931 census, the village, called Ez Zuheiriya, had 10 occupied houses and a population of 69 inhabitants, all Muslims.
In the 1945 statistics the village had a population of 100 Muslims. The total land area was 1,341 dunams, of this, a total of 1,224 dunums were used for cereals, 66 dunums were irrigated or used for plantations, while 351 dunams were classified as non-cultivable areas.
1948, aftermath
Khirbat al-Duhayriyya was depopulated on July 10, 1948.
In 1992 the village site was described: "The walls of some ten houses still stand. Otherwise, the village has been reduces to piles of stone rubble interspersed with fig, doum palm, and almond trees, along with thickets of thorn and wild vegetation. The site is fenced in and serves as pasture for animals. Cactuses grow along the northern and southern sides of the site."
References
Bibliography
External links
Welcome To al-Duhayriyya, Khirbat
Khirbat al-Duhayriyya, Zochrot
Survey of Western Palestine, Map 13: IAA, Wikimedia commons
Arab villages depopulated during the 1948 Arab–Israeli War
District of Ramla |
```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 gammainc = require( '@stdlib/math/base/special/gammainc' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var floor = require( '@stdlib/math/base/special/floor' );
var PINF = require( '@stdlib/constants/float64/pinf' );
// MAIN //
/**
* Evaluates the cumulative distribution function (CDF) for a Poisson distribution with mean parameter `lambda` at a value `x`.
*
* @param {number} x - input value
* @param {NonNegativeNumber} lambda - mean parameter
* @returns {Probability} evaluated CDF
*
* @example
* var y = cdf( 2.0, 0.5 );
* // returns ~0.986
*
* @example
* var y = cdf( 2.0, 10.0 );
* // returns ~0.003
*
* @example
* var y = cdf( -1.0, 4.0 );
* // returns 0.0
*
* @example
* var y = cdf( NaN, 1.0 );
* // returns NaN
*
* @example
* var y = cdf( 0.0, NaN );
* // returns NaN
*
* @example
* // Negative mean parameter:
* var y = cdf( 2.0, -1.0 );
* // returns NaN
*/
function cdf( x, lambda ) {
if ( isnan( x ) || isnan( lambda ) || lambda < 0.0 ) {
return NaN;
}
if ( x < 0.0 ) {
return 0.0;
}
if ( lambda === 0.0 ) {
return 1.0;
}
if ( x === PINF ) {
return 1.0;
}
return gammainc( lambda, floor( x ) + 1.0, true, true );
}
// EXPORTS //
module.exports = cdf;
``` |
In computing, NaN (), standing for Not a Number, is a particular value of a numeric data type (often a floating-point number) which is undefined or unrepresentable, such as the result of 0/0. Systematic use of NaNs was introduced by the IEEE 754 floating-point standard in 1985, along with the representation of other non-finite quantities such as infinities.
In mathematics, 0/0 is typically undefined and is therefore represented by NaN in computing systems.
The square root of a negative number is not a real number, and is therefore also represented by NaN in compliant computing systems. NaNs may also be used to represent missing values in computations.
Two separate kinds of NaNs are provided, termed quiet NaNs and signaling NaNs. Quiet NaNs are used to propagate errors resulting from invalid operations or values. Signaling NaNs can support advanced features such as mixing numerical and symbolic computation or other extensions to basic floating-point arithmetic.
Floating point
In floating-point calculations, NaN is not the same as infinity, although both are typically handled as special cases in floating-point representations of real numbers as well as in floating-point operations. An invalid operation is also not the same as an arithmetic overflow (which would return an infinity or the largest finite number in magnitude) or an arithmetic underflow (which would return the smallest normal number in magnitude, a subnormal number, or zero).
IEEE 754 NaNs are encoded with the exponent field filled with ones (like infinity values), and some non-zero number in the significand field (to make them distinct from infinity values); this allows the definition of multiple distinct NaN values, depending on which bits are set in the significand field, but also on the value of the leading sign bit (but applications are not required to provide distinct semantics for those distinct NaN values).
For example, an IEEE 754 single precision (32-bit) NaN would be encoded as
where s is the sign (most often ignored in applications) and the x sequence represents a non-zero number (the value zero encodes infinities). In practice, the most significant bit from x is used to determine the type of NaN: "quiet NaN" or "signaling NaN" (see details in Encoding). The remaining bits encode a payload (most often ignored in applications).
Floating-point operations other than ordered comparisons normally propagate a quiet NaN (qNaN). Most floating-point operations on a signaling NaN (sNaN) signal the invalid-operation exception; the default exception action is then the same as for qNaN operands and they produce a qNaN if producing a floating-point result.
The propagation of quiet NaNs through arithmetic operations allows errors to be detected at the end of a sequence of operations without extensive testing during intermediate stages. For example, if one starts with a NaN and adds 1 five times in a row, each addition results in a NaN, but there is no need to check each calculation because one can just note that the final result is NaN. However, depending on the language and the function, NaNs can silently be removed from a chain of calculations where one calculation in the chain would give a constant result for all other floating-point values. For example, the calculation x0 may produce the result 1, even where x is NaN, so checking only the final result would obscure the fact that a calculation before the x0 resulted in a NaN. In general, then, a later test for a set invalid flag is needed to detect all cases where NaNs are introduced (see Function definition below for further details).
In section 6.2 of the old IEEE 754-2008 standard, there are two anomalous functions (the and functions, which return the maximum and the minimum, respectively, of two operands that are expected to be numbers) that favor numbers — if just one of the operands is a NaN then the value of the other operand is returned. The IEEE 754-2019 revision has replaced these functions as they are not associative (when a signaling NaN appears in an operand).
Comparison with NaN
Comparisons are specified by the IEEE 754 standard to take into account possible NaN operands. When comparing two real numbers, or extended real numbers (as in the IEEE 754 floating-point formats), the first number may be either less than, equal to, or greater than the second number. This gives three possible relations. But when at least one operand of a comparison is NaN, this trichotomy does not apply, and a fourth relation is needed: unordered. In particular, two NaN values compare as unordered, not as equal.
As specified, the predicates associated with the <, ≤, =, ≥, > mathematical symbols (or equivalent notation in programming languages) return false on an unordered relation. So, for instance, is not logically equivalent to : on unordered, i.e. when x or y is NaN, the former returns true while the latter returns false. However, ≠ is defined as the negation of =, thus it returns true on unordered.
From these rules, comparing x with itself, or , can be used to test whether x is NaN or non-NaN.
The comparison predicates are either signaling or non-signaling on quiet NaN operands; the signaling versions signal the invalid-operation exception for such comparisons (i.e., by default, this just sets the corresponding status flag in addition to the behavior of the non-signaling versions). The equality and inequality predicates are non-signaling. The other standard comparison predicates associated with the above mathematical symbols are all signaling if they receive a NaN operand. The standard also provides non-signaling versions of these other predicates. The predicate isNaN(x) determines whether a value is a NaN and never signals an exception, even if x is a signaling NaN.
The IEEE floating-point standard requires that NaN ≠ NaN hold. In contrast, the 2022 private standard of posit arithmetic has a similar concept, NaR (Not a Real), where NaR = NaR holds.
Operations generating NaN
There are three kinds of operations that can return NaN:
Most operations with at least one NaN operand.
Indeterminate forms:
The divisions and .
The multiplications and .
Remainder when is an infinity or is zero.
The additions , and equivalent subtractions and .
The standard has alternative functions for powers:
The standard function and the integer exponent function define , , and as .
The function defines all three indeterminate forms as invalid operations and so returns NaN.
Real operations with complex results, for example:
The square root of a negative number.
The logarithm of a negative number.
The inverse sine or inverse cosine of a number that is less than −1 or greater than 1.
NaNs may also be explicitly assigned to variables, typically as a representation for missing values. Prior to the IEEE standard, programmers often used a special value (such as −99999999) to represent undefined or missing values, but there was no guarantee that they would be handled consistently or correctly.
NaNs are not necessarily generated in all the above cases. If an operation can produce an exception condition and traps are not masked then the operation will cause a trap instead. If an operand is a quiet NaN, and there is also no signaling NaN operand, then there is no exception condition and the result is a quiet NaN. Explicit assignments will not cause an exception even for signaling NaNs.
Quiet NaN
In general, quiet NaNs, or qNaNs, do not raise any additional exceptions, as they propagate through most operations. But the invalid-operation exception is signaled by some operations that do not return a floating-point value, such as format conversions or certain comparison operations.
Signaling NaN
Signaling NaNs, or sNaNs, are special forms of a NaN that, when consumed by most operations, should raise the invalid operation exception and then, if appropriate, be "quieted" into a qNaN that may then propagate. They were introduced in IEEE 754. There have been several ideas for how these might be used:
Filling uninitialized memory with signaling NaNs would produce the invalid operation exception if the data is used before it is initialized
Using an sNaN as a placeholder for a more complicated object, such as:
A representation of a number that has underflowed
A representation of a number that has overflowed
Number in a higher precision format
A complex number
When encountered, a trap handler could decode the sNaN and return an index to the computed result. In practice, this approach is faced with many complications. The treatment of the sign bit of NaNs for some simple operations (such as absolute value) is different from that for arithmetic operations. Traps are not required by the standard. There are other approaches to this sort of problem that would be more portable.
Payload operations
IEEE 754-2019 recommends the operations getPayload, setPayload, and setPayloadSignaling be implemented, standardizing the access to payloads to streamline application use. According to the IEEE 754-2019 background document, this recommendation should be interpreted as "required for new implementations, with reservation for backward compatibility".
Encoding
In IEEE 754 standard-conforming floating-point storage formats, NaNs are identified by specific, pre-defined bit patterns unique to NaNs. The sign bit does not matter. Binary format NaNs are represented with the exponential field filled with ones (like infinity values), and some non-zero number in the significand field (to make them distinct from infinity values). The original IEEE 754 standard from 1985 (IEEE 754-1985) only described binary floating-point formats, and did not specify how the signaling/quiet state was to be tagged. In practice, the most significant bit of the significand field determined whether a NaN is signaling or quiet. Two different implementations, with reversed meanings, resulted:
most processors (including those of the Intel and AMD's x86 family, the Motorola 68000 family, the AIM PowerPC family, the ARM family, the Sun SPARC family, and optionally new MIPS processors) set the signaling/quiet bit to non-zero if the NaN is quiet, and to zero if the NaN is signaling. Thus, on these processors, the bit represents an flag;
in NaNs generated by the PA-RISC and old MIPS processors, the signaling/quiet bit is zero if the NaN is quiet, and non-zero if the NaN is signaling. Thus, on these processors, the bit represents an flag.
The former choice has been preferred as it allows the implementation to quiet a signaling NaN by just setting the signaling/quiet bit to 1. The reverse is not possible with the latter choice because setting the signaling/quiet bit to 0 could yield an infinity.
The 2008 and 2019 revisions of the IEEE 754 standard make formal requirements and recommendations for the encoding of the signaling/quiet state.
For binary interchange formats, the most significant bit of the significand field is exclusively used to distinguish between quiet and signaling NaNs. Moreover, it should be an flag. That is, this bit is non-zero if the NaN is quiet, and zero if the NaN is signaling.
For decimal interchange formats, whether binary or decimal encoded, a NaN is identified by having the top five bits of the combination field after the sign bit set to ones. The sixth bit of the field is the flag. That is, this bit is zero if the NaN is quiet, and non-zero if the NaN is signaling.
For IEEE 754-2008 conformance, the meaning of the signaling/quiet bit in recent MIPS processors is now configurable via the NAN2008 field of the FCSR register. This support is optional in MIPS Release 3 and required in Release 5.
The state/value of the remaining bits of the significand field are not defined by the standard. This value is called the 'payload' of the NaN. If an operation has a single NaN input and propagates it to the output, the result NaN's payload should be that of the input NaN (this is not always possible for binary formats when the signaling/quiet state is encoded by an flag, as explained above). If there are multiple NaN inputs, the result NaN's payload should be from one of the input NaNs; the standard does not specify which.
Function definition
There are differences of opinion about the proper definition for the result of a numeric function that receives a quiet NaN as input. One view is that the NaN should propagate to the output of the function in all cases to propagate the indication of an error. Another view, and the one taken by the ISO C99 and IEEE 754-2008 standards in general, is that if the function has multiple arguments and the output is uniquely determined by all the non-NaN inputs (including infinity), then that value should be the result. Thus for example the value returned by and is +∞.
The problem is particularly acute for the exponentiation function The expressions 00, ∞0 and 1∞ are considered indeterminate forms when they occur as limits (just like ∞ × 0), and the question of whether zero to the zero power should be defined as 1 has divided opinion.
If the output is considered as undefined when a parameter is undefined, then should produce a qNaN. However, math libraries have typically returned 1 for for any real number y, and even when y is an infinity. Similarly, they produce 1 for even when x is 0 or an infinity. The 2008 version of the IEEE 754 standard says that and should both return 1 since they return 1 whatever else is used instead of quiet NaN. Moreover, ISO C99, and later IEEE 754-2008, chose to specify instead of qNaN; the reason of this choice is given in the C rationale: "Generally, C99 eschews a NaN result where a numerical value is useful. ... The result of is +∞, because all large positive floating-point values are even integers."
To satisfy those wishing a more strict interpretation of how the power function should act, the 2008 standard defines two additional power functions: where the exponent must be an integer, and which returns a NaN whenever a parameter is a NaN or the exponentiation would give an indeterminate form.
Integer NaN
Most fixed-size integer formats cannot explicitly indicate invalid data. In such a case, when converting NaN to an integer type, the IEEE 754 standard requires that the invalid-operation exception be signaled. For example in Java, such operations throw instances of . In C, they lead to undefined behavior, but if annex F is supported, the operation yields an "invalid" floating-point exception (as required by the IEEE standard) and an unspecified value.
Perl's package uses "NaN" for the result of strings that do not represent valid integers.
> perl -mMath::BigInt -e "print Math::BigInt->new('foo')"
NaN
Display
Different operating systems and programming languages may have different string representations of NaN.
nan (C, C++, Python)
NaN (ECMAScript, Rust, C#, Julia). Julia may show alternative NaN, depending on precision, NaN32, and NaN16; NaN is for Float64 type.
NaN%
NAN (C, C++, Rust)
NaNQ (IBM XL and AIX: Fortran, C++ proposal n2290)
NaNS (ditto)
qNaN
sNaN
1.#SNAN (Excel)
1.#QNAN (Excel)
-1.#IND (Excel)
+nan.0 (Scheme)
Since, in practice, encoded NaNs have a sign, a quiet/signaling bit and optional 'diagnostic information' (sometimes called a payload), these will occasionally be found in string representations of NaNs, too. Some examples are:
For the C and C++ languages, the sign bit is always shown by the standard-library functions (e.g. ) when present. There is no standard display of the payload nor of the signaling status, but a quiet NaN value of a specific payload may either be constructed by providing the string nan(char-sequence) to a number-parsing function (e.g. ) or by providing the char-sequence string to (or for sNaN), both interpreted in an implementation-defined manner.
GCC and LLVM provides built-in implementations of and . They parse the char-sequence as an integer for (or a differently-sized equivalent) with its detection of integer bases.
The GNU C Library's float-parser uses the char-sequence string in "some unspecified fashion". In practice, this parsing has been equivalent to GCC/LLVM's for up to 64 bits of payload.
Newlib does not implement parsing, but accepts a hexadecimal format without prefix.
musl does not implement any payload parsing.
Not all languages admit the existence of multiple NaNs. For example, ECMAScript only uses one NaN value throughout.
References
Notes
Citations
Standards
External links
Not a Number, foldoc.org
IEEE 754-2008 Standard for Floating-Point Arithmetic
IEEE 754-2019 Standard for Floating-Point Arithmetic
Computer arithmetic
Software anomalies |
Veronika Grygarová (born 12 April 1991) is a Czech deaf female alpine skier. She represented Czech Republic at the Deaflympics in 2007 and 2015.
She made her Deaflympic debut at the 2007 Winter Deaflympics and competed in the women's giant slalom, slalom and Super-G events. Veronika also went onto participate at the 2015 Winter Deaflympics and competed in the women's slalom, giant slalom, Super-G, super combined and downhill events. She claimed her only medal in her Deaflympic career as she claimed a silver medal in the downhill category while the gold medal was claimed by her compatriot, Tereza Kmochová in the relevant event.
References
External links
Veronika Grygarová at Deaflympics
1991 births
Living people
Czech female alpine skiers
Deaf skiers
Czech deaf people
Deaflympic alpine skiers for the Czech Republic
Alpine skiers at the 2015 Winter Deaflympics
Deaflympic silver medalists for the Czech Republic
Medalists at the 2015 Winter Deaflympics |
The Iranian ambassador in Canberra is the official representative of the Government in Tehran to the Government of Australia.
List of representatives
See also
List of ambassadors of Australia to Iran
Iran–Australia relations
References
Ambassadors of Iran to Australia
Australia
Iran |
The Beached Festival was a free festival held annually in Scarborough, North Yorkshire, England. After six years it had become the largest free festival on England's east coast. It last took place in its original format in 2008.
History
The festival started in 2001 as a small gig which gained some interest from local bands and DJs. During the second year The Libertines played without their front man. In 2005 the festival lasted two extra days, one of which was a film night and the other an orchestral night. In 2006 a Big Band played instead of the orchestra.
To fund the festival a small grant was obtained from Scarborough Borough Council and the rest came from corporate sponsorship.
As the festival expanded more popular bands appeared on the beached stage including The Libertines, The Fratellis, Electric Eel Shock (Who appeared in 2003 and then returned in 2005 to play with The West Yorkshire Symphony Orchestra), The Enemy, Thunder, Parva (now the Kaiser chiefs), The Bluetones, The Quireboys and Nine Black Alps between the years 2001 and 2006.
From the 2005 festival onwards, the first evening was a film night, with films such as Little Voice and The Blues Brothers being shown.
2007
2007 saw big name sponsors paying for national media adverts in the NME. The festival was headlined by Nine Black Alps and Inme and included established acts such as Foals, Frank Turner, One Night Only, The Hoosiers, Amy Macdonald, DARTZ!, Alabama 3 and The Paddingtons.
The event was set back slightly by predicted high tides, which forced the 1,500-strong crowd off the beach, onto the road for nearly an hour and a half.
2008
In 2008, One Night Only and Dodgy were the headliners with acts such as The Ryes, Flamboyant Bella, Be Quiet. Shout Loud!, Sergeant, Natty, The Paddingtons and Ebony Bones also appearing. Over 35,000 people walked through the site, with nearly 3,000 people on site at any time. Graham Rhodes, performance poet was the MC for every Beached apart from the first one.
It was alleged a sexual assault occurred at this festival; the organisers cooperated with the North Yorkshire Police investigations, which led to a Crown Court hearing. At the time of the incident, organisers were holding emergency meetings with the concessions and catering firm (who run T in the Park) who were disappointed with the turn-out. The firm packed up on the Saturday night leaving the beach without any catering provisions.
F10, a company who helped raise the funds for the festival to take place, refused to pay the organisers over £30,000 which was gained from sponsorship of the event. This left , the company which ran the festival heavily in debt and it was liquidated in May 2009. Many of volunteers who had run the festival were left out of pocket.
From 2009
In 2009 Scarborough Borough Council and The North Yorkshire Police refused to give permission for the event, partly because of safety and public disorder concerns, and because of financial issues remaining outstanding. The organiser told the press that the event would not be going ahead for personal reasons, although the Scarborough Evening News reported later that had been liquidated, owing £38,000 to various creditors.
Rumours of a 2010 festival started on Facebook when the organiser suggested a date for the festival, but permission was not given and the Open Air Theatre, who were also rumoured to play host to the event did not host it. However, the event was revived at the Open Air Theatre in August 2011, albeit on a smaller scale, and with a charge for entry.
See also
List of music festivals in the United Kingdom
Festivals in the United Kingdom
References
External links
Official Beached website
SCARBOROUGH BEACH FESTIVAL: SEX ASSAULT | The Missing List
Rock festivals in England
Scarborough, North Yorkshire
Music festivals in North Yorkshire |
A course evaluation is a paper or electronic questionnaire, which requires a written or selected response answer to a series of questions in order to evaluate the instruction of a given course. The term may also refer to the completed survey form or a summary of responses to questionnaires.
They are a means to produce feedback which the teacher and school can use to assess their quality of instruction. The process of (a) gathering information about the impact of learning and of teaching practice on student learning, (b) analyzing and interpreting this information, and (c) responding to and acting on the results, is valuable for several reasons. They enable instructors to review how others interpret their teaching methods. The information can be also used by administrators, along with other input, to make summative decisions (e.g., decisions about promotion, tenure, salary increases, etc.) and make formative recommendations (e.g., identify areas where a faculty member needs to improve). Typically, these evaluations are combined with peer evaluations, supervisor evaluations, and results of student’s test scores to create an overall picture of teaching performance. Course evaluations are implemented in one of two ways, either summative or formative.
Course evaluation instruments
Course evaluation instruments generally include variables such as communication skills, organizational skills, enthusiasm, flexibility, attitude toward the student, teacher – student interaction, encouragement of the student, knowledge of the subject, clarity of presentation, course difficulty, fairness of grading and exams, and global student rating.
Summative evaluation
Summative evaluation occurs at the end of a semester, usually a week or two before the last day of class. The evaluation is performed by the current students of the class. Students have the option to reflect on the teachers’ instruction without fear of punishment because course evaluations are completely confidential and anonymous. This can be done in one of two ways; either with a paper form or with online technology. Typically, in a paper based format, the paper form is distributed by a student while the teacher is out of the room. It is then sealed in an envelope and the teacher will not see it until after final grades are submitted. The online version can be identical to a paper version or more detailed, using branching question technology to glean more information from the student. Both ways allow the student to be able to provide feedback. This feedback is to be used by teachers to assess the quality of their instruction. The information can also be used to evaluate the overall effectiveness of a teacher, particularly for tenure and promotion decisions.
Formative evaluation
Formative evaluation typically occurs when changes can take place during the current semester, although many institutions consider written comments on how to improve formative as well. Typically this form of evaluation is performed by peer consultation. Other experienced teachers will review one of their peer’s instructions. The purpose of this evaluation is for the teacher to receive constructive criticism on teaching. Generally, peer teachers will sit in on a few lessons given by the teacher and take notes on their methods. Later on the team of peer teachers will meet with the said teacher and provide useful, non-threatening feedback on their lessons. The peer team will offer suggestions on improvement, which the said teacher can choose to implement.
Peer feedback is given to the instructor typically in the form of an open session meeting. The peers first reflect on the qualities that were good in the instruction. Then they move on to areas that need improvement. Next the instructor will make suggestions for improvement and receive feedback on those ideas.
Student feedback can be an important part of formative evaluation. Student evaluations are formative when their purpose is to help faculty members improve and enhance their teaching skills. The teachers may require their students to complete written evaluation, participate in ongoing dialogue or directed discussions during the course of the semester. The use of a 'Stop, Start Continue' format for student feedback has been shown to be highly effective at generating constructive feedback for course improvement.
At the Faculty of Psychology of the University of Vienna, Twitter was used for formative course evaluation.
Criticism of course evaluations as measures of teaching effectiveness
Summative student evaluations of teaching (SETs) have been widely criticized, especially by teachers, for not being accurate measures of teaching effectiveness. Surveys have shown that a majority of teachers believe that a teacher's raising the level of standards and/or content would result in worse SETs for the teacher, and that students in filling out SETs are biased in favor of certain teachers' personalities, looks, disabilities, gender and ethnicity. The evidence that some of these critics cite indicates that factors other than effective teaching are more predictive of favorable ratings. In order to get favorable ratings, teachers are likely to present the content which can be understood by the slowest student. Consequently, the content has been affected. Many of those who are critical of SETs have suggested that they should not be used in decisions regarding faculty hires, retentions, promotions, and tenure. Some have suggested that using them for such purposes leads to the dumbing down of educational standards. Others have said that the typical way SETs are now used at most universities is demeaning to instructors and has a corrupting effect on students' attitudes toward their teachers and higher education in general.
The economics of education literature and the economic education literature is especially critical. For example, Weinberg et al. (2009) finds SET scores in first-year economics courses at Ohio State University are positively related to the grades instructors assign but are unrelated to learning outcomes once grades are controlled for. Others have also found a positive relationship between grades and SET scores but unlike Weinberg et al. (2009) do not directly address the relationship between SET scores and learning outcomes. A paper by Krautmann and Sander (1999) find that the grades students expect to receive in a course are positively related to SET scores. Isely and Singh (2005) find it is the difference between the grades students expect to receive and their cumulative GPA that is the relevant variable for obtaining favourable course evaluations. Another paper by Carrell and West (2010) use a data set from the U.S. Air Force Academy where students are randomly assigned to course sections (reducing selection problems). It found that calculus students got higher marks on common course examinations when they had instructors with high SET scores but did worse when they took later courses requiring calculus. The authors discuss a number of possible explanations for this finding, including that instructors with higher SET scores may have concentrated their teaching on the common examinations in the course rather than giving students a deeper understanding for later courses. Hamermesh and West (2005) find that students at the University of Texas at Austin gave attractive instructors higher SET scores than less attractive instructors. However, the authors conclude that it may not be possible to determine if attractiveness increases the effectiveness of an instructor, possibly resulting in better learning outcomes. It may be the case that students pay more attention to attractive instructors. Meanwhile, a 2017 lawsuit was filed on grounds of xenophobic discrimination in course evaluations at the University of Kansas, with Peter F. Lake, the director of Stetson University's Center for Excellence in Higher Education Law and Policy, suggesting this is no isolated incident.
The empirical economics literature is in sharp contrast to the educational psychology literature which generally argues that teaching evaluations are a legitimate method of evaluating instructors and are unrelated to grade inflation. However, similar to the economic literature other researchers outside of educational psychology have offered negative findings on course evaluations. For example, some papers have examined online course evaluations and found them to be heavily influenced by the instructor’s attractiveness and willingness to give high grades in return for very little work.
Another criticism of these assessment instruments is that largely the data they produce are difficult to interpret for purposes of self- or course-improvement, given the number of variables that can affect evaluation scores. Finally, paper based course evaluations can cost a university thousands of dollars over the years, while an electronic survey is offered at minimal cost to the university.
Another concern that has been raised by instructors is that response rates to online course evaluations are lower (and therefore the results may be less valid) than paper-based in class evaluations. The situation is more complex that response rates alone would indicate. Student-faculty engagement is offered as an explanation, where course level, instructor rank, and other variables lacked explanatory power.
See also
Educational assessment
Educational evaluation
Donald Kirkpatrick, founder of the 'Four Level Model' of training evaluation
Ronald Ferguson (economist), a researcher who studied student evaluation of teachers
References
External links
Weinstock, R. B. (2004). Quality control in the course evaluation process.
Educational personnel assessment and evaluation |
Hydroxymatairesinol (HMR) is a lignan found in Norway spruce (Picea abies). It is an enterolactone precursor with anticancer activities. In rats, HMR decreased the volume of induced tumours and stabilised established tumours, as well as preventing the development of new tumours. It has also shown anti-oxidant properties in vitro.
HMR's chemical structure is similar to matairesinol. At high concentrations, HMR has estrogenic properties, which are considerably weaker than those of estradiol.
References
Lignans
Methoxy compounds
Furanones |
Ho is a village in southwestern Jutland in the Varde Municipality, in Region of Southern Denmark. Many tourists, especially Germans, visit the village primarily because of the nature of the area. It is 7 kilometers from Blåvand, 11 kilometers from Oksbøl and 32 from Esbjerg.
Etymology
Ho is linked to Ho Bugt. Ho is derived from Hõi, which means trough or cart. Ho can therefore be translated into "the fjord that looks like a trough".
See also
List of short place names
Bibliography
References
Cities and towns in the Region of Southern Denmark
Varde Municipality |
Work People's College () was a radical labor college (a type of a folk high school governed by the worker's movement) established in Smithville (Duluth), then a suburb of Duluth, Minnesota, in 1907 by the Finnish Socialist Federation of the Socialist Party of America. School administrators and faculty were sympathetic to the syndicalist left wing of the Finnish labor movement and the institution came into the orbit of the Industrial Workers of the World during the 1914-1915 factional battle that split the Finnish Federation. The school ceased operation in 1941.
In 2012 the Twin Cities branch of the Industrial Workers of the World relaunched Work People's College on a limited basis as a summer training camp for the group's activists and organizers.
Institutional history
Forerunner
Finnish immigrants to the United States during the first years of the 20th Century tended to be a literate community, with 97% of those arriving between 1899 ad 1907 knowing how to read and write. Education was a valued part of Finnish immigrant life and the desire for institutions of higher learning in their own language extended across generational and ideological boundaries. As early as 1900 there were discussions about establishing a school that would provide a liberal alternative to Suomi College and Seminary of Hancock, Michigan.
Work People's College was preceded by a "folk" high school of the Finnish Evangelical Lutheran Church of America that was founded in Minneapolis in September 1903. The school was launched with a view to teaching the Finnish language and Lutheran religion to its students. Finnish immigrants in this period constituted nearly 40 percent of the population of Northern Minnesota, with a goodly number of these working in the mining and timber industries or on the docks of Duluth, a major port on the southernmost tip of Lake Superior.
The Finnish Lutheran high school moved to Smithville, a rural area just southwest of Duluth, a few months after its establishment. It changed its name to the Finnish People's College and Theological Seminary in January 1904, a name change which reflected the institution's desire to serve both general educational and seminarian needs of the community. Money was raised to fund the school's purchase of a three story building through the sale of shares of stock. A board of directors controlled the operations of the institution, which included both anti-socialist clerics and pro-socialist lay members of the church. In an intense economic and political environment, marked by labor strikes and the emergence of the Finnish Socialist Federation among the immigrant community, these factions vied for control of the school.
The students of the Finnish People's College and Theological Seminary resisted the school's educational regime, which imposed mandatory prayer while forbidding discussion of social issues. This led to a strike of the student body in the Fall of 1904, with all but two students walking out of a mandatory prayer meeting in protest. The director of the school, E.W. Saranen, subsequently resigned his post as a result of the students' action.
Establishment
With enrollment tailing off, the board of directors initially considered closing the school but found financial rescue through the sale of stock in the institution at the rate of $1.00 per share. Frustrated by the lack of advanced secular education in their own language, the Finnish Socialist Federation (FSF) became actively involved buying stock at the behest of board member Alex Halonen. By the fall of 1907 majority control of the stock of the Finnish People's College was firmly ensconced in Socialist hands. The Socialists then made use of their majority ownership to assert control over the composition of the school's board of directors.
As a reflection of the institution's shift to secular labor education a new name was chosen for the institution — Työväen Opisto (Workers' College), most commonly albeit clumsily rendered into English as Work People's College. K.L. Haataja served as director and instructor. Leo Laukki assumed leadership in 1908. The new labor school was launched with just 8 students during the initial year, with the student body growing in the 1910-11 academic year at over 100 students. The class of 1912-13 was
136 students, of whom 33 were women. To this was added another group of students who participated in coursework through postal correspondence.
The Finnish Socialist Federation agreed to take on Work People's College as its own institution at the group's 1908 convention. For the next several years ever member of the Federation paid an additional tax of $1.00 per year for support of the school in addition to their regular payment of monthly dues. The 1912 convention of the FSF voted to reduce this subsidy to 50 cents per member per year, at the same time adding its opinion that the school's curriculum should be tailored to the needs of future socialist and trade union activists rather than to a general course of study. The school also charged a tuition of its students, which included room and board. Students in the 1912-13 academic year paid $20 per month for tuition, room, and board, an amount which was hiked to $22 for the 1913-14 term of study.
Work People's College taught its students a mandatory preparatory program including economics, politics, history, and "socialist program and tactics." Students could then continue with more specialized coursework, including courses in bookkeeping, basic mathematics, and the Finnish and English languages. Others continued on the academic path to become socialist orators and party functionaries, studying Marxist theoretical works in English and Finnish.
A severe ideological split divided the Finnish Socialist movement during the middle years of the 1910s, with one part of the FSF staying with the Socialist Party of America and another more radical offshoot casting its lot with the syndicalist Industrial Workers of the World. Work People's College was retained by the later faction.
Work People's College was a resident labor college, housing its students on-site. Other similar schools included Brookwood Labor College at Katonah, New York and Commonwealth College of Mena, Arkansas.
Termination
There were roughly 30 students during the final year of operation in 1940-41.
One building of the former Work People's College still stands at 402 S. 88th Ave. West in Duluth and houses eleven apartments.
Legacy
Beginning in the summer of 2012, the Twin Cities General Membership Branch of the Industrial Workers of the World in partnership with IWWs from around the country restarted the Work People's College, hosting a 5-day retreat bringing together nearly 100 rank and file organizers from around North America.
Notable faculty and alumni
Leo Laukki
Amelia Milka Sablich
Yrjö Sirola
Fred Thompson
August Wesley
Niilo Wälläri
See also
Highlander Folk School
Tie Vapauteen
Rand School of Social Science (1906)
Work People's College (1907)
Brookwood Labor College (1921)* New York Workers School (1923):
New Workers School (1929)
Jefferson School of Social Science (1944)
Highlander Research and Education Center (formerly Highlander Folk School) (1932)
Commonwealth College (Arkansas) (1923-1940)
Southern Appalachian Labor School (since 1977)
San Francisco Workers' School (1934)
California Labor School (formerly Tom Mooney Labor School) (1942)
Continuing education
Los Angeles People's Education Center
Citations and references
Cited sources and further reading
Richard J. Altenbaugh, Education for Struggle: The American Labor Colleges of the 1920s and 1930s. Philadelphia, PA: Temple University Press, 1990.
Richard J. Altenbaugh, "Workers' Education as Counter Hegemony: The Educational Process at Work People's College, 1907-1941," Syracuse University.
E.E. Cummins, "Workers' Education in the United States," Social Forces, vol. 14, no. 4 (May 1936), pp. 597–605. In JSTOR
Gary Kaunonen, Challenge Accepted: A Finnish Immigrant Response to Industrial America in Michigan's Copper Country. East Lansing, MI: Michigan State University Press, 2010.
Peter Kivisto, Immigrant Socialists in the United States: The Case of Finns and the Left. Rutherford, NJ: Farleigh Dickinson University Press, 1984.
Auvo Kostiainen, "Work People's College: An American Immigrant Institution," Scandinavian Journal of History, vol. 5, issue 1-4 (1980), pp. 295–309.
Douglas Ollila, Jr., The Emergence of Radical Industrial Unionism in the Finnish Socialist Movement. Turku, Finland: Institute of General History Publication, 1975.
Douglas Ollila, Jr., "From Socialism to Industrial Unionism (IWW): Social Factors in the Emergence of Left-labor Radicalism Among Finnish Workers on the Mesabi, 1911-19," in Michael Karni, et al. (eds.), The Finnish Experience in the Western Great Lakes Region: New Perspectives. Turku, Finland: Institute for Migration, 1975.
Douglas Ollila, Jr., A Time of Glory: Finnish-American Radical Industrial Unionism, 1914-1917. Turku, Finland: Institute of History Publication, 1977.
Douglas Ollila, Jr., "The Work People's College: Immigrant Education for Adjustment and Solidarity," in Michael Karni and Douglas Ollila (eds.), For the Common Good. Superior, WI: Työmies Society, 1977.
Saku Pinta, "Educate, Organize, Emancipate!: The Work People’s College and The Industrial Workers of the World," in Robert H. Howarth (ed.), Anarchist Pedagogies: Collective Actions, Theories, and Critical Reflections on Education. Oakland, CA: PM Press, 2012.
External links
Finding aid for the Work People's College is available at the Immigration History Research Center Archives at the University of Minnesota.
Universities and colleges established in 1907
1941 disestablishments in Minnesota
Labor schools
Industrial Workers of the World in Minnesota
Education in Duluth, Minnesota
Finnish-American history
Finnish-American culture in Minnesota
1907 establishments in Minnesota |
Calliomorpha cyanoptera is a species of beetle in the family Cerambycidae, and the only species in the genus Calliomorpha. It was described by Lane in 1973.
References
Calliini
Beetles described in 1973
Monotypic Cerambycidae genera |
The Kearney Micropolitan Statistical Area, as defined by the United States Census Bureau, is an area consisting of two counties in Nebraska, anchored by the city of Kearney.
As of the 2010 census, the area had a population of 52,591 (though a July 1, 2011 estimate placed the population at 53,278).
Counties
Buffalo
Kearney
Communities
Places with 25,000 or more inhabitants
Kearney (Principal City)
Places with 1,000 to 5,000 inhabitants
Gibbon
Holdrege
Minden
Ravenna
Shelton
Places with 500 to 1,000 inhabitants
Bertrand
Elm Creek
Places with less than 500 inhabitants
Amherst
Atlanta
Axtell
Funk
Heartwell
Loomis
Miller
Norman
Pleasanton
Riverdale
Wilcox
Unincorporated places
Buda
Keene
Lowell
Newark
Townships
Anderson
Armada
Beaver
Blaine
Cedar
Center (Buffalo County)
Center (Phelps County)
Cherry Creek
Collins
Cosmo
Cottonwood
Divide (Buffalo County)
Divide (Phelps County)
Eaton
Elm Creek
Gardner
Garfield (Buffalo County)
Garfield (Phelps County)
Gibbon
Grant (Buffalo County)
Grant (Kearney County)
Harrison
Hayes
Industry-Rock Falls
Laird
Lake
Liberty
Lincoln
Logan (Buffalo County)
Logan (Kearney County)
Loup
Lowell
May
Mirage
Newark
Odessa
Oneida
Platte
Prairie
Riverdale
Rusco
Sartoria
Schneider
Scott
Sharon
Shelton
Sheridan
Sherman
Thornton
Union
Valley
Westmark
Westside
Williamsburg
Demographics
As of the census of 2000, there were 49,141 people, 18,573 households, and 12,129 families residing within the μSA. The racial makeup of the μSA was 95.55% White, 0.49% African American, 0.31% Native American, 0.62% Asian, 0.03% Pacific Islander, 2.03% from other races, and 0.98% from two or more races. Hispanic or Latino of any race were 4.34% of the population.
The median income for a household in the μSA was $38,015, and the median income for a family was $45,562. Males had a median income of $30,085 versus $21,029 for females. The per capita income for the μSA was $17,814.
Future development
Today, some area officials are proposing to upgrade to a metropolitan area with the addition of Phelps County in the future.
See also
Nebraska census statistical areas
References
Buffalo County, Nebraska
Kearney County, Nebraska |
Orzechówka is a village in the administrative district of Gmina Bodzentyn, within Kielce County, Świętokrzyskie Voivodeship, in south-central Poland. It lies approximately north-west of Bodzentyn and north-east of the regional capital Kielce.
References
Villages in Kielce County |
```xml
import {
Environment,
EnvironmentId,
} from '@/react/portainer/environments/types';
import { EnvironmentGroup } from '@/react/portainer/environments/environment-groups/types';
import { RbacRole } from '../types';
import { Team, TeamId } from '../../teams/types';
export class AccessViewerPolicyModel {
EndpointId: EnvironmentId;
EndpointName: string;
RoleId: RbacRole['Id'];
RoleName: RbacRole['Name'];
RolePriority: RbacRole['Priority'];
GroupId?: EnvironmentGroup['Id'];
GroupName?: EnvironmentGroup['Name'];
TeamId?: TeamId;
TeamName?: Team['Name'];
AccessLocation: string;
constructor(
policy: { RoleId: RbacRole['Id'] },
endpoint: Environment,
roles: Record<RbacRole['Id'], RbacRole>,
group?: EnvironmentGroup,
team?: Team
) {
this.EndpointId = endpoint.Id;
this.EndpointName = endpoint.Name;
this.RoleId = policy.RoleId;
this.RoleName = roles[policy.RoleId].Name;
this.RolePriority = roles[policy.RoleId].Priority;
if (group) {
this.GroupId = group.Id;
this.GroupName = group.Name;
}
if (team) {
this.TeamId = team.Id;
this.TeamName = team.Name;
}
this.AccessLocation = group ? 'environment group' : 'environment';
}
}
``` |
USS Western Front (ID-1787) was a steel-hulled cargo ship which saw service as an auxiliary with the United States Navy in World War I. Initially named Martha Washington, she was laid down for mercantile service as Nikkosan Maru, but following America's entry into the war, was requisitioned by the United States Shipping Board and commissioned into the U.S. Navy as the supply ship USS Indiana. This name was also quickly dropped however, in favour of USS Western Front.
Western Front completed several supply missions to France during the war. After decommissioning, she was placed into merchant service as SS Western Front. Less than two years later, the ship was lost in a maritime accident off Bishop Rock, United Kingdom.
Construction and design
Western Front was initially given the name Martha Washington by the builder, the Skinner & Eddy Corporation of Seattle, Washington, but was eventually laid down, on 25 May 1917 at the company's Plant No. 1, as Nikkosan Maru for the Japanese company Mitsui.
On 3 August 1917, in an emergency wartime measure, the United States Shipping Board requisitioned all vessels of over 2,500 deadweight tons currently under construction in the United States, and Nikkosan Maru thus passed into the ownership of the U.S. government. The ship was launched on 15 September and completed 20 October, having spent a total of 150 days (122 working days) under construction. After completion, the vessel was renamed Indiana.
Indiana had a design deadweight tonnage of 8,800, and a gross register tonnage of 5,742 tons. The ship had an overall length of 423 feet 9 inches, a beam of 54 feet and a draft of 24 feet 2 inches. She was powered by a Curtis geared turbine driving a single screw propeller, delivering a service speed of about 11.5 knots.
These specifications are identical to those of the later USSB Design 1013 standard, a design originating from the Skinner & Eddy Corporation itself, and it is likely that Indiana was similar if not identical to the 1013s later produced by the company. However, Indiana was never formally designated a Design 1013. For wartime service, the ship was fitted with one 4"/50 caliber and one 6-pounder gun.
Service history
U.S. Navy service, 1918-1919
Following her completion, Indiana steamed to the East Coast where she was inspected by the Navy on 16 September and acquired shortly thereafter. On 11 May 1918, the vessel was placed into commission for operation with the Naval Overseas Transportation Service (NOTS) as USS Indiana (ID 1787), but within a few days, her name was changed again, to USS Western Front. The ship would retain the name Western Front for the remainder of her brief career. Her first commander was Lt. Comdr. John Burns, USNRF.
Taking on board a cargo of steel rails, ordnance equipment, and ten locomotives, Western Front began her first passage to France on 17 May, but on the 23rd suffered a collision in convoy which sank the British cargo ship Clan Matheson. Western Front survived the collision, but was too badly damaged to continue the voyage and was forced to return to New York for temporary repairs. On 6 June she resumed the passage to France, arriving at St. Nazaire on the 22nd and discharging her cargo there. She then returned to New York, where she was drydocked at Robbins Drydock, Brooklyn, for more permanent repairs.
Western Front subsequently made four more voyages carrying cargoes for NOTS to the French ports of Bordeaux, La Pallice, Quiberon, and Brest. On one run in the spring of 1919, she delivered 26 Army tanks to New York. Returning from the last of these voyages on 2 August 1919, Western Front was decommissioned on 15 August at Newport News, Virginia and returned to the Shipping Board on the same day.
Loss in merchant service
Western Front was subsequently placed into mercantile service as SS Western Front. Her career was not to last much longer however. On 23 June 1921, Western Front departed Jacksonville, Florida bound for London and Hamburg with a cargo of naval stores, rosin and turpentine. On 11 July, about 10 miles south of Bishop Rock, Isles of Scilly, a fire broke out which could not be contained and an explosion occurred. Most of the crew were rescued by the steamer British Earl.
References
Bibliography
Books
Hurley, Edward N. (1920): The New Merchant Marine, p. 39, The Century Co., New York.
Pacific Ports Inc. (1919): Pacific Ports Annual, Fifth Edition, 1919, pp. 64-65, 402-405, Pacific Ports Inc.
Silverstone, Paul H. (2006): The New Navy, 1883-1922, Routledge, .
Journals
McKellar, Norman L. (1962): "Steel Shipbuilding under the U.S. Shipping Board, 1917-1921 - The Requisitioned Ships", The Belgian Shiplover, No. 88, July–August 1962, pp. 389-390. Reproduced at shipscribe.com, here.
1917 ships
Design 1013 ships
Ships built by Skinner & Eddy
World War I auxiliary ships of the United States
Merchant ships of the United States |
Limisa (today Aïn-Lemsa) is a town and archaeological site in Kairouan Governorate, Tunisia. It is located 50 kilometers west of kairouan. The town was a Roman Catholic diocese.
The street pattern of the village is fairly regular in its layout and terrace fields move down the hill from the town to the nearby wadi Oued Maarouf. The Parc National Djebel Serj is to the north of the town, but the town is best known for the ruins of a Byzantine fort known as Ksar Lemsa. The Cave Mine is nearby.
History
During antiquity, Limisa was a Roman-Berber civitas in the province of Byzacena. The remains of the town have been identified with ruins at Henchir-Boudja near modern Limisa.
Little is known of the ancient Roman city of Limisa. A few excavations have been carried out and only the Byzantine citadel and the small Roman theater are known. The municipal organization is also only slightly understood, as epigraphic evidence indicates Roman-dominated Limisa was initially governed by the Punic-style dual magistracy, the sufetes. An epigraphic corpus makes it possible to understand some aspects of the city from the architectural point of view as well as from its organization. The city had the status of civitas at least until the beginning of the reign of the emperor Septimius Severus then as a Municipium sometime before 208.
From an architectural point of view, epigraphy mentions an arch and the restoration of thermal baths built under Constantine at the end of the 4th century.
According to Victor of Vita the basilicas of Lemsa had been burned in 305.
The site was excavated between 1966 and 1969 by K. Belkhodja.
Ksar Lemsa
At Henchir-Boudja may be the ruins of a Byzantine fortress, with 15 feet wide walls and towers.
References
Ancient Berber cities
Catholic titular sees in Africa
Roman towns and cities in Tunisia |
The submucosa (or tela submucosa) is a thin layer of tissue in various organs of the gastrointestinal, respiratory, and genitourinary tracts. It is the layer of dense irregular connective tissue that supports the mucosa (mucous membrane) and joins it to the muscular layer, the bulk of overlying smooth muscle (fibers running circularly within layer of longitudinal muscle).
The submucosa (sub- + mucosa) is to a mucous membrane what the subserosa (sub- + serosa) is to a serous membrane.
Structure
Blood vessels, lymphatic vessels, and nerves (all supplying the mucosa) will run through here. In the intestinal wall, tiny parasympathetic ganglia are scattered around forming the submucous plexus (or "Meissner's plexus") where preganglionic parasympathetic neurons synapse with postganglionic nerve fibers that supply the muscularis mucosae. Histologically, the wall of the alimentary canal shows four distinct layers (from the lumen moving out): mucosa, submucosa, muscularis externa, and either a serous membrane or an adventitia.
In the gastrointestinal tract and the respiratory tract the submucosa contains the submucosal glands that secrete mucus.
Clinical significance
Identification of the submucosa plays an important role in diagnostic and therapeutic endoscopy, where special fibre-optic cameras are used to perform procedures on the gastrointestinal tract. Abnormalities of the submucosa, such as gastrointestinal stromal tumors, usually show integrity of the mucosal surface.
The submucosa is also identified in endoscopic ultrasound to identify the depth of tumours and to identify other abnormalities. An injection of dye, saline, or epinephrine into the submucosa is imperative in the safe removal of certain polyps.
Endoscopic mucosal resection involves removal of the mucosal layer, and in order to be done safely, a submucosal injection of dye is performed to ensure integrity at the beginning of the procedure.
Female uterine submucosal layers are liable to develop fibroids during pregnancy and are often excised upon discovery.
Small intestinal submucosa
Small intestinal submucosa (SIS) is submucosal tissue in the small intestines of vertebrates. SIS is harvested (typically from pigs) for transplanted structural material in several clinical applications, typically biologic meshes. They have low immunogenicity. Some uses under investigation include a scaffold for intervertebral disc regeneration.
Unlike other scaffold materials, the resorbable SIS extracellular matrix (SIS-ECM) scaffold is replaced by well-organized host tissues, including differentiated skeletal muscle.
History
A scientific article published in March 2018 proposed a revision of the anatomical definition of the submucosa. They first saw a non compact tissue which should be submucosa using a technology called endomicroscopy. They hypothesised that the submucosa was not compact as it was previously seen on histological analysis but form a reticular pattern. To confirm their findings, they performed fixed samples of bile duct into a freezing media in order to conserve the shape of the submucosa. They then performed a histological analysis and with several staining technics, they described the submucosa as a network of collagenous bands separating open, formerly fluid-filled spaces. Theses spaces are bordered by fibroblast-like cells CD34 positive. However, these cells are devoid of ultrastructural features indicative of endothelial differentiation, including pinocytotic vesicles and Weibel-Palade bodies.
Additional images
References
Membrane biology
Digestive system |
Phys.org is an online science, research and technology news aggregator offering briefs from press releases and reports from news agencies. Phys.org is one of the most updated science websites, with an average of 98 posts per day. It is part of the Science X network of websites, headquartered on the Isle of Man, United Kingdom.
See also
EurekAlert!
Science Daily
Churnalism
References
External links
British news websites
Technology websites
British technology news websites
News aggregators
British science websites
Internet properties established in 2004 |
```xml
<vector xmlns:android="path_to_url"
xmlns:tools="path_to_url"
android:width="496dp"
android:height="512dp"
android:viewportWidth="496.0"
android:viewportHeight="512.0"
tools:keep="@drawable/fa_expeditedssl">
<path
android:fillColor="#FFFFFFFF"
android:pathData="M248,43.4C130.6,43.4 35.4,138.6 35.4,256S130.6,468.6 248,468.6 460.6,373.4 460.6,256 365.4,43.4 248,43.4zM150.6,176.3c0,-53.7 43.7,-97.4 97.4,-97.4s97.4,43.7 97.4,97.4v26.6c0,5 -3.9,8.9 -8.9,8.9h-17.7c-5,0 -8.9,-3.9 -8.9,-8.9v-26.6c0,-82.1 -124,-82.1 -124,0v26.6c0,5 -3.9,8.9 -8.9,8.9h-17.7c-5,0 -8.9,-3.9 -8.9,-8.9v-26.6zM389.7,380c0,9.7 -8,17.7 -17.7,17.7L124,397.7c-9.7,0 -17.7,-8 -17.7,-17.7L106.3,238.3c0,-9.7 8,-17.7 17.7,-17.7h248c9.7,0 17.7,8 17.7,17.7L389.7,380zM141.7,242.7v132.9c0,2.5 -1.9,4.4 -4.4,4.4h-8.9c-2.5,0 -4.4,-1.9 -4.4,-4.4L124,242.7c0,-2.5 1.9,-4.4 4.4,-4.4h8.9c2.5,0 4.4,1.9 4.4,4.4zM283.4,291.4c0,13 -7.2,24.4 -17.7,30.4v31.6c0,5 -3.9,8.9 -8.9,8.9h-17.7c-5,0 -8.9,-3.9 -8.9,-8.9v-31.6c-10.5,-6.1 -17.7,-17.4 -17.7,-30.4 0,-19.7 15.8,-35.4 35.4,-35.4s35.5,15.8 35.5,35.4zM248,8C111,8 0,119 0,256s111,248 248,248 248,-111 248,-248S385,8 248,8zM248,486.3C121,486.3 17.7,383 17.7,256S121,25.7 248,25.7 478.3,129 478.3,256 375,486.3 248,486.3z"/>
</vector>
``` |
Wausau ( ) is a city in and the county seat of Marathon County, Wisconsin, United States. The Wisconsin River divides the city into east and west. The city's suburbs include Schofield, Weston, Mosinee, Maine, Rib Mountain, Kronenwetter, and Rothschild.
As of the 2020 census, Wausau had a population of 39,994. It is the core city of the Wausau Metropolitan Statistical Area (MSA), which includes all of Marathon County and had a population of 134,063 at the 2010 census.
History
Founding
This area has for millennia changed hands between various indigenous peoples. The historic Ojibwe (also known in the United States as the Chippewa) occupied it in the period of European encounter. They had a lucrative fur trade for decades with French colonists and French Canadians. After the French and Indian War this trade was dominated by British-American trappers from the eastern seaboard.
The Wisconsin River first drew European-American settlers to the area during the mid-19th century as they migrated west into the Great Lakes region following construction of the Erie Canal in New York State. This provided a route for products from the region to the large New York and other eastern markets. The area had been called "Big Bull Flats" or "Big Bull Falls" by French explorers, who were the first Europeans here. They named it for the long rapids in the river, which created many bubbles, called bulle in French. By an 1836 treaty with the United States, the Ojibwe ceded much of their lands in the area to federal ownership. It was sold to non-Native peoples. Wausau, from Ojibwe “waasa”, means "a faraway place".
George Stevens, the namesake of the city of Stevens Point south of Wausau, began harvesting the pine forests for lumber in 1840 and built a saw mill. Lumbering was the first major industry in this area, and other sawmills along the Wisconsin River were quickly constructed by entrepreneurs. By 1846, Walter McIndoe arrived and took the lead in the local business and community. His efforts helped to establish Marathon County in 1850. Word of Stevens's success in the region spread across the country throughout the logging industry. Loggers came from Cortland County, New York, Carroll County, New Hampshire, Orange County, Vermont and Down East Maine in what is now Washington County, Maine and Hancock County, Maine. These were "Yankee" migrants, descended from the English Puritans who settled New England during the 1600s.
Early settlers
By 1852, Wausau had been established as a town and continued to grow and mature. German immigration into the area following the Revolutions of 1848 in the German states brought more people, and by 1861, the settlement was incorporated as a village.
Churches, schools, industry and social organizations began to flourish. The state granted the city a charter in 1872, and elections are held the first Tuesday in April. The residents elected August Kickbusch as their first mayor in 1874. Five years earlier, Kickbusch had returned to his homeland of Germany and brought back with him 702 people, all of whom are believed to have settled in the Wausau area. Kickbusch founded the A. Kickbusch Wholesale Grocery Company, a family business carried on by his grandson, August Kickbusch II. In 1917, August Kickbusch II purchased a modest four-square-style house at 513 Grant Street. He undertook extensive additions, adding two sun rooms, arcaded windows, a tiled porch in the Mediterranean style, a formal classical entrance, and ornate custom-designed chimney crowns. The home is on the National Register of Historic Places as part of the Andrew Warren Historic District.
When the railroad arrived in 1874, Wausau became more accessible to settlers and industry. This enabled the city to develop alternatives to the lumber industry, which was in decline since the clear-cutting of many forests. By 1906 the lumber was gone, but the city continued to grow and flourish. Other villages and towns in the area declined because of over-harvesting of the forests and lumber mills closed down.
Twentieth century
Wausau's favorable location on the Wisconsin River was partly responsible for its survival. The economy was diversified in the early 20th century, led by Employers Insurance of Wausau, now a part of Liberty Mutual. Its logo, first introduced in 1954, was the downtown Milwaukee Road railroad depot set against the backdrop of the community's skyline.
The Wall Street Crash of 1929 had a major effect on the Wausau area. Many industries were forced to cut back by laying off and dismissing workers or by closing altogether. After decades of growth, the city virtually ground to a halt. But after World War II—Wausau was significantly modernized—and it continued to grow in industry, education, recreation, and retail, more than in population.
After the fall of Saigon, Hmong refugees from Southeast Asia who fought alongside the CIA immigrated to Wausau at the end of the 1970s. Wausau church organizations (Catholic and Lutheran) helped Hmong refugees adapt to American life.
In 1983, the Wausau Center shopping mall opened. By the mid- to late-1990s, the Wausau began to purchase and develop parts of West Industrial Park to meet the needs of the expanding economy and companies. In the late 1990s, the city demolished a number of aging buildings on a square in the center of downtown, creating what is known locally as the 400 Block, an open, grassy block with paved sidewalks crossing it. The square is a focal point for summer festivals. In recent years Wausau has redone the 400 Block, adding a permanent stage and other renovations that cost $2 million.
The new millennium
By the end of the 20th century, Wausau began to implement the Wausau Central Business District Master Plan, which included redevelopment and economic restructuring of downtown Wausau. The tallest commercial building in Wisconsin outside of Milwaukee is in Wausau: the 241-foot Dudley tower.
Geography and climate
Geography
Wausau is located at .
According to the United States Census Bureau, the city has a total area of , of which is land and is water. The city is located at an altitude of . Wausau is close to the center of the northern half of the Western Hemisphere. Just west of Wausau, 45°N meets 90°W (), which is exactly halfway between the equator and the north pole and a quarter of the way around the world from the prime meridian.
Climate
Wausau's climate is classified as humid continental (Dfb). It is built on or around a hemiboreal forest, which has some of the characteristics of a boreal forest and shares some of the features of the temperate zone forests to the south. Coniferous trees predominate in the hemiboreal zone, but a significant number of deciduous species are found there, as well.
Notes
Demographics
Wausau is the larger principal city of the Wausau–Merrill CSA, a Combined Statistical Area that includes the Wausau metropolitan area (Marathon County) and the Merrill micropolitan area (Lincoln County), which had a combined population of 155,475 at the 2000 census.
In 1996, a US census estimate found the Hmong people were the largest ethnic minority group in Wausau, with about 11% of the population.
2020 census
As of the census of 2020, the population was 39,994. The population density was . There were 18,605 housing units at an average density of . The racial makeup of the city was 78.3% White, 11.9% Asian, 1.7% Black or African American, 0.7% Native American, 1.8% from other races, and 5.6% from two or more races. Ethnically, the population was 4.1% Hispanic or Latino of any race.
2010 census
As of the census of 2010, there were 39,106 people, 16,487 households, and 9,415 families residing in the city. The population density was . There were 18,154 housing units at an average density of . The racial makeup of the city was 83.7% White, 1.4% African American, 0.8% Native American, 11.1% Asian, 0.9% from other races, and 2.3% from two or more races. Hispanic or Latino of any race were 2.9% of the population.
There were 16,487 households, of which 28.1% had children under the age of 18 living with them, 40.7% were married couples living together, 11.5% had a female householder with no husband present, 4.9% had a male householder with no wife present, and 42.9% were non-families. 35.4% of all households were made up of individuals, and 13.1% had someone living alone who was 65 years of age or older. The average household size was 2.31 and the average family size was 3.02.
The median age in the city was 36.8 years. 23.5% of residents were under the age of 18; 10% were between the ages of 18 and 24; 25.9% were from 25 to 44; 24.7% were from 45 to 64; and 15.7% were 65 years of age or older. The gender makeup of the city was 49.1% male and 50.9% female.
2000 census
As of the census of 2000, 38,426 people, 15,678 households, and 9,328 families resided in the city. The population density was 2,330.7 people per square mile (899.7/km2). There were 16,668 housing units at an average density of 1,011.0 per square mile (390.3/km2). The racial makeup of the city was 85.91% White, 0.54% Black or African American, 0.59% Native American, 11.41% Asian, 0.04% Pacific Islander, 0.30% from other races, and 1.21% from two or more races. About 1.04% of the population were Hispanic or Latino of any race.
Of the 15,678 households, 27.8% had children under the age of 18 living with them, 46.7% were married couples living together, 9.5% had a female householder with no husband present, and 40.5% were not families. About 33.6% of all households were made up of individuals, and 14.1% had someone living alone who was 65 years of age or older. The average household size was 2.37 and the average family size was 3.08.
In the city, the population was distributed as 25.4% under the age of 18, 9.6% from 18 to 24, 27.5% from 25 to 44, 20.4% from 45 to 64, and 17.1% who were 65 years of age or older. The median age was 36 years. For every 100 females, there were 92.5 males. For every 100 females age 18 and over, there were 88.3 males.
The median income for a household in the city was $36,831, and for a family was $47,065. Males had a median income of $33,076 versus $24,303 for females. The per capita income for the city was $20,227. About 7.2% of families and 11.4% of the population were below the poverty line, including 18.1% of those under age 18 and 8.4% of those age 65 or over.
Hmong population
As of 2003 the Hmong Americans are the largest ethnic minority in Wausau. Churches and social service agencies settled refugees, most of them Hmong with some Vietnamese and Lao, in Wausau after the Vietnam War. According to the 1980 U.S. Census, the Wausau SMSA had fewer than 1% non-White people. There were several dozen immigrants in 1978. By 1980 Wausau had 200 immigrants. This increased to 400 in 1982 and 800 in 1984.
In 1981 there were 160 Hmong students in the Wausau School District and in 1991 1,010. In a period ending in 1994 the tax rate of the Wausau School District rose by 10.48% as a result of the expenses of services to children from immigrant families. The increase was three times as high as the increase in an adjacent school district without a large immigrant population. By 1994 Wausau had 4,200 refugees. By 1996 the number of Hmong students in the school district was over 2,000. In 1998 this number reached its peak, 2,214. The city experienced some social upheaval following the Hmong arrival. Some schools in Wausau had a minority of English speakers and some were predominantly Hmong students. Some native-born American families in Wausau criticized the crime and expenses in social services.
As of 2003, "Sixty percent of Hmong families are homeowners. Although more than half of the workforce is earning less than $8 an hour, the welfare rate has dropped to less than 5 percent. More people are going to college. And test scores and graduation rates of Hmong public school students are steadily rising."
In Wausau there is relatively little Hmong-language media because for much of its history, the Hmong language was not written.
Government and politics
Wausau has a mayor–council form of government. Eleven elected alderpersons comprise the city council, each representing one district of the city. The City Council manages eight standing committees, including Parks & Recreation, Parking & Traffic, Finance, Human Resources, Public Health & Safety, Economic Development, Coordinating, and Capital Improvement & Street Maintenance.
The current Mayor of Wausau is Katie Rosenberg, 36, sworn on April 21, 2020. She becomes the second woman to serve in the role, and at 36 years old is also one of the youngest mayors according to a mayoral history on the Wausau city website. Rosenberg, a two-term Marathon County board supervisor, defeated incumbent mayor Robert Mielke by five points in the April 7, 2020 election.
Police/Fire
Fire Department
The Wausau Fire Department has 3 stations within the city which contain 5 ambulances, 4 engines, a heavy rescue vehicle, a 100 foot platform truck, rescue boats, inspections vehicles, and command vehicles. The department also has a hazardous incident team, or HIT, which is a type II regional hazardous materials team.
The department currently employs 72 full-time firefighter/paramedics.
The department responded to 6,490 calls in the year 2021.
Police Department
The Wausau Police Department is responsible for law enforcement services in the City of Wausau. On average, between 8–12 officers are on patrol at a time.
Outdoor Warning System
The city of Wausau, in coordination with the Marathon County Sheriff’s Office, is responsible for maintaining 14 outdoor tornado sirens that are strategically placed throughout the city. Sirens are sounded during tornadoes and severe weather. Sirens are tested at 1:15PM every Monday (April–September) and the first Monday of the month (October–March).
Economy
Nearly one-third of the Marathon County economy is based in manufacturing, with the balance in the service industry. Prominent industries include paper manufacturing, insurance, home manufacturing, and tourism. The Wausau region has a lower than average unemployment rate and continues a steady growth in job creation and economic viability among manufacturers and service providers alike. Wausau has 12 banks with 41 branch locations, three trust companies and three holding companies in the metropolitan area. There are also 13 open membership credit unions with 18 branch locations.
The Wausau area is a center for cultivation of American ginseng, and is also known for its red granite, which is quarried nearby.
Education
Public schools
Wausau is served by the Wausau School District, which has 14 elementary schools, two middle schools (John Muir and Horace Mann), and two high schools (Wausau East, Wausau West) and two charter schools (Wausau Engineering and Global Leadership Academy and Enrich Excel Achieve Learning Academy). Wausau Engineering and Global Leadership (EGL) Academy is a public charter school housed in Wausau East High School serving grades 9–12 and emphasizing science, technology, engineering and math.
D.C. Everest Area School District also serves a large part of the Wausau area. This school district has 7 elementary schools, one middle school, one junior high, and one senior high. They also have a 4K Program.
Charter schools
Wausau Area Montessori Charter School serves grades 1–6 and is housed at Horace Mann Middle School. Two kindergarten classes are available at the Montessori Children's Village and Rib Mountain Montessori.
The Excel, Enrich, Achieve (EEA) Learning Academy is a public charter school in the Wausau School District, housed in Wausau East High School, and is for students who do not find the traditional school setting to be a fit for their academic needs. EEA services grades 6–12.
The Idea Charter School, a project-based charter school that is a part of the D.C. Everest School District, had its first year in operation in the 2011–2012 school year. The charter school serves grades 6–12.
Private schools
The city's Roman Catholic parochial schools are known as the Newman Catholic Schools. They include St. Anne, St. Michael and St. Mark, Newman Middle School, and Newman Catholic High School. Other parochial schools include Trinity Lutheran grade school (Lutheran Church–Missouri Synod), Our Savior's Lutheran School (Pre-K–8) (Wisconsin Evangelical Lutheran Synod), Faith Christian Academy (K4–12), and a K–8 school operated by the Seventh-day Adventist Church.
Colleges and universities
Wausau is home to the University of Wisconsin– Stevens Point at Wausau a two-year university satellite campus of the University of Wisconsin-Stevens Point. The University houses the Wisconsin Public Radio Station. The city is also home of Northcentral Technical College, a two-year technical college.
It is also home to a number of satellite campuses of other colleges, including, Upper Iowa University, Lakeland College, Concordia University Wisconsin (closed in 2012), Rasmussen College, Medical College of Wisconsin, and Globe University.
Public libraries
The Marathon County Public Library (MCPL) – Wausau Headquarters, located downtown near the Wausau Center Mall, is the largest library in the Wausau area. It was formed when the county and city libraries merged in 1974. It serves as the headquarters for the Marathon County Public Library system, which encompasses all public libraries in Marathon County, including eight branch libraries. The Marathon County Historical Museum also maintains a library.
Parks
The city's 37 city parks, which total , are maintained by the Wausau and Marathon County Parks, Recreation, and Forestry Department.
Oak Island Community Park and Fern Island Community Park are located next to each other on the Wisconsin River. Oak Island has a wide range of activities: tennis courts, two playgrounds, a baseball diamond, one enclosed shelter with a kitchen, two open shelters, and a walking bridge to Fern Island. Fern Island Park hosts the annual Big Bull Falls Blues Festival in August, as well as the annual Beer and Bacon Fest.
Athletic Park, a baseball stadium on the east side of Wausau, is home to the Wausau Woodchucks baseball team.
Whitewater Park contains a third of a mile of Class I-II+ rapids along the Wisconsin River in downtown Wausau. It has bleachers facing whitewater rapids where recreational whitewater kayaking and canoeing take place.
Sylvan Hills is a county park within the Wausau city limits. During the winter, tubing takes place on hills that have vertical drops of up to .
Marathon Park, another county park in the city of Wausau, is the location of the Wisconsin Valley Fair. The park includes camping grounds, two hockey rinks, a curling barn, playgrounds, an obstacle course, an amphitheater, a bandstand, a grandstand, exhibition buildings, a concessions building, and a miniature golf course. Marathon Park contains the southernmost section of old-growth forest remaining in Wisconsin. The Little Red School House is housed within the park.
Transportation
Airport
AUW – Wausau Downtown Airport
CWA – Central Wisconsin Airport
Public transit
Metro Ride provides local bus service. For intercity bus service Wausau is served by Lamers Bus Lines providing once daily trips from Wausau to Milwaukee via Appleton and Coach USA/Van Galder with a daily trip to Janesville via Madison.
Until 1971, Wausau was served by intercity passenger trains at Wausau station.
Roads and highways
Major roads in Wausau are: Grand Avenue, North 6th St/North 5th St(one-way pair), East and West Bridge St, West Thomas St, 1st Ave/3rd Ave (one-way pair), Stewart Ave, 17th Ave, Merrill Ave, 28th Ave, and East Wausau Ave.
When traveling in Wausau, be aware that numbered "Streets" are on the east side of Wausau and numbered "Avenues" are on the west side of Wausau. The Wisconsin River divides the city between East and West.
Grand Avenue turns into North 6th Street when travelling north into the downtown area. Business 51 is a major route designation that runs through the city mostly along the original route of US 51 before the freeway bypass was constructed in the 1960s. Entering from the south along Grand Ave, north to downtown then splitting into one-way streets; northbound follows 6th St, McIndoe St, N. 1st St, and Scott St to the Wisconsin River; and southbound from the Wisconsin River along Washington St, 1st St, and Forest St back to Grand Ave. Once on the west side of the river, Scott St becomes Stewart Ave. Business 51 turns north off of Stewart Ave onto the one-way 1st Avenue north to W. Union Avenue westerly for two blocks then north out of town along Merrill Ave (southbound from Merrill Ave along 3rd Avenue, then East on Stewart Ave to the Wisconsin River).
Sports
The Wausau Woodchucks baseball team of the Northwoods League, an NCAA summer baseball league, plays home games at the Athletic Park in Wausau. The Wausau Woodchucks were formerly known as the Wisconsin Woodchucks. Woody Woodchuck is the mascot of the Woodchucks.
The Wausau River Hawks baseball team of the Dairyland League, a Wisconsin Baseball Association summer baseball league, plays home games at Athletic Park in Wausau. The Wausau River Hawks were formerly known as Wausau Precision.
Granite Peak Ski Area offers downhill skiing at nearby Rib Mountain. The 700-ft mountain is the highest skiable mountain in the state and one of the highest vertical drops in the Midwest. It first became a ski area in 1937, when Wausau residents cleared six runs by hand, installed the nation's longest ski lift, and built a chalet with stone quarried nearby. Granite Peak has 74 runs and seven ski lifts. Granite Peak earned Ski Magazine's #1 ranking in Wisconsin, Upper Michigan and Minnesota.
Wausau hosts the annual Badger State Winter Games.
Wausau is home to a kayak course which has hosted numerous regional, national, and world competitions over the last two decades. Nine Mile Recreation Area hosts many running, skiing, biking, and other outdoor events each year. The annual 24 hour mountain biking race has served as the USA Cycling 24-Hour Mountain Bike National Championships in past years. Ragnar relay began hosting a trail event at Nine Mile Recreation Area in 2016. Downhill flow machine built mountain bike trails were constructed and opened in 2017 at Sylvan Hill County Park.
Wausau is also home to the Wausau Curling Club, with an eight-sheet ice surface. A new curling facility was finished in February 2013. The new curling facility is located next to the former Holtz-Krause Landfill. The new facility has an Olympic size ice rink and will allow for curling tournaments, national and world championship games.
In the summers local softball teams come together to play softball at the Sunnyvale Softball Complex which possesses five softball fields and two volleyball courts. Men's, Women's, JO, and Slow and Fast pitch are played at the softball complex.
In the beginning of 2012, Wausau bought the former Holtz-Krause landfill for plans to build a soccer complex. Building of the soccer complex is expected in 2013 and should be open by 2014 in the fall.
Media and entertainment
Entertainment available in the city includes Exhibitour, Concerts on the Square, Market Place Thursdays, Screen on the Green and the Hmong New Year.
The only local daily print newspaper is the Wausau Daily Herald, with a daily circulation of 21,400 during the week and 27,500 on Sunday., Wausau Pilot and Review is a local on-line newspaper, City Pages is a free weekly newspaper. Le Dernier Cri is a monthly newspaper that reports on local business.
Wausau is home to the Leigh Yawkey Woodson Art Museum, which houses the "Birds in Art" collection as well as Leigh Yawkey Woodson's collection of decorative glass.
The Grand Theater is located in downtown Wausau. The theater hosts local and national shows.
Notable people
W. W. Albers, Wisconsin State Senator
John Altenburgh, jazz/blues musician and composer
Frank E. Bachhuber, lawyer, businessman, and politician
Chris Bangle, Chief of Design at BMW Auto Group (grew up in Wausau)
Marcus H. Barnum, Wisconsin State Representative, businessman, and lawyer
Wayne R. Bassett Sr. (1915–1988), Minnesota state legislator and librarian, Bassett moved to Wausau and was the head librarian of the Marathon County Library
Matthew Beebe, Wisconsin State Representative and businessman
Rudy Bell, Major League Baseball player
William Belter, Wisconsin State Representative
Warren Bernhardt, jazz, pop, and classical pianist
Claire B. Bird, Wisconsin state senator
Jake Blum, North Dakota State Representative
Gerald J. Boileau, US congressman
Emil Breitkreutz, Olympic medalist, head coach of the USC Trojans men's basketball team
Win Brockmeyer, football coach
Neal Brown, politician, lawyer, businessman and writer
Rachel Campos-Duffy, American television personality and conservative activist
John C. Clarke, Wisconsin State Representative
Gloria Coates, musical composer
Frank Cramer, Biologist, educator and author
Charles F. Crosby, Minnesota and Wisconsin legislator, lawyer
Robert W. Dean, Wisconsin jurist and legislator
Jim DeLisle, NFL player
Jeff Dellenbach, NFL player for the Miami Dolphins, New England Patriots, Green Bay Packers, and Philadelphia Eagles
Sean Duffy, former member of the United States House of Representatives from Wisconsin; former reality TV star on The Real World
Henry Ellenbecker, Wisconsin State Representative
Orville Fehlhaber, Wisconsin State Representative
Bill Fischer, MLB pitcher and coach
Ellsworth K. Gaulke, Wisconsin educator, businessman, and politician
Paul Gebert, Sr., Wisconsin State Representative and businesspeople
Rod Grams, former member of the United States House of Representatives and senator for Minnesota (as a local news anchor in the late 1970s)
Dave Heaton, Wisconsin State Representative
Benjamin W. Heineman, former CEO of Chicago and North Western Railway, founder and CEO of Northwest Industries
Elroy "Crazy Legs" Hirsch, football player, Pro Football Hall of Fame, University of Wisconsin–Madison Athletic Director 1969–1987 and actor
Charles Hoeflinger, Wisconsin State Representative
Michael W. Hoover, Presiding Judge of the Wisconsin Court of Appeals
Victoria Houston, author
Jalen Johnson, NBA player for the Atlanta Hawks
Justin L. Johnson, member of the United States House of Representatives from California (1943–1957)
William A. Kasten, Wisconsin State Representative
John Azor Kellogg, U.S. military leader and Wisconsin politician
William P. Kozlovsky, U.S. Coast Guard admiral
Edward C. Kretlow, Wisconsin State Representative
Dave Krieg, football player
Tony Kubek, baseball player and television broadcaster (lived in Wausau in the 1970s and early 1980s)
Debi Laszewski, IFBB professional bodybuilder
John E. Leahy, Wisconsin State Senator
Liberace, pianist/entertainer (lived and worked in Wausau in the 1950s)
Greg Liter, NFL player
Paul A. Luedtke, Wisconsin State Assemblyman
Barbara K. MacDonald, musician, half of the duo Timbuk 3
Sue R. Magnuson, Wisconsin State Representative
Mike Manley, Olympic athlete, Pan American Games gold medalist
Nicole Manske, host of NASCAR Now and The Speed Report
Herbert H. Manson, chairman of the Democratic Party of Wisconsin
Rufus P. Manson, Wisconsin State Representative
Dave Marcis, retired NASCAR driver
August F. Marquardt, Wisconsin State Representative
Herman Marth, Wisconsin State Representative
Marissa Mayer, CEO of Yahoo!
Edward F. McClain, Wisconsin State Representative
Myron Hawley McCord, governor of Arizona Territory
John McCutcheon, folk music singer
John L. McEwen, Wisconsin State Representative
Burton Millard, Wisconsin State Representative
Henry Miller, Wisconsin State Representative and jurist
Herman Miller
Walter D. McIndoe, congressman
Gerald Morris, author
Thomas T. Moulton, five-time Academy Award winner in sound recording
Otto Mueller, politician and businessman
William H. Mylrea, Wisconsin Attorney General
Burton Natarus, Chicago City Council member and lawyer
David Obey, member of the United States House of Representatives from Wisconsin from 1969–2011
Jim Otto, football player, Pro Football Hall of Fame
Shirley Palesh, baseball player
Jim Pekol, musician
B. G. Plumer, legislator and businessman
Daniel L. Plumer, mayor of Wausau, legislator
Fred Prehn, Wisconsin State Representative
Scott Resnick, Wisconsin politician
Bartholomew Ringle, Wisconsin State Representative
John Ringle, mayor of Wausau, legislator
Oscar Ringle, Wisconsin State Representative
John H. Robinson, mayor of Wausau, legislator
Sue Rohan, Wisconsin State Representative
Marvin B. Rosenberry, Chief Justice of the Wisconsin Supreme Court
Angus B. Rothwell, Superintendent of Public Instruction of Wisconsin
Johnny Schmitz, baseball player
Mark Seidl, Wisconsin Court of Appeals judge
Willis C. Silverthorn, Wisconsin politician
Leann Slaby, actress, Survivor: Vanuatu contestant
Brad Soderberg, basketball coach
Ed Sparr, NFL player
Michael Stackpole, science fiction author
Grace Stanke, Miss America 2023
Alexander Stewart, member of the United States House of Representatives and lumber baron
Patrick Thomas Stone, United States District Court judge
Jerome A. Sudut, Medal of Honor recipient
Ray Szmanda, radio and television personality/spokesperson
Claude Taugher, Navy Cross and Distinguished Service Cross recipient; NFL player
Tom Wiesner, Nevada politician and businessman
Lyman Wellington Thayer, Wisconsin State Senator
Arthur H. Treutel, Wisconsin State Representative
Mary Williams Walsh, journalist
George Werheim, Wisconsin State Representative
Milt Wilson, professional football player
Chris Wimmer, NASCAR driver
Scott Wimmer, NASCAR driver
Dean Witter, U.S. businessman and founder of Dean Witter & Company investment house
Cyrus C. Yawkey, businessman
Charles Zarnke, Wisconsin politician
Brad Zweck, Wisconsin State Representative
References
External links
City of Wausau
Wausau Regional Chamber of Commerce
Cities in Wisconsin
Cities in Marathon County, Wisconsin
County seats in Wisconsin |
Batu Gong is a settlement in Sarawak, Malaysia. It lies approximately south-south-east of the state capital Kuching. Neighbouring settlements include:
Kampung Endap north
Kampung Kangka north
Kampung Beradau northwest
Siburan west
References
Populated places in Sarawak |
Benjamin David "Ben" Ross (born 23 May 1980) is an Australian former professional rugby league footballer who played in the 2000s and 2010s. A Queensland State of Origin representative forward, he played in the National Rugby League for the St. George Illawarra Dragons, Penrith Panthers, with whom he won the 2003 NRL Premiership, the Cronulla-Sutherland Sharks and the South Sydney Rabbitohs.
Background
Ross was born in Chinchilla, Queensland, Australia.
He played junior football for the Nambour Crushers.
Playing career
In 2002, Ross made his NRL debut for the St George Illawarra Dragons in a match against the Melbourne Storm.
Signing with Penrith in 2003, Ross helped to kick the season off to a blistering start after becoming involved in a brawl with Brisbane Broncos captain Gorden Tallis. Ross was on the receiving end of a series of upper-cut punches thrown by Tallis when Brisbane met Penrith in the first round of the year. Both players were sin binned for ten minutes and no further action was taken by the NRL Judiciary. The Australian Football League (AFL) CEO, Wayne Jackson, used the incident to criticise the rival code which led to cross-border media exchanges. NRL CEO, David Gallop, ordered a policy change which would enable players to be charged for on-field fights.
Ross was a member of Penrith's 2003 NRL grand final-winning team, playing from the interchange bench in their 18–6 win over the Sydney Roosters. As 2003 NRL premiers, Penrith travelled to England to face Super League VIII champions, Bradford in the 2004 World Club Challenge. Ross played from the interchange bench in the Penrith's 22–4 loss. Following his successful season at Penrith, Ross was selected to represent Queensland as an interchange for all six games of the 2004 and 2005 State of Origin series.
Although signed with Penrith until the end of 2007, Penrith announced they would have to release Ross due to salary-cap concerns. Ross joined the Cronulla-Sutherland Sharks in 2006 but had little game time that year due to injury. In round 8, playing against his previous club, Penrith, Ross damaged his left knee tackling former flat-mate, Joel Clinton, in the first few minutes of the match. He was able to participate in the majority of the 2007 season but was side-lined for the remainder of the season.
In 2008, Ross was knocked out in Cronulla's season opener against the Manly-Warringah Sea Eagles but miraculously recovered to play in the team's round two encounter against the Storm in Melbourne. Ross in that match was sent off late in the second half for his late charge on Storm halfback Cooper Cronk which subsequently earned him a seven-match suspension.
After suffering neck injury playing for Cronulla in the opening round of the 2009 NRL season Ross was sidelined for the remainder of the season. Vowing to return to the playing field, he was thrown a lifeline by the South Sydney Rabbitohs who gave him a contract. After undergoing surgery and rehabilitation, almost two years later Ross made his return to the playing field for South Sydney in the 2010 NRL season.
Ross announced his retirement at the end of the 2013 NRL season. In the 2014 pre-season he rejected an offer to play in the Super League for the London Broncos, preferring to take up a welfare management role with the Men of League Foundation.
Career highlights
First Grade Debut: 2002 – Round 6, St. George Illawarra vs Melbourne at Olympic Park, 20 April
Premierships: 2003 – Penrith Panthers defeated Sydney Roosters
Representative Selection: 2004 – Queensland State of Origin
Off-field
Ross was crowned the Sexiest Man in League in 2005 following a nationwide phone poll. Later that year he was one of twelve of the Hottest Players in the NRL that posed for the League of Their Own 2006 calendar that was produced in the style of the Dieux du Stade calendars to raise money for the Koori Kids foundation.
In 2006, Ross again posed in the nude for the Naked Rugby League 2007–08 charity calendar, with its sales to benefit the National Breast Cancer Foundation of Australia.
On 11 June 2015, Ross participated in an arm wrestling match against Wendell Sailor on The NRL Footy Show. However, his arm gave way and was immediately rushed to hospital.
Footnotes
External links
NRL profile
1980 births
Living people
Male arm wrestlers
Australian rugby league players
Rugby league players from Queensland
St. George Illawarra Dragons players
Penrith Panthers players
Cronulla-Sutherland Sharks players
South Sydney Rabbitohs players
Queensland Rugby League State of Origin players
Prime Minister's XIII players
Rugby league props
People from Chinchilla, Queensland |
Weizenbaum is a Jewish German surname. 'Weizen' means (buck)wheat, 'baum' is a tree. Notable people with the surname include:
Joseph Weizenbaum (1923–2008), German-American computer scientist
Zoe Weizenbaum (born 1991), American actress
See also
Weidenbaum
German-language surnames |
Marco Kasper (; born 8 April 2004) is an Austrian professional ice hockey centre for the Grand Rapids Griffins in the American Hockey League (AHL) as a prospect to the Detroit Red Wings of the National Hockey League (NHL). He was drafted eighth overall by the Red Wings in the 2022 NHL Entry Draft.
Playing career
Kasper made his professional debut for Rögle BK on 21 January 2021, where he played 11 minutes 35 seconds. He became the second player born in 2004 to play in the SHL.
He was drafted eighth overall by the Detroit Red Wings in the 2022 NHL Entry Draft. On 13 July 2022, the Red Wings signed Kasper to a three-year, entry-level contract.
Kasper played his first career NHL game on 2 April 2023, in a 5–2 victory over the Toronto Maple Leafs.
International play
Kasper represented Austria at the 2021 World Junior Ice Hockey Championships where he recorded one assist in four games. He will again represent Austria at the 2022 World Junior Ice Hockey Championships.
Personal life
Kasper's father, Peter, played for various professional hockey clubs in Austria, as well as at the 2002 Winter Olympics. Kasper had a role in the Austrian film Harrinator, playing a young hockey player named Robert Begusch.
Career statistics
Regular season and playoffs
International
References
External links
2004 births
Living people
Austrian ice hockey centres
Detroit Red Wings draft picks
Detroit Red Wings players
Grand Rapids Griffins players
National Hockey League first-round draft picks
Sportspeople from Innsbruck
Rögle BK players
Austrian expatriate ice hockey people
Austrian expatriate sportspeople in Sweden
Expatriate ice hockey players in Sweden |
Portalegre District ( ) is located in the east of Portugal. The district capital is the city of Portalegre.
As of 2021, it is the least populous district of Portugal.
Municipalities
The district is composed of 15 municipalities:
Alter do Chão
Arronches
Avis
Campo Maior
Castelo de Vide
Crato
Elvas
Fronteira
Gavião
Marvão
Monforte
Nisa
Ponte de Sor
Portalegre
Sousel
Summary of votes and seats won 1976–2022
|- class="unsortable"
!rowspan=2|Parties!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S!!%!!S
|- class="unsortable" align="center"
!colspan=2 | 1976
!colspan=2 | 1979
!colspan=2 | 1980
!colspan=2 | 1983
!colspan=2 | 1985
!colspan=2 | 1987
!colspan=2 | 1991
!colspan=2 | 1995
!colspan=2 | 1999
!colspan=2 | 2002
!colspan=2 | 2005
!colspan=2 | 2009
!colspan=2 | 2011
!colspan=2 | 2015
!colspan=2 | 2019
!colspan=2 | 2022
|-
| align="left"| PS || style="background:#FF66FF;"|41.9 || style="background:#FF66FF;"|3 || 29.8 || 1 ||32.4 || 1 || style="background:#FF66FF;"|38.5 || style="background:#FF66FF;"|2 || 23.7 || 1 || 25.1 || 1 || 33.5 || 1 || style="background:#FF66FF;"|50.5 || style="background:#FF66FF;"|2 || style="background:#FF66FF;"|51.2 || style="background:#FF66FF;"|2 || style="background:#FF66FF;"|45.3 || style="background:#FF66FF;"|2 || style="background:#FF66FF;"|54.9 || style="background:#FF66FF;"|2 || style="background:#FF66FF;"|38.3 || style="background:#FF66FF;"|1 || 32.4 || 1 || style="background:#FF66FF;"|42.4 || style="background:#FF66FF;"|1 || style="background:#FF66FF;"|44.7 || style="background:#FF66FF;"|2 || style="background:#FF66FF;"|47.2 || style="background:#FF66FF;"|2
|-
| align="left"| PSD || 10.1 || || align=center colspan=4|In AD || 19.1 || 1 || 20.9 || 1 || style="background:#FF9900;"|37.4 || style="background:#FF9900;"|1 || style="background:#FF9900;"|38.9 || style="background:#FF9900;"|2 || 23.4 || 1 || 22.5|| 1 || 30.6 || 1 || 20.2 || || 23.8 || 1 || style="background:#FF9900;"|32.5 || style="background:#FF9900;"|1 || align=center colspan=2|In PàF || 20.1 || || 23.2 ||
|-
| align="left"| PCP/APU/CDU || 22.0 || 1 || 29.4|| 1 || 26.1 || 1 || 28.7 || 1 || style="background:red;"|25.2 || style="background:red;"|1 || 20.9 || 1 || 15.2 || || 14.0 || || 15.0 || || 12.4 || || 12.1 || || 12.9 || || 12.8 || || 12.2 || || 8.1 || || 7.6 ||
|-
| align="left"| AD || colspan=2| || style="background:#00FFFF;"|32.1 || style="background:#00FFFF;"|2 || style="background:#00FFFF;"|33.4 || style="background:#00FFFF;"|2 || colspan=26|
|-
| align="left"| PàF || colspan=26| || 27.6 || 1 || colspan=4|
|-
! Total seats || colspan=8|4 || colspan=12|3 || colspan=12|2
|-
! colspan=33|Source: Comissão Nacional de Eleições
|}
Districts of Portugal
District |
Emily Patricia Gibson (c.1864–24 April 1947) was a New Zealand proof-reader, feminist, socialist and internationalist. She was born in Dublin, County Dublin, Ireland on c.1864.
References
Writers from County Dublin
1860s births
1947 deaths
New Zealand feminists
New Zealand socialists
New Zealand socialist feminists
Irish emigrants to New Zealand |
Melchior Barthel (born 10 December 1625 in Dresden; died there 12 November 1672) was a German sculptor.
Biography
He studied with his father and with Johann Boehme, of Schneeberg (1640–45), and settled at Dresden, where he was appointed sculptor to the court.
Works
His principal works are the colossal tomb of the Doge Giovanni Pesaro (Santa Maria dei Frari, Venice); the statue of John the Baptist (chapel of Santa Maria, Nazareth); and a tomb in San Giovanni e Paolo, Venice. His numerous ivory carvings in the Green Vault at Dresden are considered superior to his more elaborate works.
Notes
1625 births
1672 deaths
German sculptors
German male sculptors
Artists from Dresden |
A bust of Emanuel Swedenborg, sometimes called the Emanuel Swedenborg Monument, is installed in Chicago's Lincoln Park, in the U.S. state of Illinois. The sculpture by Adolff Jonnson was installed in 1924 and relocated in 2012.
References
1924 establishments in Illinois
1924 sculptures
Busts in Illinois
Emanuel Swedenborg
Monuments and memorials in Chicago
Outdoor sculptures in Chicago
Sculptures of men in Illinois |
Klas Gustaf Henrik Karlsson (born 25 June 1940) is a Swedish musicologist and author.
Biography
He was editorial secretary of the Sohlman Dictionary of Music between 1972–1978 and defended his thesis in 1988 at the University of Gothenburg. On 11 May 1993, he was elected 887th member of the Royal Swedish Academy of Music and was its research officer since 1991. In 2013, he published a biography books about Wilhelm Peterson-Berger, one of the most famous Swedish national romantic composers.
Publications
Wilhelm Peterson-Berger: tondiktare och kritiker (2013)
References
1940 births
Living people
Swedish musicologists
People from Västerbotten
Members of the Royal Swedish Academy of Music
20th-century Swedish musicians
21st-century Swedish writers |
Rudolph Ackermann (20 April 1764 in Stollberg, Electorate of Saxony – 30 March 1834 in Finchley, London) was an Anglo-German bookseller, inventor, lithographer, publisher and businessman.
Biography
He attended the Latin school in Stollberg, but his wish to study at the university was made impossible by lack of financial means, and he therefore became a saddler like his father.
He worked as a saddler and coach-builder in different German cities, moved from Dresden to Basel and Paris, and then, 23 years old, settled in London. He established himself in Long Acre, the centre of coach-making in London and close to the market at Covent Garden. His extraordinary business instinct, as well as his flair for design and talent for self-promotion, won him the £200 contract to design the ceremonial coach for the Lord Chancellor of Ireland, John FitzGibbon, 1st Earl of Clare. After this he designed The Royal Sailor, an 8-wheel omnibus that ran between Charing Cross, Greenwich and Woolwich.
Ackermann then moved to Little Russell Street where he published Imitations of Drawings of Fashionable Carriages (1791) to promote his coach-making. Other publications followed. An able artist in his own right, in 1795 he established a print-shop and drawing-school at 96 Strand. Ackermann set up a lithographic press and began a trade in prints. He later began to manufacture colours and thick carton paper for landscape and miniature painters. Within three years the premises had become too small and he moved to 101 Strand, in his own words "four doors nearer to Somerset House", the seat of the Royal Academy of Arts.
Between 1797 and 1800 Ackermann rapidly developed his print and book publishing business bringing together wide variety of talented artists and printmakers including Thomas Rowlandson, Isaac Cruikshank, John Bluck, Theodore Lane, Henry Singleton, Maria Cosway, F. J. Manskirchten, J. C. Stadler, J. H. Schultz, Henri Merke, Thomas Sutherland, Nicholas Heidelhoff, Augustus Pugin, and G. M. Woodward in numerous projects to produce both individual prints as well as illustrations for books and magazines, encompassing many different genres including topography, caricature, portraits, transparencies and decorative prints.
In 1809 he applied his press to the illustration of Repository of Arts, Literature, Fashions, which appeared monthly until 1829, by when forty volumes had appeared. The Repository documented the changing classicising fashions in dress and furniture of the Regency; Thomas Rowlandson and other distinguished artists were regular contributors. William Combe and Rowlandson's parody, Dr Syntax in search of the Picturesque first appeared in parts in Ackermann's Poetical Magazine and was then reissued as a bestselling separate book. Ackermann also published Rowlandson's masterpiece The English Dance of Death (2 volumes 1816). He introduced from Germany the fashion of the once popular Literary Annuals, beginning in 1823 with Forget-Me-Not; and he published many illustrated volumes of topography and travel, including The Microcosm of London (3 volumes, 1808–1811), Westminster Abbey (2 volumes, 1812), The Rhine (1820), The Seine (1821), and The World in Miniature (43 volumes, 1821–1826).
An inventor and innovator, he was important as a carriage designer and patented the Ackermann steering geometry. In 1801 he patented a method for rendering paper and cloth waterproof and erected a factory in Chelsea to make it. He was one of the first to illuminate his own premises with gas. Indeed, the introduction of lighting by gas owed much to him.
During the Napoleonic wars, Ackermann was an energetic supporter of the Allied cause and made significant contributions to British propaganda through his publication of anti-Napoleonic prints and military manuals. He became a naturalised British citizen in March 1809. After the Battle of Leipzig, Ackermann collected nearly a quarter of a million pounds sterling for the German relief effort.
As one of the pioneers of modern publishing methods, Ackermann developed an international distribution network for his publications and came to have significant commercial interests in South America. The business he founded in London flourished throughout the 19th century under the management of his descendants. He was buried at St. Clement Danes in the Strand, London.
See also
Ackermann's Repository
Isaac Cruikshank
Thomas Rowlandson
George Moutard Woodward
References
Allgemeine Deutsche Biographie – online version at Wikisource
Catalogue of Political and Personal Satires Preserved in the Department of Prints and Drawings in the British Museum, Mary Dorothy George. Vol VI 1938, Vol VII, 1942 VOL VIII 1947, VOL IX 1949
Further reading
. 1904 reprint + Illustrations
Ford, John (2018), Rudolph Ackermann & the Regency World, Warnham Books, Sussex. .
Martin Hardie (1906), English Coloured Books, London: Methuen & Co and New York: G.P. Putnam's & Sons. Chapter X: Rudolph Ackermann. (pp. 96–116; with index of works, pp. 310–314).
S.T. Prideaux (1909), Aquatint engraving. London: Duckworth & Co. Chapter VI: Rudolph Ackermann and his Associates. (pp. 110–152; with index of works, pp. 374–378)
External links
Forget Me Not: A Hypertextual Archive of Ackermann's 19th-Century Literary Annual reproduces elements from the 1823–1830 volumes of the earliest British-published literary annual, Forget Me Not, published by Rudolf Ackermann between 1823 and 1847. Hyperlinks allow the volumes to be examined by author, engraver, etc., and include references to other works submitted to similar 19th century literary journals.
1764 births
1834 deaths
People from Stollberg
People from the Electorate of Saxony
19th-century German inventors
German publishers (people)
Emigrants from the Holy Roman Empire to the Kingdom of Great Britain
19th-century British inventors
British publishers (people)
Papermakers |
Avondale Estate may refer to:
the Avondale Agricultural Research Station in Western Australia, formerly known as Avondale Estate
Avondale Estates, Georgia, a city in DeKalb County, Georgia, United States
Avondale Estate in Cooranbong, New South Wales, Australia
Avondale Estates in Parkland County, Alberta, Canada |
Graysville is a city in northwestern Jefferson County, Alabama, United States, located north of Adamsville. At the 2020 census, the population was 1,950.
History
In the late 1800s and early 1900s, this city was called Gin Town. Because it had the only cotton gin for miles around, the community grew. It incorporated as Graysville initially in 1897. As the town grew, the need for businesses and houses of worship grew as well. One street over from this site, the Union Church was established in the early 1900s. All people of all denominations met and worshiped there as it was the only church for miles around. In 1927, the town charter was revoked on the grounds of "inactivity."
This city was reincorporated on November 17, 1945. The first meeting of the town council took place at the old school house on January 16, 1946. Later that year, the original city council established the Graysville Water Works system. In 1949, the city council established the Graysville Gas Board which eventually became the Graysville Municipal Gas System. During the 1950s and 1960s, the local coal mines and steel mills attracted families from all over Alabama. As a result of this growth, Graysville established the city's first series of home developments and subdivisions. During the 1980s and 1990s, Graysville expanded its city limits by annexing multiple acres in what was then unincorporated in Jefferson County.
Its communities were damaged by an EF3 tornado on January 23, 2012.
Geography
Graysville is located at (33.626955, -86.962255). According to the U.S. Census Bureau, the city has a total area of , all land.
Demographics
2020 census
As of the 2020 United States census, there were 1,950 people, 765 households, and 542 families residing in the city.
2010 census
At the 2010 census, there were 2,165 people, 907 households, and 607 families living in the city. The population density was . There were 1,066 housing units at an average density of . The racial makeup of the city was 73.9% White, 23.6% Black or African American, 0.4% Native American, 0.2% Asian, 0.4% from other races, and 1.4% from two or more races. 1.7% of the population were Hispanic or Latino of any race.
Of the 907 households 20.7% had children under the age of 18 living with them, 47.0% were married couples living together, 14.7% had a female householder with no husband present, and 33.1% were non-families. 30.2% of households were one person and 12.6% were one person aged 65 or older. The average household size was 2.39 and the average family size was 2.93.
The age distribution was 20.3% under the age of 18, 7.1% from 18 to 24, 24.0% from 25 to 44, 28.7% from 45 to 64, and 19.9% 65 or older. The median age was 44.3 years. For every 100 females, there were 93.8 males. For every 100 females age 18 and over, there were 97.0 males.
The median household income was $35,750 and the median family income was $44,926. Males had a median income of $37,156 versus $30,917 for females. The per capita income for the city was $16,308. About 15.9% of families and 20.1% of the population were below the poverty line, including 21.5% of those under age 18 and 13.0% of those age 65 or over.
2000 census
At the 2000 census, there were 2,344 people, 976 households, and 696 families living in the city. The population density was . There were 1,090 housing units at an average density of . The racial makeup of the city was 75.26% White, 23.12% Black or African American, 0.43% Native American, 0.34% Asian, 0.17% from other races, and 0.68% from two or more races. 0.47% of the population were Hispanic or Latino of any race.
Of the 976 households 24.6% had children under the age of 18 living with them, 50.3% were married couples living together, 16.7% had a female householder with no husband present, and 28.6% were non-families. 25.7% of households were one person and 14.0% were one person aged 65 or older. The average household size was 2.40 and the average family size was 2.85.
The age distribution was 20.9% under the age of 18, 8.2% from 18 to 24, 25.0% from 25 to 44, 25.4% from 45 to 64, and 20.4% 65 or older. The median age was 42 years. For every 100 females, there were 86.2 males. For every 100 females age 18 and over, there were 83.0 males.
The median household income was $30,994 and the median family income was $35,938. Males had a median income of $30,692 versus $25,446 for females. The per capita income for the city was $16,328. About 8.2% of families and 11.3% of the population were below the poverty line, including 16.5% of those under age 18 and 13.2% of those age 65 or over.
References
External links
City of Graysville
Graysville Public Library
Cities in Alabama
Cities in Jefferson County, Alabama
Birmingham metropolitan area, Alabama |
Empresa Aeronáutica Ypiranga, commonly shortened to EAY, was a Brazilian aircraft manufacturer based in São Paulo and founded in 1931 by American Orton Hoover, Brazilian Henrique Dumont Villares and German Fritz Roesler.
History
In 1914, Orton Hoover came to Brazil to assemble three Curtiss-Wright seaplanes purchased by the Brazilian Navy. He settled permanently in Brazil in 1928 and worked with Federico Brotero on the development of the IPT Bichinho a single-seat sport aircraft. Henrique Dumont Villares was the nephew of Alberto Santos Dumont and Fritz Roesler was a German fighter pilot in World War I before going to Brazil. Roesler founded a flight school near São Paulo in 1923 and, together with George Coubisier, Francisco Matarazzo and others, the VASP airline.
Empresa Aeronáutica Ypiranga began operations with the production of the EAY-101 glider, a copy of the Stamer Lippisch Zögling, of which six were built. The second aircraft model EAY-201 was a copy of the Taylor Cub. The EAY-201 was a two-seat trainer aircraft and first flew in 1935, with only five examples built. EAY was then acquired by Companhia Aeronáutica Paulista in 1942. The EAY-201 now continued in production as the CAP-4 Paulistinha.
Aircraft
See also
Companhia Aeronáutica Paulista
Indústria Aeronáutica Neiva
References
Glider manufacturers
Defunct aircraft manufacturers of Brazil
Manufacturing companies based in São Paulo
Brazilian brands |
Femm-Isation is the debut studio album by Japanese musical duo Far East Mention Mannequins, who later adapted their name into FEMM. It was released as an independent digital album on October 1, 2014 by Maximum10 and Avex Music Creative Inc. After releasing a digital EP Astroboy in April 2014, Avex announced new material from the group. The album's production was handled by several music producers and songwriters, such as Dan Book, Alexei Misoul, Leah Haywood, Daniel James, Kevin Ross, Andreas Carlsson, and Dreamlab. It also features a guest appearance from FEMM's alter-egos; the managers Honey-B and W-Trouble. Performed in English language, Femm-Isation is primarily an electronic dance album with numerous elements of pop ballad, disco, and eurodance.
Upon its release, Femm-Isation was met with generally positive reviews from music critics, many of whom complimented the commercial appeal of the songs and group, and praised the lyrical and musical delivery. However, some critics singled out some tracks that weren't good. Commercially, Femm-Isation was unsuccessful. The album failed to chart on the Japanese Oricon Albums Chart due to their policy of restricting digital sales and releases, and failed to chart on any Japanese Billboard albums charts. The album managed to chart for a sole week on the US Billboard World Albums Chart at 10.
Femm-Isation spawned thirteen promotional singles, and eight digital singles. Despite no chart positions, the singles: "Kill the DJ" and "Fxxk Boyz Get Money" achieved viral status because of the song's musical and lyrical delivery, along with its music video aesthetics. Because of this, several online figures and websites begun spreading the songs and the group virally. FEMM promoted the album on several live performances and concert gigs. In February 2016, Femm-Isation will be re-released physically as a double album with the group's subsequent release P.o.W.!/LCS (2016).
Background and development
Far East Mention Mannequins, which consists of Japanese–American model and actress Emily Kaiho, and Japanese singer Hiro Todo, premiered their musical debut in October 2013 with a YouTube video about two Japanese "mannequins" roaming the streets of Shibuya and Tokyo city; they were subsequently hired by Maximum10, a sub-division label from Avex Music Creative Inc. As part of their character development, where Kaiho and Todo portray the mannequins RiRi and LuLa respectively, FEMM's label approach and background is unknown. As a result, two new alter-egos, "agents", were made to represent the group; Kaiho as Honey-B and Todo as W-Trouble; Honey-B and W-Trouble are present on the album respectively with RiRi and LuLa.
They released their first extended play with Avex exclusively, Astroboy through digital stores on April 2, 2014. Due to positive reaction, Avex hired several producers and songwriters to create songs for the group's debut studio album, such as Dan Book, Alexei Misoul, Leah Haywood, Daniel James, Kevin Ross, Andreas Carlsson, and Dreamlab. FEMM begun recording the album at Avex Studios and Prime Sound Studios in Japan around at the start of 2014 with Hideaki Jinbu, and the album's material was finalized and mixed by Tom Coyne at Sterling Studios in New York City, New York.
Composition
Femm-Isation is primarily an electronic dance album with numerous elements of rap, synthpop, and J-pop. EDM is the most prominent element in the songs, which include "We Flood the Night", "Kill the DJ", "Party All Night", "White Noise", "Wannabe", and "Whiplash". Other tracks have elements of different musical genres; R&B in "The Real Thing", dancehall in "Dead Wrong", and pop ballad melodies through "Unbreakable". Corynn Smith from MTV Iggy labelled some tracks; "A romantic trance trip a la (We Flood the Night), craving a techno remix of '70s J-pop hit (UFO), or in a twerk-tastic, rubber-maid-outfit-clad (Fxxk Boyz Get Money) kinda mood." Femm-Isation is recognized as the first J-pop album, released through Avex, to have been entirely recorded in English language. According to FEMM, both members did not yet have any professional experience in singing. The duo stated that the first time recording and appearing in a music video for "Astroboy" as their agents was challenging.
Release
Femm-Isation was released digitally on October 1, 2014 by Maximum10 and Avex Music Creative Inc. The digital album consists of thirteen tracks; "Astroboy" from their self-titled EP was included on the album. However, "UFO" from the EP did not. The cover sleeve immolates the music video to their single "Wannabe"; it features FEMM with gas masks on, holding up a flag that bears the title "Far East Mention Mannequins". That same year on December 24, Avex Music Creative Inc. released the instrumental version of the album. The digital album consists of thirteen instrumental tracks. The cover sleeve is an inverted version of the original album. On December 11, 2015, FEMM announced the release of a new extended play entitled PoW!/LCS as their major debut through Avex Trax and JPU Records. FEMM confirmed that two formats would be released; a separate EP format, and a double album that includes a physical copy of Femm-Isation. The third format, the EP and a blank CD-R disc, will be released so audiences who purchased the digital release of Femm-Isation can burn it on the disc. The double album will be released worldwide as a digital release on February 3, 2016, whilst the physical release will be released on February 24 that same year.
Critical and commercial responses
Femm-Isation received positive reviews from most music critics. Andy Malt from Complete Music Update was positive towards the tracks; he stated "Thankfully, the musical side makes more sense. Over the last seven months they’ve released fourteen globally-minded pop tracks onto YouTube, all of which make up their debut album, Femm-Isation, which will be released internationally on iTunes tomorrow. Tracks like 'Fuck Boyz Get Money' (a satire of The Notorious B.I.G. line, “fuck bitches, get money”) and my personal favourite, 'Wannabe' (not a Spice Girls cover)." Greg Hignight from J-Generation.com was very positive towards the songs on the album, and stated "My pick for the J-Pop album of 2014 is Femm-Isation, a celebration of the artificial aspiring for something more genuine, and in the process, delivering some the most exciting and original music to come out of the Japanese pop scene in years." Despite not reviewing the album, Molly Osbery from Vice.com was praised the producers and songwriters from their material for being hidden pioneers in order to popularize the group, as she felt producers now were more "the front men". Despite not reviewing the album, Corynn Smith from MTV Iggy was impressed by their English language skills of the singles, and commended majority of the album's composition and singles. That same year, MTV Iggy listed FEMM as their "Artist to Watch".
Because it was released digitally, Femm-Isation failed to chart on the Japanese Oricon Albums Chart due to their policy of restricting digital sales and releases, and failed to chart on any competent Billboard Japan album chart. However, Femm-Isation managed to chart for a sole week on the US Billboard World Albums Chart at 10; this is FEMM's first charting effort from their discography as of January 2016, and were the second Japanese artist after Shintaro Sakamoto on the chart week of October 18, 2014.
Promotion
Album and remix singles
"Wannabe" was released as the album's lead single on April 16, 2014. Despite its release, the song failed to enter any music charts. Two accompanying music videos were shot for the single; one featured FEMM being sprayed painted to immolate body art in the middle of a street, while the second video featured FEMM dancing to the song in a white studio. "Kiss the Rain" was released as the album's second single on April 30, 2014. Despite its release, the song failed to enter any music charts. An accompanying music video was shot for the single; its features FEMM inside a steam punk environment dancing the song. Intercut scenes feature FEMM kissing each other and dancing in front of computer generated imagery. "White Noise" was released as the album's third single on May 7, 2014. Despite its release, the song failed to enter any music charts. An accompanying music video was shot for the single; its features FEMM dancing to the video, and performing in latex body suits. The video is primarily made with lyric video scenes, computer generated imagery, and scenes of FEMM dancing. "We Flood the Night" was released as the album's fourth single on May 14, 2014. Despite its release, the song failed to enter any music charts. An accompanying music video was shot for the single; its features FEMM as mannequin dolls, traveling through a city and underwater world.
"Kill the DJ" was released as the album's fifth single on May 28, 2014. The song received favorable reviews from most music critics, many whom praised the song's production and composition. Despite its release, the song failed to enter any music charts. An accompanying music video was shot for the single; its features RiRi and LuLa in a cadet and nurse uniform, dancing and fighting to the song. The video received a large amount of favourable feedback, praising the concept, its convenient use of cosplay and otaku culture, and choreography. "Fxxk Boyz Get Money" was released as the album's sixth single on July 30, 2014. The song was critically acclaimed from many music critics, many whom praised the song's commercial nature and lyrical message. Despite its release, the song failed to enter any music charts. An accompanying music video was shot for the single; its features FEMM singing and twerking in an overlapped lyric video. The video received a large amount of favourable feedback, and attracted large attention from several online figures including American blogger and journalist Perez Hilton, American YouTube star Miles Jai, among others. "Party All Night" and its remix by sfpr was released as the album's seventh single on August 27, 2014, and debut remix single. Despite its release, the song failed to enter any music charts. An accompanying music video for the original composition was shot; its features FEMM in a futuristic world and in a small room.
The "Invaderous" remix to "Kill the DJ" was released as the album's eighth single on August 27, 2014, and second remix single. No music video was produced for this remix. "Dead Wrong" was released as the album's ninth single on August 27, 2014. Despite its release, the song failed to enter any music charts. An accompanying music video was shot for the single; its features FEMM wearing traditional Japanese kimono dancing the song in front of computer generated imagery. "Whiplash", alongside two remixes by Invaderous and sfpr, was released as the album's tenth single on September 17, 2014, and third and fourth remix single respectively. Despite its release, the song failed to enter any music charts. An accompanying music video for the original composition was shot; its features FEMM in a black latex uniform, dancing with back-up dancers on a stage. "Unbreakable" was released as the album's eleventh and final single on September 17, 2014. Despite its release, the song failed to enter any music charts. An accompanying music video was shot for the single; its features FEMM singing the song in a white room, whilst sitting near a grand piano.
Live performances and gigs
Femm promoted Femm-Isation on several concert gigs and concerts. FEMM made their debut concert performance at Tokyo's Baamm at Shinkiba. In mid-July 2014, FEMM performed at Tokyo in Tulsa, an anime convention in Oklahoma, which was their first performance in North America. FEMM's second major performance was at Tokyo's newly hosted Twerk 'Em All; this was the host party for FEMM's then-new single "Fxxk Boyz Get Money", along previous material. FEMM were part of a one-night only show for the Japanese leg tour of Dutch recording artist and songwriter Eva Simons, and FEMM performed all the album tracks on their Femm-Isation Vol.3 concert the following day; this gig was hosted at Hatsudai Tamai Hospital. FEMM performed alongside electronic musicians Afrojack, Alesso, Fedde Le Grand, Kaskade, and Martin Garrix amongst others at the annual Ultra Music Festival in Tokyo; this was FEMM's first musical performance at a live festival tour. FEMM performed at the Versace after party in Tokyo, and performed on several other concert gigs until December 2014.
In August 2015, the duo returned to the United States to perform at Rage, a gay bar and dance club in West Hollywood, California. In the same weekend, they were guests at J-Pop Summit in San Francisco along with other Japanese acts such as Eir Aoi, JAM Project, Gacharic Spin and more. The group's final performance promoting material from Femm-Isation was for the 2015 YouTube FanFest Japan, where YouTube personalities and artists gathered together for a live streaming event.
Track listing
All formats
Digital download – Consists of thirteen original tracks.
Digital download instrumental set – Consists of thirteen original tracks in instrumental form.
Double album – Re-released under the title PoW!/LCS + Femm-Isation; Consists ten tracks on one disc, and thirteen tracks from Femm-Isation on the second disc. Includes a bonus t-shirt and poster.
Credits and personnel
Credits adapted from the liner notes of PoW!/LCS + Femm-Isation.
Emily Kaiho – (FEMM band member; RiRi and Honey-B agent); lead vocals, backing vocals
Hiro Todo – (FEMM band member; LuLa and W-Trouble agent); lead vocals, backing vocals
Mark Weinberg – songwriting, producing
Tania Doko – songwriting
Andrew Richard Smith – songwriting, producing
Brian Lee – songwriting, producing
Stuart Critchon – songwriting
Ruby Rose – songwriting
Jorge Mhondera – songwriting
Ben Preston – songwriting, producing
Sofia Toufa – songwriting
Scott Stallone – songwriting, producing
Dan Book – songwriting, producing
Alexei Misoul – songwriting, producing
Leah Haywood – songwriting
Daniel James – songwriting
Christopher Rojas – songwriting, producing
Dreamlab – producing
Evan Bogart – songwriting, producing
Bryan Michael Cox – songwriting, producing
Emanual Kiriakou – songwriting, producing
Brandon Lowery – songwriting, producing
Dan Omelio – songwriting, producing
Andreas Carlsson – songwriting, producing
Markus Bøgelund – songwriting, producing
Danielle Senior – songwriting, producing
Patrick Lukens – songwriting, producing
Nicole Tranquillo – songwriting, producing
Daniel Fält – songwriting
Johannes Jorgensen – songwriting
Grace Tither – songwriting
GL Music – producing
Scott Cutler – songwriting, producing
Anne Preven – songwriting, producing
Priscilla Renea – songwriting, producing
Oliver Goldstein – songwriting, producing
Hideaki Jinbu – mixing, engineer
Tom Coyne – mastering
Invaderous – remixing
Fz – (sfpr member) remixing
Avex Trax – FEMM's record label
Avex Entertainment Inc. – Femm's distribution label
Charts
References
External links
Femm-Isation – FEMM's official website.
Femm-Isation (Instrumental) – FEMM's official website.
2014 debut albums |
Hexapodidae is a family of crabs, the only family in the superfamily Hexapodoidea. It has traditionally been treated as a subfamily of the family Goneplacidae, and was originally described as a subfamily of Pinnotheridae. Its members can be distinguished from all other true crabs by the reduction of the thorax, such that only seven sternites are exposed, and only four pairs of pereiopods are present. Not counting the enlarged pair of claws, this leaves only six walking legs, from which the type genus Hexapus, and therefore the whole family, takes its name. Some anomuran "crabs", such as porcelain crabs and king crabs also have only four visible pairs of legs. With the exception of Stevea williamsi, from Mexico, all the extant members are found either in the Indo-Pacific oceans, or around the coast of Africa.
Fossil record
In addition to the extant taxa, the family contains two genera known only from fossils – Goniocypoda and Palaeopinnixa – and two further genera include both living and fossil representatives: Hexapus and Stevea. The family's fossil record extents back certainly as far as the Paleocene, with unverified reports of a species in the Maastrichtian of Senegal.
Genera
The following are the genera included under Hexapodidae:
Genera marked with are extinct
Bellhexapus De Angeli, Guinot, & Garassino, 2010
Eohexapus De Angeli, Guinot, & Garassino, 2010
Eurohexapus De Angeli, Guinot, & Garassino, 2010
Globihexapus Schweitzer & Feldmann, 2001
Goniocypoda Woodward, 1867
Hexalaughlia Guinot, 2006
Hexapinus Manning & Holthuis, 1981
Hexaplax Doflein, 1904
Hexapus De Haan, 1833
Mariaplax Rahayu & Ng, 2014
Lambdophallus Alcock, 1900
Latohexapus Huang, Hsueh, & Ng, 2002
Paeduma Rathbun, 1897
Palaeopinnixa Via, 1966
Parahexapus Balss, 1922
Pseudohexapus Monod, 1956
Rayapinus Rahayu & Ng, 2014
Spiroplax Manning & Holthuis, 1981
Stevea Manning & Holthuis, 1981
Thaumastoplax Miers, 1881
Theoxapus Rahayu & Ng, 2014
Tritoplax Manning & Holthuis, 1981
References
Crabs
Extant Paleocene first appearances
Taxa named by Edward J. Miers
Decapod families |
Guam competed at the 2013 World Championships in Athletics in Moscow, Russia, from 10–18 August 2013. A team of one athlete was announced to represent the country in the event.
Earlier in the season, Michael Alicto had won the 100m at the Guam National Championships by over half a second with a time of 11.13 seconds, in addition to taking home gold in the 200m and silver in the long jump which earned him the nation's only berth to the 2013 World Championships.
At the World Championships, Alicto finished sixth in his preliminary heat with a time of 11.39 seconds, which did not advance him to the next round.
Though Alicto has not competed in another global championship since, he was able to leverage the experience to help other athletes. In 2014, Guamanian sprinter Raquel Walker credited Alicto's advice for helping her progress towards her pursuit of Pollara Cobb's 100m record set at the previous Worlds, saying "Ever since I’ve been training with (Alicto) I’ve been feeling really good, my speed’s been getting better, and hopefully by the end of the season you’ll see something awesome."
Results
(q – qualified, NM – no mark, SB – season best)
Men
References
External links
IAAF World Championships – Guam
Nations at the 2013 World Championships in Athletics
World Championships in Athletics
Guam at the World Athletics Championships |
```c++
///////////////////////////////////////////////////////////////////////////////
// state.hpp
//
// LICENSE_1_0.txt or copy at path_to_url
#ifndef BOOST_XPRESSIVE_DETAIL_CORE_STATE_HPP_EAN_10_04_2005
#define BOOST_XPRESSIVE_DETAIL_CORE_STATE_HPP_EAN_10_04_2005
// MS compatible compilers support #pragma once
#if defined(_MSC_VER)
# pragma once
#endif
#include <boost/noncopyable.hpp>
#include <boost/xpressive/detail/detail_fwd.hpp>
#include <boost/xpressive/detail/core/access.hpp>
#include <boost/xpressive/detail/core/action.hpp>
#include <boost/xpressive/detail/core/sub_match_vector.hpp>
#include <boost/xpressive/detail/utility/sequence_stack.hpp>
#include <boost/xpressive/detail/core/regex_impl.hpp>
#include <boost/xpressive/regex_constants.hpp>
namespace boost { namespace xpressive { namespace detail
{
///////////////////////////////////////////////////////////////////////////////
// match_context
//
template<typename BidiIter>
struct match_context
{
typedef typename iterator_value<BidiIter>::type char_type;
match_context()
: results_ptr_(0)
, prev_context_(0)
, next_ptr_(0)
, traits_(0)
{
}
// pointer to the current match results, passed to actions as a parameter.
match_results<BidiIter> *results_ptr_;
// The previous match context, if this match_context corresponds to a nested regex invocation
match_context<BidiIter> *prev_context_;
// If this is a nested match, the "next" sub-expression to execute after the nested match
matchable<BidiIter> const *next_ptr_;
// A pointer to the current traits object
detail::traits<char_type> const *traits_;
};
///////////////////////////////////////////////////////////////////////////////
// attr_context
//
struct attr_context
{
// Slots for holding type-erased pointers to attributes
void const **attr_slots_;
// The previous attr context, if one exists
attr_context *prev_attr_context_;
};
///////////////////////////////////////////////////////////////////////////////
// match_flags
//
struct match_flags
{
bool match_all_;
bool match_prev_avail_;
bool match_bol_;
bool match_eol_;
bool match_not_bow_;
bool match_not_eow_;
bool match_not_null_;
bool match_continuous_;
bool match_partial_;
explicit match_flags(regex_constants::match_flag_type flags)
: match_all_(false)
, match_prev_avail_(0 != (flags & regex_constants::match_prev_avail))
, match_bol_(match_prev_avail_ || 0 == (flags & regex_constants::match_not_bol))
, match_eol_(0 == (flags & regex_constants::match_not_eol))
, match_not_bow_(!match_prev_avail_ && 0 != (flags & regex_constants::match_not_bow))
, match_not_eow_(0 != (flags & regex_constants::match_not_eow))
, match_not_null_(0 != (flags & regex_constants::match_not_null))
, match_continuous_(0 != (flags & regex_constants::match_continuous))
, match_partial_(0 != (flags & regex_constants::match_partial))
{
}
};
///////////////////////////////////////////////////////////////////////////////
// match_state
//
template<typename BidiIter>
struct match_state
: noncopyable
{
typedef BidiIter iterator;
typedef core_access<BidiIter> access;
typedef detail::match_context<BidiIter> match_context;
typedef detail::results_extras<BidiIter> results_extras;
typedef detail::regex_impl<BidiIter> regex_impl;
typedef detail::matchable<BidiIter> matchable;
typedef xpressive::match_results<BidiIter> match_results;
typedef detail::sub_match_impl<BidiIter> sub_match_impl;
typedef detail::actionable actionable;
BidiIter cur_;
sub_match_impl *sub_matches_;
std::size_t mark_count_;
BidiIter begin_;
BidiIter end_;
match_flags flags_;
bool found_partial_match_;
match_context context_;
results_extras *extras_;
actionable action_list_;
actionable const **action_list_tail_;
action_args_type *action_args_;
attr_context attr_context_;
BidiIter next_search_;
///////////////////////////////////////////////////////////////////////////////
//
match_state
(
BidiIter begin
, BidiIter end
, match_results &what
, regex_impl const &impl
, regex_constants::match_flag_type flags
)
: cur_(begin)
, sub_matches_(0)
, mark_count_(0)
, begin_(begin)
, end_(end)
, flags_(flags)
, found_partial_match_(false)
, context_() // zero-initializes the fields of context_
, extras_(&core_access<BidiIter>::get_extras(what))
, action_list_()
, action_list_tail_(&action_list_.next)
, action_args_(&core_access<BidiIter>::get_action_args(what))
, attr_context_() // zero-initializes the fields of attr_context_
, next_search_(begin)
{
// reclaim any cached memory in the match_results struct
this->extras_->sub_match_stack_.unwind();
// initialize the context_ struct
this->init_(impl, what);
// move all the nested match_results structs into the match_results cache
this->extras_->results_cache_.reclaim_all(access::get_nested_results(what));
}
///////////////////////////////////////////////////////////////////////////////
// reset
void reset(match_results &what, regex_impl const &impl)
{
this->extras_ = &core_access<BidiIter>::get_extras(what);
this->action_list_.next = 0;
this->action_list_tail_ = &action_list_.next;
this->action_args_ = &core_access<BidiIter>::get_action_args(what);
this->attr_context_ = attr_context();
this->context_.prev_context_ = 0;
this->found_partial_match_ = false;
this->extras_->sub_match_stack_.unwind();
this->init_(impl, what);
this->extras_->results_cache_.reclaim_all(access::get_nested_results(what));
}
///////////////////////////////////////////////////////////////////////////////
// push_context
// called to prepare the state object for a regex match
match_context push_context(regex_impl const &impl, matchable const &next, match_context &prev)
{
// save state
match_context context = this->context_;
// create a new nested match_results for this regex
nested_results<BidiIter> &nested = access::get_nested_results(*context.results_ptr_);
match_results &what = this->extras_->results_cache_.append_new(nested);
// (re)initialize the match context
this->init_(impl, what);
// create a linked list of match_context structs
this->context_.prev_context_ = &prev;
this->context_.next_ptr_ = &next;
// record the start of the zero-th sub-match
this->sub_matches_[0].begin_ = this->cur_;
return context;
}
///////////////////////////////////////////////////////////////////////////////
// pop_context
// called after a nested match failed to restore the context
bool pop_context(regex_impl const &impl, bool success)
{
match_context &context = *this->context_.prev_context_;
if(!success)
{
match_results &what = *context.results_ptr_;
this->uninit_(impl, what);
// send the match_results struct back to the cache
nested_results<BidiIter> &nested = access::get_nested_results(what);
this->extras_->results_cache_.reclaim_last(nested);
}
// restore the state
this->context_ = context;
match_results &results = *this->context_.results_ptr_;
this->sub_matches_ = access::get_sub_matches(access::get_sub_match_vector(results));
this->mark_count_ = results.size();
return success;
}
///////////////////////////////////////////////////////////////////////////////
// swap_context
void swap_context(match_context &context)
{
std::swap(this->context_, context);
match_results &results = *this->context_.results_ptr_;
this->sub_matches_ = access::get_sub_matches(access::get_sub_match_vector(results));
this->mark_count_ = results.size();
}
// beginning of buffer
bool bos() const
{
return this->cur_ == this->begin_;
}
// end of buffer
bool eos()
{
return this->cur_ == this->end_ && this->found_partial_match();
}
// is this the regex that is currently executing?
bool is_active_regex(regex_impl const &impl) const
{
return impl.xpr_.get() == this->context_.results_ptr_->regex_id();
}
// fetch the n-th sub_match
sub_match_impl &sub_match(int n)
{
return this->sub_matches_[n];
}
// called when a partial match has succeeded
void set_partial_match()
{
sub_match_impl &sub0 = this->sub_match(0);
sub0.first = sub0.begin_;
sub0.second = this->end_;
sub0.matched = false;
}
template<typename Traits>
Traits const &get_traits() const
{
return static_cast<traits_holder<Traits> const *>(this->context_.traits_)->traits();
}
private:
void init_(regex_impl const &impl, match_results &what)
{
regex_id_type const id = impl.xpr_.get();
std::size_t const total_mark_count = impl.mark_count_ + impl.hidden_mark_count_ + 1;
// initialize the context and the sub_match vector
this->context_.results_ptr_ = &what;
this->context_.traits_ = impl.traits_.get();
this->mark_count_ = impl.mark_count_ + 1;
this->sub_matches_ = this->extras_->sub_match_stack_.push_sequence(total_mark_count, sub_match_impl(begin_), detail::fill);
this->sub_matches_ += impl.hidden_mark_count_;
// initialize the match_results struct
access::init_match_results(what, id, impl.traits_, this->sub_matches_, this->mark_count_, impl.named_marks_);
}
void uninit_(regex_impl const &impl, match_results &)
{
extras_->sub_match_stack_.unwind_to(this->sub_matches_ - impl.hidden_mark_count_);
}
bool found_partial_match()
{
this->found_partial_match_ = true;
return true;
}
};
///////////////////////////////////////////////////////////////////////////////
// memento
//
template<typename BidiIter>
struct memento
{
sub_match_impl<BidiIter> *old_sub_matches_;
std::size_t nested_results_count_;
actionable const *action_list_head_;
actionable const **action_list_tail_;
attr_context attr_context_;
};
///////////////////////////////////////////////////////////////////////////////
// save_sub_matches
//
template<typename BidiIter>
inline memento<BidiIter> save_sub_matches(match_state<BidiIter> &state)
{
memento<BidiIter> mem =
{
state.extras_->sub_match_stack_.push_sequence(state.mark_count_, sub_match_impl<BidiIter>(state.begin_))
, state.context_.results_ptr_->nested_results().size()
, state.action_list_.next
, state.action_list_tail_
, state.attr_context_
};
state.action_list_.next = 0;
state.action_list_tail_ = &state.action_list_.next;
std::copy(state.sub_matches_, state.sub_matches_ + state.mark_count_, mem.old_sub_matches_);
return mem;
}
///////////////////////////////////////////////////////////////////////////////
// restore_action_queue
//
template<typename BidiIter>
inline void restore_action_queue(memento<BidiIter> const &mem, match_state<BidiIter> &state)
{
state.action_list_.next = mem.action_list_head_;
state.action_list_tail_ = mem.action_list_tail_;
*state.action_list_tail_ = 0;
}
///////////////////////////////////////////////////////////////////////////////
// restore_sub_matches
//
template<typename BidiIter>
inline void restore_sub_matches(memento<BidiIter> const &mem, match_state<BidiIter> &state)
{
typedef core_access<BidiIter> access;
nested_results<BidiIter> &nested = access::get_nested_results(*state.context_.results_ptr_);
std::size_t count = nested.size() - mem.nested_results_count_;
state.extras_->results_cache_.reclaim_last_n(nested, count);
std::copy(mem.old_sub_matches_, mem.old_sub_matches_ + state.mark_count_, state.sub_matches_);
state.extras_->sub_match_stack_.unwind_to(mem.old_sub_matches_);
state.attr_context_ = mem.attr_context_;
}
///////////////////////////////////////////////////////////////////////////////
// reclaim_sub_matches
//
template<typename BidiIter>
inline void reclaim_sub_matches(memento<BidiIter> const &mem, match_state<BidiIter> &state, bool success)
{
std::size_t count = state.context_.results_ptr_->nested_results().size() - mem.nested_results_count_;
if(count == 0)
{
state.extras_->sub_match_stack_.unwind_to(mem.old_sub_matches_);
}
// else we have we must orphan this block of backrefs because we are using the stack
// space above it.
if(!success)
{
state.attr_context_ = mem.attr_context_;
}
}
///////////////////////////////////////////////////////////////////////////////
// traits_cast
//
template<typename Traits, typename BidiIter>
inline Traits const &traits_cast(match_state<BidiIter> const &state)
{
return state.template get_traits<Traits>();
}
}}} // namespace boost::xpressive::detail
#endif
``` |
Otohime (乙姫) is the princess of the Dragon Palace in the Japanese folktale Urashima Tarō.
Otohime may also refer to:
People
Otohime Ryugu, a character in Okami-san and Her Seven Companions
Otohime, a goddess the anime series Lilpri
Otohime, a character in the 2009 anime series Muromi-san
Mutsumi Otohime, a character from the manga series Love Hina by Ken Akamatsu
, the second daughter of Minamoto no Yoritomo, nicknamed Otohime (乙姫).
, concubine or daughter of Emperor Ingyō.
Other
Otohime (音姫, lit. "Sound Princess"), a Japanese brand name for a flushing toilet sound simulator |
```php
<?php
namespace App\Http\Controllers;
use App\Http\Requests\StoreEventQuestionRequest;
use App\Models\Attendee;
use App\Models\Event;
use App\Models\Question;
use App\Models\QuestionAnswer;
use App\Models\QuestionType;
use Excel;
use Illuminate\Http\Request;
use JavaScript;
/*
Attendize.com - Event Management & Ticketing
*/
class EventSurveyController extends MyBaseController
{
/**
* Show the event survey page
*
* @param Request $request
* @param $event_id
* @return mixed
*/
public function showEventSurveys(Request $request, $event_id)
{
$event = Event::scope()->findOrFail($event_id);
JavaScript::put([
'postUpdateQuestionsOrderRoute' => route('postUpdateQuestionsOrder', ['event_id' => $event_id]),
]);
$data = [
'event' => $event,
'questions' => $event->questions->sortBy('sort_order'),
'sort_order' => 'asc',
'sort_by' => 'title',
'q' => '',
];
return view('ManageEvent.Surveys', $data);
}
/**
* Show the form for creating a new resource.
*
* @return \Illuminate\Http\Response
*/
public function showCreateEventQuestion(Request $request, $event_id)
{
$event = Event::scope()->findOrFail($event_id);
return view('ManageEvent.Modals.CreateQuestion', [
'event' => $event,
'question_types' => QuestionType::all(),
]);
}
/**
* Store a newly created resource in storage.
*
* @access public
* @param StoreEventQuestionRequest $request
* @return \Illuminate\Http\JsonResponse
*/
public function postCreateEventQuestion(StoreEventQuestionRequest $request, $event_id)
{
// Get the event or display a 'not found' warning.
$event = Event::findOrFail($event_id);
// Create question.
$question = Question::createNew(false, false, true);
$question->title = $request->get('title');
$question->is_required = (bool) $request->get('is_required', false);
$question->question_type_id = $request->get('question_type_id');
$question->save();
// Get options.
$options = $request->get('option');
// Add options.
if ($options && is_array($options)) {
foreach ($options as $option_name) {
if (trim($option_name) !== '') {
$question->options()->create([
'name' => $option_name,
]);
}
}
}
// Get tickets.
$ticket_ids = $request->get('tickets');
$question->tickets()->attach($ticket_ids);
$event->questions()->attach($question->id);
session()->flash('message', trans("Controllers.successfully_created_question"));
return response()->json([
'status' => 'success',
'message' => trans("Controllers.refreshing"),
'redirectUrl' => '',
]);
}
/**
* Show the Edit Question Modal
*
* @param Request $request
* @param $event_id
* @param $question_id
* @return mixed
*/
public function showEditEventQuestion(Request $request, $event_id, $question_id)
{
$question = Question::scope()->findOrFail($question_id);
$event = Event::scope()->findOrFail($event_id);
$data = [
'question' => $question,
'event' => $event,
'question_types' => QuestionType::all(),
];
return view('ManageEvent.Modals.EditQuestion', $data);
}
/**
* Edit a question
*
* @param Request $request
* @param $event_id
* @param $question_id
* @return \Illuminate\Http\JsonResponse
*/
public function postEditEventQuestion(Request $request, $event_id, $question_id)
{
// Get the event or display a 'not found' warning.
$event = Event::scope()->findOrFail($event_id);
// Create question.
$question = Question::scope()->findOrFail($question_id);
$question->title = $request->get('title');
$question->is_required = (bool) $request->get('is_required', false);
$question->question_type_id = $request->get('question_type_id');
$question->save();
$question_type = QuestionType::find($question->question_type_id);
if ($question_type->has_options) {
// Get options.
$options = $request->get('option');
$question->options()->delete();
// Add options.
if ($options && is_array($options)) {
foreach ($options as $option_name) {
if (trim($option_name) !== '') {
$question->options()->create([
'name' => $option_name,
]);
}
}
}
}
// Get tickets.
$ticket_ids = (array)$request->get('tickets');
$question->tickets()->sync($ticket_ids);
session()->flash('message', trans("Controllers.successfully_edited_question"));
return response()->json([
'status' => 'success',
'message' => trans("Controllers.refreshing"),
'redirectUrl' => '',
]);
}
/**
* Delete a question
*
* @param Request $request
* @param $event_id
* @return \Illuminate\Http\JsonResponse
*/
public function postDeleteEventQuestion(Request $request, $event_id)
{
$question_id = $request->get('question_id');
$question = Question::scope()->find($question_id);
$question->answers()->delete();
if ($question->delete()) {
session()->flash('message', trans("Controllers.successfully_deleted_question"));
return response()->json([
'status' => 'success',
'message' => trans("Controllers.refreshing"),
'redirectUrl' => '',
]);
}
return response()->json([
'status' => 'error',
'id' => $question->id,
'message' => trans("Controllers.this_question_cant_be_deleted"),
]);
}
/**
* Show all attendees answers to questions
*
* @param Request $request
* @param $event_id
* @param $question_id
* @return mixed
*/
public function showEventQuestionAnswers(Request $request, $event_id, $question_id)
{
$answers = QuestionAnswer::scope()->where('question_id', $question_id)->get();
$question = Question::scope()->withTrashed()->find($question_id);
$attendees = Attendee::scope()
->has('answers')
->where('event_id', $event_id)
->get();
$data = [
'answers' => $answers,
'question' => $question,
];
return view('ManageEvent.Modals.ViewAnswers', $data);
}
/**
* Export answers to xls, csv etc.
*
* @param Request $request
* @param $event_id
* @param string $export_as
*/
public function showExportAnswers(Request $request, $event_id, $export_as = 'xlsx')
{
Excel::create('answers-as-of-' . date('d-m-Y-g.i.a'), function ($excel) use ($event_id) {
$excel->setTitle(trans("Controllers.survey_answers"));
// Chain the setters
$excel->setCreator(config('attendize.app_name'))
->setCompany(config('attendize.app_name'));
$excel->sheet('survey_answers_sheet_', function ($sheet) use ($event_id) {
$event = Event::scope()->findOrFail($event_id);
$sheet->fromArray($event->survey_answers, null, 'A1', false, false);
// Set gray background on first row
$sheet->row(1, function ($row) {
$row->setBackground('#f5f5f5');
});
});
})->export($export_as);
}
/**
* Toggle the enabled status of question
*
* @param Request $request
* @param $event_id
* @param $question_id
* @return \Illuminate\Http\JsonResponse
*/
public function postEnableQuestion(Request $request, $event_id, $question_id)
{
$question = Question::scope()->find($question_id);
$question->is_enabled = ($question->is_enabled == 1) ? 0 : 1;
if ($question->save()) {
return response()->json([
'status' => 'success',
'message' => trans("Controllers.successfully_updated_question"),
'id' => $question->id,
]);
}
return response()->json([
'status' => 'error',
'id' => $question->id,
'message' => trans("basic.whoops"),
]);
}
/**
* Updates the sort order of event questions
*
* @param Request $request
* @return \Illuminate\Http\JsonResponse
*/
public function postUpdateQuestionsOrder(Request $request)
{
$question_ids = $request->get('question_ids');
$sort = 1;
foreach ($question_ids as $question_id) {
$question = Question::scope()->find($question_id);
$question->sort_order = $sort;
$question->save();
$sort++;
}
return response()->json([
'status' => 'success',
'message' => trans("Controllers.successfully_updated_question_order"),
]);
}
}
``` |
Corridor selection
There are a range of HSR routes being discussed in Australia.
These include long intercity routes (mainly along the east coast corridor) and shorter inner city routes, such as Sydney to Newcastle, Sydney to Penrith and Sydney to Macarthur.
East Coast corridor
The most frequently studied route for high-speed rail in Australia is between Melbourne, Canberra, Sydney and Brisbane. There are two broad corridor alignment options between each capital city on the route – a coastal and an inland corridor. Each has its own advantages and disadvantages from engineering, environmental, population and national development points of view.
Melbourne—Canberra
Inland — Exiting Melbourne via the existing Broadmeadows corridor, the line would cross the Dividing Range at Seymour. It would then join the existing North East railway corridor through Benalla and Wangaratta, which would require only minimal straightening. Albury would be approached either from the east via the Murray River flats, or from the south via a new corridor through Beechworth. North of Albury, there are three options – one is to remain with the Hume Highway corridor through the increasingly dissected countryside through Gundagai and Yass before entering Canberra from the north. The other options are a more southerly route cutting through the Brindabella Ranges direct to Canberra (which would require extensive tunneling), or diverting north along the Main Southern railway to service the large regional centre of Wagga Wagga. Although this would be a longer route, the engineering costs would be lower due to the less mountainous terrain. After Wagga Wagga, the line would either continue on the Main Southern line to Cootamundra and Yass and enter Canberra from the north, or divert east through the Murrumbidgee River valley to a shorter tunnel beginning at Tumut and enter Canberra from the west. Due to the better regional development opportunities along the inland corridor, and perhaps fewer environmental issues, the Arup/TMG study identified this corridor as the preferred alignment.
Coastal — Exiting Melbourne via the broad-gauge Pakenham corridor, the line would traverse the generally flat Gippsland region, encompassing the towns of Traralgon, Sale, Bairnsdale and Orbost, before turning north into heavily dissected country. This climb from Gippsland to the Monaro region would necessitate numerous tunnels and viaducts, and possibly a prevailing grade of up to 3.5%. The line would generally follow the Monaro Highway to a summit of near Nimmitabel, and then continue on to Cooma and Queanbeyan. This alignment must necessarily pass through several National Parks and other regions of environmental significance, which could count against the selection of this corridor. Additionally, a station in central Canberra is difficult to achieve on this alignment; it would most likely have to be located at Canberra Airport or Queanbeyan.
Canberra—Sydney
Inland — The railway would exit Canberra to the north or east on a new alignment, roughly following the Hume Highway corridor through Goulburn, Bowral and Campbelltown. Entry to metropolitan Sydney could be effected by utilising the existing East Hills and Airport lines via Sydney Airport.
Coastal — This corridor would be the same until Goulburn, where the line would turn east towards Wollongong. This alignment would present major engineering challenges due to having to cross the Illawarra escarpment twice, necessitating a tunnel on the southern approach, and several tunnels in the order of on the northern exit from Wollongong. The line could then utilise the undeveloped F6 Freeway corridor from Sutherland to Sydney Airport, from which it would use the subway system to reach Central station. Some have suggested an alignment to Nowra, thereafter continuing to Wollongong and Sydney, however the engineering and environmental considerations on such a route would be significant.
Sydney—Brisbane
Newcastle leg — Due to the density of existing development and the formidable terrain, there is no easy way of exiting Sydney to the north. One option is to use the North Shore line to reach Hornsby, whereupon a new alignment would follow the existing Pacific Motorway corridor, cross Broken Bay via bridge or tunnel and enter Woy Woy and Gosford via a series of tunnels and viaducts. A second option is to tunnel from North Sydney directly to Woy Woy via a tunnel (making it one of the longest tunnels in the world). The alignment would then continue to Newcastle following the existing road and rail corridors. This route could use the Sydney Harbour Bridge if two of the existing highway lanes were returned to rail use.
Inland — From Newcastle, the line would transit the Hunter Valley through Singleton and Muswellbrook before crossing the Great Dividing Range at Ardglen. After Tamworth, the line would have to climb to over above sea level to reach the New England Tableland. After Armidale, it would climb even higher (peaking at above sea level) before reaching Glen Innes, Tenterfield, Warwick and Toowoomba. The existing rail corridor on the Tableland would require extensive straightening and sections of new alignment. After Toowoomba, a favourable grade (albeit involving several 5–10 km tunnels) would take the railway through Ipswich and into Brisbane
Coastal — This route would follow the coast through Taree, Port Macquarie, Coffs Harbour, Grafton, Lismore and the Gold Coast before entering Brisbane via the Gold Coast line. Although there are no significant mountains to cross except the escarpment near the Queensland border, there are numerous major estuaries which will require long viaducts. This route is shorter than the inland option, presents less challenging engineering obstacles, and passes through regions of greater population density. For this reason the Arup-TMG study identified it as being slightly preferable to the inland route.
Greater Melbourne
In late 2008, Transrapid re-entered the Australian high-speed rail debate with a proposal put forward to the Government of Victoria to build a privately funded and operated Maglev line to service the Greater Melbourne metropolitan area. It was presented as an alternative to the Cross-City Tunnel proposed in the Eddington Transport Report, which neglected to investigate above-ground transport options.
The proposed Maglev would connect the city of Geelong to metropolitan Melbourne's outer suburban growth corridors, Tullamarine and Avalon domestic and international terminals in under 20 minutes, continuing on to Frankston, in under 30 minutes. It would service a population of over 4 million, and Transrapid claimed a price of A$4 billion. However, the Victorian government dismissed the proposal in favour of the underground metropolitan network suggested by the Eddington Report.
Noosa-Gold Coast
The 2010 Infrastructure Partnerships Australia report identified Noosa-Brisbane-Gold Coast as a potentially viable high-speed rail link, and a possible precursor to a full east-coast system. The report predicted that a 350 km/h system would reduce travel times between Cooroy (22 km west of Noosa) and Brisbane to 31 minutes (currently 2:08 hours), capturing as much as 84% of the total commuter market. Travel time between Brisbane and the Gold Coast would be reduced to 21 minutes, capturing up to 27% of commuters.
Perth-Bunbury
In January 2010, Western Australia's Public Transport Authority completed a feasibility study into a high-speed rail link between Perth and Bunbury. The proposed route would follow the existing narrow gauge Mandurah line to Anketell, and then follow the Kwinana Freeway and Forrest Highway to Lake Clifton, including 140 km of new track. It would replace the existing Australind passenger service, which is under increasing use for freight traffic.
The proposed service would have a maximum speed of 160 km/h, at which the travel time from Perth Underground to a new station in central Bunbury would be 91 minutes. However, the notional corridor allows for future upgrade to 200 km/h.
References
High-speed rail in Australia |
The 1847 Grand National Steeplechase was the ninth official annual running of a Handicap Steeple-chase horse race which took place at Aintree Racecourse near Liverpool on 3 March 1847 and attracted a then record field of twenty-six runners. It was won by Mathew, ridden by Denny Wynne in the colours of County Cork landowner, John Courtenay. This was the first time the race was officially named The Grand National Steeplechase, having previously been run under the title, Grand Liverpool Steeplechase.
The Course
Contemporary newspaper reporters stated that the race was run over the same course as the previous year, describing the start as being a ploughed field with light fencing, narrow ditching and low cops and banks over four fields before bending to the left to jump a brook with short timber. The course then turned left towards the Canal over fences described as being of a practicable character before a leap over a sharp left turn before taking a decent water and timber jump. This took the runners over very heavy land to a ditch with a bank on the take off side. the next field led the runners into the lane at Anchor Bridge and then onto the course, the far end of which was known as the training ground with a stiff hurdle placed alongside the distance chair, topped with gorse six foot high. Opposite the stand was an artificial water jump fifteen feet wide and three feet deep. the runners then took a very awkward bank and ditch before crossing the lane at Melling Road before setting off on a second circuit. the finish of the race was beside the distance judge's chair meaning the fences to be taken was reduced from thirty-one the previous year to twenty-nine this year.
Start – Just beyond the Melling Road. Fence 1 [17 on the second circuit] Light fence. Fence 2 [18] Light fence. Fence 3 [19] A low cops. Fence 4 [20] Bank. Fence 5 [21] Brook with short timber. Fence 6 [22] Practicable fence. Fence 7 [23] Practicable fence. Fence 8 [24] A sharp left turn Fence 9 [25] A decent timber and water jump. Fence 10 [26] A fence into very heavy land. Fence 11 [27] A ditch with a bank. Fence 12 [28] A fence into the Anchor Bridge Road. Fence 13 [29] An artificial hurdle leaving the training ground on the racecourse proper. Fence 14 A stiff hurdle topped with gorse six feet high. Fence 15 A water jump increased in width by ten feet to fifteen feet and reduced in depth by a foot to three feet. Fence 16 An awkward bank and ditch.
Finishing order
Cure-All, Discount, Proceed, Profligate, Little Tommy, a horse by Tom Brown, Sam Slick, Railroad, Christopher North, Ragman, Forest Boy and Nimble Harry were withdrawn.
The Race
Grenade was the early leader but was jostled at the third fence and lost his place. Jerry and Ballybar then led the runners to the fourth fence where the latter refused and did not continue. The runners took the brook later to be known as Valentine's in great style but at the next obstacle several horses came into contact and Valeria was pulled up, being unable to continue.
Cumberland Lassie had been among the leaders throughout but as she approached the Anchor Bridge crossing she struck a post and ran off the course onto the road beyond.
Jerry led at the water jump, followed by Clinker, St Leger, St Ruth, Mathew, Culverthorpe, Pioneer and Brunette with these remaining the main contenders for most of the second circuit. Jerry was challenged by St Leger who appeared to the crowd to be on his way to victory until challenged and overhauled in the final strides by Mathew. Seven horses were recorded as finishing, though several other runners may have completed the course unrecorded by the press.
Aftermath
The win has gone down in history as being a hugely popular one among the Irish, bearing in mind that this was at the height of the Great Famine in the country. In truth the Irish press largely ignored the race in those days and it was only the wealthy friends of Mr John Courtenay in and around the County Cork area who benefited from the victory. In actuality Courtenay was considered among the most ruthless of the landowners who were, at this time forcibly evicting their tenants for being unable to meet their rent and as a result the rank and file Irishmen had placed heir support with another Irish entrant Brunette. In the event, it was only this huge body of support from across the Irish sea, and one large wager in particular that saw her start at all as she was not considered in a fit state to race at all. Later histories of the race state that she was tailed off for most of the race but contemporary reports place her heavily involved in the front rank and her being recorded as a finisher support the contemporary accounts.
Much of the early history of the Grand National was told many years after the events and often from memory with the result that the winner, Mathew appears on the winners board at Aintree carrying the modern spelling of Matthew. The sixth horse The False Heir is often recorded as a non finisher while the favourite The Roarer, along with Young Lottery are not recorded as having taken part at all. As a result, many modern books and websites state six finishers in a field of twenty-six runners instead of the seven from twenty-eight recorded by the press of the time.
Sources
The Irish Newsletter 4 March 1847
The Times 4 March 1847
The Liverpool Mercury 4 March 1847
Notes
Grand National
1847
Grand National
19th century in Lancashire
March 1847 events |
Edward Eugene Sutton (March 12, 1936 – May 23, 2020) was an American college basketball coach. A native of Bucklin, Kansas, Sutton played college basketball at Oklahoma A&M (later Oklahoma State) and was a head coach at the high school, junior college, and college levels spanning six decades.
After beginning his coaching career as a graduate assistant at Oklahoma State under Henry Iba, Sutton was a successful head coach at Tulsa Central High School and the College of Southern Idaho. Sutton began coaching at the NCAA level in 1969 at Creighton University, followed by Arkansas from 1974 to 1985, Kentucky from 1985 to 1989, and Oklahoma State from 1990 to 2006. For part of the 2007–08 season, Sutton was interim head coach at San Francisco. During his college coaching career, Sutton is one of only eight NCAA Division I coaches to have had more than 800 career wins. From 1977 to 2005, Sutton's teams appeared in all but two NCAA Tournaments. Sutton was inducted into the College Basketball Hall of Fame in 2011 and Basketball Hall of Fame in 2020.
Early life and education
Sutton was born in Bucklin, Kansas. After graduating from Bucklin High School in 1954, Sutton enrolled at what was then Oklahoma A&M College, which became Oklahoma State University–Stillwater in 1957. At Oklahoma A&M/State, Sutton played at guard for the Cowboys basketball team from 1955 to 1958 under head coach Henry Iba. In his junior season of 1956–57, Sutton led the Oklahoma A&M Cowboys in free throw percentage at .843. As a senior in 1957–58, Sutton averaged 8.3 points and was part of a team that qualified for the NCAA tournament. Sutton graduated from Oklahoma State with a bachelor's degree in 1958.
Coaching career
Early coaching career (1958–1969)
Sutton began his coaching career as a graduate assistant for Iba at Oklahoma State in the 1958–59 school year before completing his master's degree in 1959. From 1959 to 1966, Sutton was head varsity basketball coach at Tulsa Central High School in Tulsa, Oklahoma, where he had a cumulative record of 119–51. Moving up to the junior college level, Sutton became the first head coach at the College of Southern Idaho from 1966 to 1969, with a cumulative 83–14 record.
Creighton (1969–1974)
From 1969 to 1974, Sutton was head coach at Creighton University, where he inherited a Bluejays program that had three consecutive losing seasons and led them to five consecutive winning seasons, including a 23–7 record and NCAA tournament appearance in the 1973–74 season.
Arkansas (1974–1985)
In 1974, Sutton became head coach at the University of Arkansas. Inheriting an Arkansas Razorbacks program that had losing records in three of the last four seasons and no postseason appearances since 1958, Sutton compiled a record of 260-75 from 1974 to 1985, including five Southwest Conference regular season championships, nine NCAA Tournament appearances, and a Final Four appearance in 1978.
His success led Arkansas to expand its home basketball venue, Barnhill Arena, from 5,200 seats to 9,000. Sutton also coached a trio of basketball players, all from the state of Arkansas, known as "The Triplets": Ron Brewer, Marvin Delph, and Sidney Moncrief.
On February 12, 1984, Arkansas had a 65–64 upset win over an undefeated, no. 1 North Carolina team that featured Michael Jordan, Sam Perkins and Brad Daugherty. The game took place at the Pine Bluff Convention Center in Pine Bluff, Arkansas, and NBC Sports televised the game nationally. Arkansas finished the 1983–84 season with a 23–7 record and no. 8 AP Poll ranking; however, despite being a no. 2 seed in the NCAA tournament, Arkansas lost to 7 seed Virginia 53–51 in overtime. In Sutton's final season as head coach in 1984–85, Arkansas went 22–13 and qualified for the second round of the NCAA tournament.
Kentucky (1985–1989)
On April 2, 1985, the University of Kentucky hired Sutton as head coach of the Kentucky Wildcats to replace Joe B. Hall. In a prepared statement, Hall said: "...with Eddie, I see nothing but great days ahead."
He coached the Wildcats for four years, leading them to the Elite Eight of the 1986 NCAA tournament. Two seasons later, Sutton and the 25-5 Wildcats captured their 37th SEC title (which was later vacated by the SEC) and were ranked as the No. 6 college basketball team in the nation by the Associated Press and UPI before being upset as the No. 2 seed in the Southeast Regional by Villanova in the 1988 NCAA tournament.
However Sutton's tenure at Kentucky ended at the close of the 1988–89 season after a scandal and a losing record tarnished the school's basketball program. Kentucky entered the 1988–89 season lacking significant talent in their lineup. The previous season's offensive and defensive stars Ed Davender, Rob Lock and Winston Bennett had all graduated from school, while All-SEC sophomore Rex Chapman left school early to enter the 1988 NBA draft. Additionally, sophomore standout Eric Manuel was suspected of cheating on his college entrance exam and voluntarily agreed to sit out until the investigation was finished. Potential star recruit Shawn Kemp transferred out of Kentucky after signing with the school early that year. As it turned out, Manuel didn't play a single game as the investigation dragged through the entire season, essentially placing the Wildcats in the hands of inexperienced sophomore LeRon Ellis and freshman Chris Mills. The two underclassmen struggled to fill the talent vacuum on the court and the Wildcats finished with a losing record of 13-19, the team's first losing full-season record since 1927.
The scandal broke when it was alleged that Emery Worldwide employees discovered $1,000 in cash in an envelope Kentucky assistant coach Dwane Casey supposedly sent to Mills' father. It was later shown that Casey was uninvolved in the Emery envelope incident.
The NCAA announced at the end of the season that its investigation into the basketball program had found the school guilty of violating numerous NCAA policies. The NCAA deemed the violations so egregious that it seriously considered hitting the Wildcats with the "death penalty", which would have shut down the entire basketball program (as opposed to simply being banned from postseason play) for up to two years. Kentucky was eligible for this severe penalty because it was already on probation for failing to cooperate with an investigation into an extensive scheme of payments to recruits.
By then, however, Sutton was already gone. In March, school president David Roselle told Sutton that he had lined up enough support on UK's athletics board to fire him unless he resigned. Rather than face all-but-certain termination, Sutton resigned. Athletic director Cliff Hagan resigned as well. The Wildcats were slapped with three years' probation, a two-year ban from postseason play and a ban from live television in 1989–90. Manuel was also banned from ever playing again for any NCAA member school.
Oklahoma State (1990–2006)
After a year away from the game, Sutton returned to his alma mater, Oklahoma State, on April 11, 1990. He inherited a program that had fallen on hard times. At the time of his hire, since joining (or rejoining, depending on the source) the Big Eight Conference in 1957, Oklahoma State appeared in only three NCAA Tournaments. Previous Oklahoma State head coach Leonard Hamilton had also resigned to take the job at the University of Miami.
In his first season at Oklahoma State, Sutton led the Cowboys to a 24–8 record, Big Eight regular season title, and Sweet 16 appearance in the 1991 NCAA tournament. In the 1991–92 season, Oklahoma State improved to 28–8 and made it to a second straight Sweet 16, followed by two more NCAA Tournament appearances in 1993 and 1994.
In Sutton's fifth season, the 1994–95 Oklahoma State team, led by Bryant Reeves (also known as "Big Country") and Randy Rutherford, won the Big Eight tournament and advanced to the Final Four for the first time since 1951. Following the season, The Oklahoman sports columnist Berry Tramel observed: "Sutton is pleased that pride has returned to the court made famous by Iba." Reeves went on to be selected sixth overall in the 1995 NBA draft.
Sutton continued to coach Oklahoma State following the school's move from the Big Eight to Big 12 Conference in 1996.
Oklahoma State's best season under Sutton was in 2003–04. With the roster including a significant number of transfers, Oklahoma State had a 31–4 overall record that tied the school record for overall wins in addition to gaining Big 12 regular season and tournament titles and the school's second Final Four appearance under Sutton. The 2003–04 team included junior college transfer Tony Allen, who would go on to be the 25th overall pick in the 2004 NBA draft and a six-time All-Defensive honoree in the NBA.
On January 15, 2005, the court at Oklahoma State's home arena, Gallagher-Iba Arena, was officially renamed Eddie Sutton Court.
On February 10, 2006, Sutton was involved in a car accident in Stillwater. He was cited for driving under the influence. Witnesses said that Sutton fell and hit his head at the Gallagher-Iba Arena parking lot, and The Oklahoman reported that campus police officers and athletic department physicians helped Sutton into his university-provided Dodge Durango. After declining a police officer's offer for a ride or ambulance, Sutton hit another SUV from behind at 60 mph, resulting in minor injuries for the other driver. Following the accident, Sutton's blood alcohol level was measured at .22, nearly three times the legal limit of .08.
Sutton announced on February 14 that he would take a medical leave of absence from the basketball team, citing his health problems and the accident as reasons. Assistant coach and son Sean Sutton served as acting head coach for the remainder of the season. The following day, in a prepared statement delivered over the phone at a press conference, Sutton admitted he had taken prescription medication due to back pain and "bought a bottle" of alcohol on the night of the accident. Sutton went on to say: "I have a problem with alcohol. That said, I make no excuses for what has happened. I recognize it and I will be seeking treatment for it. I know I have let many people down."
Sutton eventually resigned as head coach May 19, 2006, succeeded by Sean Sutton. In 16 seasons, Sutton had a 368–151 record at Oklahoma State with 13 NCAA Tournament appearances, two regular season conference titles (Big Eight in 1991, Big 12 in 2004), and three conference tournament titles (Big Eight in 1995, Big 12 in 2004 and 2005).
San Francisco (2007–2008)
On December 26, 2007, Sutton came out of retirement to replace Jessie Evans as head coach at the University of San Francisco on an interim basis.
On February 2, 2008, Sutton became the fifth NCAA Division I men's basketball coach to reach 800 career wins after San Francisco rallied from a 19-point second half deficit to defeat Pepperdine 85–82 in an away game. San Francisco concluded the season with an overall 10–21 record, including 6–13 under Sutton. Following the season, San Francisco hired Rex Walters as head coach.
Head coaching record
Junior college
Source:
College
Source:
*Kentucky vacated the 1987–88 SEC regular season and tournament titles as well as its NCAA Tournament appearance after Eric Manuel was found to be academically ineligible.
**Due to sanctions from recruiting violations, Sutton and his entire staff were forced to resign following the 1988-89 season.
*** Includes wins that resulted from Texas Tech win forfeitures
Personal life
Eddie Sutton was married to Patsy Wright from 1958 until her death in 2013. They had three children and six grandchildren. Two of Sutton's children would become college basketball coaches. Sean Sutton coached at Oklahoma State for 15 seasons, first as an assistant under his father from 1993 to 2006 then as head coach from 2006 to 2008, before serving as an assistant coach at Oral Roberts University from 2011 to 2017 and a special advisor to head coach Chris Beard at Texas Tech since 2017. Scott Sutton played for Oklahoma State from 1992 to 1994, was head coach at Oral Roberts from 1999 to 2017, and has been an assistant coach at Oklahoma State since 2017.
In his final years, Sutton lived in southern Tulsa, Oklahoma. On May 23, 2020, Sutton died in Tulsa at age 84, after being in hospice care.
See also
List of college men's basketball coaches with 600 wins
List of NCAA Division I Men's Final Four appearances by coach
References
External links
Voices of Oklahoma interview with Eddie Sutton. First person interview conducted on September 30, 2010, with Eddie Sutton.
1936 births
2020 deaths
American men's basketball coaches
American men's basketball players
Arkansas Razorbacks men's basketball coaches
Basketball coaches from Kansas
Basketball players from Kansas
College men's basketball head coaches in the United States
Creighton Bluejays athletic directors
Creighton Bluejays men's basketball coaches
High school basketball coaches in Oklahoma
Kentucky Wildcats men's basketball coaches
Naismith Memorial Basketball Hall of Fame inductees
National Collegiate Basketball Hall of Fame inductees
NCAA sanctions
Oklahoma State Cowboys basketball coaches
Oklahoma State Cowboys basketball players
People from Ford County, Kansas
San Francisco Dons men's basketball coaches
Southern Idaho Golden Eagles men's basketball coaches
Basketball players from Tulsa, Oklahoma |
Learned industriousness is a behaviorally rooted theory developed by Robert Eisenberger to explain the differences in general work effort among people of equivalent ability. According to Eisenberger, individuals who are reinforced for exerting high effort on a task are also secondarily reinforced by the sensation of high effort. Individuals with a history of reinforcement for effort are predicted to generalize this effort to new behaviors.
Operationalization of industriousness
An individual is considered industrious if he or she demonstrates perseverance and determination in performing a task. This term has also been used interchangeably with work ethic, which is generally regarded as the attitude that hard work and effort is virtuous. Learned industriousness theory asserts that industriousness is developed over time through a history of reinforcement.
Possible relationship to learned helplessness
Learned helplessness is a term to explain a specific pattern of behavior that occurs in both animals and humans. When an animal or human is consistently exposed to an aversive condition (pain, unpleasant noise, etc.) and is unable to escape this condition, that animal or human will become helpless and stop attempting escape. The animal or human may develop motivational deficits, as demonstrated in learned helplessness experiments. In contrast, learned industriousness theory attempts to explain why some individuals are more motivated than others. In an attempt to merge these two phenomena, Eisenberger, Park, & Frank invoked learned industriousness in children by providing task-contingent verbal approval for a small group of behaviors, contrasting outcomes between a group of children conditioned to exhibit learned helplessness and a control group. On a subsequent approval-contingent task, children conditioned by task-contingent verbal approval outperformed controls. However, the learned-helplessness group performed no differently from controls.
Antecedents of industriousness
Effort
Effort is the subjective experience of fatigue felt by the body when it is in motion or meets resistance. This fatigue can refer to both physical and mental fatigue depending on the task at hand. Until the theory of learned industriousness, effort was generally considered an aversive sensation. Hull summed up this concept with the Law of Least Effort, which asserts that individuals will choose a solution that minimizes effort for any given problem. Learned industriousness theory is considered an addendum to the Law of Least Effort.
Relationship between effort and goal-setting strategies
Individuals with high levels of industriousness have a history of applying great effort towards tasks. It has been demonstrated in many studies that different uses of goals result in more effort and task persistence. Thus, specific goal-setting strategies are antecedents to effort and subsequently increase the likelihood of an individual 'learning' industriousness. Below is an overview of the findings.
A goal is defined as the "object or aim of an action". As motivational tools, goals have been shown to improve performance in a wide variety of settings. For example, one study looked at the effects of high goals versus low goals on performance. To investigate this effect, students were given goals for a brainstorming activity; those with higher goals were able to brainstorm more ideas than those with lower goals. Therefore, the investigator concluded that goal setting not only increases performance, but more ambitious goals evoke better performance than lower-set goals.
In addition to improving performance, setting goals also increases task effort and persistence. In one study, participants were assigned to three groups: short-term goals, long-term goals, and a control group with no goals. The participants were then asked to attempt a complicated mirror maze as many times as they would like. Both groups with goals persisted on the maze task significantly longer than the control group, providing evidence that goals promote higher effort and persistence.
Another facet of goals that has been studied in relation to task persistence is whether the goal is a cooperative or competitive goal structure. A cooperative goal structure is one in which an individual must work alongside a group to reach a common goal, whereas a competitive goal structure is one in which an individual competes with others to reach a goal. The investigators tested whether participants' social values (cooperativeness, competitiveness, and individualism) moderate the relationship between goal structure and task persistence. In accordance with their hypotheses, individuals who were classified as "cooperators" persisted longer on the cooperative goal-structured task than the competitive goal-structured task. Similarly, individuals who were classified as "individualists" persisted longer on a competitive goal-structured task than a cooperative one. Therefore, the investigators conclude that the effect of "cooperative versus competitive goal structures on task persistence are influenced by individuals' social values and history of rewarded effort".
Relationship between effort and task interest/difficulty
There are certain aspects of tasks that induce greater effort and persistence: a performer's interest in the task and the level of difficulty of the task. These factors are relevant in creating an environment where an individual is likely to exert more effort and, in turn, become more industrious. Therefore, task interest and task difficulty may both act as moderators in the relationship between effort and industriousness.
Task interest, or an individual's engagement in an activity, is claimed to be an antecedent to the exertion of effort on a task. In a study by Fisher & Noble, the hypothesis that task interest is important for self-regulation during performance and task effort was empirically tested. The findings suggest that task interest positively predicted effort with a significant correlation. While a significant correlation cannot prove causation, there is evidence that higher effort is linked to higher intrinsic motivation. Other studies have supported this finding as well.
Task difficulty is also suggested to precede high effort. The reasoning behind this claim is that high difficulty tasks evoke high effort exertion if the individual is motivated to succeed on the task. The study conducted by Fisher and Noble also supports this hypothesis, as a significant positive relationship between task difficulty and effort was found.
Reinforcement
According to Daniels & Daniels, reinforcement is any stimulus, event, or situation that fulfills the following two requirements:
Follows a behavior
Increases the frequency of that behavior
A stimulus, event, or situation is considered a reinforcer if it follows a targeted behavior and causes the increased occurrence of that behavior. Many confuse the terms "reward" and "reinforcer" because they often mean the same thing; a reward is given as a consequence of a desired behavior and often motivates an individual to perform that behavior again in order to receive another reward. However, individuals can receive rewards and not increase the behavior in question (e.g., receiving a prize for completing a marathon may not motivate an individual to run more marathons). In that case, the reward is not a reinforcer because it does not increase the frequency of the behavior. Positive reinforcement is any stimulus that is presented after a behavior and increases the frequency of that behavior. Negative reinforcement is the removal of an aversive stimulus after a behavior that increases the frequency of that behavior. Both positive and negative reinforcement are effective in the development of industriousness.
Reinforcing high effort
Learned industriousness theory asserts that reinforcing an individual for achieving a performance standard increases the likelihood of that individual's performing those behaviors again. If the individual exerted high levels of effort during the completion of the task, the effort takes on its own reinforcing value. This is because the individual enjoys the sensation of working hard because it is associated with reinforcement. Therefore, this individual is more likely to generalize this high level of effort to other tasks because it is less aversive and is associated with positive results. On the other hand, the theory also claims that if an individual has a history of being reinforced for completing tasks with very low levels of effort, that individual will eventually generalize this low level of effort to other tasks. This facet of the theory is termed "learned laziness." Evidence for these claims is provided below.
Eisenberger's theory claims an essentially dichotomous relationship between effort and reinforcement: the exertion of low effort on a simple tasked paired with high levels of reinforcement will result in low levels of effort on future tasks; on the other hand, the exertion of high effort on a difficult task paired with low levels of reinforcement (intermittent reinforcement) will result in high levels of effort on future tasks. A study conducted by Drucker et al. showed support for this claim. In this study, participants were randomly assigned to computer tasks that ranged in level of difficulty and then given either high or low levels of reinforcement for performance on the task. Participants then were given an anagram task on which their persistence time was measured. In accordance with Eisenberger's theory, individuals who were highly reinforced for performance on the low-difficulty computer task spent less time persisting on the subsequent anagram task, demonstrating that the low level of effort generalized to another activity. Additionally, individuals who were given low levels of reinforcement for performance on the moderately high-difficulty computer task spent more time persisting on the anagram task. This demonstrated that the effort exerted on the first task, paired with low levels of reinforcement, generalized to the following task. However, participants who were given the highest-difficulty computer tasks did not generalize this effort. According to the researchers, this version of the task was so difficult that the participants could not succeed and thus demonstrated a pattern of behaviors similar to learned helplessness.
Consequences
Increased effort
In addition to being an antecedent to industriousness, effort is the foremost consequence of learned industriousness theory. As predicted by the theory, multiple experimental studies have demonstrated increased effort when paired with reinforcement.
Pierce, Cameron, Banko, and So conducted two studies in directly testing Eisenberger's theory. Mimicking Drucker's methodology, the authors placed participants in a task that was of either constant or progressively higher difficulty and then either rewarded for completing the task or not rewarded (a 2x2 experiment). Afterwards the participants were presented with a difficult free-choice task. Participants who were in the progressive difficulty-reward condition spent more time on the free-choice task, especially compared to the constant difficulty-reward condition (who spent the least amount of time). A year later, Cameron, Pierce, and So repeated the experiment, this time with an easy/difficult task condition split instead of a constant/progressive difficulty condition split. Not only did participants in the difficult-reward condition put forth more effort in the free-choice phase, the authors found that participants who were rewarded for completing the difficult task performed better on the free choice task than those who were not rewarded. Additionally, participants who were rewarded for completing the easy task performed worse on the free choice task than those who were not rewarded.
Another similar study found that the secondary effort reinforcement, both positive and negative, is equally transferable to tasks other than the one originally used in the conditioning.
Applications
Creativity
There have been many studies looking at the links between creativity and rewards. Many argue that if students are rewarded for a task such as creativity, they will be less interested, perform worse, and enjoy the task less once the reward is removed. Eisenberger applied his learned industriousness theory to studies of creativity to show that extrinsic rewards do not always negatively affect intrinsic motivation or creativity.
Using a similar training, Eisenberger and Selbst performed a series of experiments looking at whether creativity and divergent thought could be conditioned in the same manner as effort. Participants performed a task where they pulled letters out of a long word to create different words and were either given a performance standard (high difficulty condition) or no performance standard (low difficulty condition). After completing five rounds of words, the participants were instructed to make as many unique drawings from a circle as they could. The pictures were judged for uniqueness and general creativity.
The authors found similar results to previous learned industriousness studies: participants in the high difficulty-low reward condition showed more creativity in the circle drawing task than those without a reward while participants in the low difficulty-low reward showed even less creativity. Although most creativity research up until that point suggested that any reward for creative thoughts reduced generalized creativity, this study showed that increases or decreases in generalized creativity depend on whether or not high or low divergent thought is rewarded.
Smoking/drug habits
Currently the area of study that learned industriousness has been cited in the applied world is smoking and drug cessation research. An example of such research is Quinn et al.'s correlational study which examined the levels of persistence of smokers vs. non-smokers using the Anagram Persistence Task (APT) and the Mirror-Tracing Persistence Task (MTPT). As predicted, non-smokers had higher levels of persistence than smokers. The authors suggested that people who have been reinforced with high effort throughout their lives would be more persistent in their use of strategies for coping with stress than smokers and that people reinforced with low effort would be more likely to use low effort strategies when coping with stress (such as smoking). In addition, people with low persistence are less likely to produce the high effort behaviors required to quit smoking. Adding support to Brandon et al.'s hypotheses is a study by Brown, Lejuez, Kahler, & Strong. The authors found that smokers who have never been able to quit for more than a day had lower levels of persistence than those who were able to quit for at least 3 months at a time.
Another study by Brandon, Herzog, Juliano, Irvin, Lazev, & Simmons continued the work of the previous two by using a longitudinal perspective. After testing for persistence using the APT and the MTPT, the participants went through eleven days of smoking cessation therapy that included cognitive-behavioral therapy, training on coping strategies, and nicotine replacement therapy. Participants were then contacted on a monthly basis for 6 months and then at 9 and 12 months for updates on their smoking habits. In addition to supporting previous findings that smokers perform worse on persistence tasks, participants who scored higher on the persistence tasks were less likely to relapse during the 12-month period of the study. Although the study was again limited because of its correlational design, the authors suggest that their results fit within the theoretical framework of learned industriousness.
An additional study by Steinberg et al. looking at adolescents and smoking found much of the same results as Brandon et al. Non-smoking adolescents scored higher on a self-reported persistence measure than smokers and smokers who planned on quitting scored higher than those who did not plan on quitting.
Future research
There are several areas in which the literature on learned industriousness can be expanded. Due to the unclear results of Eisenberger's study of a Learned Industriousness-Learned Helplessness Continuum, further research should be done to provide evidence for or against its existence. This research could be useful for personnel selection purposes and understanding performance in the workplace. Also, the most current smoking-related learned industriousness research has been correlational; experimental studies could not only be powerful evidence for the theory but also generate important practical contributions for smoking cessation therapy.
See also
Creativity
Learned helplessness
Motivation
Operant conditioning
Persistence (psychology)
Reward system
References
External links
http://eisenberger.psych.udel.edu/LI.html
https://archive.today/20130415184007/http://www.psichi.org/pubs/articles/article_103.aspx
Motivational theories
Behavioral concepts |
```javascript
/*!
* 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 Salesforce.com 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.
*/
'use strict';
var net = require('net');
var urlParse = require('url').parse;
var pubsuffix = require('./pubsuffix');
var Store = require('./store').Store;
var MemoryCookieStore = require('./memstore').MemoryCookieStore;
var pathMatch = require('./pathMatch').pathMatch;
var VERSION = require('../package.json').version;
var punycode;
try {
punycode = require('punycode');
} catch(e) {
console.warn("cookie: can't load punycode; won't use punycode for domain normalization");
}
var DATE_DELIM = /[\x09\x20-\x2F\x3B-\x40\x5B-\x60\x7B-\x7E]/;
// From RFC6265 S4.1.1
// note that it excludes \x3B ";"
var COOKIE_OCTET = /[\x21\x23-\x2B\x2D-\x3A\x3C-\x5B\x5D-\x7E]/;
var COOKIE_OCTETS = new RegExp('^'+COOKIE_OCTET.source+'+$');
var CONTROL_CHARS = /[\x00-\x1F]/;
// Double quotes are part of the value (see: S4.1.1).
// '\r', '\n' and '\0' should be treated as a terminator in the "relaxed" mode
// (see: path_to_url#L60)
// '=' and ';' are attribute/values separators
// (see: path_to_url#L64)
var COOKIE_PAIR = /^(([^=;]+))\s*=\s*([^\n\r\0]*)/;
// Used to parse non-RFC-compliant cookies like '=abc' when given the `loose`
// option in Cookie.parse:
var LOOSE_COOKIE_PAIR = /^((?:=)?([^=;]*)\s*=\s*)?([^\n\r\0]*)/;
// RFC6265 S4.1.1 defines path value as 'any CHAR except CTLs or ";"'
// Note ';' is \x3B
var PATH_VALUE = /[\x20-\x3A\x3C-\x7E]+/;
// Used for checking whether or not there is a trailing semi-colon
var TRAILING_SEMICOLON = /;+$/;
var DAY_OF_MONTH = /^(\d{1,2})[^\d]*$/;
var TIME = /^(\d{1,2})[^\d]*:(\d{1,2})[^\d]*:(\d{1,2})[^\d]*$/;
var MONTH = /^(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)/i;
var MONTH_TO_NUM = {
jan:0, feb:1, mar:2, apr:3, may:4, jun:5,
jul:6, aug:7, sep:8, oct:9, nov:10, dec:11
};
var NUM_TO_MONTH = [
'Jan','Feb','Mar','Apr','May','Jun','Jul','Aug','Sep','Oct','Nov','Dec'
];
var NUM_TO_DAY = [
'Sun','Mon','Tue','Wed','Thu','Fri','Sat'
];
var YEAR = /^(\d{2}|\d{4})$/; // 2 to 4 digits
var MAX_TIME = 2147483647000; // 31-bit max
var MIN_TIME = 0; // 31-bit min
// RFC6265 S5.1.1 date parser:
function parseDate(str) {
if (!str) {
return;
}
/* RFC6265 S5.1.1:
* 2. Process each date-token sequentially in the order the date-tokens
* appear in the cookie-date
*/
var tokens = str.split(DATE_DELIM);
if (!tokens) {
return;
}
var hour = null;
var minutes = null;
var seconds = null;
var day = null;
var month = null;
var year = null;
for (var i=0; i<tokens.length; i++) {
var token = tokens[i].trim();
if (!token.length) {
continue;
}
var result;
/* 2.1. If the found-time flag is not set and the token matches the time
* production, set the found-time flag and set the hour- value,
* minute-value, and second-value to the numbers denoted by the digits in
* the date-token, respectively. Skip the remaining sub-steps and continue
* to the next date-token.
*/
if (seconds === null) {
result = TIME.exec(token);
if (result) {
hour = parseInt(result[1], 10);
minutes = parseInt(result[2], 10);
seconds = parseInt(result[3], 10);
/* RFC6265 S5.1.1.5:
* [fail if]
* * the hour-value is greater than 23,
* * the minute-value is greater than 59, or
* * the second-value is greater than 59.
*/
if(hour > 23 || minutes > 59 || seconds > 59) {
return;
}
continue;
}
}
/* 2.2. If the found-day-of-month flag is not set and the date-token matches
* the day-of-month production, set the found-day-of- month flag and set
* the day-of-month-value to the number denoted by the date-token. Skip
* the remaining sub-steps and continue to the next date-token.
*/
if (day === null) {
result = DAY_OF_MONTH.exec(token);
if (result) {
day = parseInt(result, 10);
/* RFC6265 S5.1.1.5:
* [fail if] the day-of-month-value is less than 1 or greater than 31
*/
if(day < 1 || day > 31) {
return;
}
continue;
}
}
/* 2.3. If the found-month flag is not set and the date-token matches the
* month production, set the found-month flag and set the month-value to
* the month denoted by the date-token. Skip the remaining sub-steps and
* continue to the next date-token.
*/
if (month === null) {
result = MONTH.exec(token);
if (result) {
month = MONTH_TO_NUM[result[1].toLowerCase()];
continue;
}
}
/* 2.4. If the found-year flag is not set and the date-token matches the year
* production, set the found-year flag and set the year-value to the number
* denoted by the date-token. Skip the remaining sub-steps and continue to
* the next date-token.
*/
if (year === null) {
result = YEAR.exec(token);
if (result) {
year = parseInt(result[0], 10);
/* From S5.1.1:
* 3. If the year-value is greater than or equal to 70 and less
* than or equal to 99, increment the year-value by 1900.
* 4. If the year-value is greater than or equal to 0 and less
* than or equal to 69, increment the year-value by 2000.
*/
if (70 <= year && year <= 99) {
year += 1900;
} else if (0 <= year && year <= 69) {
year += 2000;
}
if (year < 1601) {
return; // 5. ... the year-value is less than 1601
}
}
}
}
if (seconds === null || day === null || month === null || year === null) {
return; // 5. ... at least one of the found-day-of-month, found-month, found-
// year, or found-time flags is not set,
}
return new Date(Date.UTC(year, month, day, hour, minutes, seconds));
}
function formatDate(date) {
var d = date.getUTCDate(); d = d >= 10 ? d : '0'+d;
var h = date.getUTCHours(); h = h >= 10 ? h : '0'+h;
var m = date.getUTCMinutes(); m = m >= 10 ? m : '0'+m;
var s = date.getUTCSeconds(); s = s >= 10 ? s : '0'+s;
return NUM_TO_DAY[date.getUTCDay()] + ', ' +
d+' '+ NUM_TO_MONTH[date.getUTCMonth()] +' '+ date.getUTCFullYear() +' '+
h+':'+m+':'+s+' GMT';
}
// S5.1.2 Canonicalized Host Names
function canonicalDomain(str) {
if (str == null) {
return null;
}
str = str.trim().replace(/^\./,''); // S4.1.2.3 & S5.2.3: ignore leading .
// convert to IDN if any non-ASCII characters
if (punycode && /[^\u0001-\u007f]/.test(str)) {
str = punycode.toASCII(str);
}
return str.toLowerCase();
}
// S5.1.3 Domain Matching
function domainMatch(str, domStr, canonicalize) {
if (str == null || domStr == null) {
return null;
}
if (canonicalize !== false) {
str = canonicalDomain(str);
domStr = canonicalDomain(domStr);
}
/*
* "The domain string and the string are identical. (Note that both the
* domain string and the string will have been canonicalized to lower case at
* this point)"
*/
if (str == domStr) {
return true;
}
/* "All of the following [three] conditions hold:" (order adjusted from the RFC) */
/* "* The string is a host name (i.e., not an IP address)." */
if (net.isIP(str)) {
return false;
}
/* "* The domain string is a suffix of the string" */
var idx = str.indexOf(domStr);
if (idx <= 0) {
return false; // it's a non-match (-1) or prefix (0)
}
// e.g "a.b.c".indexOf("b.c") === 2
// 5 === 3+2
if (str.length !== domStr.length + idx) { // it's not a suffix
return false;
}
/* "* The last character of the string that is not included in the domain
* string is a %x2E (".") character." */
if (str.substr(idx-1,1) !== '.') {
return false;
}
return true;
}
// RFC6265 S5.1.4 Paths and Path-Match
/*
* "The user agent MUST use an algorithm equivalent to the following algorithm
* to compute the default-path of a cookie:"
*
* Assumption: the path (and not query part or absolute uri) is passed in.
*/
function defaultPath(path) {
// "2. If the uri-path is empty or if the first character of the uri-path is not
// a %x2F ("/") character, output %x2F ("/") and skip the remaining steps.
if (!path || path.substr(0,1) !== "/") {
return "/";
}
// "3. If the uri-path contains no more than one %x2F ("/") character, output
// %x2F ("/") and skip the remaining step."
if (path === "/") {
return path;
}
var rightSlash = path.lastIndexOf("/");
if (rightSlash === 0) {
return "/";
}
// "4. Output the characters of the uri-path from the first character up to,
// but not including, the right-most %x2F ("/")."
return path.slice(0, rightSlash);
}
function parse(str, options) {
if (!options || typeof options !== 'object') {
options = {};
}
str = str.trim();
// S4.1.1 Trailing semi-colons are not part of the specification.
var semiColonCheck = TRAILING_SEMICOLON.exec(str);
if (semiColonCheck) {
str = str.slice(0, semiColonCheck.index);
}
// We use a regex to parse the "name-value-pair" part of S5.2
var firstSemi = str.indexOf(';'); // S5.2 step 1
var pairRe = options.loose ? LOOSE_COOKIE_PAIR : COOKIE_PAIR;
var result = pairRe.exec(firstSemi === -1 ? str : str.substr(0,firstSemi));
// Rx satisfies the "the name string is empty" and "lacks a %x3D ("=")"
// constraints as well as trimming any whitespace.
if (!result) {
return;
}
var c = new Cookie();
if (result[1]) {
c.key = result[2].trim();
} else {
c.key = '';
}
c.value = result[3].trim();
if (CONTROL_CHARS.test(c.key) || CONTROL_CHARS.test(c.value)) {
return;
}
if (firstSemi === -1) {
return c;
}
// S5.2.3 "unparsed-attributes consist of the remainder of the set-cookie-string
// (including the %x3B (";") in question)." plus later on in the same section
// "discard the first ";" and trim".
var unparsed = str.slice(firstSemi).replace(/^\s*;\s*/,'').trim();
// "If the unparsed-attributes string is empty, skip the rest of these
// steps."
if (unparsed.length === 0) {
return c;
}
/*
* S5.2 says that when looping over the items "[p]rocess the attribute-name
* and attribute-value according to the requirements in the following
* subsections" for every item. Plus, for many of the individual attributes
* in S5.3 it says to use the "attribute-value of the last attribute in the
* cookie-attribute-list". Therefore, in this implementation, we overwrite
* the previous value.
*/
var cookie_avs = unparsed.split(/\s*;\s*/);
while (cookie_avs.length) {
var av = cookie_avs.shift();
var av_sep = av.indexOf('=');
var av_key, av_value;
if (av_sep === -1) {
av_key = av;
av_value = null;
} else {
av_key = av.substr(0,av_sep);
av_value = av.substr(av_sep+1);
}
av_key = av_key.trim().toLowerCase();
if (av_value) {
av_value = av_value.trim();
}
switch(av_key) {
case 'expires': // S5.2.1
if (av_value) {
var exp = parseDate(av_value);
// "If the attribute-value failed to parse as a cookie date, ignore the
// cookie-av."
if (exp) {
// over and underflow not realistically a concern: V8's getTime() seems to
// store something larger than a 32-bit time_t (even with 32-bit node)
c.expires = exp;
}
}
break;
case 'max-age': // S5.2.2
if (av_value) {
// "If the first character of the attribute-value is not a DIGIT or a "-"
// character ...[or]... If the remainder of attribute-value contains a
// non-DIGIT character, ignore the cookie-av."
if (/^-?[0-9]+$/.test(av_value)) {
var delta = parseInt(av_value, 10);
// "If delta-seconds is less than or equal to zero (0), let expiry-time
// be the earliest representable date and time."
c.setMaxAge(delta);
}
}
break;
case 'domain': // S5.2.3
// "If the attribute-value is empty, the behavior is undefined. However,
// the user agent SHOULD ignore the cookie-av entirely."
if (av_value) {
// S5.2.3 "Let cookie-domain be the attribute-value without the leading %x2E
// (".") character."
var domain = av_value.trim().replace(/^\./, '');
if (domain) {
// "Convert the cookie-domain to lower case."
c.domain = domain.toLowerCase();
}
}
break;
case 'path': // S5.2.4
/*
* "If the attribute-value is empty or if the first character of the
* attribute-value is not %x2F ("/"):
* Let cookie-path be the default-path.
* Otherwise:
* Let cookie-path be the attribute-value."
*
* We'll represent the default-path as null since it depends on the
* context of the parsing.
*/
c.path = av_value && av_value[0] === "/" ? av_value : null;
break;
case 'secure': // S5.2.5
/*
* "If the attribute-name case-insensitively matches the string "Secure",
* the user agent MUST append an attribute to the cookie-attribute-list
* with an attribute-name of Secure and an empty attribute-value."
*/
c.secure = true;
break;
case 'httponly': // S5.2.6 -- effectively the same as 'secure'
c.httpOnly = true;
break;
default:
c.extensions = c.extensions || [];
c.extensions.push(av);
break;
}
}
return c;
}
// avoid the V8 deoptimization monster!
function jsonParse(str) {
var obj;
try {
obj = JSON.parse(str);
} catch (e) {
return e;
}
return obj;
}
function fromJSON(str) {
if (!str) {
return null;
}
var obj;
if (typeof str === 'string') {
obj = jsonParse(str);
if (obj instanceof Error) {
return null;
}
} else {
// assume it's an Object
obj = str;
}
var c = new Cookie();
for (var i=0; i<Cookie.serializableProperties.length; i++) {
var prop = Cookie.serializableProperties[i];
if (obj[prop] === undefined ||
obj[prop] === Cookie.prototype[prop])
{
continue; // leave as prototype default
}
if (prop === 'expires' ||
prop === 'creation' ||
prop === 'lastAccessed')
{
if (obj[prop] === null) {
c[prop] = null;
} else {
c[prop] = obj[prop] == "Infinity" ?
"Infinity" : new Date(obj[prop]);
}
} else {
c[prop] = obj[prop];
}
}
return c;
}
/* Section 5.4 part 2:
* "* Cookies with longer paths are listed before cookies with
* shorter paths.
*
* * Among cookies that have equal-length path fields, cookies with
* earlier creation-times are listed before cookies with later
* creation-times."
*/
function cookieCompare(a,b) {
var cmp = 0;
// descending for length: b CMP a
var aPathLen = a.path ? a.path.length : 0;
var bPathLen = b.path ? b.path.length : 0;
cmp = bPathLen - aPathLen;
if (cmp !== 0) {
return cmp;
}
// ascending for time: a CMP b
var aTime = a.creation ? a.creation.getTime() : MAX_TIME;
var bTime = b.creation ? b.creation.getTime() : MAX_TIME;
cmp = aTime - bTime;
if (cmp !== 0) {
return cmp;
}
// break ties for the same millisecond (precision of JavaScript's clock)
cmp = a.creationIndex - b.creationIndex;
return cmp;
}
// Gives the permutation of all possible pathMatch()es of a given path. The
// array is in longest-to-shortest order. Handy for indexing.
function permutePath(path) {
if (path === '/') {
return ['/'];
}
if (path.lastIndexOf('/') === path.length-1) {
path = path.substr(0,path.length-1);
}
var permutations = [path];
while (path.length > 1) {
var lindex = path.lastIndexOf('/');
if (lindex === 0) {
break;
}
path = path.substr(0,lindex);
permutations.push(path);
}
permutations.push('/');
return permutations;
}
function getCookieContext(url) {
if (url instanceof Object) {
return url;
}
// NOTE: decodeURI will throw on malformed URIs (see GH-32).
// Therefore, we will just skip decoding for such URIs.
try {
url = decodeURI(url);
}
catch(err) {
// Silently swallow error
}
return urlParse(url);
}
function Cookie(options) {
options = options || {};
Object.keys(options).forEach(function(prop) {
if (Cookie.prototype.hasOwnProperty(prop) &&
Cookie.prototype[prop] !== options[prop] &&
prop.substr(0,1) !== '_')
{
this[prop] = options[prop];
}
}, this);
this.creation = this.creation || new Date();
// used to break creation ties in cookieCompare():
Object.defineProperty(this, 'creationIndex', {
configurable: false,
enumerable: false, // important for assert.deepEqual checks
writable: true,
value: ++Cookie.cookiesCreated
});
}
Cookie.cookiesCreated = 0; // incremented each time a cookie is created
Cookie.parse = parse;
Cookie.fromJSON = fromJSON;
Cookie.prototype.key = "";
Cookie.prototype.value = "";
// the order in which the RFC has them:
Cookie.prototype.expires = "Infinity"; // coerces to literal Infinity
Cookie.prototype.maxAge = null; // takes precedence over expires for TTL
Cookie.prototype.domain = null;
Cookie.prototype.path = null;
Cookie.prototype.secure = false;
Cookie.prototype.httpOnly = false;
Cookie.prototype.extensions = null;
// set by the CookieJar:
Cookie.prototype.hostOnly = null; // boolean when set
Cookie.prototype.pathIsDefault = null; // boolean when set
Cookie.prototype.creation = null; // Date when set; defaulted by Cookie.parse
Cookie.prototype.lastAccessed = null; // Date when set
Object.defineProperty(Cookie.prototype, 'creationIndex', {
configurable: true,
enumerable: false,
writable: true,
value: 0
});
Cookie.serializableProperties = Object.keys(Cookie.prototype)
.filter(function(prop) {
return !(
Cookie.prototype[prop] instanceof Function ||
prop === 'creationIndex' ||
prop.substr(0,1) === '_'
);
});
Cookie.prototype.inspect = function inspect() {
var now = Date.now();
return 'Cookie="'+this.toString() +
'; hostOnly='+(this.hostOnly != null ? this.hostOnly : '?') +
'; aAge='+(this.lastAccessed ? (now-this.lastAccessed.getTime())+'ms' : '?') +
'; cAge='+(this.creation ? (now-this.creation.getTime())+'ms' : '?') +
'"';
};
Cookie.prototype.toJSON = function() {
var obj = {};
var props = Cookie.serializableProperties;
for (var i=0; i<props.length; i++) {
var prop = props[i];
if (this[prop] === Cookie.prototype[prop]) {
continue; // leave as prototype default
}
if (prop === 'expires' ||
prop === 'creation' ||
prop === 'lastAccessed')
{
if (this[prop] === null) {
obj[prop] = null;
} else {
obj[prop] = this[prop] == "Infinity" ? // intentionally not ===
"Infinity" : this[prop].toISOString();
}
} else if (prop === 'maxAge') {
if (this[prop] !== null) {
// again, intentionally not ===
obj[prop] = (this[prop] == Infinity || this[prop] == -Infinity) ?
this[prop].toString() : this[prop];
}
} else {
if (this[prop] !== Cookie.prototype[prop]) {
obj[prop] = this[prop];
}
}
}
return obj;
};
Cookie.prototype.clone = function() {
return fromJSON(this.toJSON());
};
Cookie.prototype.validate = function validate() {
if (!COOKIE_OCTETS.test(this.value)) {
return false;
}
if (this.expires != Infinity && !(this.expires instanceof Date) && !parseDate(this.expires)) {
return false;
}
if (this.maxAge != null && this.maxAge <= 0) {
return false; // "Max-Age=" non-zero-digit *DIGIT
}
if (this.path != null && !PATH_VALUE.test(this.path)) {
return false;
}
var cdomain = this.cdomain();
if (cdomain) {
if (cdomain.match(/\.$/)) {
return false; // S4.1.2.3 suggests that this is bad. domainMatch() tests confirm this
}
var suffix = pubsuffix.getPublicSuffix(cdomain);
if (suffix == null) { // it's a public suffix
return false;
}
}
return true;
};
Cookie.prototype.setExpires = function setExpires(exp) {
if (exp instanceof Date) {
this.expires = exp;
} else {
this.expires = parseDate(exp) || "Infinity";
}
};
Cookie.prototype.setMaxAge = function setMaxAge(age) {
if (age === Infinity || age === -Infinity) {
this.maxAge = age.toString(); // so JSON.stringify() works
} else {
this.maxAge = age;
}
};
// gives Cookie header format
Cookie.prototype.cookieString = function cookieString() {
var val = this.value;
if (val == null) {
val = '';
}
if (this.key === '') {
return val;
}
return this.key+'='+val;
};
// gives Set-Cookie header format
Cookie.prototype.toString = function toString() {
var str = this.cookieString();
if (this.expires != Infinity) {
if (this.expires instanceof Date) {
str += '; Expires='+formatDate(this.expires);
} else {
str += '; Expires='+this.expires;
}
}
if (this.maxAge != null && this.maxAge != Infinity) {
str += '; Max-Age='+this.maxAge;
}
if (this.domain && !this.hostOnly) {
str += '; Domain='+this.domain;
}
if (this.path) {
str += '; Path='+this.path;
}
if (this.secure) {
str += '; Secure';
}
if (this.httpOnly) {
str += '; HttpOnly';
}
if (this.extensions) {
this.extensions.forEach(function(ext) {
str += '; '+ext;
});
}
return str;
};
// TTL() partially replaces the "expiry-time" parts of S5.3 step 3 (setCookie()
// elsewhere)
// S5.3 says to give the "latest representable date" for which we use Infinity
// For "expired" we use 0
Cookie.prototype.TTL = function TTL(now) {
/* RFC6265 S4.1.2.2 If a cookie has both the Max-Age and the Expires
* attribute, the Max-Age attribute has precedence and controls the
* expiration date of the cookie.
* (Concurs with S5.3 step 3)
*/
if (this.maxAge != null) {
return this.maxAge<=0 ? 0 : this.maxAge*1000;
}
var expires = this.expires;
if (expires != Infinity) {
if (!(expires instanceof Date)) {
expires = parseDate(expires) || Infinity;
}
if (expires == Infinity) {
return Infinity;
}
return expires.getTime() - (now || Date.now());
}
return Infinity;
};
// expiryTime() replaces the "expiry-time" parts of S5.3 step 3 (setCookie()
// elsewhere)
Cookie.prototype.expiryTime = function expiryTime(now) {
if (this.maxAge != null) {
var relativeTo = now || this.creation || new Date();
var age = (this.maxAge <= 0) ? -Infinity : this.maxAge*1000;
return relativeTo.getTime() + age;
}
if (this.expires == Infinity) {
return Infinity;
}
return this.expires.getTime();
};
// expiryDate() replaces the "expiry-time" parts of S5.3 step 3 (setCookie()
// elsewhere), except it returns a Date
Cookie.prototype.expiryDate = function expiryDate(now) {
var millisec = this.expiryTime(now);
if (millisec == Infinity) {
return new Date(MAX_TIME);
} else if (millisec == -Infinity) {
return new Date(MIN_TIME);
} else {
return new Date(millisec);
}
};
// This replaces the "persistent-flag" parts of S5.3 step 3
Cookie.prototype.isPersistent = function isPersistent() {
return (this.maxAge != null || this.expires != Infinity);
};
// Mostly S5.1.2 and S5.2.3:
Cookie.prototype.cdomain =
Cookie.prototype.canonicalizedDomain = function canonicalizedDomain() {
if (this.domain == null) {
return null;
}
return canonicalDomain(this.domain);
};
function CookieJar(store, options) {
if (typeof options === "boolean") {
options = {rejectPublicSuffixes: options};
} else if (options == null) {
options = {};
}
if (options.rejectPublicSuffixes != null) {
this.rejectPublicSuffixes = options.rejectPublicSuffixes;
}
if (options.looseMode != null) {
this.enableLooseMode = options.looseMode;
}
if (!store) {
store = new MemoryCookieStore();
}
this.store = store;
}
CookieJar.prototype.store = null;
CookieJar.prototype.rejectPublicSuffixes = true;
CookieJar.prototype.enableLooseMode = false;
var CAN_BE_SYNC = [];
CAN_BE_SYNC.push('setCookie');
CookieJar.prototype.setCookie = function(cookie, url, options, cb) {
var err;
var context = getCookieContext(url);
if (options instanceof Function) {
cb = options;
options = {};
}
var host = canonicalDomain(context.hostname);
var loose = this.enableLooseMode;
if (options.loose != null) {
loose = options.loose;
}
// S5.3 step 1
if (!(cookie instanceof Cookie)) {
cookie = Cookie.parse(cookie, { loose: loose });
}
if (!cookie) {
err = new Error("Cookie failed to parse");
return cb(options.ignoreError ? null : err);
}
// S5.3 step 2
var now = options.now || new Date(); // will assign later to save effort in the face of errors
// S5.3 step 3: NOOP; persistent-flag and expiry-time is handled by getCookie()
// S5.3 step 4: NOOP; domain is null by default
// S5.3 step 5: public suffixes
if (this.rejectPublicSuffixes && cookie.domain) {
var suffix = pubsuffix.getPublicSuffix(cookie.cdomain());
if (suffix == null) { // e.g. "com"
err = new Error("Cookie has domain set to a public suffix");
return cb(options.ignoreError ? null : err);
}
}
// S5.3 step 6:
if (cookie.domain) {
if (!domainMatch(host, cookie.cdomain(), false)) {
err = new Error("Cookie not in this host's domain. Cookie:"+cookie.cdomain()+" Request:"+host);
return cb(options.ignoreError ? null : err);
}
if (cookie.hostOnly == null) { // don't reset if already set
cookie.hostOnly = false;
}
} else {
cookie.hostOnly = true;
cookie.domain = host;
}
//S5.2.4 If the attribute-value is empty or if the first character of the
//attribute-value is not %x2F ("/"):
//Let cookie-path be the default-path.
if (!cookie.path || cookie.path[0] !== '/') {
cookie.path = defaultPath(context.pathname);
cookie.pathIsDefault = true;
}
// S5.3 step 8: NOOP; secure attribute
// S5.3 step 9: NOOP; httpOnly attribute
// S5.3 step 10
if (options.http === false && cookie.httpOnly) {
err = new Error("Cookie is HttpOnly and this isn't an HTTP API");
return cb(options.ignoreError ? null : err);
}
var store = this.store;
if (!store.updateCookie) {
store.updateCookie = function(oldCookie, newCookie, cb) {
this.putCookie(newCookie, cb);
};
}
function withCookie(err, oldCookie) {
if (err) {
return cb(err);
}
var next = function(err) {
if (err) {
return cb(err);
} else {
cb(null, cookie);
}
};
if (oldCookie) {
// S5.3 step 11 - "If the cookie store contains a cookie with the same name,
// domain, and path as the newly created cookie:"
if (options.http === false && oldCookie.httpOnly) { // step 11.2
err = new Error("old Cookie is HttpOnly and this isn't an HTTP API");
return cb(options.ignoreError ? null : err);
}
cookie.creation = oldCookie.creation; // step 11.3
cookie.creationIndex = oldCookie.creationIndex; // preserve tie-breaker
cookie.lastAccessed = now;
// Step 11.4 (delete cookie) is implied by just setting the new one:
store.updateCookie(oldCookie, cookie, next); // step 12
} else {
cookie.creation = cookie.lastAccessed = now;
store.putCookie(cookie, next); // step 12
}
}
store.findCookie(cookie.domain, cookie.path, cookie.key, withCookie);
};
// RFC6365 S5.4
CAN_BE_SYNC.push('getCookies');
CookieJar.prototype.getCookies = function(url, options, cb) {
var context = getCookieContext(url);
if (options instanceof Function) {
cb = options;
options = {};
}
var host = canonicalDomain(context.hostname);
var path = context.pathname || '/';
var secure = options.secure;
if (secure == null && context.protocol &&
(context.protocol == 'https:' || context.protocol == 'wss:'))
{
secure = true;
}
var http = options.http;
if (http == null) {
http = true;
}
var now = options.now || Date.now();
var expireCheck = options.expire !== false;
var allPaths = !!options.allPaths;
var store = this.store;
function matchingCookie(c) {
// "Either:
// The cookie's host-only-flag is true and the canonicalized
// request-host is identical to the cookie's domain.
// Or:
// The cookie's host-only-flag is false and the canonicalized
// request-host domain-matches the cookie's domain."
if (c.hostOnly) {
if (c.domain != host) {
return false;
}
} else {
if (!domainMatch(host, c.domain, false)) {
return false;
}
}
// "The request-uri's path path-matches the cookie's path."
if (!allPaths && !pathMatch(path, c.path)) {
return false;
}
// "If the cookie's secure-only-flag is true, then the request-uri's
// scheme must denote a "secure" protocol"
if (c.secure && !secure) {
return false;
}
// "If the cookie's http-only-flag is true, then exclude the cookie if the
// cookie-string is being generated for a "non-HTTP" API"
if (c.httpOnly && !http) {
return false;
}
// deferred from S5.3
// non-RFC: allow retention of expired cookies by choice
if (expireCheck && c.expiryTime() <= now) {
store.removeCookie(c.domain, c.path, c.key, function(){}); // result ignored
return false;
}
return true;
}
store.findCookies(host, allPaths ? null : path, function(err,cookies) {
if (err) {
return cb(err);
}
cookies = cookies.filter(matchingCookie);
// sorting of S5.4 part 2
if (options.sort !== false) {
cookies = cookies.sort(cookieCompare);
}
// S5.4 part 3
var now = new Date();
cookies.forEach(function(c) {
c.lastAccessed = now;
});
// TODO persist lastAccessed
cb(null,cookies);
});
};
CAN_BE_SYNC.push('getCookieString');
CookieJar.prototype.getCookieString = function(/*..., cb*/) {
var args = Array.prototype.slice.call(arguments,0);
var cb = args.pop();
var next = function(err,cookies) {
if (err) {
cb(err);
} else {
cb(null, cookies
.sort(cookieCompare)
.map(function(c){
return c.cookieString();
})
.join('; '));
}
};
args.push(next);
this.getCookies.apply(this,args);
};
CAN_BE_SYNC.push('getSetCookieStrings');
CookieJar.prototype.getSetCookieStrings = function(/*..., cb*/) {
var args = Array.prototype.slice.call(arguments,0);
var cb = args.pop();
var next = function(err,cookies) {
if (err) {
cb(err);
} else {
cb(null, cookies.map(function(c){
return c.toString();
}));
}
};
args.push(next);
this.getCookies.apply(this,args);
};
CAN_BE_SYNC.push('serialize');
CookieJar.prototype.serialize = function(cb) {
var type = this.store.constructor.name;
if (type === 'Object') {
type = null;
}
// update README.md "Serialization Format" if you change this, please!
var serialized = {
// The version of tough-cookie that serialized this jar. Generally a good
// practice since future versions can make data import decisions based on
// known past behavior. When/if this matters, use `semver`.
version: 'tough-cookie@'+VERSION,
// add the store type, to make humans happy:
storeType: type,
// CookieJar configuration:
rejectPublicSuffixes: !!this.rejectPublicSuffixes,
// this gets filled from getAllCookies:
cookies: []
};
if (!(this.store.getAllCookies &&
typeof this.store.getAllCookies === 'function'))
{
return cb(new Error('store does not support getAllCookies and cannot be serialized'));
}
this.store.getAllCookies(function(err,cookies) {
if (err) {
return cb(err);
}
serialized.cookies = cookies.map(function(cookie) {
// convert to serialized 'raw' cookies
cookie = (cookie instanceof Cookie) ? cookie.toJSON() : cookie;
// Remove the index so new ones get assigned during deserialization
delete cookie.creationIndex;
return cookie;
});
return cb(null, serialized);
});
};
// well-known name that JSON.stringify calls
CookieJar.prototype.toJSON = function() {
return this.serializeSync();
};
// use the class method CookieJar.deserialize instead of calling this directly
CAN_BE_SYNC.push('_importCookies');
CookieJar.prototype._importCookies = function(serialized, cb) {
var jar = this;
var cookies = serialized.cookies;
if (!cookies || !Array.isArray(cookies)) {
return cb(new Error('serialized jar has no cookies array'));
}
function putNext(err) {
if (err) {
return cb(err);
}
if (!cookies.length) {
return cb(err, jar);
}
var cookie;
try {
cookie = fromJSON(cookies.shift());
} catch (e) {
return cb(e);
}
if (cookie === null) {
return putNext(null); // skip this cookie
}
jar.store.putCookie(cookie, putNext);
}
putNext();
};
CookieJar.deserialize = function(strOrObj, store, cb) {
if (arguments.length !== 3) {
// store is optional
cb = store;
store = null;
}
var serialized;
if (typeof strOrObj === 'string') {
serialized = jsonParse(strOrObj);
if (serialized instanceof Error) {
return cb(serialized);
}
} else {
serialized = strOrObj;
}
var jar = new CookieJar(store, serialized.rejectPublicSuffixes);
jar._importCookies(serialized, function(err) {
if (err) {
return cb(err);
}
cb(null, jar);
});
};
CookieJar.deserializeSync = function(strOrObj, store) {
var serialized = typeof strOrObj === 'string' ?
JSON.parse(strOrObj) : strOrObj;
var jar = new CookieJar(store, serialized.rejectPublicSuffixes);
// catch this mistake early:
if (!jar.store.synchronous) {
throw new Error('CookieJar store is not synchronous; use async API instead.');
}
jar._importCookiesSync(serialized);
return jar;
};
CookieJar.fromJSON = CookieJar.deserializeSync;
CAN_BE_SYNC.push('clone');
CookieJar.prototype.clone = function(newStore, cb) {
if (arguments.length === 1) {
cb = newStore;
newStore = null;
}
this.serialize(function(err,serialized) {
if (err) {
return cb(err);
}
CookieJar.deserialize(newStore, serialized, cb);
});
};
// Use a closure to provide a true imperative API for synchronous stores.
function syncWrap(method) {
return function() {
if (!this.store.synchronous) {
throw new Error('CookieJar store is not synchronous; use async API instead.');
}
var args = Array.prototype.slice.call(arguments);
var syncErr, syncResult;
args.push(function syncCb(err, result) {
syncErr = err;
syncResult = result;
});
this[method].apply(this, args);
if (syncErr) {
throw syncErr;
}
return syncResult;
};
}
// wrap all declared CAN_BE_SYNC methods in the sync wrapper
CAN_BE_SYNC.forEach(function(method) {
CookieJar.prototype[method+'Sync'] = syncWrap(method);
});
module.exports = {
CookieJar: CookieJar,
Cookie: Cookie,
Store: Store,
MemoryCookieStore: MemoryCookieStore,
parseDate: parseDate,
formatDate: formatDate,
parse: parse,
fromJSON: fromJSON,
domainMatch: domainMatch,
defaultPath: defaultPath,
pathMatch: pathMatch,
getPublicSuffix: pubsuffix.getPublicSuffix,
cookieCompare: cookieCompare,
permuteDomain: require('./permuteDomain').permuteDomain,
permutePath: permutePath,
canonicalDomain: canonicalDomain
};
``` |
Dhaka University metro station (, romanised: Ḍhākā Biśśôbiddālôy mēṭrō sṭēśôn) is a metro station of the Dhaka Metro's MRT Line 6. This station is located in the area of University of Dhaka of Shahbagh. It is scheduled to be opened after the commercial operation of the second phase of MRT Line 6, which is expected to open in November 2023.
History
On 28 December 2014, the conceptual design of MRT Line 6 was created. After determining the route of the line by the side of Shaheed Minar, it was planned to change the route in the face of objection and take it in front of Teacher-Student Centre, University of Dhaka. In protest of this, the students of Dhaka University conducted various programs on 7 January, 2016. On the other hand, Road Transport and Bridges Minister Obaidul Quader ruled out the possibility of moving the metro route from Dhaka University as the construction work would start in two months. He informed that there will be no problem in the activities of the university as sound insulation technology will be used on the metro rail line. Meetings are held with students to resolve disputes. After discussing the benefits of a metro station in the Dhaka University area, they withdrew their opposition.
The station was constructed under "Package CP-03". The notification of application for construction of raised bridges for stations and railways was published on 30 June 2015 and the last date for submission of applications was 9 September 2015. The Italian-Thai Development Public Company Limited received the work contract for "Package CP-03". The agreement was signed in a ceremony on 3 May 2017. Construction of the station began on 1 July 2020.
Station
Station layout
References
University of Dhaka
Dhaka Metro stations
Railway stations scheduled to open in 2023 |
The Italian Military Information Service (, or SIM) was the military intelligence organization for the Royal Army (Regio Esercito) of the Kingdom of Italy (Regno d'Italia) from 1925 until 1946, and of the Italian Republic until 1949. The SIM was Fascist dictator Benito Mussolini's equivalent to the German Abwehr. In the early years of the war, the SIM scored important intelligence successes. Rommel’s successful military operations in North Africa in 1942 were substantially facilitated by the SIM through the securing of the U.S. Black Code used by Colonel Bonner Fellers to communicate plans for British military operations to his Headquarters in Washington.
Italian SIM was highly efficient and even compared favourably with its German counterpart. According to Brigadier Edgar Williams, Montgomery's Chief Intelligence Officer, the Italians “made far more intelligent deductions from the information they received than did the Germans.” According to Thaddeus Holt the SIM was the ablest Axis secret service on the technical level, and it excelled by far any other secret service in Europe outside the USSR.
History
The Servizio Informazioni Militari was instituted in October 1925 under the Fascist regime. Its activity was supported by the Air Force Information Service (Servizio Informazioni Aeronautiche, SIA) and the Navy Secret Information Service (Servizio Informazioni Segrete, SIS). The SIM had its headquarters at Forte Braschi, in the Quarter Q. XIV Trionfale, within the Municipio XIV. Within ten years, SIM evolved from a purely military intelligence and counter-intelligence service into a modern comprehensive structure capable of offering full intelligence coverage on domestic and overseas issues. On February 6, 1927, it was placed directly under the head of the High Command and charged with responsibility for internal and external security for all three armed forces. In 1934 funds available to the new service were doubled, as also was the number of specialised sections and personnel.
During the second half of the 1930s the activities of SIM, in particular under the leadership of Mario Roatta, took a rather sinister direction: SIM was implicated in an impressive chain of crimes and acts of violence, including the assassination of the most active anti-Fascist exile, Carlo Rosselli, together with his brother Nello, on 9 June 1937. SIM was also behind the assassination in Marseille of King Alexander of Yugoslavia and French Foreign Minister Louis Barthou.
SIM experienced its greatest interwar successes during the Ethiopian Campaign and the Spanish Civil War, managing to cut off the flow of arms to both Ethiopia and the Spanish Republic and providing the Italian command with a complete picture of the enemy forces. During the Ethiopian war it participated in the subversion of local chieftains who should have been loyal to Haile Selassie.
Shortly before Italy's entry into World War II, Brigadier general Giacomo Carboni, chief of the SIM, wrote a series of reports to Benito Mussolini wherein the Italian preparation to the war was described as inadequate. Carboni drafted pessimistic reports on Italian and German military capabilities. As a result Carboni was dismissed from his post at the SIM.
During the war SIM, whose sphere of action was generally limited to military objectives, is credited with operational efficiency. This included the forecasting of the Allied landing in North Africa, a contingency not considered by the Abwehr. However, this service often was not consulted by Mussolini and the military hierarchy.
SIM was dissolved in 1944 and was replaced for a few years by a small intelligence office within the General Staff. Only in 1949 did the Allies allow the service to be re-established as SIFAR [Armed Forces Intelligence Service].
Just before the Italian surrender, Pietro Badoglio put his protégé Giacomo Carboni back in charge of SIM (September 1943). After the Armistice, many SIM agents continued to work on behalf of the Kingdom of the South and of the Italian resistance. SIM spy Rodolfo Siviero coordinated the Italian partisans' intelligence activities from the Jewish art historian Giorgio Castelfranco's house on the Lungarno Serristori in Florence (now the Casa Siviero museum). Today he is known mainly for his role in the recovery of artworks stolen from Italy during the Second World War as part of the 'Nazi plunder'.
Intra-Axis co-operation
In 1938 General Gamba, chief of the SIM Cryptographic Bureau, requested cooperation in the cryptanalytic field at the Cipher Department of the High Command of the Wehrmacht (OKW/Chi). The Germans agreed to share results on French diplomatic and military systems. This collaboration was expanded and provided the Germans with important cryptologic material like the U.S. Military Intelligence code. OKW/Chi had previously worked hard on solving the code, but had set it aside as too difficult. The Servizio Informazioni Militare provided also OKW/Chi with a captured Swedish diplomatic codebook and with a Turkish code that Chi was trying hard to break. There was less cooperation between SIM and the Abwehr on the working level. The SIM did not trust the Abwehr to honour agreements such as not to run clandestine networks in Italy. They monitored German intelligence activities and agents in Italy. Nor were the Germans apprised of any of the doubling of Allied agents which SIM conducted with great success. As the war went on relations became strained since the Germans came to distrust the Italians. After the Fall of the Fascist regime in Italy when Benito Mussolini was deposed on 24–25 July 1943, the Servizio Informazioni Militare turned to OKW/Chi for help and cooperation. Generaloberst Alfred Jodl, however, forbade any further liaison, and from that point on, no agency contact was made or material exchanged.
During the war SIM also cooperated with other Axis intelligence agencies, including those of Japan, Finland and Hungary. At regular intervals, technological and information exchanges occurred at the Penang submarine-base in Japanese-occupied Malaya, which served Axis submarine forces of the Italian Italian Regia Marina, German Kriegsmarine and Imperial Japanese Navy. The Hungarians maintained liaison officers in Rome and made the results of their work available to the Italians.
SID
On 1 December 1943, after the creation of the Italian Social Republic, the new government established the SID (Defensive Information Service), the new Republic of Salò intelligence service. The SID was operational a month before its formal establishment, and its headquarters were located in Volta Mantovana. The SID was the only RSI Armed Forces information body, with espionage, counterintelligence and military police tasks. It was headed by Vittorio Foschini, a former journalist known for his anti-German attitudes. In late February 1944, Foschini was kidnapped by the SS as he left Rodolfo Graziani's villa on Lake Garda and disappeared to Germany. He was replaced by Lt-Colonel Candeloro De Leo, a Carabinieri officer described as 'capable and unscrupulous'. De Leo signed an agreement with the German Abwehr, but SID activities were hampered by Nazi Germany's intense hostility toward Italy after the armistice.
In March 1944 the SID departments were briefly as follows:
Sezione OMEGA (Offensive Intelligence): supposed to run offensive intelligence operations abroad, but the Germans disapproved of this and it existed in name only.
Sezione DELTA (Defensive Intelligence): this was the most important branch of SID, with the majority of its officers seconded from the Carabinieri. The Rome office of the section was headed by Carabinieri Captain Colombini, probably one of the few fervent Republican Fascists in SlD.
Sezione SIGMA (Internal Political Intelligence): this section collected information on civilian morale and the reactions of the various classes to the Mussolini regime and to the Germans, who were naturally keenly interested in its reports.
The Centro Raccolta e Elaborazione Notizie, which was purely an HQ section concerned with evaluating intelligence received. It included however a section carrying out the breaking of Allied codes and cyphers, headed by Frigate captain Luigi Donini - a very lukewarm Republican who had an English wife and was closely supervised by the Gestapo. This section enjoyed constant and close German supervision at all levels.
Sezione KAPPA (Communications): this section installed W/T sets to enable Mussolini to keep in direct touch with SID HQ, and also similar facilities to the offices in Rome, Florence and other important centres, using codes supplied by the cryptographic branch. There was, however, a sad deficiency in radio sets, both in quantity and quality.
Sezione ZETA: Postal Censorship throughout Republican Italy, using mainly retired Army officers.
The SID was dismantled soon after the liberation of Italy, on 25 April 1945.
Human rights abuses
SIM elements committed a whole series of crimes. On the direct order of Mussolini SIM arranged the assassination of the Rosselli brothers. The murder was carried out by French fascist-leaning and anti-communist Cagoulards, in exchange for 100 semiautomatic Beretta rifles and the promise of future shipments. Before the start of the Second Italo-Ethiopian War SIM supplied Ethiopians with faulty gas masks. During the Spanish Civil War, it sunk Spanish Republican ships by loading explosives in the holds and it introduced bacteria in food destined for Spain in order to spread epidemics.
Organization
SIM was subordinate to the Deputy Chief of Staff of the Army for the performance of strictly military functions and to the Undersecretary of War for the performance of duties of a non-military nature. SIM had five major sections:
Sezione Calderini (concerned with 'offensive' intelligence operations including sabotage beyond Italy's borders).
Sezione Zuretti (Data analysis and interpretation);
Sezione Bonsignore (Counterespionage). For a brief period in 1940-41 this section was detached from SIM and became an autonomous service under the name "CSMSS" (Controspionaggio Militare e Servizi Speciali). In January 1941, it was restored to SIM.
Sezione Crittografica (Cryptography): this section attacked foreign crypto-systems and produced enciphered codes for the Royal Italian Army and the Regia Marina;
Sezione personale e amministrativa.
In 1934 Mussolini doubled SIM's budget to fund a greatly expanded effort against Great Britain and to permit SIM to add assassination and subversion to its activities. In 1940, upon Italy's entrance into the war, SIM numbered 150 officers, 300 NCOs, and 400 other ranks. By the time the war was at its peak, it numbered over 300 officers, 1,200 NCOs and specialists, and directed the activities of more than 9,000 secret agents spread abroad.
Pre-war operations
SIM was very active in the interwar period. It oversaw support for Croatian Ustaše and Macedonian nationalists in Yugoslavia and arranged the assassination of Alexander I of Yugoslavia during a visit to France (1934).
By the mid-1930s Italian counterespionage, led by Colonel Santo Emanuele, had been involved in France through the Cagoule, taking advantage with great skill of the opportunities this provided to penetrate the Deuxième Bureau. Information obtained by SIM in France enabled Italian authorities to arrest the members of a French spy ring in Italy in 1939.
Before the Ethiopian campaign, SIM secured the text of the secret Hoare–Laval Pact, which sanctioned an Anglo-French agreement for the partition of Ethiopia among France, Britain and Italy on the eve of the Second Italo-Ethiopian War. The surfacing of the draft of this pact brought about its failure and the resignation of both Samuel Hoare and Pierre Laval and the subsequent start of unilateral Italian military operation for the conquest of Ethiopia. A. J. P. Taylor argued that it was the event that "killed the League of Nations".
In February 1936 Emilio Faldella, head of the special SIM section for East Africa (AO), infiltrated Palestinian agent Jacir Bey in Negus Haile Selassie's entourage. Jacir Bey offered to persuade the Emperor to reach a peace agreement with Italy, effectively turning Ethiopia into an Italian protectorate. Terms involved the maintenance of Haile Selassie on the throne and continuance of Ethiopian sovereignty over an independent but reduced state in Shewa with a corridor to the sea at the port of Assab. In return, all of Tigray and border areas of Eritrea and Somalia would be ceded to Italy, and unconquered Ethiopia would be placed under a strong Italian protectorate on the model of Manchukuo. The plan, however, never materialized, and Italian troops entered the capital, Addis Ababa, on 5 May 1936. Ethiopia was annexed to Italy on 7 May.
During World War II
The cracking of the Black Code
The biggest Italian intelligence victory scored during World War II was the acquisition of U.S. encipherment tables obtained through the break-in of the U.S. Embassy in Rome in September 1941 authorized by General Cesare Amè, head of the SIM. These tables were used by U.S. Ambassadors worldwide to communicate back to Washington, D.C. In October 1940, Colonel Bonner Fellers was assigned as military attaché to the U.S. embassy in Egypt and was to report to his American superiors the details of British military activities in the Mediterranean Theater of Operations. The British, hoping to eventually get the Americans into the war against the Axis powers, were very accommodating to Fellers giving him nearly full access to British operations in North Africa. Fellers, who was something of an Anglophobe, usually authored his dispatches in a less than favourable manner casting great doubt about the long-term success of the British and her Commonwealth allies fight against the Italo-German army in North Africa. His reports were read by Franklin D. Roosevelt, the head of American intelligence, and the Joint Chiefs of Staff. Using the encipherment tables the Italian SIM was able to decipher Fellers’ communiques with Washington in a matter of hours often gleaning important information about the British in North Africa such as its current positions, sustained losses, expected reinforcements, current supply situation, future plans, morale, etc. which it quickly reported to the Italian and German military in North Africa. The leak ended on June 29, when Fellers switched to the new U.S. code system. During the 8 months or so of reading Fellers’ dispatches to Washington, Rommel would refer to Fellers as “die gute Quelle” (the good source).
Operations in Yugoslavia
Shortly before the start of World War II, SIM had broken Yugoslav military codes. When, in April 1941, Italian forces in Albania were threatened by a planned Yugoslav strike, SIM operators sent coded messages to the Yugoslav divisions, ordering them to postpone the scheduled offensive and return to their start-lines. By the time the Yugoslavs realised they had been duped, the Italian defences had been restored. During the occupation of Yugoslavia, the SIM turned its attention to the communications of partisan groups and by mid-1943 had solved two systems used by the Chetniks and one used by Tito’s Partisans.
Guerrilla in East Africa
SIM played an important role in Italian guerrilla war in Ethiopia. Francesco De Martini, captain of the SIM, was one of the leaders of Italian insurgency in East Africa. In January 1942, he blew up a British ammunition dump in Massaua (Eritrea). After crossing the Red Sea in the motorboat Zam Zam, De Martini fled to Saudi Arabia. He made contact with the Italian consulate in that country, and from the Yemeni coast organized a group of Eritrean sailors (with small boats called sambuco) in order to identify, and notify Rome with his radio, of the Royal Navy movements throughout the Red Sea. Major Max Harari, head of the British military intelligence, offered a reward for his capture. On 1 August 1942, while attempting to come back to Eritrea, De Martini was captured on Dahlak Island by sailors from HMS Arpha and imprisoned in Sudan until the end of the war.
The Borg Pisani affaire
On 18 May 1942, Maltese irredentist and SIM spy Carmelo Borg Pisani was sent on an espionage mission to Malta, to check British defences and help prepare for the planned Axis invasion of the island (Operazione C3). Borg Pisani was recognized by one of his childhood friends, Cpt. Tom Warrington, who denounced him. British Intelligence kept him under arrest in a house in Sliema till August. He was then transferred to Corradino prison, accused of treason. On 12 November 1942, he stood trial under closed doors in front of three judges, headed by Chief Justice of Malta Sir George Borg, and defended by two lawyers. His plea that he had renounced British citizenship by returning his passport and acquisition of Italian citizenship (which would have granted him the status of prisoner of war) was not upheld by the military court. On 19 November 1942, he was publicly sentenced to death for espionage, for taking up arms against the Government and forming part of a conspiracy to overthrow the government. His execution by hanging took place at 7:30AM on Saturday, 28 November 1942. Borg Pisani was posthumously awarded the Gold Medal of Military Valor, the highest Italian military award, by King Victor Emmanuel III a few days after his death.
Sezione 5
SIM had a large, well-organized cryptanalytic department, Sezione 5, which attacked foreign crypto-systems. This section was headed by General Vittorio Gamba, a published student of cryptology who had been breaking codes since World War I, and was located in Rome. Also under Gamba was a subsection headed by the elderly Colonel Gino Mancini that produced codes and ciphers for the Royal Italian Army and higher-level enciphered codes for the Regia Marina. SIM's cryptographic section concentrated on military and diplomatic traffic. By the time the war was at its peak, SIM's interception and decryption operations had taken on immense proportions. On average 8,000 radio messages were intercepted each month, 6,000 were studied and out of these 3,500 were translated. The flow was so large that Colonel Cesare Amè, the head of SIM, began to publish a daily bulletin - Bulletin I - that summarized the most significant information. Copies of the bulletin were sent to Mussolini, to the Chief of General Staff and to king Victor Emmanuel (via his aide-de-camp Paolo Puntoni), while a good portion of the diplomatic traffic was sent to Count Galeazzo Ciano, the Italian Foreign Minister. The codes of several countries were attacked including France, Turkey, Romania, United States, Britain and the Vatican. Foreign Minister Galeazzo Ciano noted in his diary that Sezione 5 cryptanalysts routinely read British, Romanian, and neutral Turkey's diplomatic traffic.
Chiefs
See also
History of espionage
Italian intelligence agencies
OVRA: the secret police of Fascist Italy.
La Cagoule: French fascist-leaning and anti-communist terrorist group that regularly collaborated with SIM.
Kenpeitai: the military police arm of the Imperial Japanese Army from 1881 to 1945.
Tokubetsu Keisatsutai: the Imperial Japanese Navy's military police.
Wilhelm Franz Canaris: a German admiral and the chief of the Abwehr from 1935 to 1944.
References
Notes
Bibliography
Military intelligence agencies
Intelligence services of World War II
Counterintelligence agencies
1925 establishments in Italy
Government agencies established in 1925
Government agencies disestablished in 1949
Defunct intelligence agencies |
Neohibolites is a genus of belemnite, an extinct group of cephalopods.
See also
Belemnite
List of belemnites
References
Belemnites |
Łukasz Kubot and Marcelo Melo won the title, defeating Murray and Skupski in the final, 7–6(7–5), 7–5.
Rajeev Ram and Joe Salisbury were the defending champions, but they withdrew from the tournament before their quarterfinal match against Jamie Murray and Neal Skupski.
Seeds
Draw
Draw
Qualifying
Seeds
Qualifiers
Karol Drzewiecki / Szymon Walków
Qualifying draw
References
External links
Main draw
Erste Bank Open - Doubles
2020 Doubles
2020 in Austrian tennis |
```c
/* GIO - GLib Input, Output and Streaming Library
*
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General
*
* Author: Alexander Larsson <alexl@redhat.com>
*/
#include "config.h"
#include <glib.h>
#include "glibintl.h"
#include "ginputstream.h"
#include "gioprivate.h"
#include "gseekable.h"
#include "gcancellable.h"
#include "gasyncresult.h"
#include "gioerror.h"
#include "gpollableinputstream.h"
/**
* SECTION:ginputstream
* @short_description: Base class for implementing streaming input
* @include: gio/gio.h
*
* #GInputStream has functions to read from a stream (g_input_stream_read()),
* to close a stream (g_input_stream_close()) and to skip some content
* (g_input_stream_skip()).
*
* To copy the content of an input stream to an output stream without
* manually handling the reads and writes, use g_output_stream_splice().
*
* See the documentation for #GIOStream for details of thread safety of
* streaming APIs.
*
* All of these functions have async variants too.
**/
struct _GInputStreamPrivate {
guint closed : 1;
guint pending : 1;
GAsyncReadyCallback outstanding_callback;
};
G_DEFINE_ABSTRACT_TYPE_WITH_PRIVATE (GInputStream, g_input_stream, G_TYPE_OBJECT)
static gssize g_input_stream_real_skip (GInputStream *stream,
gsize count,
GCancellable *cancellable,
GError **error);
static void g_input_stream_real_read_async (GInputStream *stream,
void *buffer,
gsize count,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data);
static gssize g_input_stream_real_read_finish (GInputStream *stream,
GAsyncResult *result,
GError **error);
static void g_input_stream_real_skip_async (GInputStream *stream,
gsize count,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer data);
static gssize g_input_stream_real_skip_finish (GInputStream *stream,
GAsyncResult *result,
GError **error);
static void g_input_stream_real_close_async (GInputStream *stream,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer data);
static gboolean g_input_stream_real_close_finish (GInputStream *stream,
GAsyncResult *result,
GError **error);
static void
g_input_stream_dispose (GObject *object)
{
GInputStream *stream;
stream = G_INPUT_STREAM (object);
if (!stream->priv->closed)
g_input_stream_close (stream, NULL, NULL);
G_OBJECT_CLASS (g_input_stream_parent_class)->dispose (object);
}
static void
g_input_stream_class_init (GInputStreamClass *klass)
{
GObjectClass *gobject_class = G_OBJECT_CLASS (klass);
gobject_class->dispose = g_input_stream_dispose;
klass->skip = g_input_stream_real_skip;
klass->read_async = g_input_stream_real_read_async;
klass->read_finish = g_input_stream_real_read_finish;
klass->skip_async = g_input_stream_real_skip_async;
klass->skip_finish = g_input_stream_real_skip_finish;
klass->close_async = g_input_stream_real_close_async;
klass->close_finish = g_input_stream_real_close_finish;
}
static void
g_input_stream_init (GInputStream *stream)
{
stream->priv = g_input_stream_get_instance_private (stream);
}
/**
* g_input_stream_read:
* @stream: a #GInputStream.
* @buffer: (array length=count) (element-type guint8): a buffer to
* read data into (which should be at least count bytes long).
* @count: the number of bytes that will be read from the stream
* @cancellable: (allow-none): optional #GCancellable object, %NULL to ignore.
* @error: location to store the error occurring, or %NULL to ignore
*
* Tries to read @count bytes from the stream into the buffer starting at
* @buffer. Will block during this read.
*
* If count is zero returns zero and does nothing. A value of @count
* larger than %G_MAXSSIZE will cause a %G_IO_ERROR_INVALID_ARGUMENT error.
*
* On success, the number of bytes read into the buffer is returned.
* It is not an error if this is not the same as the requested size, as it
* can happen e.g. near the end of a file. Zero is returned on end of file
* (or if @count is zero), but never otherwise.
*
* The returned @buffer is not a nul-terminated string, it can contain nul bytes
* at any position, and this function doesn't nul-terminate the @buffer.
*
* If @cancellable is not %NULL, then the operation can be cancelled by
* triggering the cancellable object from another thread. If the operation
* was cancelled, the error %G_IO_ERROR_CANCELLED will be returned. If an
* operation was partially finished when the operation was cancelled the
* partial result will be returned, without an error.
*
* On error -1 is returned and @error is set accordingly.
*
* Returns: Number of bytes read, or -1 on error, or 0 on end of file.
**/
gssize
g_input_stream_read (GInputStream *stream,
void *buffer,
gsize count,
GCancellable *cancellable,
GError **error)
{
GInputStreamClass *class;
gssize res;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), -1);
g_return_val_if_fail (buffer != NULL, 0);
if (count == 0)
return 0;
if (((gssize) count) < 0)
{
g_set_error (error, G_IO_ERROR, G_IO_ERROR_INVALID_ARGUMENT,
_("Too large count value passed to %s"), G_STRFUNC);
return -1;
}
class = G_INPUT_STREAM_GET_CLASS (stream);
if (class->read_fn == NULL)
{
g_set_error_literal (error, G_IO_ERROR, G_IO_ERROR_NOT_SUPPORTED,
_("Input stream doesn't implement read"));
return -1;
}
if (!g_input_stream_set_pending (stream, error))
return -1;
if (cancellable)
g_cancellable_push_current (cancellable);
res = class->read_fn (stream, buffer, count, cancellable, error);
if (cancellable)
g_cancellable_pop_current (cancellable);
g_input_stream_clear_pending (stream);
return res;
}
/**
* g_input_stream_read_all:
* @stream: a #GInputStream.
* @buffer: (array length=count) (element-type guint8): a buffer to
* read data into (which should be at least count bytes long).
* @count: the number of bytes that will be read from the stream
* @bytes_read: (out): location to store the number of bytes that was read from the stream
* @cancellable: (allow-none): optional #GCancellable object, %NULL to ignore.
* @error: location to store the error occurring, or %NULL to ignore
*
* Tries to read @count bytes from the stream into the buffer starting at
* @buffer. Will block during this read.
*
* This function is similar to g_input_stream_read(), except it tries to
* read as many bytes as requested, only stopping on an error or end of stream.
*
* On a successful read of @count bytes, or if we reached the end of the
* stream, %TRUE is returned, and @bytes_read is set to the number of bytes
* read into @buffer.
*
* If there is an error during the operation %FALSE is returned and @error
* is set to indicate the error status.
*
* As a special exception to the normal conventions for functions that
* use #GError, if this function returns %FALSE (and sets @error) then
* @bytes_read will be set to the number of bytes that were successfully
* read before the error was encountered. This functionality is only
* available from C. If you need it from another language then you must
* write your own loop around g_input_stream_read().
*
* Returns: %TRUE on success, %FALSE if there was an error
**/
gboolean
g_input_stream_read_all (GInputStream *stream,
void *buffer,
gsize count,
gsize *bytes_read,
GCancellable *cancellable,
GError **error)
{
gsize _bytes_read;
gssize res;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), FALSE);
g_return_val_if_fail (buffer != NULL, FALSE);
_bytes_read = 0;
while (_bytes_read < count)
{
res = g_input_stream_read (stream, (char *)buffer + _bytes_read, count - _bytes_read,
cancellable, error);
if (res == -1)
{
if (bytes_read)
*bytes_read = _bytes_read;
return FALSE;
}
if (res == 0)
break;
_bytes_read += res;
}
if (bytes_read)
*bytes_read = _bytes_read;
return TRUE;
}
/**
* g_input_stream_read_bytes:
* @stream: a #GInputStream.
* @count: maximum number of bytes that will be read from the stream. Common
* values include 4096 and 8192.
* @cancellable: (allow-none): optional #GCancellable object, %NULL to ignore.
* @error: location to store the error occurring, or %NULL to ignore
*
* Like g_input_stream_read(), this tries to read @count bytes from
* the stream in a blocking fashion. However, rather than reading into
* a user-supplied buffer, this will create a new #GBytes containing
* the data that was read. This may be easier to use from language
* bindings.
*
* If count is zero, returns a zero-length #GBytes and does nothing. A
* value of @count larger than %G_MAXSSIZE will cause a
* %G_IO_ERROR_INVALID_ARGUMENT error.
*
* On success, a new #GBytes is returned. It is not an error if the
* size of this object is not the same as the requested size, as it
* can happen e.g. near the end of a file. A zero-length #GBytes is
* returned on end of file (or if @count is zero), but never
* otherwise.
*
* If @cancellable is not %NULL, then the operation can be cancelled by
* triggering the cancellable object from another thread. If the operation
* was cancelled, the error %G_IO_ERROR_CANCELLED will be returned. If an
* operation was partially finished when the operation was cancelled the
* partial result will be returned, without an error.
*
* On error %NULL is returned and @error is set accordingly.
*
* Returns: a new #GBytes, or %NULL on error
*
* Since: 2.34
**/
GBytes *
g_input_stream_read_bytes (GInputStream *stream,
gsize count,
GCancellable *cancellable,
GError **error)
{
guchar *buf;
gssize nread;
buf = g_malloc (count);
nread = g_input_stream_read (stream, buf, count, cancellable, error);
if (nread == -1)
{
g_free (buf);
return NULL;
}
else if (nread == 0)
{
g_free (buf);
return g_bytes_new_static ("", 0);
}
else
return g_bytes_new_take (buf, nread);
}
/**
* g_input_stream_skip:
* @stream: a #GInputStream.
* @count: the number of bytes that will be skipped from the stream
* @cancellable: (allow-none): optional #GCancellable object, %NULL to ignore.
* @error: location to store the error occurring, or %NULL to ignore
*
* Tries to skip @count bytes from the stream. Will block during the operation.
*
* This is identical to g_input_stream_read(), from a behaviour standpoint,
* but the bytes that are skipped are not returned to the user. Some
* streams have an implementation that is more efficient than reading the data.
*
* This function is optional for inherited classes, as the default implementation
* emulates it using read.
*
* If @cancellable is not %NULL, then the operation can be cancelled by
* triggering the cancellable object from another thread. If the operation
* was cancelled, the error %G_IO_ERROR_CANCELLED will be returned. If an
* operation was partially finished when the operation was cancelled the
* partial result will be returned, without an error.
*
* Returns: Number of bytes skipped, or -1 on error
**/
gssize
g_input_stream_skip (GInputStream *stream,
gsize count,
GCancellable *cancellable,
GError **error)
{
GInputStreamClass *class;
gssize res;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), -1);
if (count == 0)
return 0;
if (((gssize) count) < 0)
{
g_set_error (error, G_IO_ERROR, G_IO_ERROR_INVALID_ARGUMENT,
_("Too large count value passed to %s"), G_STRFUNC);
return -1;
}
class = G_INPUT_STREAM_GET_CLASS (stream);
if (!g_input_stream_set_pending (stream, error))
return -1;
if (cancellable)
g_cancellable_push_current (cancellable);
res = class->skip (stream, count, cancellable, error);
if (cancellable)
g_cancellable_pop_current (cancellable);
g_input_stream_clear_pending (stream);
return res;
}
static gssize
g_input_stream_real_skip (GInputStream *stream,
gsize count,
GCancellable *cancellable,
GError **error)
{
GInputStreamClass *class;
gssize ret, read_bytes;
char buffer[8192];
GError *my_error;
if (G_IS_SEEKABLE (stream) && g_seekable_can_seek (G_SEEKABLE (stream)))
{
if (g_seekable_seek (G_SEEKABLE (stream),
count,
G_SEEK_CUR,
cancellable,
NULL))
return count;
}
/* If not seekable, or seek failed, fall back to reading data: */
class = G_INPUT_STREAM_GET_CLASS (stream);
read_bytes = 0;
while (1)
{
my_error = NULL;
ret = class->read_fn (stream, buffer, MIN (sizeof (buffer), count),
cancellable, &my_error);
if (ret == -1)
{
if (read_bytes > 0 &&
my_error->domain == G_IO_ERROR &&
my_error->code == G_IO_ERROR_CANCELLED)
{
g_error_free (my_error);
return read_bytes;
}
g_propagate_error (error, my_error);
return -1;
}
count -= ret;
read_bytes += ret;
if (ret == 0 || count == 0)
return read_bytes;
}
}
/**
* g_input_stream_close:
* @stream: A #GInputStream.
* @cancellable: (allow-none): optional #GCancellable object, %NULL to ignore.
* @error: location to store the error occurring, or %NULL to ignore
*
* Closes the stream, releasing resources related to it.
*
* Once the stream is closed, all other operations will return %G_IO_ERROR_CLOSED.
* Closing a stream multiple times will not return an error.
*
* Streams will be automatically closed when the last reference
* is dropped, but you might want to call this function to make sure
* resources are released as early as possible.
*
* Some streams might keep the backing store of the stream (e.g. a file descriptor)
* open after the stream is closed. See the documentation for the individual
* stream for details.
*
* On failure the first error that happened will be reported, but the close
* operation will finish as much as possible. A stream that failed to
* close will still return %G_IO_ERROR_CLOSED for all operations. Still, it
* is important to check and report the error to the user.
*
* If @cancellable is not %NULL, then the operation can be cancelled by
* triggering the cancellable object from another thread. If the operation
* was cancelled, the error %G_IO_ERROR_CANCELLED will be returned.
* Cancelling a close will still leave the stream closed, but some streams
* can use a faster close that doesn't block to e.g. check errors.
*
* Returns: %TRUE on success, %FALSE on failure
**/
gboolean
g_input_stream_close (GInputStream *stream,
GCancellable *cancellable,
GError **error)
{
GInputStreamClass *class;
gboolean res;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), FALSE);
class = G_INPUT_STREAM_GET_CLASS (stream);
if (stream->priv->closed)
return TRUE;
res = TRUE;
if (!g_input_stream_set_pending (stream, error))
return FALSE;
if (cancellable)
g_cancellable_push_current (cancellable);
if (class->close_fn)
res = class->close_fn (stream, cancellable, error);
if (cancellable)
g_cancellable_pop_current (cancellable);
g_input_stream_clear_pending (stream);
stream->priv->closed = TRUE;
return res;
}
static void
async_ready_callback_wrapper (GObject *source_object,
GAsyncResult *res,
gpointer user_data)
{
GInputStream *stream = G_INPUT_STREAM (source_object);
g_input_stream_clear_pending (stream);
if (stream->priv->outstanding_callback)
(*stream->priv->outstanding_callback) (source_object, res, user_data);
g_object_unref (stream);
}
static void
async_ready_close_callback_wrapper (GObject *source_object,
GAsyncResult *res,
gpointer user_data)
{
GInputStream *stream = G_INPUT_STREAM (source_object);
g_input_stream_clear_pending (stream);
stream->priv->closed = TRUE;
if (stream->priv->outstanding_callback)
(*stream->priv->outstanding_callback) (source_object, res, user_data);
g_object_unref (stream);
}
/**
* g_input_stream_read_async:
* @stream: A #GInputStream.
* @buffer: (array length=count) (element-type guint8): a buffer to
* read data into (which should be at least count bytes long).
* @count: the number of bytes that will be read from the stream
* @io_priority: the [I/O priority][io-priority]
* of the request.
* @cancellable: (allow-none): optional #GCancellable object, %NULL to ignore.
* @callback: (scope async): callback to call when the request is satisfied
* @user_data: (closure): the data to pass to callback function
*
* Request an asynchronous read of @count bytes from the stream into the buffer
* starting at @buffer. When the operation is finished @callback will be called.
* You can then call g_input_stream_read_finish() to get the result of the
* operation.
*
* During an async request no other sync and async calls are allowed on @stream, and will
* result in %G_IO_ERROR_PENDING errors.
*
* A value of @count larger than %G_MAXSSIZE will cause a %G_IO_ERROR_INVALID_ARGUMENT error.
*
* On success, the number of bytes read into the buffer will be passed to the
* callback. It is not an error if this is not the same as the requested size, as it
* can happen e.g. near the end of a file, but generally we try to read
* as many bytes as requested. Zero is returned on end of file
* (or if @count is zero), but never otherwise.
*
* Any outstanding i/o request with higher priority (lower numerical value) will
* be executed before an outstanding request with lower priority. Default
* priority is %G_PRIORITY_DEFAULT.
*
* The asyncronous methods have a default fallback that uses threads to implement
* asynchronicity, so they are optional for inheriting classes. However, if you
* override one you must override all.
**/
void
g_input_stream_read_async (GInputStream *stream,
void *buffer,
gsize count,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data)
{
GInputStreamClass *class;
GError *error = NULL;
g_return_if_fail (G_IS_INPUT_STREAM (stream));
g_return_if_fail (buffer != NULL);
if (count == 0)
{
GTask *task;
task = g_task_new (stream, cancellable, callback, user_data);
g_task_set_source_tag (task, g_input_stream_read_async);
g_task_return_int (task, 0);
g_object_unref (task);
return;
}
if (((gssize) count) < 0)
{
g_task_report_new_error (stream, callback, user_data,
g_input_stream_read_async,
G_IO_ERROR, G_IO_ERROR_INVALID_ARGUMENT,
_("Too large count value passed to %s"),
G_STRFUNC);
return;
}
if (!g_input_stream_set_pending (stream, &error))
{
g_task_report_error (stream, callback, user_data,
g_input_stream_read_async,
error);
return;
}
class = G_INPUT_STREAM_GET_CLASS (stream);
stream->priv->outstanding_callback = callback;
g_object_ref (stream);
class->read_async (stream, buffer, count, io_priority, cancellable,
async_ready_callback_wrapper, user_data);
}
/**
* g_input_stream_read_finish:
* @stream: a #GInputStream.
* @result: a #GAsyncResult.
* @error: a #GError location to store the error occurring, or %NULL to
* ignore.
*
* Finishes an asynchronous stream read operation.
*
* Returns: number of bytes read in, or -1 on error, or 0 on end of file.
**/
gssize
g_input_stream_read_finish (GInputStream *stream,
GAsyncResult *result,
GError **error)
{
GInputStreamClass *class;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), -1);
g_return_val_if_fail (G_IS_ASYNC_RESULT (result), -1);
if (g_async_result_legacy_propagate_error (result, error))
return -1;
else if (g_async_result_is_tagged (result, g_input_stream_read_async))
return g_task_propagate_int (G_TASK (result), error);
class = G_INPUT_STREAM_GET_CLASS (stream);
return class->read_finish (stream, result, error);
}
typedef struct
{
gchar *buffer;
gsize to_read;
gsize bytes_read;
} AsyncReadAll;
static void
free_async_read_all (gpointer data)
{
g_slice_free (AsyncReadAll, data);
}
static void
read_all_callback (GObject *stream,
GAsyncResult *result,
gpointer user_data)
{
GTask *task = user_data;
AsyncReadAll *data = g_task_get_task_data (task);
gboolean got_eof = FALSE;
if (result)
{
GError *error = NULL;
gssize nread;
nread = g_input_stream_read_finish (G_INPUT_STREAM (stream), result, &error);
if (nread == -1)
{
g_task_return_error (task, error);
g_object_unref (task);
return;
}
g_assert_cmpint (nread, <=, data->to_read);
data->to_read -= nread;
data->bytes_read += nread;
got_eof = (nread == 0);
}
if (got_eof || data->to_read == 0)
{
g_task_return_boolean (task, TRUE);
g_object_unref (task);
}
else
g_input_stream_read_async (G_INPUT_STREAM (stream),
data->buffer + data->bytes_read,
data->to_read,
g_task_get_priority (task),
g_task_get_cancellable (task),
read_all_callback, task);
}
static void
read_all_async_thread (GTask *task,
gpointer source_object,
gpointer task_data,
GCancellable *cancellable)
{
GInputStream *stream = source_object;
AsyncReadAll *data = task_data;
GError *error = NULL;
if (g_input_stream_read_all (stream, data->buffer, data->to_read, &data->bytes_read,
g_task_get_cancellable (task), &error))
g_task_return_boolean (task, TRUE);
else
g_task_return_error (task, error);
}
/**
* g_input_stream_read_all_async:
* @stream: A #GInputStream
* @buffer: (array length=count) (element-type guint8): a buffer to
* read data into (which should be at least count bytes long)
* @count: the number of bytes that will be read from the stream
* @io_priority: the [I/O priority][io-priority] of the request
* @cancellable: (allow-none): optional #GCancellable object, %NULL to ignore
* @callback: (scope async): callback to call when the request is satisfied
* @user_data: (closure): the data to pass to callback function
*
* Request an asynchronous read of @count bytes from the stream into the
* buffer starting at @buffer.
*
* This is the asynchronous equivalent of g_input_stream_read_all().
*
* Call g_input_stream_read_all_finish() to collect the result.
*
* Any outstanding I/O request with higher priority (lower numerical
* value) will be executed before an outstanding request with lower
* priority. Default priority is %G_PRIORITY_DEFAULT.
*
* Since: 2.44
**/
void
g_input_stream_read_all_async (GInputStream *stream,
void *buffer,
gsize count,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data)
{
AsyncReadAll *data;
GTask *task;
g_return_if_fail (G_IS_INPUT_STREAM (stream));
g_return_if_fail (buffer != NULL || count == 0);
task = g_task_new (stream, cancellable, callback, user_data);
data = g_slice_new0 (AsyncReadAll);
data->buffer = buffer;
data->to_read = count;
g_task_set_task_data (task, data, free_async_read_all);
g_task_set_priority (task, io_priority);
/* If async reads are going to be handled via the threadpool anyway
* then we may as well do it with a single dispatch instead of
* bouncing in and out.
*/
if (g_input_stream_async_read_is_via_threads (stream))
{
g_task_run_in_thread (task, read_all_async_thread);
g_object_unref (task);
}
else
read_all_callback (G_OBJECT (stream), NULL, task);
}
/**
* g_input_stream_read_all_finish:
* @stream: a #GInputStream
* @result: a #GAsyncResult
* @bytes_read: (out): location to store the number of bytes that was read from the stream
* @error: a #GError location to store the error occurring, or %NULL to ignore
*
* Finishes an asynchronous stream read operation started with
* g_input_stream_read_all_async().
*
* As a special exception to the normal conventions for functions that
* use #GError, if this function returns %FALSE (and sets @error) then
* @bytes_read will be set to the number of bytes that were successfully
* read before the error was encountered. This functionality is only
* available from C. If you need it from another language then you must
* write your own loop around g_input_stream_read_async().
*
* Returns: %TRUE on success, %FALSE if there was an error
*
* Since: 2.44
**/
gboolean
g_input_stream_read_all_finish (GInputStream *stream,
GAsyncResult *result,
gsize *bytes_read,
GError **error)
{
GTask *task;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), FALSE);
g_return_val_if_fail (g_task_is_valid (result, stream), FALSE);
task = G_TASK (result);
if (bytes_read)
{
AsyncReadAll *data = g_task_get_task_data (task);
*bytes_read = data->bytes_read;
}
return g_task_propagate_boolean (task, error);
}
static void
read_bytes_callback (GObject *stream,
GAsyncResult *result,
gpointer user_data)
{
GTask *task = user_data;
guchar *buf = g_task_get_task_data (task);
GError *error = NULL;
gssize nread;
GBytes *bytes = NULL;
nread = g_input_stream_read_finish (G_INPUT_STREAM (stream),
result, &error);
if (nread == -1)
{
g_free (buf);
g_task_return_error (task, error);
}
else if (nread == 0)
{
g_free (buf);
bytes = g_bytes_new_static ("", 0);
}
else
bytes = g_bytes_new_take (buf, nread);
if (bytes)
g_task_return_pointer (task, bytes, (GDestroyNotify)g_bytes_unref);
g_object_unref (task);
}
/**
* g_input_stream_read_bytes_async:
* @stream: A #GInputStream.
* @count: the number of bytes that will be read from the stream
* @io_priority: the [I/O priority][io-priority] of the request
* @cancellable: (allow-none): optional #GCancellable object, %NULL to ignore.
* @callback: (scope async): callback to call when the request is satisfied
* @user_data: (closure): the data to pass to callback function
*
* Request an asynchronous read of @count bytes from the stream into a
* new #GBytes. When the operation is finished @callback will be
* called. You can then call g_input_stream_read_bytes_finish() to get the
* result of the operation.
*
* During an async request no other sync and async calls are allowed
* on @stream, and will result in %G_IO_ERROR_PENDING errors.
*
* A value of @count larger than %G_MAXSSIZE will cause a
* %G_IO_ERROR_INVALID_ARGUMENT error.
*
* On success, the new #GBytes will be passed to the callback. It is
* not an error if this is smaller than the requested size, as it can
* happen e.g. near the end of a file, but generally we try to read as
* many bytes as requested. Zero is returned on end of file (or if
* @count is zero), but never otherwise.
*
* Any outstanding I/O request with higher priority (lower numerical
* value) will be executed before an outstanding request with lower
* priority. Default priority is %G_PRIORITY_DEFAULT.
*
* Since: 2.34
**/
void
g_input_stream_read_bytes_async (GInputStream *stream,
gsize count,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data)
{
GTask *task;
guchar *buf;
task = g_task_new (stream, cancellable, callback, user_data);
buf = g_malloc (count);
g_task_set_task_data (task, buf, NULL);
g_input_stream_read_async (stream, buf, count,
io_priority, cancellable,
read_bytes_callback, task);
}
/**
* g_input_stream_read_bytes_finish:
* @stream: a #GInputStream.
* @result: a #GAsyncResult.
* @error: a #GError location to store the error occurring, or %NULL to
* ignore.
*
* Finishes an asynchronous stream read-into-#GBytes operation.
*
* Returns: the newly-allocated #GBytes, or %NULL on error
*
* Since: 2.34
**/
GBytes *
g_input_stream_read_bytes_finish (GInputStream *stream,
GAsyncResult *result,
GError **error)
{
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), NULL);
g_return_val_if_fail (g_task_is_valid (result, stream), NULL);
return g_task_propagate_pointer (G_TASK (result), error);
}
/**
* g_input_stream_skip_async:
* @stream: A #GInputStream.
* @count: the number of bytes that will be skipped from the stream
* @io_priority: the [I/O priority][io-priority] of the request
* @cancellable: (allow-none): optional #GCancellable object, %NULL to ignore.
* @callback: (scope async): callback to call when the request is satisfied
* @user_data: (closure): the data to pass to callback function
*
* Request an asynchronous skip of @count bytes from the stream.
* When the operation is finished @callback will be called.
* You can then call g_input_stream_skip_finish() to get the result
* of the operation.
*
* During an async request no other sync and async calls are allowed,
* and will result in %G_IO_ERROR_PENDING errors.
*
* A value of @count larger than %G_MAXSSIZE will cause a %G_IO_ERROR_INVALID_ARGUMENT error.
*
* On success, the number of bytes skipped will be passed to the callback.
* It is not an error if this is not the same as the requested size, as it
* can happen e.g. near the end of a file, but generally we try to skip
* as many bytes as requested. Zero is returned on end of file
* (or if @count is zero), but never otherwise.
*
* Any outstanding i/o request with higher priority (lower numerical value)
* will be executed before an outstanding request with lower priority.
* Default priority is %G_PRIORITY_DEFAULT.
*
* The asynchronous methods have a default fallback that uses threads to
* implement asynchronicity, so they are optional for inheriting classes.
* However, if you override one, you must override all.
**/
void
g_input_stream_skip_async (GInputStream *stream,
gsize count,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data)
{
GInputStreamClass *class;
GError *error = NULL;
g_return_if_fail (G_IS_INPUT_STREAM (stream));
if (count == 0)
{
GTask *task;
task = g_task_new (stream, cancellable, callback, user_data);
g_task_set_source_tag (task, g_input_stream_skip_async);
g_task_return_int (task, 0);
g_object_unref (task);
return;
}
if (((gssize) count) < 0)
{
g_task_report_new_error (stream, callback, user_data,
g_input_stream_skip_async,
G_IO_ERROR, G_IO_ERROR_INVALID_ARGUMENT,
_("Too large count value passed to %s"),
G_STRFUNC);
return;
}
if (!g_input_stream_set_pending (stream, &error))
{
g_task_report_error (stream, callback, user_data,
g_input_stream_skip_async,
error);
return;
}
class = G_INPUT_STREAM_GET_CLASS (stream);
stream->priv->outstanding_callback = callback;
g_object_ref (stream);
class->skip_async (stream, count, io_priority, cancellable,
async_ready_callback_wrapper, user_data);
}
/**
* g_input_stream_skip_finish:
* @stream: a #GInputStream.
* @result: a #GAsyncResult.
* @error: a #GError location to store the error occurring, or %NULL to
* ignore.
*
* Finishes a stream skip operation.
*
* Returns: the size of the bytes skipped, or %-1 on error.
**/
gssize
g_input_stream_skip_finish (GInputStream *stream,
GAsyncResult *result,
GError **error)
{
GInputStreamClass *class;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), -1);
g_return_val_if_fail (G_IS_ASYNC_RESULT (result), -1);
if (g_async_result_legacy_propagate_error (result, error))
return -1;
else if (g_async_result_is_tagged (result, g_input_stream_skip_async))
return g_task_propagate_int (G_TASK (result), error);
class = G_INPUT_STREAM_GET_CLASS (stream);
return class->skip_finish (stream, result, error);
}
/**
* g_input_stream_close_async:
* @stream: A #GInputStream.
* @io_priority: the [I/O priority][io-priority] of the request
* @cancellable: (allow-none): optional cancellable object
* @callback: (scope async): callback to call when the request is satisfied
* @user_data: (closure): the data to pass to callback function
*
* Requests an asynchronous closes of the stream, releasing resources related to it.
* When the operation is finished @callback will be called.
* You can then call g_input_stream_close_finish() to get the result of the
* operation.
*
* For behaviour details see g_input_stream_close().
*
* The asyncronous methods have a default fallback that uses threads to implement
* asynchronicity, so they are optional for inheriting classes. However, if you
* override one you must override all.
**/
void
g_input_stream_close_async (GInputStream *stream,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data)
{
GInputStreamClass *class;
GError *error = NULL;
g_return_if_fail (G_IS_INPUT_STREAM (stream));
if (stream->priv->closed)
{
GTask *task;
task = g_task_new (stream, cancellable, callback, user_data);
g_task_set_source_tag (task, g_input_stream_close_async);
g_task_return_boolean (task, TRUE);
g_object_unref (task);
return;
}
if (!g_input_stream_set_pending (stream, &error))
{
g_task_report_error (stream, callback, user_data,
g_input_stream_close_async,
error);
return;
}
class = G_INPUT_STREAM_GET_CLASS (stream);
stream->priv->outstanding_callback = callback;
g_object_ref (stream);
class->close_async (stream, io_priority, cancellable,
async_ready_close_callback_wrapper, user_data);
}
/**
* g_input_stream_close_finish:
* @stream: a #GInputStream.
* @result: a #GAsyncResult.
* @error: a #GError location to store the error occurring, or %NULL to
* ignore.
*
* Finishes closing a stream asynchronously, started from g_input_stream_close_async().
*
* Returns: %TRUE if the stream was closed successfully.
**/
gboolean
g_input_stream_close_finish (GInputStream *stream,
GAsyncResult *result,
GError **error)
{
GInputStreamClass *class;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), FALSE);
g_return_val_if_fail (G_IS_ASYNC_RESULT (result), FALSE);
if (g_async_result_legacy_propagate_error (result, error))
return FALSE;
else if (g_async_result_is_tagged (result, g_input_stream_close_async))
return g_task_propagate_boolean (G_TASK (result), error);
class = G_INPUT_STREAM_GET_CLASS (stream);
return class->close_finish (stream, result, error);
}
/**
* g_input_stream_is_closed:
* @stream: input stream.
*
* Checks if an input stream is closed.
*
* Returns: %TRUE if the stream is closed.
**/
gboolean
g_input_stream_is_closed (GInputStream *stream)
{
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), TRUE);
return stream->priv->closed;
}
/**
* g_input_stream_has_pending:
* @stream: input stream.
*
* Checks if an input stream has pending actions.
*
* Returns: %TRUE if @stream has pending actions.
**/
gboolean
g_input_stream_has_pending (GInputStream *stream)
{
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), TRUE);
return stream->priv->pending;
}
/**
* g_input_stream_set_pending:
* @stream: input stream
* @error: a #GError location to store the error occurring, or %NULL to
* ignore.
*
* Sets @stream to have actions pending. If the pending flag is
* already set or @stream is closed, it will return %FALSE and set
* @error.
*
* Returns: %TRUE if pending was previously unset and is now set.
**/
gboolean
g_input_stream_set_pending (GInputStream *stream, GError **error)
{
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), FALSE);
if (stream->priv->closed)
{
g_set_error_literal (error, G_IO_ERROR, G_IO_ERROR_CLOSED,
_("Stream is already closed"));
return FALSE;
}
if (stream->priv->pending)
{
g_set_error_literal (error, G_IO_ERROR, G_IO_ERROR_PENDING,
/* Translators: This is an error you get if there is already an
* operation running against this stream when you try to start
* one */
_("Stream has outstanding operation"));
return FALSE;
}
stream->priv->pending = TRUE;
return TRUE;
}
/**
* g_input_stream_clear_pending:
* @stream: input stream
*
* Clears the pending flag on @stream.
**/
void
g_input_stream_clear_pending (GInputStream *stream)
{
g_return_if_fail (G_IS_INPUT_STREAM (stream));
stream->priv->pending = FALSE;
}
/*< internal >
* g_input_stream_async_read_is_via_threads:
* @stream: input stream
*
* Checks if an input stream's read_async function uses threads.
*
* Returns: %TRUE if @stream's read_async function uses threads.
**/
gboolean
g_input_stream_async_read_is_via_threads (GInputStream *stream)
{
GInputStreamClass *class;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), FALSE);
class = G_INPUT_STREAM_GET_CLASS (stream);
return (class->read_async == g_input_stream_real_read_async &&
!(G_IS_POLLABLE_INPUT_STREAM (stream) &&
g_pollable_input_stream_can_poll (G_POLLABLE_INPUT_STREAM (stream))));
}
/*< internal >
* g_input_stream_async_close_is_via_threads:
* @stream: input stream
*
* Checks if an input stream's close_async function uses threads.
*
* Returns: %TRUE if @stream's close_async function uses threads.
**/
gboolean
g_input_stream_async_close_is_via_threads (GInputStream *stream)
{
GInputStreamClass *class;
g_return_val_if_fail (G_IS_INPUT_STREAM (stream), FALSE);
class = G_INPUT_STREAM_GET_CLASS (stream);
return class->close_async == g_input_stream_real_close_async;
}
/********************************************
* Default implementation of async ops *
********************************************/
typedef struct {
void *buffer;
gsize count;
} ReadData;
static void
free_read_data (ReadData *op)
{
g_slice_free (ReadData, op);
}
static void
read_async_thread (GTask *task,
gpointer source_object,
gpointer task_data,
GCancellable *cancellable)
{
GInputStream *stream = source_object;
ReadData *op = task_data;
GInputStreamClass *class;
GError *error = NULL;
gssize nread;
class = G_INPUT_STREAM_GET_CLASS (stream);
nread = class->read_fn (stream,
op->buffer, op->count,
g_task_get_cancellable (task),
&error);
if (nread == -1)
g_task_return_error (task, error);
else
g_task_return_int (task, nread);
}
static void read_async_pollable (GPollableInputStream *stream,
GTask *task);
static gboolean
read_async_pollable_ready (GPollableInputStream *stream,
gpointer user_data)
{
GTask *task = user_data;
read_async_pollable (stream, task);
return FALSE;
}
static void
read_async_pollable (GPollableInputStream *stream,
GTask *task)
{
ReadData *op = g_task_get_task_data (task);
GError *error = NULL;
gssize nread;
if (g_task_return_error_if_cancelled (task))
return;
nread = G_POLLABLE_INPUT_STREAM_GET_INTERFACE (stream)->
read_nonblocking (stream, op->buffer, op->count, &error);
if (g_error_matches (error, G_IO_ERROR, G_IO_ERROR_WOULD_BLOCK))
{
GSource *source;
g_error_free (error);
source = g_pollable_input_stream_create_source (stream,
g_task_get_cancellable (task));
g_task_attach_source (task, source,
(GSourceFunc) read_async_pollable_ready);
g_source_unref (source);
return;
}
if (nread == -1)
g_task_return_error (task, error);
else
g_task_return_int (task, nread);
/* g_input_stream_real_read_async() unrefs task */
}
static void
g_input_stream_real_read_async (GInputStream *stream,
void *buffer,
gsize count,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data)
{
GTask *task;
ReadData *op;
op = g_slice_new0 (ReadData);
task = g_task_new (stream, cancellable, callback, user_data);
g_task_set_task_data (task, op, (GDestroyNotify) free_read_data);
g_task_set_priority (task, io_priority);
op->buffer = buffer;
op->count = count;
if (!g_input_stream_async_read_is_via_threads (stream))
read_async_pollable (G_POLLABLE_INPUT_STREAM (stream), task);
else
g_task_run_in_thread (task, read_async_thread);
g_object_unref (task);
}
static gssize
g_input_stream_real_read_finish (GInputStream *stream,
GAsyncResult *result,
GError **error)
{
g_return_val_if_fail (g_task_is_valid (result, stream), -1);
return g_task_propagate_int (G_TASK (result), error);
}
static void
skip_async_thread (GTask *task,
gpointer source_object,
gpointer task_data,
GCancellable *cancellable)
{
GInputStream *stream = source_object;
gsize count = GPOINTER_TO_SIZE (task_data);
GInputStreamClass *class;
GError *error = NULL;
gssize ret;
class = G_INPUT_STREAM_GET_CLASS (stream);
ret = class->skip (stream, count,
g_task_get_cancellable (task),
&error);
if (ret == -1)
g_task_return_error (task, error);
else
g_task_return_int (task, ret);
}
typedef struct {
char buffer[8192];
gsize count;
gsize count_skipped;
} SkipFallbackAsyncData;
static void
skip_callback_wrapper (GObject *source_object,
GAsyncResult *res,
gpointer user_data)
{
GInputStreamClass *class;
GTask *task = user_data;
SkipFallbackAsyncData *data = g_task_get_task_data (task);
GError *error = NULL;
gssize ret;
ret = g_input_stream_read_finish (G_INPUT_STREAM (source_object), res, &error);
if (ret > 0)
{
data->count -= ret;
data->count_skipped += ret;
if (data->count > 0)
{
class = G_INPUT_STREAM_GET_CLASS (source_object);
class->read_async (G_INPUT_STREAM (source_object),
data->buffer, MIN (8192, data->count),
g_task_get_priority (task),
g_task_get_cancellable (task),
skip_callback_wrapper, task);
return;
}
}
if (ret == -1 &&
g_error_matches (error, G_IO_ERROR, G_IO_ERROR_CANCELLED) &&
data->count_skipped)
{
/* No error, return partial read */
g_clear_error (&error);
}
if (error)
g_task_return_error (task, error);
else
g_task_return_int (task, data->count_skipped);
g_object_unref (task);
}
static void
g_input_stream_real_skip_async (GInputStream *stream,
gsize count,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data)
{
GInputStreamClass *class;
SkipFallbackAsyncData *data;
GTask *task;
class = G_INPUT_STREAM_GET_CLASS (stream);
task = g_task_new (stream, cancellable, callback, user_data);
g_task_set_priority (task, io_priority);
if (g_input_stream_async_read_is_via_threads (stream))
{
/* Read is thread-using async fallback.
* Make skip use threads too, so that we can use a possible sync skip
* implementation. */
g_task_set_task_data (task, GSIZE_TO_POINTER (count), NULL);
g_task_run_in_thread (task, skip_async_thread);
g_object_unref (task);
}
else
{
/* TODO: Skip fallback uses too much memory, should do multiple read calls */
/* There is a custom async read function, lets use that. */
data = g_new (SkipFallbackAsyncData, 1);
data->count = count;
data->count_skipped = 0;
g_task_set_task_data (task, data, g_free);
g_task_set_check_cancellable (task, FALSE);
class->read_async (stream, data->buffer, MIN (8192, count), io_priority, cancellable,
skip_callback_wrapper, task);
}
}
static gssize
g_input_stream_real_skip_finish (GInputStream *stream,
GAsyncResult *result,
GError **error)
{
g_return_val_if_fail (g_task_is_valid (result, stream), -1);
return g_task_propagate_int (G_TASK (result), error);
}
static void
close_async_thread (GTask *task,
gpointer source_object,
gpointer task_data,
GCancellable *cancellable)
{
GInputStream *stream = source_object;
GInputStreamClass *class;
GError *error = NULL;
gboolean result;
class = G_INPUT_STREAM_GET_CLASS (stream);
if (class->close_fn)
{
result = class->close_fn (stream,
g_task_get_cancellable (task),
&error);
if (!result)
{
g_task_return_error (task, error);
return;
}
}
g_task_return_boolean (task, TRUE);
}
static void
g_input_stream_real_close_async (GInputStream *stream,
int io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data)
{
GTask *task;
task = g_task_new (stream, cancellable, callback, user_data);
g_task_set_check_cancellable (task, FALSE);
g_task_set_priority (task, io_priority);
g_task_run_in_thread (task, close_async_thread);
g_object_unref (task);
}
static gboolean
g_input_stream_real_close_finish (GInputStream *stream,
GAsyncResult *result,
GError **error)
{
g_return_val_if_fail (g_task_is_valid (result, stream), FALSE);
return g_task_propagate_boolean (G_TASK (result), error);
}
``` |
Reduvius is a large genus of reduviids or assassin bugs. The masked hunter, Reduvius personatus, is a well-known example of this genus.
They measure 8–22 mm. They are the largest predatory insects and one of the largest clades of predatory insects. They are found in many terrestrial ecosystems and microhabitats, ranging from mammal burrows in the desert to logs in rainforests.
Partial list of species
Reduvius fedtschenkianus (Oshanin, 1871)
Reduvius jakovleffi Reuter, 1892
Reduvius pallipes Klug, 1830
Reduvius personatus (Linnaeus, 1758) "Masked hunter"
Reduvius senilis Van Duzee, 1906
Reduvius sonoraensis Usinger, 1942
Reduvius testaceus Herrich-Schaeffer, 1845
Reduvius vanduzeei Wygodzinsky & Usinger, 1964
References
Reduviidae |
Robert Dean Smith (born 2 May 1956 in Kansas) is an American operatic tenor.
Smith studied at Pittsburg State University (Kansas) with Margaret Thuenemann, at the Juilliard School of Music in New York City with Daniel Ferro, and with Professor Janice Harper in Europe. Like many dramatic tenors, he began his career as a baritone and sang for several years in German opera houses. He sings a variety of opera and concert repertoire, in different languages and styles.
From 2007 to 2008 he performed Lohengrin and Die Meistersinger in Dresden; Die Frau ohne Schatten at the Lyric Opera of Chicago with Deborah Voigt and Christine Brewer; Tristan und Isolde at the Madrid Teatro Real and the Bayreuth Festival; Tannhäuser at the Berlin Staatsoper; Der fliegende Holländer at the Bavarian State Opera (Bayerische Staatsoper) in Munich and the Vienna State Opera; Ariadne auf Naxos at the Royal Opera, London at Covent Garden; and Fidelio in Tokyo.
On March 22, 2008, Smith made his Metropolitan Opera debut as the lead role in Tristan und Isolde — which was broadcast in the Met's Live in HD series in cinemas in the US, and also aired live on NPR and other radio stations in the US and abroad, as part of the live Metropolitan Opera International Radio Network season. Smith was brought in to replace an ailing Ben Heppner. A January 2015 incident involving his portrayal of Tristan at the Théâtre du Capitole de Toulouse in the Wagner opera is widely reported including The New York Times. A 210 kg fake rock was descending toward the recently dead Tristan, when Smith noticed it was not stopping caused him to roll away quickly provoking laughter from the audience. There was a murder investigation into “l’affaire du rocher”.
Discography
Mahler – Das Lied von der Erde. Vladimir Jurowski, Sarah Connolly, Robert Dean Smith, Rundfunk-Sinfonieorchester Berlin. PENTATONE PTC 5186760 (2020)
Wagner – Die Walküre. Tomasz Konieczny, Iris Vermillion, Robert Dean Smith, Timo Riihonen, Petra Lang, Marek Janowski, Nicole Piccolomini, Kismara Pessatti, Anja Fidelia Ulrich, Fionnuala McCarthy, Heike Wessels, Carola Höhn, Wilke te Brummelstroete, Renate Spingler, Melanie Diener, Rundfunk-Sinfonieorchester Berlin. PENTATONE PTC 5186407 (2013)
Wagner – Tannhäuser. Albert Dohmen, Robert Dean Smith, Christian Gerhaher, Peter Sonn, Wilhelm Schwinghammer, Michael McCown, Martin Snel, Nina Stemme, Marina Prudenskaya, Bianca Reim, Marek Janowski, Rundfunk-Sinfonieorchester Berlin, Rundfunkchor Berlin. PENTATONE PTC 5186405 (2013)
Wagner – Die Meistersinger von Nürnberg. Albert Dohmen, Georg Zeppenfeld, Michael Smallwood, Sebastian Noack, Dietrich Henschel, Tuomas Pursio, Jörg Schörner, Thomas Ebenstein, Thorsten Scharnke, Tobias Berndt, Hans-Peter Scheidegger, Lee Hyung-Wook, Robert Dean Smith, Peter Sonn, Edith Haller, Michelle Breedt, Matti Salminen, Marek Janowski, Rundfunk-Sinfonieorchester Berlin, Rundfunkchor Berlin. PENTATONE PTC 5186402 (2011)
Wagner – Der fliegende Holländer. Matti Salminen, Ricarda Merbeth, Robert Dean Smith, Silvia Hablowetz, Steve Davislim, Albert Dohmen, Marek Janowski. PENTATONE PTC 5186400 (2011)
References
External links
American operatic tenors
Heldentenors
Living people
1956 births
Singers from Kansas
Pittsburg State University alumni
Juilliard School alumni |
Go-op may refer to:
Go-Op (car sharing company), in Pittsburgh, US
Go-Op (train operating company), in Bristol, UK
See also
Goop (disambiguation) |
James Maloney (September 11, 1870 – January 28, 1960) was an American labor union leader.
Born in Scranton, Pennsylvania, Maloney began working in a glass bottle factory at the age of eight. He later completed an apprenticeship as a glass bottle blower, and joined the Glass Bottle Blowers' Association (GBBA) in 1890. He held various posts in his local union, and then in 1909 was elected to the international union's executive board.
Maloney won election as a vice-president of the GBBA in 1917, and then in 1925 as president of the union. When he took over as leader of the union, it was struggling to continue after heavy job losses due to alcohol prohibition. He worked with leaders of the brewery and distillery unions to campaign for the repeal of prohibition, and once this took place, the GBBA's membership grew from 2,000 to 34,000.
Maloney served as the American Federation of Labor's delegate to the Trades and Labor Congress of Canada in 1935, and then to the British Trades Union Congress in 1939. He was also a founder of the Union Labor Life Insurance Company, and served for a time as its treasurer.
Maloney retired in 1946, returning to Scranton, where he died in 1960, at the age of 89.
References
1870 births
1960 deaths
American trade union leaders
People from Scranton, Pennsylvania
Trade unionists from Pennsylvania |
Selce () is a settlement southeast of Dole the Municipality of Litija in central Slovenia. The area is part of the traditional region of Lower Carniola. It is now included with the rest of the municipality in the Central Sava Statistical Region.
North of the settlement are the remains of an Iron Age hillfort with still visible earthworks and a flattened enclosure.
References
External links
Selce on Geopedia
Populated places in the Municipality of Litija |
Gasht-e Rudkhan (, also Romanized as Gasht-e Rūdkhān and Gasht Rūdkhān; also known as Keshter-Khan) is a village in Gurab Pas Rural District, in the Central District of Fuman County, Gilan Province, Iran. At the 2006 census, its population was 787, in 202 families.
References
Populated places in Fuman County |
The City of Lost Children is an adventure game developed and published by Psygnosis in 1997. It is loosely based on the film of the same name. The game was released for the PlayStation and MS-DOS. The latter is a straight port of the console version. Players take on the role of the film character Miette.
Reception
On GameRankings the PC version holds a score of 60% based on three reviews, while the PlayStation version holds a score of 54.50% based on four reviews.
The game received mediocre reviews. Reviewers generally remarked that the graphics are stunningly beautiful and atmospheric, but criticized the excessive difficulty of finding objects and the slow pace. A Next Generation critic explained, "To pick up an item, you must stand directly on top of it, a problem when most of the important objects aren't out in plain sight. You'll find yourself looking in every nook and cranny just to make sure you didn't miss something. Even then, the vast majority of items are found almost by accident ..." Josh Smith of GameSpot further remarked, "The game's puzzles are arbitrary and not particularly intuitive. Trade the marbles for a sleeping potion? Go figure. Put a bone in a cash register to short out the security system on a safe? Come on. The lack of deduction required by the game encourages the kind of random gameplay that can only be described as frustrating. Solutions to puzzles rarely yield a sense of accomplishment since more often than not they are solved through happenstance, not reasoning."
Shawn Smith and Sushi-X of Electronic Gaming Monthly had a somewhat more positive reaction; though they noted the same key flaws as other critics, they focused more on how well the game recreated the world of the film, with Smith commenting, "The cinemas are done well, and the rendered city gives the impression of really being in [a] dirty, semi-futuristic alternate reality." However, their co-reviewers Dan Hsu and Crispin Boyer called it "A unique game that masochists should check out" and "heavy on atmosphere but lean on fun", respectively. GamePros The Rookie concluded, "If you're determined to play, take an evening to rent both the movie and the game to see which goes first, your eyesight or your sanity."
Notes
References
External links
The City of Lost Children at GameFAQs
The City of Lost Children at Giant Bomb
1997 video games
Adventure games
Child abduction in fiction
Child abuse in fiction
Dark fantasy video games
DOS games
DOS games ported to Windows
Dystopian video games
Mystery adventure games
PlayStation (console) games
Psygnosis games
Science fantasy video games
Single-player video games
Steampunk video games
Video games about dreams
Video games based on films
Video games developed in France
Video games featuring female protagonists
Video games with pre-rendered 3D graphics
Windows games
Works about orphans |
The Lockheed Martin CATBird is a highly modified Boeing 737-330 designed as an avionics flight testbed aircraft. The name is an adaptive acronym, from Cooperative Avionics Test Bed; CATBIRD is Lockheed's ICAO-designated company callsign. The aircraft was modified in order to provide an economic means of developing and flight testing the avionics suite for the Lockheed Martin F-35 Lightning II. CATBird has a distinctive appearance, with an F-35's nose and a pair of small canards located just aft of the forward entrance doors. Inside, the aircraft is equipped with racks to hold all of F-35's avionics, as well as an F-35 cockpit.
The aircraft was modified under contract by BAE Systems Inc. at their facility at the Mojave Spaceport. Work began in December, 2003, and the aircraft began post-modification taxi tests in November 2006. First flight took place on January 23, 2007 at Mojave. After the initial flight test program conducted at Mojave, on March 2, 2007, the aircraft was ferried to Lockheed's Fort Worth facility for Phase 2 of the modification program, which would install the flight test stations and actual avionics and sensor systems to be tested.
In 2014 the CATBird's software test station was upgraded by Northrop Grumman with Tech Refresh 2 hardware which gives the CATBird capability to test F-35 Block 3 Software.
See also
References
Mojave Air and Space Port
Individual aircraft |
```objective-c
/**
*
*/
#pragma once
#include <stdint.h>
#ifdef __cplusplus
extern "C" {
#endif
/** Group: Configuration register */
/** Type of clk_cfg register
* PWM clock prescaler register.
*/
typedef union {
struct {
/** clk_prescale : R/W; bitpos: [7:0]; default: 0;
* Configures the prescaler value of clock, so that the period of PWM_clk = 6.25ns *
* (PWM_CLK_PRESCALE + 1).
*/
uint32_t clk_prescale:8;
uint32_t reserved_8:24;
};
uint32_t val;
} mcpwm_clk_cfg_reg_t;
/** Type of timern_cfg0 register
* PWM timern period and update method configuration register.
*/
typedef union {
struct {
/** timern_prescale : R/W; bitpos: [7:0]; default: 0;
* Configures the prescaler value of timern, so that the period of PT0_clk = Period of
* PWM_clk * (PWM_TIMERn_PRESCALE + 1)
*/
uint32_t timern_prescale:8;
/** timern_period : R/W; bitpos: [23:8]; default: 255;
* Configures the period shadow of PWM timern
*/
uint32_t timern_period:16;
/** timern_period_upmethod : R/W; bitpos: [25:24]; default: 0;
* Configures the update method for active register of PWM timern period.\\0:
* Immediate\\1: TEZ\\2: Sync\\3: TEZ or sync\\TEZ here and below means timer equal
* zero event
*/
uint32_t timern_period_upmethod:2;
uint32_t reserved_26:6;
};
uint32_t val;
} mcpwm_timern_cfg0_reg_t;
/** Type of timern_cfg1 register
* PWM timern working mode and start/stop control register.
*/
typedef union {
struct {
/** timern_start : R/W/SC; bitpos: [2:0]; default: 0;
* Configures whether or not to start/stop PWM timern.\\0: If PWM timern starts, then
* stops at TEZ\\1: If timern starts, then stops at TEP\\2: PWM timern starts and runs
* on\\3: Timern starts and stops at the next TEZ\\4: Timer0 starts and stops at the
* next TEP.\\TEP here and below means the event that happens when the timer equals to
* period
*/
uint32_t timern_start:3;
/** timern_mod : R/W; bitpos: [4:3]; default: 0;
* Configures the working mode of PWM timern.\\0: Freeze\\1: Increase mode\\2:
* Decrease mode\\3: Up-down mode
*/
uint32_t timern_mod:2;
uint32_t reserved_5:27;
};
uint32_t val;
} mcpwm_timern_cfg1_reg_t;
/** Type of timern_sync register
* PWM timern sync function configuration register.
*/
typedef union {
struct {
/** timern_synci_en : R/W; bitpos: [0]; default: 0;
* Configures whether or not to enable timern reloading with phase on sync input event
* is enabled.\\0: Disable\\1: Enable
*/
uint32_t timern_synci_en:1;
/** timern_sync_sw : R/W; bitpos: [1]; default: 0;
* Configures the generation of software sync. Toggling this bit will trigger a
* software sync.
*/
uint32_t timern_sync_sw:1;
/** timern_synco_sel : R/W; bitpos: [3:2]; default: 0;
* Configures the selection of PWM timern sync_out.\\0: Sync_in\\1: TEZ\\2: TEP\\3:
* Invalid, sync_out selects noting
*/
uint32_t timern_synco_sel:2;
/** timern_phase : R/W; bitpos: [19:4]; default: 0;
* Configures the phase for timern reload on sync event.
*/
uint32_t timern_phase:16;
/** timern_phase_direction : R/W; bitpos: [20]; default: 0;
* Configures the PWM timern's direction when timern mode is up-down mode.\\0:
* Increase\\1: Decrease
*/
uint32_t timern_phase_direction:1;
uint32_t reserved_21:11;
};
uint32_t val;
} mcpwm_timern_sync_reg_t;
/** Type of timer_synci_cfg register
* Synchronization input selection register for PWM timers.
*/
typedef union {
struct {
/** timer0_syncisel : R/W; bitpos: [2:0]; default: 0;
* Configures the selection of sync input for PWM timer0.\\1: PWM timer0 sync_out\\2:
* PWM timer1 sync_out\\3: PWM timer2 sync_out\\4: SYNC0 from GPIO matrix\\5: SYNC1
* from GPIO matrix\\6: SYNC2 from GPIO matrix\\Other values: No sync input selected
*/
uint32_t timer0_syncisel:3;
/** timer1_syncisel : R/W; bitpos: [5:3]; default: 0;
* Configures the selection of sync input for PWM timer1.\\1: PWM timer0 sync_out\\2:
* PWM timer1 sync_out\\3: PWM timer2 sync_out\\4: SYNC0 from GPIO matrix\\5: SYNC1
* from GPIO matrix\\6: SYNC2 from GPIO matrix\\Other values: No sync input selected
*/
uint32_t timer1_syncisel:3;
/** timer2_syncisel : R/W; bitpos: [8:6]; default: 0;
* Configures the selection of sync input for PWM timer2.\\1: PWM timer0 sync_out\\2:
* PWM timer1 sync_out\\3: PWM timer2 sync_out\\4: SYNC0 from GPIO matrix\\5: SYNC1
* from GPIO matrix\\6: SYNC2 from GPIO matrix\\Other values: No sync input selected
*/
uint32_t timer2_syncisel:3;
/** external_synci0_invert : R/W; bitpos: [9]; default: 0;
* Configures whether or not to invert SYNC0 from GPIO matrix.\\0: Not invert\\1:
* Invert
*/
uint32_t external_synci0_invert:1;
/** external_synci1_invert : R/W; bitpos: [10]; default: 0;
* Configures whether or not to invert SYNC1 from GPIO matrix.\\0: Not invert\\1:
* Invert
*/
uint32_t external_synci1_invert:1;
/** external_synci2_invert : R/W; bitpos: [11]; default: 0;
* Configures whether or not to invert SYNC2 from GPIO matrix.\\0: Not invert\\1:
* Invert
*/
uint32_t external_synci2_invert:1;
uint32_t reserved_12:20;
};
uint32_t val;
} mcpwm_timer_synci_cfg_reg_t;
/** Type of operator_timersel register
* PWM operator's timer select register
*/
typedef union {
struct {
/** operator0_timersel : R/W; bitpos: [1:0]; default: 0;
* Configures which PWM timer will be the timing reference for PWM operator0.\\0:
* Timer0\\1: Timer1\\2: Timer2\\3: Invalid, will select timer2
*/
uint32_t operator0_timersel:2;
/** operator1_timersel : R/W; bitpos: [3:2]; default: 0;
* Configures which PWM timer will be the timing reference for PWM operator1.\\0:
* Timer0\\1: Timer1\\2: Timer2\\3: Invalid, will select timer2
*/
uint32_t operator1_timersel:2;
/** operator2_timersel : R/W; bitpos: [5:4]; default: 0;
* Configures which PWM timer will be the timing reference for PWM operator2.\\0:
* Timer0\\1: Timer1\\2: Timer2\\3: Invalid, will select timer2
*/
uint32_t operator2_timersel:2;
uint32_t reserved_6:26;
};
uint32_t val;
} mcpwm_operator_timersel_reg_t;
/** Type of genn_stmp_cfg register
* Generatorn time stamp registers A and B transfer status and update method register
*/
typedef union {
struct {
/** cmprn_a_upmethod : R/W; bitpos: [3:0]; default: 0;
* Configures the update method for PWM generator n time stamp A's active
* register.\\0: Immediately\\Bit0 is set to 1: TEZ\\Bit1 is set to 1: TEP\\Bit2 is
* set to 1: Sync\\Bit3 is set to 1: Disable the update
*/
uint32_t cmprn_a_upmethod:4;
/** cmprn_b_upmethod : R/W; bitpos: [7:4]; default: 0;
* Configures the update method for PWM generator n time stamp B's active
* register.\\0: Immediately\\Bit0 is set to 1: TEZ\\Bit1 is set to 1: TEP\\Bit2 is
* set to 1: Sync\\Bit3 is set to 1: Disable the update
*/
uint32_t cmprn_b_upmethod:4;
/** cmprn_a_shdw_full : R/W/WTC/SC; bitpos: [8]; default: 0;
* Represents whether or not generatorn time stamp A's shadow reg is transferred.\\0:
* A's active reg has been updated with shadow register latest value.\\1: A's shadow
* reg is filled and waiting to be transferred to A's active reg
*/
uint32_t cmprn_a_shdw_full:1;
/** cmprn_b_shdw_full : R/W/WTC/SC; bitpos: [9]; default: 0;
* Represents whether or not generatorn time stamp B's shadow reg is transferred.\\0:
* B's active reg has been updated with shadow register latest value.\\1: B's shadow
* reg is filled and waiting to be transferred to B's active reg
*/
uint32_t cmprn_b_shdw_full:1;
uint32_t reserved_10:22;
};
uint32_t val;
} mcpwm_genn_stmp_cfg_reg_t;
/** Type of genn_tstmp register
* Generatorn time stamp shadow register
*/
typedef union {
struct {
/** cmprn : R/W; bitpos: [15:0]; default: 0;
* Configures the value of PWM generator n time stamp shadow register.
*/
uint32_t cmprn:16;
uint32_t reserved_16:16;
};
uint32_t val;
} mcpwm_genn_tstmp_reg_t;
/** Type of genn_cfg0 register
* Generatorn fault event T0 and T1 configuration register
*/
typedef union {
struct {
/** genn_cfg_upmethod : R/W; bitpos: [3:0]; default: 0;
* Configures update method for PWM generator n's active register.\\0:
* Immediately\\Bit0 is set to 1: TEZ\\Bit1 is set to 1: TEP\\Bit2 is set to 1:
* Sync\\Bit3 is set to 1: Disable the update
*/
uint32_t genn_cfg_upmethod:4;
/** genn_t0_sel : R/W; bitpos: [6:4]; default: 0;
* Configures source selection for PWM generator n event_t0, take effect
* immediately.\\0: fault_event0\\1: fault_event1\\2: fault_event2\\3: sync_taken\\4:
* Invalid, Select nothing
*/
uint32_t genn_t0_sel:3;
/** genn_t1_sel : R/W; bitpos: [9:7]; default: 0;
* Configures source selection for PWM generator n event_t1, take effect
* immediately.\\0: fault_event0\\1: fault_event1\\2: fault_event2\\3: sync_taken\\4:
* Invalid, Select nothing
*/
uint32_t genn_t1_sel:3;
uint32_t reserved_10:22;
};
uint32_t val;
} mcpwm_genn_cfg0_reg_t;
/** Type of genn_force register
* Generatorn output signal force mode register.
*/
typedef union {
struct {
/** genn_cntuforce_upmethod : R/W; bitpos: [5:0]; default: 32;
* Configures update method for continuous software force of PWM generatorn.\\0:
* Immediately\\Bit0 is set to 1: TEZ\\Bit1 is set to 1: TEP\\Bit2 is set to 1:
* TEA\\Bit3 is set to 1: TEB\\Bit4 is set to 1: Sync\\Bit5 is set to 1: Disable
* update. TEA/B here and below means an event generated when the timer's value equals
* to that of register A/B.
*/
uint32_t genn_cntuforce_upmethod:6;
/** genn_a_cntuforce_mode : R/W; bitpos: [7:6]; default: 0;
* Configures continuous software force mode for PWMn A.\\0: Disabled\\1: Low\\2:
* High\\3: Disabled
*/
uint32_t genn_a_cntuforce_mode:2;
/** genn_b_cntuforce_mode : R/W; bitpos: [9:8]; default: 0;
* Configures continuous software force mode for PWMn B.\\0: Disabled\\1: Low\\2:
* High\\3: Disabled
*/
uint32_t genn_b_cntuforce_mode:2;
/** genn_a_nciforce : R/W; bitpos: [10]; default: 0;
* Configures the generation of non-continuous immediate software-force event for PWMn
* A, a toggle will trigger a force event.
*/
uint32_t genn_a_nciforce:1;
/** genn_a_nciforce_mode : R/W; bitpos: [12:11]; default: 0;
* Configures non-continuous immediate software force mode for PWMn A.\\0:
* Disabled\\1: Low\\2: High\\3: Disabled
*/
uint32_t genn_a_nciforce_mode:2;
/** genn_b_nciforce : R/W; bitpos: [13]; default: 0;
* Configures the generation of non-continuous immediate software-force event for PWMn
* B, a toggle will trigger a force event.
*/
uint32_t genn_b_nciforce:1;
/** genn_b_nciforce_mode : R/W; bitpos: [15:14]; default: 0;
* Configures non-continuous immediate software force mode for PWMn B.\\0:
* Disabled\\1: Low\\2: High\\3: Disabled
*/
uint32_t genn_b_nciforce_mode:2;
uint32_t reserved_16:16;
};
uint32_t val;
} mcpwm_genn_force_reg_t;
/** Type of genn register
* PWMn output signal A actions configuration register
*/
typedef union {
struct {
/** genn_utez : R/W; bitpos: [1:0]; default: 0;
* Configures action on PWMn A triggered by event TEZ when timer increasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_utez:2;
/** genn_utep : R/W; bitpos: [3:2]; default: 0;
* Configures action on PWMn A triggered by event TEP when timer increasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_utep:2;
/** genn_utea : R/W; bitpos: [5:4]; default: 0;
* Configures action on PWMn A triggered by event TEA when timer increasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_utea:2;
/** genn_uteb : R/W; bitpos: [7:6]; default: 0;
* Configures action on PWMn A triggered by event TEB when timer increasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_uteb:2;
/** genn_ut0 : R/W; bitpos: [9:8]; default: 0;
* Configures action on PWMn A triggered by event_t0 when timer increasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_ut0:2;
/** genn_ut1 : R/W; bitpos: [11:10]; default: 0;
* Configures action on PWMn A triggered by event_t1 when timer increasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_ut1:2;
/** genn_dtez : R/W; bitpos: [13:12]; default: 0;
* Configures action on PWMn A triggered by event TEZ when timer decreasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_dtez:2;
/** genn_dtep : R/W; bitpos: [15:14]; default: 0;
* Configures action on PWMn A triggered by event TEP when timer decreasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_dtep:2;
/** genn_dtea : R/W; bitpos: [17:16]; default: 0;
* Configures action on PWMn A triggered by event TEA when timer decreasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_dtea:2;
/** genn_dteb : R/W; bitpos: [19:18]; default: 0;
* Configures action on PWMn A triggered by event TEB when timer decreasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_dteb:2;
/** genn_dt0 : R/W; bitpos: [21:20]; default: 0;
* Configures action on PWMn A triggered by event_t0 when timer decreasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_dt0:2;
/** genn_dt1 : R/W; bitpos: [23:22]; default: 0;
* Configures action on PWMn A triggered by event_t1 when timer decreasing.\\0: No
* change\\1: Low\\2: High\\3: Toggle
*/
uint32_t genn_dt1:2;
uint32_t reserved_24:8;
};
uint32_t val;
} mcpwm_genn_reg_t;
/** Type of dtn_cfg register
* Dead time configuration register
*/
typedef union {
struct {
/** dbn_fed_upmethod : R/W; bitpos: [3:0]; default: 0;
* Configures update method for FED (Falling edge delay) active register.\\0:
* Immediate\\Bit0 is set to 1: TEZ\\Bit1 is set to 1: TEP\\Bit2 is set to 1:
* Sync\\Bit3 is set to 1: Disable the update
*/
uint32_t dbn_fed_upmethod:4;
/** dbn_red_upmethod : R/W; bitpos: [7:4]; default: 0;
* Configures update method for RED (rising edge delay) active register.\\0:
* Immediate\\Bit0 is set to 1: TEZ\\Bit1 is set to 1: TEP\\Bit2 is set to 1:
* Sync\\Bit3 is set to 1: Disable the update
*/
uint32_t dbn_red_upmethod:4;
/** dbn_deb_mode : R/W; bitpos: [8]; default: 0;
* Configures S8 in table, dual-edge B mode.\\0: fed/red take effect on different path
* separately\\1: fed/red take effect on B path, A out is in bypass or dulpB mode
*/
uint32_t dbn_deb_mode:1;
/** dbn_a_outswap : R/W; bitpos: [9]; default: 0;
* Configures S6 in table.
*/
uint32_t dbn_a_outswap:1;
/** dbn_b_outswap : R/W; bitpos: [10]; default: 0;
* Configures S7 in table.
*/
uint32_t dbn_b_outswap:1;
/** dbn_red_insel : R/W; bitpos: [11]; default: 0;
* Configures S4 in table.
*/
uint32_t dbn_red_insel:1;
/** dbn_fed_insel : R/W; bitpos: [12]; default: 0;
* Configures S5 in table.
*/
uint32_t dbn_fed_insel:1;
/** dbn_red_outinvert : R/W; bitpos: [13]; default: 0;
* Configures S2 in table.
*/
uint32_t dbn_red_outinvert:1;
/** dbn_fed_outinvert : R/W; bitpos: [14]; default: 0;
* Configures S3 in table.
*/
uint32_t dbn_fed_outinvert:1;
/** dbn_a_outbypass : R/W; bitpos: [15]; default: 1;
* Configures S1 in table.
*/
uint32_t dbn_a_outbypass:1;
/** dbn_b_outbypass : R/W; bitpos: [16]; default: 1;
* Configures S0 in table.
*/
uint32_t dbn_b_outbypass:1;
/** dbn_clk_sel : R/W; bitpos: [17]; default: 0;
* Configures dead time generator n clock selection.\\0: PWM_clk\\1: PT_clk
*/
uint32_t dbn_clk_sel:1;
uint32_t reserved_18:14;
};
uint32_t val;
} mcpwm_dtn_cfg_reg_t;
/** Type of dtn_fed_cfg register
* Falling edge delay (FED) shadow register
*/
typedef union {
struct {
/** dbn_fed : R/W; bitpos: [15:0]; default: 0;
* Configures shadow register for FED.
*/
uint32_t dbn_fed:16;
uint32_t reserved_16:16;
};
uint32_t val;
} mcpwm_dtn_fed_cfg_reg_t;
/** Type of dtn_red_cfg register
* Rising edge delay (RED) shadow register
*/
typedef union {
struct {
/** dbn_red : R/W; bitpos: [15:0]; default: 0;
* Configures shadow register for RED.
*/
uint32_t dbn_red:16;
uint32_t reserved_16:16;
};
uint32_t val;
} mcpwm_dtn_red_cfg_reg_t;
/** Type of carriern_cfg register
* Carriern configuration register
*/
typedef union {
struct {
/** choppern_en : R/W; bitpos: [0]; default: 0;
* Configures whether or not to enable carriern.\\0: Bypassed\\1: Enabled
*/
uint32_t choppern_en:1;
/** choppern_prescale : R/W; bitpos: [4:1]; default: 0;
* Configures the prescale value of PWM carriern clock (PC_clk), so that period of
* PC_clk = period of PWM_clk * (PWM_CARRIERn_PRESCALE + 1)
*/
uint32_t choppern_prescale:4;
/** choppern_duty : R/W; bitpos: [7:5]; default: 0;
* Configures carrier duty. Duty = PWM_CARRIERn_DUTY / 8
*/
uint32_t choppern_duty:3;
/** choppern_oshtwth : R/W; bitpos: [11:8]; default: 0;
* Configures width of the first pulse. Measurement unit: Periods of the carrier.
*/
uint32_t choppern_oshtwth:4;
/** choppern_out_invert : R/W; bitpos: [12]; default: 0;
* Configures whether or not to invert the output of PWMn A and PWMn B for this
* submodule.\\0: Normal\\1: Invert
*/
uint32_t choppern_out_invert:1;
/** choppern_in_invert : R/W; bitpos: [13]; default: 0;
* Configures whether or not to invert the input of PWMn A and PWMn B for this
* submodule.\\0: Normal\\1: Invert
*/
uint32_t choppern_in_invert:1;
uint32_t reserved_14:18;
};
uint32_t val;
} mcpwm_carriern_cfg_reg_t;
/** Type of fhn_cfg0 register
* PWMn A and PWMn B trip events actions configuration register
*/
typedef union {
struct {
/** tzn_sw_cbc : R/W; bitpos: [0]; default: 0;
* Configures whether or not to enable software force cycle-by-cycle mode action.\\0:
* Disable\\1: Enable
*/
uint32_t tzn_sw_cbc:1;
/** tzn_f2_cbc : R/W; bitpos: [1]; default: 0;
* Configures whether or not event_f2 will trigger cycle-by-cycle mode action.\\0:
* Disable\\1: Enable
*/
uint32_t tzn_f2_cbc:1;
/** tzn_f1_cbc : R/W; bitpos: [2]; default: 0;
* Configures whether or not event_f1 will trigger cycle-by-cycle mode action.\\0:
* Disable\\1: Enable
*/
uint32_t tzn_f1_cbc:1;
/** tzn_f0_cbc : R/W; bitpos: [3]; default: 0;
* Configures whether or not event_f0 will trigger cycle-by-cycle mode action.\\0:
* Disable\\1: Enable
*/
uint32_t tzn_f0_cbc:1;
/** tzn_sw_ost : R/W; bitpos: [4]; default: 0;
* Configures whether or not to enable software force one-shot mode action.\\0:
* Disable\\1: Enable
*/
uint32_t tzn_sw_ost:1;
/** tzn_f2_ost : R/W; bitpos: [5]; default: 0;
* Configures whether or not event_f2 will trigger one-shot mode action.\\0:
* Disable\\1: Enable
*/
uint32_t tzn_f2_ost:1;
/** tzn_f1_ost : R/W; bitpos: [6]; default: 0;
* Configures whether or not event_f1 will trigger one-shot mode action.\\0:
* Disable\\1: Enable
*/
uint32_t tzn_f1_ost:1;
/** tzn_f0_ost : R/W; bitpos: [7]; default: 0;
* Configures whether or not event_f0 will trigger one-shot mode action.\\0:
* Disable\\1: Enable
*/
uint32_t tzn_f0_ost:1;
/** tzn_a_cbc_d : R/W; bitpos: [9:8]; default: 0;
* Configures cycle-by-cycle mode action on PWMn A when fault event occurs and timer
* is decreasing.\\0: Do nothing\\1: Force low\\2: Force high\\3: Toggle
*/
uint32_t tzn_a_cbc_d:2;
/** tzn_a_cbc_u : R/W; bitpos: [11:10]; default: 0;
* Configures cycle-by-cycle mode action on PWMn A when fault event occurs and timer
* is increasing.\\0: Do nothing\\1: Force low\\2: Force high\\3: Toggle
*/
uint32_t tzn_a_cbc_u:2;
/** tzn_a_ost_d : R/W; bitpos: [13:12]; default: 0;
* Configures one-shot mode action on PWMn A when fault event occurs and timer is
* decreasing.\\0: Do nothing\\1: Force low\\2: Force high\\3: Toggle
*/
uint32_t tzn_a_ost_d:2;
/** tzn_a_ost_u : R/W; bitpos: [15:14]; default: 0;
* Configures one-shot mode action on PWMn A when fault event occurs and timer is
* increasing.\\0: Do nothing\\1: Force low\\2: Force high\\3: Toggle
*/
uint32_t tzn_a_ost_u:2;
/** tzn_b_cbc_d : R/W; bitpos: [17:16]; default: 0;
* Configures cycle-by-cycle mode action on PWMn B when fault event occurs and timer
* is decreasing.\\0: Do nothing\\1: Force low\\2: Force high\\3: Toggle
*/
uint32_t tzn_b_cbc_d:2;
/** tzn_b_cbc_u : R/W; bitpos: [19:18]; default: 0;
* Configures cycle-by-cycle mode action on PWMn B when fault event occurs and timer
* is increasing.\\0: Do nothing\\1: Force low\\2: Force high\\3: Toggle
*/
uint32_t tzn_b_cbc_u:2;
/** tzn_b_ost_d : R/W; bitpos: [21:20]; default: 0;
* Configures one-shot mode action on PWMn B when fault event occurs and timer is
* decreasing.\\0: Do nothing\\1: Force low\\2: Force high\\3: Toggle
*/
uint32_t tzn_b_ost_d:2;
/** tzn_b_ost_u : R/W; bitpos: [23:22]; default: 0;
* Configures one-shot mode action on PWMn B when fault event occurs and timer is
* increasing.\\0: Do nothing\\1: Force low\\2: Force high\\3: Toggle
*/
uint32_t tzn_b_ost_u:2;
uint32_t reserved_24:8;
};
uint32_t val;
} mcpwm_fhn_cfg0_reg_t;
/** Type of fhn_cfg1 register
* Software triggers for fault handler actions configuration register
*/
typedef union {
struct {
/** tzn_clr_ost : R/W; bitpos: [0]; default: 0;
* Configures the generation of software one-shot mode action clear. A toggle
* (software negate its value) triggers a clear for on going one-shot mode action.
*/
uint32_t tzn_clr_ost:1;
/** tzn_cbcpulse : R/W; bitpos: [2:1]; default: 0;
* Configures the refresh moment selection of cycle-by-cycle mode action.\\0: Select
* nothing, will not refresh\\Bit0 is set to 1: TEZ\\Bit1 is set to 1: TEP
*/
uint32_t tzn_cbcpulse:2;
/** tzn_force_cbc : R/W; bitpos: [3]; default: 0;
* Configures the generation of software cycle-by-cycle mode action. A toggle
* (software negate its value) triggers a cycle-by-cycle mode action.
*/
uint32_t tzn_force_cbc:1;
/** tzn_force_ost : R/W; bitpos: [4]; default: 0;
* Configures the generation of software one-shot mode action. A toggle (software
* negate its value) triggers a one-shot mode action.
*/
uint32_t tzn_force_ost:1;
uint32_t reserved_5:27;
};
uint32_t val;
} mcpwm_fhn_cfg1_reg_t;
/** Type of fault_detect register
* Fault detection configuration and status register
*/
typedef union {
struct {
/** f0_en : R/W; bitpos: [0]; default: 0;
* Configures whether or not to enable event_f0 generation.\\0: Disable\\1: Enable
*/
uint32_t f0_en:1;
/** f1_en : R/W; bitpos: [1]; default: 0;
* Configures whether or not to enable event_f1 generation.\\0: Disable\\1: Enable
*/
uint32_t f1_en:1;
/** f2_en : R/W; bitpos: [2]; default: 0;
* Configures whether or not to enable event_f2 generation.\\0: Disable\\1: Enable
*/
uint32_t f2_en:1;
/** f0_pole : R/W; bitpos: [3]; default: 0;
* Configures event_f0 trigger polarity on FAULT0 source from GPIO matrix.\\0: Level
* low\\1: Level high
*/
uint32_t f0_pole:1;
/** f1_pole : R/W; bitpos: [4]; default: 0;
* Configures event_f1 trigger polarity on FAULT1 source from GPIO matrix.\\0: Level
* low\\1: Level high
*/
uint32_t f1_pole:1;
/** f2_pole : R/W; bitpos: [5]; default: 0;
* Configures event_f2 trigger polarity on FAULT2 source from GPIO matrix.\\0: Level
* low\\1: Level high
*/
uint32_t f2_pole:1;
/** event_f0 : RO; bitpos: [6]; default: 0;
* Represents whether or not an event_f0 is on going.\\0: No action\\1: On going
*/
uint32_t event_f0:1;
/** event_f1 : RO; bitpos: [7]; default: 0;
* Represents whether or not an event_f1 is on going.\\0: No action\\1: On going
*/
uint32_t event_f1:1;
/** event_f2 : RO; bitpos: [8]; default: 0;
* Represents whether or not an event_f2 is on going.\\0: No action\\1: On going
*/
uint32_t event_f2:1;
uint32_t reserved_9:23;
};
uint32_t val;
} mcpwm_fault_detect_reg_t;
/** Type of cap_timer_cfg register
* Capture timer configuration register
*/
typedef union {
struct {
/** cap_timer_en : R/W; bitpos: [0]; default: 0;
* Configures whether or not to enable capture timer increment.\\0: Disable\\1: Enable
*/
uint32_t cap_timer_en:1;
/** cap_synci_en : R/W; bitpos: [1]; default: 0;
* Configures whether or not to enable capture timer sync.\\0: Disable\\1: Enable
*/
uint32_t cap_synci_en:1;
/** cap_synci_sel : R/W; bitpos: [4:2]; default: 0;
* Configures the selection of capture module sync input.\\0: None\\1: Timer0
* sync_out\\2: Timer1 sync_out\\3: Timer2 sync_out\\4: SYNC0 from GPIO matrix\\5:
* SYNC1 from GPIO matrix\\6: SYNC2 from GPIO matrix\\7: None
*/
uint32_t cap_synci_sel:3;
/** cap_sync_sw : WT; bitpos: [5]; default: 0;
* Configures the generation of a capture timer sync when reg_cap_synci_en is 1.\\0:
* Invalid, No effect\\1: Trigger a capture timer sync, capture timer is loaded with
* value in phase register
*/
uint32_t cap_sync_sw:1;
uint32_t reserved_6:26;
};
uint32_t val;
} mcpwm_cap_timer_cfg_reg_t;
/** Type of cap_timer_phase register
* Capture timer sync phase register
*/
typedef union {
struct {
/** cap_phase : R/W; bitpos: [31:0]; default: 0;
* Configures phase value for capture timer sync operation.
*/
uint32_t cap_phase:32;
};
uint32_t val;
} mcpwm_cap_timer_phase_reg_t;
/** Type of cap_chn_cfg register
* Capture channel n configuration register
*/
typedef union {
struct {
/** capn_en : R/W; bitpos: [0]; default: 0;
* Configures whether or not to enable capture on channel n.\\0: Disable\\1: Enable
*/
uint32_t capn_en:1;
/** capn_mode : R/W; bitpos: [2:1]; default: 0;
* Configures which edge of capture on channel n after prescaling is used.\\0:
* None\\Bit0 is set to 1: Rnable capture on the negative edge\\Bit1 is set to 1:
* Enable capture on the positive edge
*/
uint32_t capn_mode:2;
/** capn_prescale : R/W; bitpos: [10:3]; default: 0;
* Configures prescale value on positive edge of CAPn. Prescale value =
* PWM_CAPn_PRESCALE + 1
*/
uint32_t capn_prescale:8;
/** capn_in_invert : R/W; bitpos: [11]; default: 0;
* Configures whether or not to invert CAPn from GPIO matrix before prescale.\\0:
* Normal\\1: Invert
*/
uint32_t capn_in_invert:1;
/** capn_sw : WT; bitpos: [12]; default: 0;
* Configures the generation of software capture.\\0: Invalid, No effect\\1: Trigger a
* software forced capture on channel n
*/
uint32_t capn_sw:1;
uint32_t reserved_13:19;
};
uint32_t val;
} mcpwm_cap_chn_cfg_reg_t;
/** Type of update_cfg register
* Generator Update configuration register
*/
typedef union {
struct {
/** global_up_en : R/W; bitpos: [0]; default: 1;
* Configures whether or not to enable global update for all active registers in MCPWM
* module.\\0: Disable\\1: Enable
*/
uint32_t global_up_en:1;
/** global_force_up : R/W; bitpos: [1]; default: 0;
* Configures the generation of global forced update for all active registers in MCPWM
* module. A toggle (software invert its value) will trigger a global forced update.
* Valid only when MCPWM_GLOBAL_UP_EN and MCPWM_OP0/1/2_UP_EN are both set to 1.
*/
uint32_t global_force_up:1;
/** op0_up_en : R/W; bitpos: [2]; default: 1;
* Configures whether or not to enable update of active registers in PWM operator0.
* Valid only when PWM_GLOBAL_UP_EN is set to 1.\\0: Disable\\1: Enable
*/
uint32_t op0_up_en:1;
/** op0_force_up : R/W; bitpos: [3]; default: 0;
* Configures the generation of forced update for active registers in PWM operator0. A
* toggle (software invert its value) will trigger a forced update. Valid only when
* MCPWM_GLOBAL_UP_EN and MCPWM_OP0_UP_EN are both set to 1.
*/
uint32_t op0_force_up:1;
/** op1_up_en : R/W; bitpos: [4]; default: 1;
* Configures whether or not to enable update of active registers in PWM operator1.
* Valid only when PWM_GLOBAL_UP_EN is set to 1.\\0: Disable\\1: Enable
*/
uint32_t op1_up_en:1;
/** op1_force_up : R/W; bitpos: [5]; default: 0;
* Configures the generation of forced update for active registers in PWM operator1. A
* toggle (software invert its value) will trigger a forced update. Valid only when
* MCPWM_GLOBAL_UP_EN and MCPWM_OP1_UP_EN are both set to 1.
*/
uint32_t op1_force_up:1;
/** op2_up_en : R/W; bitpos: [6]; default: 1;
* Configures whether or not to enable update of active registers in PWM operator2.
* Valid only when PWM_GLOBAL_UP_EN is set to 1.\\0: Disable\\1: Enable
*/
uint32_t op2_up_en:1;
/** op2_force_up : R/W; bitpos: [7]; default: 0;
* Configures the generation of forced update for active registers in PWM operator2. A
* toggle (software invert its value) will trigger a forced update. Valid only when
* MCPWM_GLOBAL_UP_EN and MCPWM_OP2_UP_EN are both set to 1.
*/
uint32_t op2_force_up:1;
uint32_t reserved_8:24;
};
uint32_t val;
} mcpwm_update_cfg_reg_t;
/** Type of evt_en register
* Event enable register
*/
typedef union {
struct {
/** evt_timer0_stop_en : R/W; bitpos: [0]; default: 0;
* Configures whether or not to enable timer0 stop event generate.\\0: Disable\\1:
* Enable
*/
uint32_t evt_timer0_stop_en:1;
/** evt_timer1_stop_en : R/W; bitpos: [1]; default: 0;
* Configures whether or not to enable timer1 stop event generate.\\0: Disable\\1:
* Enable
*/
uint32_t evt_timer1_stop_en:1;
/** evt_timer2_stop_en : R/W; bitpos: [2]; default: 0;
* Configures whether or not to enable timer2 stop event generate.\\0: Disable\\1:
* Enable
*/
uint32_t evt_timer2_stop_en:1;
/** evt_timer0_tez_en : R/W; bitpos: [3]; default: 0;
* Configures whether or not to enable timer0 equal zero event generate.\\0:
* Disable\\1: Enable
*/
uint32_t evt_timer0_tez_en:1;
/** evt_timer1_tez_en : R/W; bitpos: [4]; default: 0;
* Configures whether or not to enable timer1 equal zero event generate.\\0:
* Disable\\1: Enable
*/
uint32_t evt_timer1_tez_en:1;
/** evt_timer2_tez_en : R/W; bitpos: [5]; default: 0;
* Configures whether or not to enable timer2 equal zero event generate.\\0:
* Disable\\1: Enable
*/
uint32_t evt_timer2_tez_en:1;
/** evt_timer0_tep_en : R/W; bitpos: [6]; default: 0;
* Configures whether or not to enable timer0 equal period event generate.\\0:
* Disable\\1: Enable
*/
uint32_t evt_timer0_tep_en:1;
/** evt_timer1_tep_en : R/W; bitpos: [7]; default: 0;
* Configures whether or not to enable timer1 equal period event generate.\\0:
* Disable\\1: Enable
*/
uint32_t evt_timer1_tep_en:1;
/** evt_timer2_tep_en : R/W; bitpos: [8]; default: 0;
* Configures whether or not to enable timer2 equal period event generate.\\0:
* Disable\\1: Enable
*/
uint32_t evt_timer2_tep_en:1;
/** evt_op0_tea_en : R/W; bitpos: [9]; default: 0;
* Configures whether or not to enable PWM generator0 timer equal a event
* generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op0_tea_en:1;
/** evt_op1_tea_en : R/W; bitpos: [10]; default: 0;
* Configures whether or not to enable PWM generator1 timer equal a event
* generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op1_tea_en:1;
/** evt_op2_tea_en : R/W; bitpos: [11]; default: 0;
* Configures whether or not to enable PWM generator2 timer equal a event
* generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op2_tea_en:1;
/** evt_op0_teb_en : R/W; bitpos: [12]; default: 0;
* Configures whether or not to enable PWM generator0 timer equal b event
* generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op0_teb_en:1;
/** evt_op1_teb_en : R/W; bitpos: [13]; default: 0;
* Configures whether or not to enable PWM generator1 timer equal b event
* generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op1_teb_en:1;
/** evt_op2_teb_en : R/W; bitpos: [14]; default: 0;
* Configures whether or not to enable PWM generator2 timer equal b event
* generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op2_teb_en:1;
/** evt_f0_en : R/W; bitpos: [15]; default: 0;
* Configures whether or not to enable fault0 event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_f0_en:1;
/** evt_f1_en : R/W; bitpos: [16]; default: 0;
* Configures whether or not to enable fault1 event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_f1_en:1;
/** evt_f2_en : R/W; bitpos: [17]; default: 0;
* Configures whether or not to enable fault2 event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_f2_en:1;
/** evt_f0_clr_en : R/W; bitpos: [18]; default: 0;
* Configures whether or not to enable fault0 clear event generate.\\0: Disable\\1:
* Enable
*/
uint32_t evt_f0_clr_en:1;
/** evt_f1_clr_en : R/W; bitpos: [19]; default: 0;
* Configures whether or not to enable fault1 clear event generate.\\0: Disable\\1:
* Enable
*/
uint32_t evt_f1_clr_en:1;
/** evt_f2_clr_en : R/W; bitpos: [20]; default: 0;
* Configures whether or not to enable fault2 clear event generate.\\0: Disable\\1:
* Enable
*/
uint32_t evt_f2_clr_en:1;
/** evt_tz0_cbc_en : R/W; bitpos: [21]; default: 0;
* Configures whether or not to enable cycle-by-cycle trip0 event generate.\\0:
* Disable\\1: Enable
*/
uint32_t evt_tz0_cbc_en:1;
/** evt_tz1_cbc_en : R/W; bitpos: [22]; default: 0;
* Configures whether or not to enable cycle-by-cycle trip1 event generate.\\0:
* Disable\\1: Enable
*/
uint32_t evt_tz1_cbc_en:1;
/** evt_tz2_cbc_en : R/W; bitpos: [23]; default: 0;
* Configures whether or not to enable cycle-by-cycle trip2 event generate.\\0:
* Disable\\1: Enable
*/
uint32_t evt_tz2_cbc_en:1;
/** evt_tz0_ost_en : R/W; bitpos: [24]; default: 0;
* Configures whether or not to enable one-shot trip0 event generate.\\0: Disable\\1:
* Enable
*/
uint32_t evt_tz0_ost_en:1;
/** evt_tz1_ost_en : R/W; bitpos: [25]; default: 0;
* Configures whether or not to enable one-shot trip1 event generate.\\0: Disable\\1:
* Enable
*/
uint32_t evt_tz1_ost_en:1;
/** evt_tz2_ost_en : R/W; bitpos: [26]; default: 0;
* Configures whether or not to enable one-shot trip2 event generate.\\0: Disable\\1:
* Enable
*/
uint32_t evt_tz2_ost_en:1;
/** evt_cap0_en : R/W; bitpos: [27]; default: 0;
* Configures whether or not to enable capture0 event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_cap0_en:1;
/** evt_cap1_en : R/W; bitpos: [28]; default: 0;
* Configures whether or not to enable capture1 event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_cap1_en:1;
/** evt_cap2_en : R/W; bitpos: [29]; default: 0;
* Configures whether or not to enable capture2 event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_cap2_en:1;
uint32_t reserved_30:2;
};
uint32_t val;
} mcpwm_evt_en_reg_t;
/** Type of task_en register
* Task enable register
*/
typedef union {
struct {
/** task_cmpr0_a_up_en : R/W; bitpos: [0]; default: 0;
* Configures whether or not to enable PWM generator0 timer stamp A's shadow register
* update task receive.\\0: Disable\\1: Enable
*/
uint32_t task_cmpr0_a_up_en:1;
/** task_cmpr1_a_up_en : R/W; bitpos: [1]; default: 0;
* Configures whether or not to enable PWM generator1 timer stamp A's shadow register
* update task receive.\\0: Disable\\1: Enable
*/
uint32_t task_cmpr1_a_up_en:1;
/** task_cmpr2_a_up_en : R/W; bitpos: [2]; default: 0;
* Configures whether or not to enable PWM generator2 timer stamp A's shadow register
* update task receive.\\0: Disable\\1: Enable
*/
uint32_t task_cmpr2_a_up_en:1;
/** task_cmpr0_b_up_en : R/W; bitpos: [3]; default: 0;
* Configures whether or not to enable PWM generator0 timer stamp B's shadow register
* update task receive.\\0: Disable\\1: Enable
*/
uint32_t task_cmpr0_b_up_en:1;
/** task_cmpr1_b_up_en : R/W; bitpos: [4]; default: 0;
* Configures whether or not to enable PWM generator1 timer stamp B's shadow register
* update task receive.\\0: Disable\\1: Enable
*/
uint32_t task_cmpr1_b_up_en:1;
/** task_cmpr2_b_up_en : R/W; bitpos: [5]; default: 0;
* Configures whether or not to enable PWM generator2 timer stamp B's shadow register
* update task receive.\\0: Disable\\1: Enable
*/
uint32_t task_cmpr2_b_up_en:1;
/** task_gen_stop_en : R/W; bitpos: [6]; default: 0;
* Configures whether or not to enable all PWM generate stop task receive.\\0:
* Disable\\1: Enable
*/
uint32_t task_gen_stop_en:1;
/** task_timer0_sync_en : R/W; bitpos: [7]; default: 0;
* Configures whether or not to enable timer0 sync task receive.\\0: Disable\\1: Enable
*/
uint32_t task_timer0_sync_en:1;
/** task_timer1_sync_en : R/W; bitpos: [8]; default: 0;
* Configures whether or not to enable timer1 sync task receive.\\0: Disable\\1: Enable
*/
uint32_t task_timer1_sync_en:1;
/** task_timer2_sync_en : R/W; bitpos: [9]; default: 0;
* Configures whether or not to enable timer2 sync task receive.\\0: Disable\\1: Enable
*/
uint32_t task_timer2_sync_en:1;
/** task_timer0_period_up_en : R/W; bitpos: [10]; default: 0;
* Configures whether or not to enable timer0 period update task receive.\\0:
* Disable\\1: Enable
*/
uint32_t task_timer0_period_up_en:1;
/** task_timer1_period_up_en : R/W; bitpos: [11]; default: 0;
* Configures whether or not to enable timer1 period update task receive.\\0:
* Disable\\1: Enable
*/
uint32_t task_timer1_period_up_en:1;
/** task_timer2_period_up_en : R/W; bitpos: [12]; default: 0;
* Configures whether or not to enable timer2 period update task receive.\\0:
* Disable\\1: Enable
*/
uint32_t task_timer2_period_up_en:1;
/** task_tz0_ost_en : R/W; bitpos: [13]; default: 0;
* Configures whether or not to enable one shot trip0 task receive.\\0: Disable\\1:
* Enable
*/
uint32_t task_tz0_ost_en:1;
/** task_tz1_ost_en : R/W; bitpos: [14]; default: 0;
* Configures whether or not to enable one shot trip1 task receive.\\0: Disable\\1:
* Enable
*/
uint32_t task_tz1_ost_en:1;
/** task_tz2_ost_en : R/W; bitpos: [15]; default: 0;
* Configures whether or not to enable one shot trip2 task receive.\\0: Disable\\1:
* Enable
*/
uint32_t task_tz2_ost_en:1;
/** task_clr0_ost_en : R/W; bitpos: [16]; default: 0;
* Configures whether or not to enable one shot trip0 clear task receive.\\0:
* Disable\\1: Enable
*/
uint32_t task_clr0_ost_en:1;
/** task_clr1_ost_en : R/W; bitpos: [17]; default: 0;
* Configures whether or not to enable one shot trip1 clear task receive.\\0:
* Disable\\1: Enable
*/
uint32_t task_clr1_ost_en:1;
/** task_clr2_ost_en : R/W; bitpos: [18]; default: 0;
* Configures whether or not to enable one shot trip2 clear task receive.\\0:
* Disable\\1: Enable
*/
uint32_t task_clr2_ost_en:1;
/** task_cap0_en : R/W; bitpos: [19]; default: 0;
* Configures whether or not to enable capture0 task receive.\\0: Disable\\1: Enable
*/
uint32_t task_cap0_en:1;
/** task_cap1_en : R/W; bitpos: [20]; default: 0;
* Configures whether or not to enable capture1 task receive.\\0: Disable\\1: Enable
*/
uint32_t task_cap1_en:1;
/** task_cap2_en : R/W; bitpos: [21]; default: 0;
* Configures whether or not to enable capture2 task receive.\\0: Disable\\1: Enable
*/
uint32_t task_cap2_en:1;
uint32_t reserved_22:10;
};
uint32_t val;
} mcpwm_task_en_reg_t;
/** Type of evt_en2 register
* Event enable register2
*/
typedef union {
struct {
/** evt_op0_tee1_en : R/W; bitpos: [0]; default: 0;
* Configures whether or not to enable PWM generator0 timer equal OP0_TSTMP_E1_REG
* event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op0_tee1_en:1;
/** evt_op1_tee1_en : R/W; bitpos: [1]; default: 0;
* Configures whether or not to enable PWM generator1 timer equal OP1_TSTMP_E1_REG
* event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op1_tee1_en:1;
/** evt_op2_tee1_en : R/W; bitpos: [2]; default: 0;
* Configures whether or not to enable PWM generator2 timer equal OP2_TSTMP_E1_REG
* event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op2_tee1_en:1;
/** evt_op0_tee2_en : R/W; bitpos: [3]; default: 0;
* Configures whether or not to enable PWM generator0 timer equal OP0_TSTMP_E2_REG
* event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op0_tee2_en:1;
/** evt_op1_tee2_en : R/W; bitpos: [4]; default: 0;
* Configures whether or not to enable PWM generator1 timer equal OP1_TSTMP_E2_REG
* event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op1_tee2_en:1;
/** evt_op2_tee2_en : R/W; bitpos: [5]; default: 0;
* Configures whether or not to enable PWM generator2 timer equal OP2_TSTMP_E2_REG
* event generate.\\0: Disable\\1: Enable
*/
uint32_t evt_op2_tee2_en:1;
uint32_t reserved_6:26;
};
uint32_t val;
} mcpwm_evt_en2_reg_t;
/** Type of opn_tstmp register
* Generatorn timer stamp value register
*/
typedef union {
struct {
/** opn_tstmp_e : R/W; bitpos: [15:0]; default: 0;
* Configures generatorn timer stamp E1 value register
*/
uint32_t opn_tstmp_e:16;
uint32_t reserved_16:16;
};
uint32_t val;
} mcpwm_opn_tstmp_reg_t;
/** Type of clk register
* Global configuration register
*/
typedef union {
struct {
/** clk_en : R/W; bitpos: [0]; default: 0;
* Configures whether or not to open register clock gate.\\0: Open the clock gate only
* when application writes registers\\1: Force open the clock gate for register
*/
uint32_t clk_en:1;
uint32_t reserved_1:31;
};
uint32_t val;
} mcpwm_clk_reg_t;
/** Group: Status register */
/** Type of timern_status register
* PWM timern status register.
*/
typedef union {
struct {
/** timern_value : RO; bitpos: [15:0]; default: 0;
* Represents current PWM timern counter value.
*/
uint32_t timern_value:16;
/** timern_direction : RO; bitpos: [16]; default: 0;
* Represents current PWM timern counter direction.\\0: Increment\\1: Decrement
*/
uint32_t timern_direction:1;
uint32_t reserved_17:15;
};
uint32_t val;
} mcpwm_timern_status_reg_t;
/** Type of fhn_status register
* Fault events status register
*/
typedef union {
struct {
/** tzn_cbc_on : RO; bitpos: [0]; default: 0;
* Represents whether or not an cycle-by-cycle mode action is on going.\\0:No
* action\\1: On going
*/
uint32_t tzn_cbc_on:1;
/** tzn_ost_on : RO; bitpos: [1]; default: 0;
* Represents whether or not an one-shot mode action is on going.\\0:No action\\1: On
* going
*/
uint32_t tzn_ost_on:1;
uint32_t reserved_2:30;
};
uint32_t val;
} mcpwm_fhn_status_reg_t;
/** Type of cap_chn register
* CAPn capture value register
*/
typedef union {
struct {
/** capn_value : RO; bitpos: [31:0]; default: 0;
* Represents value of last capture on CAPn
*/
uint32_t capn_value:32;
};
uint32_t val;
} mcpwm_cap_chn_reg_t;
/** Type of cap_status register
* Last capture trigger edge information register
*/
typedef union {
struct {
/** cap0_edge : RO; bitpos: [0]; default: 0;
* Represents edge of last capture trigger on channel0.\\0: Posedge\\1: Negedge
*/
uint32_t cap0_edge:1;
/** cap1_edge : RO; bitpos: [1]; default: 0;
* Represents edge of last capture trigger on channel1.\\0: Posedge\\1: Negedge
*/
uint32_t cap1_edge:1;
/** cap2_edge : RO; bitpos: [2]; default: 0;
* Represents edge of last capture trigger on channel2.\\0: Posedge\\1: Negedge
*/
uint32_t cap2_edge:1;
uint32_t reserved_3:29;
};
uint32_t val;
} mcpwm_cap_status_reg_t;
/** Group: Interrupt register */
/** Type of int_ena register
* Interrupt enable register
*/
typedef union {
struct {
/** timer0_stop_int_ena : R/W; bitpos: [0]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered when the timer 0 stops.
*/
uint32_t timer0_stop_int_ena:1;
/** timer1_stop_int_ena : R/W; bitpos: [1]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered when the timer 1 stops.
*/
uint32_t timer1_stop_int_ena:1;
/** timer2_stop_int_ena : R/W; bitpos: [2]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered when the timer 2 stops.
*/
uint32_t timer2_stop_int_ena:1;
/** timer0_tez_int_ena : R/W; bitpos: [3]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM timer 0 TEZ event.
*/
uint32_t timer0_tez_int_ena:1;
/** timer1_tez_int_ena : R/W; bitpos: [4]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM timer 1 TEZ event.
*/
uint32_t timer1_tez_int_ena:1;
/** timer2_tez_int_ena : R/W; bitpos: [5]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM timer 2 TEZ event.
*/
uint32_t timer2_tez_int_ena:1;
/** timer0_tep_int_ena : R/W; bitpos: [6]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM timer 0 TEP event.
*/
uint32_t timer0_tep_int_ena:1;
/** timer1_tep_int_ena : R/W; bitpos: [7]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM timer 1 TEP event.
*/
uint32_t timer1_tep_int_ena:1;
/** timer2_tep_int_ena : R/W; bitpos: [8]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM timer 2 TEP event.
*/
uint32_t timer2_tep_int_ena:1;
/** fault0_int_ena : R/W; bitpos: [9]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered when event_f0 starts.
*/
uint32_t fault0_int_ena:1;
/** fault1_int_ena : R/W; bitpos: [10]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered when event_f1 starts.
*/
uint32_t fault1_int_ena:1;
/** fault2_int_ena : R/W; bitpos: [11]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered when event_f2 starts.
*/
uint32_t fault2_int_ena:1;
/** fault0_clr_int_ena : R/W; bitpos: [12]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered when event_f0 clears.
*/
uint32_t fault0_clr_int_ena:1;
/** fault1_clr_int_ena : R/W; bitpos: [13]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered when event_f1 clears.
*/
uint32_t fault1_clr_int_ena:1;
/** fault2_clr_int_ena : R/W; bitpos: [14]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered when event_f2 clears.
*/
uint32_t fault2_clr_int_ena:1;
/** cmpr0_tea_int_ena : R/W; bitpos: [15]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM operator 0 TEA event.
*/
uint32_t cmpr0_tea_int_ena:1;
/** cmpr1_tea_int_ena : R/W; bitpos: [16]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM operator 1 TEA event.
*/
uint32_t cmpr1_tea_int_ena:1;
/** cmpr2_tea_int_ena : R/W; bitpos: [17]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM operator 2 TEA event.
*/
uint32_t cmpr2_tea_int_ena:1;
/** cmpr0_teb_int_ena : R/W; bitpos: [18]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM operator 0 TEB event.
*/
uint32_t cmpr0_teb_int_ena:1;
/** cmpr1_teb_int_ena : R/W; bitpos: [19]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM operator 1 TEB event.
*/
uint32_t cmpr1_teb_int_ena:1;
/** cmpr2_teb_int_ena : R/W; bitpos: [20]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a PWM operator 2 TEB event.
*/
uint32_t cmpr2_teb_int_ena:1;
/** tz0_cbc_int_ena : R/W; bitpos: [21]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a cycle-by-cycle mode
* action on PWM0.
*/
uint32_t tz0_cbc_int_ena:1;
/** tz1_cbc_int_ena : R/W; bitpos: [22]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a cycle-by-cycle mode
* action on PWM1.
*/
uint32_t tz1_cbc_int_ena:1;
/** tz2_cbc_int_ena : R/W; bitpos: [23]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a cycle-by-cycle mode
* action on PWM2.
*/
uint32_t tz2_cbc_int_ena:1;
/** tz0_ost_int_ena : R/W; bitpos: [24]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a one-shot mode action on
* PWM0.
*/
uint32_t tz0_ost_int_ena:1;
/** tz1_ost_int_ena : R/W; bitpos: [25]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a one-shot mode action on
* PWM1.
*/
uint32_t tz1_ost_int_ena:1;
/** tz2_ost_int_ena : R/W; bitpos: [26]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by a one-shot mode action on
* PWM2.
*/
uint32_t tz2_ost_int_ena:1;
/** cap0_int_ena : R/W; bitpos: [27]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by capture on CAP0.
*/
uint32_t cap0_int_ena:1;
/** cap1_int_ena : R/W; bitpos: [28]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by capture on CAP1.
*/
uint32_t cap1_int_ena:1;
/** cap2_int_ena : R/W; bitpos: [29]; default: 0;
* Enable bit: Write 1 to enable the interrupt triggered by capture on CAP2.
*/
uint32_t cap2_int_ena:1;
uint32_t reserved_30:2;
};
uint32_t val;
} mcpwm_int_ena_reg_t;
/** Type of int_raw register
* Interrupt raw status register
*/
typedef union {
struct {
/** timer0_stop_int_raw : R/WTC/SS; bitpos: [0]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered when the timer
* 0 stops.
*/
uint32_t timer0_stop_int_raw:1;
/** timer1_stop_int_raw : R/WTC/SS; bitpos: [1]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered when the timer
* 1 stops.
*/
uint32_t timer1_stop_int_raw:1;
/** timer2_stop_int_raw : R/WTC/SS; bitpos: [2]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered when the timer
* 2 stops.
*/
uint32_t timer2_stop_int_raw:1;
/** timer0_tez_int_raw : R/WTC/SS; bitpos: [3]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM timer
* 0 TEZ event.
*/
uint32_t timer0_tez_int_raw:1;
/** timer1_tez_int_raw : R/WTC/SS; bitpos: [4]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM timer
* 1 TEZ event.
*/
uint32_t timer1_tez_int_raw:1;
/** timer2_tez_int_raw : R/WTC/SS; bitpos: [5]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM timer
* 2 TEZ event.
*/
uint32_t timer2_tez_int_raw:1;
/** timer0_tep_int_raw : R/WTC/SS; bitpos: [6]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM timer
* 0 TEP event.
*/
uint32_t timer0_tep_int_raw:1;
/** timer1_tep_int_raw : R/WTC/SS; bitpos: [7]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM timer
* 1 TEP event.
*/
uint32_t timer1_tep_int_raw:1;
/** timer2_tep_int_raw : R/WTC/SS; bitpos: [8]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM timer
* 2 TEP event.
*/
uint32_t timer2_tep_int_raw:1;
/** fault0_int_raw : R/WTC/SS; bitpos: [9]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered when event_f0
* starts.
*/
uint32_t fault0_int_raw:1;
/** fault1_int_raw : R/WTC/SS; bitpos: [10]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered when event_f1
* starts.
*/
uint32_t fault1_int_raw:1;
/** fault2_int_raw : R/WTC/SS; bitpos: [11]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered when event_f2
* starts.
*/
uint32_t fault2_int_raw:1;
/** fault0_clr_int_raw : R/WTC/SS; bitpos: [12]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered when event_f0
* clears.
*/
uint32_t fault0_clr_int_raw:1;
/** fault1_clr_int_raw : R/WTC/SS; bitpos: [13]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered when event_f1
* clears.
*/
uint32_t fault1_clr_int_raw:1;
/** fault2_clr_int_raw : R/WTC/SS; bitpos: [14]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered when event_f2
* clears.
*/
uint32_t fault2_clr_int_raw:1;
/** cmpr0_tea_int_raw : R/WTC/SS; bitpos: [15]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM
* operator 0 TEA event
*/
uint32_t cmpr0_tea_int_raw:1;
/** cmpr1_tea_int_raw : R/WTC/SS; bitpos: [16]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM
* operator 1 TEA event
*/
uint32_t cmpr1_tea_int_raw:1;
/** cmpr2_tea_int_raw : R/WTC/SS; bitpos: [17]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM
* operator 2 TEA event
*/
uint32_t cmpr2_tea_int_raw:1;
/** cmpr0_teb_int_raw : R/WTC/SS; bitpos: [18]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM
* operator 0 TEB event
*/
uint32_t cmpr0_teb_int_raw:1;
/** cmpr1_teb_int_raw : R/WTC/SS; bitpos: [19]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM
* operator 1 TEB event
*/
uint32_t cmpr1_teb_int_raw:1;
/** cmpr2_teb_int_raw : R/WTC/SS; bitpos: [20]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a PWM
* operator 2 TEB event
*/
uint32_t cmpr2_teb_int_raw:1;
/** tz0_cbc_int_raw : R/WTC/SS; bitpos: [21]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a
* cycle-by-cycle mode action on PWM0.
*/
uint32_t tz0_cbc_int_raw:1;
/** tz1_cbc_int_raw : R/WTC/SS; bitpos: [22]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a
* cycle-by-cycle mode action on PWM1.
*/
uint32_t tz1_cbc_int_raw:1;
/** tz2_cbc_int_raw : R/WTC/SS; bitpos: [23]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a
* cycle-by-cycle mode action on PWM2.
*/
uint32_t tz2_cbc_int_raw:1;
/** tz0_ost_int_raw : R/WTC/SS; bitpos: [24]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a one-shot
* mode action on PWM0.
*/
uint32_t tz0_ost_int_raw:1;
/** tz1_ost_int_raw : R/WTC/SS; bitpos: [25]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a one-shot
* mode action on PWM1.
*/
uint32_t tz1_ost_int_raw:1;
/** tz2_ost_int_raw : R/WTC/SS; bitpos: [26]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by a one-shot
* mode action on PWM2.
*/
uint32_t tz2_ost_int_raw:1;
/** cap0_int_raw : R/WTC/SS; bitpos: [27]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by capture on
* CAP0.
*/
uint32_t cap0_int_raw:1;
/** cap1_int_raw : R/WTC/SS; bitpos: [28]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by capture on
* CAP1.
*/
uint32_t cap1_int_raw:1;
/** cap2_int_raw : R/WTC/SS; bitpos: [29]; default: 0;
* Raw status bit: The raw interrupt status of the interrupt triggered by capture on
* CAP2.
*/
uint32_t cap2_int_raw:1;
uint32_t reserved_30:2;
};
uint32_t val;
} mcpwm_int_raw_reg_t;
/** Type of int_st register
* Interrupt masked status register
*/
typedef union {
struct {
/** timer0_stop_int_st : RO; bitpos: [0]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered when the
* timer 0 stops.
*/
uint32_t timer0_stop_int_st:1;
/** timer1_stop_int_st : RO; bitpos: [1]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered when the
* timer 1 stops.
*/
uint32_t timer1_stop_int_st:1;
/** timer2_stop_int_st : RO; bitpos: [2]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered when the
* timer 2 stops.
*/
uint32_t timer2_stop_int_st:1;
/** timer0_tez_int_st : RO; bitpos: [3]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* timer 0 TEZ event.
*/
uint32_t timer0_tez_int_st:1;
/** timer1_tez_int_st : RO; bitpos: [4]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* timer 1 TEZ event.
*/
uint32_t timer1_tez_int_st:1;
/** timer2_tez_int_st : RO; bitpos: [5]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* timer 2 TEZ event.
*/
uint32_t timer2_tez_int_st:1;
/** timer0_tep_int_st : RO; bitpos: [6]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* timer 0 TEP event.
*/
uint32_t timer0_tep_int_st:1;
/** timer1_tep_int_st : RO; bitpos: [7]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* timer 1 TEP event.
*/
uint32_t timer1_tep_int_st:1;
/** timer2_tep_int_st : RO; bitpos: [8]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* timer 2 TEP event.
*/
uint32_t timer2_tep_int_st:1;
/** fault0_int_st : RO; bitpos: [9]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered when
* event_f0 starts.
*/
uint32_t fault0_int_st:1;
/** fault1_int_st : RO; bitpos: [10]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered when
* event_f1 starts.
*/
uint32_t fault1_int_st:1;
/** fault2_int_st : RO; bitpos: [11]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered when
* event_f2 starts.
*/
uint32_t fault2_int_st:1;
/** fault0_clr_int_st : RO; bitpos: [12]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered when
* event_f0 clears.
*/
uint32_t fault0_clr_int_st:1;
/** fault1_clr_int_st : RO; bitpos: [13]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered when
* event_f1 clears.
*/
uint32_t fault1_clr_int_st:1;
/** fault2_clr_int_st : RO; bitpos: [14]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered when
* event_f2 clears.
*/
uint32_t fault2_clr_int_st:1;
/** cmpr0_tea_int_st : RO; bitpos: [15]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* operator 0 TEA event
*/
uint32_t cmpr0_tea_int_st:1;
/** cmpr1_tea_int_st : RO; bitpos: [16]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* operator 1 TEA event
*/
uint32_t cmpr1_tea_int_st:1;
/** cmpr2_tea_int_st : RO; bitpos: [17]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* operator 2 TEA event
*/
uint32_t cmpr2_tea_int_st:1;
/** cmpr0_teb_int_st : RO; bitpos: [18]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* operator 0 TEB event
*/
uint32_t cmpr0_teb_int_st:1;
/** cmpr1_teb_int_st : RO; bitpos: [19]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* operator 1 TEB event
*/
uint32_t cmpr1_teb_int_st:1;
/** cmpr2_teb_int_st : RO; bitpos: [20]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a PWM
* operator 2 TEB event
*/
uint32_t cmpr2_teb_int_st:1;
/** tz0_cbc_int_st : RO; bitpos: [21]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a
* cycle-by-cycle mode action on PWM0.
*/
uint32_t tz0_cbc_int_st:1;
/** tz1_cbc_int_st : RO; bitpos: [22]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a
* cycle-by-cycle mode action on PWM1.
*/
uint32_t tz1_cbc_int_st:1;
/** tz2_cbc_int_st : RO; bitpos: [23]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a
* cycle-by-cycle mode action on PWM2.
*/
uint32_t tz2_cbc_int_st:1;
/** tz0_ost_int_st : RO; bitpos: [24]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a
* one-shot mode action on PWM0.
*/
uint32_t tz0_ost_int_st:1;
/** tz1_ost_int_st : RO; bitpos: [25]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a
* one-shot mode action on PWM1.
*/
uint32_t tz1_ost_int_st:1;
/** tz2_ost_int_st : RO; bitpos: [26]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by a
* one-shot mode action on PWM2.
*/
uint32_t tz2_ost_int_st:1;
/** cap0_int_st : RO; bitpos: [27]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by
* capture on CAP0.
*/
uint32_t cap0_int_st:1;
/** cap1_int_st : RO; bitpos: [28]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by
* capture on CAP1.
*/
uint32_t cap1_int_st:1;
/** cap2_int_st : RO; bitpos: [29]; default: 0;
* Masked status bit: The masked interrupt status of the interrupt triggered by
* capture on CAP2.
*/
uint32_t cap2_int_st:1;
uint32_t reserved_30:2;
};
uint32_t val;
} mcpwm_int_st_reg_t;
/** Type of int_clr register
* Interrupt clear register
*/
typedef union {
struct {
/** timer0_stop_int_clr : WT; bitpos: [0]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered when the timer 0 stops.
*/
uint32_t timer0_stop_int_clr:1;
/** timer1_stop_int_clr : WT; bitpos: [1]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered when the timer 1 stops.
*/
uint32_t timer1_stop_int_clr:1;
/** timer2_stop_int_clr : WT; bitpos: [2]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered when the timer 2 stops.
*/
uint32_t timer2_stop_int_clr:1;
/** timer0_tez_int_clr : WT; bitpos: [3]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM timer 0 TEZ event.
*/
uint32_t timer0_tez_int_clr:1;
/** timer1_tez_int_clr : WT; bitpos: [4]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM timer 1 TEZ event.
*/
uint32_t timer1_tez_int_clr:1;
/** timer2_tez_int_clr : WT; bitpos: [5]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM timer 2 TEZ event.
*/
uint32_t timer2_tez_int_clr:1;
/** timer0_tep_int_clr : WT; bitpos: [6]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM timer 0 TEP event.
*/
uint32_t timer0_tep_int_clr:1;
/** timer1_tep_int_clr : WT; bitpos: [7]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM timer 1 TEP event.
*/
uint32_t timer1_tep_int_clr:1;
/** timer2_tep_int_clr : WT; bitpos: [8]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM timer 2 TEP event.
*/
uint32_t timer2_tep_int_clr:1;
/** fault0_int_clr : WT; bitpos: [9]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered when event_f0 starts.
*/
uint32_t fault0_int_clr:1;
/** fault1_int_clr : WT; bitpos: [10]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered when event_f1 starts.
*/
uint32_t fault1_int_clr:1;
/** fault2_int_clr : WT; bitpos: [11]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered when event_f2 starts.
*/
uint32_t fault2_int_clr:1;
/** fault0_clr_int_clr : WT; bitpos: [12]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered when event_f0 clears.
*/
uint32_t fault0_clr_int_clr:1;
/** fault1_clr_int_clr : WT; bitpos: [13]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered when event_f1 clears.
*/
uint32_t fault1_clr_int_clr:1;
/** fault2_clr_int_clr : WT; bitpos: [14]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered when event_f2 clears.
*/
uint32_t fault2_clr_int_clr:1;
/** cmpr0_tea_int_clr : WT; bitpos: [15]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM operator 0 TEA event
*/
uint32_t cmpr0_tea_int_clr:1;
/** cmpr1_tea_int_clr : WT; bitpos: [16]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM operator 1 TEA event
*/
uint32_t cmpr1_tea_int_clr:1;
/** cmpr2_tea_int_clr : WT; bitpos: [17]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM operator 2 TEA event
*/
uint32_t cmpr2_tea_int_clr:1;
/** cmpr0_teb_int_clr : WT; bitpos: [18]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM operator 0 TEB event
*/
uint32_t cmpr0_teb_int_clr:1;
/** cmpr1_teb_int_clr : WT; bitpos: [19]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM operator 1 TEB event
*/
uint32_t cmpr1_teb_int_clr:1;
/** cmpr2_teb_int_clr : WT; bitpos: [20]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a PWM operator 2 TEB event
*/
uint32_t cmpr2_teb_int_clr:1;
/** tz0_cbc_int_clr : WT; bitpos: [21]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a cycle-by-cycle mode action
* on PWM0.
*/
uint32_t tz0_cbc_int_clr:1;
/** tz1_cbc_int_clr : WT; bitpos: [22]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a cycle-by-cycle mode action
* on PWM1.
*/
uint32_t tz1_cbc_int_clr:1;
/** tz2_cbc_int_clr : WT; bitpos: [23]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a cycle-by-cycle mode action
* on PWM2.
*/
uint32_t tz2_cbc_int_clr:1;
/** tz0_ost_int_clr : WT; bitpos: [24]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a one-shot mode action on
* PWM0.
*/
uint32_t tz0_ost_int_clr:1;
/** tz1_ost_int_clr : WT; bitpos: [25]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a one-shot mode action on
* PWM1.
*/
uint32_t tz1_ost_int_clr:1;
/** tz2_ost_int_clr : WT; bitpos: [26]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by a one-shot mode action on
* PWM2.
*/
uint32_t tz2_ost_int_clr:1;
/** cap0_int_clr : WT; bitpos: [27]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by capture on CAP0.
*/
uint32_t cap0_int_clr:1;
/** cap1_int_clr : WT; bitpos: [28]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by capture on CAP1.
*/
uint32_t cap1_int_clr:1;
/** cap2_int_clr : WT; bitpos: [29]; default: 0;
* Clear bit: Write 1 to clear the interrupt triggered by capture on CAP2.
*/
uint32_t cap2_int_clr:1;
uint32_t reserved_30:2;
};
uint32_t val;
} mcpwm_int_clr_reg_t;
/** Group: Version register */
/** Type of version register
* Version register.
*/
typedef union {
struct {
/** date : R/W; bitpos: [27:0]; default: 35725968;
* Configures the version.
*/
uint32_t date:28;
uint32_t reserved_28:4;
};
uint32_t val;
} mcpwm_version_reg_t;
typedef struct {
volatile mcpwm_timern_cfg0_reg_t timer_cfg0;
volatile mcpwm_timern_cfg1_reg_t timer_cfg1;
volatile mcpwm_timern_sync_reg_t timer_sync;
volatile mcpwm_timern_status_reg_t timer_status;
} mcpwm_timer_regs_t;
typedef struct {
volatile mcpwm_genn_stmp_cfg_reg_t gen_stmp_cfg;
volatile mcpwm_genn_tstmp_reg_t timestamp[2];
volatile mcpwm_genn_cfg0_reg_t gen_cfg0;
volatile mcpwm_genn_force_reg_t gen_force;
volatile mcpwm_genn_reg_t generator[2];
volatile mcpwm_dtn_cfg_reg_t dt_cfg;
volatile mcpwm_dtn_fed_cfg_reg_t dt_fed_cfg;
volatile mcpwm_dtn_red_cfg_reg_t dt_red_cfg;
volatile mcpwm_carriern_cfg_reg_t carrier_cfg;
volatile mcpwm_fhn_cfg0_reg_t fh_cfg0;
volatile mcpwm_fhn_cfg1_reg_t fh_cfg1;
volatile mcpwm_fhn_status_reg_t fh_status;
} mcpwm_operator_reg_t;
typedef struct {
volatile mcpwm_opn_tstmp_reg_t timestamp[2];
} mcpwm_operator_tstmp_reg_t;
typedef struct mcpwm_dev_t {
volatile mcpwm_clk_cfg_reg_t clk_cfg;
volatile mcpwm_timer_regs_t timer[3];
volatile mcpwm_timer_synci_cfg_reg_t timer_synci_cfg;
volatile mcpwm_operator_timersel_reg_t operator_timersel;
volatile mcpwm_operator_reg_t operators[3];
volatile mcpwm_fault_detect_reg_t fault_detect;
volatile mcpwm_cap_timer_cfg_reg_t cap_timer_cfg;
volatile mcpwm_cap_timer_phase_reg_t cap_timer_phase;
volatile mcpwm_cap_chn_cfg_reg_t cap_chn_cfg[3];
volatile mcpwm_cap_chn_reg_t cap_chn[3];
volatile mcpwm_cap_status_reg_t cap_status;
volatile mcpwm_update_cfg_reg_t update_cfg;
volatile mcpwm_int_ena_reg_t int_ena;
volatile mcpwm_int_raw_reg_t int_raw;
volatile mcpwm_int_st_reg_t int_st;
volatile mcpwm_int_clr_reg_t int_clr;
volatile mcpwm_evt_en_reg_t evt_en;
volatile mcpwm_task_en_reg_t task_en;
volatile mcpwm_evt_en2_reg_t evt_en2;
volatile mcpwm_operator_tstmp_reg_t operators_timestamp[3];
volatile mcpwm_clk_reg_t clk;
volatile mcpwm_version_reg_t version;
} mcpwm_dev_t;
extern mcpwm_dev_t MCPWM0;
#ifndef __cplusplus
_Static_assert(sizeof(mcpwm_dev_t) == 0x14c, "Invalid size of mcpwm_dev_t structure");
#endif
#ifdef __cplusplus
}
#endif
``` |
Aplogompha angusta is a Neotropical geometer moth species of the subfamily Ennominae. It is found in Panama.
The wingspan is about 23 mm for males and 21 mm for females. Adults are similar to Aplogompha costimaculata, but the forewings of the males are long and narrow and the hindwings are moderate (not broadly expanded), while the basal two-thirds of both wings below are washed with yellowish. Females are pale brown above, but with the markings of the males on both sides.
References
Moths described in 1914
Ennominae
Moths of Central America |
Abiodun Olugbemiga Obafemi (born 25 December 1973 in Lagos) is a Nigerian former professional footballer. He is a defender who played most of his career in Germany, and was part of Nigeria's Gold Medal winning team at the 1996 Olympics.
References
External links
Living people
1973 births
Yoruba sportspeople
Footballers from Lagos
Men's association football defenders
Nigerian men's footballers
Olympic footballers for Nigeria
Olympic gold medalists for Nigeria
Footballers at the 1996 Summer Olympics
SC Fortuna Köln players
Fortuna Düsseldorf players
SSV Reutlingen 05 players
Toulouse FC players
FC Augsburg players
Bundesliga players
Olympic medalists in football
Medalists at the 1996 Summer Olympics |
```objective-c
/* Sort.h -- Sort functions
2014-04-05 : Igor Pavlov : Public domain */
#ifndef __7Z_SORT_H
#define __7Z_SORT_H
#include "7zTypes.h"
EXTERN_C_BEGIN
void HeapSort(UInt32 *p, size_t size);
void HeapSort64(UInt64 *p, size_t size);
/* void HeapSortRef(UInt32 *p, UInt32 *vals, size_t size); */
EXTERN_C_END
#endif
``` |
Damasias (Δαμασίας) may refer to:
Damasias of Amphipolis, Olympic winner in 320 BC
Damasias, son of Penthilus (son of Orestes)
Damasias, Archon of Athens 639–638 BC and 582–581 BC
See also
Damas (disambiguation) |
Narikot is a town and Village Development Committee in Pyuthan, a Middle Hills district of Lumbini Province, western Nepal.
Villages in this VDC
References
Narikot:
External links
UN map of VDC boundaries, water features and roads in Pyuthan District
Populated places in Pyuthan District |
The Formosa Alliance () is a political coalition founded in Taiwan on 7 April 2018. The organization reformed as a political party on 20 July 2019.
Goals
The Formosa Alliance was established on 7 April 2018. Its founding leader was , at the time also chairman of Formosa Television. Other members included Chen Shui-bian, Huang Kuo-chang, Lee Teng-hui, Yu Shyi-kun, and the Taiwan Solidarity Union, as well as several overseas Taiwanese organizations. The organization intended to hold a referendum on independence on 6 April 2019, though this did not occur. Other goals included advocating a change in the island's name from the Republic of China to Taiwan, and to apply for membership in the United Nations. The alliance's first full meeting was held on 16 June 2018.
In April 2019, the Formosa Alliance announced a split between it and the Democratic Progressive Party, as well as a new color scheme emphasizing turquoise, a representation of the land of Taiwan and the ocean. The alliance rebranded as a political party, and expanded its platform. Alongside support for the independence referendum and admittance to the United Nations, the Formosa Alliance sought to draft a new constitution, introduce a new national anthem, adopt a new flag, and normalize diplomatic relations with other nations. Compared with the Democratic Progressive Party, from which it split, the Formosa Alliance is more socially conservative. On 20 July 2019, the Formosa Alliance was reconstituted as a political party, with Presbyterian Church in Taiwan minister as its first chairman. Lo named as the party's deputy chairman. Party officials stated that it would not nominate a candidate to contest the 2020 Taiwan presidential election, but that it would field ten candidates in the concurrent 2020 Taiwan legislative election.
On 10 September 2019, Formosa Alliance executive committee member Ou Chong-jing stated that he would obtain registration forms for the 2020 presidential election from the Central Election Commission. Ou told Taiwan News that the Formosa Alliance had planned to back his legislative campaign in New Taipei, but subsequently announced that a presidential candidate would be named without a primary. Ou then acquired the petition required of independent presidential candidacies, without the party's support, though he stated that he would wait until the deadline to register presidential bids, 17 September 2019, for the Formosa Alliance's decision. On 17 September 2019, Annette Lu announced that she and Peng Pai-hsien, via petition, would form the Formosa Alliance ticket for the presidential election, though Lu remained a member of the Democratic Progressive Party. Lu and Peng ended their campaign on 2 November 2019.
References
2018 establishments in Taiwan
Taiwan independence movement
Taiwan under Republic of China rule
Secessionist organizations in Asia
Political parties established in 2018
Political organizations based in Taiwan |
```html
<html>
<head>
<title>Tremor - Build</title>
<link rel=stylesheet href="style.css" type="text/css">
</head>
<body bgcolor=white text=black link="#5555ff" alink="#5555ff" vlink="#5555ff">
<table border=0 width=100%>
<tr>
<td><p class=tiny>Tremor documentation</p></td>
<td align=right><p class=tiny>Tremor version 1.0 - 20020403</p></td>
</tr>
</table>
<h1>Tremor: Building libvorbisidec</h1>
<p>
The C source in the Tremor package will build on any ANSI C compiler
and function completely and properly on any platform. The included
build system assumes GNU build system and make tools (m4, automake,
autoconf, libtool and gmake). GCC is not required, although GCC is
the most tested compiler. To build using GNU tools, type in the
source directory:
<p>
<pre><tt>
./autogen.sh
gmake
</tt></pre>
<p>
or if GNU make is the standard make on the build system:
<pre><tt>
./autogen.sh
make
</tt></pre>
<p>
Currently, the source implements playback in pure C on all platforms
except ARM, where a [currently] small amount of assembly (see the file
asm_arm.h) is used to implement 64 bit math operations and
fast LSP computation. If building on ARM without the benefit of GNU
build system tools, be sure that <tt>_ARM_ASSEM_</tt> is #defined by
the build system if this assembly is desired, else the resulting
library will use whatever 64 bit math builtins the compiler
implements.
<p>
No math library is required by this source. No floating point
operations are used at any point in either setup or decode. This
decoder library will properly decode any past, current or future
Vorbis I file or stream.
<p>
The GNU build system produces static and, when supported by the OS,
dynamic libraries named 'libvorbisidec'. This library exposes an API
nearly identical to the BSD reference library's 'libvorbisfile',
including all the features familiar to users of vorbisfile. This API
is similar enough that the proper header file to include is named
'ivorbisfile.h', included in the source build directory.
Lower level libvorbis-style headers and structures are
in 'ivorbiscodec.h', also included in the source build directory. A
simple example program, ivorbisfile_example.c, can be built with 'make
ivorbisfile_example'.
<p>
(We've summarized <a href="diff.html">differences between the free,
reference vorbisfile library and Tremor's libvorbisidec in a separate
document</a>.)
<h3>Notes</h3>
<p>Tremor requires a native 64 bit integer type to compile and
function; The GNU build system will locate and typedef
<tt>ogg_int64_t</tt> to the appropriate native type. If not using the
GNU build tools, you will need to define <tt>ogg_int64_t</tt> as a
64-bit type inside your system's project file/Makefile, etc. On win32,
for example, this should be defined as <tt>__int64</tt>.
<p>
<br><br>
<hr noshade>
<table border=0 width=100%>
<tr valign=top>
<td><p class=tiny>copyright © 2002 Xiph.org</p></td>
<td align=right><p class=tiny><a href="path_to_url">Ogg Vorbis</a></p></td>
</tr><tr>
<td><p class=tiny>Tremor documentation</p></td>
<td align=right><p class=tiny>Tremor version 1.0 - 20020403</p></td>
</tr>
</table>
</body>
</html>
``` |
Only in the Morning is an EP by the American rock band Breather Resist. The album was released on March 25, 2003, through Deathwish Inc.
Track listing
"Just Do It" – 2:40
"The Pity Party" – 3:19
"Died to Be Famous" – 1:20
"The Best Mistake" – 1:38
"Pretty Like Cancer" – 2:14
"Cruciform Casket" – 1:59
"It Stops One" – 2:36
"It Stops Two" – 6:22
References
2003 EPs
Deathwish Inc. EPs |
Royal Bertrand Lord (19 September 189921 October 1963) was a United States Army general who served in World War II.
A graduate of the United States Military Academy at West Point, New York, ranked 4th in the class of 1923, Lord served as an instructor in tactics at West Point, and on construction projects including flood control on the Mississippi River and the Passamaquoddy Bay tidal power project in Maine. From 1936 to 1938 he was the head of the construction division of the Resettlement Administration and then the Farm Security Administration. During World War II he was the chief of staff of the Communications Zone in the European Theater of Operations, United States Army. He retired in 1946.
Early life
Royal Bertrand Lord was born in Worcester, Massachusetts, on 19 September 1899, the son of Edgar Harold Lord and his wife Lena Rita Lupien. He entered Brown University, from which he graduated in 1919 with a Bachelor of Science degree.
He entered the United States Military Academy at West Point, New York, as an appointment from Rhode Island on 13 June 1919, and graduated on 12 June 1923, ranked fourth in his class.
Between the wars
As was usual for high-ranking graduates, Lord was commissioned as a second lieutenant in the Corps of Engineers. He completed his engineer training at the Engineer School at Fort Humphreys, Virginia, and was stationed at Fort William McKinley in the Philippines from 30 May 1924 to 16 April 1926. He built barrios to house families, and erected radio towers to link the islands together.
On 5 June 1926, Lord was posted to San Francisco, California, as Assistant District Engineer of the First District. On 15 August 1926, he entered the University of California, Berkeley, from which he graduated with a degree in civil engineering. It was there that he met Elizabeth Richardson, the daughter of a Berkeley attorney, whom he married. They had a son, Willard Richardson (Dick) Lord.
Lord then became an instructor in tactics at West Point, with the rank of first lieutenant from 15 November 1927. He built new sports fields including a polo field (Howze Field) and an ice hockey arena (Smith Rink). In 1931, he helped Grover Whalen organize the Army–Navy Game, which was held at Yankee Stadium that year for the benefit of the unemployed, at the behest of President Herbert Hoover. Lord collected money from businessmen for the event in Evangeline Booth's tambourine.
Lord commanded a company of the 6th Engineer Regiment at Fort Lawton, Washington, from 19 August 1931 to 3 October 1933, then went to St. Louis, Missouri, as assistant to the district engineer on 12 October 1933, where he worked on flood control projects on the Mississippi River. He served in the office of the Chief of Engineers in Washington, DC, and then in Eastport, Maine, where he worked on the Passamaquoddy Bay tidal power project. As part of this he built the temporary Quoddy Village that housed construction workers. He was promoted to the rank of captain on 1 August 1935. He returned to Washington, DC, on 26 July 1936, and became the head of the construction division of the Resettlement Administration and then its successor, the Farm Security Administration.
World War II
On 7 November 1938, Lord assumed command of a battalion of the 3rd Engineer Regiment at the Schofield Barracks in the Territory of Hawaii. He built pillboxes and field fortifications, for which he was awarded several patents. He was promoted to major on 1 July 1940. From December 1940 to August 1941 he served as assistant director of the Bureau of Public Relations at the War Department in Washington, DC, and was promoted to lieutenant colonel in the wartime Army of the United States on 26 March 1941.
Lord did not enjoy this role, and was grateful when Vice President Henry A. Wallace, with whom he had worked at the Farm Security Administration when Wallace was Secretary of Agriculture, selected him to become Chief of Operations and assistant director of the Board of Economic Warfare. Lord served in this capacity from September 1941 to August 1942, and was advanced to the rank of colonel on 1 February 1942. This was followed by service on the War Requirement Board in the Office of the Chief of Engineers from September 1942 to January 1943.
In February 1943, Lord was transferred to the European Theater of Operations, United States Army (ETOUSA), where he served on the staff of Major General John C. H. Lee's Services of Supply (SOS). In a reorganisation of the staff in June 1943, Lord became the Chief of Services. As such, he was responsible for the supervision of all the supply services, along with the General Purchasing Agent and the Deputy Area Petroleum Officer. His office was organized into three echelons, with one at Norfolk House for planning in cooperation with Allied planning agencies; one at Cheltenham for the supervision of supply operations; and one at SOS headquarters in London which exercised over-all supervision.
Lord was junior to many of the officers serving under him, and had never attended the Army higher command schools, the Command and General Staff College, Army War College or Army Industrial College. Nor did he have much experience in logistics, the primary role of the SOS. Although he had the full confidence of Lee, he was resented by some members of the staff, and Major General Wilhelm D. Styer, the Chief of Staff of Army Service Forces (ASF), recommended to Lieutenant General Jacob L. Devers, the commander of ETOUSA, that a more senior officer be brought in. Accordingly, Lord was replaced by Major General Robert W. Crawford, who became both deputy commander of SOS and Chief of Services.
Lord temporarily became Deputy Chief of Services for Planning, but soon became the Chief of Operations, responsible for staff co-ordination of operations. This arrangement did not last due to a personality clash between Lee and Crawford, and in October Crawford was transferred to the headquarters of the Supreme Allied Commander (COSSAC). He was replaced by Lord, who became both Chief of Staff and Deputy Commander of SOS, and was promoted to brigadier general on 22 February 1944. He traveled to Washington, DC, in March 1944 to review the supply situation for Operation Overlord with the ASF. From February 1944 on, SOS was increasingly referred to as the Communications Zone (COMZ), although this did not become official until 7 June.
In August, COMZ Headquarters moved from the UK to a camp at Valognes in France. Although the theater commander, General Dwight D. Eisenhower had expressed a desire that headquarters not be located in Paris, Lord ordered COMZ to relocate to Paris on 1 September, without Lee's knowledge. This involved the movement of 8,000 officers and 21,000 enlisted men from the UK and Valognes, and took two weeks to accomplish. The move to Paris was justified on the grounds that Paris was the hub of France's road, rail and inland waterway communications networks, but the use of scarce fuel and transport resources at a critical time caused embarrassment.
Relations between Lee and Crawford were never good, so Lord personally handled most of the communication with Eisenhower's Supreme Headquarters Allied Expeditionary Force (SHAEF). He also dealt with most of the complaints coming from the field, and starting in January 1945, also submitted weekly reports to ASF. American logistics in the Northern France campaign suffered from supply shortages in the aftermath of the breakout from Normandy and the Allied advance from Paris to the Rhine, and resulted in clashes between Lord and Brigadier General Raymond G. Moses, the assistant chief of staff for logistics (G-4) of the 12th Army Group. Lord offered statistics to show that COMZ deliveries were exceeding the amounts requisitioned, but Moses argued that this was the result of the armies restricting their requisitions. They needed of supplies per division slice, but were receiving only , and could not be comforted with statistics.
Lord was promoted to major general on 14 November 1944. In April 1945, he became commander of the ETOUSA Assembly Command, which had the key responsibility of coordinating the repatriation of personnel from Europe. He was succeeded as Chief of Staff and Deputy Commander of COMZ by Major General Thomas B. Larkin. He returned to the United States in December 1945. For his services, Lord was awarded the Distinguished Service Medal, the Legion of Merit with an oak leaf cluster, and the Bronze Star Medal with oak leaf cluster. He was created an honorary Knight Commander of the Order of the Bath by the UK and a Commander of the Legion of Honor by France, which also awarded him the Croix de Guerre with palm. He was also made an honorary citizen of Rheims, and in 1946 Brown University awarded him an honorary doctor of laws degree.
Later life
On 30 April 1946 Lord retired at his substantive rank of major. In June 1948, a law was passed that allowed retired officers who had served on active duty at a higher temporary rank for six months or more to be advanced to that rank on the retired list, and he was promoted to major general.
Lord became the chairman of the board and president of the Worldwide Development Corporation in New York City, and supervised large-scale housing projects in Argentina, and built the La Quinta Country Club in California. He served as a director of US Finishing Company, the Triplex Corporation of America, Voss Oil, ExComm List Industries, Glen Alden and Aconic Mining. He wrote articles that were published in Collier's, Popular Science, the Engineering News Record and other magazines. He retired in 1960, and built his own home overlooking a golf course in Rancho Santa Fe, California. He died suddenly of a heart attack in his car there on 21 October 1963, and was interred in the Chapel of the Chimes, Alameda County, California.
Dates of rank
Notes
References
1899 births
1963 deaths
Brown University alumni
Commanders of the Legion of Honour
Honorary Knights Commander of the Order of the Bath
Military personnel from Worcester, Massachusetts
Recipients of the Croix de Guerre 1939–1945 (France)
Recipients of the Distinguished Service Medal (US Army)
Recipients of the Legion of Merit
United States Army generals
United States Military Academy alumni
University of California, Berkeley alumni
United States Army generals of World War II |
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
*
* Subject to the condition set forth below, permission is hereby granted to any
* person obtaining a copy of this software, associated documentation and/or
* data (collectively the "Software"), free of charge and under any and all
* copyright rights in the Software, and any and all patent rights owned or
* freely licensable by each licensor hereunder covering either (i) the
* unmodified Software as contributed to or provided by such licensor, or (ii)
* the Larger Works (as defined below), to deal in both
*
* (a) the Software, and
*
* (b) any piece of software and/or hardware listed in the lrgrwrks.txt file if
* one is included with the Software each a "Larger Work" to which the Software
* is contributed by such licensors),
*
* without restriction, including without limitation the rights to copy, create
* derivative works of, display, perform, and distribute the Software and make,
* use, sell, offer for sale, import, export, have made, and have sold the
* Software and the Larger Work(s), and to sublicense the foregoing rights on
* either these or other terms.
*
* This license is subject to the following condition:
*
* The above copyright notice and either this complete permission notice or at a
* minimum a reference to the UPL must be included in all copies or substantial
* portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package com.oracle.truffle.api.test.host;
import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;
import java.util.concurrent.atomic.AtomicInteger;
import org.graalvm.polyglot.Context;
import org.graalvm.polyglot.Engine;
import org.graalvm.polyglot.HostAccess;
import org.graalvm.polyglot.Source;
import org.graalvm.polyglot.Value;
import org.junit.Assert;
import org.junit.BeforeClass;
import org.junit.Test;
import com.oracle.truffle.api.CallTarget;
import com.oracle.truffle.api.CompilerDirectives;
import com.oracle.truffle.api.interop.ArityException;
import com.oracle.truffle.api.interop.InteropLibrary;
import com.oracle.truffle.api.interop.TruffleObject;
import com.oracle.truffle.api.interop.UnknownIdentifierException;
import com.oracle.truffle.api.interop.UnsupportedMessageException;
import com.oracle.truffle.api.interop.UnsupportedTypeException;
import com.oracle.truffle.api.library.ExportLibrary;
import com.oracle.truffle.api.library.ExportMessage;
import com.oracle.truffle.api.nodes.RootNode;
import com.oracle.truffle.api.test.polyglot.ProxyLanguage;
import com.oracle.truffle.tck.tests.TruffleTestAssumptions;
public class GR36225 {
@BeforeClass
public static void runWithWeakEncapsulationOnly() {
TruffleTestAssumptions.assumeWeakEncapsulation();
}
public static class Counter {
final AtomicInteger counter;
public Counter() {
this.counter = new AtomicInteger(0);
}
@HostAccess.Export
public void increment() {
counter.incrementAndGet();
}
}
@Test
public void testSharedGuestToHostCodeCache() throws Exception {
Counter counter = new Counter();
ExecutorService executorService = Executors.newFixedThreadPool(10);
try (Engine engine = Engine.newBuilder().build()) {
ProxyLanguage.setDelegate(new ProxyLanguage() {
@Override
protected CallTarget parse(ParsingRequest request) throws Exception {
return RootNode.createConstantNode(new InvokeMember()).getCallTarget();
}
});
List<Future<String>> futures = new ArrayList<>();
for (int i = 0; i < 10; i++) {
futures.add(executorService.submit(() -> {
try (Context context = Context.newBuilder().engine(engine).build()) {
Source source = Source.create(ProxyLanguage.ID, "");
Value fn = context.eval(source);
fn.execute(counter, "increment");
}
return "x";
}));
}
for (Future<String> future : futures) {
future.get();
}
} finally {
ProxyLanguage.setDelegate(new ProxyLanguage());
}
Assert.assertEquals(10, counter.counter.get());
}
@ExportLibrary(InteropLibrary.class)
static final class InvokeMember implements TruffleObject {
InvokeMember() {
}
@SuppressWarnings("static-method")
@ExportMessage
boolean isExecutable() {
return true;
}
@SuppressWarnings("static-method")
@ExportMessage
Object execute(Object[] args) {
try {
return InteropLibrary.getUncached().invokeMember(args[0], InteropLibrary.getUncached().asString(args[1]));
} catch (UnsupportedMessageException | ArityException | UnknownIdentifierException | UnsupportedTypeException e) {
throw CompilerDirectives.shouldNotReachHere(e);
}
}
}
}
``` |
Zvonimir Mihanović (born 1946) is a Croatian artist.
Early life
Zvonimir Mihanović was born in Donje Sitno on August 12, 1946 (today part of the Split-Dalmatia County). Sitno was originally part of the Republic of Poljica and the Mihanović family roots can be traced in Sitno to the 17th century.
Education
After graduating high school in Split, Mihanović entered the Academy of Fine Arts in Zagreb, and then at the Accademia di Brera in Milan. In 1971, Mihanović entered the Ecole Beaux Arts in Paris, graduating in 1976.
Croatian War of Independence
In 1991, the then president of Croatia enlisted Mihanović for the “Art-Garde” a group of artists writers etc who helped protect Croatian artistic treasures from looting and damage during the Croatian War of Independence, and he made contributions to this effort.
Mihanović was awarded the Order of Danica Hrvatska in 1996.
Museum Collections
Hunter Museum of American Art, Chattanooga, TN
Exhibitions
1962: Salon of Young Artists; Split, Croatia
1966: Croatian Pavilion, Summer Olympics; Atlanta, GA
1973: Salon des Artistes Français; Société des Artistes Français; Paris, France
1978: Salon d'Automne; Paris, France (awarded Grande Prix and best young exhibitor). Painting no. 1341, Silence.
1980: Findlay Galleries; New York, NY (1st solo exhibition in the United States)
1981: Museum of Modern Art, Dubrovnik, Croatia
1986: Findlay Galleries; New York, NY
1989: Findlay Galleries; New York, NY
1991: Museum of Modern Art, Dubrovnik, Croatia
1996: Parrish Art Museum; Southampton, NY
2012: Forbes Galleries; New York, NY
2021: Findlay Galleries; New York, NY
References
1946 births
People from Split-Dalmatia County
Hyperrealist artists
Living people |
Dozzi is an Australian trio of singers and songwriters, founded by sisters, Andrea, Jesse, and Nina Dozzi. Vocalist duties are shared by each of the sisters. Andrea plays mandolin, Jesse guitar, and Nina on keys.
Early life
Andrea, Jesse, and Nina Dozzi grew up in a musical home in Brisbane, Australia. Their parents, Mark and Sharon Dozzi, met while playing music and formed the band Small Torque in the 1980s. Both parents were full time musicians. The girls sang along with Sharon and helped her learn cover songs by recording the music and writing down the lyrics. Mark is a guitarist, multi-instrumentalist, and songwriter. They wrote songs during the day and performed at night. The girls, along with three other siblings, Caleb, Jordan, and Georgia, spent much of their childhood backstage. The girls all play guitar and keys because the instruments were available to them at home.
The Dozzi sisters moved to Nashville, Tennessee in 2016 to pursue their music careers.
Music career
In 2013, Dozzi won the Australian Country Music People's Choice Award for Best Video Clip for "Love Away The Bad Days".
In 2014, Dozzi released the single "I Need You Tonight", a duet with Drew McAlister, as a teaser to their debut album Risk It All. I Need You Tonight won the trio's second People's Choice Award in 2015 for Best Video Clip and topped the Australian Country Music Charts at number one. Their next single, Weakness, saw chart success as well.
In 2019, they released an EP, Worth The Wait, produced by Eric Torres. The EP contains Dozzi's first Nashville-produced singles: "Fools", "Ramones T-Shirt", and the title track, "Worth The Wait". "Fools", received critical acclaim from Rolling Stone, who named the song one of the "10 Best Country and Americana Songs to Hear Now". Ramones T-Shirt was placed in rotation on Australian radio and CMC. The video for Worth The Wait premiered on CMT.
The video for Dozzi's 2021 single, "Messy" has been placed in rotation on CMT. The video is Dozzi's first underwater music video, filmed by CreateWell LLC.
References
External links
Australian musical groups
Sibling musical trios
Australian women singer-songwriters
Australian singer-songwriters |
Ernő Rubik (; born 13 July 1944) is a Hungarian inventor, architect, and professor of architecture. He is best known for the invention of mechanical puzzles including the Rubik's Cube (1974), Rubik's Magic, Rubik's Magic: Master Edition, and Rubik's Snake.
While Rubik became famous for inventing the Rubik's Cube and his other puzzles, much of his recent work involves the promotion of science in education. Rubik is involved with several organizations such as Beyond Rubik's Cube, the Rubik Learning Initiative and the Judit Polgar Foundation, all of which aim to engage students in science, mathematics, and problem solving at a young age.
Rubik studied sculpture at the Academy of Applied Arts and Design in Budapest and architecture at the Technical University, also in Budapest. While a professor of design at the academy, he pursued his hobby of building geometric models. One of these was a prototype of his cube, made of 27 wooden blocks; it took Rubik a month to solve the problem of the cube. It proved a useful tool for teaching algebraic group theory, and in late 1977 Konsumex, Hungary's state trading company, began marketing it. By 1980 Rubik's Cube was marketed throughout the world, and over 100 million authorized units, with an estimated 50 million unauthorized imitations, were sold, mostly during its subsequent three years of popularity. Approximately 50 books were published describing how to solve the puzzle of Rubik's Cube. Following his cube's popularity, Rubik opened a studio to develop designs in 1984; among its products was another popular puzzle toy, Rubik's Magic.
Early life and education
Ernő Rubik was born in Budapest, Hungary, on 13 July 1944, during World War II, and has lived all of his life in Hungary. His father, Ernő Rubik, was a flight engineer at the Esztergom aircraft factory, and his mother, Magdolna Szántó, was a poet. He has stated in almost every interview that he got his inspiration from his father.
His father, Ernő, was a highly respected engineer of gliders. His extensive work and expertise in this area gained him an international reputation as an expert in his field. Ernő Rubik has stated that:
From 1958 to 1962, Rubik specialized in sculpture at the Secondary School of Fine and Applied Arts. From 1962 to 1967, Rubik attended the Budapest University of Technology where he became a member of the Architecture Faculty. From 1967 to 1971, Rubik attended the Hungarian Academy of Applied Arts and was in the Faculty of Interior Architecture and Design.
Rubik considers university and the education it afforded him as the decisive event which shaped his life. Rubik stated, "Schools offered me the opportunity to acquire knowledge of subjects or rather crafts that need a lot of practice, persistence, and diligence with the direction of a mentor."
Career
Professorship and origin of the Rubik's Cube
From 1971 to 1979, Rubik was a professor of architecture at the Budapest College of Applied Arts (Iparművészeti Főiskola). It was during his time there that he built designs for a three-dimensional puzzle and completed the first working prototype of the Rubik's Cube in 1974, applying for a patent on the puzzle in 1975. In an interview with CNN, Rubik stated that he was "searching to find a good task for my students."
Starting with blocks of wood and rubber bands, Rubik set out to create a structure that would allow the individual pieces to move without the whole structure falling apart. Rubik originally used wood for the block because of the convenience of a workshop at the university and because he viewed wood as a simple material to work with that did not require sophisticated machinery. Rubik made the original prototypes of his cube by hand, cutting the wood, boring the holes and using elastic bands to hold the contraption together.
Rubik showed his prototype to his class and his students liked it very much. Rubik realized that, because of the cube's simple structure, it could be manufactured relatively easily and might have appeal to a larger audience. Rubik's father possessed several patents, so Rubik was familiar with the process and applied for a patent for his invention. Rubik then set out to find a manufacturer in Hungary, but had great difficulty due to the rigid planned economy of communist Hungary at the time. Eventually, Rubik was able to find a small company that worked with plastic and made chess pieces. The cube was originally known in Hungary as the Magic Cube.
Rubik licensed the Magic Cube to Ideal Toys, a US company in 1979. Ideal rebranded The Magic Cube to the Rubik's Cube before its introduction to an international audience in 1980. The process from early prototype to significant mass production of the Cube had taken over six years. The Rubik's Cube would go on to become an instant success worldwide, winning several Toy of the Year awards, and becoming a staple of 1980s popular culture. To date, over 350 million Rubik's Cubes have been sold, making it one of the best selling toys of all time. It became very famous and today, there are many sizes from 2x2 to 21x21.
Other inventions
In addition to Rubik's Cube, Rubik is also the inventor of Rubik's Magic, Rubik's Snake and Rubik's 360 among others.
Later career and other works
In the early 1980s, he became the editor of a game and puzzle journal called ..És játék (...And games), then became self-employed in 1983, founding the Rubik Stúdió, where he designed furniture and games. In 1987, he became a professor with full tenure; in 1990 he became the president of the Hungarian Engineering Academy (Magyar Mérnöki Akadémia). At the academy, he created the International Rubik Foundation to support especially talented young engineers and industrial designers.
He attended the 2007 World Championship in Budapest. He also gave a lecture and autograph session at the "Bridges-Pecs" conference ("Bridges between Mathematics and the Arts") in July 2010.
In 2009, he was appointed as an honorary professor of Keimyung University, Daegu, South Korea.
In the 2010s, Rubik has recently spent much of his time working on Beyond Rubik's Cube, a Science, Technology, Engineering, Mathematics (STEM fields) based exhibition, which would travel the globe over the next six years. The grand opening of the exhibit was held on 26 April 2014 at the Liberty Science Center in New Jersey. At the exhibition, Rubik gave several lectures, tours, and engaged with the public and several members of the speedcubing crowd in attendance, including Anthony Michael Brooks, a world-class speedcuber.
Rubik is a member of the USA Science and Engineering Festival's advisory board.
Influences
Ernő Rubik has listed several individuals who, as he has said, "exerted a great influence over me through their work." These include Leonardo da Vinci, whom Rubik regards as the Renaissance man; Michelangelo, whom he respects as a polymath, painter, and sculptor; and artist M. C. Escher, who drew impossible constructions and grappled with explorations of infinity. As regards to philosophers and writers, Rubik admires Voltaire, Stendhal, Thomas Mann, Jean-Paul Sartre, Hungarian poet Attila József, Jules Verne, and Isaac Asimov. In the field of architecture, Rubik is an admirer of Frank Lloyd Wright and Le Corbusier.
Personal life
Rubik admits to being a lifelong bibliophile and has stated, "Books offered me the possibility of gaining knowledge of the world, nature and people." Rubik has stated that he has a special interest in science fiction.
Rubik is fond of outdoor activities such as walking through nature, playing sports, and sailing on Lake Balaton. Rubik is also an avid gardener and has stated that "collecting succulents is my favourite pastime."
Prizes and awards
1978 – Budapest International Trade Fair, Prize for the Cube
1980 – Toy of the Year: Federal Republic of Germany, United Kingdom, France, USA
1981 – Toy of the Year: Finland, Sweden, Italy
1982 – Toy of the Year: United Kingdom (second time)
1982 – The Museum of Modern Art, New York selected Rubik's Cube into its permanent collection
1983 – Hungarian State Prize for demonstrating and teaching 3D structures and for the various solutions that inspired scientific researches in several ways
1988 – Juvenile Prize from the State Office of Youth and Sport
1995 – Dénes Gabor Prize from the Novofer Foundation as an acknowledgement of achievements in the field of innovation
1996 – Ányos Jedlik Prize from the Hungarian Patent Office
1997 – Prize for the Reputation of Hungary (1997)
2007 – Kossuth Prize the most prestigious cultural award in Hungary
2008 – Moholy-Nagy Prize – from the Moholy-Nagy University of Arts and Design
2009 – EU Ambassador of the Year of Creativity and Innovation
2010 – USA Science and Engineering Festival Award (Outstanding Contribution to Science Education)
2010 – The Hungarian Order of Merit Commanders Cross with the Star
2010 – Prima Primissima Prize
2012 – My Country Awards
2014 – Hungarian Order of Saint Stephen (The highest Hungarian state honour)
2014 – Honorary Citizen of Budapest
Publications
Editor and co-author of A bűvös kocka ("The Magic Cube"), Műszaki Kiadó, Budapest, 1981.
Co-author of The Rubik's Cube Compendium (written by David Singmaster, Ernő Rubik, Gerzson Kéri, György Marx, Tamás Varga and Tamás Vekerdy), Oxford University Press, 1987.
Author of Cubed – The Puzzle of Us All, Flatiron Books/Orion Publishing Group /Hachette UK/Libri, 2020.
References
External links
An interview with Ernő Rubik
His biography at Hungary.hu
His first print interview in ten years
An exclusive video interview about the new Rubik's 360
1944 births
Living people
Academic staff of the Moholy-Nagy University of Art and Design
Hungarian architects
Hungarian inventors
Recreational mathematicians
Puzzle designers
Rubik's Cube
Toy inventors |
Ellery is a given name, and may refer to:
People
As a first name
Ellery Eskelin, a jazz musician
Ellery Sprayberry, an American actress
Ellery Hollingsworth, an American professional snowboarder
Ellery Schempp (born Ellory Schempp), a physicist
Ellery Queen, pseudonym of authors Frederic Dannay and Manfred Lee
Ellery Queen, fictional detective created by Dannay and Lee
Ellery Hanley, a rugby league player and coach
As a second name
William Ellery Channing, a Unitarian theologian
William Ellery Channing (poet), a Transcendental poet
George Ellery Hale, an American solar astronomer
See also
Eleri (disambiguation), the Welsh form of Hilarus |
Roberta Vinci won the first edition of the tournament, defeating Petra Kvitová in the final, 7–6(2), 6–1.
Seeds
Draw
Finals
Top half
Bottom half
Qualifying
Seeds
Qualifiers
Lucky losers
Shahar Pe'er
Qualifying draw
First qualifier
Second qualifier
Third qualifier
Fourth qualifier
References
Main draw
Qualifying draw
2013 WTA Tour
2013 Singles |
Aldisa williamsi is a species of sea slug, a dorid nudibranch, a marine gastropod mollusk in the family Cadlinidae.
Distribution
This species was described from Barracuda Point in Papua New Guinea. It has subsequently been found in Sulawesi, Flores, Rinca Is. and Pantar Is., in Indonesia.
References
Cadlinidae
Gastropods described in 2000 |
The R20 – Regions of Climate Action is a non-profit environmental organization founded in September 2011, by former governor of California, Arnold Schwarzenegger, with the support of the United Nations. R20 is a coalition of sub-national governments, private companies, international organizations, NGOs, and academic & financial institutions. Its mission is to accelerate sub-national infrastructure investments in the green economy to meaningfully contribute to the Sustainable Development Goals (SDGs). The NGO operates at the sub-national level as R20 believes sub-national governments constitute a powerful force for change and are best positioned to take action & implement green projects.
R20's efforts are designed to support sub-national governments around the world to develop and finance low-carbon and climate resilient infrastructure projects in the field of renewable energy, energy efficient lighting and waste optimisation.
Mission and Methodology
Founded on the principle that tackling climate change requires “Less talk, more action”, R20 works with a strong sense of immediacy to ensure that sub-national governments’ ability to mitigate and adapt to climate change is unlocked.
While sub-national governments (provinces, regions, cities, etc.) are at the center of R20's work, the NGO recognizes that fast-tracking the transition to inclusive, resilient and low-carbon societies requires greater mobilization and collaboration between a wide range of stakeholders. This is why R20's approach aims to “connect the dots” and foster understanding and interconnection between policy-makers, clean technology providers and public-private investors throughout the whole project development value chain.
An integrated approach to accelerate green infrastructure development and financing.
Through collaboration and with support from many partners, including the Leonardo DiCaprio Foundation, R20 has created a unique value chain approach that facilitates the identification, structuring, development (or bankability) and financing of green infrastructure projects. Sub-national governments from around the world can benefit from this unique one stop shop to improve the sustainability of their regions.
Project Identification: R20 works with sub-national governments and other networks of regions to identify potential green infrastructure projects and secure political support for their development.
Project Structuring: Together with Foundations and academic institutions, R20 conducts workshops and training programs to facilitate the structuring and design of projects identified.
Project Bankability: R20 works with its corporate partners to help project developers perform feasibility studies and ensure bankability of projects.
Project Financing: R20 works with Foundations and Impact Fund Managers to provide and attract investment capital to fund project implementation.
Project MRV: R20 works with MRV standards and implementer to Measure, Report and Verify projects contributions to GHG emission reduction and impact towards the SDGs.
Governance Board
Since June 2017, R20 consists of R20 – Regions of Climate Action (Association) and the R20 Foundation, which work as two complementary entities. The association carries out day-to-day operational duties, and the foundation manages important investment decisions.
R20 - Regions of Climate Action (Association)
The R20 Association is legally structured as a Swiss association. On behalf of the General Assembly of members, the governing board carries out all acts that further the purpose of the organization and is responsible for managing the organization's business. The founding chair of the association is Arnold Schwarzenegger. The current president is Magnus Berntsson – president of the Regional Council of Västra Götaland and president of the AER (Assembly of European Regions) and The Strategic Advisor to the Founding Chair is Terry Tamminen, CEO of the Leonardo DiCaprio Foundation and the former secretary of the California Environmental Protection Agency.
The R20 executive director is Dr. Christophe Nuttall, former director of the Hub for Innovative Partnerships at the United Nations Development Programme (UNDP).
R20 Foundation
The R20 Foundation is the entity responsible for almost all aspects of funding of the R20 Association and its operations. It was created at the request of a number of investors interested to invest in the R20 ecosystem of blended finance.
With a board of directors composed of green finance leaders, the R20 Foundation meets the demands of development banks, sovereign funds, private bans, private equities, family offices and pension funds. The current board is composed of Armand Jost, founder and CEO of SB3i (chairman), Dr. Patrick Scheurle, CEO of BlueOrchard Finance Ltd., Craig Cogut, chairman and president of Pegasus Capital Advisors, Dr. Andreas Mattner, chairman of the executive committee, «Lebendige Stadt» Foundation, Terry Tamminen, CEO of the Leonardo DiCaprio Foundation, Chrisophe Dossarps, CEO of the Sustainable Infrastructure Foundation and Dr. Frannie Léautier, founder and managing partner of Ezembat Group.
R20 is headquartered in Geneva, Switzerland and benefits from a unique concentration of international organizations, financial institutions, NGOs and academia that the NGO can work with to further its mission.
To facilitate and bring together local authorities, technology providers and investors, R20 works with regional offices installed around the world: Austria (Vienna), France (Paris), US (Santa Monica), Algeria (Oran), and Brazil (Rio de Janeiro).
As of November 2016, R20 has 49 direct members (both national & sub-national authorities) and 134 businesses and project facilitators (academic institutions, national agencies, NGOs, private companies, UN programs and Intergovernmental organizations), and 41 investors and financial institutions.
History
During his tenure as Governor of the State of California from 2003 to 2011, Arnold Schwarzenegger was responsible for signing into law groundbreaking legislation that translated the Kyoto Protocol into Californian law. This and other initiatives is what led President Obama to ask Governor Schwarzenegger to obtain similar commitments from thirty other US States.
A. Schwarzenegger's success in implementing action at the sub-national level, and his ability to demonstrate the potential to scale this impact by replication at the sub-national level is ultimately what gave birth to the R20 Regions of Climate Action.
In December 2009, after evaluating the failure of the COP15 to agree on the practical means to limit carbon emissions, Gov. Schwarzenegger, with the support from the UN Secretary General Ban Ki Moon, decided to create a new coalition of Regions committed to action. He met with a number of heads of regions, including Governor Uduaghan from Delta State, Nigeria, President Charet from the Province of Quebec, Canada, President Huchon and Vice President Michèle Sabban from Region Ile de France, and 17 other representatives from other Regions, who all decided to create R20 Regions of Climate Action.
In September 2010, Governor Schwarzenegger organized the Third Global Governors Climate Summit in Sacramento and launched the R20 Charter, which was signed by representatives of Regions, national governments, NGOs, foundations, private companies and finance institutions. In September 2011, the First constitutive General Assembly of R20 marked the official creation of the NGO. Linda Adam, The California Environmental Protection Agency State Secretary, was officially elected president of the R20 Board and Terry Tamminen was nominated as R20 special advisor to Governor Schwarzenegger, the honorary founding chair of R20.
In January 2012, Dr. Christophe Nuttall, director of the UNDP Hub for Innovative Partnership, officially joined R20 as executive director.
From 2013 to 2017, Michèle Sabban took on the R20 presidency.
In June 2017, Magnus Berntsson, president of the Regional Council of Västra Götaland and president of AER, was elected as the new R20 president.
Since 2017, R20 organises the annual climate conference Austrian World Summit in Vienna.
See also
Climate change
Sustainable development
Paris Agreement
References
Further reading
External links
Official website
International climate change organizations
Organisations based in Geneva |
```java
// This source code is licensed under both the GPLv2 (found in the
// (found in the LICENSE.Apache file in the root directory).
package org.rocksdb;
/**
* Just a Java wrapper around EmptyValueCompactionFilter implemented in C++
*/
public class RemoveEmptyValueCompactionFilter
extends AbstractCompactionFilter<Slice> {
public RemoveEmptyValueCompactionFilter() {
super(createNewRemoveEmptyValueCompactionFilter0());
}
private native static long createNewRemoveEmptyValueCompactionFilter0();
}
``` |
Thomas Thurlow may refer to:
Thomas Thurlow (bishop) (1737–1791), English bishop
Thomas Thurlow (sculptor) (1813–1899), English sculptor
Tom Thurlow (born 1989), English businessman |
Eastwood By The Lake, formerly known as Eastwood Beach Apartment Hotel, is a condominium and apartment building in the Uptown neighborhood of Chicago, Illinois, United States. It is the oldest known residential hotel built in Chicago during the twentieth century. It was designed in 1912 by architect John Augustus Nyden as a unique hotel with 25 balconies, lounging room, and a rooftop ballroom next to "the beach".
Design
Eastwood By The Lake was designed in 1912 by architect John Augustus Nyden. The original fireproof construction consisted of eighty apartments and boasted the proximity to Clarendon Avenue Beach. One unique feature was that it featured specially designed kitchenettes.
It was renovated in the 2000s, and is located across the street from the Louis A. Weiss Memorial Hospital.
References
Defunct hotels in Chicago
Hotel buildings completed in 1917
Apartment buildings in Chicago
1917 establishments in Illinois |
Paloma Valley High School is a public four-year high school located in Menifee, California. The school is part of the Perris Union High School District. It opened for its first school year on September 7, 1995. The mascot is the Wildcat. Paloma Valley High School was ranked by Newsweek magazine as the 374th best high school in California. Students have the opportunity to take Advanced Placement coursework and exams. The AP participation rate at Paloma Valley High School is 35 percent. The student body makeup is 51 percent male and 49 percent female, and the total minority enrollment is 65 percent.
Curriculum
2014 academic indicators
National Rank: #1,736
College Readiness Index: 21.9
Academic Performance Index: 815
Student/Teacher Ratio: 29:1
Wildcat Formal Exchange
Homophobic allegations
On March 2, 2011, it was reported that a teacher at Paloma Valley High School allegedly wrote an 'S' on a lesbian student's hand and repeatedly referred to the student as a "sinner" throughout class. The student reported the alleged incident against the teacher on October 14, but the teacher has only recently been "dealt with" according to Leslie Ventuleth, the Riverside County School District’s chief human resources officer. As of Oct. 29, 2015, the identities of the student and the teacher have yet to be released.
"Teachers and students say that even though they have complained, the district has refused to do anything about it."
The school's Gay Straight Alliance was forbidden last fall from sharing information about Gay, Lesbian, Bisexual and Transgender History Month during school announcements. Paloma Valley's vice president of the Gay Straight Alliance had proposed the idea. She hoped to share information during announcements about prominent gay people. She said her proposal was rejected, and that she was told such announcements weren't allowed for any history month. Later, during Black History Month in February, the Black Student Union made announcements similar to those proposed by the Gay Straight Alliance. She continued and was one of several students who complained to Perris Union school board members last month. "I'm frustrated that my school would do something like this," she said at the meeting.
Notable alumni
Nia Sanchez, winner of Miss USA 2014
Matt Orzech, long snapper for the Los Angeles Rams
Mark Holcomb, guitarist in the djent/metal band Periphery
References
External links
Paloma Valley High School News
Teacher ‘Dealt With’ After Allegedly Calling Gay Student A Sinner – KCAL-TV
Educational institutions established in 1995
High schools in Riverside County, California
Public high schools in California
Menifee, California
1995 establishments in California |
Dylan Murray may refer to:
Dylan Murray (squash player)
Dylan Murray (hurler) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.