text
stringlengths 1
22.8M
|
|---|
Dom Peter III (, ; 5 July 1717 – 25 May 1786), nicknamed the Builder, was King of Portugal from 24 February 1777 to his death in 1786 as the co-ruler of his wife and niece, Queen Dona Maria I.
Early life
Peter was born at 12:00 noon on 5 July 1717 in the Ribeira Palace in Lisbon, Portugal. He was baptized on 29 August and was given the name Peter Clemente Francisco José António. His parents were King John V of Portugal and his wife Maria Ana of Austria. Peter was a younger brother of Joseph I of Portugal. Their maternal grandparents were Leopold I, Holy Roman Emperor, and Eleonor Magdalene of Neuburg, sister of Queen Maria Sofia of Portugal.
Reign
Peter married his niece Maria, Princess of Brazil, in 1760, at which time she was the heiress presumptive to the throne then held by his brother Joseph I. According to custom, Peter thus became king of Portugal in right of his wife, after the delivery of his first born child. They had six children, of whom the eldest surviving son succeeded Maria as John VI of Portugal on her death in 1816.
Peter made no attempt to participate in government affairs, spending his time hunting or in religious exercises.
He also defended the high nobility of Portugal, and sponsored the petitions of those accused in Távora affair, whose rehabilitation was subject of new lawsuits, in which the heirs demanded the restitution of their confiscated properties.
Peter III was moderately friendly toward the Jesuits, who had been banished from Portugal and its overseas empire in 1759, largely at the behest of the Marquis of Pombal. Peter III had taken some of his early education from the Jesuits, explaining this. His affection had little effect; Pope Clement XIV ordered the Jesuits suppressed across Europe in 1773.
Marriage and issue
The couple married on 6 June 1760. At the time of their marriage, Maria was 25 and Peter was 42. Despite the age gap, the couple had a happy marriage. Peter automatically became co-monarch (as Peter III of Portugal) when Maria ascended the throne, as a child had already been born from their marriage. The couple had six children.
Ancestors
Notes
References
Kings consort
Jure uxoris kings
18th-century Portuguese monarchs
Burials at the Monastery of São Vicente de Fora
House of Braganza
Portuguese infantes
Nobility from Lisbon
Portuguese royal consorts
1717 births
1786 deaths
|
```yaml
description: |-
You have to enter your 6-digit password using this Frenchy keypad.
images:
- ca-centrest.png
name: Crdit Agricole Centre-Est
url: path_to_url
```
|
Robert William Kennard JP DL (1800–1870) was a London-born merchant, financier, entrepreneur, JP and later Member of Parliament.
The son of jeweller turn banker John Kennard (Heywood, Kennards & Co, merged into Consolidated Bank Ltd), and Harriet Elizabeth Peirse, he trained as a merchant in London. Having invested in the Falkirk Iron Company in 1830, Kennard's consortia formed the Blaenavon Coal and Iron Company in 1836, which subsequently bought the Blaenavon Ironworks. There he employed his son, the noted civil engineer Thomas Kennard, and his cousin and the later photographer George Swan Nottage.
Through his connections with the iron and steel industries, and access to large sums of money through his families banking connections, he became a significant financier during the railway boom of the 1830s, and also financed some of the government requirements during the Crimea War. Leveraging this, Kennard made his fortune as a director of several UK railway companies, and as a director of one of the largest groups promoting railroads in France and Belgium.
He held the office of Justice of the Peace for: Stirlingshire; Middlesex; and later Hertfordshire. Having held the office of Deputy Lieutenant of Monmouthshire, he was appointed Sheriff of London and Middlesex between 1846 and 1847. He was elected as an associate member of the Institution of Civil Engineers, seconded by Robert Stephenson and Sir William Cubitt. He was decorated with the award of Chevalier, Order of Leopold of Belgium.
Kennard was elected to the House of Commons as a Conservative on 11 February 1857, representing Newport (Isle of Wight) constituency. He was not reelected in the general election in March that year, but returned to Parliament in the 1859 general election, and sat until he stepped down at the 1868 general election.
Kennard married Mary Ann Challis, only child of Liberal MP and later Lord Mayor of London Thomas Challis, on 23 May 1823. Living in Theobalds Park, Hertfordshire, the couple had 10 children: Mary Jane Kennard; Charlotte Anne Kennard (died 24 Oct 1926); Ellen Kennard (died 5 Apr 1917); Reverend Robert Bruce Kennard (8 May 1824 – 10 Mar 1895); Thomas William Kennard (29 Aug 1825 – 10 Sep 1893); Arthur Challis Kennard (born 17 Jun 1831); Henry Martyn Kennard (born 17 Feb 1833); John Kennard (13 Apr 1836 – 24 Nov 1925); Howard John Kennard (29 Nov 1839 – 8 Aug 1896); Edward Kennard (born 22 Apr 1842).
He is interred in Kensal Green Cemetery, in Grade II listed portland stone with bronze door mausoleum.
References
External links
Robert W. Kennard @ TheyWorkForYou.com
Conservative Party (UK) MPs for English constituencies
Members of Parliament for Newport (Isle of Wight)
UK MPs 1852–1857
UK MPs 1859–1865
UK MPs 1865–1868
Burials at Kensal Green Cemetery
1800 births
1870 deaths
Institution of Civil Engineers
19th-century English businesspeople
|
Margit Elek (5 May 1910 – 4 February 1986) was a Hungarian Olympic foil fencer.
She was born in Budapest, Hungary, was the sister of Olympic champion Ilona Elek, and was Jewish. She competed in the women's individual foil events at the 1948 and 1952 Summer Olympics. She also won the silver medal at the 1934 World Fencing Championships.
References
External links
1910 births
1986 deaths
Hungarian female foil fencers
Jewish female foil fencers
Jewish Hungarian sportspeople
Olympic fencers for Hungary
Fencers at the 1948 Summer Olympics
Fencers at the 1952 Summer Olympics
Fencers from Budapest
|
```xml
/*
* Wire
*
* This program is free software: you can redistribute it and/or modify
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with this program. If not, see path_to_url
*
*/
export * from './ContentMessage';
```
|
Green Onyekaba Nwankwo is a Nigerian scholar and traditional ruler who has authored many books about banking and finance in Nigeria. One of his books, The Nigerian Financial System published in 1980 is a foundation books on post-colonial banking, insurance, money and capital markets in Nigeria.
Nwankwo served as the pioneer head of the Finance Department of University of Lagos and played a principal role in organizing the department. In 1977, he became the Executive Director in charge of banking and monetary policy in Central Bank of Nigeria.
Nwankwo has led a few organizations such as the Nigerian-Greece Chamber of Commerce and Technology and the Chartered Institute of Bankers of Nigeria.
Life
Nwankwo was born in 1933 and raised in a humble household, his father was a farmer and palm wine tapper. As a young boy he lived with a Christian uncle and with his uncle's support, he attended St Peters CMS Central School, Ndiawa Arondizuogu for his primary education. Upon completion of studies in 1945, he briefly worked as a pupil teacher before continuing with secondary school education. He later obtained his undergraduate degree in economics from University of Strathclyde. Sponsored by a Nigerian government scholarship, he earned his degree within three years and subsequently started his graduate program after receiving encouragement from his lecturers. He obtained his masters and doctorate degree from London School of Economics and the School of Oriental and African Studies respectively, his PhD was titled Foreign private investment in Nigerian Manufacturing, 1939 to 1965 was written under the principal supervision of Edith Penrose.
Nwankwo began his banking career in 1951 working as a clerk at a Port Harcourt branch of Bank of British West Africa. He spent nine years at the bank before resigning his position.
Upon completion of his doctorate degree in 1967, Nwankwo was unable to return to Nigeria as the Civil War just began, he decided to stay in London and eke out a living as a lecturer at City of London College. He taught at the college for five years until he returned to Nigeria in 1972 when he was recruited to start a department of finance at University of Lagos being sponsored by the United Bank for Africa. In Nigeria, Nwankwo called for a post-colonial review of the Nigerian financial system and adoption of practices that is easily adaptable to the peculiarities of indigenous values and systems. In 1974, he became the UBA professor in Finance and taught in Lagos until 1978, when he was appointed Deputy Governor of the Central Bank of Nigeria. In 1980, he wrote Money and Capital Markets in Nigeria, a banking and finance textbook for both students and bankers.
Nwankwo was chairman of Union Bank of Nigeria from 1990 to 1996 and African Continental Bank from 2001 to 2005.
Works
References
Academic staff of the University of Lagos
1933 births
Living people
Alumni of the University of Strathclyde
Alumni of the London School of Economics
Alumni of SOAS University of London
|
Lähden is a municipality in the Emsland district, in Lower Saxony, Germany.
History
For a long time the region of the Emsland was extremely sparsely populated, due to the fens on both sides of the river. Small villages were established in medieval times along the river and on the Hümmling. In the 13th century the bishops of Münster gained control over the region; the Emsland remained property of the bishop until 1803, when the clerical states were dissolved. It came under rule of Prussia and Arenberg, but after the Napoleonic Wars the Congress of Vienna decided to hand the territory over to the Kingdom of Hanover. The Duchy of Arenberg continued to exist as a fief of the Hanoverian kings. When Hanover was annexed by Prussia (1866), the dukes were deposed soon after (1875).
The now Prussian Province of Hanover was subdivided into districts in 1885; four districts were established on the territory of what is now the Landkreis Emsland. The districts were merged in 1977 to form the present district.
Memorial at the site of the entrance to the former Börgermoor concentration camp
During the Nazi period, labour camps known as the Emslandlager ("Emsland camps") held thousands of political opponents of the Third Reich, located outside Börgermoor, now part of the commune Surwold, not far from Papenburg. A memorial of these camps, the Dokumentations- und Informationszentrum (DIZ) Emslandlager, is located at Papenburg. The well known resistance song "Peat Bog Soldiers" was composed by political prisoners at one of these camps.
In 1950 a governmental plan for the development of Emsland was adopted. Its aim was to turn the region into an industrial location. This was accomplished by draining the fens and establishing projects like the test track of the maglev "Transrapid" and several large shipyards such as the Meyer-Werft in Papenburg. Although the Landkreis Emsland lost much of its original character, some areas retain their natural character, for example the Hümmling.
Transrapid test track
1977 district reforms in Lower Saxony unite the former districts of Lingen, Meppen and Aschendorf-Hümmling in the district of Emsland, with Meppen as administrative seat. The Emsland remains a very Roman Catholic region compared to other parts of Lower Saxony.
Geography
The district is located on the Dutch border. It is named after the Ems river, which crosses the region from south to north. It is an absolutely plain countryside, which was once full of fens. The only elevations are in the Hümmling, which is a hilly forest area east of the Ems.
Although the Emsland region is nowadays primarily a county among many others in Lower Saxony, its locals have what could be called a distinct sense of regional pride which will unlikely be found elsewhere in this state.
References
Emsland
|
Struvea is a genus of green macroalgae (or seaweed) in the family Boodleaceae.
Taxonomy and Nomenclature
This genus was founded by Otto Wilhelm Sonder in 1845 and was named in honor of the Russian ambassador H. de Struve. Initially, the genus name was in conflict with Struvea Reichenbach, a heterotypic synonym of Torreya Arnott but P.C. Silva formally conserved Struvea Sonder in 1952 to prevent further taxonomic problems. Currently, there is only four confirmed species for this genus. This low species number was due to the segregation of Phyllodictyon from Struvea sensu lato based on differences in cell division processes and later on supported by molecular data. The Struvea plumosa sample collected by Ludwig Preiss from western Australia was described by Sonder and now serves as the holotype species for this genus. The voucher specimen for the type species is housed at the Royal Botanic Gardens Melbourne (MEL).
Morphology
The thallus of Struvea is composed of a single to numerous (clumped) blades borne from a monosiphonous or aseptate stipe (i.e., stipitate in nature); moreover, the blades form a stellate or criss-cross network of 2–3 ranks of distichously-arranged pinnae (laterals) lying on one plane. Members of this genus exhibit one of the four major types of cytokinesis within the order Cladophorales—segregative cellular division (SCD)—wherein the cytoplasm of a mother cell divides simultaneously into several independent cytoplasms that would later on produce cell walls and become daughter cells. Differences between the type of cell division process has been used to delineate the members of Cladophorales, most notably the delineation between Struvea and Phyllodictyon—the latter of which exhibits centripetal invagination by a primordial septum (CI). In terms of its cellular ultrastructure, the cell walls of Struvea are composed of crystalline inclusions forming single crystals that are broad, prismatic, and hexagonal, diamond, needle-shaped, or triangular in shape. Chloroplasts are also reticulate or net-like with numerous pyrenoids.
Distribution
Struvea are widely distributed in the tropics and subtropics, mainly Australia and the tropical Western Pacific. Struvea elegans is the most widely distributed species encompassing the Caribbean islands, Oman, and Fiji. Meanwhile, S. plumosa and S. thoracica are only found in Oceania. Lastly, S. okamurae seems to be restricted within the tropical Western Pacific with Micronesia as the limit of its westernmost range. However, this distribution data on Struvea could just be an artefact of poor taxon sampling.
Ecology
Members of this genus are found on the intertidal zone down to mesophotic depths. Struvea plumosa inhabit limestone areas of the intertidal zone down to 33 meters deep. S. elegans are only restricted to mesophotic depths. S. okamurae is epilithic and found between 4–6 meters in depth. Lastly, S. thoracica thrive in subtidal channels and/or reef flats of about 15–18 m in depth with substrate primarily composed of shell fragments and coral debris.
Life history
Unfortunately, research on the life history of this genus is centered around its growth (SCD) rather than reproduction. However, being a member of family Boodleaceae the general cycle is believed to be diplontic and presence of zoospores have been observed.
Exploitation/Harvesting/Cultivation
Due to its unknown life cycle, relatively few representative species, and its tendency to inhabit subtidal areas—this genus is not harvested from the wild and there is no known culture technology.
Chemical composition/Natural products chemistry
Most chemistry research work on this genus is mainly centered around the calcium oxalate crystals present within the cell walls of the blades. Out of the four species, S. elegans does not possess any crystals while S. plumosa has diamond, triangular or pentagonal-shaped crystals and S. thoracica has needle-shaped ones.
Utilization and Management
Due to a lack of general interest and use, there is currently no utilization and management strategy for the members of this genus.
References
External links
Cladophorales genera
Boodleaceae
Taxa named by Otto Wilhelm Sonder
|
```objective-c
//
// This program is free software; you can redistribute it and/or modify
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
//
// with this program; if not, write to the Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
//
////////////////////////////////////////////////////////////////////////////////
#ifndef DML_DEEPMIND_MODEL_GENERATION_GEOMETRY_SPHERE_H_
#define DML_DEEPMIND_MODEL_GENERATION_GEOMETRY_SPHERE_H_
#include <cstddef>
#include <string>
#include "Eigen/Geometry"
#include "deepmind/model_generation/model.h"
namespace deepmind {
namespace lab {
namespace geometry {
// Parameters used to construct surfaces in the shape of a ellipsoid (defaulting
// to a sphere with diameter 1).
struct Sphere {
float width_radius = 0.5f;
float depth_radius = 0.5f;
float height_radius = 0.5f;
// How many segments along the azimuth range of an octant of the sphere.
std::size_t num_phi_segments = 4;
// How many segments along the elevation range of an octant of the sphere.
std::size_t num_theta_segments = 4;
// Shader used for the cylinder's surfaces.
std::string shader_name;
};
// Create a surface in the shape of a sphere with the parameters provided.
Model::Surface CreateSurface(const Sphere& sphere_params);
// Create the locator set for a sphere model with the parameters provided. All
// locators will be translated by the offset position.
Model::LocatorMap CreateLocators(
const Sphere& sphere_params,
const Eigen::Vector3f& offset = Eigen::Vector3f::Zero());
} // namespace geometry
} // namespace lab
} // namespace deepmind
#endif // DML_DEEPMIND_MODEL_GENERATION_GEOMETRY_SPHERE_H_
```
|
Paramdeep Sehdev () (born 21 August 1971, in Hammersmith) better known as Bobby Friction, is a DJ, television presenter and radio presenter from west London.
Early life
After studying Contemporary Arts at Nottingham Trent University, Friction's career as a DJ started in 1997 with residencies at the ‘Swaraj' night at the Blue Note, Hoxton, and the ‘Shaanti' club at Birmingham’s Custard Factory.
Broadcasting career
BBC Radio 1
Friction joined BBC Radio 1 in 2002 co-hosting Bobby Friction & Nihal Presents with DJ Nihal. In 2003 the show won a Sony Radio Academy Award in the Specialist Music category. In 2004 Friction and Nihal released a compilation album of music featured on the show.
BBC Asian Network
Friction joined BBC Asian Network in 2005, initially presenting the station's Saturday afternoon Album Chart Show and then The Mix on Sunday afternoons. In 2006 he began presenting a weeknightly show, Friction, showcasing new music by British Asian and South Asian artists. Friction moved to a daily drivetime show at the station in 2012, winning Best Radio Show at the Asian Media Awards in 2016. In 2018 his documentary Straight Outta Mumbai explored the history of Indian hip-hop.
Television
In 2004 Friction was one of the judging panel in Channel 4's series Bollywood Star. He went on to present documentaries for the channel including Generation 7/7 and The Countryside Sucks. He has also made appearances on The Wright Stuff (Channel 5), The Daily Politics (BBC2) and Sunday Morning Live (BBC1). In 2012 he appeared on Celebrity Mastermind, answering questions on the life and music of Prince.
Other work
Friction presented Friction on EVR, a weekly show on East Village Radio from 2012 and has been featured on streaming service Saavn. He has made regular appearances on BBC 6 Music, presenting a self-titled show, curating a tribute to Prince and sitting in for other presenters in their absence.
In 2015 Friction presented an Asian Network Night at the BBC Proms.
He has presented documentaries for BBC Radio 4 on topics such as pub culture in the West Midlands Punjabi community (so called Desi pubs), the aftermath of the assassination of Indira Gandhi in New Delhi in 1984, and filter bubbles in social media.
References
External links
Bobby Friction (BBC Asian Network)
BBC Asian Network Biography
Living people
1971 births
People from Hammersmith
British radio DJs
English Sikhs
BBC Asian Network presenters
BBC Radio 1 presenters
Alumni of Nottingham Trent University
|
Elisabeth Easther (born 1970) is a New Zealand actor, broadcaster, journalist and playwright. She played Carla Crozier on New Zealand soap opera Shortland Street from May 1995 to July 1996, and has since had a varied career in television, radio, journalism and playwriting. Her play Seed won the Adam NZ Play Award for Best Play in 2014.
Early life and education
Easther is the daughter of Shirley Maddock, New Zealand's first female television producer and pioneering broadcaster, and her husband Michael Easther, general practitioner. She attended Waikato Diocesan School for Girls.
Easther initially planned to study law at university, but ended up graduating from Victoria University of Wellington with a Bachelor of Arts in theatre and film. She subsequently attended drama school Toi Whakaari and graduated in 1992 with a Diploma in Performance.
Television and radio career
Easther's first notable acting role was in 1994 as the costume actor of a dinosaur called Victoria on the Australian children's television show Johnson and Friends.
Easther played the villainous character Carla Crozier on New Zealand soap opera Shortland Street, from May 1995 to July 1996. The character was notable for being the show's first murderer, and featured on one of the show's highest-rated episodes of all time, which aired on 31 May 1995 and was watched by nearly a quarter of the New Zealand population. In February 2021, Easther returned to Shortland Street to play Crozier (now Dr Carla Summerfield) on a short-term contract.
She has continued to act on television and in commercials, including playing the supporting role of Fran on the show Outrageous Fortune in series 3 and 4, and appearing on sketch comedy Funny Girls in 2016. Since March 2008 she has been a regular host on weekly radio show The Week That Was with fellow radio personality Te Radar for Radio New Zealand. Easther has also done voice-over work for the Power Rangers Jungle Fury television series and commercials for Whittaker's chocolate and Sky TV. She was the voice-over artist for the character The Maven in an update to the video game Path of Exile released in January 2021.
In 2018, Easther was the host of a remake of Islands in the Gulf, New Zealand's first documentary series, that had been produced and hosted by her mother in 1964. Easther visited islands in the Hauraki Gulf that her mother had visited and re-interviewed surviving interviewees. Reviewer Greg Bruce, writing in the NZ Herald, described it as a "a loving homage to the original", and "classic Kiwi heartland television set in an increasingly expensive bit of Auckland's waterscape".
Writing career
Easther has written a number of plays, including Raw and Salt. Her play Famous Flora, about dress designer and brothel-owner Flora MacKenzie, was staged at Auckland adult entertainment venue the White House in November 2014. The NZ Herald review praised Easther's creation of "two incarnations of Flora", both as an older "fiercely independent woman with a shrewdly realistic understanding of the human condition", and her younger self "as a youthful entrepreneur who has embraced the liberation of gender roles and is swept up in the live-for-the-moment spirit of the war years".
Easther's play Seed, about four women's experiences of pregnancy, won the Adam NZ Play Award for Best Play in 2014, as well as Best Play by a Woman Playwright. It was described by the judges as "highly entertaining, funny and sophisticated". It premiered at the Basement Theatre in Auckland in June 2014, and was subsequently performed at the Circa Theatre in Wellington from 17 January to 14 February 2015. The NZ Herald review described Seed as a "sophisticated, witty and very contemporary meditation on the timeless processes of procreation". In July 2018, a production toured New Zealand as part of an Arts On Tour NZ event, including performances in Auckland, at the BATS Theatre in Wellington, at the Isaac Theatre Royal in Christchurch and at a number of regional theatres.
Easther has written extensively as a journalist for the NZ Herald since 2012, as well as a book critic on radio and in print since 1993. She edited an anthology of fiction, non-fiction and poetry about New Zealand birds called Bird Words, published in 2017. The anthology features NZ authors such as Denis Glover, Hone Tuwhare, Janet Frame and Easther's mother, Shirley Maddock.
References
External links
Elisabeth Easther on IMDb
Revisiting Islands of the Gulf, interview with Easther, dated 23 February 2018
Michelle Hewitson interview: Elisabeth Easther, interview with Easther about her play Famous Flora, dated 8 November 2014
1970 births
Living people
New Zealand women dramatists and playwrights
21st-century New Zealand dramatists and playwrights
New Zealand soap opera actresses
New Zealand women editors
New Zealand magazine editors
Women magazine editors
New Zealand radio presenters
New Zealand women radio presenters
New Zealand women journalists
New Zealand journalists
Victoria University of Wellington alumni
Toi Whakaari alumni
People educated at Waikato Diocesan School
|
The right to sit in the United States refers to state and local laws guaranteeing workers the right to sit at work when standing is not necessary. The right to sit was a pillar of the early labor movement. Between 1881 and 1917, almost all states, the District of Columbia, and Puerto Rico had passed legislation concerning suitable seating for workers. These laws were enacted during the Progressive Era, spearheaded by women workers in the labor movement. The original texts of these laws almost always applied only to female workers. Most states with right to sit laws have subsequently amended their laws to include all workers regardless of sex. Some states allow seating accommodations for workers who are minors, disabled, or pregnant. There is no federal right to sit law. Disabled workers who qualify can request seating as a reasonable accommodation under the Americans with Disabilities Act. Pregnant workers can request seating under the Pregnant Workers Fairness Act.
Largely obscure and rarely enforced for over a century, right to sit laws have obtained new relevance following several high-profile lawsuits against major corporations in California and other states during the 2010s and 2020s. States with current, gender-neutral right to sit laws include California, Florida, Massachusetts, Montana, New Jersey, Oregon, and Wisconsin. Some states, including New York, Pennsylvania, and West Virginia, maintain gendered language referring to female workers only. Other states, such as Alabama, Arizona, Arkansas, Connecticut, Idaho, Kentucky, Maine, Maryland, Michigan, Missouri, Nebraska, Nevada, New Mexico New Hampshire, Virginia, and Washington, as well as the District of Columbia, repealed their right to sit laws between 1951 and 2015. Mississippi and Hawaii are the only states to have never had right to sit laws. Right to sit laws have been enacted at the local level in several cities, including Portland, Oregon and St. Louis, Missouri. Since 2019, politicians in several states, including Hawaii, Maryland, New York, and West Virginia, have proposed legislation to enact right to sit laws or amend them to be gender neutral.
History
In the late 1800s and early 1900s, during the Progressive Era, numerous states passed laws granting workers the right to suitable seats, specifically for women workers. According to a report by the sociologist Annie Marion MacLean, 22 states had passed suitable seating laws for women workers by 1897.
By 1915, only four states lacked a suitable seating law for women workers: Idaho, Mississippi, Nevada, and New Mexico. Principles of Labor Legislation, a foundational labor law text written in 1916 by John R. Commons and John Bertram Andrews, noted that an aspect of early 20th century labor reforms that is "[p]articularly striking is the special protection of women manifested in the laws on seats, toilets, and dressing-rooms." At the time, all right to sit legislation in the United States was gendered, applying specifically to women workers. They write that as "far back as the end of the 'seventies the dangers of constant standing for salesgirls were recognized, and it was urged that they be furnished seats and allowed to use them." They note that the first state to pass right to sit legislation for women workers was New York in 1881. By 1916, almost every state had such a right to sit law for women workers. Most state laws covered manufacturing and mechanical jobs, with some states covering virtually all jobs. Commons and Andrews claimed that these early right to sit laws were "of little real importance in protecting health...since it is practically impossible to see that employers and foremen allow the seats to be used even when provided."
By 1932, almost all of the states, the District of Columbia, and the territories of Puerto Rico and the Philippines, had passed laws requiring some form of suitable seating for women workers. The majority of states with right to sit laws specify that "suitable seats" be provided by employers and that workers be allowed to sit when standing is not required. The only state in the United States without a right to sit law by 1932 was Mississippi. North Dakota and New Mexico passed suitable sitting laws in 1922 and 1931, respectively.
The 1965 Handbook on Women Workers published by the Women's Bureau Bulletin recommends, as a health standard, "Suitable seats in adequate numbers; workers free to use them when not actively engaged in performance of duties that require a standing position, or at all times when nature of job permits."
After largely falling into obscurity for over a century, these suitable seating laws have gained greater recognition due to multiple lawsuits in the state of California and other states during the late 2010s and early 2020s. In 2019, Safeway was ordered to pay a fine of $12 million (~$ in ) after a Santa Clara County, California cashier was denied the right to sit.
Legislation by jurisdiction
Federal legislation
There is no federal law requiring suitable seating for all workers. Qualifying disabled workers can request seating as a reasonable accommodation under the Americans with Disabilities Act. Pregnant workers can request seating under the federal Pregnant Workers Fairness Act. The Occupational Safety and Health Administration (OSHA) does not have a specific standard that requires that all workers be provided with suitable seating. OSHA permits states to develop their own occupational safety standards, as long as the standards are "at least as effective as" federal standards.
Summary of legislation by jurisdiction
Note: in cases where it is unknown if the legislation has been repealed or is still active, a "No" under the column for gender neutrality indicates that the legislation was not gender neutral when first enacted. The bills may or may not have been updated to be gender neutral since they were passed.
Alabama
First passed in 1907, Alabama's right to sit law for women workers was repealed on April 21, 2015.
Alaska
As early as 1954, Alaska law stated that "Wherever possible women shall be seated at their work, with stools or chairs provided with a backrest and contribute to good posture; when required to stand at their work for prolonged periods, chairs shall be provided for their use during rest periods."
Arizona
Arizona first passed a right to sit law in 1912.
Arizona's General Construction Safety Code, 1957 prohibited women from working in mines, quarries, coal breakers, or other jobs that required standing. The law also stipulated that "Employers of females in any place or establishment must provide suitable seats, chairs, or benches and permit their use when females are not engaged in active duties."
Arkansas
Arkansas first passed a suitable seating law for women workers in 1913. The law stated that in any "manufacturing, mechanical, mercantile and other establishment where girls or women are employed, there shall be provided, and conveniently situated, seats sufficient to comfortably seat such girls or women, and during such times as they are not required by their duties to be upon their feet, they shall be allowed to use the seats."
Arkansas's right to sit law for women workers was repealed in 1997.
California
In 1911, the California State Legislature passed a provision requiring all employers in the mercantile industry to "provide suitable seats for all female employees" and to allow them to "use such seats when they are not engaged in the active duties of
their employment." Workers who are not "engaged in the active duties of their employment and the nature of the work requires standing, an adequate number of suitable seats shall be placed in reasonable proximity to the work area and employees shall be permitted to use such seats when it does not interfere with the performance of their duties."
The gendered provision in California's suitable seating law was struck down as discriminatory in federal court in 1974.
In 2016, the Supreme Court of California ruled in Kilby v. CVS Pharmacy, Inc. that workers whose jobs can be done while sitting down some or all of the time cannot be denied suitable seating. The class action lawsuit was brought by Nykeya Kilby, a CVS worker who was forced to stand while working.
In 2018, Walmart was accused of violating California law by refusing to allow their workers to sit. Walmart denied any wrongdoing, but agreed to pay $65 million in compensation to 100,000 current and former employees.
Colorado
Colorado first passed a right to sit law for women workers in 1885.
In 1913, Colorado labor law required employers of women to allow them to sit while working, stating that "Suitable seats for the use of the women shall be provided in all manufacturing, mechanical, or mercantile establishments, and their use shall be permitted when the women are not necessarily engaged in the active duties for which they are employed."
In 1970, the Colorado State Legislature appointed a committee to consider laws relating to women and children. The committee recommended the repeal of suitable seating laws for women workers because the law might discourage employers from hiring women. The committee's report claimed that such laws "are so "unduly" protective that employment discrimination against women has developed."
Connecticut
Beginning in 1893, Connecticut labor law stated that "[e]very person or company employing females in any mercantile, mechanical, or manufacturing establishment shall provide suitable seats for the use of all females so employed and shall permit the use of these seats by the females when they are not actively engaged in the duties for which they are employed." Employers who violated the law could be fined between $5 and $50.
In 2005, Connecticut repealed the right to sit law.
Delaware
In 1897, Delaware passed a right to sit law stating that "suitable seats should be provided for women employees In manufacturing" mechanical, or mercantile establishments and that the use of such seats 'should be permitted when the women were not necessarily engaged in the duties for which they were employed." Employers found to violate the law could be fined between $25 and $50.
Florida
Florida's right to sit law was passed in 1899.
Florida Statute 448.05 protects a worker's right to sit. Merchants and shop-owners in Florida who require their workers to stand when not necessary, fail to provide suitable seating at their own expense to workers, or prohibit workers from making use of suitable seating, can be found "guilty of a misdemeanor of the second degree." Florida is one of the few states to have a right to sit law that was always gender neutral.
Georgia
In 1889, Georgia labor law stated that it was a requirement for "persons or corporations employing females in manufacturing, mechanical or mercantile establishments to provide suitable seats, and permit their use by such females, when not necessarily engaged in the active duties for which they were employed."
Hawaii
In 2023, a right to sit bill (SB876) was introduced in the Hawaii State Legislature. The bill was sponsored by Stanley Chang, Karl Rhoads, Michelle Kidani, and Maile Shimabukuro. The bill passed the first reading and was referred to the Labor and Technology and Judiciary Committees in January, 2023.
Idaho
Idaho labor law formerly required "employers in establishments where females are employed to provide suitable seats and permit their use when not engaged in active duties for which they are employed." The law was first passed in 1913.
Idaho's right to sit law was repealed in 1985.
Illinois
Illinois first passed a suitable seating law for women workers in 1901.
Indiana
Indiana's right to sit law for women workers was passed in 1891.
As of 1917, Section 2 of Indiana Senate Bill No. 140 established that all employers in "any express or transportation company, laundry, hotel, public lodging house, place of amusement, restaurant, telephone, manufacturing, mechanical or mercantile establishments, employing any female person, shall provide suitable seats for all female employees and shall permit them to use such seats when same does not interfere with their employment."
Iowa
Iowa's right to sit law was first passed in 1892.
In 1922, Iowa labor law (Code 1939, sec. 1485) stated that "[a]ll employers of females in any mercantile or manufacturing business or occupation shall provide and maintain suitable seats when practicable for the use of such females at or beside the counter or work bench where employed, and permit the use thereof by such employees to such extent as the work engaged in may reasonably admit of." A 1922 report from the United States Department of Labor reports that such laws were difficult to enforce, "apparent from a study of their phraseology". Language such as "shall provide...when practicable" and "permit the use...to such extent as the work engaged in may reasonably admit of" are specifications which made enforcement difficult. The report claimed that seating arrangements at Iowa establishments in 1922 ranged from "workers stand all day" with "not a chair in sight" to "all of them sit all the time." The report states that either extreme of sitting or standing can produce fatigue, depending on occupation. Over 100 Iowa establishments were found to have no suitable seating, despite the law's requirement.In 1924, a revision to the Iowa law added workshops to the establishments covered by the right to sit and established a fine of not more than $10 (~$ in ) for employers found to violate the law.
As of 1970, Iowa law required "employers of females in workshops, mercantile, manufacturing or business establishments to provide suitable seats and permit their use when duties reasonably allow it."
Kansas
Kansas first passed a suitable seating law for women workers in 1901.
Kentucky
Kentucky first passed a right to sit law in 1912. Recodified in 1942, the law was repealed in 1972. Kentucky's legislation had only applied to women workers.
Louisiana
Louisiana first passed a suitable seating law for women workers in 1900.
Maine
First passed in 1911, Maine's right to sit law for women workers was repealed in 1975.
Maryland
One April 4, 1896, the State of Maryland enacted legislation stipulating that a chair or stool be provided to women workers in mercantile establishments. Maryland's state law was less comprehensive than the City of Baltimore's law, as the Maryland state law did not apply to manufacturing establishments. Maryland's right to sit law provided that in "every retail, jobbing, or wholesale drygoods store, notion, millinery or any other business where any female salespeople are employed, a seat shall be provided for each one of such female help, and they shall not be forbidden to avail themselves of any opportunity of rest not interfering with their duties." A 1904 report from the Maryland Bureau of Statistics and Information cited Maryland's right to sit law as an example of a law with a "remedial character...which, if properly enforced, might prove of great advantage to the masses of the people", however the report notes that right to sit laws are "oft-times lost sight of because of the multifarious duties of the Police Department and the impossibility of a proper enforcement of such laws."
In 1898, the City of Baltimore approved a law requiring that every "employer of females in any mercantile or manufacturing establishment in the City of Baltimore must provide and maintain suitable seats for the use of such employees." Employers who violated the law could be found guilty of a misdemeanor and fined $150 upon conviction. While the law was well-known, in 1912 Elizabeth Beardsley Butler described the law's provisions as "vague and unsatisfactory in wording", a defect she thought was common among many right to sit laws in the United States.
Baltimore's suitable seating law was in effect as of 1956.
In 2022, Maryland Delegate Vaughn Stewart introduced the Right to Sit Act (HB256). The measure was co-sponsored by delegates Marlon Amprey, Lorig Charkoudian, David Moon, Joseline Peña-Melnyk, and Sheila Ruth. The bill was withdrawn by the sponsor. The Maryland Women's Law Center said that the right to sit is often "unreasonably denied" and that the Right to Sit Act would be a "significant" improvement to workers' health and well-being while being an "inconsequential" change for employers. The Maryland State & DC AFL-CIO described the bill as a "simple measure" that could nonetheless be of legal importance in class action lawsuits. The bill was opposed by the Maryland Retailers Association. Delegate Stewart sponsored the Right to Sit Act (HB0017) a second time, with the bill receiving an unfavorable report from the Economic Matters committee in 2023. The bill was endorsed by the Kennedy Krieger Institute, which stated that suitable seating is an inclusive business practice that "increases employment outcomes for individuals with disabilities" and provides disabled people with greater employment opportunities they otherwise might not consider. The bill was opposed by the Maryland Chamber of Commerce, which stated that the law was "unnecessary" because disabled workers already have a right to sit under the ADA and because the bill's creation of a private right of action could subject "Maryland’s small businesses to additional liability that would add yet another degree of uncertainty in these already turbulent times."
Massachusetts
In 1882, Massachusetts labor law required that "Every person or corporation employing females in any manufacturing, mechanical or mercantile establishment in this Commonwealth shall provide suitable seats for the use of the females so employed", furthermore permitting the use of "such seats by them when they are not necessarily engaged in the active duties for which they are employed." Any employer found to have violated the right to sit could be fined between $10 and $30. The law was passed on 19 November 1881 and went into effect on 1 February 1882.
While the law was originally intended to protect "women and children", in 1974 the language of the law was amended to be gender neutral in order to protect all workers regardless of sex.
Massachusetts law currently states that "Employers shall provide suitable seats for the use of their employees and shall permit such employees to use such seats whenever they are not necessarily engaged in the active duties of their employment, and shall also provide for their use and permit them to use suitable seats while at work, except when the work cannot properly be performed in a sitting position or when such seats may reasonably be expected to result in an unsafe or hazardous working condition." Any employer who violates this law can be punished by a fine of between $50 and $200.
The Massachusetts Pregnant Workers Fairness Act grants pregnant workers the right to the "acquisition or modification of equipment or seating", which is considered a reasonable accommodation for pregnant workers. An employer cannot request medical documentation if a pregnant worker makes requests for seating.
Michigan
First passed in 1883, Michigan's right to sit law for women workers was repealed in 1975. The law had stated that "[n]o employer of female help shall neglect or refuse to provide seats as provided in this act, nor shall make any rules, orders or regulations in their shops, stores or other places of business requiring females to remain standing when not necessarily in service or labor therein."
Minnesota
Minnesota passed a right to sit law for women workers in 1887. The law stated that it "shall be the duty of all employers of females in any mercantile or manufacturing business or occupation to provide and maintain suitable seats for the use of such female employes, and to permit the use of such seats by such employes to such an extent as may be reasonable for the preservation of their health."
Minnesota's right to sit law remained in effect as of 1967.
Mississippi
By 1932, Mississippi was the only state in the United States that didn't have some form of right to sit law. By December of 1944, Mississippi still had no right to sit law.
Missouri
Missouri passed a right to sit law in 1885. The law was repealed on August 28, 2007.
The St. Louis Code of Ordinances mandates "all employers of females in any mercantile business or occupation to provide and maintain suitable seats for the use of female employees, at or beside the counter or work bench where employed, and to permit the use of seats by employees to an extent as may be reasonable for the preservation of their health." Any employer found to have violated this provision is guilty of a misdemeanor.
Montana
Montana first passed a right to sit law in 1885. The law originally applied to women workers only.
Montana labor law states that employers "shall provide suitable seats for all employees and shall permit them to use such seats when they are not employed in the active duties of their employment." Employers found violating this provision can be found guilty of a misdemeanor and upon conviction fined between $50 and $200, imprisoned in the county jail between 10 and 60 days, or be both fined and imprisoned.
Nebraska
Nebraska first passed a suitable seating law for women workers in 1883. The law applied to women workers in stores, offices, and educational institutions. In 1899, without reference to the 1883 law, another law was passed granting the right to sit for women workers in manufacturing, mercantile, and mechanical establishments, as well as restaurant and hotel workers. A 1913 amendment to the 1883 law included factory workers. In 1919, an amendment to the 1913 act extended the right to sit to all women workers.
Nebraska's suitable seating law was repealed on April 28, 1969. Legislative Bill 411 to "Repeal Preference Statutes Based on Sex" was introduced by state legislator Fern Hubbard Orme.
The Nebraska Fair Employment Practice Act lists sitting as a reasonable accommodation "with respect to pregnancy, childbirth, or related medical conditions".
Nevada
On February 14, 1917, Nevada passed a right to sit law for women workers. The legislation stated that an "employer in any manufacturing, mechanical, or mercantile establishment, laundry, hotel, or restaurant, or other establishment, employing any female, shall provide suitable seats for all female employees, and shall permit them to use such seats when they are not engaged in the active duties of their employment."
In 1975, the suitable seating provision in Chapter 609 of the Nevada Revised Statutes was repealed.
New Hampshire
New Hampshire labor law formerly required that suitable seating be provided by employers to women workers in all manufacturing, mechanical, or mercantile establishments, and the use of such seats must be permitted.
New Hampshire's right to sit law was repealed in 1985.
New Jersey
New Jersey first passed a right to sit law in 1882.
The right to sit law in New Jersey was made gender neutral in 1980.
New Jersey labor law states that all employers "in any manufacturing, mechanical or mercantile establishment or in the services and operations incident to any commercial employment shall provide and maintain suitable seats conveniently situated and shall permit the use of such seats by employees at all times except when necessarily engaged in the discharge of duties that cannot properly be performed in a sitting position."
New Mexico
New Mexico labor law formerly stated that all employers with women workers "shall provide and furnish suitable seats, to be used by such employees when not engaged in the active duties of their employment, and shall give notice to all such female employees by posting in a conspicuous place, on the premises of such employment in letters not less than one inch in height, that all such female employees will be permitted to use seats when not so engaged." Employers found violating the law can be found guilty of a misdemeanor and fined between $50 and $200 per violation.
New Mexico's suitable seating law was repealed in 2009.
New York
In 1881, New York became the first state in the US to pass right to sit legislation for women workers. New York labor law states that a "sufficient number of suitable seats, with backs where practicable, shall be provided and maintained in every factory, mercantile establishment, freight or passenger elevator, hotel and restaurant for female employees who shall be allowed to use the seats to such an extent as may be reasonable for the preservation of their health." Factory workers "shall be allowed to use such seats whenever they are engaged in work which can be properly
performed in a sitting posture", while workers in the mercantile industry must be provided one seat for every three workers and "if the duties of such employees are to be performed principally in front of a counter, table, desk or fixture, such seats shall be placed in front thereof" or behind as needed.
In 2019-2020, New York Assembly Bill A7649 was proposed to amend the state's right to sit law to cover all workers regardless of sex.
In 2022, New York State Senators Rachel May and Alessandra Biaggi proposed the "Standing is Tiring (SIT) Act" that would require suitable seating for all workers regardless of sex. The bill is in the New York Senate Labor Committee as of 2023.
North Carolina
North Carolina first passed a right to sit law in 1909. The law stated that "persons, firms, or corporations who employ females in a store, shop, office, or manufacturing establishment, as clerks, operators, or helpers in any business, trade, or occupation carried on or operated in the state of North Carolina, shall be required to procure and provide proper and suitable seats for all such females, and shall permit the use of such seats, rests, or stools as may be necessary, and shall not make any rules, regulations, or orders preventing the use of such seats, stools or rests when any such female employee or employees are not actively employed or engaged in their work in such business or employment." Any employer found to have violated the law could be found guilty of a misdemeanor and upon conviction fined between $25 and $100 per the discretion of the court.
North Dakota
North Dakota passed a suitable seating law for women workers in 1922, one of the last states to pass such legislation.
Ohio
In Jones Co. v. Walker, decided on March 9, 1971, Ohio's gendered provisions in its right to sit law were ruled by the Franklin County Court of Common Pleas to be a form of sex discrimination favoring female workers over male workers, thereby being a violation of Title VII of the Civil Rights Act of 1964.
Ohio's right to sit law was repealed in 1982.
Oklahoma
Oklahoma first passed a right to sit law in 1908.
Section 3732 of Oklahoma's Revised Laws of 1910 stated that child workers were allowed the right to sit and that "the employer must provide suitable seats and permit their use so far as the nature of the work allows."
Oklahoma's right to sit law was made gender neutral in 1991.
Oregon
Oregon passed a right to sit law for women workers on 19 February 1903, due to activism from the labour movement.
Oregon labor law guarantees the right to suitable seating for minors while working. Minors in cannery operations are granted one seat for every three minor workers. Suitable seating is defined as "convenient, comfortable and safe seats where the work is such that minors may sit while working."
The Oregon Administrative Rules states that every "employer shall provide to each employee when required by the nature of the work, suitable seats, suitable tables, and suitable work benches." Suitable seating is defined as "convenient, comfortable and safe seats where the work is such that employees may sit while working." In cannery operations, workers must be granted one seat for every three workers. Suitable tales and benches are defined by the law as "tables and work benches so constructed as to give the greatest possible comfort and convenience to employees where the nature of the work and the safety and convenience of the employee requires a bench or table."
The City of Portland has a local law stipulating that every "employer in any manufacturing or mercantile establishment, store, department store, laundry, hotel or restaurant or other establishments shall provide for all employees a sufficient number of suitable seats, which in no case shall be less than one seat for each three employees, and shall permit them to use such seats when such employees are not engaged in active duties of their employment."
Pennsylvania
Pennsylvania first passed a suitable seating law for women workers in 1887. The current suitable seating law, dating to 1917, states that all persons "employing or permitting females to work in any establishment shall provide suitable seats for their use conveniently assessable while they are working, and shall maintain and keep them there, and shall permit the reasonable use thereof by such females. At least one seat shall be provided for every five females employed or permitted to work."
Rhode Island
Rhode Island first passed a suitable seating law for women workers in 1894.
Rhode Island law lists seating as a reasonable accommodation for pregnant workers.
South Carolina
South Carolina first passed a suitable seating law for women workers in 1899.
South Dakota
South Dakota labor law guarantees the right to suitable seating for child workers, stating that "any mercantile or manufacturing establishment, hotel, or restaurant where children are employed, suitable seats shall be maintained in the room where such employees work and such use thereof permitted as may be necessary for preservation of the health of such employees." Employers found guilty of violating this provision can be convicted of a Class 2 misdemeanor.
Tennessee
Tennessee first passed a suitable seating law for women workers in 1913.
Texas
In 1913, Texas "required that suitable seats be provided for women employees in any manufacturing, mechanical, or mercantile establishment, workshop, laundry, printing office, dressmaking or millinery establishment, hotel, restaurant, theater; telegraph or telephone establishment and office, or any other establishment. The use of these seats was to be permitted when the women were not engaged in the duties of their employment." The law exempted women stenographers and pharmacists and did not apply to residents of cities with a population under 5,000. Employers who violated the law could be fined between $50 and $200, be imprisoned from 5 to 30 days, or be both fined and imprisoned. A subsequent legislative act in 1915 further covered "any factory,
mine, mill, workshop, mechanical or mercantile establishment, laundry, hotel, restaurant, rooming' house, theater or moving-picture show, barber shop, telegraph, telephone, or other office, express or transportation company, any State institution, or any other establishment, institution, or enterprise where women are employed." Employers were required to furnish the seating as well as post notices alerting workers of their right to sit. The 1915 law further exempted telegraph and telephone company workers and mercantile workers in rural areas with a population under 3,000.
Utah
Utah first passed a suitable seating law for women workers in 1897.
Vermont
Vermont first passed a suitable seating law in 1915. The law stated that "[s]eats must be provided in mercantile establishments, stores, shops, hotels and restaurants where women or girls are employed, and the use of these seats must be permitted".
Virginia
In Virginia, some of the earliest labor laws were passed to protect women workers. 1897-98 Va. Acts 45 required employers to grant women workers suitable seating when not performing work that necessitates standing. Virginia's law stated that "[c]hairs, stools, or other suitable seats shall be maintained in all factories, shops, mills, laundries, mercantile and manufacturing establishments, except fruit and vegetable canning factories, for the use of female employees therein to the number of at least one seat for every three females employed, and the use thereof by such employees shall be allowed at such times and
to such extent as may be necessary for the preservation of their health. Such seats shall be placed where the work of such females is to be principally performed, whether in front of or behind a counter, table, desk, or other fixture." An employer found to have violated the law could be found guilty of a misdemeanor and upon conviction be fined up to $25 and costs determined by the discretion of the court.
Virginia's suitable seating law was repealed in 1974.
Washington, D.C.
In 1895, the United States Congress passed a law for the District of Columbia "providing that all persons who employ women in stores, shops, offices or manufactories as clerks, assistants, operatives, or helpers in any business, trade, or occupation are required to procure and provide proper and suitable seats for all their women employees and to permit the use of these seats when the women are not actively employed in their work."
As of 1961, Washington, D.C., required employers of women to "provide proper and suitable seats for them, and to permit their use when not actively engaged in duties."
By 1998, the law stipulated for all employers "to provide and procure proper and suitable seats for all such employees" and that employers must not make "any rules, regulations or orders preventing the use of such stools or seats when any such employees are not actively employed in their work." (D.C. Code §36-901.)
Washington, D.C.'s right to sit law was made gender neutral in 1976. It was repealed by an act of Congress in 2004.
The 2014 Protecting Pregnant Workers Fairness Act states that "Purchasing or modifying work equipment, such as chairs" is a reasonable accommodation for pregnant workers in DC.
Washington state
Washington's right to sit law for women workers was passed in 1911. Washington labor law required that "[e]very employer in establishments where females are employed shall provide suitable seats for them and permit their use." Washington's law was repealed in 1973.
Washington state law states that "Providing seating or allowing the employee to sit more frequently if her job requires her to stand" is a "Reasonable accommodation" for pregnant workers.
West Virginia
West Virginia labor law states that every "person, firm or corporation employing females in any factory, mercantile establishment, mill or workshop in this state shall provide a reasonable number of suitable seats for the use of such female employees, and shall permit the use of such seats by them when they are not necessarily engaged in active duties for which they are employed, and shall permit the use of such seats at all times when such use would not actually and necessarily interfere with the proper discharge of the duties of such employees, and, where practicable, such seats shall be made permanent fixtures and may be so constructed or adjusted that, when not in use, they will not obstruct such female employee when engaged in the performance of her duties."
In 2020, West Virginia Delegate Sean Hornbuckle introduced House Bill 4909 to amend West Virginia's right to sit law to include all workers regardless of sex or occupation.
Wisconsin
The Wisconsin Legislature first passed a right to sit law in 1899.
In 1942, the law stated that "[e]very person or corporation employing females in any manufacturing, mechanical or mercantile establishment in the state of Wisconsin shall provide suitable seats for the females so employed, and shall permit the use of such seats by them when they are not necessarily engaged in the active duties for which they are employed." Any employer convicted of violating this provision could be found guilty of a misdemeanor and fined between $10 and $30.
Wisconsin's right to sit law became gender neutral in 1975.
The text of the law was amended again in 1997 by Assembly Bill 683, with minor changes to the wording.
The current Wisconsin law mandating suitable sitting does not contain gendered language referring to female workers, stating that employers "in any manufacturing, mechanical or mercantile establishment in this state shall provide suitable seats for its employees, and shall permit the use of those seats by its employees when the employees are not necessarily engaged in the active duties for which they are employed." The fine for an employer who violates the provision remains between $10 and $30.
Wyoming
In 1901, Wyoming passed labor legislation (Acts 1901, C. 33) stipulating that suitable seating be "required in manufacturing, mechanical or mercantile establishments."
Accommodations
Federal law protects the right to sit for pregnant workers and disabled workers who qualify. There is no federal law granting a right to sit for minor workers. Supporters of right to sit laws note that pregnant workers and disabled workers may not wish to disclose to an employer that they are pregnant or disabled, and therefore right to sit laws also protect the privacy of those workers.
Disabled workers
In 2019, Crossmark, Inc. of Texas was ordered by the Equal Employment Opportunity Commission (EEOC) to pay $2.65 million in a disability settlement. The business restricted workers to only being allowed to sit for 10 minutes at a time every 2 hours, regardless of medical condition or disability. The EEOC ruled that these restrictions violated the Americans with Disabilities Act of 1990 (ADA), which requires employers to provide reasonable accommodations to disabled workers.
Some states grant seating accommodations for disabled workers.
Minor workers
Some states have suitable seating laws that only apply to minors, including Oklahoma, Oregon, and South Dakota.
Pregnant workers
The Pregnant Workers Fairness Act of 2023 grants pregnant workers a right to seating accommodations under federal law.
Laws in some jurisdictions state that sitting is a reasonable accommodation for pregnant workers and workers with pregnancy-related or childbirth-related medical conditions, including Massachusetts, Nebraska, Rhode Island, Washington state, and Washington, D.C.
Criticism of gendered provisions
Professor Carol Louw of the University of South Africa claims that female-specific provisions in right to sit laws "reinforced stereotypes regarding women's frailty." Law professors Sacha Prechal and Noreen Burrows argued against sex-specific provisions in right to sit laws because "working conditions should be as safe and as pleasant as possible for all employees" regardless of sex.
Opposition to right to sit laws
Many employers, often in retail, require workers to stand for the duration of their shift due to the belief that sitting is inefficient, looks unprofessional, or is unsuitable for the nature of the work.
The American Tort Reform Association's "Judicial Hellholes" program has denounced California's suitable seating law for allegedly protecting "lazy cashiers and their opportunistic lawyers".
Some critics of New York's "Standing is Tiring (SIT) Act" have ridiculed the proposed law by comparing it to a scene from the Seinfeld episode The Maestro, where George Costanza provides a rocking chair for a security guard who must stand for the duration of his shift. The chair is so comfortable that the guard falls asleep and the store is robbed. New York State Assembly member Karines Reyes, a supporter of the bill, responded by saying that the jokes were "funny", but the law would be reasonably applied.
See also
High heel policy
Potty parity in the United States
Right to sit
References
External links
"I Thought It Was A Joke": Store Manager Writes Up An Employee, Says When You're Sitting On A Chair, It's Not To Lounge Around, Bored Panda
‘Not for employee use’: why are US retail workers being denied chairs?, The Guardian
'Some managers just want to see workers struggle': Former Aldi cashier says he was written-up for sitting in his chair 'too comfortably', The Daily Dot
The Right to Sit Act | Dumbest Bill in America, "Mark and the Millenials", YouTube
Ageism
Disability law in the United States
History of retail in the United States
Labor movement in the United States
Labor history of the United States
Labor rights
Legal issues in pregnancy
Manufacturing in the United States
Occupational safety and health law
Privacy law in the United States
Progressive Era in the United States
Right to sit
Sexism in the United States
Women's rights in the United States
Working-class feminism
Youth rights in the United States
|
Far Away from Home may refer to:
Far Away from Home, a 1977 film nominated for 14th Golden Horse Awards
"Far Away from Home Blues", a song by Dewey Segura (1902–1987)
"Far Away from Home", a song by Mel Tormé and Margaret Whiting on the 1961 album Broadway, Right Now!
"Far Away from Home", a song by Groove Coverage from the 2002 album Covergirl
"Far Away from Home", a song by will.i.am featuring Nicole Scherzinger from the 2013 album #willpower
"Far Away from Home", a song by Cuco from the 2019 album Para Mi
"Far Away from Home", a 2020 song by Sam Feldt with Vize featuring Leony
|
```c
/* Scan linker error messages for missing template instantiations and provide
them.
Contributed by Jason Merrill (jason@cygnus.com).
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
Software Foundation; either version 2, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
for more details.
along with GCC; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA. */
#include "config.h"
#include "system.h"
#include "intl.h"
#include "obstack.h"
#include "hashtab.h"
#include "demangle.h"
#include "collect2.h"
#define MAX_ITERATIONS 17
/* Defined in the automatically-generated underscore.c. */
extern int prepends_underscore;
static int tlink_verbose;
/* Hash table boilerplate for working with htab_t. We have hash tables
for symbol names, file names, and demangled symbols. */
typedef struct symbol_hash_entry
{
const char *key;
struct file_hash_entry *file;
int chosen;
int tweaking;
int tweaked;
} symbol;
typedef struct file_hash_entry
{
const char *key;
const char *args;
const char *dir;
const char *main;
int tweaking;
} file;
typedef struct demangled_hash_entry
{
const char *key;
const char *mangled;
} demangled;
/* Hash and comparison functions for these hash tables. */
static int hash_string_eq PARAMS ((const void *, const void *));
static hashval_t hash_string_hash PARAMS ((const void *));
static int
hash_string_eq (s1_p, s2_p)
const void *s1_p;
const void *s2_p;
{
const char *const *s1 = (const char *const *) s1_p;
const char *s2 = (const char *) s2_p;
return strcmp (*s1, s2) == 0;
}
static hashval_t
hash_string_hash (s_p)
const void *s_p;
{
const char *const *s = (const char *const *) s_p;
return (*htab_hash_string) (*s);
}
static htab_t symbol_table;
static struct symbol_hash_entry * symbol_hash_lookup PARAMS ((const char *,
int));
static struct file_hash_entry * file_hash_lookup PARAMS ((const char *));
static struct demangled_hash_entry *
demangled_hash_lookup PARAMS ((const char *, int));
static void symbol_push PARAMS ((symbol *));
static symbol * symbol_pop PARAMS ((void));
static void file_push PARAMS ((file *));
static file * file_pop PARAMS ((void));
static void tlink_init PARAMS ((void));
static int tlink_execute PARAMS ((const char *, char **, const char *,
const char *));
static char * frob_extension PARAMS ((const char *, const char *));
static char * obstack_fgets PARAMS ((FILE *, struct obstack *));
static char * tfgets PARAMS ((FILE *));
static char * pfgets PARAMS ((FILE *));
static void freadsym PARAMS ((FILE *, file *, int));
static void read_repo_file PARAMS ((file *));
static void maybe_tweak PARAMS ((char *, file *));
static int recompile_files PARAMS ((void));
static int read_repo_files PARAMS ((char **));
static void demangle_new_symbols PARAMS ((void));
static int scan_linker_output PARAMS ((const char *));
/* Look up an entry in the symbol hash table. */
static struct symbol_hash_entry *
symbol_hash_lookup (string, create)
const char *string;
int create;
{
PTR *e;
e = htab_find_slot_with_hash (symbol_table, string,
(*htab_hash_string) (string),
create ? INSERT : NO_INSERT);
if (e == NULL)
return NULL;
if (*e == NULL)
{
struct symbol_hash_entry *v;
*e = v = xcalloc (1, sizeof (*v));
v->key = xstrdup (string);
}
return *e;
}
static htab_t file_table;
/* Look up an entry in the file hash table. */
static struct file_hash_entry *
file_hash_lookup (string)
const char *string;
{
PTR *e;
e = htab_find_slot_with_hash (file_table, string,
(*htab_hash_string) (string),
INSERT);
if (*e == NULL)
{
struct file_hash_entry *v;
*e = v = xcalloc (1, sizeof (*v));
v->key = xstrdup (string);
}
return *e;
}
static htab_t demangled_table;
/* Look up an entry in the demangled name hash table. */
static struct demangled_hash_entry *
demangled_hash_lookup (string, create)
const char *string;
int create;
{
PTR *e;
e = htab_find_slot_with_hash (demangled_table, string,
(*htab_hash_string) (string),
create ? INSERT : NO_INSERT);
if (e == NULL)
return NULL;
if (*e == NULL)
{
struct demangled_hash_entry *v;
*e = v = xcalloc (1, sizeof (*v));
v->key = xstrdup (string);
}
return *e;
}
/* Stack code. */
struct symbol_stack_entry
{
symbol *value;
struct symbol_stack_entry *next;
};
struct obstack symbol_stack_obstack;
struct symbol_stack_entry *symbol_stack;
struct file_stack_entry
{
file *value;
struct file_stack_entry *next;
};
struct obstack file_stack_obstack;
struct file_stack_entry *file_stack;
static void
symbol_push (p)
symbol *p;
{
struct symbol_stack_entry *ep = (struct symbol_stack_entry *) obstack_alloc
(&symbol_stack_obstack, sizeof (struct symbol_stack_entry));
ep->value = p;
ep->next = symbol_stack;
symbol_stack = ep;
}
static symbol *
symbol_pop ()
{
struct symbol_stack_entry *ep = symbol_stack;
symbol *p;
if (ep == NULL)
return NULL;
p = ep->value;
symbol_stack = ep->next;
obstack_free (&symbol_stack_obstack, ep);
return p;
}
static void
file_push (p)
file *p;
{
struct file_stack_entry *ep;
if (p->tweaking)
return;
ep = (struct file_stack_entry *) obstack_alloc
(&file_stack_obstack, sizeof (struct file_stack_entry));
ep->value = p;
ep->next = file_stack;
file_stack = ep;
p->tweaking = 1;
}
static file *
file_pop ()
{
struct file_stack_entry *ep = file_stack;
file *p;
if (ep == NULL)
return NULL;
p = ep->value;
file_stack = ep->next;
obstack_free (&file_stack_obstack, ep);
p->tweaking = 0;
return p;
}
/* Other machinery. */
/* Initialize the tlink machinery. Called from do_tlink. */
static void
tlink_init ()
{
const char *p;
symbol_table = htab_create (500, hash_string_hash, hash_string_eq,
NULL);
file_table = htab_create (500, hash_string_hash, hash_string_eq,
NULL);
demangled_table = htab_create (500, hash_string_hash, hash_string_eq,
NULL);
obstack_begin (&symbol_stack_obstack, 0);
obstack_begin (&file_stack_obstack, 0);
p = getenv ("TLINK_VERBOSE");
if (p)
tlink_verbose = atoi (p);
else
{
tlink_verbose = 1;
if (vflag)
tlink_verbose = 2;
if (debug)
tlink_verbose = 3;
}
}
static int
tlink_execute (prog, argv, outname, errname)
const char *prog;
char **argv;
const char *outname;
const char *errname;
{
collect_execute (prog, argv, outname, errname);
return collect_wait (prog);
}
static char *
frob_extension (s, ext)
const char *s;
const char *ext;
{
const char *p = strrchr (s, '/');
if (! p)
p = s;
p = strrchr (p, '.');
if (! p)
p = s + strlen (s);
obstack_grow (&temporary_obstack, s, p - s);
return obstack_copy0 (&temporary_obstack, ext, strlen (ext));
}
static char *
obstack_fgets (stream, ob)
FILE *stream;
struct obstack *ob;
{
int c;
while ((c = getc (stream)) != EOF && c != '\n')
obstack_1grow (ob, c);
if (obstack_object_size (ob) == 0)
return NULL;
obstack_1grow (ob, '\0');
return obstack_finish (ob);
}
static char *
tfgets (stream)
FILE *stream;
{
return obstack_fgets (stream, &temporary_obstack);
}
static char *
pfgets (stream)
FILE *stream;
{
return xstrdup (tfgets (stream));
}
/* Real tlink code. */
/* Subroutine of read_repo_file. We are reading the repo file for file F,
which is coming in on STREAM, and the symbol that comes next in STREAM
is offerred, chosen or provided if CHOSEN is 0, 1 or 2, respectively.
XXX "provided" is unimplemented, both here and in the compiler. */
static void
freadsym (stream, f, chosen)
FILE *stream;
file *f;
int chosen;
{
symbol *sym;
{
const char *name = tfgets (stream);
sym = symbol_hash_lookup (name, true);
}
if (sym->file == NULL)
{
/* We didn't have this symbol already, so we choose this file. */
symbol_push (sym);
sym->file = f;
sym->chosen = chosen;
}
else if (chosen)
{
/* We want this file; cast aside any pretender. */
if (sym->chosen && sym->file != f)
{
if (sym->chosen == 1)
file_push (sym->file);
else
{
file_push (f);
f = sym->file;
chosen = sym->chosen;
}
}
sym->file = f;
sym->chosen = chosen;
}
}
/* Read in the repo file denoted by F, and record all its information. */
static void
read_repo_file (f)
file *f;
{
char c;
FILE *stream = fopen (f->key, "r");
if (tlink_verbose >= 2)
fprintf (stderr, _("collect: reading %s\n"), f->key);
while (fscanf (stream, "%c ", &c) == 1)
{
switch (c)
{
case 'A':
f->args = pfgets (stream);
break;
case 'D':
f->dir = pfgets (stream);
break;
case 'M':
f->main = pfgets (stream);
break;
case 'P':
freadsym (stream, f, 2);
break;
case 'C':
freadsym (stream, f, 1);
break;
case 'O':
freadsym (stream, f, 0);
break;
}
obstack_free (&temporary_obstack, temporary_firstobj);
}
fclose (stream);
if (f->args == NULL)
f->args = getenv ("COLLECT_GCC_OPTIONS");
if (f->dir == NULL)
f->dir = ".";
}
/* We might want to modify LINE, which is a symbol line from file F. We do
this if either we saw an error message referring to the symbol in
question, or we have already allocated the symbol to another file and
this one wants to emit it as well. */
static void
maybe_tweak (line, f)
char *line;
file *f;
{
symbol *sym = symbol_hash_lookup (line + 2, false);
if ((sym->file == f && sym->tweaking)
|| (sym->file != f && line[0] == 'C'))
{
sym->tweaking = 0;
sym->tweaked = 1;
if (line[0] == 'O')
line[0] = 'C';
else
line[0] = 'O';
}
}
/* Update the repo files for each of the object files we have adjusted and
recompile.
XXX Should this use collect_execute instead of system? */
static int
recompile_files ()
{
file *f;
putenv (xstrdup ("COMPILER_PATH="));
putenv (xstrdup ("LIBRARY_PATH="));
while ((f = file_pop ()) != NULL)
{
char *line, *command;
FILE *stream = fopen (f->key, "r");
const char *const outname = frob_extension (f->key, ".rnw");
FILE *output = fopen (outname, "w");
while ((line = tfgets (stream)) != NULL)
{
switch (line[0])
{
case 'C':
case 'O':
maybe_tweak (line, f);
}
fprintf (output, "%s\n", line);
}
fclose (stream);
fclose (output);
rename (outname, f->key);
obstack_grow (&temporary_obstack, "cd ", 3);
obstack_grow (&temporary_obstack, f->dir, strlen (f->dir));
obstack_grow (&temporary_obstack, "; ", 2);
obstack_grow (&temporary_obstack, c_file_name, strlen (c_file_name));
obstack_1grow (&temporary_obstack, ' ');
obstack_grow (&temporary_obstack, f->args, strlen (f->args));
obstack_1grow (&temporary_obstack, ' ');
command = obstack_copy0 (&temporary_obstack, f->main, strlen (f->main));
if (tlink_verbose)
fprintf (stderr, _("collect: recompiling %s\n"), f->main);
if (tlink_verbose >= 3)
fprintf (stderr, "%s\n", command);
if (system (command) != 0)
return 0;
read_repo_file (f);
obstack_free (&temporary_obstack, temporary_firstobj);
}
return 1;
}
/* The first phase of processing: determine which object files have
.rpo files associated with them, and read in the information. */
static int
read_repo_files (object_lst)
char **object_lst;
{
char **object = object_lst;
for (; *object; object++)
{
const char *p;
file *f;
/* Don't bother trying for ld flags. */
if (*object[0] == '-')
continue;
p = frob_extension (*object, ".rpo");
if (! file_exists (p))
continue;
f = file_hash_lookup (p);
read_repo_file (f);
}
if (file_stack != NULL && ! recompile_files ())
return 0;
return (symbol_stack != NULL);
}
/* Add the demangled forms of any new symbols to the hash table. */
static void
demangle_new_symbols ()
{
symbol *sym;
while ((sym = symbol_pop ()) != NULL)
{
demangled *dem;
const char *p = cplus_demangle (sym->key, DMGL_PARAMS | DMGL_ANSI);
if (! p)
continue;
dem = demangled_hash_lookup (p, true);
dem->mangled = sym->key;
}
}
/* Step through the output of the linker, in the file named FNAME, and
adjust the settings for each symbol encountered. */
static int
scan_linker_output (fname)
const char *fname;
{
FILE *stream = fopen (fname, "r");
char *line;
while ((line = tfgets (stream)) != NULL)
{
char *p = line, *q;
symbol *sym;
int end;
while (*p && ISSPACE ((unsigned char) *p))
++p;
if (! *p)
continue;
for (q = p; *q && ! ISSPACE ((unsigned char) *q); ++q)
;
/* Try the first word on the line. */
if (*p == '.')
++p;
if (!strncmp (p, USER_LABEL_PREFIX, strlen (USER_LABEL_PREFIX)))
p += strlen (USER_LABEL_PREFIX);
end = ! *q;
*q = 0;
sym = symbol_hash_lookup (p, false);
/* Some SVR4 linkers produce messages like
ld: 0711-317 ERROR: Undefined symbol: .g__t3foo1Zi
*/
if (! sym && ! end && strstr (q + 1, "Undefined symbol: "))
{
char *p = strrchr (q + 1, ' ');
p++;
if (*p == '.')
p++;
if (!strncmp (p, USER_LABEL_PREFIX, strlen (USER_LABEL_PREFIX)))
p += strlen (USER_LABEL_PREFIX);
sym = symbol_hash_lookup (p, false);
}
if (! sym && ! end)
/* Try a mangled name in quotes. */
{
const char *oldq = q + 1;
demangled *dem = 0;
q = 0;
/* First try `GNU style'. */
p = strchr (oldq, '`');
if (p)
p++, q = strchr (p, '\'');
/* Then try "double quotes". */
else if (p = strchr (oldq, '"'), p)
p++, q = strchr (p, '"');
if (p)
{
/* Don't let the strstr's below see the demangled name; we
might get spurious matches. */
p[-1] = '\0';
/* powerpc64-linux references .foo when calling function foo. */
if (*p == '.')
p++;
}
/* We need to check for certain error keywords here, or we would
mistakenly use GNU ld's "In function `foo':" message. */
if (q && (strstr (oldq, "ndefined")
|| strstr (oldq, "nresolved")
|| strstr (oldq, "nsatisfied")
|| strstr (oldq, "ultiple")))
{
*q = 0;
dem = demangled_hash_lookup (p, false);
if (dem)
sym = symbol_hash_lookup (dem->mangled, false);
else
{
if (!strncmp (p, USER_LABEL_PREFIX,
strlen (USER_LABEL_PREFIX)))
p += strlen (USER_LABEL_PREFIX);
sym = symbol_hash_lookup (p, false);
}
}
}
if (sym && sym->tweaked)
{
fclose (stream);
return 0;
}
if (sym && !sym->tweaking)
{
if (tlink_verbose >= 2)
fprintf (stderr, _("collect: tweaking %s in %s\n"),
sym->key, sym->file->key);
sym->tweaking = 1;
file_push (sym->file);
}
obstack_free (&temporary_obstack, temporary_firstobj);
}
fclose (stream);
return (file_stack != NULL);
}
/* Entry point for tlink. Called from main in collect2.c.
Iteratively try to provide definitions for all the unresolved symbols
mentioned in the linker error messages.
LD_ARGV is an array of arguments for the linker.
OBJECT_LST is an array of object files that we may be able to recompile
to provide missing definitions. Currently ignored. */
void
do_tlink (ld_argv, object_lst)
char **ld_argv, **object_lst ATTRIBUTE_UNUSED;
{
int exit = tlink_execute ("ld", ld_argv, ldout, lderrout);
tlink_init ();
if (exit)
{
int i = 0;
/* Until collect does a better job of figuring out which are object
files, assume that everything on the command line could be. */
if (read_repo_files (ld_argv))
while (exit && i++ < MAX_ITERATIONS)
{
if (tlink_verbose >= 3)
{
dump_file (ldout, stdout);
dump_file (lderrout, stderr);
}
demangle_new_symbols ();
if (! scan_linker_output (ldout)
&& ! scan_linker_output (lderrout))
break;
if (! recompile_files ())
break;
if (tlink_verbose)
fprintf (stderr, _("collect: relinking\n"));
exit = tlink_execute ("ld", ld_argv, ldout, lderrout);
}
}
dump_file (ldout, stdout);
dump_file (lderrout, stderr);
unlink (ldout);
unlink (lderrout);
if (exit)
{
error ("ld returned %d exit status", exit);
collect_exit (exit);
}
}
```
|
The Miami Horns are an American horn section best known for touring and recording with Southside Johnny, Bruce Springsteen, Little Steven and The Max Weinberg 7. They have also toured, performed or recorded with, among others, Diana Ross, Gary U.S. Bonds, Robert Cray, Bon Jovi, Cissy Houston, Joe Cocker, Dave Edmunds, Darlene Love, The Allman Brothers Band, Eric Clapton, Sheryl Crow and Ricky Martin. As individuals, the various members have also worked with the likes of Aerosmith, David Bowie, Duran Duran, Power Station, Graham Parker and They Might Be Giants.
The Miami Horns were first put together in 1976 by Steven Van Zandt as part of Southside Johnny and the Asbury Jukes. The connection with the city of Miami is only tenuous. Van Zandt had acquired the nickname Miami, due to his dislike of winter, and consequently the horn section also became known by that name. On occasions they have also been billed as The Jukes' Horns, La Bamba's Mambomen, The U.S. Horns, The J.A.M. Horns, The Tunnel Of Love Horns, The Horns of Love and The Late Night Horns. The line-up is very much impromptu and seems to depend on who is available at the time. As a consequence it has varied in size from a duo to a big band. Not unlike The Drifters, many performers have come and gone, and even returned. However Richie "La Bamba" Rosenberg (trombone), Mark Pender (trumpet) and Eddie Manion (saxophone) have been the most consistent members. Other notable players have included Stan Harrison, Chris Anderson, Joey Stann and Mario Cruz. In 1991 Rosenberg, Pender, Manion and Harrison recorded an eponymous album as La Bamba & The Hubcaps.
Southside Johnny & The Asbury Jukes
In January 1976 Steven Van Zandt set about finding a record deal for Southside Johnny and the Asbury Jukes. As well as being a full-time member of the E Street Band, Van Zandt also acted as a singer, guitarist, songwriter, manager, producer and arranger for the band, which he and Southside Johnny had co-founded in the early part of 1975. At the time, the Jukes horn section consisted of just one permanent member - sax player Carlo Novi. However, for the recording of their debut release, I Don't Want To Go Home, Van Zandt put together a horn section consisting of Rick Gazda (trumpet), Bob Malach (tenor sax), Deacon Earl Gardener (trumpet), Bill Zacagni (baritone sax) and Louie Parente (trombone). This quintet formed the original Miami Horns line up. However, with the exception of Rick Gazda, they all went their separate ways in March 1976 once the album had been finished. Bob Malach would briefly return in 1977 to play a solo on the second Jukes album, This Time It's for Real. On May 30, 1976, the Jukes celebrated the release of I Don't Want To Go Home with a show at The Stone Pony. It was broadcast live on nine radio stations, including WMMR, and featured guest appearances by Ronnie Spector, Lee Dorsey, Bruce Springsteen and various members of the E Street Band. By this time a new Miami Horns line up consisted of Carlo Novi (tenor sax), Eddie Manion (baritone sax), Tony Pallagrosi (trumpet) and Rick Gazda (trumpet). They eventually grew into a five-piece with the arrival of Richie "La Bamba" Rosenberg (trombone) in November 1976 and went on to tour and record regularly with Southside Johnny during the 1970s. They featured prominently on the album Hearts of Stone. In 1991 they also featured on Better Days, effectively a Jukes reunion album, produced by Van Zandt. It also featured guest appearances by Springsteen, Jon Bon Jovi and honorary Jukes, Max Weinberg and Garry Tallent. The horns were provided by Rosenberg, Pender, Manion, Gazda, Joey Stann, Frank Elmo and for the first time, Jerry Vivino.
Bruce Springsteen
The Miami Horns first toured with Bruce Springsteen & the E Street Band in 1976 and 1977 during the latter stages of the Born to Run tour. For many years it was assumed that that horns line-up for this tour was the same quintet that featured on I Don't Want To Go Home. However research by the Asbury Jukes historian, Mike Saunders, revealed that the horns were actually provided by two separate quartets, both billed as the Miami Horns. The first quartet consisted of Carlo Novi (tenor sax), Eddie Manion (baritone sax), Tony Palligrosi (trumpet) and Rick Gazda (trumpet). They made their debut with Springsteen on August 1 at the Monmouth Arts Centre in Red Bank, New Jersey. At the time Southside Johnny & The Asbury Jukes where temporarily inactive due to Southside Johnny suffering from an illness. However, by September, Southside was fully recovered and Novi, Manion, Palligrossi and Gazda rejoined the Jukes. A second Miami Horns was then recruited to accompany Springsteen and the E Street Band. This line up featured Ed De Palma (sax), Dennis Orlock (trombone), John Binkley (trumpet) and Steve Paraczky (trumpet) and were based out of Philadelphia. They made their debut with Springsteen at the Arizona Veterans Memorial Coliseum on September 26 and continued to tour with him until March 1977.
On the Born in the U.S.A. Tour the Miami Horns, featuring Richie "La Bamba" Rosenberg (trombone), Mark Pender (trumpet), Eddie Manion (baritone sax), Mike Spengler (trumpet) and Stan Harrison (tenor sax), made a guest appearance at the Meadowlands Arena on August 20, 1984; they featured prominently on Dobie Gray's "Drift Away", performed as a duet by Springsteen and Little Steven, and on "Tenth Avenue Freeze-Out". This version of the latter song was later featured on Live/1975-85. On August 22 Springsteen returned the favour when he guested with La Bamba & The Hubcaps during a show at The Stone Pony. The Tunnel Of Love Express Tour of 1988 featured a horn section much more prominently. Rosenberg, Manion, Pender, Spengler and Mario Cruz, sometimes referred to as The Tunnel Of Love Horns or The Horns of Love, accompanied Springsteen throughout the tour. On September 19, 1988 at the JFK Stadium they also made a guest appearance during the Human Rights Now! Tour. On June 24, 1993, during The "Other Band" Tour they also guested once again at Meadowlands Arena.
They have been featured on The Rising and We Shall Overcome: The Seeger Sessions. Rosenberg, Manion and Pender also toured with Springsteen as part of The Seeger Sessions Band and subsequently featured on Live In Dublin. They also played with Springsteen at the halftime show during Super Bowl XLIII.
A photo of The Miami Horns playing behind Springsteen and the E Street Band at the Boston Music Hall on March 24, 1977 can be found here:
In 2012, Eddie Manion joined Springsteen and the E Street Band's new horn section for their Wrecking Ball Tour as a replacement for the late Clarence Clemons. As of 2014, Manion still remains part of the recording and touring horn section for Springsteen.
Little Steven
As well as arranging the horn parts when they toured and recorded with Southside Johnny and Bruce Springsteen, Steve Van Zandt has also used the Miami Horns when he produced for other artists. In 1981 he used them on Dedication, an album he produced for Gary U.S. Bonds, and they then featured prominently on his own debut Men Without Women. This was released under the name Little Steven & The Disciples Of Soul and the horns were credited as La Bamba's Mambomen. They also toured to promote the album. Van Zandt also used the horns on "All Alone on Christmas", a single he wrote and produced for Darlene Love which was also featured on the Home Alone 2: Lost in New York soundtrack.
The Max Weinberg and The Tonight Show Band
In 1993 Max Weinberg became music director for Late Night with Conan O'Brien and when putting together a band, he recruited Rosenberg, Pender and Jerry Vivino. The three played until 2009 as members of The Max Weinberg 7, which moved that year with Conan O'Brien to become the latest iteration of The Tonight Show Band. When not on TV, this trio has worked regularly as session musicians. In 2010, the trio toured North America as part of the Legally Prohibited Band (essentially The Tonight Show Band under a different name, with Weinberg's place taken by James Wormwood) in support of Conan O'Brien's 32-city "Legally Prohibited From Being Funny On Television" tour. They continued to be part of O'Brien's late night band as part of the Basic Cable Band on O'Brien's current show, Conan, until the band was removed from the show when O'Brien moved to a different format in 2019.
Other artists
In the early 1980s Southside Johnny temporarily broke up The Asbury Jukes, and the Miami Horns, featuring Mark Pender for the first time, went on tour with Diana Ross. Touring with Springsteen raised the profile of The Miami Horns and led to more work, including sessions with Joe Cocker. In 1989 they also toured as part of Dave Edmunds' Rock 'n' Roll Review which also featured Graham Parker, Dion, Kim Wilson and Steve Cropper. In October 1991 they played at the Legends Of Guitar Festival in Seville, performing with such artists as Keith Richards, Bob Dylan, Jack Bruce, Robert Cray, Phil Manzanera, Robbie Robertson, Albert Collins, B.B. King, Bo Diddley and again with Edmunds and Cropper. The concert was broadcast live on TVE2 and some of the recordings also appeared on the Manzanera album Million Reasons Why. Manion and Pender also played and arranged horns on the acclaimed Robert Cray album, Shame + A Sin and between 1991 and 1994, Manion was a full-time member of The Robert Cray Band.
Discography
Southside Johnny & The Asbury Jukes
I Don't Want To Go Home (1976)
Live At the Bottom Line (1976)
This Time It's for Real (1977)
Hearts of Stone (1978)
The Jukes (1979)
Love Is a Sacrifice (1980)
Reach Up and Touch the Sky (1981)
Trash It Up! (1983)
In the Heat (1984)
At Least We've Got Shoes (1986)
Better Days (1991)
Messin' With the Blues (2000)
Goin' To Jukesville (2002)
Into the Harbour (2005)
Southside Johnny & La Bamba's Big Band
Grapefruit Moon: The Songs of Tom Waits (2008)
Bruce Springsteen
Live/1975-85 (1986)
Chimes of Freedom (1988)
Tracks (1998)
18 Tracks (1998)
The Rising (2002)
We Shall Overcome: The Seeger Sessions (2006)
Live In Dublin (2007)
Gary U.S. Bonds
Dedication (1981)
Standing In the Line of Fire (1984)
Debbie Davies
Picture This (1993)
Loose Tonight (1994)
Phil Manzanera
Manzanera Collection (1995)
Million Reasons Why (1997)
Jon Spencer Blues Explosion
Talkin' About The Blues (1998)
Xtra Acme USA (1999)
Emergency Call From Japan (1999)
Magical Colours (2000)
Selected Others
Various artists: The Sounds Of Asbury Park (1980)
Little Steven & The Disciples Of Soul: Men Without Women (1982)
Power Station: The Power Station (1985)
J.A.M: We've Got The Love / Save Love, Save Life (1986)
Joe Cocker: One Night Of Sin (1989)
La Bamba & The Hubcaps: La Bamba & The Hubcaps (1991)
Killer Joe: Scene Of The Crime (1991)
Tyler Collins: Tyler (1992)
Various artists: Home Alone 2: Lost in New York (1992) (soundtrack)
Robert Cray: Shame + A Sin (1993)
Bon Jovi: These Days (1995)
Cissy Houston: He Leadeth Me (1997)
New York Voices: The Songs Of Paul Simon (1997)
Joe Pesci: Vincent Laguardia Gambine (1998)
Various artists: Where Have All The Flowers Gone (1998)
Lucky Peterson: Lucky Peterson (1999)
Various artists: A Very Special Christmas Live (1999)
Son Seals: Lettin' Go (1999)
The Max Weinberg 7: The Max Weinberg 7 (2000)
Ricky Martin: Sound Loaded (2001)
Various artists: Autofocus (2002)(soundtrack)
Sherie Rene: Men I've Had (2002)
Various artists: Camp (2003)(soundtrack)
Sinner: There Will Be Execution (2003)
Joe D'Urso & The Stone Caravan: Both Sides Of Life (2003)
Bradley Cole: In Our Time (2004)
Sean Costello': Sean Costello (2004)
References
Musical groups established in 1976
Musical groups from New Jersey
Southside Johnny & The Asbury Jukes members
Jersey Shore musical groups
Bruce Springsteen
Steven Van Zandt
1976 establishments in New Jersey
Musical backing groups
Little Steven and the Disciples of Soul members
|
The canton of Évreux-Ouest is a former canton situated in the Eure département, France. It had 19,118 inhabitants (2012). It was disbanded following the French canton reorganisation which came into effect in March 2015. It included a part of Évreux and the communes of Arnières-sur-Iton, Aulnay-sur-Iton, Caugé, Claville and Saint-Sébastien-de-Morsent.
References
Evreux-Ouest
Évreux
2015 disestablishments in France
States and territories disestablished in 2015
|
Shepherd's Bush station may refer to:
Shepherd's Bush railway station, open station served by London Overground
Shepherd's Bush railway station (1869-1916), closed station that was served by London and South Western Railway
Shepherd's Bush tube station, open station served by the Central line of the London Underground
Shepherd's Bush Market tube station, open station served by the Circle and Hammersmith & City lines of the London Underground
Stations around Shepherd's Bush, detailing all stations that have been in the Shepherd's Bush area of London
|
Stéphanie Kerbarh (born 31 July 1975) is a French politician who served as a member of the French National Assembly from 2017 to 2022, representing the department of Seine-Maritime. From 2017 until 2021, she was a member of La République En Marche! (LREM).
Political career
In parliament, Kerbarh served as member of the Committee on Sustainable Development and Spatial Planning. In addition to her committee assignments, she was part of the parliamentary friendship groups with Belgium, India and Somalia. In 2020, Kerbarh joined En commun (EC), a group within LREM led by Barbara Pompili.
After announcing her decision to run a non-LREM ticket in the 2021 regional elections, Kerbarh was excluded from the party. She stood in the 2022 French legislative election as a miscellaneous centre candidate but lost her seat in the first round.
Political positions
In July 2019, Kerbarh decided not to align with her parliamentary group's majority and became one of 52 LREM members who abstained from a vote on the French ratification of the European Union’s Comprehensive Economic and Trade Agreement (CETA) with Canada.
See also
2017 French legislative election
References
1975 births
Living people
Deputies of the 15th National Assembly of the French Fifth Republic
Renaissance (French political party) politicians
21st-century French women politicians
Politicians from Orléans
Women members of the National Assembly (France)
Politicians from Normandy
|
Louis Luchini (born May 24, 1981) is an American Democratic politician and former professional long-distance runner from Maine. Luchini served in the Maine Senate representing District 7, Hancock County from 2018 to 2022. Luchini was born and raised in Ellsworth, Maine and began running competitively in middle school. He was a state champion runner at Ellsworth High School and continued to Stanford University where he earned a degree in human biology and was an all-American runner. Luchini graduated from Stanford in 2004 and signed a contract with Nike to run professionally, also participating in the U.S. Olympic Trials in 2004 and 2008. He returned to Maine in 2009, joined the cross-country coaching staff at Ellsworth High School and ran for the Maine House of Representatives in 2010. Luchini served four terms in the Maine House before running successfully for the Senate in 2018. In 2020, Luchini was re-elected to Senate District 7 for a second two-year term. In January 2022, he resigned from the Senate to accept a job in the U.S. Small Business Administration.
Early life, education & running career
Luchini was born on May 24, 1981 in Ellsworth to Louis Luchini Sr. and Cheryl Higgins. In fifth grade, he became interested in running after watching an older brother's participation in the sport, and by eighth grade Luchini began to compete seriously.
Ellsworth High School
Luchini helped the Ellsworth Cross Country team win state championships in both 1996 and 1998. As a junior, he placed 11th in the Foot Locker Cross Country Championships and as a senior, he placed second. He graduated from Ellsworth High School in 1999.
Stanford University
Luchini was recruited to run for Stanford University and majored in human biology, intending to pursue a career in medicine. The Stanford team won NCAA Division I cross country championships in both 2002 and 2003, winning the 2003 contest by 150 points. Luchini earned 11 All-America citations at Stanford. He finished fifth at the 2002 NCAA Division I Cross Country Championships, sixth at the 2003 NCAA Division I Cross Country Championships, and 37th at the 2000 IAAF World Cross Country Championships – Junior men's race. He graduated from Stanford in 2004.
Professional career
After graduation, Luchini signed a professional running contract with Nike. In 2004 and 2008, he competed in the U.S. Olympic Trials. In 2009, Luchini returned to Maine and worked as an assistant coach to the Ellsworth High School cross country team, assuming the role of head coach in 2015. In 2018, the girls' team won a state title for the first time in 40 years. In August 2020, Luchini was named to the Maine Running Hall of Fame.
Maine Legislature
When he returned to Maine in 2009, Luchini was approached by local friends and acquaintances, including fellow Mainer and Nike professional runner Matt Lane, to run for state legislature. In a 2017 interview, Luchini explained "I’ve always loved this community, so when people asked, I definitely willing to do it. Sports can feel like a selfish endeavor so to give back with public service feels great."
House
In the 2010 Maine House District 38 race, Luchini defeated Republican Michael Povich 54%-46%. In 2012, he ran unopposed in the Democratic primary and won against Republican Matthew Foster 61.5%-38.5% in the general election. Luchini beat Republican R. Frederick Ehrlenbach in the 2014 House District 132 general election—Maine had undergone redistricting and re-numbering of its legislative districts—62%-38%, and in 2016 he defeated Republican David Edsall 63%-37%. During his time in the House, Luchini served as the House Chair of the Veterans and Legal Affairs Committee and as chair of the House Ethics Committee. In 2017, he was named Legislator of the Year by the American Legion.
Senate
In late March 2018, Luchini announced that he would run as a Clean Elections candidate for Maine Senate District 7. He defeated fellow Democrat Ian Schwartz 68%-32% in the Democratic primary, and beat Republican Richard Malaby in the general election 64%-36%. In 2020, Luchini ran unopposed in the Senate District 7 Democratic primary and defeated Republican Brian Langley, who had preceded Luchini in both his House and Senate seats, 55%-45%. He serves on the Innovation, Development, Economic Advancement and Business committee and is the chair of the Veterans and Legal Affairs committee. On 18 January 2022, Luchini announced his resignation in order to take a job as an advocate within the United States Small Business Administration.
Voting record
In 2017, Luchini supported a bill to restore Maine's tipped minimum wage and sponsored legislation to extend Maine's deadline for legalizing adult possession of marijuana.
In 2018, he introduced a bill increasing regulations for signature-gatherers on citizen ballot initiatives, and voted in favor of a $45 million tax break for Bath Ironworks. He also voted to uphold Governor Paul LePage's veto of a bill that would have allowed Bar Harbor to establish a port authority.
In 2019, Luchini voted to uphold religious exemptions to school vaccination requirements, amending a proposed new law to eliminate all but medical exemptions for school attendance statewide.
In 2020 and 2021, he introduced legislation to legalize and regulate sports betting in Maine.
Electoral record
Maine House
Maine Senate
References
External links
Maine Senate Democrats: Louis Luchini
State Senator Louis Luchini on Facebook
Sen. Louis Luchini official site
Ballotpedia: Louis Luchini
Maine State Legislature: Sen. Louis Luchini
1981 births
Living people
People from Ellsworth, Maine
Democratic Party members of the Maine House of Representatives
21st-century American politicians
Democratic Party Maine state senators
Stanford Cardinal men's track and field athletes
|
```kotlin
package com.x8bit.bitwarden.data.auth.manager.model
/**
* Models result of creating a new login approval request.
*/
sealed class AuthRequestResult {
/**
* Models the data returned when creating an auth request.
*/
data class Success(
val authRequest: AuthRequest,
) : AuthRequestResult()
/**
* There was an error getting the user's auth requests.
*/
data object Error : AuthRequestResult()
}
```
|
Continuous hyperthermic peritoneal perfusion (CHPP) is a procedure in which the abdominal cavity is bathed in warm fluid that contains anticancer drugs. It is a kind of hyperthermia therapy.
References
Oncothermia
|
Dana Complex is a building complex in Satu Mare, Romania. The structure has two separate buildings linked together by a skybridge. The smaller 7 story buildings has 500 parking spaces and offices and the larger 15 story tower of to have a mall, a commercial area and 127 residential units.
References
Buildings and structures in Satu Mare
History of Satu Mare
Buildings and structures completed in 2011
|
Xu Xiaoxi (; born November 18, 1981 in Chengdu) is a Chinese film director and screenwriter. He belongs to a new generation of filmmakers from China that are educated in the West. Since 2010, he co-directs all his films with the Spanish director Roberto F. Canuto and together open a film production company in China, Almost Red Productions.
Xu obtains some international recognition after he received awards in international film festivals. Due to the distinct personal style of his movies, Xu is considered in some circles as a promising figure in the Chinese industry.
Biography
Xu Xiaoxi was born in Chengdu, Sichuan. He was influenced into filmmaking since childhood, since his father was a cinematographer in those times. He bought him a video camera when he was eight years old. He remembers to start writing stories and record it with his friends.
After high school, he wanted to travel and experience different cultures. He later moved to South Africa to study Fine Arts, majoring in Painting at the Nelson Mandela Metropolitan University in Port Elizabeth, South Africa. Xu gained experience and good skills in drawing, painting, photography, and video art. He worked as a video artist in his final year project The Fluxus of ID, a tribute to Maya Deren. He used video images as the prime means of expression regarding perceptions of cultural identity in a globalized world. In 2006, he graduated the university and received the bachelor's degree of Fine Arts.
After graduation, Xu decided to persuade a filmmaking career and continue his international experiences, so he enrolled in a Master of Fine Arts (MFA) at a filmmaking program at the New York Film Academy in the Los Angeles campus near Universal Studios, Hollywood. There, he directed many short films in celluloid and digital format and collaborated in many others, mainly as a cinematographer (most notorious was Toto Forever, obtaining a nomination for Best Cinematography from his academy at the Kodak Cinematography Scholarships Awards). He graduated in 2009 with Desire Street as their thesis film.
From 2008, his films joined the festival circuit and achieved awards. These films were created with his usual collaborator, Roberto F. Canuto. They had first met when they studied the same master in Los Angeles. His two graduation projects became his most renowned films, Mei Mei (Year One graduation) and the feature Desire Street, co-directed with Canuto (master graduation). Desire Street, which was re-cut and eventually re-released in 2011, received awards at the Asturian Film Festival 2014 and a Special Mention for Best International Feature Film at Mix Mexico International Film Festival 2011, together with other nominations and special screenings.
During the postproduction of Mei Mei, the director started the collaboration with the composer who would become part of the team and signature of his work since then, Andrea Centazzo, Italy's top orchestral percussionist and a reference in the avant-garde contemporary music.
Back in China, Xu and Canuto founded officially their own production company, Almost Red Productions, where they alternate the fiction narrative projects with commercial/advertisement works. In 2013, they released the Chinese and Spanish production short film Ni Jing: Thou Shalt Not Steal. This film won the Best Film Award (Riverside Saginaw International Film Festival, Michigan, USA) and runner-up for Best Short Film with the Best Actress award going to actress Sherry Xia Ruihong (Asturian Film Festival, Spain), two nominations for the film in the GAVA Awards, 2014 as Best Short and Best Screenplay, together with other nominations and international screenings. In addition to the fiction works, Almost Red Productions creates commercials and collaborates with some non profit organizations, like Concentric Circles, a company that aims to improve the health system in poor rural areas of China.
His film Floating Melon was released in late 2015 and he introduced the project as the second part the trilogy, Invisible Chengdu, after Ni Jing: Thou Shalt Not Steal.
Floating Melon was filmed in his hometown, Chengdu, and with non professional actors. The world premiere took place in Spain at the 53rd FICXIXON, Gijón International Film Festival in November 2015 and in China at the Art Gallery Shujingtang Alley Art Space in Chengdu (Sichuan) in June 2016. It received an Audience Award at the 15th Aviles Acción Film Festival (Spain) and the Audience Choice Award and Best Cinematography Award (Guo Yong) at the III Asturian Film Festival of Proaza, 2016 (Spain). In the first 12 months after the release, it has been presented in over 40 international film festivals in Europe, America, Asia and Africa.
In 2016, he directed his first film in Spain, at the hometown of his collaborator Canuto, Asturias, using the language of the region, Asturian, titled Advent (Asturian: Ad-vientu), a psychological mystery drama film. At the world premiere of Advent that took place at the 54th Gijón International Film Festival, obtained the Audience Award Día D'Asturies for Best Short Film.
Sunken Plum, the film that completed the trilogy Invisible Chengdu, was released in 2017. It is a melodramatic comedy with touches of mystery and social realism (with a mix genre typical of the directors). The film uses non-professional actors and the filming took place in Sichuan, mainly in downtown Chengdu, the lake "Bai Ta" and a remote village in the mountains of Sichuan, "Nan Bu".
Filmography
Xu Xiaoxi has directed many shorts and a feature film, but most of his works remain unreleased. Before attending the Master of Fine Arts at NYFA, he directed documentary shorts and experimental works, most notably the video art The Fluxus of ID, a tribute to Maya Deren. During his masters, he directed projects in 16mm film, The Red One camera and other digital formats, like Rope, The Meal or Lila and his first year graduation film, Mei Mei. His master's graduation feature film, Desire Street (2011), was the work that brought him more attention, awards and international recognition but in 2013 and beyond, he has continued to produce under Almost Red Productions in China, and also co-directs with Roberto F. Canuto. The first productions of Xu in China attracts media attention, with press interviews and TV coverage.
Invisible Chengdu trilogy (2017)
Invisible Chengdu (Spanish: El Chengdu Invisible) is Roberto F. Canuto and Xu Xiaoxi's trilogy of short films filmed in Sichuan and using the local language of Sichuan, Sichuanese Mandarin. This set of films reflects the underground scene of Chengdu. It includes Sunken Plum (2017), Floating Melon (2015), and Ni Jing: Thou Shalt Not Steal (2013). The trilogy tell stories about people normally segregated and that have to survive in the shadows of the Chinese society, that is against diversity and individuality.
Sunken Plum (2017)
Sunken Plum () is Roberto F. Canuto and Xu Xiaoxi's latest short film, it was released in October 2017. Produced by "Almost Red Productions" (China) in association with "Arkadin Ediciones" (Spain). It is a melodramatic comedy with mystery elements and tells the story of a transgender woman who works in a nightclub in Chengdu. She gets a visit from her cousin to let her know that her mother is deceased. As the only son, she feels obligated to return to her birthplace, but can not appear as a woman in front of her family.
Filmed in October 2016 and partially produced with a crowdfunding project, and co-produced between Spain and China, the film uses non professional actors.
Advent (Ad-vientu) (2016)
Advent (Asturian: Ad-vientu; ) is a 2016 Spanish and Chinese co-production psychological drama film, written and directed by Roberto F. Canuto and Xu Xiaoxi. It is the first movie of the directors filmed in Spain.
Advent was shot in Asturias, with locations in the medieval center of the city of Avilés, the historical Cemetery La Carriona and some beaches and walkways of Carreño, mainly in Perlora and Xivares. It is spoken in Asturian (something unusual in the Spanish cinema).
Advent tells the story of Suso, a dazed young unemployed man that tries to discover the identity of an unusual girl, who he spies on a secluded beach, as she reminds him of his dead mother. She runs throwing herself off a cliff, but it will not be the last time that she crosses his path. The main character is performed by David Soto Giganto, an actor from the Youth National Company of Classic Theater and in the rest of the cast we find actors mainly from the Dramatic Art Academy of Asturias, like Ici Díaz o Beatriz Meré, together with other experienced actors as Lidia Méndez o David Blanka.
The premiere of Advent took place at the 54th Gijón International Film Festival on the 25 of November 2016 and the film obtained the Audience Award Día D'Asturies for Best Short Film. It started the international festival circuit in 2017.
Floating Melon (2015)
Floating Melon (; Spanish title Sandía amarga) is a 2015 Spanish and Chinese co-production drama film written and directed by Roberto F. Canuto and Xu Xiaoxi. It is a low budget independent short movie that tells the story of Xiao Cheng, when he finds his lover dead in his bed, after a lethal drug overdose. In the dark roads of Chengdu, Xiao Cheng, scared of the consequences, sent a message asking for help to his friend. She thinks that the best solution is to hide the body, but when they return to the apartment, they found the unexpected.
The film has a strong film noir influences and it is performed by non professional actors and it includes themes very delicate, often censored in China, specially the representation of the homosexuality in young people, a community that need to protect themselves due to the lack of protective laws in the country. The story is partially based in true events, but the atmosphere is close to the film noir genre, to reflect the only situation where queer people can express themselves, community that needs to live in the shadows of the night in the Chinese society.
It tells the story of Xiao Cheng, a young Chinese guy that ask for help to a friend to resolve a big trouble, the guy with whom he spend the afternoon is dead on his bed from the effect of a drug, not something the Chinese authorities look kindly on.
The world premiere of the film we held in Spain, at the 53rd Gijon International Film Festival in November 2015. It received the audience award for best short film, Asturian section, at the 15th Aviles Action Film Festival and at the Audience Choice Award for Best Film and Best Cinematography at the 3rd Asturian Film Festival of Proaza. In China, the film premiere was held at an art gallery, Shujingtang Alley Art Space in Chengdu on June 12, 2016 and the reactions where very positive. The premiere in China was held relatively underground (due to the censorship laws of the country).
Ni Jing: Thou Shalt Not Steal (2013)
Ni Jing: Thou Shalt Not Steal (Original ; Spanish Title Ni Jing: No Robarás) is his first film produced in China by his company Almost Red in co-production with Spain.
A naive Chinese girl is forced to confront betrayal after she awakes in a remote forest covered in blood.
Ni Jing received accolades: Best Short Film in the world premiere at Riverside Saginaw International Film Festival 2013, Best Actress (Sherry Xia Ruihong), runner up for Best Short Film, and a nomination for Best Actor (Yinhui Wan) at the 9th Asturian Film Festival, 2014. The Ni Jing Spanish premiere took place at the prestigious FICXIXON, Gijón International Film Festival in 2013.
The critical reactions from the various presentations were very positive:
Fenixnet Entertainment News in China: "The film represent very truthfully the local society of Chengdu and the good communication among the directors, that belong to different cultures, creates great results".
Sichuan Daily News (lead newspaper of the region): "Audiences at the press screening were captivated for the atmosphere and the rhythm of the film"
Ni Jing: Thou Shalt Not Steal played in the International Festival Circuit around 2014.
Desire Street (2011)
Desire Street is Xu Xiaoxi and Roberto F. Canuto's first feature film, produced as a graduation work in their Master of Fine Arts at the NYFA in Hollywood. The story follows three family members (mother, daughter and son) as they try to survive their loneliness and obsessions by going through different sexual experiences and relationships with a prostitute. The reference of the directors was the Mexican melodramas of the 1960s. They exaggerate the representation of the characters to accentuate the irony that is a basic element in the story, creating many situations of comedy. At the end of the story the family became the main reference for the individual survival.
The reception at film festivals was very good, scoring positive reviews and awards (Best Film at Asturian Film Festival in Spain and Special Mention Best Feature at Mix Mexico International Film Festival):
Jury conclusion at Mix Mexico International Film Festival, 2011: Desire Street has "a very well structured script, strong story and great characters".
Jury conclusions at the Asturian Film Festival, 2014: "Desire Street develops, with technical mastery and a good treatment of the script, the generation gap and the family and sexual conflicts in a multiethnic society".
Film critic from Dickie King at MTG.com, 2011: "The characters could be from an Almodovar movie as they seem to need to behave in extraordinary ways in order to draw some sexual, psychological advantage... The use of subjective camera movement, composition and mirrored reflections are effective in conveying a real sense of false perceptions... The collaborations of Roberto Canuto and Xu Xiaoxi make them the future wave as these two engaging directors bring together fresh insight with redesigned camera work."
The premiere of Desire Street in Spain took place in 2014 at the Asturian Film Festival (obtaining the "Best Film Jury Award" and a nomination for Best Actress: Alejandra Walker). In China was screened at the Contemporary Art Museum A4 of Sichuan also in 2014.
Mei Mei (2009)
Mei Mei, his first year graduation film at "New York Film Academy", was written by Xu Xiaoxi and Roberto F. Canuto. The film premiere at Hungary's Slow International Film Festival, a successor to the 32-year-old prestigious Hungary Film Festival born of the Film Art Initiative. Mei Mei was screened in late August 2009 to an international crowd and was received as one of the festival's finest. After the screening the reactions were very positive, and it was received as one of the festival finest works. Some of the media mention that Mei Mei is a "beautiful and heartbreaking love story".
In addition to the festival selection, the film received a nomination for Best Cinematography at the Kodak Scholarship Awards 2009, in representation of NYFA from Universal Studios, Hollywood. The director of photography of Mei Mei was the filmmaker and usual collaborator of Xu, Canuto.
References
External links
Xu Xiaoxi Bio and info at Douban (Chinese Movie Database)
Directors Interview Roberto F. Canuto & Xu Xiaoxi at El Rollo Higiénico, Revista de Arte y Cultura (Spanish)
Interview Roberto F. Canuto & Xu Xiaoxi at Alderiques D'Asturies (Spanish)
"Advent" Interview with Producer at Cadena SER (Spanish)
News Award in Gijon International Film Festival at 20 minutos (Spanish)
1981 births
Living people
Chinese film directors
Artists from Chengdu
Chinese cinematographers
Nelson Mandela University alumni
New York Film Academy alumni
|
```shell
#!/usr/bin/env bash
py.test --doctest-modules \
--ignore eli5/lightning.py \
--ignore eli5/sklearn_crfsuite \
--ignore eli5/ipython.py \
--ignore eli5/xgboost.py \
--ignore eli5/lightgbm.py \
--ignore eli5/catboost.py \
--ignore eli5/keras \
--ignore eli5/formatters/as_dataframe.py \
--ignore eli5/formatters/image.py \
--ignore tests/utils_image.py \
--cov=eli5 --cov-report=html --cov-report=term "$@"
```
|
```go
// Code generated by protoc-gen-go. DO NOT EDIT.
// source: user/user.proto
package user
import (
fmt "fmt"
proto "github.com/golang/protobuf/proto"
math "math"
)
// Reference imports to suppress errors if they are not otherwise used.
var _ = proto.Marshal
var _ = fmt.Errorf
var _ = math.Inf
// This is a compile-time assertion to ensure that this generated file
// is compatible with the proto package it is being compiled against.
// A compilation error at this line likely means your copy of the
// proto package needs to be updated.
const _ = proto.ProtoPackageIsVersion2 // please upgrade the proto package
type User struct {
ID int64 `protobuf:"varint,1,opt,name=ID,proto3" json:"ID,omitempty"`
Email string `protobuf:"bytes,2,opt,name=email,proto3" json:"email,omitempty"`
Name string `protobuf:"bytes,3,opt,name=name,proto3" json:"name,omitempty"`
XXX_NoUnkeyedLiteral struct{} `json:"-"`
XXX_unrecognized []byte `json:"-"`
XXX_sizecache int32 `json:"-"`
}
func (m *User) Reset() { *m = User{} }
func (m *User) String() string { return proto.CompactTextString(m) }
func (*User) ProtoMessage() {}
func (*User) Descriptor() ([]byte, []int) {
return fileDescriptor_ed89022014131a74, []int{0}
}
func (m *User) XXX_Unmarshal(b []byte) error {
return xxx_messageInfo_User.Unmarshal(m, b)
}
func (m *User) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
return xxx_messageInfo_User.Marshal(b, m, deterministic)
}
func (m *User) XXX_Merge(src proto.Message) {
xxx_messageInfo_User.Merge(m, src)
}
func (m *User) XXX_Size() int {
return xxx_messageInfo_User.Size(m)
}
func (m *User) XXX_DiscardUnknown() {
xxx_messageInfo_User.DiscardUnknown(m)
}
var xxx_messageInfo_User proto.InternalMessageInfo
func (m *User) GetID() int64 {
if m != nil {
return m.ID
}
return 0
}
func (m *User) GetEmail() string {
if m != nil {
return m.Email
}
return ""
}
func (m *User) GetName() string {
if m != nil {
return m.Name
}
return ""
}
func init() {
proto.RegisterType((*User)(nil), "user.User")
}
func init() { proto.RegisterFile("user/user.proto", fileDescriptor_ed89022014131a74) }
var fileDescriptor_ed89022014131a74 = []byte{
// 103 bytes of a gzipped FileDescriptorProto
0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0xe2, 0xe2, 0x2f, 0x2d, 0x4e, 0x2d,
0xd2, 0x07, 0x11, 0x7a, 0x05, 0x45, 0xf9, 0x25, 0xf9, 0x42, 0x2c, 0x20, 0xb6, 0x92, 0x03, 0x17,
0x4b, 0x68, 0x71, 0x6a, 0x91, 0x10, 0x1f, 0x17, 0x93, 0xa7, 0x8b, 0x04, 0xa3, 0x02, 0xa3, 0x06,
0x73, 0x10, 0x93, 0xa7, 0x8b, 0x90, 0x08, 0x17, 0x6b, 0x6a, 0x6e, 0x62, 0x66, 0x8e, 0x04, 0x93,
0x02, 0xa3, 0x06, 0x67, 0x10, 0x84, 0x23, 0x24, 0xc4, 0xc5, 0x92, 0x97, 0x98, 0x9b, 0x2a, 0xc1,
0x0c, 0x16, 0x04, 0xb3, 0x93, 0xd8, 0xc0, 0xc6, 0x19, 0x03, 0x02, 0x00, 0x00, 0xff, 0xff, 0x3c,
0xf9, 0xb0, 0x24, 0x61, 0x00, 0x00, 0x00,
}
```
|
The black-headed marmoset (Mico nigriceps) is a marmoset species endemic to Brazil. It inhabits humid tropical rainforest, mostly second growth and edge; the distribution is not exactly known but is thought to be Rio dos Marmelos in the north and east, Madeira River in the west and Ji-Paraná River in the south.
References
black-headed marmoset
Mammals of Brazil
Endemic fauna of Brazil
black-headed marmoset
|
Alf Brustellin (27 July 1940 – 11 November 1981) was an Austrian film director and screenwriter. He directed six films between 1972 and 1979. He co-directed the 1978 film Germany in Autumn, which won the Special Recognition Award at the 28th Berlin International Film Festival. Alf Brustellin worked together with Bernhard Sinkel as a director and screenwriter team.
Brustellin was in a relationship with Hannelore Elsner from 1973 until his death. He died in a car accident.
Selected filmography
Director
(1975) (co-director: Bernhard Sinkel)
(1977) (co-director: Bernhard Sinkel) — (based on a novel by )
Germany in Autumn (anthology film, 1978)
(1979) — (based on a novel by Martin Walser)
Cinematographer
Lina Braake (1975)
References
External links
1940 births
1981 deaths
Austrian film directors
Austrian male screenwriters
Film people from Vienna
20th-century Austrian screenwriters
20th-century Austrian male writers
|
Schuylkill Township could refer to the following places in the U.S. state of Pennsylvania:
Schuylkill Township, Chester County, Pennsylvania.
Schuylkill Township, Schuylkill County, Pennsylvania.
Pennsylvania township disambiguation pages
|
State University of Gorontalo (UNG) is a state university in Gorontalo, Indonesia, that was established on 1 September 1963. At first the university was a junior college and part of Guidance and Counseling UNSULUTENG (Sulawesi Tengah). In 1964 its status changed to Guidance and Counseling Branch IKIP Yogyakarta at Manado. In 1965 it joined the Teachers Training College branch in Manado Gorontalo.
In 1982 the institution became one of the faculties of the Sam Ratulangi University Manado with the name of the Faculty of Teacher Training and Education (Guidance and Counseling) UNSRAT Manado, Gorontalo. The institute was officially established in 1993 under the name College of Teacher Training and Education (STKIP) Gorontalo.
In 2001 the institution was upgraded to State Teachers Training College Gorontalo with five faculties and 25 study programs. On June 23, 2004, President Megawati inaugurated the State University of Gorontalo.
Faculties
The university has tenth faculties and one school:
Faculty of Education
Faculty of Social Sciences
Faculty of Mathematics and Natural Sciences
Faculty of Literature and Culture
Faculty of Engineering
Faculty of Agriculture
Faculty of Fishery and Marine Science
Faculty of Health Sciences and Sports
Faculty of Economics and Business
Faculty of Law
Graduate School
References
External links
University website Official Facebook Account
Gorontalo (city)
Universities in Gorontalo (province)
Universities in Indonesia
Indonesian state universities
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
/**
* Compute the maximum value of a strided array.
*
* @module @stdlib/stats/base/max
*
* @example
* var max = require( '@stdlib/stats/base/max' );
*
* var x = [ 1.0, -2.0, 2.0 ];
* var N = x.length;
*
* var v = max( N, x, 1 );
* // returns 2.0
*
* @example
* var floor = require( '@stdlib/math/base/special/floor' );
* var max = require( '@stdlib/stats/base/max' );
*
* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];
* var N = floor( x.length / 2 );
*
* var v = max.ndarray( N, x, 2, 1 );
* // returns 4.0
*/
// MODULES //
var max = require( './main.js' );
// EXPORTS //
module.exports = max;
// exports: { "ndarray": "max.ndarray" }
```
|
Acrossocheilus macrophthalmus is a species of ray-finned fish in the genus Acrossocheilus which is endemic to northern Vietnam.
References
Macrophthalmus
Fish described in 2001
Endemic fauna of Vietnam
|
Kevin Olekaibe (born July 28, 1992) is an American professional basketball player who last played for the Westchester Knicks of the NBA G League. He played college basketball for Fresno State University and the University of Nevada, Las Vegas (UNLV).
High school
In his final year at Cimarron-Memorial High School, Olekaibe averaged 35.6 points, 6.8 rebounds, 4.8 assists and 3.6 steals per game. He shot 50% from the field, 37% percent from beyond the three-point line, and 81% from the free-throw line. He also scored at least 50 points twice and 40 points nine times during his senior season. Olekaibe graduated in 2010 as the school's all-time leading scorer with 1,779 points and made the school's honor roll.
College career
Fresno State
Olekaibe enrolled at Fresno State in 2010. During his first season, he played in 30 out of 31 games including 19 starts. He averaged 12.0 points, 1.9 rebounds, and 1.3 assists in his first season with the Bulldogs. Olekaibe shot 38.6% from the field, 32.8% from the three, and 76.7% from the free-throw line. In his second season at Fresno State, Olekaibe started in all 33 games and averaged 17.8 points, 3.2 rebounds, 1.2 assists, and 1.3 steals. In a game against Arizona State, Olekaibe scored 21 points in the second half to bring his total to 30 and hit the game-winning three-pointer to notch a win for the Bulldogs. In a game against Seattle on February 23, 2012, Olekaibe set a Fresno State record when he scored 43 points. He was also named to the All-WAC Second Team in his sophomore year. In his third, and what proved to be final, season with the Bulldogs, Olekaibe played in all 30 games including 24 starts. For the season, he averaged 8.3 points, 2.1 rebounds, 1.3 assists, and 1.1 steals per game. He also shot 34.7% from the field, 34.4% from the three, and 83.3% from the free-throw line. He scored 1,169 points while at Fresno State.
University of Nevada, Las Vegas
For the 2013–14 season, Olekaibe transferred to UNLV. The NCAA approved a waiver applied by the school to allow Olekaibe to play for the team immediately. In his debut, he started in the place of injured Bryce Dejean-Jones and scored 17 points. He started in 32 of the team's 33 games and averaged 10.2 points, 2.3 rebounds, 2.3 assists, and 0.7 steals per game while shooting 38.3% from the field, 35.7% from the three, and 73.6% from the free-throw line. Olekaibe graduated in 2014.
College statistics
|-
| style="text-align:left;"| 2010–11
| style="text-align:left;"| Fresno State
| 30 || 19 || 25.1 || .386 || .328 || .767 || 1.9 || 1.8 || 1.2 || .2 || 12.0
|-
| style="text-align:left;"| 2011-12
| style="text-align:left;"| Fresno State
| 33 || 33 || 36.5 || .338 || .797 || .643 || 3.2 || 1.2 || 1.3 || .1 || 17.8
|-
| style="text-align:left;"| 2012-13
| style="text-align:left;"| Fresno State
| 30 || 24 || 24.9 || .347 || .344 || .833 || 2.1 || 1.3 || 1.1 || .1 || 8.3
|-
| style="text-align:left;"| 2013-14
| style="text-align:left;"| UNLV
| 33 || 32 || 30.6 || .383 || .357 || .736 || 2.3 || 2.1 || .7 || .1 || 10.2
|- class="sortbottom"
| style="text-align:left;"| Career
| style="text-align:left;"|
| 126 || 108 || 29.5 || .373 || .342 || .784 || 2.4 || 1.5 || 1.1 || .1 || 12.2
Professional career
Canton Charge (2014–2018)
After going undrafted in 2014, Olekaibe played one game for the Milwaukee Bucks's Summer League team and recorded one point in one minute. The NBA Development League's Canton Charge selected Olekaibe in the sixth round of the 2014 NBA Development League Draft, where he has been playing since. Olekaibe participated in the 2015 NBA D-League Slam Dunk Contest., On February 14, 2018, he scored a career high 33 against the Delaware 87ers.
Long Island Nets (2018–2019)
On December 30, 2018, Olekaibe signed with the Long Island Nets with a roster hardship exception. On January 25, 2019, Olekaibe was re-signed by the Long Island Nets.
Personal life
Olekaibe was born to Benson and Esther Olekaibe, who are originally from Nigeria. His older brothers, Ike and Emmanuel both played college basketball. Ike was a two-time All-American at Purdue and Emmanuel played for Southwestern Oregon Community College and Everest College. Olekaibe has four other siblings: Victoria, Ruth, John, and Kenneth.
References
External links
Kevin Olekaibe at NBA D-League
Kevin Olekaibe at euroleague.net
1992 births
Living people
American men's basketball players
American sportspeople of Nigerian descent
Basketball players from Oakland, California
Canton Charge players
Fresno State Bulldogs baseball players
Long Island Nets players
Point guards
UNLV Runnin' Rebels basketball players
Westchester Knicks players
|
```swift
import Foundation
@testable import KsApi
@testable import Library
import Prelude
import ReactiveExtensions_TestHelpers
final class ShippingRuleCellViewModelTests: TestCase {
private let vm: ShippingRuleCellViewModelType = ShippingRuleCellViewModel()
private let isSelected = TestObserver<Bool, Never>()
private let textLabelText = TestObserver<String, Never>()
override func setUp() {
super.setUp()
self.vm.outputs.isSelected.observe(self.isSelected.observer)
self.vm.outputs.textLabelText.observe(self.textLabelText.observer)
}
func testIsSelected_False() {
let selectedShippingRule: ShippingRule = .template
|> ShippingRule.lens.location .~ Location.canada
let data = ShippingRuleData(
selectedShippingRule: selectedShippingRule,
shippingRule: .template
)
self.vm.inputs.configureWith(data)
self.isSelected.assertValues([false])
}
func testIsSelected_True() {
let data = ShippingRuleData(
selectedShippingRule: .template,
shippingRule: .template
)
self.vm.inputs.configureWith(data)
self.isSelected.assertValues([true])
}
func testTextLabelText() {
let data = ShippingRuleData(
selectedShippingRule: .template,
shippingRule: .template
)
self.vm.inputs.configureWith(data)
self.textLabelText.assertValues(["Brooklyn, NY"])
}
}
```
|
The 1887 County Carlow by-election was a parliamentary by-election held for the United Kingdom House of Commons constituency of County Carlow on 24 August 1887. It arose as a result of the death of the sitting member, John Aloysius Blake on 22 May. Eighty-seven-year-old James Patrick Mahon, who had formerly sat in Parliament for the constituencies of Clare and Ennis, was nominated as an Irish Nationalist. No other candidate being nominated, Mahon was elected unopposed. He held the seat until his death four years later.
References
1887 elections in the United Kingdom
August 1887 events
By-elections to the Parliament of the United Kingdom in County Carlow constituencies
Unopposed by-elections to the Parliament of the United Kingdom in Irish constituencies
1887 elections in Ireland
|
The mixed doubles tournament at the 1982 French Open was held from 24 May until 6 June 1982 on the outdoor clay courts at the Stade Roland Garros in Paris, France. John Lloyd and Wendy Turnbull won the title, defeating Cássio Motta and Cláudia Monteiro in the final.
Seeds
Draw
Finals
Top half
Bottom half
External links
1982 French Open – Doubles draws and results at the International Tennis Federation
Mixed Doubles
French Open by year – Mixed doubles
|
Agonopsis chiloensis, the snailfish, is a fish in the family Agonidae. It was described by Leonard Jenyns in 1840. It is a subtropical, marine fish which is known from the southeastern Pacific and southwestern Atlantic Ocean, including Chile, Patagonia, and Argentina. It is known to dwell at a depth range of 3–400 metres. Males can reach a maximum standard length of 12.5 centimetres.
Agonopsis chiloensis is preyed upon by Cottoperca gobio, imperial shag, Pinguipes chilensis, and the narrowmouthed catshark. It is of no commercial interest to fisheries.
References
chiloensis
Taxa named by Leonard Jenyns
Fish described in 1840
|
```python
# Owner(s): ["module: unknown"]
import copy
import torch
from torch.testing._internal.common_utils import run_tests, TestCase
class TestPerOverloadAPI(TestCase):
def test_basics_opoverloadpacket(self):
# add is ony used as an example here. It is ok to update the test
# if the semantics of add are modified in the future.
add_packet = torch.ops.aten.add
# class attributes
self.assertEqual(add_packet.__name__, "add")
self.assertEqual(str(add_packet), "aten.add")
# callable
self.assertEqual(add_packet(torch.tensor(2), torch.tensor(3)), torch.tensor(5))
# correct module
self.assertEqual(add_packet.__module__, add_packet.op.__module__)
# caching
another_add_packet = torch.ops.aten.add
self.assertEqual(id(add_packet), id(another_add_packet))
# deepcopy is a no-op
self.assertEqual(id(add_packet), id(copy.deepcopy(add_packet)))
# pretty print
self.assertEqual(repr(add_packet), "<OpOverloadPacket(op='aten.add')>")
self.assertRaises(AttributeError, lambda: add_packet.foo)
def test_basics_opoverload(self):
add_packet = torch.ops.aten.add
add_tensoroverload = add_packet.Tensor
# class attributes
self.assertEqual(str(add_tensoroverload), "aten.add.Tensor")
self.assertEqual(add_tensoroverload.__name__, "add.Tensor")
self.assertEqual(add_tensoroverload.overloadpacket, add_packet)
# deepcopy is a no-op
self.assertEqual(id(add_tensoroverload), id(copy.deepcopy(add_tensoroverload)))
# caching
another_add_tensoroverload = torch.ops.aten.add.Tensor
self.assertEqual(id(add_tensoroverload), id(another_add_tensoroverload))
# pretty print
self.assertEqual(
repr(add_tensoroverload), "<OpOverload(op='aten.add', overload='Tensor')>"
)
# callable
self.assertEqual(
add_tensoroverload(torch.tensor(2), torch.tensor(3)), torch.tensor(5)
)
a = torch.tensor(2)
b = torch.tensor(0)
torch.ops.aten.add.out(a, a, out=b)
self.assertEqual(b, torch.tensor(4))
self.assertRaises(RuntimeError, lambda: add_tensoroverload(a, a, out=b))
def test_decompose(self):
x = torch.randn(2, 3)
y = torch.randn(5, 3)
self.assertEqual(
torch.ops.aten.linear.default.decompose(x, y),
torch.ops.aten.linear.default(x, y),
)
if __name__ == "__main__":
run_tests()
```
|
```c++
// accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#ifndef ARG_TO_PYTHON_BASE_DWA200237_HPP
# define ARG_TO_PYTHON_BASE_DWA200237_HPP
# include <boost/python/handle.hpp>
namespace boost { namespace python { namespace converter {
struct registration;
namespace detail
{
struct BOOST_PYTHON_DECL arg_to_python_base
: handle<>
{
arg_to_python_base(void const volatile* source, registration const&);
};
}
}}} // namespace boost::python::converter
#endif // ARG_TO_PYTHON_BASE_DWA200237_HPP
```
|
Von Willebrand factor A domain containing 5A is a protein that in humans is encoded by the VWA5A gene.
References
Further reading
|
```xml
<!--
~ contributor license agreements. See the NOTICE file distributed with
~ this work for additional information regarding copyright ownership.
~
~ path_to_url
~
~ Unless required by applicable law or agreed to in writing, software
~ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-->
<dataset update-count="1">
<metadata data-nodes="encrypt_write_ds_${0..9}.t_user_${0..9}">
<column name="user_id" type="numeric" />
<column name="address_id" type="numeric" />
<column name="pwd_cipher" type="varchar" />
<column name="status" type="varchar" />
</metadata>
<row data-node="encrypt_write_ds_0.t_user_0" values="0, 10000, dL/JAiR/3cVG8lt6DMDa/A==, init" />
<row data-node="encrypt_write_ds_0.t_user_1" values="1, 11000, wPc6WYJBzQIt4i4T0KhqXA==, init" />
<row data-node="encrypt_write_ds_0.t_user_2" values="2, 12000, HbV7OHLF4nBuOMVCLV5Cbg==, init" />
<row data-node="encrypt_write_ds_0.t_user_3" values="3, 13000, avls/J9bHV4A8V4VdPjfig==, init" />
<row data-node="encrypt_write_ds_0.t_user_4" values="4, 14000, EPMV29wqL8k6Uow+Xrx3tg==, init" />
<row data-node="encrypt_write_ds_0.t_user_5" values="5, 15000, GxjyN54a5qsP5UDx7z98jw==, init" />
<row data-node="encrypt_write_ds_0.t_user_6" values="6, 16000, myfeu/O6o4D9RqILA5c2xA==, init" />
<row data-node="encrypt_write_ds_0.t_user_7" values="7, 17000, bnHlhR5STgfqDncGsILMMQ==, init" />
<row data-node="encrypt_write_ds_0.t_user_8" values="8, 18000, Rlu0LF0Cud3Fdu+ZL7Uq7A==, init" />
<row data-node="encrypt_write_ds_0.t_user_9" values="9, 19000, mOF/2EcSlRCZ0VQeZHlAhQ==, init" />
<row data-node="encrypt_write_ds_1.t_user_0" values="10, 10001, yK+tn8E43EyCEgbqNOrJ4w==, update" />
<row data-node="encrypt_write_ds_1.t_user_1" values="11, 11001, CIbxTwI742pGwxb18lQLkQ==, init" />
<row data-node="encrypt_write_ds_1.t_user_2" values="12, 12001, VCHpNlwod9AiuS1V+7DSLw==, init" />
<row data-node="encrypt_write_ds_1.t_user_3" values="13, 13001, 8uxRFhW4c2rtSOoesudk/A==, init" />
<row data-node="encrypt_write_ds_1.t_user_4" values="14, 14001, 6dL4zoSI6hLaOqPg3VCiWQ==, init" />
<row data-node="encrypt_write_ds_1.t_user_5" values="15, 15001, sqE82LdK1u2e43ZtMl/JNw==, init" />
<row data-node="encrypt_write_ds_1.t_user_6" values="16, 16001, j9uwIi056TLTk+X70X/Pmw==, init" />
<row data-node="encrypt_write_ds_1.t_user_7" values="17, 17001, 4EHWjOuIzrK7eGNbCqjfWg==, init" />
<row data-node="encrypt_write_ds_1.t_user_8" values="18, 18001, uqt780pm9cFOZA030qN6QQ==, init" />
<row data-node="encrypt_write_ds_1.t_user_9" values="19, 19001, fxMzWyyejZC7ZbJmMmGQzw==, init" />
<row data-node="encrypt_write_ds_2.t_user_0" values="20, 10002, CsW4MD6vPLjo8+hGL0Bo4w==, init" />
<row data-node="encrypt_write_ds_2.t_user_1" values="21, 11002, PVA6mbMm1kkSMHSjsArNMg==, init" />
<row data-node="encrypt_write_ds_2.t_user_2" values="22, 12002, k2NWLEtJ6ZZFpnxh5Va5DA==, init" />
<row data-node="encrypt_write_ds_2.t_user_3" values="23, 13002, 8EPPc+b2XMq9YSvOcEEing==, init" />
<row data-node="encrypt_write_ds_2.t_user_4" values="24, 14002, zAaiW1TwDTujcIEdhVLXlg==, init" />
<row data-node="encrypt_write_ds_2.t_user_5" values="25, 15002, y3M+uxIBPPqxewV/sQCzlw==, init" />
<row data-node="encrypt_write_ds_2.t_user_6" values="26, 16002, TDUjigcYh2VVd/RYWRDaWg==, init" />
<row data-node="encrypt_write_ds_2.t_user_7" values="27, 17002, yhTlcXGbfBeEM/7PK3f5pQ==, init" />
<row data-node="encrypt_write_ds_2.t_user_8" values="28, 18002, auRfbGy1FVUPOxL/RFxBQA==, init" />
<row data-node="encrypt_write_ds_2.t_user_9" values="29, 19002, aFMSknQG8p6wTGIhKNqJWg==, init" />
<row data-node="encrypt_write_ds_3.t_user_0" values="30, 10003, ZcI0/2rZRwtl8CkoWnyNYg==, init" />
<row data-node="encrypt_write_ds_3.t_user_1" values="31, 11003, Yz0R+SlE3AlO7jiOXOORog==, init" />
<row data-node="encrypt_write_ds_3.t_user_2" values="32, 12003, I05miGKGMDNM5c7b+ibkng==, init" />
<row data-node="encrypt_write_ds_3.t_user_3" values="33, 13003, GZmRSNc3jADLc9ca7MHHUQ==, init" />
<row data-node="encrypt_write_ds_3.t_user_4" values="34, 14003, OCQD6nAXGxKym6ERLT8Ocg==, init" />
<row data-node="encrypt_write_ds_3.t_user_5" values="35, 15003, 43zyfbMMwczKlyyhhyo4DA==, init" />
<row data-node="encrypt_write_ds_3.t_user_6" values="36, 16003, 5UttfMTwhqlMif3YKOOh7Q==, init" />
<row data-node="encrypt_write_ds_3.t_user_7" values="37, 17003, Iwh3hT6Kff/xYsyXNGtf8A==, init" />
<row data-node="encrypt_write_ds_3.t_user_8" values="38, 18003, QFyiP7og+19ijdQBLO91TA==, init" />
<row data-node="encrypt_write_ds_3.t_user_9" values="39, 19003, g+dSiuA7EsW3tDs+20j4yQ==, init" />
<row data-node="encrypt_write_ds_4.t_user_0" values="40, 10004, vu7rg5Fx+p4sf7PY3F/XkA==, init" />
<row data-node="encrypt_write_ds_4.t_user_1" values="41, 11004, R2jShanHkB8vL+3PWVtGCw==, init" />
<row data-node="encrypt_write_ds_4.t_user_2" values="42, 12004, lVWyZQPlVdUhiPRjdVTQXg==, init" />
<row data-node="encrypt_write_ds_4.t_user_3" values="43, 13004, 77bOsjoqDkWSiv7+Ij6n2Q==, init" />
<row data-node="encrypt_write_ds_4.t_user_4" values="44, 14004, wVwIeANTfyuYr271gpk0sQ==, init" />
<row data-node="encrypt_write_ds_4.t_user_5" values="45, 15004, foDB+Gm5QYUYokwTfxTsCw==, init" />
<row data-node="encrypt_write_ds_4.t_user_6" values="46, 16004, F2m3crkR88VuM/HEbO7j+A==, init" />
<row data-node="encrypt_write_ds_4.t_user_7" values="47, 17004, t7PvURIBPbs5zGoLqrBtFQ==, init" />
<row data-node="encrypt_write_ds_4.t_user_8" values="48, 18004, +pK5nh/SWW33b6pNK3YvCQ==, init" />
<row data-node="encrypt_write_ds_4.t_user_9" values="49, 19004, uB2f4cc9dGRLuuWXYFsZQg==, init" />
<row data-node="encrypt_write_ds_5.t_user_0" values="50, 10005, SdNz2ZEWqomcNqmrjV5CLg==, init" />
<row data-node="encrypt_write_ds_5.t_user_1" values="51, 11005, 7j2sicl9fY79dgvDjoVQ6A==, init" />
<row data-node="encrypt_write_ds_5.t_user_2" values="52, 12005, OQQ0iVzwLd3wAyiEagRb1w==, init" />
<row data-node="encrypt_write_ds_5.t_user_3" values="53, 13005, kGUn2kRm9f1pd5lRNTLV4w==, init" />
<row data-node="encrypt_write_ds_5.t_user_4" values="54, 14005, PKmA/7slVN/2HNhKLj0XoQ==, init" />
<row data-node="encrypt_write_ds_5.t_user_5" values="55, 15005, aG1YPC3uDNgH1gzlUrn21g==, init" />
<row data-node="encrypt_write_ds_5.t_user_6" values="56, 16005, qQmnX5II/jxrQWKBpDpCrg==, init" />
<row data-node="encrypt_write_ds_5.t_user_7" values="57, 17005, icdC0wx8+ftXLQYScnrdPA==, init" />
<row data-node="encrypt_write_ds_5.t_user_8" values="58, 18005, 9B8R0rlykQDYUKJN2iF5TQ==, init" />
<row data-node="encrypt_write_ds_5.t_user_9" values="59, 19005, QBp/kRwtb9FMDJS9p/QJRw==, init" />
<row data-node="encrypt_write_ds_6.t_user_0" values="60, 10006, rJO2CWjwyQRPN1Z8ubPT+g==, init" />
<row data-node="encrypt_write_ds_6.t_user_1" values="61, 11006, g0EzKaaNKrAN/SY0ZHgiPA==, init" />
<row data-node="encrypt_write_ds_6.t_user_2" values="62, 12006, g3P579hpR4nHHN740FwEPw==, init" />
<row data-node="encrypt_write_ds_6.t_user_3" values="63, 13006, /EST/RbrI3KpinjQljr5lQ==, init" />
<row data-node="encrypt_write_ds_6.t_user_4" values="64, 14006, 8LJsk/W05nOpqZ2LTNaR9g==, init" />
<row data-node="encrypt_write_ds_6.t_user_5" values="65, 15006, 081QjmH+mVkoYLdFkrQUdw==, init" />
<row data-node="encrypt_write_ds_6.t_user_6" values="66, 16006, HFrbbKF6I2PWR2XFUl5aoQ==, init" />
<row data-node="encrypt_write_ds_6.t_user_7" values="67, 17006, ckb4oY9Bgo3T3HadoIJBHQ==, init" />
<row data-node="encrypt_write_ds_6.t_user_8" values="68, 18006, r6JhpT0Uu3iv2TrijQ+4dw==, init" />
<row data-node="encrypt_write_ds_6.t_user_9" values="69, 19006, 0W0/tHYJxu/+suDfkhwBUA==, init" />
<row data-node="encrypt_write_ds_7.t_user_0" values="70, 10007, qewDwKyvX2y1mrPOAjvnJw==, init" />
<row data-node="encrypt_write_ds_7.t_user_1" values="71, 11007, ZaeVy/q9wyUCBzjEGqMAOw==, init" />
<row data-node="encrypt_write_ds_7.t_user_2" values="72, 12007, gHRriIh3YL7E+r/vJhF1BA==, init" />
<row data-node="encrypt_write_ds_7.t_user_3" values="73, 13007, oz+WFVBXdigh4pYhLQIqMQ==, init" />
<row data-node="encrypt_write_ds_7.t_user_4" values="74, 14007, NAaO2Q6gWHXMjSY4MhtOBw==, init" />
<row data-node="encrypt_write_ds_7.t_user_5" values="75, 15007, zngftEpibgSVznPpdW+Iww==, init" />
<row data-node="encrypt_write_ds_7.t_user_6" values="76, 16007, pcIWo58GiXizmF9XoUFi5Q==, init" />
<row data-node="encrypt_write_ds_7.t_user_7" values="77, 17007, OrZ0BTU9guaRAsvlllMP2A==, init" />
<row data-node="encrypt_write_ds_7.t_user_8" values="78, 18007, ICGcSjYHEC/UUHBiDEZ3Ig==, init" />
<row data-node="encrypt_write_ds_7.t_user_9" values="79, 19007, JhZvTKXmZbgSV8f0Il+hfA==, init" />
<row data-node="encrypt_write_ds_8.t_user_0" values="80, 10008, t50lbUWg9IG0DUK3wvsuVQ==, init" />
<row data-node="encrypt_write_ds_8.t_user_1" values="81, 11008, GFbH0x9bKgNjca82L6LQ8g==, init" />
<row data-node="encrypt_write_ds_8.t_user_2" values="82, 12008, ZgTchBeCBGjrRUhFa+N8fg==, init" />
<row data-node="encrypt_write_ds_8.t_user_3" values="83, 13008, 4AO+TW07gsDFrhfhKH56Og==, init" />
<row data-node="encrypt_write_ds_8.t_user_4" values="84, 14008, lQ93gD5gVKromV64BHAomw==, init" />
<row data-node="encrypt_write_ds_8.t_user_5" values="85, 15008, 3n887cFYFd7u7hWpguDAdQ==, init" />
<row data-node="encrypt_write_ds_8.t_user_6" values="86, 16008, uHlcR+ZUiDqhdJkqKAjxnQ==, init" />
<row data-node="encrypt_write_ds_8.t_user_7" values="87, 17008, 3qhS1Leu2nDv/QZ2Agw4iQ==, init" />
<row data-node="encrypt_write_ds_8.t_user_8" values="88, 18008, G/HK36BIpcVXvfkF3gjjcA==, init" />
<row data-node="encrypt_write_ds_8.t_user_9" values="89, 19008, TF60AIoPWjR9SFb4y26a0w==, init" />
<row data-node="encrypt_write_ds_9.t_user_0" values="90, 10009, BtkhhvF5z6PGgkS7+3X7lw==, init" />
<row data-node="encrypt_write_ds_9.t_user_1" values="91, 11009, 72yl4Zn7/SUBTForYmkdRg==, init" />
<row data-node="encrypt_write_ds_9.t_user_2" values="92, 12009, qQkkak2if+eUUuomqvcjpA==, init" />
<row data-node="encrypt_write_ds_9.t_user_3" values="93, 13009, Voj+XVu4Qmr5CyUWOouK+w==, init" />
<row data-node="encrypt_write_ds_9.t_user_4" values="94, 14009, gGEW0Da+8FKpiRnBnfSUmA==, init" />
<row data-node="encrypt_write_ds_9.t_user_5" values="95, 15009, 8psHAH0NJ5fdK5ZGmdP/wQ==, init" />
<row data-node="encrypt_write_ds_9.t_user_6" values="96, 16009, 654WkfIPBEv2nfyhmgHP8A==, init" />
<row data-node="encrypt_write_ds_9.t_user_7" values="97, 17009, 4cs88JOZMhtFn6C04H+rxA==, init" />
<row data-node="encrypt_write_ds_9.t_user_8" values="98, 18009, bjkyDftrAIaEJSlibxiVkg==, init" />
<row data-node="encrypt_write_ds_9.t_user_9" values="99, 19009, Ou8qESKecbqmABoIo+5Kpg==, init" />
</dataset>
```
|
```python
#!/pxrpythonsubst
#
#
# path_to_url
from pxr import Sdf, Vt
import unittest
class TestSdfVariableExpression(unittest.TestCase):
def assertEvaluates(self, e, exprVars, expected,
expectedUsedVars=None):
def _GetFailedAssertMessage():
return "Evaluating {} with vars {}".format(e, exprVars)
expr = Sdf.VariableExpression(e)
self.assertTrue(expr, _GetFailedAssertMessage())
result = expr.Evaluate(exprVars)
self.assertFalse(result.errors, _GetFailedAssertMessage())
self.assertEqual(
result.value, expected, _GetFailedAssertMessage())
if expectedUsedVars:
self.assertEqual(
set(result.usedVariables), set(expectedUsedVars),
_GetFailedAssertMessage())
def assertEvaluationErrors(self, e, exprVars, expectedErrors):
def _GetFailedAssertMessage():
return "Evaluating {} with vars {}".format(e, exprVars)
expr = Sdf.VariableExpression(e)
self.assertTrue(expr, _GetFailedAssertMessage())
result = expr.Evaluate(exprVars)
self.assertIsNone(result.value, _GetFailedAssertMessage())
self.assertTrue(result.errors, _GetFailedAssertMessage())
self.assertEqual(
set(result.errors), set(expectedErrors),
_GetFailedAssertMessage())
def assertValid(self, e):
expr = Sdf.VariableExpression(e)
self.assertTrue(expr)
self.assertFalse(expr.GetErrors())
def assertInvalid(self, e):
expr = Sdf.VariableExpression(e)
self.assertFalse(expr)
self.assertTrue(expr.GetErrors())
def test_AuthoringExpressionVariables(self):
layer = Sdf.Layer.CreateAnonymous()
self.assertFalse(layer.HasExpressionVariables())
self.assertEqual(layer.expressionVariables, {})
expressionVars = { "str" :"Y", "num": 0, "b" : False }
layer.expressionVariables = expressionVars
self.assertTrue(layer.HasExpressionVariables())
self.assertEqual(layer.expressionVariables, expressionVars)
layer.ClearExpressionVariables()
self.assertFalse(layer.HasExpressionVariables())
self.assertEqual(layer.expressionVariables, {})
def test_Default(self):
e = Sdf.VariableExpression()
self.assertFalse(e)
self.assertEqual(str(e), "")
self.assertEqual(e.GetErrors(), ["No expression specified"])
def test_IsExpression(self):
"""Test Sdf.VariableExpression.IsExpression"""
self.assertTrue(Sdf.VariableExpression.IsExpression("`foo`"))
self.assertFalse(Sdf.VariableExpression.IsExpression("foo"))
def test_IsValidVariableType(self):
"""Test Sdf.VariableExpression.IsValidVariableType"""
IsValidVariableType = Sdf.VariableExpression.IsValidVariableType
self.assertTrue(IsValidVariableType("string"))
self.assertTrue(IsValidVariableType(True))
self.assertTrue(IsValidVariableType(None))
# Explicitly verify that both int and int64 are considered valid
# variable types, even though the result of evaluation will always
# be an int64.
self.assertTrue(IsValidVariableType(Vt.Int(123)))
self.assertTrue(IsValidVariableType(Vt.Int64(2**63-1)))
self.assertTrue(IsValidVariableType(Vt.StringArray(['a', 'b'])))
self.assertTrue(IsValidVariableType(Vt.BoolArray([True, False])))
self.assertTrue(IsValidVariableType(Vt.IntArray([123, 456])))
self.assertTrue(IsValidVariableType(Vt.Int64Array([123, 456])))
self.assertFalse(IsValidVariableType(1.23))
self.assertFalse(IsValidVariableType(Vt.DoubleArray([1.23, 4.56])))
def test_VarExpressions(self):
"""Test variable expressions consisting of just a top-level
substitution."""
# Evaluating a top-level variable substitution should
# yield the exact value given in the variables dictionary.
self.assertEvaluates(
"`${FOO}`", {"FOO" : "string"},
expected="string",
expectedUsedVars=["FOO"])
self.assertEvaluates(
"`${FOO}`", {"FOO" : 42},
expected=42,
expectedUsedVars=["FOO"])
self.assertEvaluates(
"`${FOO}`", {"FOO" : True},
expected=True,
expectedUsedVars=["FOO"])
self.assertEvaluates(
"`${FOO}`", {"FOO" : None},
expected=None,
expectedUsedVars=["FOO"])
self.assertEvaluates(
"`${FOO}`", {"FOO" : Vt.StringArray(['foo', 'bar'])},
expected=['foo', 'bar'],
expectedUsedVars=["FOO"])
self.assertEvaluates(
"`${FOO}`", {"FOO" : Vt.IntArray([1, 2, 3])},
expected=[1, 2, 3],
expectedUsedVars=["FOO"])
self.assertEvaluates(
"`${FOO}`", {"FOO" : Vt.Int64Array([1, 2, 3])},
expected=[1, 2, 3],
expectedUsedVars=["FOO"])
self.assertEvaluates(
"`${FOO}`", {"FOO" : Vt.BoolArray([True, False])},
expected=[True, False],
expectedUsedVars=["FOO"])
# If no value is found for the specified var, we should
# get an error.
self.assertEvaluationErrors(
"`${FOO}`", { },
["No value for variable 'FOO'"])
# Test invalid expressions
self.assertInvalid("`${FO-O}`")
self.assertInvalid("`${FOO`")
def test_StringExpressions(self):
"""Test string expressions."""
# Test both single- and double-quoted strings.
self.assertEvaluates(
'''`''`''', {},
expected='',
expectedUsedVars=[])
self.assertEvaluates(
'''`""`''', {},
expected='',
expectedUsedVars=[])
self.assertEvaluates(
'''`"basic_string"`''', {},
expected="basic_string",
expectedUsedVars=[])
self.assertEvaluates(
'''`'basic_string'`''', {},
expected="basic_string",
expectedUsedVars=[])
self.assertEvaluates(
r'''`"quoted_\"double\"_'single'_test"`''', {},
expected='''quoted_"double"_'single'_test''',
expectedUsedVars=[])
self.assertEvaluates(
r'''`'quoted_"double"_\'single\'_test'`''', {},
expected='''quoted_"double"_'single'_test''',
expectedUsedVars=[])
self.assertEvaluates(
'''`"string_${A}_${B}"`''',
{"A" : "substitution", "B" : "works"},
expected="string_substitution_works",
expectedUsedVars=["A", "B"])
self.assertEvaluates(
'''`'string_${A}_${B}'`''',
{"A" : "substitution", "B" : "works"},
expected="string_substitution_works",
expectedUsedVars=["A", "B"])
# 'None' is considered an empty string for substitution purposes.
self.assertEvaluates(
'''`'none_sub_${A}'`''',
{"A" : None},
expected="none_sub_",
expectedUsedVars=["A"])
# Substitutions using other non-string types are disallowed.
self.assertEvaluationErrors(
'''`'bad_sub_${A}'`''', {"A" : 0},
["String value required for substituting variable 'A', got int."])
self.assertEvaluationErrors(
'''`'bad_sub_${A}'`''', {"A" : True},
["String value required for substituting variable 'A', got bool."])
# No substitutions occur here since the '$' is escaped,
# so \${A} and \${B} aren't recognized as subsitutions.
self.assertEvaluates(
r'''`"nosubs_\${A}_\${B}"`''',
{"A" : "substitution", "B" : "works"},
expected="nosubs_${A}_${B}",
expectedUsedVars=[])
self.assertEvaluates(
r'''`'nosubs_\${A}_\${B}'`''',
{"A" : "substitution", "B" : "works"},
expected="nosubs_${A}_${B}",
expectedUsedVars=[])
# Test invalid expressions
self.assertInvalid('''`"unescaped_"quotes"_are_bad"`''')
self.assertInvalid('''`'unescaped_'quotes'_are_bad'`''')
self.assertInvalid('`"bad_var_${FOO"`')
self.assertInvalid('`"bad_var_${FO-O}"`')
self.assertInvalid("`'`")
self.assertInvalid('`"`')
def test_IntegerExpressions(self):
"""Test integer expressions."""
self.assertEvaluates("`0`", {}, 0)
self.assertEvaluates("`-1`", {}, -1)
self.assertEvaluates("`1`", {}, 1)
# Test that integer values within an int64's range are allowed
# and are invalid if they're outside that range.
self.assertEvaluates("`{}`".format(2**63-1), {}, 2**63-1)
self.assertInvalid("`{}`".format(2**63))
self.assertEvaluates("`{}`".format(-2**63), {}, -2**63)
self.assertInvalid("`{}`".format(-2**63-1))
self.assertInvalid("`42abc`")
# Explicitly test that both int and int64 values in the expression
# variables dictionary are accepted during evaluation, even though
# the final result will always be an int64.
self.assertEvaluates("`${FOO}`", {"FOO" : Vt.Int(0)}, 0)
self.assertEvaluates("`${FOO}`", {"FOO" : Vt.Int64(2**63-1)}, 2**63-1)
def test_BooleanExpressions(self):
"""Test boolean expressions."""
self.assertEvaluates("`True`", {}, True)
self.assertEvaluates("`true`", {}, True)
self.assertEvaluates("`False`", {}, False)
self.assertEvaluates("`false`", {}, False)
self.assertInvalid("`Truee`")
self.assertInvalid("`truee`")
self.assertInvalid("`TRUE`")
self.assertInvalid("`Falsee`")
self.assertInvalid("`falsee`")
self.assertInvalid("`FALSE`")
def test_NoneExpressions(self):
"""Test None expressions."""
self.assertEvaluates("`None`", {}, None)
self.assertEvaluates("`none`", {}, None)
self.assertInvalid("`Nonee`")
self.assertInvalid("`nonee`")
def test_Lists(self):
"""Test list expressions."""
self.assertEvaluates("`[]`", {}, [])
# Test list of integers.
self.assertEvaluates(
"`[1]`", {}, Vt.Int64Array([1]))
self.assertEvaluates(
"`[1, 2]`", {}, Vt.Int64Array([1, 2]))
self.assertEvaluates(
"`[1, 2, 3]`", {}, Vt.Int64Array([1, 2, 3]))
self.assertEvaluates(
"`[${FOO}, 2, 3]`", {'FOO' : 1}, Vt.Int64Array([1, 2, 3]))
self.assertEvaluates(
"`[1, ${FOO}, 3]`", {'FOO' : 2}, Vt.Int64Array([1, 2, 3]))
self.assertEvaluates(
"`[1, 2, ${FOO}]`", {'FOO' : 3}, Vt.Int64Array([1, 2, 3]))
# Test list of strings.
self.assertEvaluates(
"`['a']`", {}, Vt.StringArray(['a']))
self.assertEvaluates(
"`['a', 'b']`", {}, Vt.StringArray(['a', 'b']))
self.assertEvaluates(
"`['a', 'b', 'c']`", {}, Vt.StringArray(['a', 'b', 'c']))
self.assertEvaluates(
"`['${FOO}a', 'b', 'c']`", {'FOO' :'a'},
Vt.StringArray(['aa', 'b', 'c']))
self.assertEvaluates(
"`['a', '${FOO}b', 'c']`", {'FOO' :'b'},
Vt.StringArray(['a', 'bb', 'c']))
self.assertEvaluates(
"`['a', 'b', '${FOO}c']`", {'FOO' :'c'},
Vt.StringArray(['a', 'b', 'cc']))
# Test list of variable substitutions.
self.assertEvaluates(
"`[${FOO}]`", {'FOO':'a'}, Vt.StringArray(['a']))
self.assertEvaluates(
"`[${FOO}, ${BAR}]`", {'FOO':'a', 'BAR':'b'},
Vt.StringArray(['a', 'b']))
self.assertEvaluates(
"`[${FOO}, ${BAR}, ${BAZ}]`",
{'FOO':'a', 'BAR':'b', 'BAZ':'c'},
Vt.StringArray(['a', 'b', 'c']))
# Lists cannot contain None values.
self.assertEvaluationErrors(
"`[None]`", {},
["Unexpected value of type None in list at element 0"])
self.assertEvaluationErrors(
"`[None, 2, 3]`", {},
["Unexpected value of type None in list at element 0"])
self.assertEvaluationErrors(
"`[1, ${FOO}, 3]`", {'FOO' : None},
["Unexpected value of type None in list at element 1"])
# Lists cannot contain other lists.
self.assertInvalid("`[[1, 2]]`")
self.assertEvaluationErrors(
"`[${L}]`", {'L': "`[]`"},
["Unexpected value of type list in list at element 0"])
self.assertEvaluationErrors(
"`[${L}]`", {'L': Vt.IntArray([1,2]) },
["Unexpected value of type list in list at element 0"])
# Lists must contain elements of the same type.
self.assertEvaluationErrors(
"`[1, 'foo', False, ${L}]`", {'L': "`[]`"},
['Unexpected value of type string in list at element 1',
'Unexpected value of type bool in list at element 2',
'Unexpected value of type list in list at element 3'])
self.assertInvalid("`[`")
self.assertInvalid("`[foo]`")
def test_If(self):
"""Test if function."""
self.assertInvalid("`if()`")
self.assertInvalid("`if(True)`")
self.assertEvaluates("`if(True, 'true', 'false')`", {}, 'true')
self.assertEvaluates("`if(False, 'true', 'false')`", {}, 'false')
self.assertEvaluates("`if(True, 'true')`", {}, 'true')
self.assertEvaluates("`if(False, 'true')`", {}, None)
self.assertEvaluates("`if(${B}, 1, 0)`", {'B' : True}, 1)
self.assertEvaluates("`if(${B}, 1, 0)`", {'B' : False}, 0)
self.assertEvaluates(
"`if(${B}, ${X}, ${Y})`", {'B' : True, 'X': 1, 'Y': 0}, 1)
self.assertEvaluates(
"`if(${B}, ${X}, ${Y})`", {'B' : False, 'X': 1, 'Y': 0}, 0)
self.assertEvaluates(
"`if(${B}, if(${X}, 1, 2), if(${Y}, 3, 4))`",
{'B' : True, 'X': True, 'Y': True}, 1)
self.assertEvaluates(
"`if(${B}, if(${X}, 1, 2), if(${Y}, 3, 4))`",
{'B' : True, 'X': False, 'Y': True}, 2)
self.assertEvaluates(
"`if(${B}, if(${X}, 1, 2), if(${Y}, 3, 4))`",
{'B' : False, 'X': True, 'Y': True}, 3)
self.assertEvaluates(
"`if(${B}, if(${X}, 1, 2), if(${Y}, 3, 4))`",
{'B' : False, 'X': True, 'Y': False}, 4)
self.assertEvaluationErrors(
"`if('non_bool', 1, 0)`", {},
['if: Condition must be a boolean value'])
self.assertEvaluationErrors(
"`if(${B}, 1, 0)`", {'B' : 'non_bool'},
['if: Condition must be a boolean value'])
# if and else values must be of the same type, or None.
self.assertEvaluates("`if(False, 1, None)`", {}, None)
self.assertEvaluates("`if(False, None, 1)`", {}, 1)
self.assertEvaluationErrors(
"`if(False, 1, 'foo')`", {},
['if: if-value and else-value must evaluate to the same type '
'or None.'])
self.assertEvaluationErrors(
"`if(False, 'foo', 1)`", {},
['if: if-value and else-value must evaluate to the same type '
'or None.'])
# Evaluation errors from subexpressions should be reported to clients.
self.assertEvaluationErrors(
"`if(eq(1, '1'), 1, 0)`", {},
['eq: Cannot compare values of type int and string'])
def test_Comparisons(self):
"""Test comparison functions: eq, neq, lt, leq, gt, geq"""
def _Test(fnName, comparator):
def _MakeExpression(*operands):
operandStrs = [str(s) for s in operands]
x = "`{fnName}({operands})`".format(
fnName=fnName, operands=",".join(operandStrs))
return x
# All comparison functions take 2 arguments.
self.assertInvalid(_MakeExpression()) # e.g., "`eq()`"
self.assertInvalid(_MakeExpression(1)) # e.g., "`eq(1)`"
self.assertInvalid(_MakeExpression(1, 2, 3)) # e.g., "`eq(1,2,3)`"
# Verify valid comparisons return the expected results.
# Note that comparing None values is only supported by the
# "eq" and "neq" functions.
testCases = [
(0, 1), (1, 1), (1, 2),
(r"'a'", r"'a'"), (r"'a'", r"'b'"), (r"'b'", r"'c'"),
(True, True), (True, False), (False, True)
]
if fnName == "eq" or fnName == "neq":
testCases.append((None, None))
for testCase in testCases:
# e.g., check that "`eq(1, 1)`" evaluates to the same
# result as 1 == 1.
self.assertEvaluates(
_MakeExpression(*testCase), {}, comparator(*testCase))
# Verify that invalid comparisons return the expected errors.
testCases = [
(0, r"'a'",
"{}: Cannot compare values of type int and string"
.format(fnName)),
(0, False,
"{}: Cannot compare values of type int and bool"
.format(fnName)),
(0, "None",
"{}: Cannot compare values of type int and None"
.format(fnName)),
(r"'a'", False,
"{}: Cannot compare values of type string and bool"
.format(fnName)),
(r"'a'", "None",
"{}: Cannot compare values of type string and None"
.format(fnName)),
(False, "None",
"{}: Cannot compare values of type bool and None"
.format(fnName)),
]
if fnName != "eq" and fnName != "neq":
testCases.append(
(None, None,
"{}: Comparison operation not supported for None"
.format(fnName)))
for testCase in testCases:
self.assertEvaluationErrors(
"`{fn}({0},{1})`".format(fn=fnName, *testCase), {},
[testCase[2]])
_Test("eq", lambda x,y: x == y)
_Test("neq", lambda x,y: x != y)
_Test("lt", lambda x,y: x < y)
_Test("leq", lambda x,y: x <= y)
_Test("gt", lambda x,y: x > y)
_Test("geq", lambda x,y: x >= y)
def test_AndOr(self):
"""Test logical and/or functions"""
def _Test(fnName, comparator):
def _MakeExpression(*operands):
operandStrs = [str(s) for s in operands]
x = "`{fnName}({operands})`".format(
fnName=fnName, operands=",".join(operandStrs))
return x
# "and" / "or" both require at least 2 arguments.
self.assertInvalid(_MakeExpression())
self.assertInvalid(_MakeExpression(True))
# Verify valid combinations return the the expected result.
testCases = [
(True, True),
(True, False),
(False, False),
(True, True, True),
(True, True, False)
]
for testCase in testCases:
self.assertEvaluates(
_MakeExpression(*testCase), {}, comparator(testCase))
# Verify that invalid combinations return the expected errors.
testCases = [
(True, 1,
"{}: Invalid type int for argument 1".format(fnName)),
(True, "'foo'",
"{}: Invalid type string for argument 1".format(fnName)),
(True, "None",
"{}: Invalid type None for argument 1".format(fnName))
]
for testCase in testCases:
self.assertEvaluationErrors(
_MakeExpression(*testCase[0:2]), {}, [testCase[2]])
_Test("and", lambda l: all(l))
_Test("or", lambda l: any(l))
def test_Not(self):
"""Test logical not function."""
self.assertInvalid("`not()`")
self.assertInvalid("`not(True, False)`")
self.assertEvaluates("`not(True)`", {}, False)
self.assertEvaluates("`not(False)`", {}, True)
self.assertEvaluationErrors(
"`not(1)`", {}, ["not: Invalid type int for argument"])
self.assertEvaluationErrors(
"`not('foo')`", {}, ["not: Invalid type string for argument"])
self.assertEvaluationErrors(
"`not(None)`", {}, ["not: Invalid type None for argument"])
def test_Contains(self):
"""Test contains function."""
# Test searching in lists.
self.assertEvaluates(
"`contains([], 1)`", {}, False)
self.assertEvaluates(
"`contains(${L}, 1)`", {'L' : Vt.IntArray([])}, False)
self.assertEvaluates(
"`contains(${L}, 1)`", {'L' : "`[]`"}, False)
self.assertEvaluates("`contains([1, 2, 3], 1)`", {}, True)
self.assertEvaluates("`contains([1, 2, 3], 0)`", {}, False)
self.assertEvaluates(
"`contains(${L}, 1)`", {'L' : Vt.IntArray([1, 2, 3])}, True)
self.assertEvaluates(
"`contains(${L}, 0)`", {'L' : Vt.IntArray([1, 2, 3])}, False)
self.assertEvaluates("`contains([1, 2, 3], ${A})`", {'A' : 2}, True)
self.assertEvaluates("`contains([1, 2, 3], ${A})`", {'A' : 4}, False)
self.assertEvaluates(
"`contains([${A}, ${B}], 'a')`", {'A':'a', 'B':'b'}, True)
self.assertEvaluates(
"`contains([${A}, ${B}], 'c')`", {'A':'a', 'B':'b'}, False)
self.assertEvaluationErrors(
"`contains([1, 2, 3], 'a')`", {},
["contains: Invalid search value"])
self.assertEvaluationErrors(
"`contains([1, 2, 3], None)`", {},
["contains: Invalid search value"])
# Test searching in strings.
self.assertEvaluates("`contains('', 'a')`", {}, False)
self.assertEvaluates("`contains('abc', 'a')`", {}, True)
self.assertEvaluates("`contains('abc', 'z')`", {}, False)
self.assertEvaluates("`contains('abc', ${A})`", {'A':'a'}, True)
self.assertEvaluates("`contains('abc', ${Z})`", {'Z':'z'}, False)
self.assertEvaluates(
"`contains('${A}${B}', 'a')`", {'A':'a', 'B':'b'}, True)
self.assertEvaluates(
"`contains('${A}${B}', 'z')`", {'A':'a', 'B':'b'}, False)
self.assertEvaluationErrors(
"`contains('abcd', 1)`", {},
["contains: Invalid search value"])
self.assertEvaluationErrors(
"`contains('abcd', None)`", {},
["contains: Invalid search value"])
# Other errors
self.assertInvalid("`contains('abcd')`")
self.assertEvaluationErrors(
"`contains(1, 1)`", {},
["contains: Value to search must be a list or string"])
self.assertEvaluationErrors(
"`contains(None, 1)`", {},
["contains: Value to search must be a list or string"])
def test_At(self):
"""Test at function."""
# Test getting value from list
self.assertEvaluates("`at([1, 2, 3], 0)`", {}, 1)
self.assertEvaluates("`at([1, 2, 3], 1)`", {}, 2)
self.assertEvaluates("`at([1, 2, 3], 2)`", {}, 3)
self.assertEvaluates("`at([1, 2, 3], -1)`", {}, 3)
self.assertEvaluates("`at([1, 2, 3], -2)`", {}, 2)
self.assertEvaluates("`at([1, 2, 3], -3)`", {}, 1)
self.assertEvaluationErrors(
"`at([1, 2, 3], 3)`", {}, ['at: Index out of range'])
self.assertEvaluationErrors(
"`at([1, 2, 3], -4)`", {}, ['at: Index out of range'])
self.assertEvaluationErrors(
"`at([], 0)`", {}, ['at: Index out of range'])
self.assertEvaluationErrors(
"`at([1, 2, 3], 'foo')`", {}, ['at: Index must be an integer'])
self.assertEvaluationErrors(
"`at([1, 2, 3], True)`", {}, ['at: Index must be an integer'])
self.assertEvaluationErrors(
"`at([1, 2, 3], None)`", {}, ['at: Index must be an integer'])
# Tests getting value from string
self.assertEvaluates("`at('abc', 0)`", {}, 'a')
self.assertEvaluates("`at('abc', 1)`", {}, 'b')
self.assertEvaluates("`at('abc', 2)`", {}, 'c')
self.assertEvaluates("`at('abc', -1)`", {}, 'c')
self.assertEvaluates("`at('abc', -2)`", {}, 'b')
self.assertEvaluates("`at('abc', -3)`", {}, 'a')
self.assertEvaluationErrors(
"`at('abc', 3)`", {}, ['at: Index out of range'])
self.assertEvaluationErrors(
"`at('abc', -4)`", {}, ['at: Index out of range'])
self.assertEvaluationErrors(
"`at('', 0)`", {}, ['at: Index out of range'])
self.assertEvaluationErrors(
"`at('abc', 'foo')`", {}, ['at: Index must be an integer'])
self.assertEvaluationErrors(
"`at('abc', True)`", {}, ['at: Index must be an integer'])
self.assertEvaluationErrors(
"`at('abc', None)`", {}, ['at: Index must be an integer'])
def test_Len(self):
"""Tests len function."""
self.assertInvalid("`len()`")
self.assertEvaluates("`len([])`", {}, 0)
self.assertEvaluates("`len([1, 2, 3])`", {}, 3)
self.assertEvaluates("`len('')`", {}, 0)
self.assertEvaluates("`len('abc')`", {}, 3)
self.assertEvaluationErrors(
"`len(1)`", {}, ['len: Unsupported type'])
self.assertEvaluationErrors(
"`len(False)`", {}, ['len: Unsupported type'])
self.assertEvaluationErrors(
"`len(None)`", {}, ['len: Unsupported type'])
def test_Defined(self):
"""Tests defined function."""
self.assertInvalid("`defined()`")
self.assertEvaluates("`defined('X')`", {}, False)
self.assertEvaluates("`defined('X')`", {'X':0}, True)
self.assertEvaluates("`defined('X','Y')`", {'X':0}, False)
self.assertEvaluates("`defined('X','Y')`", {'X':0, 'Y':1}, True)
self.assertEvaluationErrors(
"`defined(1)`", {},
["defined: Invalid type int for argument 0"])
self.assertEvaluationErrors(
"`defined(None)`", {},
["defined: Invalid type None for argument 0"])
def test_NestedExpressions(self):
"""Test evaluating expressions with variable substitutions
when the variables are expressions themselves."""
self.assertEvaluates(
"`${FOO}`",
{"FOO" : "`${BAR}`", "BAR" : "ok"},
"ok")
self.assertEvaluates(
"`${FOO}`",
{"FOO" : "`'subexpression_${BAR}'`",
"BAR" : "`'${BAZ}'`",
"BAZ" : "`'works_ok'`"},
"subexpression_works_ok")
self.assertEvaluates(
"`'${A}_${B}'`",
{"A" : "`'subexpression_${FOO}'`",
"FOO" : "`'${BAR}'`",
"BAR" : "`'works_ok'`",
"B" : "`${A}`"},
"subexpression_works_ok_subexpression_works_ok")
def test_CircularSubstitutions(self):
"""Test that circular variable substitutions result in an
error and not an infinite loop."""
self.assertEvaluationErrors(
"`${FOO}`",
{"FOO" : "`${BAR}`",
"BAR" : "`${BAZ}`",
"BAZ" : "`${FOO}`"},
["Encountered circular variable substitutions: "
"['FOO', 'BAR', 'BAZ', 'FOO']"])
def test_ErrorInNestedExpression(self):
"""Test that errors in subexpressions surface in final result."""
self.assertEvaluationErrors(
"`${FOO}`",
{"FOO" : "`'${BAR}'`",
"BAR" : "`${BAZ`"},
["Missing ending '}' at character 6 (in variable 'BAR')"])
def test_UnsupportedVariableType(self):
"""Test that references to variables whose values are an
unsupported type result in an error."""
self.assertEvaluationErrors(
"`${FOO}`",
{"FOO" : 1.234},
["Variable 'FOO' has unsupported type double"])
self.assertEvaluationErrors(
"`'test_${FOO}'`",
{"FOO" : 1.234},
["Variable 'FOO' has unsupported type double"])
if __name__ == "__main__":
unittest.main()
```
|
```c
/*
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall 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.
*/
/**
* @file
* libavformat multi-client network API usage example.
*
* @example http_multiclient.c
* This example will serve a file without decoding or demuxing it over http.
* Multiple clients can connect and will receive the same file.
*/
#include <libavformat/avformat.h>
#include <libavutil/opt.h>
#include <unistd.h>
void process_client(AVIOContext *client, const char *in_uri)
{
AVIOContext *input = NULL;
uint8_t buf[1024];
int ret, n, reply_code;
char *resource = NULL;
while ((ret = avio_handshake(client)) > 0) {
av_opt_get(client, "resource", AV_OPT_SEARCH_CHILDREN, &resource);
// check for strlen(resource) is necessary, because av_opt_get()
// may return empty string.
if (resource && strlen(resource))
break;
}
if (ret < 0)
goto end;
av_log(client, AV_LOG_TRACE, "resource=%p\n", resource);
if (resource && resource[0] == '/' && !strcmp((resource + 1), in_uri)) {
reply_code = 200;
} else {
reply_code = AVERROR_HTTP_NOT_FOUND;
}
if ((ret = av_opt_set_int(client, "reply_code", reply_code, AV_OPT_SEARCH_CHILDREN)) < 0) {
av_log(client, AV_LOG_ERROR, "Failed to set reply_code: %s.\n", av_err2str(ret));
goto end;
}
av_log(client, AV_LOG_TRACE, "Set reply code to %d\n", reply_code);
while ((ret = avio_handshake(client)) > 0);
if (ret < 0)
goto end;
fprintf(stderr, "Handshake performed.\n");
if (reply_code != 200)
goto end;
fprintf(stderr, "Opening input file.\n");
if ((ret = avio_open2(&input, in_uri, AVIO_FLAG_READ, NULL, NULL)) < 0) {
av_log(input, AV_LOG_ERROR, "Failed to open input: %s: %s.\n", in_uri,
av_err2str(ret));
goto end;
}
for(;;) {
n = avio_read(input, buf, sizeof(buf));
if (n < 0) {
if (n == AVERROR_EOF)
break;
av_log(input, AV_LOG_ERROR, "Error reading from input: %s.\n",
av_err2str(n));
break;
}
avio_write(client, buf, n);
avio_flush(client);
}
end:
fprintf(stderr, "Flushing client\n");
avio_flush(client);
fprintf(stderr, "Closing client\n");
avio_close(client);
fprintf(stderr, "Closing input\n");
avio_close(input);
}
int main(int argc, char **argv)
{
av_log_set_level(AV_LOG_TRACE);
AVDictionary *options = NULL;
AVIOContext *client = NULL, *server = NULL;
const char *in_uri, *out_uri;
int ret, pid;
if (argc < 3) {
printf("usage: %s input path_to_url"
"API example program to serve http to multiple clients.\n"
"\n", argv[0]);
return 1;
}
in_uri = argv[1];
out_uri = argv[2];
av_register_all();
avformat_network_init();
if ((ret = av_dict_set(&options, "listen", "2", 0)) < 0) {
fprintf(stderr, "Failed to set listen mode for server: %s\n", av_err2str(ret));
return ret;
}
if ((ret = avio_open2(&server, out_uri, AVIO_FLAG_WRITE, NULL, &options)) < 0) {
fprintf(stderr, "Failed to open server: %s\n", av_err2str(ret));
return ret;
}
fprintf(stderr, "Entering main loop.\n");
for(;;) {
if ((ret = avio_accept(server, &client)) < 0)
goto end;
fprintf(stderr, "Accepted client, forking process.\n");
// XXX: Since we don't reap our children and don't ignore signals
// this produces zombie processes.
pid = fork();
if (pid < 0) {
perror("Fork failed");
ret = AVERROR(errno);
goto end;
}
if (pid == 0) {
fprintf(stderr, "In child.\n");
process_client(client, in_uri);
avio_close(server);
exit(0);
}
if (pid > 0)
avio_close(client);
}
end:
avio_close(server);
if (ret < 0 && ret != AVERROR_EOF) {
fprintf(stderr, "Some errors occurred: %s\n", av_err2str(ret));
return 1;
}
return 0;
}
```
|
Stephanie Paul is a New Zealand actress and comedian. She starred as a Sarah Palin-esque United States president in the 2012 film Iron Sky.
Early work
She has been performing on stage since the age of four, and started her professional career as a teenager. She was featured in local commercials, and has since worked her way up from small Tostitos commercials to featuring in hundreds of commercials - including four Super Bowl commercials. Stephanie's ads span seven international markets, and she also works in theatre, film, and television.
Career
Paul is most well known in the 2012 Sci-Fi Comedy Iron Sky and the Iron Sky: Invasion Video Game, released in December 2012, and in both she plays the President of The United States. She reprised the role in the 2017 sequel Iron Sky: The Coming Race.
In 2012, Stephanie Paul was on the list of nominees for best supporting actress at AACTA for her role in Iron Sky, and is also known for her role as Pip Thomas in Tom Scott's Separation City. Additionally, she played the starring lead of Sarah Sloan in Douglas Underdhal's award-winning Film School Confidential. Stephanie has also been seen in various TV performances on shows such as The Bold and the Beautiful, Street Legal, and Amazing Extraordinary Friends to name a few.
In 1998, she crossed the pond to the United States where she studied at the Neighborhood Playhouse in New York City, home of the Sanford Meisner Technique. In New York, Stephanie earned credits working in theatre and film. Then, in 2001, she moved to San Francisco to continue working in commercials, theatre, film, and TV, and she studied on-camera and monologue techniques with Full Circle Productions. Their technique, derived from screenplay writing, combined character creation from an intellectual point of view with “in the moment” organic techniques.
Stephanie has trained with B.A.T.S, The Groundlings, IO (Improv Olympic), and the Improvatoriumin in Los Angeles, and was a member of Improv Troupe “Gumbo”, performing at the World Famous Comedy Store in West Hollywood. She also spent 2 years studying sketch writing at the Second City in Hollywood. She also directed the entire production of a sketch comedy that she wrote and is currently in development on for a show based on some of her characters as well as another sitcom project. She also has 9 years professional Stand Up under her writing belt from working internationally in 7 countries. Stephanie is also the co-founder of the Hilarious Healing Project, and she continues to thrive and work in both communities helping others achieve inner happiness with laughter, while writing, directing and producing various entertainment projects.
Filmography
2008: The Frequency of Claire – Maggie
2009: Separation City – Pip
2012: Iron Sky – President of the United States
2013: Rapture-Palooza – Kimberly
2019: Iron Sky: The Coming Race - President of the United States
References
External links
Living people
New Zealand actresses
New Zealand expatriate actresses in the United States
Year of birth missing (living people)
Place of birth missing (living people)
New Zealand women comedians
|
New Paris is a census-designated place (CDP) in Elkhart County, Indiana, United States. The population was 1,494 at the 2010 census.
History
New Paris was laid out in 1839 by settlers from Preble County, Ohio. It was likely named after New Paris, Ohio. By the 1890s, New Paris had become a shipping point at the junction of two railroads.
Geography
New Paris is located in Jackson Township (T35N R6E) at (41.5037, -85.8295).
According to the United States Census Bureau, the CDP has a total area of , all land.
Demographics
As of the census of 2000, there were 1,006 people, 377 households, and 286 families residing in the CDP. The population density was . There were 390 housing units at an average density of . The racial makeup of the CDP was 97.71% White, 0.10% Native American, 1.19% from other races, and 0.99% from two or more races. Hispanic or Latino of any race were 1.99% of the population.
There were 377 households, out of which 34.7% had children over the age of 18 living with them, 63.1% were married couples living together, 8.2% had a female householder with no husband present, and 23.9% were non-families. 20.7% of all households were made up of individuals, and 6.9% had someone living alone who was 65 years of age or older. The average household size was 2.67 and the average family size was 3.09.
In the CDP, the population was spread out, with 29.7% under the age of 18, 7.0% from 18 to 24, 28.4% from 25 to 44, 20.3% from 45 to 64, and 14.6% who were 65 years of age or older. The median age was 35 years. For every 100 females, there were 95.3 males. For every 100 females age 18 and over, there were 93.2 males.
The median income for a household in the CDP was $42,446, and the median income for a family was $47,917. Males had a median income of $36,250 versus $24,038 for females. The per capita income for the CDP was $17,270. About 4.3% of families and 5.0% of the population were below the poverty line, including 7.9% of those under age 18 and none of those age 65 or over.
Schools
New Paris Elementary School was built in 1920 and served originally as a K-12 school. Fairfield Junior-Senior High School was created in 1968, and subsequently served as the secondary school fed by New Paris and Millersburg Elementary School. In 1999, a new elementary school named Benton Elementary School opened to serve the rural areas of New Paris and Millersburg. The enrollment at New Paris Elementary dropped as a result of Benton, but over time enrollment returned to historic levels. In 2004, construction began on a new elementary school that was in a more rural area of New Paris.
Sunnyside Park
The park is a lightly stocked fishing and recreational pond with a nearby park building and several veterans' memorials. There is also a playground and outdoor pavilion.
In 2007, the park building was renovated and the parking areas were paved.
References
Census-designated places in Elkhart County, Indiana
Census-designated places in Indiana
Populated places established in 1839
1839 establishments in the United States
|
```c++
//===-- NSDictionary.cpp --------------------------------------------------===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
#include <mutex>
#include "clang/AST/DeclCXX.h"
#include "CFBasicHash.h"
#include "NSDictionary.h"
#include "Plugins/LanguageRuntime/ObjC/AppleObjCRuntime/AppleObjCRuntime.h"
#include "Plugins/TypeSystem/Clang/TypeSystemClang.h"
#include "lldb/Core/ValueObject.h"
#include "lldb/Core/ValueObjectConstResult.h"
#include "lldb/DataFormatters/FormattersHelpers.h"
#include "lldb/Target/Language.h"
#include "lldb/Target/StackFrame.h"
#include "lldb/Target/Target.h"
#include "lldb/Utility/DataBufferHeap.h"
#include "lldb/Utility/Endian.h"
#include "lldb/Utility/Status.h"
#include "lldb/Utility/Stream.h"
using namespace lldb;
using namespace lldb_private;
using namespace lldb_private::formatters;
NSDictionary_Additionals::AdditionalFormatterMatching::Prefix::Prefix(
ConstString p)
: m_prefix(p) {}
bool NSDictionary_Additionals::AdditionalFormatterMatching::Prefix::Match(
ConstString class_name) {
return class_name.GetStringRef().startswith(m_prefix.GetStringRef());
}
NSDictionary_Additionals::AdditionalFormatterMatching::Full::Full(ConstString n)
: m_name(n) {}
bool NSDictionary_Additionals::AdditionalFormatterMatching::Full::Match(
ConstString class_name) {
return (class_name == m_name);
}
NSDictionary_Additionals::AdditionalFormatters<
CXXFunctionSummaryFormat::Callback> &
NSDictionary_Additionals::GetAdditionalSummaries() {
static AdditionalFormatters<CXXFunctionSummaryFormat::Callback> g_map;
return g_map;
}
NSDictionary_Additionals::AdditionalFormatters<
CXXSyntheticChildren::CreateFrontEndCallback> &
NSDictionary_Additionals::GetAdditionalSynthetics() {
static AdditionalFormatters<CXXSyntheticChildren::CreateFrontEndCallback>
g_map;
return g_map;
}
static CompilerType GetLLDBNSPairType(TargetSP target_sp) {
CompilerType compiler_type;
TypeSystemClangSP scratch_ts_sp =
ScratchTypeSystemClang::GetForTarget(*target_sp);
if (scratch_ts_sp) {
ConstString g_lldb_autogen_nspair("__lldb_autogen_nspair");
compiler_type = scratch_ts_sp->GetTypeForIdentifier<clang::CXXRecordDecl>(
g_lldb_autogen_nspair);
if (!compiler_type) {
compiler_type = scratch_ts_sp->CreateRecordType(
nullptr, OptionalClangModuleID(), lldb::eAccessPublic,
g_lldb_autogen_nspair.GetCString(), clang::TTK_Struct,
lldb::eLanguageTypeC);
if (compiler_type) {
TypeSystemClang::StartTagDeclarationDefinition(compiler_type);
CompilerType id_compiler_type =
scratch_ts_sp->GetBasicType(eBasicTypeObjCID);
TypeSystemClang::AddFieldToRecordType(
compiler_type, "key", id_compiler_type, lldb::eAccessPublic, 0);
TypeSystemClang::AddFieldToRecordType(
compiler_type, "value", id_compiler_type, lldb::eAccessPublic, 0);
TypeSystemClang::CompleteTagDeclarationDefinition(compiler_type);
}
}
}
return compiler_type;
}
namespace lldb_private {
namespace formatters {
class NSDictionaryISyntheticFrontEnd : public SyntheticChildrenFrontEnd {
public:
NSDictionaryISyntheticFrontEnd(lldb::ValueObjectSP valobj_sp);
~NSDictionaryISyntheticFrontEnd() override;
size_t CalculateNumChildren() override;
lldb::ValueObjectSP GetChildAtIndex(size_t idx) override;
bool Update() override;
bool MightHaveChildren() override;
size_t GetIndexOfChildWithName(ConstString name) override;
private:
struct DataDescriptor_32 {
uint32_t _used : 26;
uint32_t _szidx : 6;
};
struct DataDescriptor_64 {
uint64_t _used : 58;
uint32_t _szidx : 6;
};
struct DictionaryItemDescriptor {
lldb::addr_t key_ptr;
lldb::addr_t val_ptr;
lldb::ValueObjectSP valobj_sp;
};
ExecutionContextRef m_exe_ctx_ref;
uint8_t m_ptr_size = 8;
lldb::ByteOrder m_order = lldb::eByteOrderInvalid;
DataDescriptor_32 *m_data_32 = nullptr;
DataDescriptor_64 *m_data_64 = nullptr;
lldb::addr_t m_data_ptr = LLDB_INVALID_ADDRESS;
CompilerType m_pair_type;
std::vector<DictionaryItemDescriptor> m_children;
};
class NSConstantDictionarySyntheticFrontEnd : public SyntheticChildrenFrontEnd {
public:
NSConstantDictionarySyntheticFrontEnd(lldb::ValueObjectSP valobj_sp);
size_t CalculateNumChildren() override;
lldb::ValueObjectSP GetChildAtIndex(size_t idx) override;
bool Update() override;
bool MightHaveChildren() override;
size_t GetIndexOfChildWithName(ConstString name) override;
private:
ExecutionContextRef m_exe_ctx_ref;
CompilerType m_pair_type;
uint8_t m_ptr_size = 8;
lldb::ByteOrder m_order = lldb::eByteOrderInvalid;
unsigned int m_size = 0;
lldb::addr_t m_keys_ptr = LLDB_INVALID_ADDRESS;
lldb::addr_t m_objects_ptr = LLDB_INVALID_ADDRESS;
struct DictionaryItemDescriptor {
lldb::addr_t key_ptr;
lldb::addr_t val_ptr;
lldb::ValueObjectSP valobj_sp;
};
std::vector<DictionaryItemDescriptor> m_children;
};
class NSCFDictionarySyntheticFrontEnd : public SyntheticChildrenFrontEnd {
public:
NSCFDictionarySyntheticFrontEnd(lldb::ValueObjectSP valobj_sp);
size_t CalculateNumChildren() override;
lldb::ValueObjectSP GetChildAtIndex(size_t idx) override;
bool Update() override;
bool MightHaveChildren() override;
size_t GetIndexOfChildWithName(ConstString name) override;
private:
struct DictionaryItemDescriptor {
lldb::addr_t key_ptr;
lldb::addr_t val_ptr;
lldb::ValueObjectSP valobj_sp;
};
ExecutionContextRef m_exe_ctx_ref;
uint8_t m_ptr_size = 8;
lldb::ByteOrder m_order = lldb::eByteOrderInvalid;
CFBasicHash m_hashtable;
CompilerType m_pair_type;
std::vector<DictionaryItemDescriptor> m_children;
};
class NSDictionary1SyntheticFrontEnd : public SyntheticChildrenFrontEnd {
public:
NSDictionary1SyntheticFrontEnd(lldb::ValueObjectSP valobj_sp);
~NSDictionary1SyntheticFrontEnd() override = default;
size_t CalculateNumChildren() override;
lldb::ValueObjectSP GetChildAtIndex(size_t idx) override;
bool Update() override;
bool MightHaveChildren() override;
size_t GetIndexOfChildWithName(ConstString name) override;
private:
ValueObjectSP m_pair;
};
template <typename D32, typename D64>
class GenericNSDictionaryMSyntheticFrontEnd : public SyntheticChildrenFrontEnd {
public:
GenericNSDictionaryMSyntheticFrontEnd(lldb::ValueObjectSP valobj_sp);
~GenericNSDictionaryMSyntheticFrontEnd() override;
size_t CalculateNumChildren() override;
lldb::ValueObjectSP GetChildAtIndex(size_t idx) override;
bool Update() override;
bool MightHaveChildren() override;
size_t GetIndexOfChildWithName(ConstString name) override;
private:
struct DictionaryItemDescriptor {
lldb::addr_t key_ptr;
lldb::addr_t val_ptr;
lldb::ValueObjectSP valobj_sp;
};
ExecutionContextRef m_exe_ctx_ref;
uint8_t m_ptr_size = 8;
lldb::ByteOrder m_order = lldb::eByteOrderInvalid;
D32 *m_data_32;
D64 *m_data_64;
CompilerType m_pair_type;
std::vector<DictionaryItemDescriptor> m_children;
};
namespace Foundation1100 {
class NSDictionaryMSyntheticFrontEnd : public SyntheticChildrenFrontEnd {
public:
NSDictionaryMSyntheticFrontEnd(lldb::ValueObjectSP valobj_sp);
~NSDictionaryMSyntheticFrontEnd() override;
size_t CalculateNumChildren() override;
lldb::ValueObjectSP GetChildAtIndex(size_t idx) override;
bool Update() override;
bool MightHaveChildren() override;
size_t GetIndexOfChildWithName(ConstString name) override;
private:
struct DataDescriptor_32 {
uint32_t _used : 26;
uint32_t _kvo : 1;
uint32_t _size;
uint32_t _mutations;
uint32_t _objs_addr;
uint32_t _keys_addr;
};
struct DataDescriptor_64 {
uint64_t _used : 58;
uint32_t _kvo : 1;
uint64_t _size;
uint64_t _mutations;
uint64_t _objs_addr;
uint64_t _keys_addr;
};
struct DictionaryItemDescriptor {
lldb::addr_t key_ptr;
lldb::addr_t val_ptr;
lldb::ValueObjectSP valobj_sp;
};
ExecutionContextRef m_exe_ctx_ref;
uint8_t m_ptr_size = 8;
lldb::ByteOrder m_order = lldb::eByteOrderInvalid;
DataDescriptor_32 *m_data_32 = nullptr;
DataDescriptor_64 *m_data_64 = nullptr;
CompilerType m_pair_type;
std::vector<DictionaryItemDescriptor> m_children;
};
}
namespace Foundation1428 {
namespace {
struct DataDescriptor_32 {
uint32_t _used : 26;
uint32_t _kvo : 1;
uint32_t _size;
uint32_t _buffer;
uint64_t GetSize() { return _size; }
};
struct DataDescriptor_64 {
uint64_t _used : 58;
uint32_t _kvo : 1;
uint64_t _size;
uint64_t _buffer;
uint64_t GetSize() { return _size; }
};
}
using NSDictionaryMSyntheticFrontEnd =
GenericNSDictionaryMSyntheticFrontEnd<DataDescriptor_32, DataDescriptor_64>;
}
namespace Foundation1437 {
static const uint64_t NSDictionaryCapacities[] = {
0, 3, 7, 13, 23, 41, 71, 127, 191, 251, 383, 631, 1087, 1723,
2803, 4523, 7351, 11959, 19447, 31231, 50683, 81919, 132607,
214519, 346607, 561109, 907759, 1468927, 2376191, 3845119,
6221311, 10066421, 16287743, 26354171, 42641881, 68996069,
111638519, 180634607, 292272623, 472907251
};
static const size_t NSDictionaryNumSizeBuckets =
sizeof(NSDictionaryCapacities) / sizeof(uint64_t);
namespace {
struct DataDescriptor_32 {
uint32_t _buffer;
uint32_t _muts;
uint32_t _used : 25;
uint32_t _kvo : 1;
uint32_t _szidx : 6;
uint64_t GetSize() {
return (_szidx) >= NSDictionaryNumSizeBuckets ?
0 : NSDictionaryCapacities[_szidx];
}
};
struct DataDescriptor_64 {
uint64_t _buffer;
uint32_t _muts;
uint32_t _used : 25;
uint32_t _kvo : 1;
uint32_t _szidx : 6;
uint64_t GetSize() {
return (_szidx) >= NSDictionaryNumSizeBuckets ?
0 : NSDictionaryCapacities[_szidx];
}
};
} // namespace
using NSDictionaryMSyntheticFrontEnd =
GenericNSDictionaryMSyntheticFrontEnd<DataDescriptor_32, DataDescriptor_64>;
template <typename DD>
uint64_t
__NSDictionaryMSize_Impl(lldb_private::Process &process,
lldb::addr_t valobj_addr, Status &error) {
const lldb::addr_t start_of_descriptor =
valobj_addr + process.GetAddressByteSize();
DD descriptor = DD();
process.ReadMemory(start_of_descriptor, &descriptor, sizeof(descriptor),
error);
if (error.Fail()) {
return 0;
}
return descriptor._used;
}
uint64_t
__NSDictionaryMSize(lldb_private::Process &process, lldb::addr_t valobj_addr,
Status &error) {
if (process.GetAddressByteSize() == 4) {
return __NSDictionaryMSize_Impl<DataDescriptor_32>(process, valobj_addr,
error);
} else {
return __NSDictionaryMSize_Impl<DataDescriptor_64>(process, valobj_addr,
error);
}
}
}
} // namespace formatters
} // namespace lldb_private
template <bool name_entries>
bool lldb_private::formatters::NSDictionarySummaryProvider(
ValueObject &valobj, Stream &stream, const TypeSummaryOptions &options) {
static ConstString g_TypeHint("NSDictionary");
ProcessSP process_sp = valobj.GetProcessSP();
if (!process_sp)
return false;
ObjCLanguageRuntime *runtime = ObjCLanguageRuntime::Get(*process_sp);
if (!runtime)
return false;
ObjCLanguageRuntime::ClassDescriptorSP descriptor(
runtime->GetNonKVOClassDescriptor(valobj));
if (!descriptor || !descriptor->IsValid())
return false;
uint32_t ptr_size = process_sp->GetAddressByteSize();
bool is_64bit = (ptr_size == 8);
lldb::addr_t valobj_addr = valobj.GetValueAsUnsigned(0);
if (!valobj_addr)
return false;
uint64_t value = 0;
ConstString class_name(descriptor->GetClassName());
static const ConstString g_DictionaryI("__NSDictionaryI");
static const ConstString g_DictionaryM("__NSDictionaryM");
static const ConstString g_DictionaryMLegacy("__NSDictionaryM_Legacy");
static const ConstString g_DictionaryMImmutable("__NSDictionaryM_Immutable");
static const ConstString g_DictionaryMFrozen("__NSFrozenDictionaryM");
static const ConstString g_Dictionary1("__NSSingleEntryDictionaryI");
static const ConstString g_Dictionary0("__NSDictionary0");
static const ConstString g_DictionaryCF("__CFDictionary");
static const ConstString g_DictionaryNSCF("__NSCFDictionary");
static const ConstString g_DictionaryCFRef("CFDictionaryRef");
static const ConstString g_ConstantDictionary("NSConstantDictionary");
if (class_name.IsEmpty())
return false;
if (class_name == g_DictionaryI || class_name == g_DictionaryMImmutable) {
Status error;
value = process_sp->ReadUnsignedIntegerFromMemory(valobj_addr + ptr_size,
ptr_size, 0, error);
if (error.Fail())
return false;
value &= (is_64bit ? ~0xFC00000000000000UL : ~0xFC000000U);
} else if (class_name == g_ConstantDictionary) {
Status error;
value = process_sp->ReadUnsignedIntegerFromMemory(
valobj_addr + 2 * ptr_size, ptr_size, 0, error);
if (error.Fail())
return false;
} else if (class_name == g_DictionaryM || class_name == g_DictionaryMLegacy ||
class_name == g_DictionaryMFrozen) {
AppleObjCRuntime *apple_runtime =
llvm::dyn_cast_or_null<AppleObjCRuntime>(runtime);
Status error;
if (apple_runtime && apple_runtime->GetFoundationVersion() >= 1437) {
value = Foundation1437::__NSDictionaryMSize(*process_sp, valobj_addr,
error);
} else {
value = process_sp->ReadUnsignedIntegerFromMemory(valobj_addr + ptr_size,
ptr_size, 0, error);
value &= (is_64bit ? ~0xFC00000000000000UL : ~0xFC000000U);
}
if (error.Fail())
return false;
} else if (class_name == g_Dictionary1) {
value = 1;
} else if (class_name == g_Dictionary0) {
value = 0;
} else if (class_name == g_DictionaryCF || class_name == g_DictionaryNSCF ||
class_name == g_DictionaryCFRef) {
ExecutionContext exe_ctx(process_sp);
CFBasicHash cfbh;
if (!cfbh.Update(valobj_addr, exe_ctx))
return false;
value = cfbh.GetCount();
} else {
auto &map(NSDictionary_Additionals::GetAdditionalSummaries());
for (auto &candidate : map) {
if (candidate.first && candidate.first->Match(class_name))
return candidate.second(valobj, stream, options);
}
return false;
}
std::string prefix, suffix;
if (Language *language = Language::FindPlugin(options.GetLanguage())) {
if (!language->GetFormatterPrefixSuffix(valobj, g_TypeHint, prefix,
suffix)) {
prefix.clear();
suffix.clear();
}
}
stream.Printf("%s%" PRIu64 " %s%s%s", prefix.c_str(), value, "key/value pair",
value == 1 ? "" : "s", suffix.c_str());
return true;
}
SyntheticChildrenFrontEnd *
lldb_private::formatters::NSDictionarySyntheticFrontEndCreator(
CXXSyntheticChildren *synth, lldb::ValueObjectSP valobj_sp) {
lldb::ProcessSP process_sp(valobj_sp->GetProcessSP());
if (!process_sp)
return nullptr;
AppleObjCRuntime *runtime = llvm::dyn_cast_or_null<AppleObjCRuntime>(
ObjCLanguageRuntime::Get(*process_sp));
if (!runtime)
return nullptr;
CompilerType valobj_type(valobj_sp->GetCompilerType());
Flags flags(valobj_type.GetTypeInfo());
if (flags.IsClear(eTypeIsPointer)) {
Status error;
valobj_sp = valobj_sp->AddressOf(error);
if (error.Fail() || !valobj_sp)
return nullptr;
}
ObjCLanguageRuntime::ClassDescriptorSP descriptor(
runtime->GetClassDescriptor(*valobj_sp));
if (!descriptor || !descriptor->IsValid())
return nullptr;
ConstString class_name(descriptor->GetClassName());
static const ConstString g_DictionaryI("__NSDictionaryI");
static const ConstString g_DictionaryM("__NSDictionaryM");
static const ConstString g_Dictionary1("__NSSingleEntryDictionaryI");
static const ConstString g_DictionaryImmutable("__NSDictionaryM_Immutable");
static const ConstString g_DictionaryMFrozen("__NSFrozenDictionaryM");
static const ConstString g_DictionaryMLegacy("__NSDictionaryM_Legacy");
static const ConstString g_Dictionary0("__NSDictionary0");
static const ConstString g_DictionaryCF("__CFDictionary");
static const ConstString g_DictionaryNSCF("__NSCFDictionary");
static const ConstString g_DictionaryCFRef("CFDictionaryRef");
static const ConstString g_ConstantDictionary("NSConstantDictionary");
if (class_name.IsEmpty())
return nullptr;
if (class_name == g_DictionaryI) {
return (new NSDictionaryISyntheticFrontEnd(valobj_sp));
} else if (class_name == g_ConstantDictionary) {
return (new NSConstantDictionarySyntheticFrontEnd(valobj_sp));
} else if (class_name == g_DictionaryM || class_name == g_DictionaryMFrozen) {
if (runtime->GetFoundationVersion() >= 1437) {
return (new Foundation1437::NSDictionaryMSyntheticFrontEnd(valobj_sp));
} else if (runtime->GetFoundationVersion() >= 1428) {
return (new Foundation1428::NSDictionaryMSyntheticFrontEnd(valobj_sp));
} else {
return (new Foundation1100::NSDictionaryMSyntheticFrontEnd(valobj_sp));
}
} else if (class_name == g_DictionaryMLegacy) {
return (new Foundation1100::NSDictionaryMSyntheticFrontEnd(valobj_sp));
} else if (class_name == g_Dictionary1) {
return (new NSDictionary1SyntheticFrontEnd(valobj_sp));
} else if (class_name == g_DictionaryCF || class_name == g_DictionaryNSCF ||
class_name == g_DictionaryCFRef) {
return (new NSCFDictionarySyntheticFrontEnd(valobj_sp));
} else {
auto &map(NSDictionary_Additionals::GetAdditionalSynthetics());
for (auto &candidate : map) {
if (candidate.first && candidate.first->Match((class_name)))
return candidate.second(synth, valobj_sp);
}
}
return nullptr;
}
lldb_private::formatters::NSDictionaryISyntheticFrontEnd::
NSDictionaryISyntheticFrontEnd(lldb::ValueObjectSP valobj_sp)
: SyntheticChildrenFrontEnd(*valobj_sp), m_exe_ctx_ref(), m_pair_type() {}
lldb_private::formatters::NSDictionaryISyntheticFrontEnd::
~NSDictionaryISyntheticFrontEnd() {
delete m_data_32;
m_data_32 = nullptr;
delete m_data_64;
m_data_64 = nullptr;
}
size_t lldb_private::formatters::NSDictionaryISyntheticFrontEnd::
GetIndexOfChildWithName(ConstString name) {
const char *item_name = name.GetCString();
uint32_t idx = ExtractIndexFromString(item_name);
if (idx < UINT32_MAX && idx >= CalculateNumChildren())
return UINT32_MAX;
return idx;
}
size_t lldb_private::formatters::NSDictionaryISyntheticFrontEnd::
CalculateNumChildren() {
if (!m_data_32 && !m_data_64)
return 0;
return (m_data_32 ? m_data_32->_used : m_data_64->_used);
}
bool lldb_private::formatters::NSDictionaryISyntheticFrontEnd::Update() {
m_children.clear();
delete m_data_32;
m_data_32 = nullptr;
delete m_data_64;
m_data_64 = nullptr;
m_ptr_size = 0;
ValueObjectSP valobj_sp = m_backend.GetSP();
if (!valobj_sp)
return false;
m_exe_ctx_ref = valobj_sp->GetExecutionContextRef();
Status error;
error.Clear();
lldb::ProcessSP process_sp(valobj_sp->GetProcessSP());
if (!process_sp)
return false;
m_ptr_size = process_sp->GetAddressByteSize();
m_order = process_sp->GetByteOrder();
uint64_t data_location = valobj_sp->GetValueAsUnsigned(0) + m_ptr_size;
if (m_ptr_size == 4) {
m_data_32 = new DataDescriptor_32();
process_sp->ReadMemory(data_location, m_data_32, sizeof(DataDescriptor_32),
error);
} else {
m_data_64 = new DataDescriptor_64();
process_sp->ReadMemory(data_location, m_data_64, sizeof(DataDescriptor_64),
error);
}
if (error.Fail())
return false;
m_data_ptr = data_location + m_ptr_size;
return false;
}
bool lldb_private::formatters::NSDictionaryISyntheticFrontEnd::
MightHaveChildren() {
return true;
}
lldb::ValueObjectSP
lldb_private::formatters::NSDictionaryISyntheticFrontEnd::GetChildAtIndex(
size_t idx) {
uint32_t num_children = CalculateNumChildren();
if (idx >= num_children)
return lldb::ValueObjectSP();
if (m_children.empty()) {
// do the scan phase
lldb::addr_t key_at_idx = 0, val_at_idx = 0;
uint32_t tries = 0;
uint32_t test_idx = 0;
while (tries < num_children) {
key_at_idx = m_data_ptr + (2 * test_idx * m_ptr_size);
val_at_idx = key_at_idx + m_ptr_size;
ProcessSP process_sp = m_exe_ctx_ref.GetProcessSP();
if (!process_sp)
return lldb::ValueObjectSP();
Status error;
key_at_idx = process_sp->ReadPointerFromMemory(key_at_idx, error);
if (error.Fail())
return lldb::ValueObjectSP();
val_at_idx = process_sp->ReadPointerFromMemory(val_at_idx, error);
if (error.Fail())
return lldb::ValueObjectSP();
test_idx++;
if (!key_at_idx || !val_at_idx)
continue;
tries++;
DictionaryItemDescriptor descriptor = {key_at_idx, val_at_idx,
lldb::ValueObjectSP()};
m_children.push_back(descriptor);
}
}
if (idx >= m_children.size()) // should never happen
return lldb::ValueObjectSP();
DictionaryItemDescriptor &dict_item = m_children[idx];
if (!dict_item.valobj_sp) {
if (!m_pair_type.IsValid()) {
TargetSP target_sp(m_backend.GetTargetSP());
if (!target_sp)
return ValueObjectSP();
m_pair_type = GetLLDBNSPairType(target_sp);
}
if (!m_pair_type.IsValid())
return ValueObjectSP();
WritableDataBufferSP buffer_sp(new DataBufferHeap(2 * m_ptr_size, 0));
if (m_ptr_size == 8) {
uint64_t *data_ptr = (uint64_t *)buffer_sp->GetBytes();
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
} else {
uint32_t *data_ptr = (uint32_t *)buffer_sp->GetBytes();
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
}
StreamString idx_name;
idx_name.Printf("[%" PRIu64 "]", (uint64_t)idx);
DataExtractor data(buffer_sp, m_order, m_ptr_size);
dict_item.valobj_sp = CreateValueObjectFromData(idx_name.GetString(), data,
m_exe_ctx_ref, m_pair_type);
}
return dict_item.valobj_sp;
}
lldb_private::formatters::NSCFDictionarySyntheticFrontEnd::
NSCFDictionarySyntheticFrontEnd(lldb::ValueObjectSP valobj_sp)
: SyntheticChildrenFrontEnd(*valobj_sp), m_exe_ctx_ref(), m_hashtable(),
m_pair_type() {}
size_t lldb_private::formatters::NSCFDictionarySyntheticFrontEnd::
GetIndexOfChildWithName(ConstString name) {
const char *item_name = name.GetCString();
const uint32_t idx = ExtractIndexFromString(item_name);
if (idx < UINT32_MAX && idx >= CalculateNumChildren())
return UINT32_MAX;
return idx;
}
size_t lldb_private::formatters::NSCFDictionarySyntheticFrontEnd::
CalculateNumChildren() {
if (!m_hashtable.IsValid())
return 0;
return m_hashtable.GetCount();
}
bool lldb_private::formatters::NSCFDictionarySyntheticFrontEnd::Update() {
m_children.clear();
ValueObjectSP valobj_sp = m_backend.GetSP();
m_ptr_size = 0;
if (!valobj_sp)
return false;
m_exe_ctx_ref = valobj_sp->GetExecutionContextRef();
lldb::ProcessSP process_sp(valobj_sp->GetProcessSP());
if (!process_sp)
return false;
m_ptr_size = process_sp->GetAddressByteSize();
m_order = process_sp->GetByteOrder();
return m_hashtable.Update(valobj_sp->GetValueAsUnsigned(0), m_exe_ctx_ref);
}
bool lldb_private::formatters::NSCFDictionarySyntheticFrontEnd::
MightHaveChildren() {
return true;
}
lldb::ValueObjectSP
lldb_private::formatters::NSCFDictionarySyntheticFrontEnd::GetChildAtIndex(
size_t idx) {
lldb::addr_t m_keys_ptr = m_hashtable.GetKeyPointer();
lldb::addr_t m_values_ptr = m_hashtable.GetValuePointer();
const uint32_t num_children = CalculateNumChildren();
if (idx >= num_children)
return lldb::ValueObjectSP();
if (m_children.empty()) {
ProcessSP process_sp = m_exe_ctx_ref.GetProcessSP();
if (!process_sp)
return lldb::ValueObjectSP();
Status error;
lldb::addr_t key_at_idx = 0, val_at_idx = 0;
uint32_t tries = 0;
uint32_t test_idx = 0;
// Iterate over inferior memory, reading key/value pointers by shifting each
// cursor by test_index * m_ptr_size. Returns an empty ValueObject if a read
// fails, otherwise, continue until the number of tries matches the number
// of childen.
while (tries < num_children) {
key_at_idx = m_keys_ptr + (test_idx * m_ptr_size);
val_at_idx = m_values_ptr + (test_idx * m_ptr_size);
key_at_idx = process_sp->ReadPointerFromMemory(key_at_idx, error);
if (error.Fail())
return lldb::ValueObjectSP();
val_at_idx = process_sp->ReadPointerFromMemory(val_at_idx, error);
if (error.Fail())
return lldb::ValueObjectSP();
test_idx++;
if (!key_at_idx || !val_at_idx)
continue;
tries++;
DictionaryItemDescriptor descriptor = {key_at_idx, val_at_idx,
lldb::ValueObjectSP()};
m_children.push_back(descriptor);
}
}
if (idx >= m_children.size()) // should never happen
return lldb::ValueObjectSP();
DictionaryItemDescriptor &dict_item = m_children[idx];
if (!dict_item.valobj_sp) {
if (!m_pair_type.IsValid()) {
TargetSP target_sp(m_backend.GetTargetSP());
if (!target_sp)
return ValueObjectSP();
m_pair_type = GetLLDBNSPairType(target_sp);
}
if (!m_pair_type.IsValid())
return ValueObjectSP();
WritableDataBufferSP buffer_sp(new DataBufferHeap(2 * m_ptr_size, 0));
switch (m_ptr_size) {
case 0: // architecture has no clue - fail
return lldb::ValueObjectSP();
case 4: {
uint32_t *data_ptr = reinterpret_cast<uint32_t *>(buffer_sp->GetBytes());
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
} break;
case 8: {
uint64_t *data_ptr = reinterpret_cast<uint64_t *>(buffer_sp->GetBytes());
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
} break;
default:
lldbassert(false && "pointer size is not 4 nor 8");
}
StreamString idx_name;
idx_name.Printf("[%" PRIu64 "]", (uint64_t)idx);
DataExtractor data(buffer_sp, m_order, m_ptr_size);
dict_item.valobj_sp = CreateValueObjectFromData(idx_name.GetString(), data,
m_exe_ctx_ref, m_pair_type);
}
return dict_item.valobj_sp;
}
lldb_private::formatters::NSConstantDictionarySyntheticFrontEnd::
NSConstantDictionarySyntheticFrontEnd(lldb::ValueObjectSP valobj_sp)
: SyntheticChildrenFrontEnd(*valobj_sp) {}
size_t lldb_private::formatters::NSConstantDictionarySyntheticFrontEnd::
GetIndexOfChildWithName(ConstString name) {
const char *item_name = name.GetCString();
uint32_t idx = ExtractIndexFromString(item_name);
if (idx < UINT32_MAX && idx >= CalculateNumChildren())
return UINT32_MAX;
return idx;
}
size_t lldb_private::formatters::NSConstantDictionarySyntheticFrontEnd::
CalculateNumChildren() {
return m_size;
}
bool lldb_private::formatters::NSConstantDictionarySyntheticFrontEnd::Update() {
ValueObjectSP valobj_sp = m_backend.GetSP();
if (!valobj_sp)
return false;
m_exe_ctx_ref = valobj_sp->GetExecutionContextRef();
Status error;
error.Clear();
lldb::ProcessSP process_sp(valobj_sp->GetProcessSP());
if (!process_sp)
return false;
m_ptr_size = process_sp->GetAddressByteSize();
m_order = process_sp->GetByteOrder();
uint64_t valobj_addr = valobj_sp->GetValueAsUnsigned(0);
m_size = process_sp->ReadUnsignedIntegerFromMemory(
valobj_addr + 2 * m_ptr_size, m_ptr_size, 0, error);
if (error.Fail())
return false;
m_keys_ptr =
process_sp->ReadPointerFromMemory(valobj_addr + 3 * m_ptr_size, error);
if (error.Fail())
return false;
m_objects_ptr =
process_sp->ReadPointerFromMemory(valobj_addr + 4 * m_ptr_size, error);
return !error.Fail();
}
bool lldb_private::formatters::NSConstantDictionarySyntheticFrontEnd::
MightHaveChildren() {
return true;
}
lldb::ValueObjectSP lldb_private::formatters::
NSConstantDictionarySyntheticFrontEnd::GetChildAtIndex(size_t idx) {
uint32_t num_children = CalculateNumChildren();
if (idx >= num_children)
return lldb::ValueObjectSP();
if (m_children.empty()) {
// do the scan phase
lldb::addr_t key_at_idx = 0, val_at_idx = 0;
ProcessSP process_sp = m_exe_ctx_ref.GetProcessSP();
if (!process_sp)
return lldb::ValueObjectSP();
for (unsigned int child = 0; child < num_children; ++child) {
Status error;
key_at_idx = process_sp->ReadPointerFromMemory(
m_keys_ptr + child * m_ptr_size, error);
if (error.Fail())
return lldb::ValueObjectSP();
val_at_idx = process_sp->ReadPointerFromMemory(
m_objects_ptr + child * m_ptr_size, error);
if (error.Fail())
return lldb::ValueObjectSP();
DictionaryItemDescriptor descriptor = {key_at_idx, val_at_idx,
lldb::ValueObjectSP()};
m_children.push_back(descriptor);
}
}
if (idx >= m_children.size()) // should never happen
return lldb::ValueObjectSP();
DictionaryItemDescriptor &dict_item = m_children[idx];
if (!dict_item.valobj_sp) {
if (!m_pair_type.IsValid()) {
TargetSP target_sp(m_backend.GetTargetSP());
if (!target_sp)
return ValueObjectSP();
m_pair_type = GetLLDBNSPairType(target_sp);
}
if (!m_pair_type.IsValid())
return ValueObjectSP();
WritableDataBufferSP buffer_sp(new DataBufferHeap(2 * m_ptr_size, 0));
if (m_ptr_size == 8) {
uint64_t *data_ptr = (uint64_t *)buffer_sp->GetBytes();
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
} else {
uint32_t *data_ptr = (uint32_t *)buffer_sp->GetBytes();
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
}
StreamString idx_name;
idx_name.Printf("[%" PRIu64 "]", (uint64_t)idx);
DataExtractor data(buffer_sp, m_order, m_ptr_size);
dict_item.valobj_sp = CreateValueObjectFromData(idx_name.GetString(), data,
m_exe_ctx_ref, m_pair_type);
}
return dict_item.valobj_sp;
}
lldb_private::formatters::NSDictionary1SyntheticFrontEnd::
NSDictionary1SyntheticFrontEnd(lldb::ValueObjectSP valobj_sp)
: SyntheticChildrenFrontEnd(*valobj_sp.get()), m_pair(nullptr) {}
size_t lldb_private::formatters::NSDictionary1SyntheticFrontEnd::
GetIndexOfChildWithName(ConstString name) {
static const ConstString g_zero("[0]");
return name == g_zero ? 0 : UINT32_MAX;
}
size_t lldb_private::formatters::NSDictionary1SyntheticFrontEnd::
CalculateNumChildren() {
return 1;
}
bool lldb_private::formatters::NSDictionary1SyntheticFrontEnd::Update() {
m_pair.reset();
return false;
}
bool lldb_private::formatters::NSDictionary1SyntheticFrontEnd::
MightHaveChildren() {
return true;
}
lldb::ValueObjectSP
lldb_private::formatters::NSDictionary1SyntheticFrontEnd::GetChildAtIndex(
size_t idx) {
if (idx != 0)
return lldb::ValueObjectSP();
if (m_pair.get())
return m_pair;
auto process_sp(m_backend.GetProcessSP());
if (!process_sp)
return nullptr;
auto ptr_size = process_sp->GetAddressByteSize();
lldb::addr_t key_ptr =
m_backend.GetValueAsUnsigned(LLDB_INVALID_ADDRESS) + ptr_size;
lldb::addr_t value_ptr = key_ptr + ptr_size;
Status error;
lldb::addr_t value_at_idx = process_sp->ReadPointerFromMemory(key_ptr, error);
if (error.Fail())
return nullptr;
lldb::addr_t key_at_idx = process_sp->ReadPointerFromMemory(value_ptr, error);
if (error.Fail())
return nullptr;
auto pair_type =
GetLLDBNSPairType(process_sp->GetTarget().shared_from_this());
WritableDataBufferSP buffer_sp(new DataBufferHeap(2 * ptr_size, 0));
if (ptr_size == 8) {
uint64_t *data_ptr = (uint64_t *)buffer_sp->GetBytes();
*data_ptr = key_at_idx;
*(data_ptr + 1) = value_at_idx;
} else {
uint32_t *data_ptr = (uint32_t *)buffer_sp->GetBytes();
*data_ptr = key_at_idx;
*(data_ptr + 1) = value_at_idx;
}
DataExtractor data(buffer_sp, process_sp->GetByteOrder(), ptr_size);
m_pair = CreateValueObjectFromData(
"[0]", data, m_backend.GetExecutionContextRef(), pair_type);
return m_pair;
}
template <typename D32, typename D64>
lldb_private::formatters::GenericNSDictionaryMSyntheticFrontEnd<D32, D64>::
GenericNSDictionaryMSyntheticFrontEnd(lldb::ValueObjectSP valobj_sp)
: SyntheticChildrenFrontEnd(*valobj_sp), m_exe_ctx_ref(),
m_data_32(nullptr), m_data_64(nullptr), m_pair_type() {}
template <typename D32, typename D64>
lldb_private::formatters::GenericNSDictionaryMSyntheticFrontEnd<D32,D64>::
~GenericNSDictionaryMSyntheticFrontEnd<D32,D64>() {
delete m_data_32;
m_data_32 = nullptr;
delete m_data_64;
m_data_64 = nullptr;
}
template <typename D32, typename D64>
size_t lldb_private::formatters::GenericNSDictionaryMSyntheticFrontEnd<
D32, D64>::GetIndexOfChildWithName(ConstString name) {
const char *item_name = name.GetCString();
uint32_t idx = ExtractIndexFromString(item_name);
if (idx < UINT32_MAX && idx >= CalculateNumChildren())
return UINT32_MAX;
return idx;
}
template <typename D32, typename D64>
size_t
lldb_private::formatters::GenericNSDictionaryMSyntheticFrontEnd<D32,D64>::CalculateNumChildren() {
if (!m_data_32 && !m_data_64)
return 0;
return (m_data_32 ? m_data_32->_used : m_data_64->_used);
}
template <typename D32, typename D64>
bool
lldb_private::formatters::GenericNSDictionaryMSyntheticFrontEnd<D32,D64>::
Update() {
m_children.clear();
ValueObjectSP valobj_sp = m_backend.GetSP();
m_ptr_size = 0;
delete m_data_32;
m_data_32 = nullptr;
delete m_data_64;
m_data_64 = nullptr;
if (!valobj_sp)
return false;
m_exe_ctx_ref = valobj_sp->GetExecutionContextRef();
Status error;
error.Clear();
lldb::ProcessSP process_sp(valobj_sp->GetProcessSP());
if (!process_sp)
return false;
m_ptr_size = process_sp->GetAddressByteSize();
m_order = process_sp->GetByteOrder();
uint64_t data_location = valobj_sp->GetValueAsUnsigned(0) + m_ptr_size;
if (m_ptr_size == 4) {
m_data_32 = new D32();
process_sp->ReadMemory(data_location, m_data_32, sizeof(D32),
error);
} else {
m_data_64 = new D64();
process_sp->ReadMemory(data_location, m_data_64, sizeof(D64),
error);
}
return error.Success();
}
template <typename D32, typename D64>
bool
lldb_private::formatters::GenericNSDictionaryMSyntheticFrontEnd<D32,D64>::
MightHaveChildren() {
return true;
}
template <typename D32, typename D64>
lldb::ValueObjectSP
lldb_private::formatters::GenericNSDictionaryMSyntheticFrontEnd<
D32, D64>::GetChildAtIndex(size_t idx) {
lldb::addr_t m_keys_ptr;
lldb::addr_t m_values_ptr;
if (m_data_32) {
uint32_t size = m_data_32->GetSize();
m_keys_ptr = m_data_32->_buffer;
m_values_ptr = m_data_32->_buffer + (m_ptr_size * size);
} else {
uint32_t size = m_data_64->GetSize();
m_keys_ptr = m_data_64->_buffer;
m_values_ptr = m_data_64->_buffer + (m_ptr_size * size);
}
uint32_t num_children = CalculateNumChildren();
if (idx >= num_children)
return lldb::ValueObjectSP();
if (m_children.empty()) {
// do the scan phase
lldb::addr_t key_at_idx = 0, val_at_idx = 0;
uint32_t tries = 0;
uint32_t test_idx = 0;
while (tries < num_children) {
key_at_idx = m_keys_ptr + (test_idx * m_ptr_size);
val_at_idx = m_values_ptr + (test_idx * m_ptr_size);
;
ProcessSP process_sp = m_exe_ctx_ref.GetProcessSP();
if (!process_sp)
return lldb::ValueObjectSP();
Status error;
key_at_idx = process_sp->ReadPointerFromMemory(key_at_idx, error);
if (error.Fail())
return lldb::ValueObjectSP();
val_at_idx = process_sp->ReadPointerFromMemory(val_at_idx, error);
if (error.Fail())
return lldb::ValueObjectSP();
test_idx++;
if (!key_at_idx || !val_at_idx)
continue;
tries++;
DictionaryItemDescriptor descriptor = {key_at_idx, val_at_idx,
lldb::ValueObjectSP()};
m_children.push_back(descriptor);
}
}
if (idx >= m_children.size()) // should never happen
return lldb::ValueObjectSP();
DictionaryItemDescriptor &dict_item = m_children[idx];
if (!dict_item.valobj_sp) {
if (!m_pair_type.IsValid()) {
TargetSP target_sp(m_backend.GetTargetSP());
if (!target_sp)
return ValueObjectSP();
m_pair_type = GetLLDBNSPairType(target_sp);
}
if (!m_pair_type.IsValid())
return ValueObjectSP();
WritableDataBufferSP buffer_sp(new DataBufferHeap(2 * m_ptr_size, 0));
if (m_ptr_size == 8) {
uint64_t *data_ptr = (uint64_t *)buffer_sp->GetBytes();
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
} else {
uint32_t *data_ptr = (uint32_t *)buffer_sp->GetBytes();
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
}
StreamString idx_name;
idx_name.Printf("[%" PRIu64 "]", (uint64_t)idx);
DataExtractor data(buffer_sp, m_order, m_ptr_size);
dict_item.valobj_sp = CreateValueObjectFromData(idx_name.GetString(), data,
m_exe_ctx_ref, m_pair_type);
}
return dict_item.valobj_sp;
}
lldb_private::formatters::Foundation1100::NSDictionaryMSyntheticFrontEnd::
NSDictionaryMSyntheticFrontEnd(lldb::ValueObjectSP valobj_sp)
: SyntheticChildrenFrontEnd(*valobj_sp), m_exe_ctx_ref(), m_pair_type() {}
lldb_private::formatters::Foundation1100::
NSDictionaryMSyntheticFrontEnd::~NSDictionaryMSyntheticFrontEnd() {
delete m_data_32;
m_data_32 = nullptr;
delete m_data_64;
m_data_64 = nullptr;
}
size_t
lldb_private::formatters::Foundation1100::
NSDictionaryMSyntheticFrontEnd::GetIndexOfChildWithName(ConstString name) {
const char *item_name = name.GetCString();
uint32_t idx = ExtractIndexFromString(item_name);
if (idx < UINT32_MAX && idx >= CalculateNumChildren())
return UINT32_MAX;
return idx;
}
size_t
lldb_private::formatters::Foundation1100::
NSDictionaryMSyntheticFrontEnd::CalculateNumChildren() {
if (!m_data_32 && !m_data_64)
return 0;
return (m_data_32 ? m_data_32->_used : m_data_64->_used);
}
bool
lldb_private::formatters::Foundation1100::
NSDictionaryMSyntheticFrontEnd::Update() {
m_children.clear();
ValueObjectSP valobj_sp = m_backend.GetSP();
m_ptr_size = 0;
delete m_data_32;
m_data_32 = nullptr;
delete m_data_64;
m_data_64 = nullptr;
if (!valobj_sp)
return false;
m_exe_ctx_ref = valobj_sp->GetExecutionContextRef();
Status error;
error.Clear();
lldb::ProcessSP process_sp(valobj_sp->GetProcessSP());
if (!process_sp)
return false;
m_ptr_size = process_sp->GetAddressByteSize();
m_order = process_sp->GetByteOrder();
uint64_t data_location = valobj_sp->GetValueAsUnsigned(0) + m_ptr_size;
if (m_ptr_size == 4) {
m_data_32 = new DataDescriptor_32();
process_sp->ReadMemory(data_location, m_data_32, sizeof(DataDescriptor_32),
error);
} else {
m_data_64 = new DataDescriptor_64();
process_sp->ReadMemory(data_location, m_data_64, sizeof(DataDescriptor_64),
error);
}
return error.Success();
}
bool
lldb_private::formatters::Foundation1100::
NSDictionaryMSyntheticFrontEnd::MightHaveChildren() {
return true;
}
lldb::ValueObjectSP
lldb_private::formatters::Foundation1100::
NSDictionaryMSyntheticFrontEnd::GetChildAtIndex(size_t idx) {
lldb::addr_t m_keys_ptr =
(m_data_32 ? m_data_32->_keys_addr : m_data_64->_keys_addr);
lldb::addr_t m_values_ptr =
(m_data_32 ? m_data_32->_objs_addr : m_data_64->_objs_addr);
uint32_t num_children = CalculateNumChildren();
if (idx >= num_children)
return lldb::ValueObjectSP();
if (m_children.empty()) {
// do the scan phase
lldb::addr_t key_at_idx = 0, val_at_idx = 0;
uint32_t tries = 0;
uint32_t test_idx = 0;
while (tries < num_children) {
key_at_idx = m_keys_ptr + (test_idx * m_ptr_size);
val_at_idx = m_values_ptr + (test_idx * m_ptr_size);
;
ProcessSP process_sp = m_exe_ctx_ref.GetProcessSP();
if (!process_sp)
return lldb::ValueObjectSP();
Status error;
key_at_idx = process_sp->ReadPointerFromMemory(key_at_idx, error);
if (error.Fail())
return lldb::ValueObjectSP();
val_at_idx = process_sp->ReadPointerFromMemory(val_at_idx, error);
if (error.Fail())
return lldb::ValueObjectSP();
test_idx++;
if (!key_at_idx || !val_at_idx)
continue;
tries++;
DictionaryItemDescriptor descriptor = {key_at_idx, val_at_idx,
lldb::ValueObjectSP()};
m_children.push_back(descriptor);
}
}
if (idx >= m_children.size()) // should never happen
return lldb::ValueObjectSP();
DictionaryItemDescriptor &dict_item = m_children[idx];
if (!dict_item.valobj_sp) {
if (!m_pair_type.IsValid()) {
TargetSP target_sp(m_backend.GetTargetSP());
if (!target_sp)
return ValueObjectSP();
m_pair_type = GetLLDBNSPairType(target_sp);
}
if (!m_pair_type.IsValid())
return ValueObjectSP();
WritableDataBufferSP buffer_sp(new DataBufferHeap(2 * m_ptr_size, 0));
if (m_ptr_size == 8) {
uint64_t *data_ptr = (uint64_t *)buffer_sp->GetBytes();
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
} else {
uint32_t *data_ptr = (uint32_t *)buffer_sp->GetBytes();
*data_ptr = dict_item.key_ptr;
*(data_ptr + 1) = dict_item.val_ptr;
}
StreamString idx_name;
idx_name.Printf("[%" PRIu64 "]", (uint64_t)idx);
DataExtractor data(buffer_sp, m_order, m_ptr_size);
dict_item.valobj_sp = CreateValueObjectFromData(idx_name.GetString(), data,
m_exe_ctx_ref, m_pair_type);
}
return dict_item.valobj_sp;
}
template bool lldb_private::formatters::NSDictionarySummaryProvider<true>(
ValueObject &, Stream &, const TypeSummaryOptions &);
template bool lldb_private::formatters::NSDictionarySummaryProvider<false>(
ValueObject &, Stream &, const TypeSummaryOptions &);
```
|
The 2011 Elite League speedway season (also known as the Sky Sports Elite League for sponsorship reasons) was the 77th season of the top division of UK speedway and took place between 26 March and 20 October 2011. The Coventry Bees were the defending champions after winning in 2010.
Summary
It was a great season for the Poole Pirates, who won the Elite League, the Pairs Championship and the Knockout Cup. Claiming a clean sweep of honours. Throughout the 2010 season, it was rumoured that the Ipswich Witches would prefer to compete in the Premier League from 2011 onwards. Although they survived the promotion/relegation battle with the Newcastle Diamonds, it was decided that they would swap divisions with the Birmingham Brummies. On 27 November 2010, The BSPA announced that both Coventry Bees and Peterborough Panthers would not be riding in the top flight after they failed to declare their intent to compete in the 2011 competition. This then led to the King's Lynn Stars being promoted from the Premier League due to the Elite League needing a minimum of 8 teams. On 15 March 2011 it was announced that both the Coventry Bees and Peterborough Panthers would be part of the 2011 Elite League after all.
Poole Pirates made up for the previous season's disappointment by winning the league and cup double. The Australian quartet of Darcy Ward, Chris Holder, Davey Watt and Jason Doyle were supported well by Swedes Thomas H. Jonasson and Dennis Andersson as the Poole team deservedly won the title after finishing top of the regular season table for the second consecutive year. The Australian domination also extended to the league averages, which were topped by Chris Holder and the Elite League Riders' Championship won by Rory Schlein of Belle Vue.
League table
Home: 3W = Home win by 7 points or more; 2W = Home win by between 1 and 6 points
Away: 4W = Away win by 7 points or more; 3W = Away win by between 1 and 6 points; 1L = Away loss by 6 points or less
M = Meetings; D = Draws; L = Losses; F = Race points for; A = Race points against; +/- = Race points difference; Pts = Total Points
Championship play-offs
Semi-finals
Leg 1
Leg 2
Grand final
First leg
Second leg
Poole Pirates were declared Elite League Champions, on winning on aggregate 98-85.
Elite League Knockout Cup
The 2011 Elite League Knockout Cup was the 73rd edition of the Knockout Cup for tier one teams. Poole Pirates were the winners of the competition for the second successive year.
First round
Quarter-finals
Semi-finals
Final
First leg
Second leg
The Poole Pirates were declared Knockout Cup Champions, winning on aggregate 102-86.
Riders' Championship
Rory Schlein won the Riders' Championship. The final was held at Abbey Stadium on 15 October.
f=fell, exc=excluded, ret=retired
Pairs
The Elite League Pairs Championship was held at the King's Lynn Stadium on 27 April and was won by Poole Pirates.
Semi finals
Belle Vue 5 Peterborough 4 - Pedersen, Harris, Schlein, Batchelor
Poole 5 Wolves 4 - Lindgren, Ward, Holder, Proctor
Final
Poole 7 Belle Vue 2 - Ward, Holder, Harris, Schlein
Leading averages
Riders & final averages
Belle Vue
9.10
8.56
7.70
6.48
5.70
5.60
5.22
4.65
4.48
3.30
2.00
Birmingham
7.65
7.46
6.84
6.52
6.16
5.73
5.39
5.33
5.10
Coventry
8.77
8.28
7.96
6.95
6.76
6.06
5.57
4.21
3.88
Eastbourne
8.61
7.92
7.75
7.69
7.22
7.19
3.06
King's Lynn
9.22
8.03
7.88
7.30
6.11
4.48
4.04
4.00
Lakeside
8.46
7.52
7.48
7.26
6.99
6.52
6.35
6.02
5.67
4.21
Peterborough
9.20
8.84
7.83
6.82
6.02
4.47
4.00
3.87
Poole
10.05
9.99
7.93
7.14
6.41
6.23
6.10
5.62
4.84
1.74
Swindon
7.78
7.02
6.86
6.72
6.19
4.89
3.63
2.83
Wolverhampton
9.66
8.78
8.34
5.76
4.56
4.43
2.73
See also
List of United Kingdom Speedway League Champions
Knockout Cup (speedway)
References
SGB Premiership
Elite League
Speedway
|
```xml
<?xml version="1.0" encoding="utf-8" ?>
<controls:TestContentPage
xmlns:controls="clr-namespace:Xamarin.Forms.Controls"
xmlns="path_to_url"
xmlns:x="path_to_url"
xmlns:d="path_to_url"
xmlns:mc="path_to_url"
mc:Ignorable="d"
x:Class="Xamarin.Forms.Controls.Issues.Issue11831"
x:Name="Issue11831Page"
Title="Issue 11831">
<controls:TestContentPage.Resources>
<ResourceDictionary>
<Style x:Key="CollectionSwipeSelectedStyle" TargetType="SwipeView">
<Setter Property="VisualStateManager.VisualStateGroups">
<VisualStateGroupList>
<VisualStateGroup x:Name="CommonStates">
<VisualState x:Name="Normal" />
<VisualState x:Name="Selected">
<VisualState.Setters>
<Setter Property="BackgroundColor" Value="Green" />
</VisualState.Setters>
</VisualState>
</VisualStateGroup>
</VisualStateGroupList>
</Setter>
</Style>
</ResourceDictionary>
</controls:TestContentPage.Resources>
<Grid
RowSpacing="0">
<Grid.RowDefinitions>
<RowDefinition Height="Auto" />
<RowDefinition Height="*" />
</Grid.RowDefinitions>
<Label
Padding="12"
BackgroundColor="Black"
TextColor="White"
Text="Select am item from the list. If the selection background color is green, the test has passed."/>
<Grid
Grid.Row="1">
<CollectionView
x:Name="DataListView"
SelectionMode="Single"
ItemsSource="{Binding Data}">
<CollectionView.ItemTemplate>
<DataTemplate x:DataType="x:String">
<SwipeView
BackgroundColor="Red"
Style="{StaticResource CollectionSwipeSelectedStyle}">
<SwipeView.RightItems>
<SwipeItems>
<SwipeItemView
Command="{Binding BindingContext.DeleteCommand, Source={x:Reference Issue11831Page}}"
CommandParameter="{Binding}">
<Grid
BackgroundColor="LightSlateGray">
<Frame
BackgroundColor="#de3f45"
BorderColor="White"
Margin="8"
Padding="10"
CornerRadius="5">
<StackLayout
Orientation="Vertical"
VerticalOptions="Center"
HorizontalOptions="Center">
<Label
Text="Delete"
TextColor="White"
FontSize="Medium"
FontAttributes="Bold"
LineBreakMode="NoWrap"
WidthRequest="64"
HorizontalTextAlignment="Center" />
</StackLayout>
</Frame>
</Grid>
</SwipeItemView>
</SwipeItems>
</SwipeView.RightItems>
<Frame
Padding="1"
BorderColor="Silver"
BackgroundColor="WhiteSmoke"
HeightRequest="60"
CornerRadius="12">
<Label
Text="{Binding}"
TextColor="Black"
FontAttributes="Bold"
FontSize="Medium"
HorizontalTextAlignment="Center"
VerticalOptions="Center"/>
</Frame>
</SwipeView>
</DataTemplate>
</CollectionView.ItemTemplate>
</CollectionView>
</Grid>
</Grid>
</controls:TestContentPage>
```
|
```ocaml
module Position = struct
(* We encode the position in three, 21 bit fields: [cnum][lnum][bol] *)
type t = int
let field_size = 21
let field_mask = (1 lsl field_size) - 1
let shift_bol = 0
let shift_lnum = field_size
let shift_cnum = 2 * field_size
let small_enough =
let max_size = 1 lsl field_size in
let test int = int <= max_size in
fun [@inline] { Lexing.pos_bol; pos_cnum; pos_lnum; pos_fname = _ } ->
test pos_bol && test pos_cnum && test pos_lnum
;;
let[@inline] of_position { Lexing.pos_bol; pos_cnum; pos_lnum; pos_fname = _ } =
((pos_bol land field_mask) lsl shift_bol)
lor ((pos_lnum land field_mask) lsl shift_lnum)
lor ((pos_cnum land field_mask) lsl shift_cnum)
;;
let[@inline] bol t = (t lsr shift_bol) land field_mask
let[@inline] lnum t = (t lsr shift_lnum) land field_mask
let[@inline] cnum t = (t lsr shift_cnum) land field_mask
let to_position t ~fname:pos_fname =
let pos_bol = bol t in
let pos_cnum = cnum t in
let pos_lnum = lnum t in
{ Lexing.pos_bol; pos_cnum; pos_lnum; pos_fname }
;;
end
module Same_line_loc = struct
(* we encode the location in four, 15 bit chunks
[bol][lnum][start_cnum][stop_cnum]
Note that this leaves us with 3 spare bits. We should probably use them to
expand [bol] and [lnum] a little.
CR-someday jtov: Instead of [stop_cnum], we can store [stop_cnum -
start_cnum]. This should be smaller than [stop_cnum] and release more
bits for other fields.
*)
type t = int
let field_size = 15
let field_mask = (1 lsl field_size) - 1
let shift_bol = 0
let shift_lnum = field_size
let shift_start_cnum = 2 * field_size
let shift_stop_cnum = 3 * field_size
let create ~bol ~lnum ~start_cnum ~stop_cnum =
((bol land field_mask) lsl shift_bol)
lor ((lnum land field_mask) lsl shift_lnum)
lor ((start_cnum land field_mask) lsl shift_start_cnum)
lor ((stop_cnum land field_mask) lsl shift_stop_cnum)
;;
let[@inline] bol t = (t lsr shift_bol) land field_mask
let[@inline] lnum t = (t lsr shift_lnum) land field_mask
let[@inline] start_cnum t = (t lsr shift_start_cnum) land field_mask
let[@inline] stop_cnum t = (t lsr shift_stop_cnum) land field_mask
let set_start_to_stop t =
let bol = bol t in
let lnum = lnum t in
let stop_cnum = stop_cnum t in
(* this can be optimized more if necessary *)
create ~bol ~lnum ~start_cnum:stop_cnum ~stop_cnum
;;
let small_enough =
let max_size = 1 lsl field_size in
fun [@inline] int -> int <= max_size
;;
let[@inline] to_loc t ~fname:pos_fname =
let pos_lnum = lnum t in
let pos_bol = bol t in
let start = { Lexing.pos_fname; pos_lnum; pos_bol; pos_cnum = start_cnum t } in
let stop = { start with pos_cnum = stop_cnum t } in
{ Lexbuf.Loc.start; stop }
;;
let[@inline] start t ~fname:pos_fname =
let pos_lnum = lnum t in
let pos_bol = bol t in
{ Lexing.pos_fname; pos_lnum; pos_bol; pos_cnum = start_cnum t }
;;
let[@inline] stop t ~fname:pos_fname =
let pos_lnum = lnum t in
let pos_bol = bol t in
{ Lexing.pos_fname; pos_lnum; pos_bol; pos_cnum = stop_cnum t }
;;
end
include Position
type of_loc =
| Same_line of Same_line_loc.t
| Loc of
{ start : t
; stop : t
}
| Loc_does_not_fit
let[@inline] try_loc { Lexbuf.Loc.start; stop } =
if Position.small_enough start && Position.small_enough stop
then (
let start = Position.of_position start in
let stop = Position.of_position stop in
Loc { start; stop })
else Loc_does_not_fit
;;
let[@inline] of_loc ({ Lexbuf.Loc.start; stop } as loc) =
if start.pos_fname <> stop.pos_fname
then Loc_does_not_fit
else if start.pos_bol = stop.pos_bol && start.pos_lnum = stop.pos_lnum
then (
let bol = start.pos_bol in
let lnum = start.pos_lnum in
let start_cnum = start.pos_cnum in
let stop_cnum = stop.pos_cnum in
let test = Same_line_loc.small_enough in
if test bol && test lnum && test start_cnum && test stop_cnum
then Same_line (Same_line_loc.create ~bol ~lnum ~start_cnum ~stop_cnum)
else try_loc loc)
else try_loc loc
;;
let of_loc = if Sys.int_size = 63 then of_loc else fun _ -> Loc_does_not_fit
module For_tests = struct
let small_enough = small_enough
end
```
|
Henry Fenn may refer to:
Henry Edwin Fenn (1850–1913), British journalist
Henry Courtenay Fenn (1894–1978), American sinologist
Harry Fenn (1845–1911), English-born American illustrator
|
```yaml
---
operation: create
request:
type: cluster
namespace_name: 1week_namespace
retention_time: 168h
num_shards: 1024
replication_factor: 3
hosts:
- id: m3db001
isolationGroup: us-east1-a
zone: embedded
weight: 100
address: 10.142.0.1
port: 9000
- id: m3db002
isolationGroup: us-east1-b
zone: embedded
weight: 100
address: 10.142.0.2
port: 9000
- id: m3db003
isolationGroup: us-east1-c
zone: embedded
weight: 100
address: 10.142.0.3
port: 9000
```
|
```xml
/*
* Wire
*
* This program is free software: you can redistribute it and/or modify
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with this program. If not, see path_to_url
*
*/
import express from 'express';
import expressSitemapXml from 'express-sitemap-xml';
import hbs from 'hbs';
import helmet from 'helmet';
import {StatusCodes as HTTP_STATUS} from 'http-status-codes';
import nocache from 'nocache';
import fs from 'fs';
import http from 'http';
import https from 'https';
import path from 'path';
import type {ClientConfig, ServerConfig} from './config';
import {HealthCheckRoute} from './routes/_health/HealthRoute';
import {AppleAssociationRoute} from './routes/appleassociation/AppleAssociationRoute';
import {ConfigRoute} from './routes/config/ConfigRoute';
import {InternalErrorRoute, NotFoundRoute} from './routes/error/ErrorRoutes';
import {GoogleWebmasterRoute} from './routes/googlewebmaster/GoogleWebmasterRoute';
import {RedirectRoutes} from './routes/RedirectRoutes';
import {Root} from './routes/Root';
import {replaceHostnameInObject} from './util/hostnameReplacer';
class Server {
private readonly app: express.Express;
private server?: http.Server | https.Server;
constructor(
private readonly config: ServerConfig,
private readonly clientConfig: ClientConfig,
) {
if (this.config.DEVELOPMENT) {
console.info(this.config);
} else if (!this.config.APP_BASE.startsWith('https')) {
throw new Error(`Config variable 'APP_BASE' must be protocol https but is '${this.config.APP_BASE}'`);
}
this.app = express();
this.init();
}
private init(): void {
// The order is important here, please don't sort!
this.initTemplateEngine();
this.initCaching();
this.initForceSSL();
this.initSecurityHeaders();
this.initLatestBrowserRequired();
this.initStaticRoutes();
this.initWebpack();
this.initSiteMap(this.config);
this.app.use('/libs', express.static(path.join(__dirname, 'libs')));
this.app.use(Root());
this.app.use(HealthCheckRoute());
this.app.use(ConfigRoute(this.config, this.clientConfig));
this.app.use(GoogleWebmasterRoute(this.config));
this.app.use(AppleAssociationRoute());
this.app.use(NotFoundRoute());
this.app.use(InternalErrorRoute());
}
private initWebpack() {
if (!this.config.DEVELOPMENT) {
return;
}
const webpackCompiler = require('webpack')(require('../../webpack.config.dev'));
const webpackDevMiddleware = require('webpack-dev-middleware');
const webpackHotMiddleware = require('webpack-hot-middleware');
this.app.use(webpackDevMiddleware(webpackCompiler));
this.app.use(webpackHotMiddleware(webpackCompiler));
}
private initCaching() {
if (this.config.DEVELOPMENT) {
this.app.use(nocache());
} else {
this.app.use((req, res, next) => {
// If the user agent adds a v param, it means that its requesting a particular version of the file and that could be cached forever since the file will never change.
const hasCacheVersionParam = req.query.v && typeof req.query.v === 'string';
const oneYear = 31536000;
const maxAge = hasCacheVersionParam ? oneYear : this.config.CACHE_DURATION_SECONDS;
const milliSeconds = 1000;
res.header('Cache-Control', `public, max-age=${maxAge}`);
res.header('Expires', new Date(Date.now() + maxAge * milliSeconds).toUTCString());
next();
});
}
}
private initForceSSL(): void {
const SSLMiddleware: express.RequestHandler = (req, res, next) => {
const shouldEnforceHTTPS = !this.config.ENFORCE_HTTPS || req.url.match(/_health\/?/);
const isInsecure = !req.secure || req.get('X-Forwarded-Proto') !== 'https';
if (isInsecure && !shouldEnforceHTTPS) {
return res.redirect(HTTP_STATUS.MOVED_PERMANENTLY, `${this.config.APP_BASE}${req.url}`);
}
next();
};
this.app.enable('trust proxy');
this.app.use(SSLMiddleware);
}
private initSecurityHeaders() {
this.app.disable('x-powered-by');
this.app.use(
helmet({
crossOriginEmbedderPolicy: false,
crossOriginOpenerPolicy: false,
frameguard: {action: 'deny'},
}),
);
this.app.use(helmet.noSniff());
this.app.use(helmet.xssFilter());
this.app.use(
helmet.hsts({
includeSubDomains: true,
maxAge: 31536000,
preload: true,
}),
);
this.app.use((req, res, next) => {
helmet.contentSecurityPolicy({
directives: this.config.ENABLE_DYNAMIC_HOSTNAME
? replaceHostnameInObject(this.config.CSP, req)
: this.config.CSP,
reportOnly: false,
})(req, res, next);
});
this.app.use(
helmet.referrerPolicy({
policy: 'same-origin',
}),
);
// With helmet v4 the X-XSS-Protection header is set to `0` by default.
// After discussing this with @franziskuskiefer we want to keep this enabled for old browsers.
// path_to_url
this.app.use((_req, res, next) => {
res.setHeader('X-XSS-Protection', '1; mode=block');
next();
});
}
private initStaticRoutes() {
this.app.use(RedirectRoutes(this.config, this.clientConfig));
this.app.use('/audio', express.static(path.join(__dirname, 'static/audio')));
this.app.use('/ext', express.static(path.join(__dirname, 'static/ext')));
this.app.use('/font', express.static(path.join(__dirname, 'static/font')));
this.app.use('/image', express.static(path.join(__dirname, 'static/image')));
this.app.use('/min', express.static(path.join(__dirname, 'static/min')));
this.app.use('/proto', express.static(path.join(__dirname, 'static/proto')));
this.app.use('/style', express.static(path.join(__dirname, 'static/style')));
this.app.use('/worker', express.static(path.join(__dirname, 'static/worker')));
this.app.use('/assets', express.static(path.join(__dirname, 'static/assets')));
this.app.get('/favicon.ico', (_req, res) => res.sendFile(path.join(__dirname, 'static/image/favicon.ico')));
if (!this.config.DEVELOPMENT) {
this.app.get('/sw.js', (_req, res) => res.sendFile(path.join(__dirname, 'static/sw.js')));
}
}
public initLatestBrowserRequired() {
this.app.use((req, res, next) => {
const fileExtensionRegx = /\.[^/]+$/;
const ignoredPath =
fileExtensionRegx.test(req.path) ||
req.path.startsWith('/commit') ||
req.path.startsWith('/test') ||
req.path.startsWith('/_health') ||
req.path.startsWith('/join') ||
req.path.startsWith('/auth') ||
req.path.startsWith('/google') ||
req.path.startsWith('/unsupported') ||
req.path.startsWith('/apple-app-site-association');
if (ignoredPath) {
return next();
}
return next();
});
}
private initTemplateEngine() {
this.app.set('view engine', 'html');
this.app.engine('html', hbs.__express);
this.app.set('views', [path.resolve(__dirname, 'static'), path.resolve(__dirname, 'templates')]);
hbs.localsAsTemplateData(this.app);
this.app.locals.config = {
APP_BASE: this.config.APP_BASE,
OPEN_GRAPH: this.config.OPEN_GRAPH,
VERSION: this.config.VERSION,
};
}
private initSiteMap(config: ServerConfig) {
if (config.APP_BASE) {
const pages = () => [
{
changeFreq: 'weekly',
url: '/auth/',
},
{
changeFreq: 'weekly',
url: '/',
},
];
this.app.use(expressSitemapXml(pages, config.APP_BASE));
}
}
start(): Promise<number> {
return new Promise((resolve, reject) => {
if (this.server) {
reject('Server is already running.');
} else if (this.config.PORT_HTTP) {
if (this.config.DEVELOPMENT && this.config.DEVELOPMENT_ENABLE_TLS) {
const options = {
cert: fs.readFileSync(this.config.SSL_CERTIFICATE_PATH),
key: fs.readFileSync(this.config.SSL_CERTIFICATE_KEY_PATH),
};
this.server = https
.createServer(options, this.app)
.listen(this.config.PORT_HTTP, '0.0.0.0', () => resolve(this.config.PORT_HTTP));
} else {
this.server = this.app.listen(this.config.PORT_HTTP, '0.0.0.0', () => resolve(this.config.PORT_HTTP));
}
} else {
reject('Server port not specified.');
}
});
}
async stop(): Promise<void> {
if (this.server) {
this.server.close();
this.server = undefined;
} else {
throw new Error('Server is not running.');
}
}
}
export {Server};
```
|
```java
package com.yahoo.vdslib;
import com.yahoo.vespa.objects.BufferSerializer;
import com.yahoo.vespa.objects.Deserializer;
import java.nio.ByteOrder;
import static java.nio.charset.StandardCharsets.UTF_8;
public class DocumentSummary {
private final Summary[] summaries;
public DocumentSummary(Deserializer buf) {
BufferSerializer bser = (BufferSerializer) buf; // This is a trick. This should be done in a different way.
bser.order(ByteOrder.BIG_ENDIAN);
buf.getInt(null); // legacy - ignored
int numSummaries = buf.getInt(null);
summaries = new Summary[numSummaries];
if (numSummaries > 0) {
int summaryBufferSize = buf.getInt(null);
byte[] cArr = bser.getBuf().array();
int start = bser.getBuf().arrayOffset() + bser.position();
bser.position(bser.position() + summaryBufferSize);
for(int i=0; i < numSummaries; i++) {
int summarySize = buf.getInt(null);
int end = start;
while (cArr[end++] != 0);
byte [] sb = new byte [summarySize];
System.arraycopy(cArr, end, sb, 0, summarySize);
summaries[i] = new Summary(new String(cArr, start, end-start-1, UTF_8), sb);
start = end + summarySize;
}
}
}
final public int getSummaryCount() { return summaries.length; }
final public Summary getSummary(int hitNo) { return summaries[hitNo]; }
public static class Summary implements Comparable<Summary> {
private final String docId;
private byte[] summary;
private Summary(String docId) {
this.docId = docId;
}
public Summary(String docId, byte [] summary) {
this(docId);
this.summary = summary;
}
final public String getDocId() { return docId; }
final public byte [] getSummary() { return summary; }
public int compareTo(Summary s) {
return getDocId().compareTo(s.getDocId());
}
}
}
```
|
```javascript
//your_sha256_hash---------------------------------------
//your_sha256_hash---------------------------------------
// Return values from Intl function calls show the function name correctly in debugger.
/////////////////// DateFormat ////////////////////
var options = { ca: "gregory", hour12: true, timeZone:"UTC" };
var dateFormat1 = new Intl.DateTimeFormat("en-US", options); /**bp:resume('step_over');locals();**/
WScript.Echo(""); // Dummy line to get desired debugger logging behavior. Required due to the above bug.
var date1 = new Date(2000, 1, 1);
var date2 = dateFormat1.format(date1); /**bp:resume('step_over');locals();**/
WScript.Echo(""); // Dummy line to get desired debugger logging behavior. Required due to the above bug.
var stringDate1 = date1.toLocaleString("en-us"); /**bp:resume('step_over');locals();resume('step_over');locals();resume('step_over');locals();**/
Intl.DateTimeFormat.supportedLocalesOf(["en-US"], { localeMatcher: "best fit" });
dateFormat1.resolvedOptions();
WScript.Echo(""); // Dummy line to get desired debugger logging behavior. Required due to the above bug.
/////////////////// NumberFormat ////////////////////
var numberFormat1 = new Intl.NumberFormat(); /**bp:resume('step_over');locals();**/
WScript.Echo(""); // Dummy line to get desired debugger logging behavior. Required due to the above bug.
var formattedNumber1 = numberFormat1.format(123.456); /**bp:resume('step_over');locals();**/
WScript.Echo(""); // Dummy line to get desired debugger logging behavior. Required due to the above bug.
Intl.NumberFormat.supportedLocalesOf(["en-US"], { localeMatcher: "lookup" }); /**bp:resume('step_over');locals();resume('step_over');locals();**/
numberFormat1.resolvedOptions(); /**bp:locals();resume('step_over');locals();**/
WScript.Echo(""); // Dummy line to get desired debugger logging behavior. Required due to the above bug.
/////////////////// Collator ////////////////////
var collator1 = Intl.Collator(); /**bp:resume('step_over');locals();resume('step_over');locals();**/
var compare1 = collator1.compare('a', 'b');
WScript.Echo(""); // Dummy line to get desired debugger logging behavior. Required due to the above bug.
Intl.Collator.supportedLocalesOf(["en-US"], { localeMatcher: "best fit" }); /**bp:resume('step_over');locals();resume('step_over');locals();**/
collator1.resolvedOptions();
WScript.Echo("Pass");
```
|
```sqlpl
BEGIN /*!90000 PESSIMISTIC */;
DROP TABLE IF EXISTS `test_table_82`;
COMMIT;
```
|
Tenderness may refer to:
Films
Tenderness (2009 film), a 2009 American crime film
Tenderness (2017 film), a 2017 Italian film also known as La tenerezza
Medicine
Rebound tenderness, a clinical sign that a doctor may detect in physical examination of a patient's abdomen
Tenderness (medicine), pain or discomfort when an affected area is touched
Music
Songs
"Tenderness" (song), a song by General Public from their 1984 album All the Rage
"Tenderness", a song by Steppenwolf from the 1971 album For Ladies Only
"Tenderness", a song by Paul Simon from the 1973 album There Goes Rhymin' Simon
"Tenderness", a song by Diana Ross from the 1980 album diana
"Tenderness", a song by Laura Branigan from the 1985 album Hold Me
"Tenderness", a song by Janis Ian from the 1995 album Revenge
Albums
Tenderness (Blue Hawaii album), 2017
Tenderness (Walt Dickerson and Richard Davis album), 1985
Tenderness (Kip Hanrahan album), 1990
Tenderness (Al Jarreau album), 1994
Tenderness (Duff McKagan album), 2019
Tenderness (J. D. Souther album), 2015
Tenderness, a 1981 album by the Ohio Players
Tenderness, a 1998 album by Kristine
Other uses
Hardiness (plants) (in)ability to withstand freezing temperatures
Meat tenderness, a gauge of meat palatability
Tenderness (novel), by Robert Cormier
Tenderness (sculpture), a marble sculpture by Canadian Paul Lancz
See also
Tender (disambiguation)
Term of endearment
Affection
Care (disambiguation)
Kindness
Love
|
```sqlpl
INSERT INTO article (id, content) VALUES ('id_0002', E'# My second
markdown doc
first paragraph
-- with a comment
-- with an indent comment
second paragraph');
```
|
Jaylen Clinton Andrew Nowell (born July 9, 1999) is an American professional basketball player who last played for the Minnesota Timberwolves of the National Basketball Association (NBA). He played college basketball for the Washington Huskies of the Pac-12 Conference, and was named the conference's player of the year in 2019. He was selected by the Timberwolves in the second round of the 2019 NBA draft.
Early life
Nowell was born in Seattle to Lanie and Mike Nowell. His parents met at Clark Atlanta University, where they both played basketball. His father played professionally in the Continental Basketball Association. Jaylen Nowell attended high school in Seattle at Garfield High, where he was a standout player.
College career
At the University of Washington, Nowell was originally part of a five-player recruiting class considered the best in the Huskies' history. However, after Washington coach Lorenzo Romar was fired, he was the lone member who remained committed to the school and first-year coach Mike Hopkins. As a freshman in 2017–18, Nowell averaged 16.0 points per game. The following season, he was named the Pac-12 Player of the Year after leading the Huskies in scoring and helping them win the Pac-12 regular season championship.
Following Washington's loss in the 2019 NCAA men's basketball tournament, Nowell announced his intention to forgo his final two seasons of collegiate eligibility and declare for the 2019 NBA draft.
Professional career
Minnesota Timberwolves (2019–2023)
On June 20, 2019, Nowell was selected with the 43rd overall pick in the 2nd round by the Minnesota Timberwolves in the 2019 NBA draft. He was later included in the Timberwolves' roster for the 2019 NBA Summer League. On August 6, Nowell signed with the Timberwolves. He made his NBA debut on November 6, playing one minute in a 121–137 loss to the Memphis Grizzlies. On January 1, 2020, Nowell scored a season-high 12 points, alongside two rebounds, in a 104–106 loss to the Milwaukee Bucks.
On March 11, 2021, Nowell scored a season-high 28 points, alongside five rebounds and six assists, in a 135–105 win over the New Orleans Pelicans.
On December 27, 2021, Nowell scored a career-high 29 points, alongside six rebounds and three assists, in a 108–103 win over the Boston Celtics. The Timberwolves qualified for the postseason for the first time since 2018 and faced the Memphis Grizzlies during their first round series. Nowell made his playoff debut on April 19, 2022, scoring six points in a 96–124 Game 2 loss. The Timberwolves were eliminated by the Grizzlies in six games.
On October 2, 2023, Nowell signed with the Sacramento Kings, but was waived on October 20.
Career statistics
NBA
Regular season
|-
| style="text-align:left;"|
| style="text-align:left;"|Minnesota
| 15 || 0 || 10.1 || .358 || .115 || .941 || .9 || 1.3 || .2 || .1 || 3.8
|-
| style="text-align:left;"|
| style="text-align:left;"|Minnesota
| 42 || 0 || 18.1 || .424 || .333 || .818 || 2.3 || 1.5 || .5 || .3 || 9.0
|-
| style="text-align:left;"|
| style="text-align:left;"|Minnesota
| 62 || 1 || 15.7 || .475 || .394 || .783 || 2.0 || 2.1 || .4 || .2 || 8.5
|-
| style="text-align:left;"|
| style="text-align:left;"|Minnesota
| 65 || 2 || 19.3 || .448 || .289 || .778 || 2.6 || 2.0 || .6 || .1 || 10.8
|- class="sortbottom"
| style="text-align:center;" colspan="2"|Career
| 184 || 3 || 17.0 || .447 || .322 || .798 || 2.2 || 1.9 || .5 || .2 || 9.1
Play-in
|-
| style="text-align:left;"|2022
| style="text-align:left;"|Minnesota
| 1 || 0 || 8.6 || .500 || || .500 || .0 || 2.0 || 1.0 || .0 || 3.0
|-
| style="text-align:left;"|2023
| style="text-align:left;"|Minnesota
| 1 || 0 || 13.4 || .571 || .333 || || 1.0 || 1.0 || .0 || .0 || 9.0|- class="sortbottom"
| style="text-align:center;" colspan="2"|Career
| 2 || 0 || 11.0 || .556 || .333 || .500 || .5 || 1.5 || .5 || .0 || 6.0
Playoffs
|-
| style="text-align:left;"|2022
| style="text-align:left;"|Minnesota
| 1 || 0 || 11.9 || .300 || .000 || — || .0 || 1.0 || 1.0 || .0 || 6.0|-
| style="text-align:left;"|2023
| style="text-align:left;"|Minnesota
| 5 || 0 || 12.4 || .231 || .333 || .500 || 1.0 || .6 || .0 || .0 || 3.2
|- class="sortbottom"
| style="text-align:center;" colspan="2"|Career
| 6 || 0 || 12.3 || .250 || .214 || .500 || .8 || .7 || .2 || .0 || 3.7
College
|-
| style="text-align:left;"| 2017–18
| style="text-align:left;"| Washington
| 34 || 31 || 32.5 || .451 || .351 || .800 || 4.0 || 2.7 || 1.1 || .3 || 16.0
|-
| style="text-align:left;"| 2018–19
| style="text-align:left;"| Washington
| 36 || 36 || 34.4 || .502 || .440 || .779 || 5.3 || 3.1 || 1.3 || .3 || 16.2'''
|- class="sortbottom"
| style="text-align:center;" colspan="2"| Career
| 70 || 67 || 33.5 || .476 || .396 || .789 || 4.6 || 2.9 || 1.2 || .3 || 16.1
References
External links
Washington Huskies bio
1999 births
Living people
American men's basketball players
Basketball players from Seattle
Garfield High School (Seattle) alumni
Iowa Wolves players
Minnesota Timberwolves draft picks
Minnesota Timberwolves players
Shooting guards
Washington Huskies men's basketball players
|
Nowlin is an unincorporated community in Haakon County, in the U.S. state of South Dakota.
History
A post office called Nowlin was established in 1890, and remained in operation until it was discontinued in 1963. The community was named for Henry J. Nowlan, of the U.S. Army (a recording error accounts for the error in spelling, which was never corrected).
References
Unincorporated communities in Haakon County, South Dakota
Unincorporated communities in South Dakota
|
```go
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
package model
import (
"strconv"
"github.com/hashicorp/hcl/v2"
"github.com/hashicorp/hcl/v2/hclsyntax"
"github.com/zclconf/go-cty/cty"
"github.com/pulumi/pulumi/pkg/v3/codegen/hcl2/model/pretty"
"github.com/pulumi/pulumi/pkg/v3/codegen/hcl2/syntax"
)
// ConstType represents a type that is a single constant value.
type ConstType struct {
// Type is the underlying value type.
Type Type
// Value is the constant value.
Value cty.Value
}
// NewConstType creates a new constant type with the given type and value.
func NewConstType(typ Type, value cty.Value) *ConstType {
return &ConstType{Type: typ, Value: value}
}
func (t *ConstType) pretty(seenFormatters map[Type]pretty.Formatter) pretty.Formatter {
if t.Value.IsNull() {
return pretty.FromString("null")
}
if !t.Value.IsKnown() {
return pretty.FromString("unknown")
}
switch t.Value.Type() {
case cty.String:
return pretty.FromString(strconv.Quote(t.Value.AsString()))
case cty.Bool:
return pretty.FromString(strconv.FormatBool(t.Value.True()))
case cty.Number:
return pretty.FromStringer(t.Value.AsBigFloat())
}
return pretty.FromStringer(t)
}
func (t *ConstType) Pretty() pretty.Formatter {
seenFormatters := map[Type]pretty.Formatter{}
return t.pretty(seenFormatters)
}
// SyntaxNode returns the syntax node for the type. This is always syntax.None.
func (*ConstType) SyntaxNode() hclsyntax.Node {
return syntax.None
}
// Traverse attempts to traverse the type with the given traverser. The result is the traversal
// result of the underlying type.
func (t *ConstType) Traverse(traverser hcl.Traverser) (Traversable, hcl.Diagnostics) {
return t.Type.Traverse(traverser)
}
// Equals returns true if this type has the same identity as the given type.
func (t *ConstType) Equals(other Type) bool {
return t.equals(other, nil)
}
func (t *ConstType) equals(other Type, seen map[Type]struct{}) bool {
if t == other {
return true
}
otherConst, ok := other.(*ConstType)
return ok && t.Value.RawEquals(otherConst.Value) && t.Type.equals(otherConst.Type, seen)
}
// AssignableFrom returns true if this type is assignable from the indicated source type. A const(value) is assignable
// from const(value).
func (t *ConstType) AssignableFrom(src Type) bool {
return assignableFrom(t, src, func() bool {
return false
})
}
// ConversionFrom returns the kind of conversion (if any) that is possible from the source type to this type.
// The const type is only convertible from itself.
func (t *ConstType) ConversionFrom(src Type) ConversionKind {
kind, _ := t.conversionFrom(src, false, nil)
return kind
}
func (t *ConstType) conversionFrom(src Type, unifying bool, seen map[Type]struct{}) (ConversionKind, lazyDiagnostics) {
return conversionFrom(t, src, unifying, seen, func() (ConversionKind, lazyDiagnostics) {
if t.Type.ConversionFrom(src) != NoConversion {
return UnsafeConversion, nil
}
return NoConversion, nil
})
}
func (t *ConstType) String() string {
return t.Value.GoString()
}
func (t *ConstType) string(_ map[Type]struct{}) string {
return t.String()
}
func (t *ConstType) unify(other Type) (Type, ConversionKind) {
return unify(t, other, func() (Type, ConversionKind) {
return t, other.ConversionFrom(t)
})
}
func (*ConstType) isType() {}
func IsConstType(t Type) bool {
switch t := t.(type) {
case *ConstType:
return true
case *UnionType:
for _, t := range t.ElementTypes {
_, ok := t.(*ConstType)
if !ok {
return false
}
}
return true
default:
return false
}
}
```
|
```c++
/*
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "gm.h"
#include "SkAnimTimer.h"
#include "SkCanvas.h"
#include "SkPathMeasure.h"
#include "SkRandom.h"
class AddArcGM : public skiagm::GM {
public:
AddArcGM() : fRotate(0) {}
protected:
SkString onShortName() override { return SkString("addarc"); }
SkISize onISize() override { return SkISize::Make(1040, 1040); }
void onDraw(SkCanvas* canvas) override {
canvas->translate(20, 20);
SkRect r = SkRect::MakeWH(1000, 1000);
SkPaint paint;
paint.setAntiAlias(true);
paint.setStyle(SkPaint::kStroke_Style);
paint.setStrokeWidth(15);
const SkScalar inset = paint.getStrokeWidth() + 4;
const SkScalar sweepAngle = 345;
SkRandom rand;
SkScalar sign = 1;
while (r.width() > paint.getStrokeWidth() * 3) {
paint.setColor(rand.nextU() | (0xFF << 24));
SkScalar startAngle = rand.nextUScalar1() * 360;
SkScalar speed = SkScalarSqrt(16 / r.width()) * 0.5f;
startAngle += fRotate * 360 * speed * sign;
SkPath path;
path.addArc(r, startAngle, sweepAngle);
canvas->drawPath(path, paint);
r.inset(inset, inset);
sign = -sign;
}
}
bool onAnimate(const SkAnimTimer& timer) override {
fRotate = timer.scaled(1, 360);
return true;
}
private:
SkScalar fRotate;
typedef skiagm::GM INHERITED;
};
DEF_GM( return new AddArcGM; )
///////////////////////////////////////////////////
#define R 400
class AddArcMeasGM : public skiagm::GM {
public:
AddArcMeasGM() {}
protected:
SkString onShortName() override { return SkString("addarc_meas"); }
SkISize onISize() override { return SkISize::Make(2*R + 40, 2*R + 40); }
void onDraw(SkCanvas* canvas) override {
canvas->translate(R + 20, R + 20);
SkPaint paint;
paint.setAntiAlias(true);
paint.setStyle(SkPaint::kStroke_Style);
SkPaint measPaint;
measPaint.setAntiAlias(true);
measPaint.setColor(SK_ColorRED);
const SkRect oval = SkRect::MakeLTRB(-R, -R, R, R);
canvas->drawOval(oval, paint);
for (SkScalar deg = 0; deg < 360; deg += 10) {
const SkScalar rad = SkDegreesToRadians(deg);
SkScalar rx = SkScalarCos(rad) * R;
SkScalar ry = SkScalarSin(rad) * R;
canvas->drawLine(0, 0, rx, ry, paint);
SkPath path;
path.addArc(oval, 0, deg);
SkPathMeasure meas(path, false);
SkScalar arcLen = rad * R;
SkPoint pos;
if (meas.getPosTan(arcLen, &pos, NULL)) {
canvas->drawLine(0, 0, pos.x(), pos.y(), measPaint);
}
}
}
private:
typedef skiagm::GM INHERITED;
};
DEF_GM( return new AddArcMeasGM; )
///////////////////////////////////////////////////
// Emphasize drawing a stroked oval (containing conics) and then scaling the results up,
// to ensure that we compute the stroke taking the CTM into account
//
class StrokeCircleGM : public skiagm::GM {
public:
StrokeCircleGM() : fRotate(0) {}
protected:
SkString onShortName() override { return SkString("strokecircle"); }
SkISize onISize() override { return SkISize::Make(520, 520); }
void onDraw(SkCanvas* canvas) override {
canvas->scale(20, 20);
canvas->translate(13, 13);
SkPaint paint;
paint.setAntiAlias(true);
paint.setStyle(SkPaint::kStroke_Style);
paint.setStrokeWidth(SK_Scalar1 / 2);
const SkScalar delta = paint.getStrokeWidth() * 3 / 2;
SkRect r = SkRect::MakeXYWH(-12, -12, 24, 24);
SkRandom rand;
SkScalar sign = 1;
while (r.width() > paint.getStrokeWidth() * 2) {
SkAutoCanvasRestore acr(canvas, true);
canvas->rotate(fRotate * sign);
paint.setColor(rand.nextU() | (0xFF << 24));
canvas->drawOval(r, paint);
r.inset(delta, delta);
sign = -sign;
}
}
bool onAnimate(const SkAnimTimer& timer) override {
fRotate = timer.scaled(60, 360);
return true;
}
private:
SkScalar fRotate;
typedef skiagm::GM INHERITED;
};
DEF_GM( return new StrokeCircleGM; )
//////////////////////
static void html_canvas_arc(SkPath* path, SkScalar x, SkScalar y, SkScalar r, SkScalar start,
SkScalar end, bool ccw) {
SkRect bounds = { x - r, y - r, x + r, y + r };
SkScalar sweep = ccw ? end - start : start - end;
path->arcTo(bounds, start, sweep, false);
}
// Lifted from canvas-arc-circumference-fill-diffs.html
class ManyArcsGM : public skiagm::GM {
public:
ManyArcsGM() {}
protected:
SkString onShortName() override { return SkString("manyarcs"); }
SkISize onISize() override { return SkISize::Make(620, 330); }
void onDraw(SkCanvas* canvas) override {
SkPaint paint;
paint.setAntiAlias(true);
paint.setStyle(SkPaint::kStroke_Style);
canvas->translate(10, 10);
// 20 angles.
SkScalar sweepAngles[] = {
-123.7f, -2.3f, -2, -1, -0.3f, -0.000001f, 0, 0.000001f, 0.3f, 0.7f,
1, 1.3f, 1.5f, 1.7f, 1.99999f, 2, 2.00001f, 2.3f, 4.3f, 3934723942837.3f
};
for (size_t i = 0; i < SK_ARRAY_COUNT(sweepAngles); ++i) {
sweepAngles[i] *= 180;
}
SkScalar startAngles[] = { -1, -0.5f, 0, 0.5f };
for (size_t i = 0; i < SK_ARRAY_COUNT(startAngles); ++i) {
startAngles[i] *= 180;
}
bool anticlockwise = false;
SkScalar sign = 1;
for (size_t i = 0; i < SK_ARRAY_COUNT(startAngles) * 2; ++i) {
if (i == SK_ARRAY_COUNT(startAngles)) {
anticlockwise = true;
sign = -1;
}
SkScalar startAngle = startAngles[i % SK_ARRAY_COUNT(startAngles)] * sign;
canvas->save();
for (size_t j = 0; j < SK_ARRAY_COUNT(sweepAngles); ++j) {
SkPath path;
path.moveTo(0, 2);
html_canvas_arc(&path, 18, 15, 10, startAngle, startAngle + (sweepAngles[j] * sign),
anticlockwise);
path.lineTo(0, 28);
canvas->drawPath(path, paint);
canvas->translate(30, 0);
}
canvas->restore();
canvas->translate(0, 40);
}
}
private:
typedef skiagm::GM INHERITED;
};
DEF_GM( return new ManyArcsGM; )
```
|
The Ljubljana Central Market () is a market in Ljubljana, Slovenia. The riverside market building, sometimes referred to as Plečnik's Market (), was designed by Jože Plečnik between 1931 and 1939. It stretches between the Triple Bridge and the Dragon Bridge, on the right bank of the Ljubljanica River. The marketplace and Vodnik Square (), where it is located, are cultural monuments of national significance. It is partly located at Adamič and Lunder Embankment () and at Pogačar Square ().
History
The 1895 earthquake destroyed an old monastery with a diocesan college for girls. After the damaged building was removed, Vodnik Square provided a venue for an outdoor market. The present market building, designed by the architect Jože Plečnik, was built between 1940 and 1942 by Matko Curk's company. It originally had an area of .
The design of the complex reflects Renaissance influences. It was conceived as a two-storey market hall following the curve of the river. On the side overlooking the river the market halls have large semi-circular windows, while the street side is defined by a colonnade. In order to provide views of the river, the building is interrupted with two open-columned loggias. The roof is covered with concrete tiles.
Plečnik planned to fill the middle gap between the market halls with a monumental covered bridge to connect to the Petkovšek Embankment (), but his design was never built. His plans for a bridge were finally fulfilled in July 2010, when the newly designed Butchers' Bridge was inaugurated.
Since August 2021, the Ljubljana Central Market has been inscribed as part of Plečnik's legacy on the UNESCO World Heritage List.
Market
The market is open daily except for Sundays. It has a flower market at the junction of Pogačar Square and Vodnik Square, a fish market and dried fruit on the lower level of the market hall and bakery, dairy and meat stalls on both levels. The colonnade at the Triple Bridge end provides shelter for stalls selling herbs, spices, and arts and crafts.
Legal status
From October 2008, the market was provisionally protected by the Slovenian Ministry of Culture under Vasko Simoniti as a cultural monument of national importance. The decree was annulled by his successor Majda Širca in February 2009. In March 2012, the protection at the state level was reenacted by Žiga Turk for one year with the protection of the Vodnik Square Archaeological Site. It has been disputed by the City Municipality of Ljubljana, aiming to build a parking garage under it, since June 2012 at the Slovenian Constitutional Court. The protection has been endorsed by the civil initiative We're Not Giving Up the Market ().
References
External links
Central Market
World Heritage Sites in Slovenia
Retail markets in Slovenia
Central Market
Central Market
Jože Plečnik buildings
Commercial buildings completed in 1942
1942 establishments in Yugoslavia
20th-century architecture in Slovenia
|
```scss
// =============================================================================
// ScrollAppear
// =============================================================================
.appear {
visibility: hidden;
opacity: 0;
}
.appeared {
visibility: visible;
opacity: 1;
transition: opacity 0.5s ease-in-out;
}
```
|
Elaine Shirley Watt (December 1, 1929 – February 19, 1985) was an American equestrian. She competed in the individual dressage event at the 1956 Summer Olympics.
References
External links
1929 births
1985 deaths
American female equestrians
American dressage riders
Olympic equestrians for the United States
Equestrians at the 1956 Summer Olympics
Sportspeople from Brooklyn
20th-century American women
|
```php
<?php
return [
'Select' => '',
'Deselect_All' => 'Deselect All',
'Select_All' => 'Select All',
'Erase' => '',
'Open' => '',
'Confirm_del' => ' , ?',
'All' => ' ',
'Files' => '',
'Images' => '',
'Archives' => '',
'Error_Upload' => ' .',
'Error_extension' => ' .',
'Upload_file' => ' ',
'Filters' => '',
'Videos' => '',
'Music' => '',
'New_Folder' => ' ',
'Folder_Created' => ' ',
'Existing_Folder' => ' ',
'Confirm_Folder_del' => ' , ?',
'Return_Files_List' => ' ',
'Preview' => '',
'Download' => '',
'Insert_Folder_Name' => ' :',
'Root' => ' ',
'Rename' => '',
'Back' => '',
'View' => '',
'View_list' => '',
'View_columns_list' => '',
'View_boxes' => '',
'Toolbar' => '',
'Actions' => '',
'Rename_existing_file' => ' ',
'Rename_existing_folder' => ' ',
'Empty_name' => ' ',
'Text_filter' => '',
'Swipe_help' => ' /, ',
'Upload_base' => ' ',
'Upload_base_help' => " ( ) , (), . , .",
'Upload_add_files' => ' ()',
'Upload_start' => ' ',
'Upload_error_messages' =>[1 => ' upload_max_filesize php.ini', 2 => ' MAX_FILE_SIZE, HTML-', 3 => ' ', 4 => ' ', 6 => ' ', 7 => ' ', 8 => ' PHP ', 'post_max_size' => ' post_max_size php.ini', 'max_file_size' => ' ', 'min_file_size' => ' ', 'accept_file_types' => ' ', 'max_number_of_files' => ' ', 'max_width' => ' ', 'min_width' => ' ', 'max_height' => ' ', 'min_height' => ' ', 'abort' => ' ', 'image_resize' => ' '],
'Upload_url' => ' ',
'Type_dir' => '',
'Type' => '',
'Dimension' => '',
'Size' => '',
'Date' => '',
'Filename' => ' ',
'Operations' => '',
'Date_type' => 'd-m-Y',
'OK' => 'OK',
'Cancel' => '',
'Sorting' => '',
'Show_url' => ' URL',
'Extract' => ' ',
'File_info' => ' ',
'Edit_image' => '',
'Duplicate' => ' ',
'Folders' => '',
'Copy' => '',
'Cut' => '',
'Paste' => '',
'CB' => ' ',
// clipboard
'Paste_Here' => ' ',
'Paste_Confirm' => ' ? ',
'Paste_Failed' => ' ().',
'Clear_Clipboard' => ' ',
'Clear_Clipboard_Confirm' => ' ?',
'Files_ON_Clipboard' => ' .',
'Copy_Cut_Size_Limit' => ' / %s. : %d ',
// %s = cut or copy
'Copy_Cut_Count_Limit' => ' / %s. : %d ',
// %s = cut or copy
'Copy_Cut_Not_Allowed' => ' %s .',
// %s(1) = cut or copy, %s(2) = files or folders
'Image_Editor_No_Save' => ' .',
'Image_Editor_Exit' => "Exit",
'Image_Editor_Save' => "Save",
'Zip_No_Extract' => ' . .',
'Zip_Invalid' => ' . : zip, gz, tar.',
'Dir_No_Write' => ' .',
'Function_Disabled' => ' %s .',
// %s = cut or copy
'File_Permission' => ' ',
'File_Permission_Not_Allowed' => ' %s .',
// %s = files or folders
'File_Permission_Recursive' => ' ?',
'File_Permission_Wrong_Mode' => " .",
'User' => '',
'Group' => '',
'Yes' => '',
'No' => '',
'Lang_Not_Found' => ' ',
'Lang_Change' => ' ',
'File_Not_Found' => ' ',
'File_Open_Edit_Not_Allowed' => ' %s .',
// %s = open or edit
'Edit' => '',
'Edit_File' => " ",
'File_Save_OK' => " ",
'File_Save_Error' => " ",
'New_File' => ' ',
'No_Extension' => ' ',
'Valid_Extensions' => ' : %s',
// %s = txt,log etc.
'Upload_message' => " , ",
'SERVER ERROR' => " ",
'forbidden' => "",
'wrong path' => " ",
'wrong name' => " ",
'wrong extension' => " ",
'wrong option' => " ",
'wrong data' => " ",
'wrong action' => " ",
'wrong sub-action' => " .",
'no action passed' => " ",
'no path' => " ",
'no file' => " ",
'view type number missing' => " ",
'Not enough Memory' => " ",
'max_size_reached' => " %d MB.",
//%d = max overall size
'B' => "B",
'KB' => "KB",
'MB' => "MB",
'GB' => "GB",
'TB' => "TB",
'total size' => " ",
];
```
|
```java
package com.klinker.android.twitter_l.activities.drawer_activities.lists;
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
import android.content.Context;
import android.content.SharedPreferences;
import android.content.res.Configuration;
import android.os.AsyncTask;
import android.os.Build;
import android.os.Bundle;
import android.os.Handler;
import android.preference.PreferenceManager;
import android.util.TypedValue;
import android.view.View;
import android.view.WindowManager;
import android.widget.AbsListView;
import android.widget.LinearLayout;
import android.widget.ListView;
import com.klinker.android.twitter_l.R;
import com.klinker.android.twitter_l.activities.WhiteToolbarActivity;
import com.klinker.android.twitter_l.adapters.UserListMembersArrayAdapter;
import com.klinker.android.twitter_l.settings.AppSettings;
import com.klinker.android.twitter_l.utils.Utils;
import java.util.ArrayList;
import twitter4j.PagableResponseList;
import twitter4j.Twitter;
import twitter4j.User;
public class ViewUsers extends WhiteToolbarActivity {
public AppSettings settings;
private Context context;
private SharedPreferences sharedPrefs;
private androidx.appcompat.app.ActionBar actionBar;
private ListView listView;
private LinearLayout spinner;
private boolean canRefresh = true;
private long listId;
private String listName;
private long currCursor = -1;
private boolean bigEnough = false;
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
context = this;
sharedPrefs = PreferenceManager.getDefaultSharedPreferences(context);
settings = AppSettings.getInstance(this);
if(Build.VERSION.SDK_INT >= Build.VERSION_CODES.LOLLIPOP) {
getWindow().setStatusBarColor(settings.themeColors.primaryColorDark);
}
getWindow().addFlags(WindowManager.LayoutParams.FLAG_TRANSLUCENT_NAVIGATION);
listName = getIntent().getStringExtra("list_name");
Utils.setUpTheme(this, settings);
actionBar = getSupportActionBar();
actionBar.setTitle(listName);
setContentView(R.layout.list_view_activity);
spinner = (LinearLayout) findViewById(R.id.list_progress);
listView = (ListView) findViewById(R.id.listView);
if (Utils.hasNavBar(context) && (getResources().getConfiguration().orientation != Configuration.ORIENTATION_LANDSCAPE) || getResources().getBoolean(R.bool.isTablet)) {
View footer = new View(context);
footer.setOnClickListener(null);
footer.setOnLongClickListener(null);
ListView.LayoutParams params = new ListView.LayoutParams(ListView.LayoutParams.MATCH_PARENT,
Utils.getNavBarHeight(context) + Utils.getActionBarHeight(context) + Utils.getStatusBarHeight(context));
footer.setLayoutParams(params);
listView.addFooterView(footer);
listView.setFooterDividersEnabled(false);
} else {
View footer = new View(context);
footer.setOnClickListener(null);
footer.setOnLongClickListener(null);
ListView.LayoutParams params = new ListView.LayoutParams(ListView.LayoutParams.MATCH_PARENT,
Utils.getActionBarHeight(context) + Utils.getStatusBarHeight(context));
footer.setLayoutParams(params);
listView.addFooterView(footer);
listView.setFooterDividersEnabled(false);
}
listView.setTranslationY(Utils.getStatusBarHeight(context) + Utils.getActionBarHeight(context));
listView.setOnScrollListener(new AbsListView.OnScrollListener() {
@Override
public void onScrollStateChanged(AbsListView absListView, int i) {
}
@Override
public void onScroll(AbsListView absListView, int firstVisibleItem, int visibleItemCount, int totalItemCount) {
final int lastItem = firstVisibleItem + visibleItemCount;
if(lastItem == totalItemCount) {
// Last item is fully visible.
if (canRefresh && bigEnough) {
new GetUsers().execute();
}
canRefresh = false;
new Handler().postDelayed(new Runnable() {
@Override
public void run() {
canRefresh = true;
}
}, 4000);
}
}
});
listId = getIntent().getLongExtra("list_id", 0);
new GetUsers().execute();
Utils.setActionBar(context);
}
public int toDP(int px) {
return (int) TypedValue.applyDimension(TypedValue.COMPLEX_UNIT_DIP, px, getResources().getDisplayMetrics());
}
ArrayList<User> array;
UserListMembersArrayAdapter people;
class GetUsers extends AsyncTask<String, Void, ArrayList<User>> {
protected ArrayList<User> doInBackground(String... urls) {
if (array == null) {
array = new ArrayList<User>();
}
try {
Twitter twitter = Utils.getTwitter(context, settings);
PagableResponseList<User> users = twitter.getUserListMembers(listId, currCursor);
currCursor = users.getNextCursor();
for (User user : users) {
array.add(user);
}
bigEnough = users.size() > 16;
return array;
} catch (Exception e) {
e.printStackTrace();
return null;
}
}
protected void onPostExecute(ArrayList<User> users) {
if (users != null) {
if (people == null) {
people = new UserListMembersArrayAdapter(context, users, listId);
listView.setAdapter(people);
} else {
people.notifyDataSetChanged();
}
}
spinner.setVisibility(View.GONE);
listView.setVisibility(View.VISIBLE);
}
}
}
```
|
```c
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
#include "stdlib/stats/base/dcuminabs.h"
#include <stdint.h>
#include <stdio.h>
#include <inttypes.h>
int main( void ) {
// Create strided arrays:
double x[] = { 1.0, 2.0, -3.0, 4.0, -5.0, 6.0, 7.0, 8.0 };
double y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 };
// Specify the number of elements:
int64_t N = 4;
// Specify stride lengths:
int64_t strideX = 2;
int64_t strideY = -2;
// Compute the cumulative minimum absolute value:
stdlib_strided_dcuminabs( N, x, strideX, y, strideY );
// Print the result:
for ( int64_t i = 0; i < 8; i++ ) {
printf( "y[ %"PRId64" ] = %lf\n", i, y[ i ] );
}
}
```
|
```ruby
# frozen_string_literal: true
class Api::V1::Crypto::DeliveriesController < Api::BaseController
before_action -> { doorkeeper_authorize! :crypto }
before_action :require_user!
before_action :set_current_device
def create
devices.each do |device_params|
DeliverToDeviceService.new.call(current_account, @current_device, device_params)
end
render_empty
end
private
def set_current_device
@current_device = Device.find_by!(access_token: doorkeeper_token)
end
def resource_params
params.require(:device)
params.permit(device: [:account_id, :device_id, :type, :body, :hmac])
end
def devices
Array(resource_params[:device])
end
end
```
|
```php
<?php
/*
* This file is part of the Kimai time-tracking app.
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace App\Tests\Voter;
use App\Entity\InvoiceTemplate;
use App\Entity\User;
use App\Voter\UserVoter;
use Symfony\Component\Security\Core\Authentication\Token\UsernamePasswordToken;
use Symfony\Component\Security\Core\Authorization\Voter\VoterInterface;
/**
* @covers \App\Voter\UserVoter
*/
class UserVoterTest extends AbstractVoterTest
{
/**
* @dataProvider getTestData
*/
public function testVote(User $user, $subject, $attribute, $result): void
{
$token = new UsernamePasswordToken($user, 'bar', $user->getRoles());
$sut = $this->getVoter(UserVoter::class);
$this->assertEquals($result, $sut->vote($token, $subject, [$attribute]));
}
public function getTestData()
{
$user0 = $this->getUser(0, null);
$user1 = $this->getUser(1, User::ROLE_USER);
$user2 = $this->getUser(2, User::ROLE_TEAMLEAD);
$user3 = $this->getUser(3, User::ROLE_ADMIN);
$user4 = $this->getUser(4, User::ROLE_SUPER_ADMIN);
$result = VoterInterface::ACCESS_GRANTED;
foreach ([$user1, $user2, $user3] as $user) {
yield [$user4, $user, 'view', $result];
yield [$user4, $user, 'edit', $result];
yield [$user4, $user, 'password', $result];
yield [$user4, $user, 'roles', $result];
yield [$user4, $user, 'preferences', $result];
yield [$user4, $user, 'api-token', $result];
}
foreach ([$user1, $user2, $user3] as $user) {
yield [$user4, $user, 'delete', $result];
}
foreach ([$user1, $user2, $user3, $user4] as $user) {
yield [$user, $user, 'view', $result];
yield [$user, $user, 'edit', $result];
yield [$user, $user, 'password', $result];
yield [$user, $user, 'preferences', $result];
yield [$user, $user, 'api-token', $result];
}
$result = VoterInterface::ACCESS_DENIED;
foreach ([$user0, $user1, $user2] as $user) {
yield [$user, $user, 'roles', $result];
yield [$user3, $user, 'roles', $result];
yield [$user, $user3, 'view', $result];
yield [$user, $user3, 'edit', $result];
yield [$user, $user3, 'delete', $result];
yield [$user, $user4, 'view', $result];
yield [$user, $user4, 'edit', $result];
yield [$user, $user4, 'delete', $result];
yield [$user, $user4, 'hourly-rate', $result];
yield [$user, $user4, 'hourly-rate', $result];
}
$result = VoterInterface::ACCESS_ABSTAIN;
foreach ([$user0, $user1, $user2] as $user) {
yield [$user, new InvoiceTemplate(), 'view', $result];
yield [$user, new InvoiceTemplate(), 'edit', $result];
yield [$user, new InvoiceTemplate(), 'delete', $result];
yield [$user, new \stdClass(), 'view', $result];
yield [$user, null, 'edit', $result];
yield [$user, null, 'delete', $result];
}
}
/**
* @dataProvider getTestDataForAuthType
*/
public function testPasswordIsDeniedForNonInternalUser(string $authType, int $result): void
{
$user = new User();
$user->setUserIdentifier('admin');
$user->addRole('ROLE_SUPER_ADMIN');
$subject = new User();
$subject->setUserIdentifier('foo');
$subject->addRole('ROLE_USER');
$subject->setAuth($authType);
$this->testVote($user, $subject, 'password', $result);
}
public function getTestDataForAuthType()
{
return [
[User::AUTH_LDAP, VoterInterface::ACCESS_DENIED],
[User::AUTH_INTERNAL, VoterInterface::ACCESS_GRANTED],
[User::AUTH_SAML, VoterInterface::ACCESS_DENIED],
];
}
public function testViewTeamMember(): void
{
$userMock = $this->createMock(User::class);
$userMock->method('getId')->willReturn(1);
$user = new User();
$token = new UsernamePasswordToken($user, 'bar', $user->getRoles());
$sut = $this->getVoter(UserVoter::class);
$this->assertEquals(VoterInterface::ACCESS_GRANTED, $sut->vote($token, $user, ['view_team_member']));
$this->assertEquals(VoterInterface::ACCESS_DENIED, $sut->vote($token, $userMock, ['view_team_member']));
}
}
```
|
Yüksekköy () is a village in the İdil District of Şırnak Province in Turkey. The village is populated by Kurds of the Aluwa tribe and had a population of 918 in 2021.
References
Villages in İdil District
Kurdish settlements in Şırnak Province
|
```c++
# * Housemarque Oy
# * path_to_url
# *
# * accompanying file LICENSE_1_0.txt or copy at
# * path_to_url
# */
#
# /* Revised by Paul Mensonides (2002) */
#
# /* See path_to_url for most recent version. */
#
# ifndef BOOST_PREPROCESSOR_LIST_REST_N_HPP
# define BOOST_PREPROCESSOR_LIST_REST_N_HPP
#
# include <boost/preprocessor/arithmetic/dec.hpp>
# include <boost/preprocessor/config/config.hpp>
# include <boost/preprocessor/control/while.hpp>
# include <boost/preprocessor/list/adt.hpp>
# include <boost/preprocessor/tuple/elem.hpp>
#
# /* BOOST_PP_LIST_REST_N */
#
# if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
# define BOOST_PP_LIST_REST_N(count, list) BOOST_PP_TUPLE_ELEM(2, 0, BOOST_PP_WHILE(BOOST_PP_LIST_REST_N_P, BOOST_PP_LIST_REST_N_O, (list, count)))
# else
# define BOOST_PP_LIST_REST_N(count, list) BOOST_PP_LIST_REST_N_I(count, list)
# define BOOST_PP_LIST_REST_N_I(count, list) BOOST_PP_TUPLE_ELEM(2, 0, BOOST_PP_WHILE(BOOST_PP_LIST_REST_N_P, BOOST_PP_LIST_REST_N_O, (list, count)))
# endif
#
# if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
# define BOOST_PP_LIST_REST_N_P(d, lc) BOOST_PP_TUPLE_ELEM(2, 1, lc)
# else
# define BOOST_PP_LIST_REST_N_P(d, lc) BOOST_PP_LIST_REST_N_P_I lc
# define BOOST_PP_LIST_REST_N_P_I(list, count) count
# endif
#
# if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
# define BOOST_PP_LIST_REST_N_O(d, lc) (BOOST_PP_LIST_REST(BOOST_PP_TUPLE_ELEM(2, 0, lc)), BOOST_PP_DEC(BOOST_PP_TUPLE_ELEM(2, 1, lc)))
# else
# define BOOST_PP_LIST_REST_N_O(d, lc) BOOST_PP_LIST_REST_N_O_I lc
# define BOOST_PP_LIST_REST_N_O_I(list, count) (BOOST_PP_LIST_REST(list), BOOST_PP_DEC(count))
# endif
#
# /* BOOST_PP_LIST_REST_N_D */
#
# if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
# define BOOST_PP_LIST_REST_N_D(d, count, list) BOOST_PP_TUPLE_ELEM(2, 0, BOOST_PP_WHILE_ ## d(BOOST_PP_LIST_REST_N_P, BOOST_PP_LIST_REST_N_O, (list, count)))
# else
# define BOOST_PP_LIST_REST_N_D(d, count, list) BOOST_PP_LIST_REST_N_D_I(d, count, list)
# define BOOST_PP_LIST_REST_N_D_I(d, count, list) BOOST_PP_TUPLE_ELEM(2, 0, BOOST_PP_WHILE_ ## d(BOOST_PP_LIST_REST_N_P, BOOST_PP_LIST_REST_N_O, (list, count)))
# endif
#
# endif
```
|
The Chixoy River or Río Chixoy is a river in Guatemala. The river is called Río Negro from its sources in the highlands of Huehuetenango and El Quiché until it reaches the Chixoy hydroelectric dam (located at ), where the Río Salamá and Rio Carchela converge with the Río Negro. After the Chixoy dam, the river is called Río Chixoy and flows northwards, marking the departmental limits between Alta Verapaz and El Quiché, until it reaches the border with Mexico. From there on it continues along the border for another as the Salinas river until it finally converges with the Río la Pasión (at ) to form the Usumacinta river which flows into the Gulf of Mexico.
The Chixoy river's water discharge of is Guatemala's highest. This was one of the main reasons for selecting this river for the construction of the Chixoy Hydroelectric dam. Guatemala's National Institute for Electricity (INDE) is planning the construction of another hydroelectric dam on the Chixoy river. The proposed location of the Xalalá hydroelectric dam is situated at . in the municipality of Ixcán, El Quiché.
See also
Chixoy hydroelectric dam
Río Negro Massacre
References
External links
Map of Guatemala including the river
Chixoy
Geography of Guatemala
Usumacinta River
|
Maria João Mira (born 18 September 1959 in Lisbon) is a Portuguese screenwriter who authored several successful telenovelas.
Biography
Mira was the first director of the Casa da Criação (House of Creation), a television writing company founded in 2001 by the production company Nicolau Breyner Produções. Her son, André Ramalho, is also a screenwriter. They have been working together on some occasions.
Television
Sonhos Traídos (2002)
Saber Amar (2003)
O Teu Olhar (2003–2004)
Queridas Feras (2003–2004)
Morangos com Açúcar (2003–2005)
Mistura Fina (2004–2005)
Fala-me de Amor (2006)
Ilha dos Amores (2007)
Flor do Mar (2008–2009)
Anjo Meu (2011–2012)
Doida Por Ti (2012–2013)
A Única Mulher (2015-2017)
A Herdeira (2017-2018)
External links
Photo portrait of Maria João Mira
Portuguese screenwriters
1959 births
Living people
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*
*/
package com.ctrip.framework.apollo.openapi.v1.controller;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertTrue;
import com.ctrip.framework.apollo.openapi.dto.OpenAppDTO;
import com.ctrip.framework.apollo.portal.AbstractIntegrationTest;
import java.util.HashSet;
import java.util.Set;
import org.junit.Test;
import org.springframework.http.HttpEntity;
import org.springframework.http.HttpHeaders;
import org.springframework.http.HttpMethod;
import org.springframework.http.ResponseEntity;
import org.springframework.test.context.jdbc.Sql;
/**
* Integration test for {@link AppController}.
*
* @author wxq
*/
public class AppControllerIntegrationTest extends AbstractIntegrationTest {
@Test
@Sql(scripts = "/sql/openapi/ConsumerServiceIntegrationTest.testFindAppIdsAuthorizedByConsumerId.sql", executionPhase = Sql.ExecutionPhase.BEFORE_TEST_METHOD)
@Sql(scripts = "/sql/cleanup.sql", executionPhase = Sql.ExecutionPhase.AFTER_TEST_METHOD)
public void testFindAppsAuthorized() {
final String token = "3c16bf5b1f44b465179253442460e8c0ad845289";
HttpHeaders httpHeaders = new HttpHeaders();
httpHeaders.set(HttpHeaders.AUTHORIZATION, token);
ResponseEntity<OpenAppDTO[]> responseEntity =
restTemplate.exchange(this.url("/openapi/v1/apps/authorized"), HttpMethod.GET,
new HttpEntity<>(httpHeaders), OpenAppDTO[].class);
OpenAppDTO[] openAppDTOS = responseEntity.getBody();
assertEquals(2, openAppDTOS.length);
Set<String> appIds = new HashSet<>();
for (OpenAppDTO openAppDTO : openAppDTOS) {
appIds.add(openAppDTO.getAppId());
}
assertTrue(appIds.contains("consumer-test-app-id-0"));
assertTrue(appIds.contains("consumer-test-app-id-1"));
}
}
```
|
Qazi Ghulam Mustafa (died c. 1123 AH / 1711 AD) was one of the prominent noblemen during the Mughal empire. He was entitled 'Kar Talab Khan' by Bahadur Shah I. He was Emir and belonged to Ferozepur Jhirka.
Biography
Qazi Ghulam Mustafa (died ca 1123 AH / 1711 AD) was one of the prominent noble men during the Mughal empire.
Awards and honour
He was entitled 'Nawab Kar Talab Khan' meaning "the seeker of challenges" in Persian by Bahadur Shah I
Bahadur Shah I also named as Shah Alam in his first Juloos (Parade) on 24 Jumada al-awwal appointed him as 'Karoregiri' of the royal treasure with an award of Khalat
Bahadur Shah I in his second Juloos on 9 Dhu al-Qi'dah awarded him Mansab Do Hazari (2,000), zaat wa sowar. In the same year on 15 Dhu al-Qi'dah, the king awarded him the responsibility of 'Amanat'. He was also awarded 3,000 + 5,00 zaat wa sowar
Death
He died on 20 Muharram 1129 AH/1716 and buried in Ferozepur Jhirka. In another book, his date of death is mentioned as last days of dhul Hijjah 1122 AH / 1710 AD. However, an epitaph from Ferozepur Jhirka, places the death of Kartalab Khan Bahadur, son of Shaikh Muhammad Asaf in AH 1123 (AD 1711)
Family history
The family of Qazi Ghulam Mustafa came to India from Medina. His forefathers, Haji al Harmen Malik Hussain belonged to the family Ansar of Medina Munawwarah, was a prominent man and came to India with his son Bandagi Shaikh Khalil. They stayed in Delhi at Masjid Mahal. Both father and son were very distinguished scholars of many disciplines. Three sons were born to Bandagi Shaikh Khalil in Delhi. The elder son was Akhwand Mir, second was Mohammad Ammad and third youngest was Mohammad Zakaria. These three brothers were closely attached and 'Ba’it' by Qazi Shariah. These three brothers along with Qazi Shariah went to Mewat and settled there at Jhumrawat. In Jhumrawat near the mountain, they are buried near the grave of Qazi Shariah.
Family of Akhwand Mir and Mohammad Ammad
The grandson of Akhwand Mir was Abdus Samad ibn Mohammad Nizam. Abdus Samad had two sons; elder was Bandagi Makhdoom Tahir who along with his Uncle Abu Mohammad son of Mohammad Ammad was settled in Ferozepur Jhirka and made it a big estate (riyasat). The other son of Abdus Samad, Mohammad Zain was later on settled in Sakras (Haryana).
Dewan Shaikh Asaf and his father Dewan Maskeen raised both name and fame. They were chief revenue officers of a province Mewat and were entitled Dewan by Mughals. Dewan Maskeen was the son of Imamuddin ibn Sadr Jahan ibn Adul Malik ibn Abu Mohammad ibn Mohammad Ammad ibn Bandagi Shaikh Khalil. Dewan Shaikh Asaf (also Idris) was married to Bibi Rabiya, daughter of Noor Munawwar Narkhi (ibn Mohammad Talib Narkhi ibn Ainuddin ibn Moinuddin ibn Qazi Fatehullah).
Qazi Ghulam Mustafa and Ghulam Husain were two prominent sons of Dewan Shaikh Asaf and Bibi Rabiya. The son of Ghulam Husain, Ali Akbar was also entitled Khan, while the daughter, Sharfun Nisan was married to Syed Yusuf Ali Khan from 'Syed Sarai' of Rewari.
Family of Mohammad Zakaria
The son of Mohammad Zakaria was Pir Mohammad Najeeb was settled in Bahadurpur (Haryana). He was very famous religious sajjada. Shah Mohammad Hanif from Bahadurpur belonged to his descendant.
Marriage and children
Qazi Ghulam Mustafa was married to Bibi Rasti (died Dhu al-Qi'dah 1147 AH / 1734 AD) daughter of Qazi Syed Rafi Mohammad.
Khan Zaman Khan Ali Asghar was his son. Nawab Khan Zaman Khan Bahadur Ghalib Jung 'Ali Asghar' was Mansabdar Punj Hazari (5,000) Emir and was posted first Khidmat Daroghgi Topkhana, a store of Armory (military) at Multan; Faujdar at Moazamabad; Naib Subahdar at Azimabad (Patna); and then Subahdar at Awadh during the reign from Farrukhsiyar to Muhammad Shah. The fort at Ferozepur Jhirka was built by him. He died in Shahjahanbad (Delhi) on 4 Zil Haj 1155 AH/30 January 1743. Fatima, the daughter of Qazi Ghulam Mustafa, was married to Abul Fazal, son of Ataullah ibn Noor Munawwar Narkhi.
One of the daughters of Qazi Syed Rafi Mohammad was married to Qazi Ghulam Mustafa, and another daughter Sahib Daulat was married to Islam Khan V.
See also
Qazi Syed Rafi Mohammad
Ferozepur Jhirka
References
17th-century births
Year of birth unknown
1711 deaths
17th-century Indian people
18th-century Indian people
Hanafis
Indian Sunni Muslim scholars of Islam
People from Ferozepur Jhirka
Emirs
Mughal nobility
|
```javascript
CKEDITOR.plugins.setLang("forms","ko",{button:{title:" ",text:" ()",type:"",typeBtn:"",typeSbm:"",typeRst:""},checkboxAndRadio:{checkboxTitle:" ",radioTitle:" ",value:"",selected:"",required:" "},form:{title:" ",menu:" ",action:" (Action)",method:"(Method)",encoding:""},hidden:{title:" ",name:"",value:""},select:{title:" ",selectInfo:" ",opAvail:"",value:"",size:"",lines:"",chkMulti:" ",required:" ",opText:"",
opValue:"",btnAdd:"",btnModify:"",btnUp:"",btnDown:"",btnSetValue:" ",btnDelete:""},textarea:{title:" ",cols:" ",rows:" "},textfield:{title:" ",name:"",value:"",charWidth:" ",maxChars:" ",required:" ",type:"",typeText:"",typePass:"",typeEmail:"",typeSearch:"",typeTel:"",typeUrl:" (URL)"}});
```
|
For Today was an American Christian metalcore band from Sioux City, Iowa, formed in 2005. They released two EPs, Your Moment, Your Life, Your Time and Prevailer, and six full-length albums: Ekklesia in, 2008, Portraits in 2009, Breaker in 2010, Immortal in 2012, Fight the Silence in 2014, and Wake in 2015.
The band split up in 2016.
History
For Today was founded in 2005 by Ryan Leitru, Mike Reynolds, David Morrison, and Jon Lauters. Lauters and vocalist Matt Tyler, who joined the band shortly after its formation, (who later became known as Madison Skylights) left the band soon after, and were replaced by Mattie Montgomery (formerly of Besieged) and Brennan Schaeuble. Schaeuble was replaced by Ryan's brother Brandon. On April 1, 2008, they released their first studio album, produced by Facedown Records, Ekklesia (a Biblical term from the Koine Greek that typically denotes the collective people of God; it is usually translated as 'the Body of Christ' or 'the Church'). Their second album, Portraits, was released on June 9, 2009, on the same label, and peaked at No. 15 of the Billboard Christian albums chart. Different Biblical personalities are portrayed on the album: the Prophets Ezekiel, Joel, Elijah and Isaiah, and Nicodemus the Pharisee, Zacharias, Saul (Paul) of Tarsus and Immanuel (Jesus). The final track on the album, 'Talmidim' (which denotes the disciples of a rabbi, here referring to all disciples of Jesus -Christians) quotes Ezekiel 36:26-28 and describes what it means to be a Christian.
Upon signing with Razor & Tie, the band was in the recording studio on January 6, 2012 until February 8, 2012 at The Machine Shop in New Jersey. They also announced that Will Putney, who had produced their previous release Breaker, would produce this album. The album's first single, "Fearless", was released on March 6, 2012. They headlined the Fight the Silence Tour based on their new album in March 2012 and toured alongside A Skylit Drive, Stick to Your Guns, MyChildren MyBride, and Make Me Famous. The new album, Immortal, was released on May 29, 2012. They played at Warped Tour 2012.
On June 15, 2012, it was announced that drummer David Morrison had stepped down from For Today to do missionary work in South America with Extreme Nazarene Ministries. David Puckett (formerly of The Crimson Armada) was announced as the new drummer. Rhythm guitarist Mike Reynolds also left the band in early 2013, in order for him and his wife to enroll in Bible college and work toward full-time missions work in the Middle East. This announcement came after controversial comments that Reynolds made on Twitter in which he said "There was no such thing as a homosexual Christian." The backlash sparked by his comments prompted action by Mattie Montgomery, who posted a response on YouTube where he gave his phone number and offered his heart and time to anyone who wanted to talk about what had been said, pray, vent about religion, or just seek advice. Reynolds was replaced by former In the Midst of Lions guitarist Sam Penner.
On April 2, 2013, the band released a new EP, Prevailer, with four new songs, one acoustic track, and a DVD, of live band footage and a documentary of the band's history.
On October 24, 2013, the band released a new video, "Fight the Silence", on their official YouTube channel. According to the description of the video, the band will be releasing a new album in 2014.
They joined We Came as Romans, Texas in July, Woe, Is Me, and The Word Alive on the Motel 6 Rock Yourself to Sleep Tour from January to February 2011.
On April 15, 2015, Samuel Penner announced he parted ways with the band for various reasons. In the mid-2015, Jim Hughes, guitarist of metal band Colossus and long time friend of the band joined as bassist, with Brandon taking over guitars for Penner. On July 30, 2015, the band announced that they had signed with Nuclear Blast, and their new album would be released through the label. On August 21, 2015, the band initiated pre-orders for their new album, Wake, which was released on October 2, 2015, and a new music video titled "Broken Lens".
On July 5, 2016, the band announced via Facebook they will embark on a farewell tour and will disband after the tour ends. Before disbanding, two members of the band, Ryan (lead guitar) and Brandon Leitru (bass guitarist), formed a new band called Nothing Left, with members of Silent Planet and A Bullet for Pretty Boy. The band played their last show on December 18, 2016 with Silent Planet, Oh, Sleeper, Norma Jean and Fit for a King.
On October 22, 2018, Montgomery announced that the band would be playing on October 28, for a tribute show that We Came as Romans organized for Kyle Pavone, making it clear that this would not be a reunion.
Name
Montgomery stated the band selected the name while only one member was a Christian but that it "sounded cool" but have since transformed the meaning to be scriptural.
Members
Final line-up
Ryan Leitru – lead guitar, clean vocals (2005–2016)
Brandon Leitru – bass (2005–2015); rhythm guitar (2015–2016)
Mattie Montgomery – lead vocals (2007–2016)
David Puckett – drums (2012–2016)
Jim Hughes – bass, backing vocals (2015–2016)
Live
Ryan Kirby – vocals (2014, frontman of Fit for a King)
Former
Jon Lauters – bass (2005)
Brennan Schaeuble – bass (2005)
Matt Tyler – lead vocals (2007)
David Morrison – drums, vocals (2005–2012)
Mike Reynolds – rhythm guitar (2005–2013)
Sam Penner – rhythm guitar (2013–2015)
Timeline
Discography
Studio albums
EPs
Music videos
References
External links
American Christian metal musical groups
Metalcore musical groups from Iowa
American musical quintets
Musical groups established in 2005
Musical groups disestablished in 2016
Razor & Tie artists
Facedown Records artists
Nuclear Blast artists
Christian rock groups from Iowa
Christian metal musical groups
|
Aptynty is a village in the administrative district of Gmina Barciany, within Kętrzyn County, Warmian-Masurian Voivodeship, in northern Poland, close to the border with the Kaliningrad Oblast of Russia. It lies approximately north-west of Barciany, north of Kętrzyn, and north-east of the regional capital Olsztyn.
References
Aptynty
|
Ahsan Habib (2 January 1917 – 10 July 1985) was a Bangladeshi poet and literary figure in Bengali culture. He was born in the village of Shankarpasha, in Pirojpur. Before the India-Pakistan partition, he worked on several literary magazines: Takbir, Bulbul (1937–38) and The Saogat (1939-43) and he was a staff artiste at the Kolkata Centre of All India Radio. After partition he came to Dhaka and worked on Daily Azad, Monthly Mohammadi, Daily Krishak, Daily Ittehad, Weekly Prabaha, etc.
Early life
He was born in Pirojpur district. His father's name is Hamijuddin Hawladar and his mother's name is Jomila Khatun. He had been writing poem since his school life. While reading in Brojomohun College, he shifted to Kolkata for livelihood.
Literary works
Poems
His first book of poetry was Ratri Shesh. Others include:
Chhaya Horin (1962)
Shara Dupur (1964)
Ashay Boshoty (1974)
Megh Bole Choitrey Jabo (1976)
Duhate Dui Adim Pathar (1980)
For children
Josna Rater Golpo
Brsti Pare Tapur Tupur (1977)
Chutir Din Dupure (1978)
Novels
Ranee Khaler Shako (for teenagers)
Aronno Neelima
Zafrani Rong Payra
Awards
Ahsan Habib received several awards for his literary achievements, including:
UNESCO Literary Prize (1960–61)
Bangla Academy Literary Award (1961)
Adamjee Literary Award (1964)
Nasiruddin Gold Medal (1977)
Ekushey Padak (1978)
Jatiya (National) Padak
Abul Mansur Ahmed Memorial Prize (1980)
Abul Kalam Memorial Prize (1984)
References
20th-century Bangladeshi poets
20th-century Bengali poets
Bengali-language poets
Bengali-language writers
1917 births
1985 deaths
People from Barisal
University of Calcutta alumni
Recipients of the Ekushey Padak
Recipients of the Independence Day Award
Recipients of Bangla Academy Award
Bengali male poets
Bangladeshi male poets
20th-century Bangladeshi male writers
Recipients of the Adamjee Literary Award
Bengali Muslims
|
```shell
#!/usr/bin/env bash
# vim:ts=4:sts=4:sw=4:et
#
# Author: Hari Sekhon
# Date: 2020-08-13 19:38:39 +0100 (Thu, 13 Aug 2020)
#
# path_to_url
#
#
# If you're using my code you're welcome to connect with me on LinkedIn and optionally send me feedback to help steer this or other code I publish
#
# path_to_url
#
set -euo pipefail
[ -n "${DEBUG:-}" ] && set -x
srcdir="$(cd "$(dirname "${BASH_SOURCE[0]}")" && pwd)"
# shellcheck disable=SC1090,SC1091
. "$srcdir/lib/utils.sh"
# shellcheck disable=SC1090,SC1091
. "$srcdir/lib/gcp.sh"
# shellcheck disable=SC2034,SC2154
usage_description="
Lists GCP storage resources deployed in the current GCP Project
Lists in this order:
- Cloud SQL instances
- Cloud SQL backups enabled
- Cloud Storage Buckets
- Cloud Filestore
- Cloud Memorystore Redis
- BigTable clusters and instances
- Datastore Indexes
Can optionally specify a project id using the first argument, otherwise uses currently configured project
$gcp_info_formatting_help
"
# used by usage() in lib/utils.sh
# shellcheck disable=SC2034
usage_args="[<project_id>]"
help_usage "$@"
check_bin gcloud
if [ $# -gt 0 ]; then
project_id="$1"
shift || :
export CLOUDSDK_CORE_PROJECT="$project_id"
fi
# shellcheck disable=SC1090,SC1091
type is_service_enabled &>/dev/null || . "$srcdir/gcp_service_apis.sh" >/dev/null
"$srcdir/gcp_info_cloud_sql.sh"
# Cloud Storage Buckets
cat <<EOF
# ============================================================================ #
# B u c k e t s
# ============================================================================ #
EOF
if is_service_enabled storage-component.googleapis.com; then
gsutil ls
else
echo "Cloud Storage API (storage-component.googleapis.com) is not enabled, skipping..."
fi
# Cloud Filestore
cat <<EOF
# ============================================================================ #
# C l o u d F i l e s t o r e
# ============================================================================ #
EOF
if is_service_enabled file.googleapis.com; then
gcp_info "Cloud Filestore instances" gcloud filestore instances list
else
echo "Cloud Filestore API (file.googleapis.com) is not enabled, skipping..."
fi
# Cloud MemoryStore Redis
cat <<EOF
# ============================================================================ #
# C l o u d M e m o r y s t o r e R e d i s
# ============================================================================ #
EOF
if is_service_enabled redis.googleapis.com; then
gcp_info "Cloud Memorystore Redis instances" gcloud redis instances list --region all
else
echo "Cloud Memorystore Redis API (redis.googleapis.com) is not enabled, skipping..."
fi
# BigTable clusters and instances
cat <<EOF
# ============================================================================ #
# B i g T a b l e
# ============================================================================ #
EOF
# works even with these disabled:
#
# DISABLED bigtable.googleapis.com Cloud Bigtable API
# DISABLED bigtableadmin.googleapis.com Cloud Bigtable Admin API
# DISABLED bigtabletableadmin.googleapis.com Cloud Bigtable Table Admin API
#
# if is_service_enabled bigtable.googleapis.com; then
gcp_info "BigTable clusters" gcloud bigtable clusters list
gcp_info "BigTable instances" gcloud bigtable instances list
#else
# echo "BigTable API (bigtable.googleapis.com) is not enabled, skipping..."
#fi
# Datastore Indexes
cat <<EOF
# ============================================================================ #
# D a t a s t o r e I n d e x e s
# ============================================================================ #
EOF
if is_service_enabled datastore.googleapis.com; then
# may error out if doesn't exist
gcp_info "Cloud Datastore indexes" gcloud datastore indexes list || :
else
echo "Datastore API datastore.googleapis.com) is not enabled, skipping..."
fi
```
|
Songxi County () is a county under the administration of the prefecture-level city of Nanping, in the northwest of Fujian province, People's Republic of China, bordering Zhejiang province to the east. Its county seat is located at Songyuan Subdistrict.
Administration
1 Subdistrict
Songyuan ()
2 Towns
Zhengdun ()
Weitian ()
6 Townships
Hedong ()
Jiuxian ()
Xidong ()
Huaqiao ()
Zudun ()
Chaping ()
Climate
Transportation
Expressway
G25 Changchun-Shenzhen Expressway
Rail
The area is served by Songxi railway station.
Specialty
Xiaojiao ()
References
External links
Official website of Songxi County Government
County-level divisions of Fujian
Nanping
|
Eudonia platyscia is a moth of the family Crambidae. It is endemic to the Hawaiian islands of Kauai, Molokai and Hawaii.
References
Eudonia
Endemic moths of Hawaii
Moths described in 1899
|
```objective-c
class CContainerDlg : public CDialog
{
DECLARE_DYNAMIC(CContainerDlg)
public:
CContainerDlg(CWnd* pParent = NULL); // standard constructor
virtual ~CContainerDlg();
virtual void OnFinalRelease();
// Dialog Data
enum { IDD = IDD_CONTAINER_DIALOG };
protected:
virtual void DoDataExchange(CDataExchange* pDX); // DDX/DDV support
DECLARE_MESSAGE_MAP()
DECLARE_DISPATCH_MAP()
DECLARE_INTERFACE_MAP()
public:
CCirc m_circctl;
```
|
```java
package com.bleplx;
import androidx.annotation.NonNull;
import com.facebook.react.ReactPackage;
import com.facebook.react.bridge.NativeModule;
import com.facebook.react.bridge.ReactApplicationContext;
import com.facebook.react.uimanager.ViewManager;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class BlePlxPackage implements ReactPackage {
@NonNull
@Override
public List<NativeModule> createNativeModules(@NonNull ReactApplicationContext reactContext) {
List<NativeModule> modules = new ArrayList<>();
modules.add(new BlePlxModule(reactContext));
return modules;
}
@NonNull
@Override
public List<ViewManager> createViewManagers(@NonNull ReactApplicationContext reactContext) {
return Collections.emptyList();
}
}
```
|
CloudEndure is a cloud computing company that develops business continuity software for disaster recovery, continuous backup, and live migration. CloudEndure is headquartered in the United States with R&D in Israel.
History
CloudEndure was founded in 2012 by Ofer Gadish (CEO), Gil Shai (CRO), Ofir Ehrlich (VP R&D), and Leonid Feinberg (VP Product). The same founders previously established AcceloWeb, which was acquired by Limelight Networks in 2011.
CloudEndure has raised a total of $18.2 million from private investors and companies such as Dell EMC, VMware, Mitsui, Infosys, and Magma Venture Partners.
Awards for CloudEndure include the 2017 CRN Emerging Vendors Award for Storage Startups and the 2016 Gartner Cool Vendor Award.
CloudEndure products have been integrated as OEM software for several partner company services, including an integration into Google Cloud VM Migration Service and integrations with Cisco Systems CloudCenter Disaster Recovery and Migration and Sungard Availability Services Cloud Recovery.
Amazon made an offer to purchase CloudEndure in January 2019. Between $200 and $250 million was the negotiated price. They outbid Google and acquired the company on January 10, 2019.
Products
CloudEndure Disaster Recovery performs continuous block-level replication and saves a dormant copy in the target infrastructure, which uses a smaller percentage of compute, storage, and memory than the primary site; this leads to minimal RTOs (recovery time objective) and RPOs (recovery point objective) when spun up in a disaster.
The company offers two tiers of Disaster Recovery, as well as Continuous Backup and Live Migration products.
CloudEndure's Software as a Service (SaaS) are application-agnostic and can replicate workloads from physical, virtual, and cloud-based infrastructure to a variety of target sites, including Amazon Web Services (AWS), Google Cloud Platform (GCP), Microsoft Azure, and VMware.
Patents and licensing
CloudEndure Ltd. holds (or has pending) seven US patents including:
- System and method for maintaining a copy of a cloud-based computing environment and restoration.
- System and method for asynchronous replication of a storage in a computing environment.
- System and method for name resolution of replicated components in computing environments.
- System and method for orchestrating replicated components in a replicated cloud-based computing environment.
- System and method for restoring original machines from replicated machines in a secondary computing environment.
- Synchronization of an order of access instructions from a primary computing environment to a replicated computing environment.
- System and method for disk identification in a cloud-based computing environment.
See also
Disaster recovery
Disaster recovery plan (DRP)
Business continuity
Recovery time objective (RTO)
Recovery point objective (RPO)
Continuous data protection
References
Amazon (company) acquisitions
Disaster recovery
Cloud computing providers
Software companies based in New York City
Software companies established in 2012
Software companies of Israel
Defunct software companies of the United States
VMware
2019 mergers and acquisitions
|
Blue Pool is a flooded, disused clay pit where Purbeck ball clay was once extracted. It is now a lake within the Furzebrook Estate, a park of heath woodland and gorse near Furzebrook on the Isle of Purbeck, in the county of Dorset, southern England.
Furzebrook Estate is about south of Wareham and west of Corfe Castle.
The pool started life early in the 17th century as a chalk pit. Purbeck ball clay was dug from the pit from the mid-17th century to the early 20th century. The ball clay was used to make fine ceramic products, such as smoking pipes, plates, cups and tea pots. The pit became disused before the First World War, but ball clay is still extracted from other pits in the area.
The title 'blue' arose because there are minute particles of clay in colloidal suspension within the water. These suspensions variously diffract the light depending on the particles' size (with differences in size often linked to changes in concentration and pH), yielding colours from red-brown, through grey and green, to the more typical turquoise. The metallic blue sometimes found in photographs is more likely to be a reflection of the sky, as the attraction's own website makes no such claim for the water, and their leaflets call it “a turquoise jewel set in the heart of Purbeck”.
In 1935 a café was opened at the site. There is also a museum and gift shop. In 1985 the estate was declared a Site of Special Scientific Interest. Now law protects the habitat of a variety of rare plants and animals. The site includes nature reserves managed by the Amphibian and Reptile Conservation and a private nature reserve.
Blue Pool is now a popular tourist attraction, especially because it is a place of peace and tranquillity. The pool is surrounded by of heathland. The nationally rare Dorset heath and marsh gentian are common to the area. The estate is crossed by a network of sandy paths. There are steps down to the edge of the pool and there are also steps on some paths around the pool, but there is also a completely flat route around the pool, which is suitable for wheelchairs.
The lush vegetation around the pool is inhabited by grey squirrels, rabbits and badgers. The Estate supports numerous rare birds, amphibians and reptiles. Visitors may therefore be lucky enough to spot the Dartford warbler or the nightjar. Both of Britain's endangered and protected reptiles, the green sand lizard and the smooth snake, live here in considerable numbers. There are also many dragonflies and the rare Sika deer.
References
External links
Isle of Purbeck
Geology of Dorset
Tourist attractions in Dorset
Sites of Special Scientific Interest in Dorset
Chalk pits
|
```yaml
filetype: markdown
detect:
filename: "\\.(livemd|md|mkd|mkdn|markdown)$"
rules:
# Tables (Github extension)
- type: ".*[ :]\\|[ :].*"
# quotes
- statement: "^>.*"
# Emphasis
- type: "(^|[[:space:]])(_[^ ][^_]*_|\\*[^ ][^*]*\\*)"
# Strong emphasis
- type: "(^|[[:space:]])(__[^ ][^_]*__|\\*\\*[^ ][^*]*\\*\\*)"
# strike-through
- type: "(^|[[:space:]])~~[^ ][^~]*~~"
# horizontal rules
- special: "^(---+|===+|___+|\\*\\*\\*+)\\s*$"
# headlines
- special: "^#{1,6}.*"
# lists
- identifier: "^[[:space:]]*[\\*+-] |^[[:space:]]*[0-9]+\\. "
# misc
- preproc: "(\\(([CcRr]|[Tt][Mm])\\)|\\.{3}|(^|[[:space:]])\\-\\-($|[[:space:]]))"
# links
- constant: "\\[[^]]+\\]"
- constant: "\\[([^][]|\\[[^]]*\\])*\\]\\([^)]+\\)"
# images
- underlined: "!\\[[^][]*\\](\\([^)]+\\)|\\[[^]]+\\])"
# urls
- underlined: "https?://[^ )>]+"
- special: "^```$"
- special:
start: "`"
end: "`"
rules: []
```
|
Janja Čanjevac (born 14 November 2000) is a Croatian footballer who plays as a defender for Hajduk and the Croatia women's national team.
International career
Čanjevac made her senior debut for Croatia on 27 July 2017. She also played for the team during the UEFA Women's Euro 2022 qualifying.
References
External links
2000 births
Living people
Croatian women's footballers
Women's association football defenders
ŽNK Dinamo Zagreb players
ŽNK Split players
ŽNK Mura players
Croatia women's international footballers
Croatian expatriate women's footballers
Croatian expatriate sportspeople in Slovenia
Expatriate women's footballers in Slovenia
|
```python
"""Utilities related to Keras unit tests."""
import numpy as np
from numpy.testing import assert_allclose
import six
from .generic_utils import has_arg
from ..engine import Model, Input
from ..models import Sequential
from ..models import model_from_json
from .. import backend as K
def get_test_data(num_train=1000, num_test=500, input_shape=(10,),
output_shape=(2,),
classification=True, num_classes=2):
"""Generates test data to train a model on.
classification=True overrides output_shape
(i.e. output_shape is set to (1,)) and the output
consists in integers in [0, num_class-1].
Otherwise: float output with shape output_shape.
"""
samples = num_train + num_test
if classification:
y = np.random.randint(0, num_classes, size=(samples,))
X = np.zeros((samples,) + input_shape)
for i in range(samples):
X[i] = np.random.normal(loc=y[i], scale=0.7, size=input_shape)
else:
y_loc = np.random.random((samples,))
X = np.zeros((samples,) + input_shape)
y = np.zeros((samples,) + output_shape)
for i in range(samples):
X[i] = np.random.normal(loc=y_loc[i], scale=0.7, size=input_shape)
y[i] = np.random.normal(loc=y_loc[i], scale=0.7, size=output_shape)
return (X[:num_train], y[:num_train]), (X[num_train:], y[num_train:])
def layer_test(layer_cls, kwargs={}, input_shape=None, input_dtype=None,
input_data=None, expected_output=None,
expected_output_dtype=None, fixed_batch_size=False):
"""Test routine for a layer with a single input tensor
and single output tensor.
"""
# generate input data
if input_data is None:
assert input_shape
if not input_dtype:
input_dtype = K.floatx()
input_data_shape = list(input_shape)
for i, e in enumerate(input_data_shape):
if e is None:
input_data_shape[i] = np.random.randint(1, 4)
input_data = (10 * np.random.random(input_data_shape))
input_data = input_data.astype(input_dtype)
else:
if input_shape is None:
input_shape = input_data.shape
if input_dtype is None:
input_dtype = input_data.dtype
if expected_output_dtype is None:
expected_output_dtype = input_dtype
# instantiation
layer = layer_cls(**kwargs)
# test get_weights , set_weights at layer level
weights = layer.get_weights()
layer.set_weights(weights)
# test and instantiation from weights
# Checking for empty weights array to avoid a problem where some
# legacy layers return bad values from get_weights()
if has_arg(layer_cls.__init__, 'weights') and len(weights):
kwargs['weights'] = weights
layer = layer_cls(**kwargs)
# test in functional API
if fixed_batch_size:
x = Input(batch_shape=input_shape, dtype=input_dtype)
else:
x = Input(shape=input_shape[1:], dtype=input_dtype)
y = layer(x)
assert K.dtype(y) == expected_output_dtype
# check shape inference
model = Model(x, y)
expected_output_shape = layer.compute_output_shape(input_shape)
actual_output = model.predict(input_data)
actual_output_shape = actual_output.shape
for expected_dim, actual_dim in zip(expected_output_shape,
actual_output_shape):
if expected_dim is not None:
assert expected_dim == actual_dim
if expected_output is not None:
assert_allclose(actual_output, expected_output, rtol=1e-3)
# test serialization, weight setting at model level
model_config = model.get_config()
recovered_model = Model.from_config(model_config)
if model.weights:
weights = model.get_weights()
recovered_model.set_weights(weights)
_output = recovered_model.predict(input_data)
assert_allclose(_output, actual_output, rtol=1e-3)
# test training mode (e.g. useful for dropout tests)
model.compile('rmsprop', 'mse')
model.train_on_batch(input_data, actual_output)
# test as first layer in Sequential API
layer_config = layer.get_config()
layer_config['batch_input_shape'] = input_shape
layer = layer.__class__.from_config(layer_config)
model = Sequential()
model.add(layer)
actual_output = model.predict(input_data)
actual_output_shape = actual_output.shape
for expected_dim, actual_dim in zip(expected_output_shape,
actual_output_shape):
if expected_dim is not None:
assert expected_dim == actual_dim
if expected_output is not None:
assert_allclose(actual_output, expected_output, rtol=1e-3)
# test serialization, weight setting at model level
model_config = model.get_config()
recovered_model = Sequential.from_config(model_config)
if model.weights:
weights = model.get_weights()
recovered_model.set_weights(weights)
_output = recovered_model.predict(input_data)
assert_allclose(_output, actual_output, rtol=1e-3)
# test training mode (e.g. useful for dropout tests)
model.compile('rmsprop', 'mse')
model.train_on_batch(input_data, actual_output)
# for further checks in the caller function
return actual_output
def keras_test(func):
"""Function wrapper to clean up after TensorFlow tests.
# Arguments
func: test function to clean up after.
# Returns
A function wrapping the input function.
"""
@six.wraps(func)
def wrapper(*args, **kwargs):
output = func(*args, **kwargs)
if K.backend() == 'tensorflow':
K.clear_session()
return output
return wrapper
```
|
Hulta is a settlement in Sävsjö Municipality, Jönköping County, Sweden.
References
Populated places in Jönköping County
|
Prawn is an American indie rock band from Ridgewood, New Jersey.
History
Prawn was formed in 2007. In 2011, Prawn self-released their first full-length album, You Can Just Leave It All, in 2011. The band followed up this release with their first EP titled Ships. In 2014, Prawn released their second full-length album, Kingfisher, in 2014. Later in 2014, Prawn's label Topshelf Records, alongside Count Your Lucky Stars Records, released a four way split with Prawn, Kittyhawk, Frameworks, and Droughts. In 2015, Prawn released a split with Moving Mountains. Prawn's latest album, Run, was released in 2017.
Band members
Tony Clark - vocals/guitar
Jamie Houghton - drums
Kyle Burns - guitar/vocals
Ryan McKenna - bass guitar/guitar/vocals
Scott Carr - bass guitar/vocals
Corey Davis - bass guitar
Discography
Studio albums
You Can Just Leave It All (2012)
Kingfisher (2014)
Run (2017)
EPs
Ships (2012)
Settled (2014)
Splits
Droughts, Frameworks, Kittyhawk, Prawn (2014)
Joie De Vivre / Prawn
Moving Mountains / Prawn - Split (2015)
References
Musical groups from New Jersey
Musical groups established in 2008
Topshelf Records artists
Count Your Lucky Stars Records artists
|
Mario Taddei (born September 28, 1972) is an Italian academic. He is an expert in multimedia and edutainment for museums, a Leonardo da Vinci devotee and scholar, and an expert in the codexes and machines of da Vinci and ancient books of technology.
Biography
Born in Bologna, Italy, Taddei graduated in Industrial Design, Politecnico di Milano. He has headed many projects about innovative installations for museums. He has been studying da Vinci for years and has authored new discoveries.
In 2008, he studied for the first time in depth The Book of Secrets (Kitab al-Asrar) by the 1000 CE Arabic engineer and scientist Ibn Khalaf al-Muradi. The complete and unique study of all The Book of Secrets, all his machines and the pages are shown in the Museum of Islamic Art in Doha.
In 2013 was co-founder of Leonardo3 Museum in Milan Italy.
In 2013 During the event for the 150th anniversary of the Milan Polytechnic he received the CULTURE award with the following motivation: “Minds Shaping the World welcomes Mario Taddei among its members for the scientific rigor and the extraordinary diffusion capacity that allowed him to make unprecedented discoveries to Leonardo da Vinci and spread them all over the world. Mario Taddei is considered today one of the greatest international experts of the genius of Vinci: his exhibitions and installations have been over the years presented with great success both in Italy and abroad (Germany, USA, Canada, Mexico, Brazil, Qatar, Japan)."
In 2023 he received The "Leonardo Da Vinci 2023 Honorary Award" in San Francisco.
Professor of Design, Architecture, Virtual scenography & Virtual reality, ACME Academy of Fine Arts and Media Leonardo da Vinci (Milan) and Pantheon institute (Milan)
Prizes, awards, reviews
2005 eScience Category Award - World summit on information tecnology Geneva 2003 – Tunis 2005
2005 Telecom Award "Contagiare Bellezza," Italy
2010 ARCA International Award, Italy
2013 CULTURE Prize from Polytechnic of Milan (150years aminversary) Alumnipolim awards 2013.
2019 Best Exhibition Event (Gold) -Best Cultural Event (Silver) (Hong Kong)
2020 Professions of the future: virtual architects and set designers(Politecnic of Milan)
2023 The Leonardo Da Vinci 2023 Honorary Award, San Francisco, USA
Work
The robot of Leonardo
Among the vast number of projects of Leonardo, there is a “mechanical knight” that has entered into the common imagination. In 1957 Carlo Pedretti was the first person to discover it, hidden amongst da Vinci’s countless designs. The mechanical knight was again mentioned in 1974, in the Codex Madrid edited by Ladislao Reti. Nevertheless, there was no attempt to reconstruct it until 1996. It was then that Mark Rosheim published an independent study of the robot, followed by a joint enterprise with the Florence Institute and Museum of the History of Science which mounted an exhibition with an entire section dedicated to Rosheim’s research on the subject. However, it was only in 2002 that Rosheim built a complete physical model for a BBC documentary. Since then, many exhibitions and museums of da Vinci’s models have included a soldier on wheels labeled, “Leonardo’s robot”.
Studies on the subject mention that manuscripts relating to Leonardo’s idea for the robot are in the Codex Atlanticus, specifically folio 579r. Mario Taddei's further research has indicated folios 1077r, 1021r and 1021v as possible sources for the mechanisms of this mysterious humanoid robot.
In the 2007 Mario Taddei made a new research on the original documents of Leonardo finding new pieces of information to build a new model of the soldier robot, correctly related to the drawings of Leonardo. This robot was designed just for defensive purpose, not for war or theater and his movement are related to the arms that move right and left with a rope.
The Model is shown in exhibition around the world and the work of research is published in the "Leonardo da Vinci's robots" book.
Books
Taddei Mario, Edoardo Zanon: "Creare videogiochi ". Ed. Jackson Libri 2002. 300 p.
Taddei, E. Zanon, Bernardoni: "Leonardo, Water and the Renaissance ". Ed. Federico Motta 2004. 120 pp.
Taddei, E. Zanon, Laurenza: "Leonardo's Machines. Secrets and Inventions in the Da Vinci Codices ". Ed. Giunti Editore 2005. 240 pp.
Taddei, E. Zanon, Laurenza: "Leonardo's Machines: Da Vinci's Inventions Revealed ". David & Charles PLC 2006. 240 pp.
Taddei, E. Zanon, Lisa: "Leonardo da Vinci's Codex Atlanticus". Ed. Leonardo3 2005. 144 p.
Taddei, E. Zanon, Pinotti: "Rappresentazioni Grafiche". Ed. Atlas 2005. 336 p.
Taddei, E. Zanon, Bernardoni: "Leonardo bridges". Ed. Leonardo3 2005. 144 p.
Taddei, E. Zanon, Lisa: "Leonardo's workshop". Ed. Leonardo3 2006. 160 p.
Taddei Mario: "Las maquinas de Leonardo". Ed. Leonardo3 2006. 160 p.
Taddei Mario: "Машины Леонардо да Винчи. Тайны и изобретения в рукописях ученого". Ed. Ниола-Пресс 200t.
Taddei, E. Zanon, Lisa: "The Book of Secrets (Kitab al-Asrar)". Ed. Leonardo3 2007. 420 p.
Taddei Mario: "Da Vinci 's Robots. Self-propelling cart". Ed. Leonardo3 2008. 480 p.+16 p. )
Taddei Mario: "Da Vinci 's Robots. New mechanics and new automata found in codices". Ed. Leonardo3 2008. 480 p.
Taddei Mario: "Atlas ilustrado de las máquinas de Leonardo secretos e invenciones en los Códices da Vinci". Ed. Susaeta 2009. 480 p.
Taddei Mario: "Illustrated Atlas of Leonardo’s Robots La mecanica y los nuevos automatia encontrados en los codices ". Ed. Susaeta 2009. 480 p.
Taddei Mario "The Last Supper. Secrets, techniques and errors of a masterpiece as never seen before". Ed. Leonardo3 2007. 420 p.
Taddei Mario "圖解達文西機器人". Ed. 出版日期 2010. 300p.
Taddei Mario "Secret Note of Leonardo da Vinci – 다빈치의 비밀노트". Ed. UNJUNSA 2017. 300 p.
Taddei Mario, Paolo Mosca: "LEONARDO DA VINCI È MORTO! Come fare soldi con l’ARTE DIGITALE e gli NFT". Ed. Amazon 2021. 204 p.
Taddei Mario, Paolo Mosca: "LEONARDO DA VINCI IS DEAD - How to make money with DIGITAL ART and NFT". Ed. Amazon 2021. 188 p.
Taddei Mario, "LEONARDO DA VINCI & LA REALTA’ VIRTUALE DALLA GIOCONDA AL METAVERSO". Ed. Amazon 2021. 190 p.
Taddei Mario, "LEONARDO DA VINCI & VIRTUAL REALITY - FROM MONA LISA TO THE METAVERSE". Ed. Amazon 2021. 190 p.
Taddei Mario, "I ROBOT E L'ANDROIDE DI LEONARDO DA VINCI". Ed. Amazon 2021. 170 p.
Taddei Mario, "THE ROBOTS AND ANDROID OF LEONARDO DA VINCI". Ed. Amazon 2021. 170 p.
References
External links
Mario Taddei at IMDb
Lectio Magistralis - Mario Taddei - Leonardo Da Vinci and Water in the Ideal City.
Leonardo's car discover
Professions of the future
Da Vinci 500, diálogo con el genio inmortal
Le lion mécanique de Leonard de Vinci exposé à Paris
Conferenza: Leonardo 500 anni dopo, i segreti dell’Ultima Cena
Conference: Leonardo and the Flying Machine
Korean Documentary - Leonardo Da Vinci
Leonardo da Vinci. Reconstruction of the Battle of Anghiari - Salone dei Cinquecento Florence
Leonardo da Vinci's Robot Android - 2021 - Vicenza Palazzo Chiericati
Living people
1972 births
Academic staff of the Polytechnic University of Milan
|
Turów is a village in the administrative district of Gmina Żórawina, within Wrocław County, Lower Silesian Voivodeship, in south-western Poland. It lies approximately north-east of Żórawina and south of the regional capital Wrocław.
The name of the village is of Polish origin and comes from the word tur, which means "aurochs".
References
Turow
|
Fun School is a series of educational packages developed and published in the United Kingdom by Europress Software, initially as Database Educational Software. The original Fun School titles were sold mostly by mail order via off-the-page adverts in the magazines owned by Database Publications. A decision was made to create a new set of programs, call the range Fun School 2, and package them more professionally so they could be sold in computer stores around the UK. Every game comes as a set of three versions, each version set to cater for a specific age range.
Fun School 1
Fun School 1 is the first set of educational games, created in 1984 by Database Educational Software for the Acorn Electron and BBC Micro computers. The three individual games catered for children aged under 6 years, between 6 and 8 years and over 8 years respectively. They also include five children's nursery rhymes. The products were tested in classrooms and were educationally approved.
Fun School 2
Fun School 2 is the second set of educational games, created in 1989 by Database Educational Software. It was released on more computers than its predecessor including Acorn Electron, BBC Micro, ZX Spectrum, Commodore 64, Amstrad CPC, Atari ST, Amiga, MS-DOS and RISC OS. The three individual games catered for children aged under 6 years, between 6 and 8 years and over 8 years respectively.
The Fun School 2 games were programmed using the STOS (derived from BASIC) programming language with the STOS Compiler Engine.
Fun School 2 was reviewed as "The number one choice for our school" by Shelley Gibson. Fun School 2 was rated 3rd place in the "Gallup full-price software chart". Commodore Force rated Fun School 2 for Under 6 Years as #43, Fun School 2 Ages 6–8 as #36 and Fun School 2 Over 8 Years as number 10 in rankings of the top 100 Commodore 64 games of 1993. Despite its popularity among children, Fun School 2 was criticised by left-wing educationalists due to a competition element and the matter was brought to British MP Kenneth Baker.
Fun School 3
Fun School 3 is the third set of educational games, created in 1990 by Database Educational Software released for the ZX Spectrum, BBC Micro, Commodore 64, Amstrad CPC, Amstrad PCW, Atari ST, Amiga, Amiga CD32, MS-DOS and RISC OS computers. The three individual games catered for children aged under 5 years, between 5 and 7 years and over 7 years respectively. The games and their age ranges took in to full account of the new National Curriculum and the school syllabus content at the time.
The Fun School 3 games were developed using the STOS (derived from BASIC) programming language with the STOS Compiler Engine. For the Amiga version it was converted to AMOS using the AMOS Compiler by William Cochrane and Peter Hickman.
The Amiga version was hosted on the "Commodore 1990 Christmas" talk show along with AMOS 3D. The Amstrad PCW version won the European Computer Leisure Award as "Best Home Education Package" and also got the 8000 Plus Seal of Approval.
Fun School 4
Fun School 4 is the fourth set of educational games, created in 1992 by Europress Software (formerly called Database Educational Software) and released on the ZX Spectrum, Amstrad CPC, Commodore 64, Atari ST, Amiga, MS-DOS and RISC OS computers. The three individual games catered for children aged under 5 years, between 5 and 7 years and between 7 and 11 years respectively. The content of the games matched the educational material taught in schools of England and Wales in accordance with the National Curriculum. During the planning stages, an education competition was held by ST Format, in which the best entries were incorporated in the game.
The Amiga version of the Fun School 4 games were mostly created with the AMOS code using the AMOS Compiler engine. TimeTable and Exchange Rates were written in asembler, this was primarily due to the complex nature of these two games and wanting to keep the performance up to an acceptable level.
Fun School Specials
Fun School Specials is a set of educational games, created in 1993 by Europress Software, consisting of four different games. Upon demand, Europress designed each game specifically with a certain major topic to add depth to spelling, maths, creativity and science, respectively and comply fully with the National Curriculum.
Paint and Create
Paint and Create was released on Commodore 64, Amiga and MS-DOS computers and has an easy interface divided into six activities aimed at younger audiences to do their own artwork.
Paint and Create got good review scores including 91% from Commodore Format and 94% from the CU Amiga magazine. It also got awarded the Screenstar from Amiga Reviews.
Spelling Fair
Spelling Fair was released on Commodore 64, Amiga and MS-DOS computers.
Merlin's Maths
Merlin's Maths was released on Amiga and MS-DOS computers.
Merlin's Maths teaches mathematics on the topics of counting, decimals, fractions and volumes within six activities.
Young Scientist
Young Scientist was created in 1995 and released on CD for Windows and Macintosh to teach science in depth. The game stars the main character Ozzie S. Otter and has up to forty scientific experiments to try out.
Fun School 5
Fun School 5 is the fifth set of educational games, released in 1995 by Europress Software on Windows. The games were originally planned to be released in 1993 with the age ranges 'Under 5s', '5s to 7s' and '7s to 11s'. However, there was a delay due to the development of the subject-specific Fun School Specials. The games were written using DOS 4GW and early versions had problems with some video drivers, forcing Europress to recall an entire stock before revising new versions. The three individual games catered for children aged between 4 and 7 years, between 6 and 9 years and between 8 and 11 years respectively and had their own specific themes with a goal to complete the game. The games introduced two children, Suki and Rik, and their pet purple dinosaur, Gloopy. The player has to assist Gloopy and the children in solving a number of challenges.
Fun School 6
Fun School 6 is the sixth set of educational games, created in 1996 by Europress Software released on Windows. The three individual games catered for children aged between 4 and 7 years, between 6 and 9 years and between 8 and 11 years respectively and had their own specific themes but each of the five topics remained in the same category with certain variations related to the age level. The games star Gloopy from Fun School 5, this time a pink dinosaur.
Fun School 7
Fun School 7 is the seventh and final set of educational games, created in 1998 by CBL Technology and released on Windows. The three individual games catered for children aged between 4 and 7 years, between 6 and 9 years and between 8 and 11 years respectively. The game makes use of 3D graphics.
Commercial performance
Before 1989, the educational market was dwindling and the release of "Fun School 2" was an outstanding success. The games sold over 60,000 copies by February and by this time a German Amiga package was developed. By April the games sold over 100,000 copies. During August in 1990, over 150,000 copies had been sold (including 30,000 Amstrad CPC copies). During the development of "Fun School 3" by December, 250,000 copies of the games had been sold.
Before the BBC Micro and PC versions were released "Fun School 3" had already sold 45,000 copies of other formats. By the time "Fun School 4" was in development, Europress had sold 300,000 copies of its Fun School products and 400,000 copies by April.
By 1992, over 500,000 copies of the Fun School Range products were sold. By 1993, over 650,000 Fun School packages had been sold. When Fun School 5 was released, over 800,000 Fun School Packages were sold and becoming an International Bestseller. During the release of "Fun School 6", around 1,500,000 copies of the Fun School Range were sold. When "Fun School 7" was released, 2 million copies of the Fun School Range were sold.
References
External links
History of Fun School, Fun School 2 and Fun School 3
Children's educational video games
United Kingdom-exclusive video games
Video game franchises
Video games developed in the United Kingdom
Video game franchises introduced in 1986
Acorn Archimedes games
Amiga games
Amstrad CPC games
Amstrad PCW games
Atari ST games
BBC Micro and Acorn Electron games
Amiga CD32 games
Commodore 64 games
DOS games
Windows games
ZX Spectrum games
|
Thomastown Township is a township in Wadena County, Minnesota, United States. The population was 714 at the 2000 census.
Thomastown Township was named for Thomas Scott, an early settler.
Geography
According to the United States Census Bureau, the township has a total area of 42.0 square miles (108.7 km); 41.0 square miles (106.1 km) of it is land and 1.0 square miles (2.6 km) of it (2.41%) is water.
The Crow Wing River is joined by its tributaries the Leaf and Partridge Rivers in the township. One property within the township, the Old Wadena Historic District, is listed on the National Register of Historic Places.
Demographics
As of the census of 2000, there were 714 people, 251 households, and 211 families residing in the township. The population density was 17.4 people per square mile (6.7/km). There were 311 housing units at an average density of 7.6/sq mi (2.9/km). The racial makeup of the township was 98.60% White, 0.14% Native American, 0.28% Asian, 0.28% from other races, and 0.70% from two or more races. Hispanic or Latino of any race were 0.98% of the population.
There were 251 households, out of which 34.3% had children under the age of 18 living with them, 78.5% were married couples living together, 0.8% had a female householder with no husband present, and 15.9% were non-families. 13.1% of all households were made up of individuals, and 6.4% had someone living alone who was 65 years of age or older. The average household size was 2.84 and the average family size was 3.08.
In the township the population was spread out, with 28.2% under the age of 18, 6.4% from 18 to 24, 24.8% from 25 to 44, 29.0% from 45 to 64, and 11.6% who were 65 years of age or older. The median age was 40 years. For every 100 females, there were 101.7 males. For every 100 females age 18 and over, there were 106.0 males.
The median income for a household in the township was $48,000, and the median income for a family was $50,417. Males had a median income of $31,944 versus $20,804 for females. The per capita income for the township was $20,017. About 7.1% of families and 9.5% of the population were below the poverty line, including 11.3% of those under age 18 and 6.9% of those age 65 or over.
References
Townships in Wadena County, Minnesota
Townships in Minnesota
|
```javascript
const rt = process.cwd();
const {version, name} = require(rt+'/package.json');
const shell = require('child_process').execSync;
const cmds ={
browserify:(suffix =>`node ${rt}/node_modules/browserify/bin/cmd ${rt}/cdn/window.js -o ${rt}/cdn/${name}-${suffix}.js`) ,
minify : (suffix => `node ${rt}/node_modules/uglify-js/bin/uglifyjs ${rt}/cdn/${name}-${suffix}.js -o ${rt}/cdn/${name}-${suffix}.min.js`)
};
[version, 'latest'].forEach(r =>
Object.keys(cmds).forEach(cmd =>
shell(cmds[cmd](r))
)
);
```
|
The 2001 All-Ireland Senior Football Championship Final was the 114th All-Ireland Final and the deciding match of the 2001 All-Ireland Senior Football Championship, an inter-county Gaelic football tournament for the top teams in Ireland.
Galway defeated Meath. Neither side contested a final again until Galway's semi-final victory over Derry in 2022.
Competition structure
Each of the 32 traditional counties of Ireland is represented by a county side. Every county, except Kilkenny, participated in the 2001 All-Ireland Senior Football Championship. The "overseas county" of New York also participated, while London played no part in the competition due to the outbreak of Foot-and-mouth disease. Each county in Ireland is located in a province; for the purpose of the All-Ireland Senior Football Championship, London and New York are located in Connacht. The 2001 All-Ireland Senior Football Championship began with the four provincial championships – knock-out competitions between county sides in the same province. The four winners of these championships progressed automatically to the All-Ireland quarter-finals. The sides which did not win a provincial championship entered the All-Ireland qualifiers to determine which other four teams would play in the quarter-finals. New York, however, only competed in the provincial championship.
Background
The 2001 Championship was the first to feature the qualifying system, in which sides who had not won their provincial championship competed for the right to join the provincial winners in the "All-Ireland series". Galway, who had lost to Roscommon in the Connacht Championship semi-final, thus became the first side to contest an All-Ireland Final having not won their provincial championship.
Galway had previously contested the final on 21 occasions, winning 8 times (in 1925, 1934, 1938, 1956, 1964, 1965, 1966 and 1998) and losing on 13 occasions, the most recent of which was the previous year. They were appearing in the final for the third time in four years. Meath had won the title 7 times (in 1949, 1954, 1967, 1987, 1988, 1996 and 1999) and lost on 8 occasions. Manager Seán Boylan had been in charge for 8 of Meath's previous final appearances, including replays.
The two counties had not played each other in the Championship since 1970, when Meath won by four points. In 1966, the sides contested the final.
Earlier in 2001, Galway lost the National Football League final against Mayo.
Routes to the final
Galway
In previous years, Galway, having lost to Roscommon in the Connacht Championship semi-final, would have played no part in the All-Ireland series as they did not win their provincial championship. However, the introduction of the qualifier system this year gave them a second opportunity to reach the final. The county entered at the second qualifying round, against Wicklow, and with further victories against Armagh and Cork, joined Meath at the quarter-final stage.
Going into the final quarter of their semi-final against Derry, Galway were trailing by five points but ultimately won the game 1–14 (17 points) to 1–11 (14 points). Derry had named an unchanged line-up from their quarter-final against Tyrone, while Galway initially did not name anyone at right wing forward as they were waiting on fitness reports on Jarlath Fallon and Paul Clancy; Fallon went on to start the game. Galway were leading 0–05 – 0–4 when Enda Muldoon scored Derry's goal in the 26th minute. Matthew Clancy scored Galway's goal in the 66th minute.
Meath
Meath won the year's Leinster Championship, by virtue of victories against Westmeath, Kildare and Dublin, to seal their place in the All-Ireland quarter-final.
Meath were drawn against Westmeath in the quarter-final and Galway were scheduled to play Roscommon; both of these fixtures were repeats of matches played in the provincial championships. There was no repeat of Galway's earlier defeat as they triumphed 0–14 to 1–05 (8 points) in Castlebar. Westmeath, who had lost to Meath by a single point in the Leinster Championship, were leading Meath by 9 points on 20 minutes but the game eventually finished a 2–12 (18 points) – 3–09 (18 points) draw (Meath score given first). Despite having Hank Traynor sent off, Meath won the replay 2–10 (16 points) – 0–11.
Meath reached the final following a 2–14 (20 points) to 0–05 victory against the defending champions Kerry. Kerry, who started the game with all but 2 of the players who won the title the previous year, only managed to score a single point in the second half. Meath's line-up was unchanged from the previous round; only 2 players did not start the 1999 final. John McDermott scored Meath's first goal towards the end of the first half to give his side a 5-point lead at the break. The lead was extended to 11 points following 6 unanswered points at the beginning of the second half. John Cullinane scored Meath's second goal in the 66th minute; an earlier goal was disallowed for an infringement on the square ball rule. Kerry's Éamonn Fitzmaurice was sent off late in the game.
Pre-match
Meath were expected to win their eighth All-Ireland senior football title.
Referee Michael Collins had also officiated Galway's semi-final match.
Galway's hurlers contested the 2001 All-Ireland Senior Hurling Championship Final on 9 September, but lost to Tipperary. Dual player Alan Kerins, who played in the hurling final, was named as a substitute for the football final. The Galway and Tipperary managers complained about the condition of the Croke Park pitch following the hurling final; a few days later, Croke Park spokesman Danny Lynch stated every effort was being made to prepare the pitch for the football final. The new Hogan Stand of the stadium was under construction at the time.
The build-up to the final was overshadowed by the September 11 attacks. The atmosphere in Galway and Meath was more muted than it would normally be leading up to an All-Ireland final.
Match
Galway won easily, their second title in four years. At full-time it was Galway 0-17 : 0-08 Meath.
In the All-Ireland Minor Football Championship Final, held just before the senior game, Tyrone and Dublin drew 0–15 – 1–12.
Meath, who announced their starting line-up on their then recently launched website a couple of days before the final, started with the same 15 players who began the semi-final against Kerry. All but two of the side had started the final two years previously; Richie Kealey and Ray Magee replaced Paddy Reynolds and Enda McManus.
Match report
The first half lacked quality play. Both sides scored six points, but also amassed many wides. Galway's Donnellan sent two frees wide.
Meath's Ollie Murphy was substituted on 45 minutes after breaking a finger. Nigel Nestor was sent off following a second yellow card shortly afterwards, with Meath trailing by two points. In the 59th minute, with the score 0–13 – 0–08, Trevor Giles missed a penalty for Meath. Some commentators suggested John McDermott dived to win the penalty. Padraic Joyce scored ten points for Galway, nine of which came in the second half. Meath's full-forwards had little of the ball - they only amassed 2 wides during the game and only scored two points in the second half.
Match details
'''References:
Post-match
The Galway side returned to the county the day after the final. They made appearances in Ballinasloe, Tuam and Galway city, where a civic reception was held, to greet fans. The city's mayor, Donal Lyons, said Galway people across the world were proud when watching the side. More than 10,000 fans gathered in Tuam.
Tomas Mannion announced his retirement after the final.
Notes
Galway score given first.
Meath score given first.
References
All-Ireland Senior Football Championship Final
All-Ireland Senior Football Championship Final, 2001
All-Ireland Senior Football Championship Finals
All-Ireland Senior Football Championship finals
Galway county football team matches
Meath county football team matches
|
Juventinus Albius Ovidius was the name of the author of thirty-five distichs titled Elegia de Philomela, containing a collection of those words which are supposed to express appropriately the sounds uttered by birds, quadrupeds, and other animals. For example:
The age in which the author lived is quite unknown, but from the last couplet in the piece it would appear that he was a Christian. German philologist Gottfried Bernhardy attempted to prove from Spartianus that this and other trifles of a similar description were composed by the contemporaries of the emperor Geta, the son of Septimius Severus and the brother of Caracalla.
References
3rd-century Romans
3rd-century poets
Ancient Roman poets
Albii
Year of death unknown
Year of birth unknown
3rd-century writers in Latin
|
```html
<cdk-tree #tree [dataSource]="dataSource" [childrenAccessor]="childrenAccessor">
<!-- This is the tree node template for leaf nodes -->
<cdk-tree-node *cdkTreeNodeDef="let node" cdkTreeNodePadding
[style.display]="shouldRender(node) ? 'flex' : 'none'"
[isDisabled]="!shouldRender(node)"
class="example-tree-node">
<!-- use a disabled button to provide padding for tree leaf -->
<button mat-icon-button disabled></button>
{{node.name}}
</cdk-tree-node>
<!-- This is the tree node template for expandable nodes -->
<cdk-tree-node *cdkTreeNodeDef="let node; when: hasChild" cdkTreeNodePadding
cdkTreeNodeToggle
[cdkTreeNodeTypeaheadLabel]="node.name"
[style.display]="shouldRender(node) ? 'flex' : 'none'"
[isDisabled]="!shouldRender(node)"
[isExpandable]="true"
class="example-tree-node">
<button mat-icon-button cdkTreeNodeToggle [attr.aria-label]="'Toggle ' + node.name">
<mat-icon class="mat-icon-rtl-mirror">
{{tree.isExpanded(node) ? 'expand_more' : 'chevron_right'}}
</mat-icon>
</button>
{{node.name}}
</cdk-tree-node>
</cdk-tree>
```
|
```php
<?php
declare(strict_types=1);
/**
* Passbolt ~ Open source password manager for teams
*
* For full copyright and license information, please see the LICENSE.txt
* Redistributions of files must retain the above copyright notice.
*
* @link path_to_url Passbolt(tm)
* @since 2.13.0
*/
namespace App\Service\Groups;
use App\Error\Exception\ValidationException;
use App\Model\Entity\Group;
use App\Model\Table\PermissionsTable;
use App\Model\Validation\GroupsUsersChange\GroupsUsersChangeValidator;
use App\Service\Users\UserGetService;
use App\Utility\UserAccessControl;
use Cake\Http\Exception\BadRequestException;
use Cake\Http\Exception\NotFoundException;
use Cake\ORM\TableRegistry;
use Cake\Utility\Hash;
class GroupsUpdateDryRunService
{
/**
* @var \App\Model\Table\GroupsTable
*/
private $groupsTable;
/**
* @var \App\Model\Table\PermissionsTable
*/
private $permissionsTable;
/**
* @var \App\Model\Table\SecretsTable
*/
private $secretsTable;
/**
* @var \App\Model\Table\GroupsUsersTable
*/
private $groupsUsersTable;
/**
* @var \App\Service\Groups\GroupGetService
*/
private $groupGetService;
/**
* @var \App\Service\Users\UserGetService
*/
private $userGetService;
/**
* Instantiate the service.
*/
public function __construct()
{
$this->groupsTable = TableRegistry::getTableLocator()->get('Groups');
$this->secretsTable = TableRegistry::getTableLocator()->get('Secrets');
$this->permissionsTable = TableRegistry::getTableLocator()->get('Permissions');
$this->groupsUsersTable = TableRegistry::getTableLocator()->get('GroupsUsers');
$this->groupGetService = new GroupGetService();
$this->userGetService = new UserGetService();
}
/**
* Update a group dry run.
*
* @param \App\Utility\UserAccessControl $uac The current user
* @param string $groupId The target group
* @param array|null $changes The list of group users changes to apply
* @return array
* [
* secrets <array> The operator secrets that the operator will need to encrypt
* secretsNeeded <array> The secrets that need to be encrypted for the users who got access to new resources
* ]
* @throws \Exception
*/
public function dryRun(UserAccessControl $uac, string $groupId, ?array $changes = []): array
{
$group = $this->groupGetService->getNotDeletedOrFail($groupId);
$this->assertChanges($group, $changes);
$isUacManager = $this->groupsUsersTable->isManager($uac->getId(), $group->id);
if ($isUacManager) {
$missingSecrets = $this->getAddedGroupsUsersMissingSecrets($group, $changes);
$operatorSecretsToEncrypt = $this->getOperatorSecretsToEncrypt($uac, $missingSecrets);
}
return [
'secrets' => $operatorSecretsToEncrypt ?? [],
'secretsNeeded' => $missingSecrets ?? [],
];
}
/**
* Assert the list of changes.
*
* @param \App\Model\Entity\Group $group The group to update
* @param array $changes The list of group users changes to apply
* @return void
*/
private function assertChanges(Group $group, array $changes): void
{
$validator = new GroupsUsersChangeValidator();
foreach ($changes as $rowIndexRef => $change) {
$errors = $validator->validate($change);
if (!empty($errors)) {
$group->setError('groups_users', [$rowIndexRef => $errors]);
$this->handleValidationErrors($group);
}
}
}
/**
* Handle group validation errors.
*
* @param \App\Model\Entity\Group $group The target group
* @return void
* @throws \App\Error\Exception\ValidationException If the provided data does not validate.
*/
private function handleValidationErrors(Group $group): void
{
$errors = $group->getErrors();
if (!empty($errors)) {
throw new ValidationException(__('Could not validate group data.'), $group, $this->groupsTable);
}
}
/**
* Get the secrets that will require to be encrypted for the users added to the group.
*
* @param \App\Model\Entity\Group $group The group to update.
* @param array $changes The list of group users changes.
* @return array A list of secrets to request to the client
* [
* [
* 'resource_id' => uuid,
* 'user_id' => uuid
* ],
* ...
* ]
*/
private function getAddedGroupsUsersMissingSecrets(Group $group, array $changes = []): array
{
$missingSecrets = [];
foreach ($changes as $rowIndexRef => $groupUserData) {
$id = Hash::get($groupUserData, 'id');
if (!$id) {
$userId = Hash::get($groupUserData, 'user_id');
$this->assertUserToAdd($group, $userId, $rowIndexRef);
$userMissingSecrets = $this->getAddedGroupUserMissingSecrets($group->id, $userId);
$missingSecrets = array_merge($missingSecrets, $userMissingSecrets);
}
}
return $missingSecrets;
}
/**
* @param \App\Model\Entity\Group $group The group to update.
* @param string $userId The identifier of the user to add
* @param int $rowIndexRef The index of the treated group user in the request data, for error purpose.
* @return void
*/
private function assertUserToAdd(Group $group, string $userId, int $rowIndexRef): void
{
try {
$this->userGetService->getActiveNotDeletedOrFail($userId);
} catch (NotFoundException | BadRequestException $e) {
$errors = ['user_id' => ['user_exists' => ['Cannot find the user.']]];
$group->setError('groups_users', [$rowIndexRef => $errors]);
$this->handleValidationErrors($group);
}
}
/**
* Get the missing secrets required to add a user to a group.
*
* @param string $groupId The identifier of the group to update.
* @param string $userId The identifier of the user to add
* @return array
*/
private function getAddedGroupUserMissingSecrets(string $groupId, string $userId): array
{
$missingSecretsResourcesIds = $this->permissionsTable
->findAcosAccessesDiffBetweenGroupAndUser(PermissionsTable::RESOURCE_ACO, $groupId, $userId)
->all()
->extract('aco_foreign_key')
->toArray();
return array_map(function ($resourceId) use ($userId) {
return [
'resource_id' => $resourceId,
'user_id' => $userId,
];
}, $missingSecretsResourcesIds);
}
/**
* Retrieve the secrets that require to be encrypted for a user.
*
* @param \App\Utility\UserAccessControl $uac The operator
* @param array $usersMissingSecrets The missing users secrets to encrypt
* @return array A list of secret with their associated resource
* [
* [
* 'resource_id' => uuid,
* 'data' => text
* ],
* ...
* ]
*/
private function getOperatorSecretsToEncrypt(UserAccessControl $uac, array $usersMissingSecrets = []): array
{
if (empty($usersMissingSecrets)) {
return [];
}
$resourceIds = array_unique(Hash::extract($usersMissingSecrets, '{n}.resource_id'));
// Retrieve the secrets the operator will have to encrypt.
$query = $this->secretsTable->find()
->where([
'resource_id IN' => $resourceIds,
'user_id' => $uac->getId() ?? '',
])
->select(['resource_id', 'data'])
->distinct();
// Format the result.
$query = $query->all()->map(function ($secret) {
return [
'resource_id' => $secret->resource_id,
'data' => $secret->data,
];
});
return $query->toArray();
}
}
```
|
Vers-sous-Sellières is a commune in the Jura department in the Bourgogne-Franche-Comté region in eastern France.
Population
See also
Communes of the Jura department
References
Communes of Jura (department)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.