text
stringlengths 1
22.8M
|
|---|
M. Fathima Beevi (born 30 April 1927) is a former judge of the Supreme Court of India. Appointed to the apex Court in 1989, she became the first female judge to be a part of the Supreme Court of India, and the first Muslim woman to be appointed to any of the higher judiciaries in country. On her retirement from the court, she served as a member of the National Human Rights Commission and later as the Governor of the Indian state of Tamil Nadu from 1997 to 2001.
Early life and education
M.Fathima Beevi was born on 30 April 1927 at Pathanamthitta in the Kingdom of Travancore, now in the Indian state of Kerala, as the daughter of Annaveettil Meer Sahib and Khadeeja Beevi into Rowther Family.
She attended Town school and Catholicate High School, Pathanamthitta and got her BSc in chemistry from University College, Thiruvananthapuram. She obtained her B.L. from Government Law College, Thiruvananthapuram.
Career
Beevi was enrolled as Advocate on 14 November 1950. She topped the Bar Council exam in 1950. She began her career in the lower judiciary in Kerala. She was appointed the Munsiff in the Kerala Sub-ordinate Judicial Services in May, 1958. She was promoted as the Sub-ordinate Judge in 1968 and as the Chief Judicial Magistrate in 1972, as District & Sessions Judge in 1974.
She was further appointed the Judicial Member of the Income Tax Appellate Tribunal in January, 1980. She was then elevated to the High Court as a Judge on 4 August 1983.
She became permanent Judge of the High Court on 14 May 1984. She retired as the Judge of the High Court on 29 April 1989 but was further elevated to the Supreme Court as a Judge on 6 October 1989 where she retired on 29 April 1992.
Governor of Tamil Nadu
She later went on to become the Governor of Tamil Nadu on 25 January 1997. Appointing her as the Governor of Tamil Nadu and Justice Sukhdev Singh Kang, former Chief Justice of Jammu and Kashmir High Court, as Governor of Kerala, the then President of India, Shankar Dayal Sharma said "Their experience of and insights into the working of the Constitution and the laws comprise valuable assets."
As the Governor of the state, she rejected the mercy petitions filed by the four condemned prisoners in the Rajiv Gandhi assassination case. The prisoners had sent the mercy petitions to the Governor, pleading for her to exercise her power under Article 161 of the Constitution (the Governor's power to grant pardon).
Controversy
She was embroiled in controversy when she gave a clean chit to the law and order situation in Tamil Nadu that prompted the ire of the Central government. The Minister for Law, Arun Jaitley asked for her resignation. Later she left her office as Governor of the state under controversial circumstances of her accepting Jayalalithaa's assembly majority after the elections and over the arrest of Karunanidhi, who pitched for her appointment four years ago. Jayalalitha defended the state Governor's decision to invite her to form the government. She said "She is a former supreme court judge. She herself is a legal expert. Nobody need teach her about law or the constitution. Her decision is not justiciable."
Jayalalitha's party had received the simple majority (131 seats out of total 234 seats in the Tamil Nadu Assembly) after elections in May 2001. Fathima Beevi, the then Governor of Tamil Nadu administered the oath of office to J Jayalalitha as the Chief Minister of Tamil Nadu on 14 May 2001 in spite of the fact that Jayalalitha could not contest the election and would not be able to get herself elected by the people to the assembly within six months as per the constitution. There were a few Public Interest Litigations (PIL) filed in the Supreme Court questioning the validity of her appointment as the Chief Minister of Tamil Nadu. Fathima Beevi justified her decision by saying that the majority party in the state assembly had elected Jayalalitha as their leader.
Fathima Beevi submitted her resignation after the Union Cabinet decided to recommend to the President to recall the Governor for having failed to discharge her constitutional obligation. The centre was peeved with Ms. Fathima Beevi for not having furnished an independent and objective assessment of the sequence of events after the arrest of the former Chief Minister, M. Karunanidhi, and the two Union Ministers, Murasoli Maran and T. R. Baalu. The centre had accused her of toeing the official line verbatim. The then Andhra Pradesh Governor, Dr C. Rangarajan, took charge as the acting Governor of Tamil Nadu, following her resignation.
Subsequently, the Supreme Court of India overturned her appointment of Jayalalithaa as Chief Minister of Tamil Nadu. Referring to the case, the Court Bench ruled that "The Governor cannot, in the exercise of his/her discretion or otherwise, do anything that is contrary to the Constitution and the laws. Therefore, the Governor, having due regard to the Constitution and the laws, must decline to exercise the discretion in appointing as Chief Minister a non-member who was not qualified to become a member of the legislature."
Other Duties
As the Governor of the state she had also served as the Chancellor of Madras University. It was reported by university sources that the Vice-Chancellor, P.T. Manoharan, had decided to quit his office in the wake of the Chancellor allegedly withholding her approval to the Syndicate's decision to establish a new department for contemporary Tamil literature. She had also served as the Chairman of Kerala Commission for Backward Classes (1993) and member of National Human Rights Commission (1993). She received Hon. D. Litt. and Mahila Shiromani Award in 1990. She was also awarded Bharat Jyoti Award.
The left parties also discussed the nomination of the prospects of Fathima Beevi as the President of India, during which the NDA Government proposed the name of Dr. A P J Abdul Kalam.
See also
Anna Chandy
References
External links
20th-century Indian Muslims
Women state governors of India
20th-century Indian women politicians
20th-century Indian politicians
20th-century Indian judges
Malayali people
Governors of Tamil Nadu
People from Pathanamthitta district
1927 births
Living people
Justices of the Supreme Court of India
Judges of the Madras High Court
Women in Tamil Nadu politics
20th-century Indian lawyers
Women in Kerala politics
Women from the Kingdom of Travancore
People from the Kingdom of Travancore
21st-century Indian women politicians
21st-century Indian politicians
Former judges of Indian High Courts
High Court of Kerala former judges
Women educators from Kerala
Educators from Kerala
20th-century Indian women judges
Government Law College, Thiruvananthapuram alumni
|
```toml
[project]
name = "pulumi_fail_on_create"
dependencies = ["parver>=0.2.1", "pulumi>=3.0.0,<4.0.0", "semver>=2.8.1"]
readme = "README.md"
requires-python = ">=3.8"
version = "4.0.0"
[build-system]
requires = ["setuptools>=61.0"]
build-backend = "setuptools.build_meta"
[tool]
[tool.setuptools]
[tool.setuptools.package-data]
pulumi_fail_on_create = ["py.typed", "pulumi-plugin.json"]
```
|
Reverend Sir Frederic Shelley, 8th Baronet (1809–1869), of Shobrooke Park, Crediton, Devon, was a cleric and landowner.
Origins
He was the second son of Sir John Shelley, 6th Baronet (1772–1852) of Michelgrove and Maresfield Park, Sussex, by his wife Frances Winckley, daughter and heiress of Thomas Winckley, of Brockholes, Lancashire.
Career
He began his career in the Royal Navy, from which he retired in 1833, after twelve years' active service in all parts of the world as a Lieutenant. Having decided on adopting the clerical profession, he was ordained deacon in 1835, and priest in 1836. In about 1837 he was appointed by Richard Hippisley Tuckfield (1774-1844) of Shobrooke Park near Crediton, Devon, as curate of Posbury Chapel, near Shobrooke, which he had built in 1835 to cater for the growing congregation of Holy Cross Church, Crediton. In about 1839 he was also appointed to succeed Mr Marriott as head teacher of St Luke's teacher training college at Posbury, founded next to the chapel in about 1836 by Lady Hippisley (née Charlotte Mordaunt), Sir Richard's wife, a pioneer in the education of deaf and dumb children. He lived with the students at Priestcott, Posbury. In 1845 he married his patron's niece Charlotte Martha Hippisley (1812–1893), sister of John Hippisley of Ston Easton Park, and following his marriage he moved away from Posbury having been appointed as rector of Bere Ferrers with Beer Alston, Devon in 1844, by the Earl of Mount Edgcumbe.
Succession to baronetcy
He succeeded to the baronetcy 26 January 1867, at the age of 58, following the death of his elder brother Sir John Villiers Shelley, 7th Baronet (1808–1867), MP, of Maresfield Park. Maresfield Park, however, was left by the 7th Baronet to his only daughter Blanche.
Marriage and progeny
On 4 February 1845, he married Charlotte Martha Hippisley (1812–1893), daughter of the Rev. Henry Hippisley (1776–1838), of Lambourne Place, Berkshire (whose maternal grandfather was John Hippisley Coxe (1715–1769), builder of the mansion Ston Easton Park in Somerset) by his wife Anne Rollinson. He left progeny two sons and one daughter, including:
Sir John Shelley, 9th Baronet (1848–1931), who inherited Shobrooke Park from his mother's childless first cousin John Henry Hippisley (1801–1880), Sheriff of Devon in 1859 and a Deputy Lieutenant of Somerset.
Death and burial
He died at Shobrooke Park aged 60 on 19 March 1869 and was buried in the churchyard of St Swithun's Church, Shobrooke. The inscription on his gravestone is as follows:
"Sir Frederick Shelley Eighth Baronet. Twenty four years Rector of Bere Ferrers. Born May 3, 1809. Died March 19, 1869. Also of his wife Charlotte Martha Shelley. Born August 10 AD 1812. Died May 20, 1893. Blessed are the dead which die in Christ".
Sources
Burke's Genealogical and Heraldic History of the Landed Gentry, 15th Edition, ed. Pirie-Gordon, H., London, 1937, pp. 1119–20, pedigree of Hippisley of Ston Easton
References
1809 births
1869 deaths
19th-century English Anglican priests
Shelley baronets, of Michelgrove
People from Maresfield
People from Arun District
|
Larisa Polivoda (; ; born December 16, 1963) is a former Ukrainian butterfly swimmer who competed for the former Soviet Union at the 1980 Summer Olympics, competing in the 200 metre and 100 metre events.
She was a member of Meteor Sport Club in the city of Dnipropetrovsk.
Polivoda representеd USSR at the 1979 Tokyo World Cup, and in international meets with USA, UK, and East Germany. She became a National Champion in 1980 and 1981. Her butterfly style was distinguished by extremely fast beginning and seemingly effortless technique.
References
Larisa Polivoda profile at Sports-Reference.com
Polidova at the 49th USSR Summer Swim Meet (in Russian)
Russian female swimmers
Soviet female swimmers
Olympic swimmers for the Soviet Union
Swimmers at the 1980 Summer Olympics
1963 births
Living people
|
The grey-cheeked fulvetta or Morrison's fulvetta (Alcippe morrisonia) is a bird in the family Alcippeidae. The species was first described by Robert Swinhoe in 1863. The grey-cheeked fulvetta is part of a species complex and the nominate morrisonia is now restricted to endemic Taiwan birds, with the David's fulvetta (Alcippe davidi), Huet's fulvetta (Alcippe hueti) and Yunnan fulvetta (Alcippe fratercula) now recognised as a separate species.
Distribution
It is a year-round resident throughout Taiwan. It is found in evergreen mountain forests.
Characteristics
This 15-cm long bird has a grey head with a white eye ring and a long black eye stripe running from the bill down the sides of the neck. The upperparts are olive and the underparts are yellow.
Its call is a weak chi-chi-chu-chui. It will readily join mixed-species feeding flocks.
Notes
References
Collar, N. J. & Robson C. 2007. Family Timaliidae (Babblers) pp. 70 – 291 in; del Hoyo, J., Elliott, A. & Christie, D.A. eds. Handbook of the Birds of the World, Vol. 12. Picathartes to Tits and Chickadees. Lynx Edicions, Barcelona.
Lekagul, Boonsong, Round, Philip A Guide to the Birds of Thailand Saha Karn Baet, 1991
Robson, Craig A Field Guide to the Birds of Thailand New Holland Press, 2004
grey-cheeked fulvetta
Birds of South China
Birds of Hainan
Birds of Taiwan
Birds of Southeast Asia
grey-cheeked fulvetta
Taxonomy articles created by Polbot
|
Terminalia buceras is a tree in the Combretaceae family. It is known by a variety of names in English, including bullet tree, black olive tree, gregorywood (or gregory wood), Antigua whitewood, and oxhorn bucida. It is native to Mexico, Central America, the Caribbean, and northern South America. It is commonly found in coastal swamps and wet inland forests in low elevations.
Distribution
The species is native to the Neotropical realm. Countries and regions in which it grows are: Colombia; Panama; Costa Rica; Venezuelan Antilles; Nicaragua; Windward Islands; Honduras; Guatemala; Mexico (Southeast, Southwest, Gulf, Central); Leeward Islands; Belize; Hispaniola (Dominican Republic, Haiti); Jamaica; Puerto Rico; Cuba; Turks-Caicos Islands; Bahamas. It is regarded as introduced in Florida and Trinidad and Tobago.
Growth
To grow it prefers high sunlight and rich, moist, well drained soil. It is highly tolerant to salt, insects, fungus, wind, and air pollution. Its roots are able to dig up paving stones and damage foundations.
Wood
The wood of the bullet tree is extremely hard and durable. Being highly resistant to insects and fungi, it is sometimes used for house posts or bridge timbers. The bark may be used for tanning leather due to its tannin content. It is also often used as an ornamental/shade tree.
The wood was also used for ship construction during the Age of Sail. The frame of , built in Jamaica in 1790, was constructed of bullet tree wood.
References
buceras
Trees of Mexico
Trees of South America
|
Diana Michele Capponi (February 22, 1953 – September 21, 2014) was a Canadian mental health activist, psychiatric survivor, and community leader.
Early life
Capponi was born in Montreal, Quebec, the youngest sister of writer and activist Pat Capponi. Both sisters described an abusive home, which they left as young women. In 1984, she graduated from a police training program at Centennial College in Toronto. "Going to college was the most significant thing I could have done to change my life," she said later.
Career
Diana Capponi dropped out of school, traveled to India, and became addicted to heroin. Back in Canada, she moved to Toronto, Ontario, where two of her sisters lived. Her sister Pat helped her find housing in Parkdale and rehabilitation. She worked at a women's shelter, and then at a cleaning service. She founded the Ontario Council of Alternative Businesses (OCAB), to create economic opportunities for psychiatric survivors. She served on the board of directors at the Gerstein Centre in Toronto.
In 2003, Capponi became coordinator of the new Employment Works program at the Centre for Addiction and Mental Health (CAMH). In this position she continued her earlier work, building businesses and careers with survivors of addiction and mental illness. She consulted on similar projects and on mental health policy across Canada, and internationally. "Current research indicates that there is absolutely no correlation between a person's mental health diagnosis and their ability to work. If you can do the job, then you can do the job, period," she explained.
Capponi appeared in a National Film Board of Canada documentary, Working Like Crazy (1999), and in a television program, Second Chance: Making It Work (2005). In 2009, she testified about employment and mental health before a committee of the Canadian Parliament.
Personal life
Capponi identified herself as a psychiatric survivor. She married Brenda Needham in 2003; they stopped living together in 2009, but remained close. Capponi died in 2014, from metastatic breast cancer, at age 61, in Toronto. In 2015 there was a tribute night held to raise funds for the Diana Capponi Education Fund.
References
External links
David Reville's 2009 interview with Diana Capponi, on YouTube.
1953 births
2014 deaths
Anglophone Quebec people
Deaths from breast cancer
Deaths from cancer in Ontario
Canadian disability rights activists
Mental health activists
Mental health in Canada
Centennial College alumni
Activists from Montreal
Activists from Toronto
Canadian women activists
|
The 46th Annual American Music Awards were held on October 9, 2018, at the Microsoft Theater in Los Angeles, California. It aired live on ABC and was hosted by Tracee Ellis Ross. Cardi B and Drake led the list of nominations with eight mentions each. Taylor Swift and Camila Cabello were the big winners, with four awards each. The late rapper and singer XXXTentacion won Favorite Soul/R&B album nearly four months after his death. His mother, Cleopatra Bernard, accepted the award.
Performances
Notes
Broadcast live from Sydney, Australia.
With musical director Ricky Minor.
Presenters
Bebe Rexha and Florida Georgia Line - presented Favorite Rap/Hip-Hop Artist
Amber Heard - introduced Twenty One Pilots
Macaulay Culkin- presented Favorite Pop/Rock Male Artist
Heidi Klum - presented Tour of the Year
Chloe x Halle - introduced Mariah Carey
John Stamos and Busy Philipps - presented Favorite Soul/R&B Male Artist
Tracee Ellis Ross - introduced Cardi B, Bad Bunny & J Balvin
Ashlee Simpson and Evan Ross - presented Favorite Pop/Rock Song
Sara Gilbert and Thomas Rhett - presented Favorite Country Female Artist
Normani and Liza Koshy - introduced Benny Blanco, Khalid and Halsey
Billy Eichner and Kathryn Hahn - presented Favorite Adult Contemporary Artist
Constance Wu and Rita Ora - presented Favorite Pop/Rock Duo or Group
The Chainsmokers and Kelsea Ballerini - introduced Post Malone and Ty Dolla Sign
Vanessa Hudgens - introduced Jennifer Lopez
Lauren Daigle and Kane Brown - presented Favorite Soul/R&B album
Amandla Stenberg - presented Favorite Pop/Rock Album
Taran Killam and Leighton Meester - presented Favorite Country Male Artist
Tracee Ellis Ross - introduced Ciara and Missy Elliott
Tyra Banks - presented New Artist of the Year
Tracee Ellis Ross - introduced Carrie Underwood
Rami Malek, Joseph Mazzello and Gwilym Lee - introduced Panic! at the Disco
Lenny Kravitz - presented Artist of the Year
Winners and nominees
References
2018 awards in the United States
2018 in American music
2018 in Los Angeles
2018 music awards
2018
October 2018 events in the United States
|
```objective-c
// 2016 and later: Unicode, Inc. and others.
/*
*******************************************************************************
*
* Corporation and others. All Rights Reserved.
*
*******************************************************************************
* file name: std_string.h
* encoding: UTF-8
* tab size: 8 (not used)
* indentation:4
*
* created on: 2009feb19
* created by: Markus W. Scherer
*/
#ifndef __STD_STRING_H__
#define __STD_STRING_H__
/**
* \file
* \brief C++ API: Central ICU header for including the C++ standard <string>
* header and for related definitions.
*/
#include "unicode/utypes.h"
// Workaround for a libstdc++ bug before libstdc++4.6 (2011).
// path_to_url
#if defined(__GLIBCXX__)
namespace std { class type_info; }
#endif
#include <string>
#endif // __STD_STRING_H__
```
|
The 32nd National Assembly of Quebec was the provincial legislature in Quebec, Canada that was elected in the 1981 Quebec general election. It sat for a total of five sessions from May 19, 1981, to June 18, 1981; from September 30, 1981, to October 2, 1981; from November 9, 1981, to March 10, 1983; from March 23, 1983, to June 20, 1984; and from October 16, 1984, to October 10, 1985. The Parti Québécois government was led by Premier René Lévesque for most of the mandate, and by Pierre-Marc Johnson for a few months prior to the 1985 election. The Liberal opposition was led by Claude Ryan, by interim Liberal leader Gérard D. Levesque, and then by Robert Bourassa.
Seats per political party
After the 1981 elections
Member list
This was the list of members of the National Assembly of Quebec that were elected in the 1981 election:
Other elected MNAs
Other MNAs were elected in by-elections during this mandate
Réjean Doyon, Quebec Liberal Party, Louis-Hébert, April 5, 1982
Germain Leduc, Quebec Liberal Party, Saint-Laurent, April 5, 1982
Marc-Yvan Côté, Quebec Liberal Party, Charlesbourg, June 20, 1983
Ghislain Maltais, Quebec Liberal Party, Saguenay, June 20, 1983
Serge Champagne, Quebec Liberal Party, Saint-Jacques, June 20, 1983
Aline Saint-Amand, Quebec Liberal Party, Jonquière, December 5, 1983
Madeleine Bélanger, Quebec Liberal Party, Mégantic-Compton, December 5, 1983
Gilles Fortin, Quebec Liberal Party, Marguerite-Bourgeoys, June 18, 1984
Marcel Parent, Quebec Liberal Party, Sauvé, June 18, 1984
Jean-François Viau, Quebec Liberal Party, Saint-Jacques, November 26, 1984
Robert Bourassa, Quebec Liberal Party, Bertrand (Montérégie), June 3, 1985
Claude Trudel, Quebec Liberal Party, Bourget, June 3, 1985
Jean-Guy Gervais, Quebec Liberal Party, L'Assomption, June 3, 1985
Paul Philibert, Quebec Liberal Party, Trois-Rivières, June 3, 1985
Cabinet Ministers
Levesque Cabinet (1981-1985)
Prime Minister and Executive Council President: René Lévesque
Deputy Premier: Jacques-Yvan Morin (1981–1984), Camille Laurin (1984), Marc-André Bédard (1984–1985)
Agriculture, Fisheries and Food: Jean Garon
Labor, Workforce and Revenue Security: Raynald Fréchette (1981–1982)
Labor: Raynald Fréchette (1982–1985)
Workforce and Revenue Security: Pierre Marois (1982–1983), Pauline Marois (1983–1985)
Employment: Robert Dean (1984–1985)
Public Works and Provisioning: Alain Marcoux (1981–1984)
Administration: Yves Bérubé (1981–1982), Michel Clair (1984–1985)
Administration Reform: Yves Bérubé (1982–1984)
Public Office: Denise Leblanc (1981–1984)
Cultural Affairs: Clément Richard
Cultural and Science Development: Jacques-Yvan Morin (1981–1982), Gerald Godin (1982)
Cultural Communities and Immigration: Gérald Godin (1981–1984, 1984–1985), Louise Harel (1984), Pierre-Marc Johnson (1984)
Social Affairs: Pierre-Marc Johnson (1981–1984), Camille Laurin (1984), Michel Clair (1984), Guy Chevrette (1984–1985)
Health and Social Services: Guy Chevrette (1985)
Social Development: Denis Lazure (1981–1982)
Family Policies: Yves Beaumier (1985)
Status of Women : Pauline Marois (1981–1983, 1985), Denise Leblanc (1983–1984), René Lévesque (1984–1985), Francine Lalonde (1985)
Language Affairs: Gérald Godin (1984)
Education: Camille Laurin (1981–1984), Yves Bérubé (1984), François Gendron (1984)
Science and Technology:Gilbert Paquette (1982–1984), Yves Bérubé (1984)
Superior Education in Science and Technology: Yves Bérubé (1984–1985)
Recreation, Hunting and Fishing: Lucien Lessard (1981–1982), Guy Chevrette (1982–1984), Jacques Brassard (1984–1985)
Transportation: Michel Clair (1981–1984), Jacques Léonard (1984), Guy Tardif (1984–1985)
Communications: Jean-François Bertrand
Relations with Citizens: Denis Lazure (1982–1984), Élie Fallu (1984–1985)
Municipal Affairs:Jacques Léonard (1981–1984), Alain Marcoux (1984–1985)
Environment: Marcel Léger (1981–1982), Adrien Ouellette (1982–1985)
Energy and Resources: Yves Duhaime (1981–1984), Jean-Guy Rodrigue (1984)
Forests: Jean-Pierre Jolivet (1984–1985)
Intergovernmental Affairs: Claude Morin (1981–1982), Jacques-Yvan Morin (1982–1984)
Canadian Intergovernmental Affairs: Pierre-Marc Johnson (1984–1985)
International Relations: Bernard Landry (1984–1985)
Electoral reform: Marc-André Bedard
Parliamentary Affairs: Claude Charron
Industry, Commerce and Tourism: Rodrigue Biron (1981–1984)
Industry and Commerce: Rodrigue Biron (1984–1985)
Tourism: Marcel Léger (1984–1985)
Planning: François Gendron (1981–1982)
Planning and Regional Development: François Gendron (1982–1984)
Development and Regional Roads: Henri Lemay (1984–1985)
Housing and Consumer's Protection: Guy Tardif (1981–1984), Jacques Rochefort (1984–1985)
Justice: Marc-André Bédard (1981–1984), Pierre-Marc Johnson (1984–1985)
Finances: Jacques Parizeau (1981–1984), Yves Duhaime (1984–1985)
President of the Treasury Board: Yves Bérubé (1981–1984), Michel Clair (1984–1985)
Revenue: Raynald Fréchette (1981–1982), Alain Marcoux (1982–1984), Robert Dean (1984), Maurice Martel (1984–1985)
Financial Institutions and Cooperatives: Jacques Parizeau (1981–1982)
Economic Development: Bernard Landry (1981–1982)
Foreign Trade:Bernard Landry (1982–1985)
Johnson Cabinet (1985)
Prime Minister and Executive Council President: Pierre-Marc Johnson
Deputy Premier: Marc-Andre Bédard
Agriculture, Fisheries and Food: Jean Garon
Labor: Raynald Fréchette
Workforce and Revenue Security: Pauline Marois
Employment: Robert Dean
Administration: Michel Clair
Cultural Affairs: Clement Richard (1985), Gerald Godin (1985)
Cultural Communities and Immigration: Gérald Godin (1985), Élie Fallu (1985)
Health and Social Services:Guy Chevrette
Family Policies: Yves Beaumier
Status of Women : Pauline Marois (1985), Lise Denis (1985)
Education: Francois Gendron
Superior Education in Science and Technology: Yves Bérubé (1985), Jean-Guy Rodrigue (1985)
Recreation, Hunting and Fishing: Jacques Brassard
Transportation: Guy Tardif (1985)
Communications: Jean-François Bertrand
Relations with Citizens: Elie Fallu (1985), Rollande Cloutier (1985)
Municipal Affairs:Alain Marcoux
Environment: Adrien Ouellette
Energy and Resources: Jean-Guy Rodrigue (1985), Michel Clair (1985)
Forests: Jean-Pierre Jolivet
Canadian Intergovernmental Affairs: Pierre-Marc Johnson
International Relations: Bernard Landry (1985), Louise Beaudoin (1985)
Electoral reform: Marc-André Bédard
Industry and Commerce: Rodrigue Biron
Tourism: Marcel Leger
Planning: Alain Marcoux
Development and Regional Roads: Henri Lemay
Housing and Consumer's Protection: Jacques Rochefort (1985)
Justice: Raynald Fréchette
Solicitor General: Marc-André Bédard
Finances: Yves Duhaime (1985), Bernard Landry (1985)
President of the Treasury Board: Michel Clair
Revenue: Maurice Martel
Foreign Trade: Bernard Landry (1985), Jean-Guy Parent (1985)
New electoral districts
A electoral map reform was made in 1985 and implemented in the elections later that year.
Maisonneuve was renamed Hochelaga-Maisonneuve.
Nicolet was renamed Nicolet-Yamaska.
References
1981 election results
List of Historical Cabinet Ministers (Page 3)
List of Historical Cabinet Ministers (Page 4)
Notes
32
|
```javascript
'use strict';
function Store() {
this.emit = function () {};
}
function MemoryStore() {}
var session = { Store: Store, MemoryStore: MemoryStore };
var MongoStore = require('connect-mongo')(session);
if (typeof MongoStore === 'function') {
console.log('ok');
}
```
|
Ishkhan Makharovich Geloyan (; ; born 31 August 1992) is an Armenian professional footballer who plays for Russian club FC Arsenal Tula and the Armenia national team.
Club career
He made his debut in the Russian Second Division for FC Slavyansky Slavyansk-na-Kubani on 26 July 2012 in a game against FC Mashuk-KMV Pyatigorsk.
He made his Russian Football National League debut for FC Khimik Dzerzhinsk on 13 July 2013 in a game against FC Baltika Kaliningrad.
On 15 June 2019, he signed a 2-year contract with the Russian Premier League newcomers FC Tambov. Shortly after he suffered an ACL tear which kept him out of action until March 2020. Tambov did not register him with the league for the 2020–21 Russian Premier League season.
International career
Geloyan debuted with the senior Armenia national team in a 6–0 2022 FIFA World Cup qualification loss to Germany on 5 September 2021.
References
External links
1992 births
People from Ararat Province
Russian sportspeople of Armenian descent
Living people
Armenian men's footballers
Armenia men's international footballers
Russian men's footballers
Men's association football forwards
FC Lokomotiv Moscow players
FC Gornyak Uchaly players
FC Khimik Dzerzhinsk players
FC Baltika Kaliningrad players
FC Yenisey Krasnoyarsk players
FC Neftekhimik Nizhnekamsk players
FC Luch Vladivostok players
FC Shinnik Yaroslavl players
FC Tambov players
FC SKA-Khabarovsk players
FC Arsenal Tula players
Russian First League players
Russian Second League players
|
```smalltalk
using Microsoft.AspNetCore.Components.WebAssembly.Hosting;
using HelloWorld;
var builder = WebAssemblyHostBuilder.CreateDefault(args);
builder.RootComponents.Add<App>("app");
var app = builder.Build();
await app.RunAsync();
```
|
Banbury Oaks is a neighborhood in Pasadena, California. It is bordered by Washington Boulevard to the north, Mountain Street to the south, Fair Oaks Avenue to the East, and Forest Avenue to the west. The neighborhood is bisected by I-210. The main roads through the neighborhood are Hammond Street and Lincoln Avenue.
Landmarks
Most of the commercial development in the neighborhood is on Fair Oaks and Lincoln Avenues, on either side of the neighborhood. Jackie Robinson Park is located on Fair Oaks and Hammond, and his childhood home is nearby.
On the east side of Sunset Avenue from Glorieta Avenue to Hammond Avenue the three houses are not part of the Banbury Oaks Landmark District. These neighbors chose not be included in the History Landmark status of the Banbury Oaks Landmark district in the city of Pasadena.
The Pasadena Historic Preservation Commission also covers the Banbury Oaks district.
Education
Banbury Oaks is served by Cleveland Elementary School in Muir Heights, Washington Middle School in La Pintoresca Park, Pasadena, California, and Muir High School in Muir Heights.
Transportation
Banbury Oaks is served by Metro Local lines 256, 660 and 662, as well as Pasadena Transit routes 31, 32, 51, and 52.
Banbury Oaks Neighborhood Association
Banbury Oaks Neighborhood Association, Pasadena, CA 91103, sets its boundaries at- Sunset Ave. between Claremont St. & Mountain St. including 1/2 block of Claremont; St. Between Glen Ave. & Sunset Ave.
References
External links
Pasadena City Council Agenda
Neighborhoods in Pasadena, California
|
```ruby
require "rails_helper"
RSpec.describe ApplicationHelper do
include CloudinaryHelper
describe "constant definitions" do
it "defines LARGE_USERBASE_THRESHOLD" do
expect(described_class::LARGE_USERBASE_THRESHOLD).to eq 1000
end
it "defines SUBTITLES" do
subtitles = {
"week" => "Top posts this week",
"month" => "Top posts this month",
"year" => "Top posts this year",
"infinity" => "All posts",
"latest" => "Latest posts"
}
expect(Class.new.include(described_class).new.subtitles).to eq subtitles
end
end
describe "#community_name" do
it "equals to the community name" do
allow(Settings::Community).to receive(:community_name).and_return("SLOAN")
expect(helper.community_name).to eq("SLOAN")
end
end
describe "#display_navigation_link?" do
subject(:method_call) { helper.display_navigation_link?(link: link) }
let(:link) { build(:navigation_link, display_to: display_to) }
before do
allow(helper).to receive(:user_signed_in?).and_return(user_signed_in)
allow(helper).to receive(:navigation_link_is_for_an_enabled_feature?)
.with(link: link)
.and_return(navigation_link_is_for_an_enabled_feature)
end
context "when user signed in and link requires signin and feature enabled" do
let(:navigation_link_is_for_an_enabled_feature) { true }
let(:display_to) { :logged_in }
let(:user_signed_in) { true }
it { is_expected.to be_truthy }
end
context "when user signed in and link requires signin and feature disabled" do
let(:display_to) { :all }
let(:user_signed_in) { true }
let(:navigation_link_is_for_an_enabled_feature) { false }
it { is_expected.to be_falsey }
end
context "when user signed in and link **does not** require signin and feature enabled" do
let(:navigation_link_is_for_an_enabled_feature) { true }
let(:display_to) { :all }
let(:user_signed_in) { true }
it { is_expected.to be_truthy }
end
context "when user signed in and link requires signout and feature enabled" do
let(:navigation_link_is_for_an_enabled_feature) { true }
let(:display_to) { :logged_out }
let(:user_signed_in) { true }
it { is_expected.to be_falsey }
end
context "when user signed in and link requires signout and feature disabled" do
let(:navigation_link_is_for_an_enabled_feature) { false }
let(:display_to) { :logged_out }
let(:user_signed_in) { true }
it { is_expected.to be_falsey }
end
context "when user signed in and link **does not** require signin and feature disabled" do
let(:navigation_link_is_for_an_enabled_feature) { false }
let(:display_to) { :all }
let(:user_signed_in) { true }
it { is_expected.to be_falsey }
end
context "when user **not** signed in and link requires signin and feature enabled" do
let(:navigation_link_is_for_an_enabled_feature) { true }
let(:display_to) { :logged_in }
let(:user_signed_in) { false }
it { is_expected.to be_falsey }
end
context "when user **not** signed in and link **does not** require signin and feature enabled" do
let(:navigation_link_is_for_an_enabled_feature) { true }
let(:display_to) { :all }
let(:user_signed_in) { false }
it { is_expected.to be_truthy }
end
context "when user **not** signed in and link **does not** require signin and feature disabled" do
let(:navigation_link_is_for_an_enabled_feature) { false }
let(:display_to) { :all }
let(:user_signed_in) { false }
it { is_expected.to be_falsey }
end
context "when user **not** signed in and link requires signout and feature enabled" do
let(:navigation_link_is_for_an_enabled_feature) { true }
let(:display_to) { :logged_out }
let(:user_signed_in) { false }
it { is_expected.to be_truthy }
end
context "when user **not** signed in and link requires signout and feature disabled" do
let(:navigation_link_is_for_an_enabled_feature) { false }
let(:display_to) { :logged_out }
let(:user_signed_in) { false }
it { is_expected.to be_falsey }
end
end
describe "#navigation_link_is_for_an_enabled_feature?" do
subject(:method_call) { helper.navigation_link_is_for_an_enabled_feature?(link: link) }
let(:url) { URL.url("/somehwere") }
let(:link) { build(:navigation_link, url: url) }
context "when Listing feature is enabled" do
before { allow(Listing).to receive(:feature_enabled?).and_return(true) }
it { is_expected.to be_truthy }
end
context "when Listing feature is disabled and link not for listing" do
before { allow(Listing).to receive(:feature_enabled?).and_return(false) }
it { is_expected.to be_truthy }
end
context "when Listing feature is disabled and link is for /listings" do
let(:url) { URL.url("/listings") }
before { allow(Listing).to receive(:feature_enabled?).and_return(false) }
it { is_expected.to be_falsey }
end
end
describe "#beautified_url" do
it "strips the protocol" do
expect(helper.beautified_url("path_to_url")).to eq("github.com")
end
it "strips params" do
expect(helper.beautified_url("path_to_url")).to eq("github.com")
end
it "strips the last forward slash" do
expect(helper.beautified_url("path_to_url")).to eq("github.com")
end
it "does not strip the path" do
expect(helper.beautified_url("path_to_url")).to eq("github.com/rails")
end
end
describe "#release_adjusted_cache_key" do
after { ForemInstance.instance_variable_set(:@deployed_at, nil) }
it "does nothing when RELEASE_FOOTPRINT is not set" do
allow(ApplicationConfig).to receive(:[]).with("RELEASE_FOOTPRINT").and_return(nil)
expect(helper.release_adjusted_cache_key("cache-me")).to include("cache-me")
end
it "appends the RELEASE_FOOTPRINT if it is set" do
allow(ApplicationConfig).to receive(:[]).with("RELEASE_FOOTPRINT").and_return("abc123")
expect(helper.release_adjusted_cache_key("cache-me")).to include("cache-me--abc123")
end
it "includes locale param if it is set" do
allow(ApplicationConfig).to receive(:[]).with("RELEASE_FOOTPRINT").and_return("abc123")
params[:locale] = "fr-ca"
expect(helper.release_adjusted_cache_key("cache-me")).to include("cache-me-fr-ca-abc123")
end
it "includes Settings::General.admin_action_taken_at" do
Timecop.freeze do
allow(Settings::General).to receive(:admin_action_taken_at).and_return(5.minutes.ago)
allow(ApplicationConfig).to receive(:[]).with("RELEASE_FOOTPRINT").and_return("abc123")
expect(helper.release_adjusted_cache_key("cache-me"))
.to include(Settings::General.admin_action_taken_at.rfc3339)
end
end
end
describe "#copyright_notice" do
let(:current_year) { Time.current.year.to_s }
context "when the start year and current year is the same" do
it "returns the current year only" do
allow(Settings::Community).to receive(:copyright_start_year).and_return(current_year)
expect(helper.copyright_notice).to eq(current_year)
end
end
context "when the start year and current year is different" do
it "returns the start and current year" do
allow(Settings::Community).to receive(:copyright_start_year).and_return("2014")
expect(helper.copyright_notice).to eq("2014 - #{current_year}")
end
end
context "when the start year is blank" do
it "returns the current year" do
allow(Settings::Community).to receive(:copyright_start_year).and_return(" ")
expect(helper.copyright_notice).to eq(current_year)
end
end
end
describe "#app_url" do
before do
allow(ApplicationConfig).to receive(:[]).with("APP_PROTOCOL").and_return("https://")
allow(ApplicationConfig).to receive(:[]).with("APP_DOMAIN").and_return("dev.to")
allow(Settings::General).to receive(:app_domain).and_return("dev.to")
end
it "creates the correct base app URL" do
expect(app_url).to eq("path_to_url")
end
it "creates a URL with a path" do
expect(app_url("admin")).to eq("path_to_url")
end
it "creates the correct URL even if the path starts with a slash" do
expect(app_url("/admin")).to eq("path_to_url")
end
it "works when called with an URI object" do
uri = URI::Generic.build(path: "resource_admin", fragment: "test").to_s
expect(app_url(uri)).to eq("path_to_url#test")
end
end
describe "#collection_link" do
let(:collection) { create(:collection, :with_articles) }
it "returns an 'a' tag" do
expect(helper.collection_link(collection)).to have_link
end
it "sets the correct href" do
expect(helper.collection_link(collection)).to have_link(href: collection.path)
end
it "has the correct text in the a tag" do
expect(helper.collection_link(collection))
.to have_text("#{collection.slug} (#{collection.articles.published.size} Part Series)")
end
end
describe "#contact_link" do
let(:default_email) { "hi@dev.to" }
before do
allow(ForemInstance).to receive(:contact_email).and_return(default_email)
end
it "returns an 'a' tag" do
expect(helper.contact_link).to have_link
end
it "sets the correct href" do
expect(helper.contact_link).to have_link(href: "mailto:#{default_email}")
end
it "has the correct text in the a tag" do
expect(helper.contact_link(text: "Link Name")).to have_text("Link Name")
expect(helper.contact_link).to have_text(default_email)
end
it "returns an href with additional_info parameters" do
additional_info = {
subject: "This is a long subject",
body: "This is a longer body with a question mark ? \n and a newline"
}
link = "<a href=\"mailto:#{default_email}?body=This%20is%20a%20longer%20body%20with%20a%20" \
"question%20mark%20%3F%20%0A%20and%20a%20newline&subject=This%20is%20a%20long%20subject\">text</a>"
expect(contact_link(text: "text", additional_info: additional_info)).to eq(link)
end
end
describe "#community_members_label" do
before do
allow(Settings::Community).to receive(:member_label).and_return("hobbyist")
end
it "returns the pluralized community_member_label" do
expect(community_members_label).to eq("hobbyists")
end
end
describe "#cloudinary", cloudinary: true do
it "returns cloudinary-manipulated link" do
image = helper.optimized_image_url(Faker::Placeholdit.image)
expect(image).to start_with("path_to_url")
.and include("image/fetch/", "/c_limit,f_auto,fl_progressive,q_80,w_500/")
end
it "returns an ASCII domain for Unicode input" do
expect(helper.optimized_image_url("path_to_url.dev/IMAGE.png")).to include("path_to_url")
end
it "keeps an ASCII domain as ASCII" do
expect(helper.optimized_image_url("path_to_url")).to include("path_to_url")
end
it "returns random fallback images as expected" do
expect(helper.optimized_image_url("")).not_to be_nil
expect(helper.optimized_image_url("", random_fallback: false)).to be_nil
end
end
describe "#optimized_image_tag" do
it "works just like cl_image_tag", cloudinary: true do
image_url = "path_to_url"
cloudinary_image_tag = cl_image_tag(image_url,
type: "fetch", crop: "fill",
quality: "auto", flags: "progressive",
fetch_format: "auto", sign_url: true,
loading: "lazy", alt: "profile image",
width: 100, height: 100)
optimized_helper = helper.optimized_image_tag(image_url,
optimizer_options: { crop: "crop", width: 100,
height: 100 },
image_options: { loading: "lazy", alt: "profile image" })
expect(optimized_helper).to eq(cloudinary_image_tag)
end
end
describe "#application_policy_content_tag" do
subject(:content) do
application_policy_content_tag("p", record: Article, query: :create?, class: "something") do
"My Content"
end
end
it "adds the policy related classes to the HTML tag element element" do
expect(content).to include(%(<p class="something js-policy-article-create">My Content</p>))
end
end
end
```
|
Concord Township is one of the five townships of Lake County, Ohio, United States. As of the 2020 census, the population was 19,254. Lake County is part of the Cleveland-Elyria, OH Metropolitan Statistical Area.
Geography
Located in the center of the county, it borders the following townships and municipalities:
Painesville Township - north
Perry Township - northeast corner
LeRoy Township - east
Hambden Township, Geauga County - southeast
Chardon Township, Geauga County - south
Kirtland Hills - southwest
Mentor - west
Painesville - northwest
According to the U.S. Census Bureau, Concord Township has an area of , of which are land and , or 0.58%, are water.
No municipalities are located in Concord Township.
The historical location of the unincorporated settlement of Concord is at the north end of Ohio State Route 608 where it meets Ravenna Road/County Highway 360 (former State Route 44), though most current development in the immediate area is located nearby at the intersection of current State Route 44 and Interstate 90.
Demographics
The population of Concord Township was estimated at 18,134 in 2016.
Name and history
Concord Township was established in 1822. The township's name commemorates the Battle of Concord in the American Revolutionary War. It is one of seven Concord Townships statewide.
Concord began holding Community Days in 1976 and has become an annual tradition ever since. Community Days has been held on Labor Day weekend from 1976 to 2012, when it was moved to the third weekend in August. Activities include a parade, auction, neighborhood softball tournament and fireworks show taking place at Concord Township Hall.
Government
The township is governed by a three-member board of trustees, who are elected in November of odd-numbered years to a four-year term beginning on the following January 1. Two are elected in the year after the presidential election and one is elected in the year before it. There is also an elected township fiscal officer, who serves a four-year term beginning on April 1 of the year after the election, which is held in November of the year before the presidential election. Vacancies in the fiscal officership or on the board of trustees are filled by the remaining trustees. As of 2020, the board members are Carl Dondorfer, Morgan McIntosh, and Amy Lucci, and the fiscal officer is Amy Dawson.
Public services
Transportation
In 2004, the township included approximately of roadways, nearly all of which are paved.
Education
Schools and school districts located in or near Concord Township include Auburn Career Center, Chardon Local Schools, The Goddard School, Hershey Montessori School, Lakeland Community College, Mentor Exempted Village School District, Riverside Local Schools, and St. Gabriel School.
The portion of Concord Township in the Mentor school district is divided between the zones of James A. Garfield Elementary School and Hopkins Elementary School. All of the Mentor school district section of Concord Township is zoned to Memorial Middle School. All students in the Mentor school district are zoned to Mentor High School.
Private/Independent Schools
Hershey Montessori School is an independent Montessori school located in Concord Township. It serves students from two months old through sixth grade. Its seventh through twelfth grade campus is located in nearby Huntsburg, Ohio.
Health
Concord is home to University Hospital Health System and Tri-Point Medical Center, a hospital part of Lake Health. It opened in late 2009.
Businesses
The largest employers are the local and county hospital systems, county government, and the public school systems.
Concord-Painesville JEDD
In 2008, Concord and nearby Painesville formed a Joint Economic Development District to foster economic growth. It consists of a designated area in Concord Township bound by Interstate route 90 and State Road 44. The major participants in the JEDD are University Hospital Health System, and various real estate development projects. Companies that participate in the JEDD receive tax benefits (based on jobs created), lower cost utilities, tax exemptions for capital improvements, and other benefits. In exchange they agree to a 1.75 percent sales tax which is divided between Concord, Painesville and the JEDD itself.
Other notable companies include:
Avery Dennison, Engineered Films, Regional Industrial and Healthcare Materials - the Concord plant produces extruded plastic materials, including thin sheets and adhesives used for labeling glass packaging and medical adhesives. The company also has research and production facilities in nearby Painesville and other northeast Ohio locations.
De Nora Tech – water treatment and purification, electroplating, electrical storage systems; headquartered in Italy with research and manufacturing plants in Concord Township and nearby Mentor, OH.
Fives Group - CITCO Tools – manufactures precision machinery for engineering glass, steel, plastics and other materials for use in the energy, metallurgy, aerospace, defense, and other industries. The Concord facility manufactures precision cutting tools and abrasives.
Ranpak – patented recyclable packing and packaging systems, headquartered in Concord with plants in Holland and Singapore.
Ricerca Biosciences – a contract research organization working with life-sciences and pharmaceutical companies to develop and test new compounds.
References
Further reading
External links
Townships in Lake County, Ohio
Urban townships in Ohio
Townships in Ohio
|
Hanover Township is a township in Northampton County, Pennsylvania. The population of Hanover Township was 10,866 at the 2010 census.
Hanover Township is northeast of Allentown, north of Philadelphia, and west of New York City. Hanover Township is part of the Lehigh Valley metropolitan area, which has a population of 861,899 and is the 68th-most populated metropolitan area in the U.S. as of the 2020 census.
Geography
According to the U.S. Census Bureau, the township has a total area of , all land. It is drained by Monocacy Creek and Catasauqua Creek into the Lehigh River. Its villages include Hanoverville, Schoenersville, Stoke Park, and Westgate Hills. Hanover Township is a suburb of the city of Bethlehem, which lies just south of Hanover. Officially, the township has never been considered as a section of the city of Bethlehem, rather just a neighboring community with a strong connection to its large municipal neighbor to the south.
Neighboring municipalities
East Allen Township (north)
Lower Nazareth Township (northeast)
Bethlehem Township (east)
Bethlehem (southeast and southwest)
Hanover Township, Lehigh County (west)
Demographics
As of the census of 2010, there were 10,866 people, 4,245 households, and 3,144 families residing in the township. The population density was . There were 4,245 housing units at an average density of . The racial makeup of the township was 87.12% White, 2.74% African American, 0.05% Native American, 6.53% Asian, 1.44% from other races, and 2.12% from two or more races. Hispanic or Latino of any race were 4.83% of the population.
There were 3,633 households, out of which 32.8% had children under the age of 18 living with them, 69.1% were married couples living together, 5.3% had a female householder with no husband present, and 23.4% were non-families. 20.3% of all households were made up of individuals, and 9.4% had someone living alone who was 65 years of age or older. The average household size was 2.59 and the average family size was 3.01.
In the township, the population was spread out, with 24.7% under the age of 18, 4.5% from 18 to 24, 26.3% from 25 to 44, 27.0% from 45 to 64, and 17.8% who were 65 years of age or older. The median age was 44.5 years. For every 100 females, there were 94.1 males. For every 100 females age 18 and over, there were 91.6 males. The median income for a household in the township was $64,889, and the median income for a family was $72,661. Males had a median income of $53,158 versus $33,569 for females. The per capita income for the township was $29,370. About 2.0% of families and 2.2% of the population were below the poverty line, including 1.9% of those under age 18 and 2.9% of those age 65 or over.
Government
Hanover is a Second Class Township, governed by a five person elected Board of Supervisors. Day-to-day operations are overseen by a township manager. Hanover is represented in the Pennsylvania House of Representatives as part of both the 135th Legislative District (voting districts 1, 2, 3, 4, and 6) and the 138th District (voting district 5), both of which districts include other municipalities in Northampton County. The township is represented in the Pennsylvania Senate as part of the 14th District, which includes parts of Lehigh and Northampton Counties. The township is patrolled by the Colonial Regional Police Department. Fire and rescue services are provided by the Hanover Township Volunteer Fire Department.
On the national level, Hanover is a part of Pennsylvania's 7th congressional district, and is currently represented by Susan Wild. The state's senior (Class II) member of the United States Senate, is Bob Casey Jr., who was elected in 2006. The junior (Class I) senator, elected in 2022, is John Fetterman.
Transportation
As of 2020, there were of public roads in Hanover Township, of which were maintained by the Pennsylvania Department of Transportation (PennDOT) and were maintained by the township.
U.S. Route 22 is the most prominent highway serving Hanover Township. It follows the Lehigh Valley Thruway along a southwest-northeast alignment across the southern and eastern portions of the township. Pennsylvania Route 512 begins at US 22 in the eastern portion of the township and heads north along the Bath Pike. Pennsylvania Route 987 follows Airport Road along a north-south alignment across the western portion of the township. Other local roads of note include east-to-west Hanoverville Road, Macada Road, and Stoke Park Road and north-to-south Jacksonville Road and Township Line Road.
Education
The township is served by the Bethlehem Area School District. Asa Packer and Hanover elementary schools are located within the township. Lehigh Valley Academy, a charter school that uses the International Baccalaureate academic program, is also located in the township.
Gallery
References
External links
Official township website
Townships in Northampton County, Pennsylvania
Townships in Pennsylvania
|
Proxima Midnight is a supervillain appearing in American comic books published by Marvel Comics. Created by writer Jonathan Hickman, she first appeared in New Avengers #8 (September 2013). She is a prominent member of the Black Order working for Thanos.
The character has made several appearances in media, such as animated television series, the Marvel Cinematic Universe films Avengers: Infinity War and Avengers: Endgame with Carrie Coon voicing the role, and video games. Coon returned to voice an alternate timeline version of the character in the Disney+ animated series What If...? (2021).
Publication history
Proxima Midnight debuted in New Avengers #8 (September 2013), created by writer Jonathan Hickman. She later appeared in the 2013 Infinity series. She appeared in the 2017 Unworthy Thor series.
Fictional character biography
Proxima Midnight is a member of Thanos' Black Order. Thanos chose her for her expert combatant skills. Proxima is the wife of fellow Order member Corvus Glaive. She was sent to Earth to retrieve an Infinity Gem from Namor, but came into contact with the New Avengers. She battled Spectrum and Luke Cage where she found herself evenly matched. She was humiliated by Thanos' disapproval of her actions as well as the fact that Namor did not actually possess the Gem. Proxima and the rest of the Order were directed by Namor to Wakanda to search for the Gem, but were distracted when Ebony Maw revealed the location of Thane, Thanos' son. Thane wanted nothing to do with his father and imprisoned him and Proxima in amber where they were taken to Necropolis.
Namor freed Proxima, as well as Thanos, and asked that they join his Cabal due to his own anger towards Earth. However, Namor soon found himself hating the Cabal's tactics and vowed to work with the Illuminati to defeat them. Namor himself was betrayed and found himself and the Cabal stuck on an earth that was to be destroyed. They all managed to escape into the Ultimate Marvel Universe and vowed to get their revenge. They crafted a "life raft" and managed to live past the destruction of all universes. The Cabal ended up on Battleworld where they proceeded to attack the locals. However, God Emperor Doom dispersed the group to the various corners of Battleworld and Proxima, along with Corvus Glaive, were imprisoned by Apocalypse.
She managed to return to her own home when the Mainstream Marvel Universe was rebuilt. She met up with Thanos and a cloaked figure, later revealed to be Hela, and teamed up with her to retrieve Mjolnir. Their quest would lead them into battling Thor, Beta Ray Bill, The Collector and others. Ultimately, Proxima and Hela were humiliated and forced to return empty handed. To prove herself worthy, Hela killed Proxima in front of Thanos, adding one last humiliation for her.
During the "No Surrender" arc Challenger revived Proxima Midnight when the Black Order was reformed with Black Swan, Ebony Maw, a psychic projection of Supergiant, and a revived Black Dwarf and Corvus Glaive. The group competed with an alien version of the Lethal Legion formed by Grandmaster in a contest where Earth is the battlefield.
Powers and abilities
Proxima Midnight possesses the typical attributes of a super powered individual including superhuman strength, speed, endurance and durability. Being able to survive planetary reentry without injury, she was also a master combatant and owned a spear created from a star trapped in a quantum singularity by Thanos himself.
The spear is capable of drastic harm based on how it is thrown and who it is used against, becoming a multi-pronged lance of poisonous energy that follows their target, never missing. Said force was fatal to whomever it pierced, killing the victim in minutes. It could revert to star form, gaining infinite mass which weighed down prey in an energy entanglement. This effect could even bind and revert an enraged Hulk back to Bruce Banner upon removal.
In other media
Television
Proxima Midnight appears in Avengers Assemble, voiced by Kari Wahlgren.
Proxima Midnight appears in Guardians of the Galaxy, voiced again by Kari Wahlgren. While initially a member of the Black Order, she later becomes a member of the Universal Believers.
Marvel Cinematic Universe
Proxima Midnight appears in media set in the Marvel Cinematic Universe, with Carrie Coon providing the voice and facial capture of the character. Stuntwoman Monique Ganderton also physically portrayed her through motion capture.
She is introduced in the live-action film Avengers: Infinity War. She is a member of the Black Order and assists her father Thanos in finding the Infinity Stones. While attempting to claim the Mind Stone, she and her husband Corvus Glaive attack Wanda Maximoff and Vision. However, they are repelled by Steve Rogers, Natasha Romanoff, and Sam Wilson. During a second attempt, Midnight attempts to kill Maximoff, only to be stopped by Romanoff and Okoye before Maximoff kills Midnight.
An alternate timeline version of Proxima Midnight appears in the live-action film Avengers: Endgame, with Monique Ganderton reprising her role without Carrie Coon due to Midnight having no dialogue. She travels through time with Thanos to stop the Avengers from foiling Thanos' plans. She is disintegrated after Tony Stark uses the Infinity Stones.
An alternate timeline version of Proxima Midnight appears in the Disney+ animated series What If...?, voiced again by Carrie Coon.
Video games
Proxima Midnight appeared as a mini-boss and a boss in Marvel Avengers Alliance.
Proxima Midnight appears as a support character in Marvel Puzzle Quest.
Proxima Midnight appears as a mini-boss and unlockable playable character in Marvel Contest of Champions.
Proxima Midnight appears as a boss and unlockable playable character in Marvel Future Fight.
Proxima Midnight appeared as a boss in Marvel Avengers Academy during the "Return of A-Force" event.
Proxima Midnight appears as an unlockable playable character in Lego Marvel Super Heroes 2. She is part of the DLC "Marvel's Avengers: Infinity War Movie Level Pack."
Proxima Midnight appeared as a playable character in Marvel End Time Arena.
Proxima Midnight appears as a boss in Marvel Ultimate Alliance 3: The Black Order, voiced again by Kari Wahlgren.
References
External links
Proxima Midnight at the Marvel Wiki
Characters created by Jonathan Hickman
Comics characters introduced in 2013
Female characters in film
Female soldier and warrior characters in comics
Fictional polearm and spearfighters
Marvel Comics aliens
Marvel Comics characters who can move at superhuman speeds
Marvel Comics characters with superhuman durability or invulnerability
Marvel Comics characters with superhuman strength
Marvel Comics extraterrestrial supervillains
Marvel Comics female supervillains
Marvel Comics film characters
|
Mark DeCarlo is an American actor, television host, comedian, travel, internet personality, and foodie expert. He is currently known for being a contributor to WLS-TV morning show Windy City Live, a locally produced Chicago program that replaced The Oprah Winfrey Show following its 2011 ending. DeCarlo has been awarded three local Emmy Awards for his work on Windy City Live.
DeCarlo's first major exposure came in 1991 when he became host of the dating game show Studs. He is also known for providing the voice of Hugh Neutron, the title character's father in The Adventures of Jimmy Neutron, Boy Genius for Nickelodeon and for portraying Alec Berg in the Seinfeld episode, “The Face Painter”. DeCarlo authored “A Fork on the Road: 400 Cities, 1 Stomach” which is a comedic travelogue & cook book published by Lyons Press.
DeCarlo rose to influencer-style fame on the internet in July 2021 when Hugh Neutron gained a meme-centric cult following, in an attempt to get the Jimmy Neutron character into the Nickelodeon All-Star Brawl video game.
Career
Acting
Prior to Studs, DeCarlo was a host on the cable network MovieTime before it became E! Entertainment Television. Early in his career, DeCarlo was a contestant on Sale of the Century, winning $115,257 in cash and prizes in 1985, and Tic Tac Dough in 1990. He also guest-starred as himself in an episode of Jonas and is now a regular on Windy City Live, a local morning show in the Chicago market.
DeCarlo hosted two more TV shows, Fox's extreme game show, Big Deal, and FX's late night talk show The X Show. He appeared on the game show Street Smarts in 2002, playing against Mark L. Walberg as part of a "Game Show Showdown", and lost the game with $1 to Walberg's $2. Since it was a charity episode, he still earned $500 for the M.S. Society of America. In 2005, DeCarlo starred in Sex Sells: The Making of Touché.
DeCarlo appeared on an episode of the show Interior Therapy with Jeff Lewis on Bravo that aired May 16, 2012. He co-hosted the TV series THIS vs THAT that premiered internationally in November 2012. He also had a small role on HBO's Curb Your Enthusiasm.
In 2013, he hosted EconomicalECO, a how-to series that popularized ways to radically reduce the cost of living by choosing economical American products.
On a 1992 episode of Studs, DeCarlo hosted Ronald Goldman, at the time an aspiring actor who become well known 2 years later after being murdered along with Nicole Brown Simpson in Los Angeles on June 12, 1994, which led to the arrest and Trial of O.J. Simpson.
Voice-over acting
DeCarlo was the voice of Hugh Neutron on the Nickelodeon computer-animated series The Adventures of Jimmy Neutron, Boy Genius. His voice over career includes roles in Back at the Barnyard, Planet Sheen, Johnny Bravo, Handy Manny and the Thumb series of comedies: Thumb Wars, BaTThumb and Thumbtanic.
Travel & foodie expert
DeCarlo hosted the Travel Channel's Taste of America with Mark DeCarlo for two seasons in 2004 and 2005, and is also known as the host of the early 1990s dating game show, Studs and the short-lived 1996 game show Big Deal.
In September 2022, DeCarlo and his wife, Yeni Álvarez, resumed travel for their podcast, A Fork on the Road, which they began in 2017 but set aside due to the Covid-19 Pandemic.
Internet icon
DeCarlo hosts an internet sitcom called The Boffo the Bear Show, via Facebook Live and YouTube. Mark portrays a pompous blue bear in Hollywood who runs his own interview talk show and game show. The realtime-CGI technology created for Boffo was programmed by Julian Sarmiento, Global Director of Virtual Production and Real-Time at FuseFX. Mark has held several interview panels with his Boffo character using this technology at comic-con conventions.
On July 13, 2021, GameMill Entertainment announced Nickelodeon All-Star Brawl, a platform-fighter video game for Fall 2021. The same day as the announcement trailer, the hashtag "#HughNation" and Hugh Neutron began to trend on Twitter, as memes of Mark's character becoming a playable fighter in the video game circulated. What started as a joke began to build a serious cult following for DeCarlo's character to be included. As a result, a Discord server for DeCarlo's fanbase got DeCarlo himself involved, in which he fueled the community's desire for the character to be added. DeCarlo further interacted with his fans by reading submitted memes via Twitter, and later through his Cameo page.
On May 13, 2022, GameMill Entertainment released a reveal trailer for Nickelodeon All-Star Brawl'''s newest DLC fighters, including Hugh Neutron, which DeCarlo and his fanbase had been rallying for since the game's reveal. On August 5th, 2022, Hugh Neutron released as a paid downloadable fighter for the game. On the DLC's release day, DeCarlo and Debi Derryberry commentated a Nickelodeon All-Star Brawl'' tournament, consisting of twelve online content creators.
Personal life
DeCarlo graduated from Benet Academy high school in 1980. He later graduated from UCLA. He married voice actress Yeni Álvarez on November 24, 2012. Being a Chicago native, he is also an avid Chicago Cubs fan as well and is often seen wearing various Cubs merch.
References
External links
Mark DeCarlo Official Website
Mark DeCarlo tells his story of losing seventy pounds
Mark DeCarlo at AVOTalent.com
Male actors from Chicago
Contestants on American game shows
American game show hosts
Drake University alumni
Living people
Year of birth missing (living people)
|
Gate Mudaliyar Naganather Canaganayagam, CBE, JP, FREconS (27 May 1892 - 1 January 1967) was a Ceylonese banker, planter and local politician, who served as the first Tamil Mayor of Kandy in 1942.
Suriyakumara Nichinga Senathiraja Ambalavaner Naganather Thandigai Canaganayagam was born on 27 May 1892 in Kopay, Jaffna, the son of Atikar Ambalavaner Naganather CBE JP, UM (1850-1953), a banker and rubber plantation owner, and Sethuppillai Ampalavanar. Canaganayagam attended Saint Joseph's College, Colombo, where he won prizes for Latin, French and Physics. He then attended the Ceylon Medical School leaving in his second year to become a banker. In 1912 he was appointed the head shroff of the National Bank of India in Nuwara Eliya, succeeding his father. Canaganayayagam passed the associate examination of the Institute of Bankers in 1925, and was made a Fellow of the Royal Economic Society. Later that year he was transferred to the bank's branch in Kandy, where he remained until he retired.
In 1939 he was elected to the first Kandy Municipal Council, representing Ward #9 (Wevelpitiya), remaining on the council until 1945. He served as both as the deputy mayor in 1941 and the mayor in 1942, becoming the first Tamil mayor of the council. He was an actively involved in a number of local religious and social organisations in Kandy. Canaganayagam was awarded the titular honor of Gate Mudliyar by the British Government of Ceylon, and appointed an Officer of the Order of the British Empire in the 1951 New Year Honours. In the 1955 Queen's Birthday Honours Canaganayagam was made a Commander of the British Empire for his public services. He was a member of the Planters' Association, Low Country Planters' Association and the Kandy National Museum Advisory Committee.
He died on 1 January 1967 at the age of 74. In May 1992 he was commemorated as a National Hero through the issue of a Rs. 100 postage stamp with his portrait. The University of Peradeniya's Department of Economics and Statistics issues an annual prize in economics in his name.
External links
Kandy Municipal Council
References
1892 births
1967 deaths
Alumni of Saint Joseph's College, Colombo
Ceylonese Commanders of the Order of the British Empire
Fellows of the Royal Economic Society
Gate Mudaliyars
Mayors of Kandy
People from Jaffna District
People from British Ceylon
Sri Lankan Tamil bankers
Sri Lankan Tamil businesspeople
Tamil politicians
|
```java
/*
This file is part of the iText (R) project.
Authors: Apryse Software.
This program is offered under a commercial and under the AGPL license.
For commercial licensing, contact us at path_to_url For AGPL licensing, see below.
AGPL licensing:
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
*/
package com.itextpdf.kernel.pdf.function;
import com.itextpdf.commons.utils.MessageFormatUtil;
import com.itextpdf.kernel.exceptions.KernelExceptionMessageConstant;
import com.itextpdf.kernel.pdf.PdfName;
import com.itextpdf.kernel.pdf.colorspace.PdfSpecialCs.Separation;
import com.itextpdf.test.ExtendedITextTest;
import java.io.IOException;
import java.nio.file.Files;
import java.nio.file.Paths;
import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import org.junit.jupiter.api.Tag;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import static org.junit.jupiter.api.Assertions.assertEquals;
@Tag("UnitTest")
public class BaseInputOutPutConvertorsTest extends ExtendedITextTest {
private static final String SOURCE_FOLDER = "./src/test/resources/com/itextpdf/kernel/pdf/function/BaseInputOutPutConvertorsTest/";
private static final String DESTINATION_FOLDER = "./target/test/com/itextpdf/kernel/pdf/function/BaseInputOutPutConvertorsTest/";
@Test
public void testByteInputConvertor() throws IOException {
BaseInputOutPutConvertors.IInputConversionFunction inputConvertor = BaseInputOutPutConvertors.getInputConvertor(1, 1);
BaseInputOutPutConvertors.IOutputConversionFunction outputConvertor = BaseInputOutPutConvertors.getOutputConvertor(1, 1);
byte[] original = Files.readAllBytes(Paths.get(SOURCE_FOLDER, "texture-time-gray scale medium.data"));
PdfType2Function
fnct1 = new PdfType2Function(new double[] {0,1},
new double[] {0,1,0,1,0,1},
new double[] {0, 0, 0},
new double[] {0, 0.5, 0, },
1);
Separation sep1 = new Separation(new PdfName("SEP_RGB"), PdfName.DeviceRGB, fnct1.getPdfObject());
byte[] calc = sep1.getTintTransformation().calculateFromByteArray(original,0, original.length,1,1);
double[] result = inputConvertor.convert(original,0, original.length);
byte[] roundtrip = outputConvertor.convert(result);
assertArrayEquals(original, roundtrip);
}
@Test
public void testInvalidOffsetAndLength() throws IOException {
BaseInputOutPutConvertors.IInputConversionFunction inputConvertor = BaseInputOutPutConvertors.getInputConvertor(1, 1);
BaseInputOutPutConvertors.IOutputConversionFunction outputConvertor = BaseInputOutPutConvertors.getOutputConvertor(1, 1);
byte[] original = Files.readAllBytes(Paths.get(SOURCE_FOLDER, "texture-time-gray scale medium.data"));
PdfType2Function
fnct1 = new PdfType2Function(new double[] {0,1},
new double[] {0,1,0,1,0,1},
new double[] {0, 0, 0},
new double[] {0, 0.5, 0, },
1);
Separation sep1 = new Separation(new PdfName("SEP_RGB"), PdfName.DeviceRGB, fnct1.getPdfObject());
IPdfFunction func = sep1.getTintTransformation();
Exception ex = Assertions.assertThrows(IllegalArgumentException.class, () ->
func.calculateFromByteArray(original, 10, original.length, 1, 1));
assertEquals(KernelExceptionMessageConstant.INVALID_LENGTH, ex.getMessage());
}
@Test
public void testInvalidLengthForWordSize() throws IOException {
BaseInputOutPutConvertors.IInputConversionFunction inputConvertor = BaseInputOutPutConvertors.getInputConvertor(
1, 1);
BaseInputOutPutConvertors.IOutputConversionFunction outputConvertor = BaseInputOutPutConvertors.getOutputConvertor(1, 1);
byte[] original = Files.readAllBytes(Paths.get(SOURCE_FOLDER, "texture-time-gray scale medium.data"));
PdfType2Function
fnct1 = new PdfType2Function(new double[] {0,1},
new double[] {0,1,0,1,0,1},
new double[] {0, 0, 0},
new double[] {0, 0.5, 0, },
1);
Separation sep1 = new Separation(new PdfName("SEP_RGB"), PdfName.DeviceRGB, fnct1.getPdfObject());
IPdfFunction func = sep1.getTintTransformation();
Exception ex = Assertions.assertThrows(IllegalArgumentException.class, () ->
func.calculateFromByteArray(original, 0, original.length, 11*8, 1));
assertEquals(MessageFormatUtil.format(KernelExceptionMessageConstant.INVALID_LENGTH_FOR_WORDSIZE, 11), ex.getMessage());
}
}
```
|
```java
/**
* Tencent is pleased to support the open source community by making MSEC available.
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software distributed under the
*/
package beans.response;
import ngse.org.JsonRPCResponseBase;
import java.util.ArrayList;
/**
* Created by Administrator on 2016/1/27.
*/
public class AddSecondLevelServiceIPInfoResponse extends JsonRPCResponseBase {
ArrayList<String> addedIPs;
public ArrayList<String> getAddedIPs() {
return addedIPs;
}
public void setAddedIPs(ArrayList<String> addedIPs) {
this.addedIPs = addedIPs;
}
}
```
|
```java
/*
* This Source Code Form is subject to the terms of the Mozilla Public
* file, You can obtain one at path_to_url
*/
package com.vaticle.typedb.core.test.behaviour.query.language.fetch;
import io.cucumber.junit.Cucumber;
import io.cucumber.junit.CucumberOptions;
import org.junit.runner.RunWith;
@RunWith(Cucumber.class)
@CucumberOptions(
strict = true,
plugin = "pretty",
glue = "com.vaticle.typedb.core.test.behaviour",
features = "external/vaticle_typedb_behaviour/query/language/fetch.feature",
tags = "not @ignore and not @ignore-typedb"
)
public class FetchTest {
// ATTENTION:
// When you click RUN from within this class through Intellij IDE, it will fail.
// You can fix it by doing:
//
// 1) Go to 'Run'
// 2) Select 'Edit Configurations...'
// 3) Select 'Bazel test GetTest'
//
// 4) Ensure 'Target Expression' is set correctly:
// a) Use '//<this>/<package>/<name>:test-core' to test against typedb
// b) Use '//<this>/<package>/<name>:test-kgms' to test against typedb-cluster
//
// 5) Update 'Bazel Flags':
// a) Remove the line that says: '--test_filter=com.vaticle.typedb.core.*'
// b) Use the following Bazel flags:
// --cache_test_results=no : to make sure you're not using cache
// --test_output=streamed : to make sure all output is printed
// --subcommands : to print the low-level commands and execution paths
// --sandbox_debug : to keep the sandbox not deleted after test runs
// --spawn_strategy=standalone : if you're on Mac, tests need permission to access filesystem (to run TypeDB)
//
// 6) Hit the RUN button by selecting the test from the dropdown menu on the top bar
}
```
|
De tre måske fire is a 1939 Danish family film directed by Lau Lauritzen Jr. and Alice O'Fredericks.
Cast
Victor Borge as Kontorist
Lau Lauritzen as Kontorist
Poul Reichhardt as Kontorist
Per Gundmann as Kontorist
Børge Munch Petersen as Kontorchef
Henry Gleditsch as Generaldirektør
Betty Söderberg as Generaldirektørens forlovede
Inge-Lise Rune as Generaldirektørens sekretær
Erika Voigt as Generaldirektørens bogholderske
Eigil Reimers as Generaldirektørens chauffør
Gull-Maj Norin as En Svensk dame
Gunnar Lauring as Hendes kompagnion
Knud Almar as En gammel mand
Sigurd Langberg as En tjener
References
External links
1939 films
1930s Danish-language films
Danish black-and-white films
Films directed by Lau Lauritzen Jr.
Films directed by Alice O'Fredericks
|
```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 org.thingsboard.server.common.data.oauth2;
public enum PlatformType {
WEB, ANDROID, IOS
}
```
|
Gaurena is a genus of moths belonging to the subfamily Thyatirinae of the Drepanidae. It was erected by Francis Walker in 1865.
Species
Gaurena albifasciata Gaede, 1931
Gaurena argentisparsa Hampson, 1896
Gaurena aurofasciata Hampson, 1892
Gaurena delattini Werny, 1966
Gaurena florens Walker, 1865
Gaurena florescens Walker, 1865
Gaurena forsteri Werny, 1966
Gaurena gemella Leech, 1900
Gaurena grisescens Oberthür, 1894
Gaurena margaritha Werny, 1966
Gaurena nigrescens Werny, 1966
Gaurena olivacea Houlbert, 1921
Gaurena pretiosa Werny, 1966
Gaurena roesleri Werny, 1966
Gaurena sinuata Warren, 1912
Gaurena watsoni Werny, 1966
Former species
Gaurena dierli Werny, 1966
Gaurena fletcheri Werny, 1966
References
(1865). List of Specimens of Lepidopterous Insects in the Collection of the British Museum 32: 619.
(2007). "The Thyatiridae of Eurasia including the Sundaland and New Guinea (Lepidoptera)". Esperiana Buchreihe zur Entomologie. Band 13: 1–683.
Thyatirinae
Drepanidae genera
|
```go
package synchronized_setup_tests_test
import (
. "github.com/onsi/ginkgo"
. "github.com/onsi/gomega"
"fmt"
"os"
"testing"
)
func TestSynchronized_setup_tests(t *testing.T) {
RegisterFailHandler(Fail)
RunSpecs(t, "Synchronized_setup_tests Suite")
}
var beforeData string
var _ = SynchronizedBeforeSuite(func() []byte {
fmt.Printf("BEFORE_A_%d\n", GinkgoParallelNode())
os.Exit(1)
return []byte("WHAT EVZ")
}, func(data []byte) {
println("NEVER SEE THIS")
})
var _ = Describe("Synchronized Setup", func() {
It("should do nothing", func() {
(true).Should(BeTrue())
})
It("should do nothing", func() {
(true).Should(BeTrue())
})
})
```
|
```php
<?php
/*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* This software consists of voluntary contributions made by many individuals
* and is licensed under the MIT license. For more information, see
* <path_to_url
*/
namespace Doctrine\Common\Cache;
/**
* Base class for cache provider implementations.
*
* @since 2.2
* @author Benjamin Eberlei <kontakt@beberlei.de>
* @author Guilherme Blanco <guilhermeblanco@hotmail.com>
* @author Jonathan Wage <jonwage@gmail.com>
* @author Roman Borschel <roman@code-factory.org>
* @author Fabio B. Silva <fabio.bat.silva@gmail.com>
*/
abstract class CacheProvider implements Cache, FlushableCache, ClearableCache, MultiGetCache
{
const DOCTRINE_NAMESPACE_CACHEKEY = 'DoctrineNamespaceCacheKey[%s]';
/**
* The namespace to prefix all cache ids with.
*
* @var string
*/
private $namespace = '';
/**
* The namespace version.
*
* @var integer|null
*/
private $namespaceVersion;
/**
* Sets the namespace to prefix all cache ids with.
*
* @param string $namespace
*
* @return void
*/
public function setNamespace($namespace)
{
$this->namespace = (string) $namespace;
$this->namespaceVersion = null;
}
/**
* Retrieves the namespace that prefixes all cache ids.
*
* @return string
*/
public function getNamespace()
{
return $this->namespace;
}
/**
* {@inheritdoc}
*/
public function fetch($id)
{
return $this->doFetch($this->getNamespacedId($id));
}
/**
* {@inheritdoc}
*/
public function fetchMultiple(array $keys)
{
// note: the array_combine() is in place to keep an association between our $keys and the $namespacedKeys
$namespacedKeys = array_combine($keys, array_map(array($this, 'getNamespacedId'), $keys));
$items = $this->doFetchMultiple($namespacedKeys);
$foundItems = array();
// no internal array function supports this sort of mapping: needs to be iterative
// this filters and combines keys in one pass
foreach ($namespacedKeys as $requestedKey => $namespacedKey) {
if (isset($items[$namespacedKey])) {
$foundItems[$requestedKey] = $items[$namespacedKey];
}
}
return $foundItems;
}
/**
* {@inheritdoc}
*/
public function contains($id)
{
return $this->doContains($this->getNamespacedId($id));
}
/**
* {@inheritdoc}
*/
public function save($id, $data, $lifeTime = 0)
{
return $this->doSave($this->getNamespacedId($id), $data, $lifeTime);
}
/**
* {@inheritdoc}
*/
public function delete($id)
{
return $this->doDelete($this->getNamespacedId($id));
}
/**
* {@inheritdoc}
*/
public function getStats()
{
return $this->doGetStats();
}
/**
* {@inheritDoc}
*/
public function flushAll()
{
return $this->doFlush();
}
/**
* {@inheritDoc}
*/
public function deleteAll()
{
$namespaceCacheKey = $this->getNamespaceCacheKey();
$namespaceVersion = $this->getNamespaceVersion() + 1;
$this->namespaceVersion = $namespaceVersion;
return $this->doSave($namespaceCacheKey, $namespaceVersion);
}
/**
* Prefixes the passed id with the configured namespace value.
*
* @param string $id The id to namespace.
*
* @return string The namespaced id.
*/
private function getNamespacedId($id)
{
$namespaceVersion = $this->getNamespaceVersion();
return sprintf('%s[%s][%s]', $this->namespace, $id, $namespaceVersion);
}
/**
* Returns the namespace cache key.
*
* @return string
*/
private function getNamespaceCacheKey()
{
return sprintf(self::DOCTRINE_NAMESPACE_CACHEKEY, $this->namespace);
}
/**
* Returns the namespace version.
*
* @return integer
*/
private function getNamespaceVersion()
{
if (null !== $this->namespaceVersion) {
return $this->namespaceVersion;
}
$namespaceCacheKey = $this->getNamespaceCacheKey();
$namespaceVersion = $this->doFetch($namespaceCacheKey);
if (false === $namespaceVersion) {
$namespaceVersion = 1;
$this->doSave($namespaceCacheKey, $namespaceVersion);
}
$this->namespaceVersion = $namespaceVersion;
return $this->namespaceVersion;
}
/**
* Default implementation of doFetchMultiple. Each driver that supports multi-get should owerwrite it.
*
* @param array $keys Array of keys to retrieve from cache
* @return array Array of values retrieved for the given keys.
*/
protected function doFetchMultiple(array $keys)
{
$returnValues = array();
foreach ($keys as $index => $key) {
if (false !== ($item = $this->doFetch($key))) {
$returnValues[$key] = $item;
}
}
return $returnValues;
}
/**
* Fetches an entry from the cache.
*
* @param string $id The id of the cache entry to fetch.
*
* @return string|boolean The cached data or FALSE, if no cache entry exists for the given id.
*/
abstract protected function doFetch($id);
/**
* Tests if an entry exists in the cache.
*
* @param string $id The cache id of the entry to check for.
*
* @return boolean TRUE if a cache entry exists for the given cache id, FALSE otherwise.
*/
abstract protected function doContains($id);
/**
* Puts data into the cache.
*
* @param string $id The cache id.
* @param string $data The cache entry/data.
* @param int $lifeTime The lifetime. If != 0, sets a specific lifetime for this
* cache entry (0 => infinite lifeTime).
*
* @return boolean TRUE if the entry was successfully stored in the cache, FALSE otherwise.
*/
abstract protected function doSave($id, $data, $lifeTime = 0);
/**
* Deletes a cache entry.
*
* @param string $id The cache id.
*
* @return boolean TRUE if the cache entry was successfully deleted, FALSE otherwise.
*/
abstract protected function doDelete($id);
/**
* Flushes all cache entries.
*
* @return boolean TRUE if the cache entries were successfully flushed, FALSE otherwise.
*/
abstract protected function doFlush();
/**
* Retrieves cached information from the data store.
*
* @since 2.2
*
* @return array|null An associative array with server's statistics if available, NULL otherwise.
*/
abstract protected function doGetStats();
}
```
|
```c++
//
// detail/keyword_tss_ptr.hpp
// ~~~~~~~~~~~~~~~~~~~~~~~~~~
//
//
// file LICENSE_1_0.txt or copy at path_to_url
//
#ifndef ASIO_DETAIL_KEYWORD_TSS_PTR_HPP
#define ASIO_DETAIL_KEYWORD_TSS_PTR_HPP
#if defined(_MSC_VER) && (_MSC_VER >= 1200)
# pragma once
#endif // defined(_MSC_VER) && (_MSC_VER >= 1200)
#include "asio/detail/config.hpp"
#if defined(ASIO_HAS_THREAD_KEYWORD_EXTENSION)
#include "asio/detail/noncopyable.hpp"
#include "asio/detail/push_options.hpp"
namespace asio {
namespace detail {
template <typename T>
class keyword_tss_ptr
: private noncopyable
{
public:
// Constructor.
keyword_tss_ptr()
{
}
// Destructor.
~keyword_tss_ptr()
{
}
// Get the value.
operator T*() const
{
return value_;
}
// Set the value.
void operator=(T* value)
{
value_ = value;
}
private:
static ASIO_THREAD_KEYWORD T* value_;
};
template <typename T>
ASIO_THREAD_KEYWORD T* keyword_tss_ptr<T>::value_;
} // namespace detail
} // namespace asio
#include "asio/detail/pop_options.hpp"
#endif // defined(ASIO_HAS_THREAD_KEYWORD_EXTENSION)
#endif // ASIO_DETAIL_KEYWORD_TSS_PTR_HPP
```
|
```swift
import Foundation
import KsApi
import Library
import Prelude
import UIKit
internal final class BackerDashboardProjectCell: UITableViewCell, ValueCell {
fileprivate let viewModel: BackerDashboardProjectCellViewModelType = BackerDashboardProjectCellViewModel()
@IBOutlet fileprivate var cardView: UIView!
@IBOutlet fileprivate var mainContentContainerView: UIView!
@IBOutlet fileprivate var metadataBackgroundView: UIView!
@IBOutlet fileprivate var metadataIconImageView: UIImageView!
@IBOutlet fileprivate var metadataLabel: UILabel!
@IBOutlet fileprivate var metadataStackView: UIStackView!
@IBOutlet fileprivate var percentFundedLabel: UILabel!
@IBOutlet fileprivate var projectNameLabel: UILabel!
@IBOutlet fileprivate var projectImageView: UIImageView!
@IBOutlet fileprivate var progressStaticView: UIView!
@IBOutlet fileprivate var progressBarView: UIView!
@IBOutlet fileprivate var savedIconImageView: UIImageView!
internal func configureWith(value: Project) {
self.viewModel.inputs.configureWith(project: value)
}
internal override func bindViewModel() {
self.metadataBackgroundView.rac.backgroundColor = self.viewModel.outputs.metadataBackgroundColor
self.metadataLabel.rac.text = self.viewModel.outputs.metadataText
self.metadataIconImageView.rac.hidden = self.viewModel.outputs.metadataIconIsHidden
self.percentFundedLabel.rac.attributedText = self.viewModel.outputs.percentFundedText
self.projectNameLabel.rac.attributedText = self.viewModel.outputs.projectTitleText
self.projectImageView.rac.ksr_imageUrl = self.viewModel.outputs.photoURL
self.progressBarView.rac.backgroundColor = self.viewModel.outputs.progressBarColor
self.progressBarView.rac.hidden = self.viewModel.outputs.prelaunchProject
self.progressStaticView.rac.hidden = self.viewModel.outputs.prelaunchProject
self.percentFundedLabel.rac.hidden = self.viewModel.outputs.prelaunchProject
self.savedIconImageView.rac.hidden = self.viewModel.outputs.savedIconIsHidden
self.viewModel.outputs.progress
.observeForUI()
.observeValues { [weak element = progressBarView] progress in
let anchorX = progress == 0 ? 0 : 0.5 / progress
element?.layer.anchorPoint = CGPoint(x: CGFloat(max(anchorX, 0.5)), y: 0.5)
element?.transform = CGAffineTransform(scaleX: CGFloat(min(progress, 1.0)), y: 1.0)
}
}
internal override func bindStyles() {
super.bindStyles()
_ = self
|> baseTableViewCellStyle()
|> UITableViewCell.lens.isAccessibilityElement .~ true
|> UITableViewCell.lens.accessibilityHint %~ { _ in Strings.Opens_project() }
|> UITableViewCell.lens.accessibilityTraits .~ UIAccessibilityTraits.button
|> UITableViewCell.lens.contentView.layoutMargins %~~ { _, cell in
cell.traitCollection.isRegularRegular
? .init(topBottom: Styles.grid(2), leftRight: Styles.grid(20))
: .init(topBottom: Styles.grid(1), leftRight: Styles.grid(2))
}
_ = self.cardView
|> cardStyle()
_ = self.mainContentContainerView
|> UIView.lens.layoutMargins .~ .init(
top: Styles.gridHalf(3),
left: Styles.grid(2),
bottom: Styles.grid(1),
right: Styles.grid(2)
)
_ = self.metadataBackgroundView
|> UIView.lens.layer.borderColor .~ UIColor.ksr_white.cgColor
|> UIView.lens.layer.borderWidth .~ 1.0
_ = self.metadataStackView
|> UIStackView.lens.layoutMargins .~ .init(topBottom: Styles.grid(30), leftRight: Styles.grid(20))
_ = self.metadataLabel
|> UILabel.lens.textColor .~ .ksr_white
|> UILabel.lens.font .~ .ksr_headline(size: 12)
_ = self.metadataIconImageView
|> UIImageView.lens.tintColor .~ .ksr_white
_ = self.percentFundedLabel
|> UILabel.lens.backgroundColor .~ .ksr_white
_ = self.projectNameLabel
|> UILabel.lens.backgroundColor .~ .ksr_white
_ = self.progressStaticView
|> UIView.lens.backgroundColor .~ .ksr_support_700
|> UIView.lens.alpha .~ 0.15
_ = self.projectImageView
|> ignoresInvertColorsImageViewStyle
_ = self.savedIconImageView
|> UIImageView.lens.tintColor .~ .init(white: 1.0, alpha: 0.99)
}
}
```
|
```smalltalk
namespace Nez.AI.BehaviorTrees
{
/// <summary>
/// will repeat execution of its child task until the child task has been run a specified number of times. It has the option of
/// continuing to execute the child task even if the child task returns a failure.
/// </summary>
public class Repeater<T> : Decorator<T>
{
/// <summary>
/// The number of times to repeat the execution of its child task
/// </summary>
public int Count;
/// <summary>
/// Allows the repeater to repeat forever
/// </summary>
public bool RepeatForever;
/// <summary>
/// Should the task return if the child task returns a failure
/// </summary>
public bool EndOnFailure;
int _iterationCount;
public Repeater(int count, bool endOnFailure = false)
{
Count = count;
EndOnFailure = endOnFailure;
}
public Repeater(bool repeatForever, bool endOnFailure = false)
{
RepeatForever = repeatForever;
EndOnFailure = endOnFailure;
}
public override void OnStart()
{
_iterationCount = 0;
}
public override TaskStatus Update(T context)
{
Insist.IsNotNull(Child, "child must not be null");
// early out if we are done. we check here and after running just in case the count is 0
if (!RepeatForever && _iterationCount == Count)
return TaskStatus.Success;
var status = Child.Tick(context);
_iterationCount++;
if (EndOnFailure && status == TaskStatus.Failure)
return TaskStatus.Success;
if (!RepeatForever && _iterationCount == Count)
return TaskStatus.Success;
return TaskStatus.Running;
}
}
}
```
|
Barrett Martin (born April 14, 1967) is an American record producer, percussionist, writer, and ethnomusicologist from Washington. As a producer he has won one Latin Grammy and has been nominated in two other categories. As an ethnomusicologist he has produced two albums for the Shipibo Shamans in the Peruvian Amazon Rainforest, and one album for the Neets'ai Gwich'in in the Alaskan Arctic. He is perhaps best known for his work with the alternative rock bands Screaming Trees and Mad Season. He was also a member of Skin Yard, Tuatara, and Walking Papers, and has performed as a session musician for many artists in a wide variety of genres.
Biography
Martin was born and raised in Olympia, Washington, and studied music for two years at Western Washington University before dropping out and moving to Seattle to join that city's late-1980s alternative rock scene. He later earned bachelor's and master's degrees in ethnomusicology from the University of New Mexico graduating Summa Cum Laude
Martin joined Skin Yard in 1990 and played on their fourth and fifth studio albums. While still a member of Skin Yard, Martin was recruited by Screaming Trees and played on their successful 1992 album Sweet Oblivion. He then joined Screaming Trees full-time and remained with that band until it split in 2000. In the meantime, Martin formed the grunge supergroup Mad Season with Mike McCready, Layne Staley, and Baker Saunders; that band released the album Above in 1995, after which the members returned to their full-time bands. Martin formed another supergroup, Tuatara, in 1996 with Peter Buck; Martin produced nine albums with this group until it split in 2014.
Martin was ordained as a Zen monk in 2000, and started the company Sunyata Records & Books (now known as Sunyata Media) in 2001. He began recording as Barrett Martin Group in 2004, and has released ten studio albums under that name. He was appointed adjunct professor of ethnomusicology at Antioch University-Seattle from 2010 to 2017.
Martin formed the supergroup Walking Papers with Jeff Angell and Duff McKagan in 2012, and played on that band's first two albums. In 2013 he started writing a music and culture blog for The Huffington Post, and frequently writes for Riot Material. Martin won the ASCAP Deems Taylor/Virgil Thomson Award in 2014 for his writing. He formed yet another supergroup, Levee Walkers, with McKagan and McCready in 2016.
In 2016, Martin produced the album Jardim-Pomar by Brazilian musician Nando Reis, which won a Latin Grammy the following year. In 2017, Martin published the book The Singing Earth, recounting his musical experiences in multiple genres and nations. His second book The Way of the Zen Cowboy was published in 2019. In recent years he has produced albums for CeDell Davis (Even The Devil Gets The Blues) and Ayron Jones Joy Harjo (I Pray For My Enemies), Hector Tellez Jr.
Discography
Barrett Martin Group
The Painted Desert – 2004
Earthspeaker – 2006
Zenga – 2009
Atlas – 2011
Artifact – 2012
Transcendence - 2018
Songs of the Firebird - 2019
Indwell - 2019
Stillpoint - 2020
Mad Season
Above – 1995
Above (Deluxe Edition) - 2013
Screaming Trees
Sweet Oblivion – 1992
Dust – 1996
Last Words: The Final Recordings – 2011
Shipibo Shamans
Woven Songs Of The Amazon - 2006
Woven Songs Of The Amazon II - 2019
Skin Yard
1000 Smiling Knuckles – 1991
Inside the Eye – 1993
Start at the Top – 2001
Tuatara
Breaking the Ethers – 1997
Trading with the Enemy – 1998
Cinematheque – 2002
The Loading Program – 2003
East of the Sun – 2007
West of the Moon – 2007
The Here and the Gone – 2009
Underworld – 2014
Shamanic Nights: Live in the City – 2016
Walking Papers
Walking Papers – 2012
WP2 – 2018
Others
Thin Men – A Round Hear – 1989
Mike Johnson – Where Am I – 1994
Various Artists – Working Class Hero – 1995
Seaweed – Spanaway – 1995
Mike Johnson – Year of Mondays – 1996
Luna – Pup Tent – 1997
Mark Eitzel – West – 1997
Protein – Ever Since I was a Kid – 1997
Various Artists – Flying Traps – 1997
R.E.M. – Up – 1998
Mark Lanegan – I'll Take Care of You – 1999
Stone Temple Pilots – No. 4 – 1999
Various Artists – More Oar – 1999
Victoria Williams – Water to Drink – 2000
Mark Olson – My Own Jo Ellen – 2000
The Twilight Singers – Twilight as Played by The Twilight Singers – 2000
Nando Reis – Para Quando o Arco-Íris Encontrar o Pote de Ouro – 2000
Queens of the Stone Age – Rated R – 2000
Therapy? – Shameless – 2001
Nando Reis – Infernal – 2001
CeDell Davis – When Lightning Struck the Pine – 2002
Alex Veley – Maconha Baiana – 2003
Nando Reis – A Letra A – 2003
Nero – Confession No. 1 – 2003
Roger Greenway – Wayt – 2004
Jack Endino – Permanent Fatal Error – 2005
Shipibo Shamans – Woven Songs of the Amazon – 2006
Bola Abimbola – Ara Kenge – 2006
Dave Carter – Commitment and Change – 2008
Under The Rose – Under The Rose – 2009
Rusty Willoughby – CoBirds Unite – 2010
Nando Reis e Os Infernais – Sei – 2012
Mark Lanegan – Imitations – 2013
Vaudeville Etiquette – Debutantes & Dealers – 2014
CeDell Davis – Last Man Standing – 2015
CeDell Davis – Even The Devil Gets The Blues – 2016
Buffalo Summer - Second Sun - 2016
Ayron Jones - Audio Paint Job - 2017
Various Artists - The Singing Earth - 2017
Levee Walkers & Ayron Jones - 2017
Walking Papers - WP2 - 2018
Barrett Martin Group - Transcendence - 2018
Shipibo Shamans - Woven Songs Of The Amazon II - 2019
Barrett Martin Group - Songs Of The Firebird - 2019
Barrett Martin Group - Indwell - 2019
Barrett Martin Group - Scattered Diamonds - 2020
Arctic Neets'ai Gwich'in - A Message To The World - 2020
Buffalo Summer - Desolation Blue - 2020
Joy Harjo - I Pray For My Enemies - 2021
Ayron Jones - Child Of The State - 2021
Barrett Martin Group - Stillpoint - 2021
Jack Endino – Set Myself On Fire - 2021
Film soundtracks
Deceiver – 1998
The Best Men – 1999
Lush – 1999
The Fog Ravens – 2003
Ausangate – 2006
Woven Songs of the Amazon – 2006
The Last Bluesman – 2022
References
External links
1967 births
Living people
Musicians from Olympia, Washington
American rock drummers
Grunge musicians
Mad Season (band) members
Screaming Trees members
Singers from Washington (state)
R.E.M. personnel
Western Washington University alumni
The Minus 5 members
Tuatara (band) members
Rumi scholars
20th-century American drummers
American male drummers
Skin Yard members
|
The First Hundred Years is the first ongoing TV soap opera in the United States that began as a daytime serial, airing on CBS from December 4, 1950 until June 27, 1952. A previous daytime drama on NBC, These Are My Children, aired in 1949 but only lasted one month, and NBC's Hawkins Falls began in June 1950 as a primetime "soap" and didn't move to daytime until April 1951.
The show began with the wedding of Chris Thayer and Connie Martin, which lasted for the first week of episodes. The couple settled down in a huge, unkept white elephant mansion, a present from Connie's father.
The series did not succeed due to very low viewership, as few American households had television sets, and fewer still watched during the afternoon.
The series was replaced with the television version of Guiding Light, which would prove to be much more successful, airing for 57 years (72 years total when its 15-year run on radio is taken into account).
See also
Hubert Schlafly, invented the Teleprompter for this series
References
External links
American television soap operas
CBS original programming
1950 American television series debuts
1952 American television series endings
Television series by Procter & Gamble Productions
Black-and-white American television shows
English-language television shows
CBS network soap operas
|
The Banco León (Léon Bank) was a banking company in the Dominican Republic, which was formally introduced at a ceremony attended by former Dominican President Hipólito Mejía on December 2, 2003. The bank represents a union between the Banco Profesional and Banco Nacional de Credito (Bancredito). The Léon Jimenes family, which controls the León Jimenez Group, Ltd is better known for its distribution in the Dominican Republic of Marlboro cigarettes, as well as for their Aurora cigars and Presidente beer brands operations. The current president of the bank is Mr. Carlos Guillermo León, and its corporate headquarters are in Santo Domingo, Dominican Republic.
Financial performance from 2004 to 2005
From its beginnings the bank has embarked on a process of reconstruction with the goal of improving the financial situation of Bancrédito at the time of the acquisition. Net profits for 2005 amounted to RD$151.8 million, 37,9% more than 2004. Banco León operates 75 branches and 176 automatic teller machines throughout the country.
Consolidation of credit card operations, among other initiatives, generated the reduction of administrative expenses in excess of RD$100 million from 2004 to 2005 and the conversion of more than RD$5,000 million worth of unproductive assets into productive ones. According to the 2005 financial statement, the profit margin for the year was RD$697,9 million, 130% more than in 2004. Loans increased to RD$12,299 million, an increase of 30.6% since 2004. Capital reserves reached RD$1,668 million, a 10.4% increase with respect to 2004. Total deposits increased to RD$19,967 million, an increase of 4,1%, and a liquidity ratio of 39%, very superior to the required bank reserve of 20 percent.
Activities
In an effort to obtain greater efficiency, during the 2005 Banco León consolidated credit card operations with those of the bank, relocated automatic branches and tellers to strategic locations and unified service centers. During February 2004 Banco León announced that it has now made available for commercial and personal clients a service by which property taxes can be paid to the Internal Taxes Agency from any locality via their Internet banking service. Recently, the Exchange Superintendence of the Dominican Republic announced on March 25, 2006, its approval for Banco Léon to issue public bonds for a total of RD$306 million. The recently approved bonds for Banco Leon were the first of 2006, with the offer mainly being addressed to institutional investors, pension funds and insurance companies.
See also
Banks of the Dominican Republic
References
External links
Banco León
Banks of the Dominican Republic
Brands of the Dominican Republic
|
The 1986–87 European Cup was the 27th edition of Europe's premier club handball tournament.
Knockout stage
Round 1
|}
Round 2
|}
Quarterfinals
|}
Semifinals
|}
Finals
|}
External links
EHF Champions League website
European Cup 1987 edition
EHF Champions League seasons
Champions League
Champions League
|
```smalltalk
Extension { #name : 'LazyListMorph' }
{ #category : '*Polymorph-Widgets' }
LazyListMorph >> themeChanged [
self color: self theme textColor.
super themeChanged
]
```
|
The Best Of Sonny & Chér is the first compilation album by American pop duo Sonny & Cher, released on August 12 1967 by Atlantic/ATCO Records. It is one of their best selling albums in the US, reaching number 23 and spending 64 weeks on the Billboard albums chart.
Album information
The Best of Sonny & Chér contains Sonny and Cher's hits released through Atco from 1965 to 1967, including "The Beat Goes On", "I Got You Babe", "But You're Mine" and "Little Man". The duo's first major hit, "Baby Don't Go", is not included in the album, as it was owned and released by Reprise Records prior to Sonny and Cher's signing with Atco.
This compilation was also remastered in the 1991 compilation The Beat Goes On: The Best Of Sonny & Cher alongside many other tracks. The original The Best of Sonny & Chér compilation album in its entirety remains unreleased on compact disc.
Track listing
All tracks composed by Sonny Bono; except where indicated
Side A
"The Beat Goes On" - 3:23
"What Now My Love" (Carl Sigman, Gilbert Bécaud, Pierre Delanoë) - 3:28
"I Got You Babe" - 3:11
"Little Man" - 3:15
"Just You" - 3:36
"Let It Be Me" (Gilbert Bécaud, Mann Curtis, Pierre Delanoë) - 2:25
Side B
"A Beautiful Story" - 2:52
"It's the Little Things" - 3:31
"But You're Mine" - 3:02
"Sing C'est La Vie" (Bono, Charles Greene, Brian Stone) - 3:39
"Laugh At Me" - 2:50
"Living For You" - 3:30
Charts
Credits
Personnel
Main vocals: Cher
Main vocals: Sonny Bono
Production
Sonny Bono: Producer
References
Sonny & Cher albums
1967 greatest hits albums
Atco Records compilation albums
Atlantic Records compilation albums
Albums produced by Sonny Bono
|
```smalltalk
//
//
// 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.
namespace AsmDude.QuickInfo
{
using System.ComponentModel.Composition;
using AsmDude.Tools;
using Microsoft.VisualStudio.Language.Intellisense;
using Microsoft.VisualStudio.Text;
using Microsoft.VisualStudio.Text.Editor;
using Microsoft.VisualStudio.Text.Tagging;
using Microsoft.VisualStudio.Utilities;
[Export(typeof(IAsyncQuickInfoSourceProvider))]
[ContentType(AsmDudePackage.AsmDudeContentType)]
[TextViewRole(PredefinedTextViewRoles.Debuggable)]
[Name("AsmQuickInfoSourceProvider")]
[Order]
internal sealed class QuickInfoSourceProvider : IAsyncQuickInfoSourceProvider
{
[Import]
private readonly IBufferTagAggregatorFactoryService aggregatorFactory_ = null;
[Import]
private readonly ITextDocumentFactoryService docFactory_ = null;
[Import]
private readonly IContentTypeRegistryService contentService_ = null;
public IAsyncQuickInfoSource TryCreateQuickInfoSource(ITextBuffer textBuffer)
{
AsmDudeToolsStatic.Output_INFO(string.Format(AsmDudeToolsStatic.CultureUI, "{0}:TryCreateQuickInfoSource", this.ToString()));
AsmQuickInfoSource sc()
{
LabelGraph labelGraph = AsmDudeToolsStatic.GetOrCreate_Label_Graph(textBuffer, this.aggregatorFactory_, this.docFactory_, this.contentService_);
AsmSimulator asmSimulator = AsmSimulator.GetOrCreate_AsmSimulator(textBuffer, this.aggregatorFactory_);
return new AsmQuickInfoSource(textBuffer, this.aggregatorFactory_, labelGraph, asmSimulator);
}
return textBuffer.Properties.GetOrCreateSingletonProperty(sc);
}
}
}
```
|
```objective-c
#pragma once
#include <cstdint>
namespace search::index { class FieldLengthCalculator; }
namespace search::memoryindex {
class FieldIndexRemover;
class IOrderedFieldIndexInserter;
/**
* Interface class for a field index collection which can be used to
* get the parts needed for wiring in field inverters.
*/
class IFieldIndexCollection {
public:
virtual FieldIndexRemover &get_remover(uint32_t field_id) = 0;
virtual IOrderedFieldIndexInserter &get_inserter(uint32_t field_id) = 0;
virtual index::FieldLengthCalculator &get_calculator(uint32_t field_id) = 0;
virtual ~IFieldIndexCollection() = default;
};
}
```
|
```go
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
package datareq
import (
"math"
"runtime"
"sort"
"time"
"github.com/apache/trafficcontrol/v8/lib/go-tc"
"github.com/apache/trafficcontrol/v8/lib/go-util"
"github.com/apache/trafficcontrol/v8/traffic_monitor/config"
"github.com/apache/trafficcontrol/v8/traffic_monitor/peer"
"github.com/apache/trafficcontrol/v8/traffic_monitor/threadsafe"
"github.com/json-iterator/go"
)
type JSONStats struct {
Stats Stats `json:"stats"`
}
// Stats contains statistics data about this running app. Designed to be returned via an API endpoint.
type Stats struct {
MaxMemoryMB uint64 `json:"Max Memory (MB),string"`
GitRevision string `json:"git-revision"`
ErrorCount uint64 `json:"Error Count,string"`
Uptime uint64 `json:"uptime,string"`
FreeMemoryMB uint64 `json:"Free Memory (MB),string"`
TotalMemoryMB uint64 `json:"Total Memory (MB),string"`
Version string `json:"version"`
DeployDir string `json:"deploy-dir"`
FetchCount uint64 `json:"Fetch Count,string"`
QueryIntervalDelta int `json:"Query Interval Delta,string"`
IterationCount uint64 `json:"Iteration Count,string"`
Name string `json:"name"`
BuildTimestamp string `json:"buildTimestamp"`
QueryIntervalTarget int `json:"Query Interval Target,string"`
QueryIntervalActual int `json:"Query Interval Actual,string"`
SlowestCache string `json:"Slowest Cache"`
LastQueryInterval int `json:"Last Query Interval,string"`
Microthreads int `json:"Goroutines"`
LastGC string `json:"Last Garbage Collection"`
MemAllocBytes uint64 `json:"Memory Bytes Allocated"`
MemTotalBytes uint64 `json:"Total Bytes Allocated"`
MemSysBytes uint64 `json:"System Bytes Allocated"`
OldestPolledPeer string `json:"Oldest Polled Peer"`
OldestPolledPeerMs int64 `json:"Oldest Polled Peer Time (ms)"`
QueryInterval95thPercentile int64 `json:"Query Interval 95th Percentile (ms)"`
GCCPUFraction float64 `json:"gc-cpu-fraction"`
}
func srvStats(staticAppData config.StaticAppData, healthPollInterval time.Duration, lastHealthDurations threadsafe.DurationMap, fetchCount threadsafe.Uint, healthIteration threadsafe.Uint, errorCount threadsafe.Uint, peerStates peer.CRStatesPeersThreadsafe) ([]byte, error) {
return getStats(staticAppData, healthPollInterval, lastHealthDurations.Get(), fetchCount.Get(), healthIteration.Get(), errorCount.Get(), peerStates)
}
func getStats(staticAppData config.StaticAppData, pollingInterval time.Duration, lastHealthTimes map[tc.CacheName]time.Duration, fetchCount uint64, healthIteration uint64, errorCount uint64, peerStates peer.CRStatesPeersThreadsafe) ([]byte, error) {
longestPollCache, longestPollTime := getLongestPoll(lastHealthTimes)
var memStats runtime.MemStats
runtime.ReadMemStats(&memStats)
var s Stats
s.MaxMemoryMB = memStats.TotalAlloc / (1024 * 1024)
s.GitRevision = staticAppData.GitRevision
s.ErrorCount = errorCount
s.Uptime = uint64(time.Since(staticAppData.StartTime) / time.Second)
s.FreeMemoryMB = staticAppData.FreeMemoryMB
s.TotalMemoryMB = memStats.Alloc / (1024 * 1024) // TODO rename to "used memory" if/when nothing is using the JSON entry
s.Version = staticAppData.Version
s.DeployDir = staticAppData.WorkingDir
s.FetchCount = fetchCount
s.SlowestCache = string(longestPollCache)
s.IterationCount = healthIteration
s.Name = staticAppData.Name
s.BuildTimestamp = staticAppData.BuildTimestamp
s.QueryIntervalTarget = int(pollingInterval / time.Millisecond)
s.QueryIntervalActual = int(longestPollTime / time.Millisecond)
s.QueryIntervalDelta = s.QueryIntervalActual - s.QueryIntervalTarget
s.LastQueryInterval = int(math.Max(float64(s.QueryIntervalActual), float64(s.QueryIntervalTarget)))
s.Microthreads = runtime.NumGoroutine()
s.LastGC = time.Unix(0, int64(memStats.LastGC)).String()
s.MemAllocBytes = memStats.Alloc
s.MemTotalBytes = memStats.TotalAlloc
s.MemSysBytes = memStats.Sys
s.GCCPUFraction = memStats.GCCPUFraction
oldestPolledPeer, oldestPolledPeerTime := oldestPeerPollTime(peerStates.GetQueryTimes(), peerStates.GetPeersOnline())
s.OldestPolledPeer = string(oldestPolledPeer)
s.OldestPolledPeerMs = time.Now().Sub((oldestPolledPeerTime)).Nanoseconds() / util.MSPerNS
s.QueryInterval95thPercentile = getCacheTimePercentile(lastHealthTimes, 0.95).Nanoseconds() / util.MSPerNS
json := jsoniter.ConfigDefault
return json.Marshal(JSONStats{Stats: s})
}
func getLongestPoll(lastHealthTimes map[tc.CacheName]time.Duration) (tc.CacheName, time.Duration) {
var longestCache tc.CacheName
var longestTime time.Duration
for cache, time := range lastHealthTimes {
if time > longestTime {
longestTime = time
longestCache = cache
}
}
return longestCache, longestTime
}
type Durations []time.Duration
func (s Durations) Len() int {
return len(s)
}
func (s Durations) Less(i, j int) bool {
return s[i] < s[j]
}
func (s Durations) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
// getCacheTimePercentile returns the given percentile of cache result times. The `percentile` should be a decimal percent, for example, for the 95th percentile pass 0.95
func getCacheTimePercentile(lastHealthTimes map[tc.CacheName]time.Duration, percentile float64) time.Duration {
times := make([]time.Duration, 0, len(lastHealthTimes))
for _, t := range lastHealthTimes {
times = append(times, t)
}
sort.Sort(Durations(times))
n := int(float64(len(lastHealthTimes)) * percentile)
return times[n]
}
func oldestPeerPollTime(peerTimes map[tc.TrafficMonitorName]time.Time, peerOnline map[tc.TrafficMonitorName]bool) (tc.TrafficMonitorName, time.Time) {
now := time.Now()
oldestTime := now
oldestPeer := tc.TrafficMonitorName("")
for p, t := range peerTimes {
if !peerOnline[p] {
continue
}
if oldestTime.After(t) {
oldestTime = t
oldestPeer = p
}
}
if oldestTime == now {
oldestTime = time.Time{}
}
return oldestPeer, oldestTime
}
```
|
```objective-c
function single_layer_classification_hw()
% This file is associated with the book
% "Machine Learning Refined", Cambridge University Press, 2016.
% by Jeremy Watt, Reza Borhani, and Aggelos Katsaggelos.
minx = -1;
maxx = 1;
% load/make function to approximate
num_its = 1;
[X,y] = load_data(num_its);
M = 4; % number of hidden units
%%% Main: perform gradient descent to fit tanh basis sum %%%
for j = 1:num_its
subplot(1,num_its,j)
[b,w,c,V] = tanh_softmax(X',y,M);
% plot resulting fit
hold on
plot_separator(b,w,c,V,X,y);
end
%%%%%%%%%%%% subfunctions %%%%%%%%%%%%%
%%% gradient descent for single layer tanh nn %%%
function [b,w,c,V] = tanh_softmax(X,y,M)
% initializations
[N,P] = size(X);
b = randn(1);
w = randn(M,1);
c = randn(M,1);
V = randn(N,M);
l_P = ones(P,1);
% stoppers
max_its = 10000;
grad = 1;
count = 1;
%%% main %%%
while count <= max_its && norm(grad) > 10^-5
F = obj(c,V,X);
% calculate gradients
% ---> grad_b =
% ---> grad_w =
% ---> grad_c =
% ---> grad_V =
% determine steplength
% alpha = adaptive_step();
alpha = 10^-2;
% take gradient steps
b = b - alpha*grad_b;
w = w - alpha*grad_w;
c = c - alpha*grad_c;
V = V - alpha*grad_V;
% update stoppers
count = count + 1;
end
norm(grad)
function p = adaptive_step()
g_n = norm(grad)^2;
step_l = 1;
step_r = 0;
u = 1;
p = 1;
while step_l > step_r && u < 30
p = p*0.7;
% left
F = obj(c - p*grad_c,V - p*grad_V,X);
o2 = sum(log(1 + exp(-y.*((b - p*grad_b) + F'*(w - p*grad_w)))));
step_l = o2 - o;
% right
step_r = -(p*g_n)/2;
u = u + 1;
end
end
end
function y = sigmoid(z)
y = 1./(1+exp(-z));
end
function F = obj(z,H,A)
F = zeros(M,size(A,2));
for p = 1:size(A,2)
F(:,p) = tanh(z + H'*A(:,p));
end
end
% load data
function [A,b] = load_data(num_its)
data = csvread('genreg_data.csv');
A = data(:,1:end - 1);
b = data(:,end);
for j = 1:num_its
subplot(1,num_its,j)
% plot data
hold on
ind = find(b == 1);
red = [ 1 0 .4];
scatter(A(ind,1),A(ind,2),'Linewidth',2,'Markeredgecolor',red,'markerFacecolor','none')
hold on
ind = find(b == -1);
blue = [ 0 .4 1];
scatter(A(ind,1),A(ind,2),'Linewidth',2,'Markeredgecolor',blue,'markerFacecolor','none')
end
end
% plot the seprator + surface
function plot_separator(b,w,c,V,X,y)
% plot determined surface in 3d space
s = [minx:0.01:maxx];
[s1,s2] = meshgrid(s,s);
s1 = reshape(s1,numel(s1),1);
s2 = reshape(s2,numel(s2),1);
g = zeros(length(s1),1);
for i = 1:length(s1)
t = [s1(i);s2(i)];
F = obj(c,V,t);
g(i) = tanh(b + F'*w);
end
s1 = reshape(s1,[length(s),length(s)]);
s2 = reshape(s2,[length(s),length(s)]);
g = reshape(g,[length(s),length(s)]); % divide by # for visualization purposes only!
alpha(0.4)
% plot contour in original space
hold on
contour(s1,s2,g,[0,0],'Color','k','LineWidth',2)
axis([0 1 0 1])
% graph info labels
xlabel('x_1','Fontsize',16)
ylabel('x_2 ','Fontsize',16)
set(get(gca,'YLabel'),'Rotation',0)
axis square
set(gcf,'color','w');
end
end
```
|
IAM Cycling was a Swiss registered UCI WorldTour cycling team. It is managed by former French road race champion Serge Beucherie.
The title sponsor was IAM Independent Asset Management SA, a Swiss investment management company.
History
2013
The team was officially launched in January 2013. IAM Cycling is a member of the Mouvement pour un cyclisme crédible. IAM Cycling was selected as a wild-card entry for the 2013 Paris–Nice race.
2014
On 22 August 2013 the team announced that it had signed Sylvain Chavanel and Jérôme Pineau from , Mathias Frank from and Roger Kluge from for the 2014 season. On 28 January it was announced that IAM Cycling had been granted a "wild card" entry to Tour de France 2014, its first Grand Tour. It also raced the Vuelta a España. Subsequently, in December 2014 the UCI announced that the team would be granted a WorldTour licence for the 2015 season.
2015
2016
In May 2016, the team announced they would fold at the end of the season due to not being able to secure a secondary sponsor.
Final roster (2016)
Major wins
2013
Overall Tour Méditerranéen, Thomas Löfkvist
Stage 1 Circuit de la Sarthe, Matteo Pelucchi
Tour de Berne, Marcel Wyss
Time Trial Championships, Matthias Brändle
Stage 5 Bayern Rundfahrt, Heinrich Haussler
Time Trial Championships, Gustav Larsson
Road Race Championships, Aleksejs Saramotins
Trofeo Matteotti, Sébastien Reichenbach
Overall Tour du Limousin, Martin Elmiger
Stage 1, Martin Elmiger
Tour du Jura, Matthias Brändle
Tour du Doubs, Aleksejs Saramotins
2014
Stage 2 Tirreno–Adriatico, Matteo Pelucchi
Stage 3 Critérium International, Mathias Frank
Stage 3 Four Days of Dunkirk, Sylvain Chavanel
Tour de Berne, Matthias Brändle
Stage 1 Bayern Rundfahrt, Heinrich Haussler
Stage 2 Bayern Rundfahrt, Mathias Frank
Time Trial Championships, Sylvain Chavanel
Time Trial Championships, Matthias Brändle
Road Race Championships, Martin Elmiger
Stage 2 Vuelta a Burgos, Matteo Pelucchi
Stage 5 (ITT) Vuelta a Burgos, Aleksejs Saramotins
Overall Tour du Poitou-Charentes, Sylvain Chavanel
Stage 4 (ITT), Sylvain Chavanel
GP Ouest–France, Sylvain Chavanel
Stages 5 & 6 Tour of Britain, Matthias Brändle
Chrono des Nation, Sylvain Chavanel
2015
Road Race Championships, Heinrich Haussler
Trofeo Santanyi-Ses Salines-Campos, Matteo Pelucchi
Trofeo Playa de Palma-Palma, Matteo Pelucchi
Stage 6 Tour of Oman, Matthias Brändle
Prologue Tour of Belgium, Matthias Brändle
Prologue Ster ZLM Toer, Roger Kluge
Time Trial Championships, Jérôme Coppel
Road Race Championships, Aleksejs Saramotins
Stage 1 Tour of Austria, Sondre Holst Enger
Stage 2 Tour of Austria, David Tanner
Stage 4 Tour de Wallonie, Jonas van Genechten
Stages 2 & 3 Tour de Pologne, Matteo Pelucchi
2016
Grand Prix d'Ouverture La Marseillaise, Dries Devenyns
Clásica de Almería, Leigh Howard
Overall Étoile de Bessèges, Jérôme Coppel
Stage 5 (ITT), Jérôme Coppel
Stage 6 Tour of Croatia, Sondre Holst Enger
Stage 17 Giro d'Italia, Roger Kluge
Overall Tour of Belgium, Dries Devenyns
Stage 2, Dries Devenyns
Stage 9 Tour de Suisse, Jarlinson Pantano
Road Race Championships, Matthias Brändle
Time Trial Championships, Matthias Brändle
Road Race Championships, Jonathan Fumeaux
Stage 15 Tour de France, Jarlinson Pantano
Overall Tour de Wallonie, Dries Devenyns
Stage 5, Dries Devenyns
Stage 7 Vuelta a España, Jonas van Genechten
Bretagne Classic Ouest–France, Oliver Naesen
Stage 16 Vuelta a España, Mathias Frank
Supplementary statistics
National champions
2013
Austrian Time Trial Matthias Brändle
Swedish Time Trial Gustav Larsson
Latvian Road Race Aleksejs Saramotins
2014
French Time Trial Sylvain Chavanel
Austrian Time Trial Matthias Brändle
Swiss Road Race Martin Elmiger
2015
Australian Road Race Heinrich Haussler
French Time Trial Jérôme Coppel
Latvian Road Race Aleksejs Saramotins
2016
Austrian Road Race Matthias Brändle
Austrian Time Trial Matthias Brändle
Swiss Road Race Jonathan Fumeaux
References
External links
Former UCI WorldTeams
Cycling teams established in 2013
Cycling teams disestablished in 2016
Cycling teams based in Switzerland
Defunct cycling teams based in Switzerland
|
```tex
\documentclass[UTF8]{ctexart}
\usepackage{xeCJK}
\author{Richard Gendal Brown, James Carlyle, Ian Grigg, Mike Hearn}
\date{20168}
\title{Corda}
\usepackage{amsfonts}
\usepackage{listings}
\usepackage{color}
\usepackage{epigraph}
\usepackage{graphicx}
\graphicspath{ {images/} }
\usepackage[export]{adjustbox}
\usepackage{float}
\usepackage{hyperref}
\usepackage[super,comma,sort&compress]{natbib}
\usepackage[nottoc]{tocbibind}
\renewcommand{\thefootnote}{\alph{footnote}}
\renewcommand*\contentsname{}
\renewcommand*\bibname{}
\renewcommand{\figurename}{}
\setlength\epigraphwidth{4.5cm}
\setlength\epigraphrule{0pt}
\begin{document}
\maketitle
\begin{abstract}
Corda
\end{abstract}
\newpage
\tableofcontents
\newpage
\section{}
R3
Corda \footnote{Richard Gendal Brown \href{mailto:richard@r3cev.com}{(richard@r3cev.com)}James Carlyle \href{mailto:james@r3cev.com}{(james@r3cev.com)}Ian Grigg \href{mailto:iang@r3cev.com}{(iang@r3cev.com)}Mike Hearn \href{mailto:mike@r3cev.com}{(mike@r3cev.com)}}
\section{}
\footnote{ (DTCC) (CLS)}
\cite{IT}
\begin{figure}[H]
\includegraphics[scale=.5, center]{sharedlogic}
\caption{ (\textit{ }) (\textit{/}) (\textit{})}
\end{figure}
\section{}
\textit{}
\subsection{}
\begin{itemize}
\item
\item
\item
\item
\item
\item
\end{itemize}
\begin{itemize}
\item
\item \cite{Ricardian}
\item
\item
\item
\item /
\item
\item
\end{itemize}
Corda
\section{Corda}
Corda
Corda ClackBakshiBraine \cite{SCT} \textit{}\textit{}
\subsection{}
Corda
Corda
\begin{itemize}
\item{}
\item{}
\item{}
\item{}
\item{}
\item{}
\item{}
\item{}
\item{}
\end{itemize}
\subsection{}
\textit{}
\begin{figure}[H]
\includegraphics[scale = .4, center]{partiesto}
\caption{ 100 }
\end{figure}
Corda
\begin{itemize}
\item
\item
\item
\end{itemize}
\subsection{}
Corda\textit{}
\begin{enumerate}
\item{}
\item{}
\end{enumerate}
\begin{figure}[H]
\includegraphics[scale = .5, center]{Consensus}
\caption{Corda }
\end{figure}
Corda \cite{EUC}
\subsection{}
Corda Corda
Java \cite{JVM} JVM \cite{Ethereum}Bytecode
\subsection{}
Corda \textit{}
\begin{itemize}
\item
\item 1,000
\item A B IRS
\end{itemize}
Corda \cite{BOE} \textit{}
\begin{figure}[H]
\includegraphics[scale = .4, center]{cash}
\caption{ Corda }
\end{figure}
\subsection{Corda }
\begin{itemize}
\item \textit{} \textit{}\textit{}\item \textit{}
\item \textit{} \textit{}
\end{itemize}
API UI Corda (\textit{CorDapp})
%\begin{figure}[H!]
%\includegraphics[scale = .4, center]{image4}
%\caption{Corda }
%\label{fig:figure4}
%\end{figure}
%\begin{figure}[H!]
%\includegraphics[scale = .25, center]{image5}
%\caption{ Corda }
%\label{fig:figure5}
%\end{figure}
\section{}
Corda Todd Boyle Ian Grigg \cite{Triple}\cite{Bitcoin} Corda
\subsection{}
Corda
\begin{itemize}
\item{}
\item{UTXO }
\item{}
\end{itemize}
JVM
Corda Corda
\subsection{}
\textit{}
%\section{}
%
%\textit{} ()
% 100
%
% Corda
%UTXO UTXO /
\section{}
Corda Corda
\begin{itemize}
\item
\item Java
\item
\item
\item Corda
\item FpMLISO20022/
\item
\item
\item
\item
\end{itemize}
\section{}
Corda R3
\bibliographystyle{unsrt}
\bibliography{Ref}
\end{document}
```
|
```makefile
libavcodec/bmp_parser.o: libavcodec/bmp_parser.c libavutil/bswap.h \
libavutil/avconfig.h libavutil/attributes.h config.h libavutil/common.h \
libavutil/macros.h libavutil/version.h libavutil/intmath.h \
libavutil/common.h libavutil/mem.h libavutil/error.h libavutil/avutil.h \
libavutil/rational.h libavutil/mathematics.h libavutil/intfloat.h \
libavutil/log.h libavutil/pixfmt.h libavutil/internal.h \
libavutil/timer.h libavutil/cpu.h libavutil/dict.h libavutil/libm.h \
libavcodec/parser.h libavcodec/avcodec.h libavutil/samplefmt.h \
libavutil/attributes.h libavutil/avutil.h libavutil/buffer.h \
libavutil/cpu.h libavutil/channel_layout.h libavutil/dict.h \
libavutil/frame.h libavutil/buffer.h libavutil/samplefmt.h \
libavutil/log.h libavutil/pixfmt.h libavutil/rational.h \
libavcodec/version.h libavutil/version.h
```
|
```java
package com.ctrip.xpipe.redis.checker.healthcheck.actions.sentinel;
import com.ctrip.xpipe.cluster.ClusterType;
import com.ctrip.xpipe.redis.checker.AbstractCheckerIntegrationTest;
import com.ctrip.xpipe.redis.checker.config.CheckerDbConfig;
import com.ctrip.xpipe.redis.checker.healthcheck.BiDirectionSupport;
import com.ctrip.xpipe.redis.checker.healthcheck.OneWaySupport;
import com.ctrip.xpipe.redis.checker.healthcheck.actions.sentinel.collector.DefaultSentinelHelloCollector;
import com.ctrip.xpipe.redis.checker.healthcheck.actions.sentinel.collector.SentinelCollector4Keeper;
import com.ctrip.xpipe.redis.core.meta.MetaCache;
import org.junit.Assert;
import org.junit.Before;
import org.junit.Test;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.beans.factory.annotation.Qualifier;
import static org.mockito.Mockito.*;
/**
* @author chen.zhu
* <p>
* Oct 09, 2018
*/
public class SentinelHelloCheckActionFactoryTest extends AbstractCheckerIntegrationTest {
@Autowired
private SentinelHelloCheckActionFactory factory;
@Autowired
@Qualifier("defaultSentinelHelloCollector")
private DefaultSentinelHelloCollector collector1;
@Autowired
private SentinelCollector4Keeper collector2;
@Autowired
private MetaCache metaCache;
@Before
public void beforeSentinelHelloCheckActionFactoryTest() {
metaCache = spy(metaCache);
CheckerDbConfig config = mock(CheckerDbConfig.class);
when(config.isSentinelAutoProcess()).thenReturn(true);
factory.setCheckerDbConfig(config);
}
@Test
public void testCreate() throws Exception {
collector1 = spy(collector1);
collector2 = spy(collector2);
SentinelHelloCheckAction action = (SentinelHelloCheckAction) factory
.create(newRandomClusterHealthCheckInstance("dc2",ClusterType.ONE_WAY));
Assert.assertTrue(action.getListeners().size() > 0);
Assert.assertTrue(action.getControllers().size() > 0);
logger.info("[listeners] {}", action.getListeners());
logger.info("[controller] {}", action.getControllers());
Assert.assertTrue(action.getListeners().stream().allMatch(listener -> listener instanceof OneWaySupport));
Assert.assertTrue(action.getControllers().stream().allMatch(controller -> controller instanceof OneWaySupport));
action.processSentinelHellos();
}
@Test
public void testCreateForBiDirectionInstance() throws Exception {
SentinelHelloCheckAction action = (SentinelHelloCheckAction) factory
.create(newRandomClusterHealthCheckInstance("dc1", ClusterType.BI_DIRECTION));
Assert.assertTrue(action.getListeners().size() > 0);
Assert.assertTrue(action.getControllers().size() > 0);
Assert.assertTrue(action.getListeners().stream().allMatch(listener -> listener instanceof BiDirectionSupport));
Assert.assertTrue(action.getControllers().stream().allMatch(controller -> controller instanceof BiDirectionSupport));
action.processSentinelHellos();
}
@Test
public void testSupport() {
Assert.assertEquals(SentinelHelloCheckAction.class, factory.support());
}
}
```
|
Windows tax may refer to:
The window tax, an historic British tax on glass
"Windows tax", a term for the cost of Microsoft Windows preinstalled on a computer; see Bundling of Microsoft Windows
|
Castelgrande may refer to:
Castelgrande, Basilicata, a town in the Province of Potenza, Italy
Castelgrande (castle), one of the Three Castles of Bellinzona, Switzerland
|
```go
package configs
import "golang.org/x/sys/unix"
const (
// EXT_COPYUP is a directive to copy up the contents of a directory when
// a tmpfs is mounted over it.
EXT_COPYUP = 1 << iota //nolint:golint // ignore "don't use ALL_CAPS" warning
)
type Mount struct {
// Source path for the mount.
Source string `json:"source"`
// Destination path for the mount inside the container.
Destination string `json:"destination"`
// Device the mount is for.
Device string `json:"device"`
// Mount flags.
Flags int `json:"flags"`
// Propagation Flags
PropagationFlags []int `json:"propagation_flags"`
// Mount data applied to the mount.
Data string `json:"data"`
// Relabel source if set, "z" indicates shared, "Z" indicates unshared.
Relabel string `json:"relabel"`
// RecAttr represents mount properties to be applied recursively (AT_RECURSIVE), see mount_setattr(2).
RecAttr *unix.MountAttr `json:"rec_attr"`
// Extensions are additional flags that are specific to runc.
Extensions int `json:"extensions"`
// Optional Command to be run before Source is mounted.
PremountCmds []Command `json:"premount_cmds"`
// Optional Command to be run after Source is mounted.
PostmountCmds []Command `json:"postmount_cmds"`
}
func (m *Mount) IsBind() bool {
return m.Flags&unix.MS_BIND != 0
}
```
|
```go
//go:build go1.18
// +build go1.18
package exported
import (
"bytes"
"encoding/json"
"fmt"
"net/http"
"regexp"
"github.com/Azure/azure-sdk-for-go/sdk/azcore/internal/log"
"github.com/Azure/azure-sdk-for-go/sdk/azcore/internal/shared"
"github.com/Azure/azure-sdk-for-go/sdk/internal/exported"
)
// NewResponseError creates a new *ResponseError from the provided HTTP response.
// Exported as runtime.NewResponseError().
func NewResponseError(resp *http.Response) error {
// prefer the error code in the response header
if ec := resp.Header.Get(shared.HeaderXMSErrorCode); ec != "" {
return NewResponseErrorWithErrorCode(resp, ec)
}
// if we didn't get x-ms-error-code, check in the response body
body, err := exported.Payload(resp, nil)
if err != nil {
// since we're not returning the ResponseError in this
// case we also don't want to write it to the log.
return err
}
var errorCode string
if len(body) > 0 {
if fromJSON := extractErrorCodeJSON(body); fromJSON != "" {
errorCode = fromJSON
} else if fromXML := extractErrorCodeXML(body); fromXML != "" {
errorCode = fromXML
}
}
return NewResponseErrorWithErrorCode(resp, errorCode)
}
// NewResponseErrorWithErrorCode creates an *azcore.ResponseError from the provided HTTP response and errorCode.
// Exported as runtime.NewResponseErrorWithErrorCode().
func NewResponseErrorWithErrorCode(resp *http.Response, errorCode string) error {
respErr := &ResponseError{
ErrorCode: errorCode,
StatusCode: resp.StatusCode,
RawResponse: resp,
}
log.Write(log.EventResponseError, respErr.Error())
return respErr
}
func extractErrorCodeJSON(body []byte) string {
var rawObj map[string]any
if err := json.Unmarshal(body, &rawObj); err != nil {
// not a JSON object
return ""
}
// check if this is a wrapped error, i.e. { "error": { ... } }
// if so then unwrap it
if wrapped, ok := rawObj["error"]; ok {
unwrapped, ok := wrapped.(map[string]any)
if !ok {
return ""
}
rawObj = unwrapped
} else if wrapped, ok := rawObj["odata.error"]; ok {
// check if this a wrapped odata error, i.e. { "odata.error": { ... } }
unwrapped, ok := wrapped.(map[string]any)
if !ok {
return ""
}
rawObj = unwrapped
}
// now check for the error code
code, ok := rawObj["code"]
if !ok {
return ""
}
codeStr, ok := code.(string)
if !ok {
return ""
}
return codeStr
}
func extractErrorCodeXML(body []byte) string {
// regular expression is much easier than dealing with the XML parser
rx := regexp.MustCompile(`<(?:\w+:)?[c|C]ode>\s*(\w+)\s*<\/(?:\w+:)?[c|C]ode>`)
res := rx.FindStringSubmatch(string(body))
if len(res) != 2 {
return ""
}
// first submatch is the entire thing, second one is the captured error code
return res[1]
}
// ResponseError is returned when a request is made to a service and
// the service returns a non-success HTTP status code.
// Use errors.As() to access this type in the error chain.
// Exported as azcore.ResponseError.
type ResponseError struct {
// ErrorCode is the error code returned by the resource provider if available.
ErrorCode string
// StatusCode is the HTTP status code as defined in path_to_url#pkg-constants.
StatusCode int
// RawResponse is the underlying HTTP response.
RawResponse *http.Response
}
// Error implements the error interface for type ResponseError.
// Note that the message contents are not contractual and can change over time.
func (e *ResponseError) Error() string {
const separator = your_sha256_hash----------------"
// write the request method and URL with response status code
msg := &bytes.Buffer{}
if e.RawResponse != nil {
if e.RawResponse.Request != nil {
fmt.Fprintf(msg, "%s %s://%s%s\n", e.RawResponse.Request.Method, e.RawResponse.Request.URL.Scheme, e.RawResponse.Request.URL.Host, e.RawResponse.Request.URL.Path)
} else {
fmt.Fprintln(msg, "Request information not available")
}
fmt.Fprintln(msg, separator)
fmt.Fprintf(msg, "RESPONSE %d: %s\n", e.RawResponse.StatusCode, e.RawResponse.Status)
} else {
fmt.Fprintln(msg, "Missing RawResponse")
fmt.Fprintln(msg, separator)
}
if e.ErrorCode != "" {
fmt.Fprintf(msg, "ERROR CODE: %s\n", e.ErrorCode)
} else {
fmt.Fprintln(msg, "ERROR CODE UNAVAILABLE")
}
if e.RawResponse != nil {
fmt.Fprintln(msg, separator)
body, err := exported.Payload(e.RawResponse, nil)
if err != nil {
// this really shouldn't fail at this point as the response
// body is already cached (it was read in NewResponseError)
fmt.Fprintf(msg, "Error reading response body: %v", err)
} else if len(body) > 0 {
if err := json.Indent(msg, body, "", " "); err != nil {
// failed to pretty-print so just dump it verbatim
fmt.Fprint(msg, string(body))
}
// the standard library doesn't have a pretty-printer for XML
fmt.Fprintln(msg)
} else {
fmt.Fprintln(msg, "Response contained no body")
}
}
fmt.Fprintln(msg, separator)
return msg.String()
}
```
|
Jason Kramer is a music supervisor and American radio personality. He is best known for his weekly radio show on Santa Monica, California-based, freeform public radio station KCRW (89.9 MHz FM).
Early life and radio
Born and raised in Los Angeles, California, Kramer worked as an EMT during the late 80s and early 90s; and through the 1992 Los Angeles riots. Soon after he began pursuing a career in radio, first cutting his teeth as a call screener at KLOS (95.5 MHz FM). In 1994, he spent much of his time working with Skunk Records and ska punk band Sublime, promoting their records for radio play and conducting surveys among college and commercial radio stations. In 1996, he moved on to become the music supervisor for Fox Sports Net during which time he was part of a team selecting music for sports programming. After six years, Kramer was promoted to co-producer and board engineer for Fox Sports Radio, producing programs such as the Adam Schein Show and Race Day on Fox. He also programmed, produced, and hosting his own five-hour weekly internet radio show on Soundbreak.com. In 1997, he began working on-air at KCRW where he currently hosts his own weekly show on Tuesday nights.
Music Supervision and other pursuits
In 2010 Kramer joined Santa Monica-based music agency, Elias Arts as their commercial concept music supervisor working with such brands as: Kia, Pepsi, Lexus, Toyota, and many others. He also interviewed and photographed numerous artists that he brought into the Elias studios for showcases and recording sessions.
Kramer continues to work in various aspects of music including management, publishing, creative consulting, and music photography. He speaks frequently at industry events for organizations such as ASCAP and SESAC, and has appeared on the internet TV show 'The Weekly Comet' as a segment producer and "Pick of the Week" host. He has produced live performances in Los Angeles at venues such as Hotel Café and Echo for such artists as Liam Bailey, Barry Adamson, L.A. Guns, and Jimmy Scott.
Teaching
In the fall of 2013, Kramer began teaching a course on music supervision as part of UCLA Extension.
Awards and Accolades
In 2014, Kramer won the Guild of Music Supervisors Award for Best Music Supervision in Advertising. The award was presented at the 4th annual award ceremony held at Mack Sennett Studios in Hollywood on January 28, 2014.
Kramer's work on a national advertising spot for Target (entitled 'Sunrise'), featuring the Kishi Bashi song “Philosophize In It! Chemicalize with It!”, was recognized as a Top 10 Fall 2014 Music Track by SHOOTonline.
References
External links
KCRW
Living people
American radio personalities
Year of birth missing (living people)
|
Matthew William Machan (born 15 February 1991) is an English-born former cricketer who played for Sussex and Scotland. Machan was a left-handed batsman who bowled right-arm off break. He was born in Brighton, Sussex and educated at Hurstpierpoint College and Brighton College. Machan currently plays for Brighton and Hove CC in the Sussex Premier League.
Domestic career
Having played for the Sussex Second XI since 2006, Machan made his full debut for Sussex in a first-class match against Cambridge MCCU. He made two further first-class appearances in the 2011 season against Oxford MCCU and Nottinghamshire in the County Championship. In the match against Oxford MCCU, Machan narrowly missed out on a maiden first-class century when he was dismissed on 99 by Alex Scott.
His List A debut came in 2010 against the touring Bangladeshis, with Machan scoring 10 runs before being dismissed by Mashrafe Mortaza, in what was a 149 run victory for Sussex. His second List A appearance came in 2011 against the touring Indians. In this match Machan scored his maiden half century in that format, making 56 runs before being caught and bowled by Suresh Raina.
In July 2017, Machan announced his retirement from professional cricket due to a wrist injury.
International career
In September 2012, Machan was selected by Scotland to be part of a tour group to South Africa in October 2012.
Although born in Brighton (in England), Machan qualifies to play for Scotland by having a Scottish parent.
Machan was included in the 2016 ICC World Twenty20 Scotland squad, and played in the first round. Scotland lost two matches and won only one match, and were eliminated from the tournament. Machan was the player of the match in Scotland's only win, against Hong Kong. This win is their first win in an ICC Major tournament.
References
External links
1991 births
Living people
Cricketers from Brighton
People educated at Hurstpierpoint College
People educated at Brighton College
English cricketers
Sussex cricketers
Oxfordshire cricketers
Scottish cricketers
Scotland Twenty20 International cricketers
Scotland One Day International cricketers
English people of Scottish descent
Cricketers at the 2015 Cricket World Cup
|
```smalltalk
using NUnit.Framework;
using Xamarin.Forms.Core.UnitTests;
namespace Xamarin.Forms.Xaml.UnitTests
{
public partial class Bz44213 : ContentPage
{
public Bz44213()
{
InitializeComponent();
}
public Bz44213(bool useCompiledXaml)
{
//this stub will be replaced at compile time
}
[TestFixture]
class Tests
{
[SetUp]
public void Setup()
{
Device.PlatformServices = new MockPlatformServices();
}
[TearDown]
public void TearDown()
{
Device.PlatformServices = null;
}
[TestCase(true)]
[TestCase(false)]
public void BindingInOnPlatform(bool useCompiledXaml)
{
((MockPlatformServices)Device.PlatformServices).RuntimePlatform = Device.iOS;
var p = new Bz44213(useCompiledXaml);
p.BindingContext = new { Foo = "Foo", Bar = "Bar" };
Assert.AreEqual("Foo", p.label.Text);
((MockPlatformServices)Device.PlatformServices).RuntimePlatform = Device.Android;
p = new Bz44213(useCompiledXaml);
p.BindingContext = new { Foo = "Foo", Bar = "Bar" };
Assert.AreEqual("Bar", p.label.Text);
}
}
}
}
```
|
The Battle of Ye or Battle of Yecheng took place in 204 in the late Eastern Han dynasty. It was fought between the warlord Cao Cao and Yuan Shang, son and successor of Cao Cao's rival Yuan Shao, in the Yuan clan's headquarters Ye (in present-day Handan, Hebei). Cao Cao had been allied with Yuan Shang's elder brother Yuan Tan, who rebelled in a succession feud, and it was by Yuan Tan's request that Cao Cao laid siege to Ye. The successful siege of the city dislodged Yuan Shang's power from Ji Province, and Cao Cao would later use the city of Ye as a major base of his military power.
Background
Yuan Shao, the powerful warlord of the north, had been decisively defeated by his southern neighbour Cao Cao in the Battle of Guandu in 200 and died two years later in frustration. Despite the defeat, the Yuan power bloc was by no means eliminated, for Yuan Shao was survived by his three sons Yuan Tan, Yuan Xi, and Yuan Shang; together with their cousin Gao Gan, the Yuan family still held on to the provinces of Ji, Qing, Bing, and You. The Yuan brothers were not on good terms, however—Yuan Tan, the oldest, contested the succession of his younger brother Yuan Shang, who was preemptively made heir by his supporters Shen Pei and Pang Ji, while the second son Yuan Xi was content with controlling the northernmost You Province and stayed out of his brothers' conflict. In the winter of 202, Cao Cao attacked Yuan Tan's position in Liyang, and Yuan Shang brought his troops to help his older brother. The two brothers held out for six months, before eventually driven back to Ye, where they successfully struck back and caused Cao Cao to withdraw for the time being.
As soon as Cao Cao started to retreat in mid-203, the brothers' feud took a turn to the worse. Yuan Tan requested more troops and equipment so he could lead an army to pursue Cao Cao's men, but Yuan Shang refused, not wanting his brother to gain control of a bigger army. This act of distrust proved to be the last straw for Yuan Tan, as he rebelled from his younger brother and attacked the city of Ye in anger. Yuan Shang successfully defended Ye again and chased Yuan Tan 300 kilometers away to Nanpi, the seat of Bohai Commandery. Bohai was on the edge of the border with Qing Province, where Yuan Tan still held the title Inspector of that province; but while he could expect some aid from the base of his power, some of his own men rebelled against him, and the position was very insecure. So when Yuan Shang came to attack Nanpi, Yuan Tan fled south to Pingyuan, where he was again besieged. Here he was close to Cao Cao's Yan province, and his advisor Guo Tu suggested seeking help from Cao Cao. Guo Tu reasoned that Cao Cao's army would attack Ye, and while Yuan Shang was to return to save his capital, Yuan Tan could expect to take the lands to the north of Ye; and if Cao Cao was to be successful, Yuan Shang's power would be removed and the outstretched Cao Cao would retreat soon after, leaving Yuan Tan to gain control of the north and capable enough to make a stand against Cao Cao. Yuan Tan would not agree at first, but later sent Xin Pi as an ambassador to seek an alliance with Cao Cao.
Since his withdrawal from Ye, Cao Cao's policy on the Yuan brothers was to let them wear each other out while he dealt with their ally Liu Biao in Jing Province (covering present-day Hubei and Hunan), and thus he was unsure what to make of the envoy. Cao Cao's advisor Xun Yu, who long advocated settling the north before turning elsewhere, reasoned that Liu Biao was not ambitious enough to be a threat, and it was high time to reap the benefits of the Yuan family feud before the brothers reunite. Cao Cao agreed, but he continued to put Jing Province first. Observing that Cao Cao was doubtful of Yuan Tan's sincerity in an alliance, Xin Pi spoke his mind:
Cao Cao accepted this advice, and Xin Pi thus switched sides. By the end of the year 203, Cao Cao again led his army across the Yellow River to Liyang and cemented the alliance by marrying his son Cao Zheng (曹整) with Yuan Tan's daughter. Yuan Shang indeed lifted the siege on Pingyuan and returned to guard Ye. With Yuan Tan's position safe, Cao Cao returned for the time being.
The battle
Laying siege to Ye
In the spring of 204 Cao Cao crossed the Yellow River again and, mindful of the logistical problems for him to operate north of the Yellow River, started several waterworks projects to ease the transportation of supplies. While these works were under way, Yuan Shang apparently thought it safe to renew his attack on Yuan Tan in Pingyuan again, and left his loyal supporter Shen Pei to defend Ye. Some within Yuan Shang's camp found his priorities questionable, so when Cao Cao indeed advanced on Ye some time around the second or third month, the city's defenders under Su You (蘇由) intended to rebel and capitulate Ye to Cao Cao. The scheme was discovered, its plotters suppressed by Shen Pei within the city, and Su You fled to Cao Cao.
Now Cao Cao's army was at the gates of Ye. He had mounds erected and tunnels dug to lay siege to the city. Having done this, Cao Cao left the general Cao Hong to maintain the siege while he turned west in the fourth month to attack Yin Kai (尹楷), a county magistrate under Yuan Shang who guarded the supply route from Bing Province. After storming Yin Kai's fortress Maocheng (毛城) at the foot of the Taihang Mountains, Cao Cao's army bypassed the defenses at Ye and defeated Ju Hu (沮鵠) in Handan, north of Ye. This development brought about more defections from Yuan Shang's county magistrates, and the local Heishan bandit lord Zhang Yan offered his assistance to Cao Cao. By this time Ye was cut off from the south, west, and north, while Yuan Shang was at its east facing Yuan Tan.
Cao Cao's army returned to the siege-lines of Ye in the fifth month. Shen Pei vigorously defended the city throughout the siege; he had dug trenches within the city of Ye to counter Cao Cao's tunnels, and dealt with dissension among his ranks. One of his officers, Feng Li (馮禮) opened a sally port to let the enemy in. Shen Pei found out and had boulders dropped into the opening, blocking the gates and killed the roughly 300 soldiers who entered.
Only a few weeks after the siege mounds and tunnels were constructed, Cao Cao changed tactics and ordered them destroyed. In their place, a shallow moat 40 li long was dug surrounding the city. At first the moat was shallow enough to be crossed, so Shen Pei laughed when he saw it and paid it no heed. Then, in a single night, Cao Cao dug the trench further, 20 feet wide and 20 feet deep, drawing water from the nearby Zhang River to the west and encompassing the Yanpi Marsh (晏陂澤) to the south and the Huan River to the east and north. The city became isolated, and by the beginning of autumn it was said that more than half in the city died of starvation.
The arrival and repulsion of Yuan Shang
Some time in the summer Yuan Shang decided to abort his campaign against Yuan Tan and turned back to help defend his headquarters. Yuan Shang sent his Registrar (主簿) Li Fu (李孚) ahead to notify the defenders that relief was coming. To avoid detection by the besiegers, Li Fu brought only three horsemen, broke his staff of authority, and traveled by night. When he reached Cao Cao's camps surrounding the city from the north, he styled himself as a disciplinary officer and went through the camps finding fault with the sentries and punishing them. In this fashion he passed through the eastern camps from the northern camps into the camps on the southern side, where Cao Cao's personal camp was. Turning west from here, he arrested the officers on picket duty, tied them up, then made a dash to the city walls. He called to the defenders above, and they drew him in by rope. The ecstatic defenders sounded the drums in celebration of Li Fu's arrival, and Cao Cao laughed when he was made known of Li Fu's exploits.
Li Fu was to return to relay Ye's situation to Yuan Shang. He realized that he could not use the same trick to get past the siege-lines and so conjured another ploy. He had Shen Pei arrange to have the old and weak sent out in the night to save food. During the night, several thousand people selected were sent away through three different gates, carrying white flags to surrender. Li Fu and his followers blended into the crowd and exited Ye by the northern gate, then escaped the surrounding camps from the northwest. Yuan Shang was glad to see Li Fu back, while Cao Cao clapped his hands and laughed again when he knew Li Fu escaped.
Through the ruckus surrounding Li Fu's infiltration, Cao Cao's men knew that Yuan Shang was leading troops to relief Ye. Some of Cao Cao's officers were concerned that since Yuan Shang was coming home with Yuan Tan at his heels, Yuan Shang's soldiers would theoretically be on "death ground" (死地), where they would fight more fiercely to save themselves according to Sun Tzu's The Art of War. Cao Cao pointed out that he should indeed avoid battle with the reinforcements if Yuan Shang came on the main road from the east; but if Yuan Shang moved across to the northwestern hills, he would have friendly territory (Gao Gan's Bing province) behind him and his army would be easier to deal with. Yuan Shang approached obliquely from the north, to the delight of Cao Cao. When his scouts told him Yuan Shang's army reached Handan, Cao Cao candidly announced to his generals "I already have Ji Province, did you know? You shall see soon."
From the western hills, Yuan Shang turned east to Yangping village (陽平亭), 17 li from Ye. On the bank of the Fu River (滏水) flowing north of the city, the relief army set camp and lit torches to signal the defenders for a coordinated attack, who lit another fire in acknowledgement. Shen Pei made a sortie to the north to rendezvous with Yuan Shang, but Cao Cao defeated both armies, driving Shen Pei back within the walls and Yuan Shang to Quzhang (曲漳), a bend on the Zhang River. Cao Cao then moved to surround Yuan Shang's position, but before the encirclement was completed, an afraid Yuan Shang sent Yin Kui (陰夔) and Chen Lin to negotiate for surrender. Cao Cao refused, and pressed Quzhang harder. One night, Yuan Shang abandoned Quzhang for Lankou (濫口) in the western Qi Hills (祁山), where Cao Cao followed and defeated Yuan Shang once more. Yuan Shang's army was completely scattered, his generals Ma Yan (馬延) and Zhang Yi (張顗) surrendered, and Yuan Shang himself fled far north to Zhongshan Commandery (中山). Cao Cao's men captured his baggages, seals, and other insignia.
End of the siege
Cao Cao had the trophies of his victory against Yuan Shang shown to the defenders of Ye, which greatly lowered their morale, but Shen Pei was adamant. He rallied the troops based on the hope that Yuan Shang's second brother Yuan Xi would soon come to the rescue from You Province, thus they have no reason to worry about Yuan Shang's rout. When Cao Cao rode out to inspect the siege-works, Shen Pei had crossbowmen fire at him; the shots missed narrowly. A few nights later, on September 13 of the Julian calendar, Shen Pei's nephew Shen Rong (審榮) betrayed the city and opened the east gate at night to let in the enemy. As Cao Cao's men breached the city, Shen Pei executed the families of Xin Pi's brother Xin Ping, whom he considered traitorous and responsible for the downfall of the Yuan clan, then personally joined the defense at the gates. Shen Pei and the remaining defenders were pushed into the city proper, where fighting continued in the streets for a while. Two sources, the Parallel Annals of the Duke of Shanyang (山陽公載記) and the Chronicle of Emperor Xian (獻帝春秋), claim that Shen Pei hid in a well when all seemed lost, but the compiler Pei Songzhi rejects this account. Whatever the circumstance, Shen Pei was captured alive, and the siege finally ended after dragging on for more than half a year.
Aftermath
Shen Pei remained defiant until the very end. He rebuked those who surrendered to Cao Cao and cursed the fact that the crossbow bolts did not hit Cao Cao. Cao Cao became impressed by his fierce loyalty and wanted to spare him, but Xin Pi and the others begged for his execution, so Shen Pei was to be beheaded. On the execution grounds, Shen Pei demanded to be allowed to face north as he died, since his lord Yuan Shang was in that direction.
Cao Cao paid his respects at the tomb of Yuan Shao, where he wept for his friend-turned-enemy. He also offered condolences and pensions for members of Yuan Shao's family at Ye, though Cao Cao's son Cao Pi took Yuan Xi's wife Lady Zhen as his own wife in a serious breach of propriety. Politically, Cao Cao employed many of Yuan Shao's former officials, relieved all newly conquered territories of taxes for one year, and devoted his policies to rebuild the country devastated by the three-way war among Cao Cao and the Yuan brothers. All these gained him wide popularity, which, along with the contingents of Bing Province troops sent to settle at Ye, prevented the outbreak of rebellion in favour of the former rulers. Gao Gan, the Inspector of Bing Province, offered his nominal surrender to Cao Cao for the time being. For Cao Cao's successes, an imperial decree named him the Governor of Ji Province, but Cao Cao excused himself from the honour and continued with his old post as Governor of Yan Province.
For the most part, the fall of Ye removed the Yuan clan's power from Ji province. Yuan Tan, who had been taking advantage of the siege of Ye to take territories that belonged to Yuan Shang, defeated Yuan Shang in Zhongshan and drove him further north to seek refuge under Yuan Xi in You Province. Since Yuan Tan was at least expected to help during the siege, Cao Cao now accused Yuan Tan of acting in bad faith, and cancelled the marriage between their families. Months later, Yuan Tan returned to Nanpi and Cao Cao moved to attack him, killing him in battle in the first month of 205. Yuan Shang and Yuan Xi were unable to reorganize their men in You Province after their setbacks and rebellions under their rule, and were decisively defeated along with their allies the Wuhuan in the Battle of White Wolf Mountain in 207.
Ye proved to be a useful acquisition for Cao Cao, who took the city as his chief residence soon after its capture. Over the years the city and its surrounding Wei Commandery became the heart of Cao Cao's power, as he initiated several works in and around the city, including the much-celebrated Bronze Bird Terrace and the Xuanwu Pond (玄武池), where he trained his navy. In 213 Cao Cao was enfeoffed as the Duke of Wei, named after Ye's commandery, and the name stuck throughout the rise of the Cao family's fortunes, culminating in the state of Cao Wei that succeeded the Han dynasty in 220. According to Shui Jing Zhu, Ye was regarded as the Northern Capital during the Wei dynasty.
Notes
References
Chen Shou and Pei Songzhi, Annotated Records of the Three Kingdoms
204
Ye 204
Military history of Hebei
|
Marialite is a silicate mineral with a chemical formula of if a pure endmember or with increasing meionite content. Marialite is a member of the scapolite group and a solid solution exists between marialite and meionite, the calcium endmember. It is a rare mineral usually used as a collector's stone.
Crystallography
Marialite has tetragonal crystallography and a 4/m crystal class. It has a 4 fold rotation with 90° mirror planes. Crystals are usually prismatic with prominent forms of prisms and dipyramids.
Marialite belongs to a uniaxial negative optical class which means it has one circular section and a principal section shaped like an oblate sphenoid.
Discovery and occurrence
Marialite was first described in 1866 for an occurrence in the Phlegrean Volcanic complex, Campania, Italy. It was named by German mineralogist Gerhard vom Rath for his wife, Maria Rosa vom Rath.
Marialite occurs in regional and contact metamorphism: marble, calcareous gneiss, granulite and greenschist. It also occurs in skarn, pegmatite and hydrothermally altered volcanic rocks. This means that Marialite is formed in high pressure and/or high temperature environments.
References
Tectosilicates
Halide minerals
Tetragonal minerals
Minerals in space group 87
Sodium minerals
Aluminium minerals
|
Elections for the Indian state of Jammu and Kashmir were held over October 1983. The Jammu & Kashmir National Conference leader Farooq Abdullah was appointed Chief Minister.
Background
The 1983 Jammu and Kashmir elections cemented the political polarisation on religious lines after Indira Gandhi campaigned aggressively in the state, raising the bogey of a 'Muslim invasion' of the Jammu region, alluding to the Resettlement Bill passed by the-then National Conference government, which gave the state's residents who left for Pakistan before 1954 the right to return to the state, reclaim their properties, and resettle.
Result
Indira Gandhi's strategy yielded dividends in the 1983 state elections and the Congress won 26 seats, while the NC secured 46. Barring an odd constituency, all the victories of the Congress were in the Jammu and Ladakh regions, while National Conference swept the Kashmir Valley. The 1983 election established the model for any future Congress-NC alliance - the Congress allotting itself seats mainly in the Jammu and Ladakh regions, while the National Conference limiting itself to the Kashmir Valley.
Farooq Abdullah was sworn in as the Chief Minister Again.
Elected members
References
Bibliography
Jammu and Kashmir
1983
1983
|
Manley Career Academy High School (commonly known as Manley High School) is a public 4–year high school located in the East Garfield Park neighborhood on the West Side of Chicago, Illinois, United States. Opened in 1928, Manley is a part of the Chicago Public Schools district.
History
The school opened as Hugh Manley Junior High School in 1928 by the Chicago Public Schools and Chicago Board of Education. Manley was dedicated on September 28, 1928 along with another school; Spaulding School For The Crippled Children. The school cost $2.5 million and built to house a total of 3,000 students. Manley became a senior high school in 1933 when junior high schools were abolished in Chicago on July 12 of that year. Manley housed an elementary school within its building from 1933 until 1943. The U.S. Navy occupied the school building from January 1944 through the end of World War II to develop programs designed for and to aid in the war effort, which resulted in students being transferred to neighboring schools.
In September 1946, the school served as a trade school opening as Manley Trade and Vocational School, later becoming known as Cregier Vocational High School. By 1957, the trade school was relocated, and Manley was once again converted into an elementary and middle school. The elementary school was phased out and an extension of Marshall High School was created on the campus, serving at the location for two years: 1969–71. In June 1973, the Chicago Board of Education designated Manley as a "senior high school" and approved phasing out the seventh and eighth grade program. Manley's first senior high school graduating class occurred in June 1976.
Athletics
Manley competes in the Chicago Public League (CPL) and is a member of the Illinois High School Association (IHSA). The school's sports teams are nicknamed the Wildcats. The boys' basketball team won the Public league championship twice (1978–79, 1979–80), and was Class AA champion once (1979–80).
References
External links
http://www.manleyhighschool.org
http://www.cps.edu/Schools/Pages/school.aspx?unit=1460
Public high schools in Chicago
Educational institutions established in 1928
1928 establishments in Illinois
|
Tom Clancy's Net Force is a novel series, created by Tom Clancy and Steve Pieczenik and originally written by Steve Perry. The original series ceased publication in 2006. There was also a spin-off of young adult books called Net Force Explorers. The series was rebooted in 2019 with the Dark Web novel by Jerome Preisler.
General
Tom Clancy's Net Force is aimed at an adult audience, while the related series Net Force Explorers (which follows the adventures of a teen auxiliary of the Net Force in 2025) is aimed at the older teen market.
The initial Net Force concept was alluded to in the third Op-Center novel, Games of State; given that Net Force was created by the same two men who created the Op-Center series, it can be assumed that they occur in the same universe. However, no direct connection has yet been drawn between the two.
Main characters
These characters are in most or all books:
Original series
The books in the Tom Clancy's Net Force series so far are:
Relaunch series
The books in the Tom Clancy's Net Force Relaunch series so far are:
In other media
The first book of the series, Net Force, was adapted and altered into a made-for-TV film in 1999, starring Scott Bakula as Alex Michaels and Joanna Going as Toni Fiorella.
References
Book series introduced in 1998
Novel series
Techno-thriller novels
|
```c++
#include <c10/core/GradMode.h>
namespace c10 {
bool GradMode::is_enabled() {
return AutogradState::get_tls_state().get_grad_mode();
}
void GradMode::set_enabled(bool enabled) {
AutogradState::get_tls_state().set_grad_mode(enabled);
}
} // namespace c10
```
|
Samsung EX1 (known as Samsung TL500 in US) is an enthusiast digital compact camera with a 1.8–2.4 wide angle 3× (5.2–15.6 mm, resp. 24–72 mm of 35 mm equivalent focal length), image stabilized zoom lens. It comes with a 1/1.7" 10 CCD sensor (same as is used in some Sony, Nikon, and Canon cameras), and a 3.0" multi-angle Active-matrix OLED display. It also has RAW capture, and VGA video recording in H.264 format.
Samsung EX1-VE was introduced after 1.5 years.
It was announced on February 20, 2010.
Add-ons
Optical viewfinder – EA-OVF1
Wide conversion lens – Teleside converter 0,75× (18 mm) resp. Telecompressor – EA-LWCEX01
References
EX1
Live-preview digital cameras
Cameras introduced in 2010
Digital cameras with CCD image sensor
|
```sqlpl
update ACT_GE_PROPERTY set VALUE_ = '6.5.1.2' where NAME_ = 'common.schema.version';
alter table ACT_RU_JOB add column CATEGORY_ varchar(255);
alter table ACT_RU_TIMER_JOB add column CATEGORY_ varchar(255);
alter table ACT_RU_SUSPENDED_JOB add column CATEGORY_ varchar(255);
alter table ACT_RU_DEADLETTER_JOB add column CATEGORY_ varchar(255);
```
|
```php
<?php
/**
* This file is part of the Carbon package.
*
* (c) Brian Nesbitt <brian@nesbot.com>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
/*
* Authors:
* - International Components for Unicode akhilesh.k@samsung.com
*/
return array_replace_recursive(require __DIR__.'/en.php', [
'formats' => [
'L' => 'dddd DD MMM YYYY',
],
'months' => ['Snuali', 'Fpueli', 'Maasi', 'Epeleli', 'M', 'Sune', 'Siulai', 'Aokosi', 'Sepitema', 'Okatopa', 'Nvema', 'Tsema'],
'months_short' => ['Sn', 'Fp', 'Maa', 'Epe', 'M', 'Sun', 'Siu', 'Aok', 'Sep', 'Oka', 'Nv', 'Ts'],
'weekdays' => ['Spate', 'Mnite', 'Tsite', 'Pulelulu', 'Tuapulelulu', 'Falaite', 'Tokonaki'],
'weekdays_short' => ['Sp', 'Mn', 'Ts', 'Pul', 'Tua', 'Fal', 'Tok'],
'weekdays_min' => ['Sp', 'Mn', 'Ts', 'Pul', 'Tua', 'Fal', 'Tok'],
'meridiem' => ['hengihengi', 'efiafi'],
'year' => ':count fitu', // less reliable
'y' => ':count fitu', // less reliable
'a_year' => ':count fitu', // less reliable
'month' => ':count mahina', // less reliable
'm' => ':count mahina', // less reliable
'a_month' => ':count mahina', // less reliable
'week' => ':count Sapate', // less reliable
'w' => ':count Sapate', // less reliable
'a_week' => ':count Sapate', // less reliable
'day' => ':count aho', // less reliable
'd' => ':count aho', // less reliable
'a_day' => ':count aho', // less reliable
'hour' => ':count houa',
'h' => ':count houa',
'a_hour' => ':count houa',
'minute' => ':count miniti',
'min' => ':count miniti',
'a_minute' => ':count miniti',
'second' => ':count sekoni',
's' => ':count sekoni',
'a_second' => ':count sekoni',
]);
```
|
```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\Controller;
use App\Configuration\LocaleService;
use App\Entity\User;
use App\Event\ConfigureMainMenuEvent;
use App\Repository\UserRepository;
use Psr\EventDispatcher\EventDispatcherInterface;
use Symfony\Component\HttpFoundation\Request;
use Symfony\Component\HttpFoundation\Response;
use Symfony\Component\Routing\Attribute\Route;
use Symfony\Component\Security\Http\Attribute\IsGranted;
/**
* Homepage controller is a redirect controller with user specific logic.
*/
#[Route(path: '/homepage')]
#[IsGranted('IS_AUTHENTICATED_REMEMBERED')]
final class HomepageController extends AbstractController
{
public const DEFAULT_ROUTE = 'timesheet';
#[Route(path: '', defaults: [], name: 'homepage', methods: ['GET'])]
public function homepage(Request $request, LocaleService $service, EventDispatcherInterface $eventDispatcher, UserRepository $userRepository): Response
{
$user = $this->getUser();
$userLanguage = $user->getLanguage();
$requestLanguage = $request->getLocale();
if (empty($requestLanguage)) {
$requestLanguage = User::DEFAULT_LANGUAGE;
}
if (empty($userLanguage)) {
$userLanguage = $requestLanguage;
}
// if a user somehow managed to get a wrong locale into hos account (eg. an imported user from Kimai 1)
// make sure that he will still see a beautiful page and not a 404
if (!$service->isKnownLocale($userLanguage)) {
$userLanguage = 'en';
}
$routes = [];
$userRoute = $user->getPreferenceValue('login_initial_view');
if (\is_string($userRoute)) {
$event = new ConfigureMainMenuEvent();
$eventDispatcher->dispatch($event);
$menu = $event->findById($userRoute);
if ($menu !== null && \count($menu->getRouteArgs()) === 0 && $menu->getRoute() !== null) {
$userRoute = $menu->getRoute();
}
$routes[] = [$userRoute, $userLanguage];
$routes[] = [$userRoute, $requestLanguage];
$routes[] = [$userRoute, User::DEFAULT_LANGUAGE];
}
$routes[] = [self::DEFAULT_ROUTE, $userLanguage];
$routes[] = [self::DEFAULT_ROUTE, $requestLanguage];
foreach ($routes as $routeSettings) {
$route = $routeSettings[0];
$language = $routeSettings[1];
try {
return $this->redirectToRoute($route, ['_locale' => $language]);
} catch (\Exception $ex) {
if ($route === $userRoute) {
// fix invalid routes from old plugins / versions
$user->setPreferenceValue('login_initial_view', 'dashboard');
$userRepository->saveUser($user);
} else {
$this->logException($ex);
}
}
}
return $this->redirectToRoute(self::DEFAULT_ROUTE, ['_locale' => User::DEFAULT_LANGUAGE]);
}
}
```
|
Mario Luzi (20 October 1914 – 28 February 2005) was an Italian poet.
Biography
Born in Castello, near Sesto Fiorentino, Luzi's parents, Ciro Luzi and Margherita Papini, hailed from Samprugnano (later Semproniano). He spent his youth in Castello, where he started his primary school. In Florence he studied at the liceo classico Galileo, and also in Florence he obtained his degree in French literature with a final dissertation about François Mauriac. This was an important period for Luzi. He met poets such as Piero Bigongiari, Alessandro Parronchi, Carlo Bo, Leone Traverso, and the critic Oreste Macrì.
His first book, La barca, was published in 1935 and in 1938 he started to teach in high schools in the cities of Parma, San Miniato and Rome.
In 1940, he published Avvento notturno; in 1945 he went back to Florence and there he taught at the liceo scientifico.
In 1946 he published Un brindisi e Quaderno gotico, in issue 1 of Inventario, in 1952 Onore del vero, Principe del deserto e Studio su Mallarmé. In 1955 he began teaching French literature at Florence University in the Facoltà di scienze politiche (Political Studies Institute).
Between 1963 and 1983, he published many books such as Nel magma (1963); Dal fondo delle campagne (1965); Semiserie (1979), Reportage (1985). In 1978, with the book Al fuoco della controversia, he won the Viareggio Prize (Premio Viareggio). He won the Aristeion Prize in 1991 for his work Frasi e Incisi di un Canto Salutare; in the same year he was proposed for the first time by the Accademia dei Lincei for the Nobel Prize in Literature. Ultimately never awarded, when asked for his thoughts by one reporter on his fellow countryman Dario Fo's 1997 success he slammed the phone down: "I'll say only this. I've just about had it up to here!"
His last book, L'avventura della dualità, was published in 2003. In October 2004, he was appointed to the Italian Senate as a senator-for-life by President of the Republic Ciampi. He died in Florence, just some months later, on 28 February 2005.
List of works
La barca (1935)
Avvento notturno (1940)
Biografia a Ebe (1942)
Un brindisi (1946)
Quaderno gotico (1947)
Primizie del deserto (1952)
Onore del vero (1957)
Il giusto della vita (1960)
Nel magma (1963; new edition, 1966)
Dal fondo delle campagne (1965)
Su fondamenti invisibili (1971)
Al fuoco della controversia (1978)
Semiserie (1979)
Reportage, un poemetto seguito dal Taccuino di viaggio in Cina (1980)
Per il battesimo dei nostri frammenti (1985)
La cordigliera delle Ande e altri versi tradotti (1983)
Frasi e incisi di un canto salutare (1990)
Viaggio terrestre e celeste di Simone Martini (1994)
Il fiore del dolore (2003)
L'avventura della dualità (2003)
References
External links
Mario Luzi's webpage
Obituary on Corriere della Sera''
1914 births
2005 deaths
Italian life senators
Italian male poets
People from the Province of Florence
Viareggio Prize winners
20th-century Italian poets
20th-century Italian male writers
|
```c++
#ifndef BOOST_MPL_LIST_AUX_FRONT_HPP_INCLUDED
#define BOOST_MPL_LIST_AUX_FRONT_HPP_INCLUDED
//
// (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
//
// See path_to_url for documentation.
// $Id: front.hpp 49267 2008-10-11 06:19:02Z agurtovoy $
// $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $
// $Revision: 49267 $
#include <boost/mpl/front_fwd.hpp>
#include <boost/mpl/list/aux_/tag.hpp>
namespace boost { namespace mpl {
template<>
struct front_impl< aux::list_tag >
{
template< typename List > struct apply
{
typedef typename List::item type;
};
};
}}
#endif // BOOST_MPL_LIST_AUX_FRONT_HPP_INCLUDED
```
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\Transcoder\Resource;
/**
* The "projects" collection of methods.
* Typical usage is:
* <code>
* $transcoderService = new Google\Service\Transcoder(...);
* $projects = $transcoderService->projects;
* </code>
*/
class Projects extends \Google\Service\Resource
{
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(Projects::class, 'Google_Service_Transcoder_Resource_Projects');
```
|
```javascript
import Link from 'next/link';
const CustomLink = ({
href,
title,
children,
}) => {
return (
<span className="link-container">
<Link href={href} legacyBehavior>
<a className="link" title={title}>
{children}
</a>
</Link>
<style jsx>{`
.link {
text-decoration: none;
color: var(--geist-foreground);
font-weight: 500;
}
`}</style>
</span>
);
};
export default CustomLink;
```
|
```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 spec
import (
"encoding/json"
"github.com/go-openapi/jsonpointer"
"github.com/go-openapi/swag"
)
type OperationProps struct {
Description string `json:"description,omitempty"`
Consumes []string `json:"consumes,omitempty"`
Produces []string `json:"produces,omitempty"`
Schemes []string `json:"schemes,omitempty"` // the scheme, when present must be from [http, https, ws, wss]
Tags []string `json:"tags,omitempty"`
Summary string `json:"summary,omitempty"`
ExternalDocs *ExternalDocumentation `json:"externalDocs,omitempty"`
ID string `json:"operationId,omitempty"`
Deprecated bool `json:"deprecated,omitempty"`
Security []map[string][]string `json:"security,omitempty"` //Special case, see MarshalJSON function
Parameters []Parameter `json:"parameters,omitempty"`
Responses *Responses `json:"responses,omitempty"`
}
// MarshalJSON takes care of serializing operation properties to JSON
//
// We use a custom marhaller here to handle a special cases related
// the Security field. We need to preserve zero length slice
// while omiting the field when the value is nil/unset.
func (op OperationProps) MarshalJSON() ([]byte, error) {
type Alias OperationProps
if op.Security == nil {
return json.Marshal(&struct {
Security []map[string][]string `json:"security,omitempty"`
*Alias
}{
Security: op.Security,
Alias: (*Alias)(&op),
})
}
return json.Marshal(&struct {
Security []map[string][]string `json:"security"`
*Alias
}{
Security: op.Security,
Alias: (*Alias)(&op),
})
}
// Operation describes a single API operation on a path.
//
// For more information: path_to_url#operationObject
type Operation struct {
VendorExtensible
OperationProps
}
// SuccessResponse gets a success response model
func (o *Operation) SuccessResponse() (*Response, int, bool) {
if o.Responses == nil {
return nil, 0, false
}
for k, v := range o.Responses.StatusCodeResponses {
if k/100 == 2 {
return &v, k, true
}
}
return o.Responses.Default, 0, false
}
// JSONLookup look up a value by the json property name
func (o Operation) JSONLookup(token string) (interface{}, error) {
if ex, ok := o.Extensions[token]; ok {
return &ex, nil
}
r, _, err := jsonpointer.GetForToken(o.OperationProps, token)
return r, err
}
// UnmarshalJSON hydrates this items instance with the data from JSON
func (o *Operation) UnmarshalJSON(data []byte) error {
if err := json.Unmarshal(data, &o.OperationProps); err != nil {
return err
}
if err := json.Unmarshal(data, &o.VendorExtensible); err != nil {
return err
}
return nil
}
// MarshalJSON converts this items object to JSON
func (o Operation) MarshalJSON() ([]byte, error) {
b1, err := json.Marshal(o.OperationProps)
if err != nil {
return nil, err
}
b2, err := json.Marshal(o.VendorExtensible)
if err != nil {
return nil, err
}
concated := swag.ConcatJSON(b1, b2)
return concated, nil
}
// NewOperation creates a new operation instance.
// It expects an ID as parameter but not passing an ID is also valid.
func NewOperation(id string) *Operation {
op := new(Operation)
op.ID = id
return op
}
// WithID sets the ID property on this operation, allows for chaining.
func (o *Operation) WithID(id string) *Operation {
o.ID = id
return o
}
// WithDescription sets the description on this operation, allows for chaining
func (o *Operation) WithDescription(description string) *Operation {
o.Description = description
return o
}
// WithSummary sets the summary on this operation, allows for chaining
func (o *Operation) WithSummary(summary string) *Operation {
o.Summary = summary
return o
}
// WithExternalDocs sets/removes the external docs for/from this operation.
// When you pass empty strings as params the external documents will be removed.
// When you pass non-empty string as one value then those values will be used on the external docs object.
// So when you pass a non-empty description, you should also pass the url and vice versa.
func (o *Operation) WithExternalDocs(description, url string) *Operation {
if description == "" && url == "" {
o.ExternalDocs = nil
return o
}
if o.ExternalDocs == nil {
o.ExternalDocs = &ExternalDocumentation{}
}
o.ExternalDocs.Description = description
o.ExternalDocs.URL = url
return o
}
// Deprecate marks the operation as deprecated
func (o *Operation) Deprecate() *Operation {
o.Deprecated = true
return o
}
// Undeprecate marks the operation as not deprected
func (o *Operation) Undeprecate() *Operation {
o.Deprecated = false
return o
}
// WithConsumes adds media types for incoming body values
func (o *Operation) WithConsumes(mediaTypes ...string) *Operation {
o.Consumes = append(o.Consumes, mediaTypes...)
return o
}
// WithProduces adds media types for outgoing body values
func (o *Operation) WithProduces(mediaTypes ...string) *Operation {
o.Produces = append(o.Produces, mediaTypes...)
return o
}
// WithTags adds tags for this operation
func (o *Operation) WithTags(tags ...string) *Operation {
o.Tags = append(o.Tags, tags...)
return o
}
// AddParam adds a parameter to this operation, when a parameter for that location
// and with that name already exists it will be replaced
func (o *Operation) AddParam(param *Parameter) *Operation {
if param == nil {
return o
}
for i, p := range o.Parameters {
if p.Name == param.Name && p.In == param.In {
params := append(o.Parameters[:i], *param)
params = append(params, o.Parameters[i+1:]...)
o.Parameters = params
return o
}
}
o.Parameters = append(o.Parameters, *param)
return o
}
// RemoveParam removes a parameter from the operation
func (o *Operation) RemoveParam(name, in string) *Operation {
for i, p := range o.Parameters {
if p.Name == name && p.In == name {
o.Parameters = append(o.Parameters[:i], o.Parameters[i+1:]...)
return o
}
}
return o
}
// SecuredWith adds a security scope to this operation.
func (o *Operation) SecuredWith(name string, scopes ...string) *Operation {
o.Security = append(o.Security, map[string][]string{name: scopes})
return o
}
// WithDefaultResponse adds a default response to the operation.
// Passing a nil value will remove the response
func (o *Operation) WithDefaultResponse(response *Response) *Operation {
return o.RespondsWith(0, response)
}
// RespondsWith adds a status code response to the operation.
// When the code is 0 the value of the response will be used as default response value.
// When the value of the response is nil it will be removed from the operation
func (o *Operation) RespondsWith(code int, response *Response) *Operation {
if o.Responses == nil {
o.Responses = new(Responses)
}
if code == 0 {
o.Responses.Default = response
return o
}
if response == nil {
delete(o.Responses.StatusCodeResponses, code)
return o
}
if o.Responses.StatusCodeResponses == nil {
o.Responses.StatusCodeResponses = make(map[int]Response)
}
o.Responses.StatusCodeResponses[code] = *response
return o
}
```
|
Jennifer Kathleen Aitchison is an Australian politician in the New South Wales Legislative Assembly as member for Maitland for the Labor Party at the 2015 New South Wales state election. She has served as the Minister for Regional Transport and Roads in the Minns ministry since 2023.
Before her election, Aitchison worked as a managing director of tourism and hospitality companies.
Early years and background
Aitchison was born in Canberra, Australian Capital Territory, born to Jim and Anne O'Connor, a library officer in the Commonwealth Public Service and also one of the first women to receive paid maternity leave for the birth of Jenny. Aitchison, at around about eight years old, started to follow in her mother's footsteps and commenced working at her local library as a volunteer.
In 1985, during the first International Year of Youth, Aitchison was selected to represent her school on an interschool newspaper, which is where she later said was "the start of my activism".
At 21 years of age, Aitchison joined the Australian Labor Party and later that year joined the Commonwealth public service in the Department of Immigration and Ethnic Affairs, an experience where she has later said was "sad yet ultimately hopeful [hearing the] stories of the many thousands of people who had unsuccessfully applied to come to Australia as refugees or migrants. I read with a sense of deep shame and embarrassment a question from an overseas school student to the Minister, asking if it was really true that Australia had once had a policy that we would only let people with white skin into Australia". Aitchison then moved into the Social Justice Coordination Section, responsibilities here included drafting the department's Agenda for Women and consultations around Australia, in addition to hearing firsthand the stories of many refugee and migrant women.
In 1996, when John Howard and the Coalition came to Government, Aitchison joined the staff of the Opposition as chief of staff for the member for Fraser, Steve Dargavel.
A year later in 1997 Aitchison met her husband, Robert, and moved to Walcha (a small town in the New England Tableland). Her family received an Australia Day award for their contribution to tourism in Walcha in 1999. A year later, Aitchison moved to Maitland with six-week-old son Joshua.
Aitchison was also Managing Director of tourism company Northern Highland Travel Pty Ltd, where she operated package coach tours across the region. At its peak, the company employed 35 employees and undertook tours all over Australia, specialising in providing unique tours showcasing regional and remote destinations and events.
Working in the tourism and hospitality industries, Aitchison has won approximately 20 local, regional, state and national tourism and business awards, including the NSW Tourism Awards three years in a row. In 2003 her company was inducted into the Tourism NSW Hall of Fame. In 2006, Aitchison won the BusNSW and the Bus Industry Confederation's National Young Achiever Award and her business was a finalist in the Telstra Business Awards. In 2005, Aitchison was awarded the Lower Hunter Business Woman of the Year.
Aitchison was active in a number of business and industry organisations, including BusNSW, the national Bus Industry Confederation and Hunter Tourism, the Maitland Business Chamber and the Lower Hunter Business Enterprise Centre.
In 2005, Vicki Woods and Bronwyn Ridgway founded the non-party political Women's Network, Hunter NSW with the aim of increasing the number of women participating in decision-making roles in the community. At the time there were no females representing Maitland at the State or Federal level and only two female councillors on Maitland City Council. Woods and Ridgway asked Aitchison to be the Foundation President of the organisation, which she went on to lead for seven years. On the resignation of Woods as Secretary Aitchison then took on the role for an additional two years.
Political career
Aitchison was elected as member for Maitland at the 2015 New South Wales election with a vote of 63%, beating incumbent Robyn Parker on a swing of +18.8 points. Following the election, she was elected as the NSW Chair of Commonwealth Women Parliamentarians (CWP) and was elected as deputy chair of the CWP National Steering Committee in 2016.
In March 2016, Jodie Harrison resigned from the shadow ministry. Aitchison was promoted to replace her in the shadow cabinet and was appointed as Shadow Minister for the Prevention of Domestic Violence and Sexual Assault, and Shadow Minister for Small Business.
At the 2019 New South Wales election, Aitchison was re-elected with a first preference vote increase of +1.79 points, but the overall two-party vote suffered a small swing of −0.62 points against her this was likely due to 8 candidates contesting the seat. During the 2019 ALP NSW Leadership contest, Aitchison supported new leader Jodi McKay and following the shadow ministry reshuffle was promoted to Shadow Minister for Investment and Tourism, Medical Research, and Primary Industries. Following the appointment of Chris Minns as the Leader of the Opposition in June 2021, Aitchison was designated as the Shadow Minister for Regional Transport and Roads. She retained the portfolio in the Minns government.
References
Living people
Australian Labor Party members of the Parliament of New South Wales
Members of the New South Wales Legislative Assembly
Australian National University alumni
University of Canberra alumni
University of Sydney alumni
21st-century Australian businesswomen
21st-century Australian businesspeople
People from Canberra
Year of birth missing (living people)
Women members of the New South Wales Legislative Assembly
21st-century Australian politicians
21st-century Australian women politicians
|
Brachybacterium saurashtrense is a species of Gram positive, strictly aerobic, halotolerant, pale yellow-pigmented bacterium. The cells are coccoid during the stationary phase, and irregular rods during the exponential phase. It was first isolated from roots of Salicornia brachiate plants collected from coastal marshy swamps, in Bhavnagar, Gujarat, India. The species was first proposed in 2011, and the name is derived from Saurashtra, the region where it was first isolated.
The optimum growth temperature for B. saurashtrense is 30 °C, but can grow in the 10-45 °C range. The pH optimum is 8.0, and can grow in the 6.0-11.0 range. The cells are halotolerant, and can survive in NaCl salt concentrations up to 15%, and can grow in concentrations of 8%.
References
Micrococcales
Bacteria described in 2011
|
```c++
//===- InstrDocsEmitter.cpp - Opcode Documentation Generator --------------===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
//
// InstrDocsEmitter generates restructured text documentation for the opcodes
// that can be used by MachineInstr. For each opcode, the documentation lists:
// * Opcode name
// * Assembly string
// * Flags (e.g. mayLoad, isBranch, ...)
// * Operands, including type and name
// * Operand constraints
// * Implicit register uses & defs
// * Predicates
//
//===your_sha256_hash------===//
#include "CodeGenDAGPatterns.h"
#include "CodeGenInstruction.h"
#include "CodeGenTarget.h"
#include "TableGenBackends.h"
#include "llvm/TableGen/Record.h"
#include <string>
#include <vector>
using namespace llvm;
namespace llvm {
void writeTitle(StringRef Str, raw_ostream &OS, char Kind = '-') {
OS << std::string(Str.size(), Kind) << "\n" << Str << "\n"
<< std::string(Str.size(), Kind) << "\n";
}
void writeHeader(StringRef Str, raw_ostream &OS, char Kind = '-') {
OS << Str << "\n" << std::string(Str.size(), Kind) << "\n";
}
std::string escapeForRST(StringRef Str) {
std::string Result;
Result.reserve(Str.size() + 4);
for (char C : Str) {
switch (C) {
// We want special characters to be shown as their C escape codes.
case '\n': Result += "\\n"; break;
case '\t': Result += "\\t"; break;
// Underscore at the end of a line has a special meaning in rst.
case '_': Result += "\\_"; break;
default: Result += C;
}
}
return Result;
}
void EmitInstrDocs(RecordKeeper &RK, raw_ostream &OS) {
CodeGenDAGPatterns CDP(RK);
CodeGenTarget &Target = CDP.getTargetInfo();
unsigned VariantCount = Target.getAsmParserVariantCount();
// Page title.
std::string Title = std::string(Target.getName());
Title += " Instructions";
writeTitle(Title, OS);
OS << "\n";
for (const CodeGenInstruction *II : Target.getInstructionsByEnumValue()) {
Record *Inst = II->TheDef;
// Don't print the target-independent instructions.
if (II->Namespace == "TargetOpcode")
continue;
// Heading (instruction name).
writeHeader(escapeForRST(Inst->getName()), OS, '=');
OS << "\n";
// Assembly string(s).
if (!II->AsmString.empty()) {
for (unsigned VarNum = 0; VarNum < VariantCount; ++VarNum) {
Record *AsmVariant = Target.getAsmParserVariant(VarNum);
OS << "Assembly string";
if (VariantCount != 1)
OS << " (" << AsmVariant->getValueAsString("Name") << ")";
std::string AsmString =
CodeGenInstruction::FlattenAsmStringVariants(II->AsmString, VarNum);
// We trim spaces at each end of the asm string because rst needs the
// formatting backticks to be next to a non-whitespace character.
OS << ": ``" << escapeForRST(StringRef(AsmString).trim(" "))
<< "``\n\n";
}
}
// Boolean flags.
std::vector<const char *> FlagStrings;
#define xstr(s) str(s)
#define str(s) #s
#define FLAG(f) if (II->f) { FlagStrings.push_back(str(f)); }
FLAG(isReturn)
FLAG(isEHScopeReturn)
FLAG(isBranch)
FLAG(isIndirectBranch)
FLAG(isCompare)
FLAG(isMoveImm)
FLAG(isBitcast)
FLAG(isSelect)
FLAG(isBarrier)
FLAG(isCall)
FLAG(isAdd)
FLAG(isTrap)
FLAG(canFoldAsLoad)
FLAG(mayLoad)
//FLAG(mayLoad_Unset) // Deliberately omitted.
FLAG(mayStore)
//FLAG(mayStore_Unset) // Deliberately omitted.
FLAG(isPredicable)
FLAG(isConvertibleToThreeAddress)
FLAG(isCommutable)
FLAG(isTerminator)
FLAG(isReMaterializable)
FLAG(hasDelaySlot)
FLAG(usesCustomInserter)
FLAG(hasPostISelHook)
FLAG(hasCtrlDep)
FLAG(isNotDuplicable)
FLAG(hasSideEffects)
//FLAG(hasSideEffects_Unset) // Deliberately omitted.
FLAG(isAsCheapAsAMove)
FLAG(hasExtraSrcRegAllocReq)
FLAG(hasExtraDefRegAllocReq)
FLAG(isCodeGenOnly)
FLAG(isPseudo)
FLAG(isRegSequence)
FLAG(isExtractSubreg)
FLAG(isInsertSubreg)
FLAG(isConvergent)
FLAG(hasNoSchedulingInfo)
FLAG(variadicOpsAreDefs)
FLAG(isAuthenticated)
if (!FlagStrings.empty()) {
OS << "Flags: ";
ListSeparator LS;
for (auto FlagString : FlagStrings)
OS << LS << "``" << FlagString << "``";
OS << "\n\n";
}
// Operands.
for (unsigned i = 0; i < II->Operands.size(); ++i) {
bool IsDef = i < II->Operands.NumDefs;
auto Op = II->Operands[i];
if (Op.MINumOperands > 1) {
// This operand corresponds to multiple operands on the
// MachineInstruction, so print all of them, showing the types and
// names of both the compound operand and the basic operands it
// contains.
for (unsigned SubOpIdx = 0; SubOpIdx < Op.MINumOperands; ++SubOpIdx) {
Record *SubRec =
cast<DefInit>(Op.MIOperandInfo->getArg(SubOpIdx))->getDef();
StringRef SubOpName = Op.MIOperandInfo->getArgNameStr(SubOpIdx);
StringRef SubOpTypeName = SubRec->getName();
OS << "* " << (IsDef ? "DEF" : "USE") << " ``" << Op.Rec->getName()
<< "/" << SubOpTypeName << ":$" << Op.Name << ".";
// Not all sub-operands are named, make up a name for these.
if (SubOpName.empty())
OS << "anon" << SubOpIdx;
else
OS << SubOpName;
OS << "``\n\n";
}
} else {
// The operand corresponds to only one MachineInstruction operand.
OS << "* " << (IsDef ? "DEF" : "USE") << " ``" << Op.Rec->getName()
<< ":$" << Op.Name << "``\n\n";
}
}
// Constraints.
StringRef Constraints = Inst->getValueAsString("Constraints");
if (!Constraints.empty()) {
OS << "Constraints: ``" << Constraints << "``\n\n";
}
// Implicit definitions.
if (!II->ImplicitDefs.empty()) {
OS << "Implicit defs: ";
ListSeparator LS;
for (Record *Def : II->ImplicitDefs)
OS << LS << "``" << Def->getName() << "``";
OS << "\n\n";
}
// Implicit uses.
if (!II->ImplicitUses.empty()) {
OS << "Implicit uses: ";
ListSeparator LS;
for (Record *Use : II->ImplicitUses)
OS << LS << "``" << Use->getName() << "``";
OS << "\n\n";
}
// Predicates.
std::vector<Record *> Predicates =
II->TheDef->getValueAsListOfDefs("Predicates");
if (!Predicates.empty()) {
OS << "Predicates: ";
ListSeparator LS;
for (Record *P : Predicates)
OS << LS << "``" << P->getName() << "``";
OS << "\n\n";
}
}
}
} // end namespace llvm
```
|
Paul Brock is an Irish button accordionist born in Athlone now residing in Ennis. In May 1989, Brock co-founded the group Moving Cloud with fiddle player, Manus McGuire. In 2001 he co-founded the new group The Brock McGuire Band also with Manus McGuire. In 2004, Brock was voted Best Male Musician by the Irish American News. His recent album Humdinger with fellow band member Enda Scahill was voted Irish Music Album of The Year by the Irish Times and has been released by Compass Records.
Discography
Green Grass Blue Grass
Humdinger
Brock McGuire Band
Mo Chairdin
Tribute to Joe Cooley (with Frankie Gavin)
Moving Cloud
Foxglove
Hands Across The Water
References
Corofin Trad Festival bio
The Irish Music Magazine Charts
Irish Music Review
Irish Times Review
External links
Paul Brock & Enda Scahill
Year of birth missing (living people)
Living people
Irish male accordionists
Musicians from County Clare
Musicians from County Westmeath
People from Athlone
People from Ennis
20th-century Irish male musicians
20th-century Irish accordionists
21st-century Irish male musicians
21st-century Irish accordionists
|
```php
<?php
namespace MathPHP\Tests\Probability\Distribution\Continuous;
use MathPHP\Exception;
use MathPHP\Probability\Distribution\Continuous\Beta;
class BetaTest extends \PHPUnit\Framework\TestCase
{
/**
* @test pdf
* @dataProvider dataProviderForPdf
* @param float $x
* @param float $
* @param float $
* @param float $expected_pdf
*/
public function testPdf(float $x, float $, float $, float $expected_pdf)
{
// Given
$beta = new Beta($, $);
// When
$pdf = $beta->pdf($x);
// Then
$this->assertEqualsWithDelta($expected_pdf, $pdf, 0.0000001);
}
/**
* @return array [x, , , pdf]
* Generated with path_to_url
*/
public function dataProviderForPdf(): array
{
return [
[0, 1, 1, 1],
[0.01, 1, 1, 1],
[0.15, 1, 1, 1],
[0.81, 1, 1, 1],
[0.99, 1, 1, 1],
[1, 1, 1, 1],
[0, 2, 3, 0],
[0.01, 2, 3, 0.117612],
[0.02, 2, 3, 0.230496],
[0.03, 2, 3, 0.338724],
[0.04, 2, 3, 0.442368],
[0.05, 2, 3, 0.5415],
[0.06, 2, 3, 0.636192],
[0.07, 2, 3, 0.726516],
[0.08, 2, 3, 0.812544],
[0.09, 2, 3, 0.894348],
[0.1, 2, 3, 0.972],
[0.11, 2, 3, 1.045572],
[0.12, 2, 3, 1.115136],
[0.13, 2, 3, 1.180764],
[0.14, 2, 3, 1.242528],
[0.15, 2, 3, 1.3005],
[0.16, 2, 3, 1.354752],
[0.17, 2, 3, 1.405356],
[0.18, 2, 3, 1.452384],
[0.19, 2, 3, 1.495908],
[0.2, 2, 3, 1.536],
[0.21, 2, 3, 1.572732],
[0.22, 2, 3, 1.606176],
[0.23, 2, 3, 1.636404],
[0.24, 2, 3, 1.663488],
[0.25, 2, 3, 1.6875],
[0.26, 2, 3, 1.708512],
[0.27, 2, 3, 1.726596],
[0.28, 2, 3, 1.741824],
[0.29, 2, 3, 1.754268],
[0.3, 2, 3, 1.764],
[0.31, 2, 3, 1.771092],
[0.32, 2, 3, 1.775616],
[0.33, 2, 3, 1.777644],
[0.34, 2, 3, 1.777248],
[0.35, 2, 3, 1.7745],
[0.36, 2, 3, 1.769472],
[0.37, 2, 3, 1.762236],
[0.38, 2, 3, 1.752864],
[0.39, 2, 3, 1.741428],
[0.4, 2, 3, 1.728],
[0.41, 2, 3, 1.712652],
[0.42, 2, 3, 1.695456],
[0.43, 2, 3, 1.676484],
[0.44, 2, 3, 1.655808],
[0.45, 2, 3, 1.6335],
[0.46, 2, 3, 1.609632],
[0.47, 2, 3, 1.584276],
[0.48, 2, 3, 1.557504],
[0.49, 2, 3, 1.529388],
[0.5, 2, 3, 1.5],
[0.51, 2, 3, 1.469412],
[0.52, 2, 3, 1.437696],
[0.53, 2, 3, 1.404924],
[0.54, 2, 3, 1.371168],
[0.55, 2, 3, 1.3365],
[0.56, 2, 3, 1.300992],
[0.57, 2, 3, 1.264716],
[0.58, 2, 3, 1.227744],
[0.59, 2, 3, 1.190148],
[0.6, 2, 3, 1.152],
[0.61, 2, 3, 1.113372],
[0.62, 2, 3, 1.074336],
[0.63, 2, 3, 1.034964],
[0.64, 2, 3, 0.995328],
[0.65, 2, 3, 0.9555],
[0.66, 2, 3, 0.915552],
[0.67, 2, 3, 0.875556],
[0.68, 2, 3, 0.835584],
[0.69, 2, 3, 0.795708],
[0.7, 2, 3, 0.756],
[0.71, 2, 3, 0.716532],
[0.72, 2, 3, 0.677376],
[0.73, 2, 3, 0.638604],
[0.74, 2, 3, 0.600288],
[0.75, 2, 3, 0.5625],
[0.76, 2, 3, 0.525312],
[0.77, 2, 3, 0.488796],
[0.78, 2, 3, 0.453024],
[0.79, 2, 3, 0.418068],
[0.8, 2, 3, 0.384],
[0.81, 2, 3, 0.350892],
[0.82, 2, 3, 0.318816],
[0.83, 2, 3, 0.287844],
[0.84, 2, 3, 0.258048],
[0.85, 2, 3, 0.2295],
[0.86, 2, 3, 0.202272],
[0.87, 2, 3, 0.176436],
[0.88, 2, 3, 0.152064],
[0.89, 2, 3, 0.129228],
[0.9, 2, 3, 0.108],
[0.91, 2, 3, 0.088452],
[0.92, 2, 3, 0.070656],
[0.93, 2, 3, 0.054684],
[0.94, 2, 3, 0.040608],
[0.95, 2, 3, 0.0285],
[0.96, 2, 3, 0.018432],
[0.97, 2, 3, 0.010476],
[0.98, 2, 3, 0.004704],
[0.99, 2, 3, 0.001188],
[1, 2, 3, 0],
[0, 5.3, 4.1, 0],
[0.01, 5.3, 4.1, 8.992682837E-7],
[0.02, 5.3, 4.1, 1.716524432E-5],
[0.03, 5.3, 4.1, 9.506790967E-5],
[0.04, 5.3, 4.1, 3.17189614E-4],
[0.05, 5.3, 4.1, 8.01556921E-4],
[0.06, 5.3, 4.1, 0.0016988964],
[0.07, 5.3, 4.1, 0.003188885207],
[0.08, 5.3, 4.1, 0.005475822755],
[0.09, 5.3, 4.1, 0.008783978823],
[0.1, 5.3, 4.1, 0.01335278796],
[0.11, 5.3, 4.1, 0.01943201066],
[0.12, 5.3, 4.1, 0.02727695046],
[0.13, 5.3, 4.1, 0.03714379479],
[0.14, 5.3, 4.1, 0.04928513217],
[0.15, 5.3, 4.1, 0.06394568691],
[0.16, 5.3, 4.1, 0.08135830378],
[0.17, 5.3, 4.1, 0.1017402081],
[0.18, 5.3, 4.1, 0.125289561],
[0.19, 5.3, 4.1, 0.1521823254],
[0.2, 5.3, 4.1, 0.182569453],
[0.21, 5.3, 4.1, 0.2165744019],
[0.22, 5.3, 4.1, 0.254290988],
[0.23, 5.3, 4.1, 0.2957815744],
[0.24, 5.3, 4.1, 0.3410755976],
[0.25, 5.3, 4.1, 0.3901684309],
[0.26, 5.3, 4.1, 0.4430205794],
[0.27, 5.3, 4.1, 0.4995572033],
[0.28, 5.3, 4.1, 0.5596679626],
[0.29, 5.3, 4.1, 0.6232071758],
[0.3, 5.3, 4.1, 0.6899942834],
[0.31, 5.3, 4.1, 0.7598146065],
[0.32, 5.3, 4.1, 0.8324203897],
[0.33, 5.3, 4.1, 0.9075321165],
[0.34, 5.3, 4.1, 0.9848400846],
[0.35, 5.3, 4.1, 1.064006227],
[0.36, 5.3, 4.1, 1.144666166],
[0.37, 5.3, 4.1, 1.226431482],
[0.38, 5.3, 4.1, 1.30889219],
[0.39, 5.3, 4.1, 1.391619392],
[0.4, 5.3, 4.1, 1.474168111],
[0.41, 5.3, 4.1, 1.55608026],
[0.42, 5.3, 4.1, 1.636887763],
[0.43, 5.3, 4.1, 1.716115781],
[0.44, 5.3, 4.1, 1.793286033],
[0.45, 5.3, 4.1, 1.867920206],
[0.46, 5.3, 4.1, 1.939543413],
[0.47, 5.3, 4.1, 2.007687699],
[0.48, 5.3, 4.1, 2.071895558],
[0.49, 5.3, 4.1, 2.131723453],
[0.5, 5.3, 4.1, 2.186745318],
[0.51, 5.3, 4.1, 2.23655601],
[0.52, 5.3, 4.1, 2.2807747],
[0.53, 5.3, 4.1, 2.319048184],
[0.54, 5.3, 4.1, 2.351054078],
[0.55, 5.3, 4.1, 2.376503897],
[0.56, 5.3, 4.1, 2.395145972],
[0.57, 5.3, 4.1, 2.406768202],
[0.58, 5.3, 4.1, 2.411200616],
[0.59, 5.3, 4.1, 2.408317709],
[0.6, 5.3, 4.1, 2.398040553],
[0.61, 5.3, 4.1, 2.380338635],
[0.62, 5.3, 4.1, 2.355231427],
[0.63, 5.3, 4.1, 2.322789641],
[0.64, 5.3, 4.1, 2.283136168],
[0.65, 5.3, 4.1, 2.236446659],
[0.66, 5.3, 4.1, 2.182949752],
[0.67, 5.3, 4.1, 2.122926892],
[0.68, 5.3, 4.1, 2.056711757],
[0.69, 5.3, 4.1, 1.984689236],
[0.7, 5.3, 4.1, 1.907293967],
[0.71, 5.3, 4.1, 1.825008394],
[0.72, 5.3, 4.1, 1.73836034],
[0.73, 5.3, 4.1, 1.647920061],
[0.74, 5.3, 4.1, 1.554296779],
[0.75, 5.3, 4.1, 1.458134658],
[0.76, 5.3, 4.1, 1.360108233],
[0.77, 5.3, 4.1, 1.260917242],
[0.78, 5.3, 4.1, 1.16128088],
[0.79, 5.3, 4.1, 1.061931442],
[0.8, 5.3, 4.1, 0.96360735],
[0.81, 5.3, 4.1, 0.8670455576],
[0.82, 5.3, 4.1, 0.7729733206],
[0.83, 5.3, 4.1, 0.6820993361],
[0.84, 5.3, 4.1, 0.5951042469],
[0.85, 5.3, 4.1, 0.5126305178],
[0.86, 5.3, 4.1, 0.4352716926],
[0.87, 5.3, 4.1, 0.3635610522],
[0.88, 5.3, 4.1, 0.2979596986],
[0.89, 5.3, 4.1, 0.2388441045],
[0.9, 5.3, 4.1, 0.1864931841],
[0.91, 5.3, 4.1, 0.1410749612],
[0.92, 5.3, 4.1, 0.1026329449],
[0.93, 5.3, 4.1, 0.07107236645],
[0.94, 5.3, 4.1, 0.04614650559],
[0.95, 5.3, 4.1, 0.0274434489],
[0.96, 5.3, 4.1, 0.01437382816],
[0.97, 5.3, 4.1, 0.006160479551],
[0.98, 5.3, 4.1, 0.001831830498],
[0.99, 5.3, 4.1, 2.231780662E-4],
[1, 5.3, 4.1, 0],
[0, 3, 2, 0],
[0.01, 3, 2, 0.001188],
[0.15, 3, 2, 0.2295],
[0.81, 3, 2, 1.495908],
[0.99, 3, 2, 0.117612],
[1, 3, 2, 0],
[0, 10, 50, 0],
[0.01, 10, 50, 3.8395492E-7],
[0.15, 10, 50, 8.404355],
[0.81, 10, 50, 3.3949479E-26],
[0.99, 10, 50, 5.739479E-87],
[1, 10, 50, 0],
];
}
/**
* @test Constructor throws an Exception\OutOfBoundsException if alpha or beta is less than or equal to zero
* @dataProvider dataProviderForPdfAlphaBetaOutOfBoundsException
* @param float $
* @param float $
*/
public function testConstructorExceptionAlphaBetaLessThanEqualZero(float $, float $)
{
// Then
$this->expectException(Exception\OutOfBoundsException::class);
// When
new Beta($, $);
}
/**
* @return array [, ]
*/
public function dataProviderForPdfAlphaBetaOutOfBoundsException(): array
{
return [
[1, -3],
[1, -2],
[1, -1],
[1, 0],
[-3, 1],
[-2, 1],
[-1, 1],
[0, 1],
];
}
/**
* @test pdf throws an Exception\OutOfBoundsException if the support x is less than 0 or greater than 1
* @dataProvider dataProviderForPdfSupportOutOfBoundsException
* @param float $x
*/
public function testPdfExceptionXOutOfBounds(float $x)
{
// Given
[$, $] = [1, 1];
$beta = new Beta($, $);
// Then
$this->expectException(Exception\OutOfBoundsException::class);
// When
$beta->pdf($x);
}
/**
* @return array
*/
public function dataProviderForPdfSupportOutOfBoundsException(): array
{
return [
[-3],
[-2],
[-1],
[-0.01],
[1.01],
[2],
[3],
];
}
/**
* @test cdf
* @dataProvider dataProviderForCdf
* @param float $x
* @param float $
* @param float $
* @param float $expected_cdf
*/
public function testCdf($x, $, $, $expected_cdf)
{
// Given
$beta = new Beta($, $);
// When
$cdf = $beta->cdf($x);
// Then
$this->assertEqualsWithDelta($expected_cdf, $cdf, 0.000001);
}
/**
* @return array [x, , , cdf]
* Generated with path_to_url
*/
public function dataProviderForCdf()
{
return [
[0, 1, 1, 0],
[0.01, 1, 1, 0.01],
[0.02, 1, 1, 0.02],
[0.03, 1, 1, 0.03],
[0.04, 1, 1, 0.04],
[0.05, 1, 1, 0.05],
[0.06, 1, 1, 0.06],
[0.07, 1, 1, 0.07],
[0.08, 1, 1, 0.08],
[0.09, 1, 1, 0.09],
[0.1, 1, 1, 0.1],
[0.11, 1, 1, 0.11],
[0.12, 1, 1, 0.12],
[0.13, 1, 1, 0.13],
[0.14, 1, 1, 0.14],
[0.15, 1, 1, 0.15],
[0.16, 1, 1, 0.16],
[0.17, 1, 1, 0.17],
[0.18, 1, 1, 0.18],
[0.19, 1, 1, 0.19],
[0.2, 1, 1, 0.2],
[0.21, 1, 1, 0.21],
[0.22, 1, 1, 0.22],
[0.23, 1, 1, 0.23],
[0.24, 1, 1, 0.24],
[0.25, 1, 1, 0.25],
[0.26, 1, 1, 0.26],
[0.27, 1, 1, 0.27],
[0.28, 1, 1, 0.28],
[0.29, 1, 1, 0.29],
[0.3, 1, 1, 0.3],
[0.31, 1, 1, 0.31],
[0.32, 1, 1, 0.32],
[0.33, 1, 1, 0.33],
[0.34, 1, 1, 0.34],
[0.35, 1, 1, 0.35],
[0.36, 1, 1, 0.36],
[0.37, 1, 1, 0.37],
[0.38, 1, 1, 0.38],
[0.39, 1, 1, 0.39],
[0.4, 1, 1, 0.4],
[0.41, 1, 1, 0.41],
[0.42, 1, 1, 0.42],
[0.43, 1, 1, 0.43],
[0.44, 1, 1, 0.44],
[0.45, 1, 1, 0.45],
[0.46, 1, 1, 0.46],
[0.47, 1, 1, 0.47],
[0.48, 1, 1, 0.48],
[0.49, 1, 1, 0.49],
[0.5, 1, 1, 0.5],
[0.51, 1, 1, 0.51],
[0.52, 1, 1, 0.52],
[0.53, 1, 1, 0.53],
[0.54, 1, 1, 0.54],
[0.55, 1, 1, 0.55],
[0.56, 1, 1, 0.56],
[0.57, 1, 1, 0.57],
[0.58, 1, 1, 0.58],
[0.59, 1, 1, 0.59],
[0.6, 1, 1, 0.6],
[0.61, 1, 1, 0.61],
[0.62, 1, 1, 0.62],
[0.63, 1, 1, 0.63],
[0.64, 1, 1, 0.64],
[0.65, 1, 1, 0.65],
[0.66, 1, 1, 0.66],
[0.67, 1, 1, 0.67],
[0.68, 1, 1, 0.68],
[0.69, 1, 1, 0.69],
[0.7, 1, 1, 0.7],
[0.71, 1, 1, 0.71],
[0.72, 1, 1, 0.72],
[0.73, 1, 1, 0.73],
[0.74, 1, 1, 0.74],
[0.75, 1, 1, 0.75],
[0.76, 1, 1, 0.76],
[0.77, 1, 1, 0.77],
[0.78, 1, 1, 0.78],
[0.79, 1, 1, 0.79],
[0.8, 1, 1, 0.8],
[0.81, 1, 1, 0.81],
[0.82, 1, 1, 0.82],
[0.83, 1, 1, 0.83],
[0.84, 1, 1, 0.84],
[0.85, 1, 1, 0.85],
[0.86, 1, 1, 0.86],
[0.87, 1, 1, 0.87],
[0.88, 1, 1, 0.88],
[0.89, 1, 1, 0.89],
[0.9, 1, 1, 0.9],
[0.91, 1, 1, 0.91],
[0.92, 1, 1, 0.92],
[0.93, 1, 1, 0.93],
[0.94, 1, 1, 0.94],
[0.95, 1, 1, 0.95],
[0.96, 1, 1, 0.96],
[0.97, 1, 1, 0.97],
[0.98, 1, 1, 0.98],
[0.99, 1, 1, 0.99],
[1, 1, 1, 1],
[0, 2, 3, 0],
[0.01, 2, 3, 5.9203E-4],
[0.02, 2, 3, 0.00233648],
[0.03, 2, 3, 0.00518643],
[0.04, 2, 3, 0.00909568],
[0.05, 2, 3, 0.01401875],
[0.06, 2, 3, 0.01991088],
[0.07, 2, 3, 0.02672803],
[0.08, 2, 3, 0.03442688],
[0.09, 2, 3, 0.04296483],
[0.1, 2, 3, 0.0523],
[0.11, 2, 3, 0.06239123],
[0.12, 2, 3, 0.07319808],
[0.13, 2, 3, 0.08468083],
[0.14, 2, 3, 0.09680048],
[0.15, 2, 3, 0.10951875],
[0.16, 2, 3, 0.12279808],
[0.17, 2, 3, 0.13660163],
[0.18, 2, 3, 0.15089328],
[0.19, 2, 3, 0.16563763],
[0.2, 2, 3, 0.1808],
[0.21, 2, 3, 0.19634643],
[0.22, 2, 3, 0.21224368],
[0.23, 2, 3, 0.22845923],
[0.24, 2, 3, 0.24496128],
[0.25, 2, 3, 0.26171875],
[0.26, 2, 3, 0.27870128],
[0.27, 2, 3, 0.29587923],
[0.28, 2, 3, 0.31322368],
[0.29, 2, 3, 0.33070643],
[0.3, 2, 3, 0.3483],
[0.31, 2, 3, 0.36597763],
[0.32, 2, 3, 0.38371328],
[0.33, 2, 3, 0.40148163],
[0.34, 2, 3, 0.41925808],
[0.35, 2, 3, 0.43701875],
[0.36, 2, 3, 0.45474048],
[0.37, 2, 3, 0.47240083],
[0.38, 2, 3, 0.48997808],
[0.39, 2, 3, 0.50745123],
[0.4, 2, 3, 0.5248],
[0.41, 2, 3, 0.54200483],
[0.42, 2, 3, 0.55904688],
[0.43, 2, 3, 0.57590803],
[0.44, 2, 3, 0.59257088],
[0.45, 2, 3, 0.60901875],
[0.46, 2, 3, 0.62523568],
[0.47, 2, 3, 0.64120643],
[0.48, 2, 3, 0.65691648],
[0.49, 2, 3, 0.67235203],
[0.5, 2, 3, 0.6875],
[0.51, 2, 3, 0.70234803],
[0.52, 2, 3, 0.71688448],
[0.53, 2, 3, 0.73109843],
[0.54, 2, 3, 0.74497968],
[0.55, 2, 3, 0.75851875],
[0.56, 2, 3, 0.77170688],
[0.57, 2, 3, 0.78453603],
[0.58, 2, 3, 0.79699888],
[0.59, 2, 3, 0.80908883],
[0.6, 2, 3, 0.8208],
[0.61, 2, 3, 0.83212723],
[0.62, 2, 3, 0.84306608],
[0.63, 2, 3, 0.85361283],
[0.64, 2, 3, 0.86376448],
[0.65, 2, 3, 0.87351875],
[0.66, 2, 3, 0.88287408],
[0.67, 2, 3, 0.89182963],
[0.68, 2, 3, 0.90038528],
[0.69, 2, 3, 0.90854163],
[0.7, 2, 3, 0.9163],
[0.71, 2, 3, 0.92366243],
[0.72, 2, 3, 0.93063168],
[0.73, 2, 3, 0.93721123],
[0.74, 2, 3, 0.94340528],
[0.75, 2, 3, 0.94921875],
[0.76, 2, 3, 0.95465728],
[0.77, 2, 3, 0.95972723],
[0.78, 2, 3, 0.96443568],
[0.79, 2, 3, 0.96879043],
[0.8, 2, 3, 0.9728],
[0.81, 2, 3, 0.97647363],
[0.82, 2, 3, 0.97982128],
[0.83, 2, 3, 0.98285363],
[0.84, 2, 3, 0.98558208],
[0.85, 2, 3, 0.98801875],
[0.86, 2, 3, 0.99017648],
[0.87, 2, 3, 0.99206883],
[0.88, 2, 3, 0.99371008],
[0.89, 2, 3, 0.99511523],
[0.9, 2, 3, 0.9963],
[0.91, 2, 3, 0.99728083],
[0.92, 2, 3, 0.99807488],
[0.93, 2, 3, 0.99870003],
[0.94, 2, 3, 0.99917488],
[0.95, 2, 3, 0.99951875],
[0.96, 2, 3, 0.99975168],
[0.97, 2, 3, 0.99989443],
[0.98, 2, 3, 0.99996848],
[0.99, 2, 3, 0.99999603],
[1, 2, 3, 1],
[0, 3, 2, 0],
[0.01, 3, 2, 3.97E-6],
[0.02, 3, 2, 3.152E-5],
[0.03, 3, 2, 1.0557E-4],
[0.04, 3, 2, 2.4832E-4],
[0.05, 3, 2, 4.8125E-4],
[0.06, 3, 2, 8.2512E-4],
[0.07, 3, 2, 0.00129997],
[0.08, 3, 2, 0.00192512],
[0.09, 3, 2, 0.00271917],
[0.1, 3, 2, 0.0037],
[0.11, 3, 2, 0.00488477],
[0.12, 3, 2, 0.00628992],
[0.13, 3, 2, 0.00793117],
[0.14, 3, 2, 0.00982352],
[0.15, 3, 2, 0.01198125],
[0.16, 3, 2, 0.01441792],
[0.17, 3, 2, 0.01714637],
[0.18, 3, 2, 0.02017872],
[0.19, 3, 2, 0.02352637],
[0.2, 3, 2, 0.0272],
[0.21, 3, 2, 0.03120957],
[0.22, 3, 2, 0.03556432],
[0.23, 3, 2, 0.04027277],
[0.24, 3, 2, 0.04534272],
[0.25, 3, 2, 0.05078125],
[0.26, 3, 2, 0.05659472],
[0.27, 3, 2, 0.06278877],
[0.28, 3, 2, 0.06936832],
[0.29, 3, 2, 0.07633757],
[0.3, 3, 2, 0.0837],
[0.31, 3, 2, 0.09145837],
[0.32, 3, 2, 0.09961472],
[0.33, 3, 2, 0.10817037],
[0.34, 3, 2, 0.11712592],
[0.35, 3, 2, 0.12648125],
[0.36, 3, 2, 0.13623552],
[0.37, 3, 2, 0.14638717],
[0.38, 3, 2, 0.15693392],
[0.39, 3, 2, 0.16787277],
[0.4, 3, 2, 0.1792],
[0.41, 3, 2, 0.19091117],
[0.42, 3, 2, 0.20300112],
[0.43, 3, 2, 0.21546397],
[0.44, 3, 2, 0.22829312],
[0.45, 3, 2, 0.24148125],
[0.46, 3, 2, 0.25502032],
[0.47, 3, 2, 0.26890157],
[0.48, 3, 2, 0.28311552],
[0.49, 3, 2, 0.29765197],
[0.5, 3, 2, 0.3125],
[0.51, 3, 2, 0.32764797],
[0.52, 3, 2, 0.34308352],
[0.53, 3, 2, 0.35879357],
[0.54, 3, 2, 0.37476432],
[0.55, 3, 2, 0.39098125],
[0.56, 3, 2, 0.40742912],
[0.57, 3, 2, 0.42409197],
[0.58, 3, 2, 0.44095312],
[0.59, 3, 2, 0.45799517],
[0.6, 3, 2, 0.4752],
[0.61, 3, 2, 0.49254877],
[0.62, 3, 2, 0.51002192],
[0.63, 3, 2, 0.52759917],
[0.64, 3, 2, 0.54525952],
[0.65, 3, 2, 0.56298125],
[0.66, 3, 2, 0.58074192],
[0.67, 3, 2, 0.59851837],
[0.68, 3, 2, 0.61628672],
[0.69, 3, 2, 0.63402237],
[0.7, 3, 2, 0.6517],
[0.71, 3, 2, 0.66929357],
[0.72, 3, 2, 0.68677632],
[0.73, 3, 2, 0.70412077],
[0.74, 3, 2, 0.72129872],
[0.75, 3, 2, 0.73828125],
[0.76, 3, 2, 0.75503872],
[0.77, 3, 2, 0.77154077],
[0.78, 3, 2, 0.78775632],
[0.79, 3, 2, 0.80365357],
[0.8, 3, 2, 0.8192],
[0.81, 3, 2, 0.83436237],
[0.82, 3, 2, 0.84910672],
[0.83, 3, 2, 0.86339837],
[0.84, 3, 2, 0.87720192],
[0.85, 3, 2, 0.89048125],
[0.86, 3, 2, 0.90319952],
[0.87, 3, 2, 0.91531917],
[0.88, 3, 2, 0.92680192],
[0.89, 3, 2, 0.93760877],
[0.9, 3, 2, 0.9477],
[0.91, 3, 2, 0.95703517],
[0.92, 3, 2, 0.96557312],
[0.93, 3, 2, 0.97327197],
[0.94, 3, 2, 0.98008912],
[0.95, 3, 2, 0.98598125],
[0.96, 3, 2, 0.99090432],
[0.97, 3, 2, 0.99481357],
[0.98, 3, 2, 0.99766352],
[0.99, 3, 2, 0.99940797],
[1, 3, 2, 1],
[0, 10, 50, 0],
[0.01, 10, 50, 4.019555174E-10],
[0.02, 10, 50, 2.627230725E-7],
[0.03, 10, 50, 9.649195527E-6],
[0.04, 10, 50, 1.089160184E-4],
[0.05, 10, 50, 6.436109147E-4],
[0.06, 10, 50, 0.002524554335],
[0.07, 10, 50, 0.007461626373],
[0.08, 10, 50, 0.01792659751],
[0.09, 10, 50, 0.03676911366],
[0.1, 10, 50, 0.06658944558],
[0.11, 10, 50, 0.109084124],
[0.12, 10, 50, 0.1645800247],
[0.13, 10, 50, 0.2318848964],
[0.14, 10, 50, 0.3084655888],
[0.15, 10, 50, 0.3908704946],
[0.16, 10, 50, 0.4752657543],
[0.17, 10, 50, 0.5579559892],
[0.18, 10, 50, 0.6357944535],
[0.19, 10, 50, 0.7064347707],
[0.2, 10, 50, 0.7684204704],
[0.21, 10, 50, 0.8211398301],
[0.22, 10, 50, 0.8646892754],
[0.23, 10, 50, 0.8996908182],
[0.24, 10, 50, 0.9271020689],
[0.25, 10, 50, 0.9480459701],
[0.26, 10, 50, 0.9636753835],
[0.27, 10, 50, 0.9750774712],
[0.28, 10, 50, 0.9832155754],
[0.29, 10, 50, 0.9889021129],
[0.3, 10, 50, 0.9927943681],
[0.31, 10, 50, 0.9954052423],
[0.32, 10, 50, 0.9971222339],
[0.33, 10, 50, 0.9982295758],
[0.34, 10, 50, 0.9989301123],
[0.35, 10, 50, 0.9993649151],
[0.36, 10, 50, 0.9996297151],
[0.37, 10, 50, 0.9997879625],
[0.38, 10, 50, 0.9998807638],
[0.39, 10, 50, 0.9999341655],
[0.4, 10, 50, 0.9999643168],
[0.41, 10, 50, 0.9999810182],
[0.42, 10, 50, 0.9999900926],
[0.43, 10, 50, 0.9999949278],
[0.44, 10, 50, 0.9999974537],
[0.45, 10, 50, 0.9999987471],
[0.46, 10, 50, 0.999999396],
[0.47, 10, 50, 0.9999997149],
[0.48, 10, 50, 0.9999998682],
[0.49, 10, 50, 0.9999999404],
[0.5, 10, 50, 0.9999999737],
[0.51, 10, 50, 0.9999999886],
[0.52, 10, 50, 0.9999999952],
[0.53, 10, 50, 0.999999998],
[0.54, 10, 50, 0.9999999992],
[0.55, 10, 50, 0.9999999997],
[0.56, 10, 50, 0.9999999999],
[0.57, 10, 50, 1],
[0.58, 10, 50, 1],
[0.59, 10, 50, 1],
[0.6, 10, 50, 1],
[0.61, 10, 50, 1],
[0.62, 10, 50, 1],
[0.63, 10, 50, 1],
[0.64, 10, 50, 1],
[0.65, 10, 50, 1],
[0.66, 10, 50, 1],
[0.67, 10, 50, 1],
[0.68, 10, 50, 1],
[0.69, 10, 50, 1],
[0.7, 10, 50, 1],
[0.71, 10, 50, 1],
[0.72, 10, 50, 1],
[0.73, 10, 50, 1],
[0.74, 10, 50, 1],
[0.75, 10, 50, 1],
[0.76, 10, 50, 1],
[0.77, 10, 50, 1],
[0.78, 10, 50, 1],
[0.79, 10, 50, 1],
[0.8, 10, 50, 1],
[0.81, 10, 50, 1],
[0.82, 10, 50, 1],
[0.83, 10, 50, 1],
[0.84, 10, 50, 1],
[0.85, 10, 50, 1],
[0.86, 10, 50, 1],
[0.87, 10, 50, 1],
[0.88, 10, 50, 1],
[0.89, 10, 50, 1],
[0.9, 10, 50, 1],
[0.91, 10, 50, 1],
[0.92, 10, 50, 1],
[0.93, 10, 50, 1],
[0.94, 10, 50, 1],
[0.95, 10, 50, 1],
[0.96, 10, 50, 1],
[0.97, 10, 50, 1],
[0.98, 10, 50, 1],
[0.99, 10, 50, 1],
[1, 10, 50, 1],
];
}
/**
* @test mean
* @dataProvider dataProviderForMean
* @param float $
* @param float $
* @param float $
*/
public function testMean(float $, float $, float $)
{
// Given
$beta = new Beta($, $);
// When
$mean = $beta->mean();
// Then
$this->assertEqualsWithDelta($, $mean, 0.000001);
}
/**
* @return array [, , ]
*/
public function dataProviderForMean(): array
{
return [
[1, 1, 0.5],
[1, 2, 0.33333333],
[2, 1, 0.66666666],
];
}
/**
* @test median
* @dataProvider dataProviderForMedian
* @param float $
* @param float $
* @param float $expected
*/
public function testMedian(float $, float $, float $expected)
{
// Given
$beta = new Beta($, $);
// When
$median = $beta->median();
// Then
$this->assertEqualsWithDelta($expected, $median, 0.000001);
}
/**
* Data generated with calculator: path_to_url
* @return array [, , ]
*/
public function dataProviderForMedian(): array
{
return [
// ==
[1, 1, 0.5],
[2, 2, 0.5],
[3, 3, 0.5],
// == 1, > 0
[1, 0.1, 0.99902344],
[1, 0.5, 0.75],
[1, 2, 0.29289322],
[1, 3, 0.20629947],
[1, 4, 0.15910358],
[1, 5, 0.12944944],
// == 1, > 0
[0.1, 1, 0.00097656],
[0.5, 1, 0.25],
[2, 1, 0.70710678],
[3, 1, 0.79370053],
[4, 1, 0.84089642],
[5, 1, 0.87055056],
// == 3, == 2
[3, 2, 0.61427243],
// == 2, == 3
[2, 3, 0.38572757],
];
}
/**
* @test median when it is approximated
* @dataProvider dataProviderForMedianApproximation
* @param float $
* @param float $
* @param float $expected
* @param float $expectedError
*/
public function testMedianApproximation(float $, float $, float $expected, float $expectedError)
{
// Given
$beta = new Beta($, $);
// When
$median = $beta->median();
// Then
$ = \abs($expected - $median);
$ = $ / $expected;
$this->assertLessThan($expectedError, $);
}
/**
* Data generated with calculator: path_to_url
* @return array [, , ]
*/
public function dataProviderForMedianApproximation(): array
{
return [
// 2 and 2 the error it is less than 1%
[2, 4, 0.31381017, 0.01],
[4, 2, 0.68618983, 0.01],
[4, 5, 0.4401552, 0.01],
[7, 4, 0.64490003, 0.01],
// , 1 the error is less than 4%
[1.8, 1.1, 0.6513904, 0.04],
[1.4, 1.3, 0.52366548, 0.04],
];
}
/**
* @test mode
* @dataProvider dataProviderForMode
* @param float $
* @param float $
* @param float $expected
*/
public function testMode(float $, float $, float $expected)
{
// Given
$beta = new Beta($, $);
// When
$mode = $beta->mode();
// Then
$this->assertEqualsWithDelta($expected, $mode, 0.000001);
}
/**
* Data generated with calculator: path_to_url
* @return array [, , ]
*/
public function dataProviderForMode(): array
{
return [
[1, 2, 0],
[1, 3, 0],
[2, 1, 1],
[3, 1, 1],
[2, 2, 0.5],
[4, 5, 0.42857143],
[7, 4, 0.66666667],
];
}
/**
* @test variance
* @dataProvider dataProviderForVariance
* @param float $
* @param float $
* @param float $expected
*/
public function testVariance(float $, float $, float $expected)
{
// Given
$beta = new Beta($, $);
// When
$variance = $beta->variance();
// Then
$this->assertEqualsWithDelta($expected, $variance, 0.000001);
}
/**
* Data generated with calculator: path_to_url
* @return array [, , var]
*/
public function dataProviderForVariance(): array
{
return [
[1, 2, 0.05555556],
[1, 3, 0.0375],
[2, 1, 0.05555556],
[3, 1, 0.0375],
[2, 2, 0.05],
[4, 5, 0.02469136],
[7, 4, 0.01928375],
];
}
/**
* @test inverse
* @dataProvider dataProviderForInverse
* @param float $
* @param float $
* @param float $x
* @param float $expected_inverse
* @throws \Exception
*/
public function testInverse(float $, float $, float $x, float $expected_inverse)
{
// Given
$beta = new Beta($, $);
// When
$inverse = $beta->inverse($x);
// Then
$this->assertEqualsWithDelta($expected_inverse, $inverse, 0.0000001);
}
/**
* @return array [, , x, inverse]
* Generated with R (stats) qbeta(x, , )
*/
public function dataProviderForInverse(): array
{
return [
[1, 1, 0, 0],
[1, 1, 0.01, 0.01],
[1, 1, 0.1, 0.1],
[1, 1, 0.2, 0.2],
[1, 1, 0.3, 0.3],
[1, 1, 0.4, 0.4],
[1, 1, 0.5, 0.5],
[1, 1, 0.6, 0.6],
[1, 1, 0.7, 0.7],
[1, 1, 0.8, 0.8],
[1, 1, 0.9, 0.9],
[1, 1, 0.99, 0.99],
[1, 1, 1, 1],
[2, 1, 0, 0],
[2, 1, 0.01, 0.1],
[2, 1, 0.1, 0.3162278],
[2, 1, 0.2, 0.4472136],
[2, 1, 0.3, 0.5477226],
[2, 1, 0.4, 0.6324555],
[2, 1, 0.5, 0.7071068],
[2, 1, 0.6, 0.7745967],
[2, 1, 0.7, 0.83666],
[2, 1, 0.8, 0.8944272],
[2, 1, 0.9, 0.9486833],
[2, 1, 0.99, 0.9949874],
[2, 1, 1, 1],
[1, 2, 0, 0],
[1, 2, 0.01, 0.005012563],
[1, 2, 0.1, 0.0513167],
[1, 2, 0.2, 0.1055728],
[1, 2, 0.3, 0.16334],
[1, 2, 0.4, 0.2254033],
[1, 2, 0.5, 0.2928932],
[1, 2, 0.6, 0.3675445],
[1, 2, 0.7, 0.4522774],
[1, 2, 0.8, 0.5527864],
[1, 2, 0.9, 0.6837722],
[1, 2, 0.99, 0.9],
[1, 2, 1, 1],
[2, 3, 0, 0],
[2, 3, 0.01, 0.04199864],
[2, 3, 0.1, 0.1425593],
[2, 3, 0.2, 0.2123171],
[2, 3, 0.3, 0.2723839],
[2, 3, 0.4, 0.3291665],
[2, 3, 0.5, 0.3857276],
[2, 3, 0.6, 0.4445],
[2, 3, 0.7, 0.5084048],
[2, 3, 0.8, 0.5824536],
[2, 3, 0.9, 0.6795394],
[2, 3, 0.99, 0.8591325],
[2, 3, 1, 1],
[4, 5, 0.2, 0.3032258],
[10, 5, 0.01, 0.3725653],
[10, 5, 0.5, 0.6742488],
[10, 5, 0.99, 0.8980714],
];
}
/**
* @test inverse throws an exception if it fails to converge on a guess within the tolerance
* @throws Exception\MathException
*/
public function testInverseFailToConvergeException()
{
// Given
[$, $, $x] = [2, 5, 0.6];
$tolerance = 1.0e-15;
$max_iterations = 2;
$beta = new Beta($, $);
// Then
$this->expectException(Exception\MathException::class);
// When
$inverse = $beta->inverse($x, $tolerance, $max_iterations);
}
/**
* @test rand
*/
public function testRand()
{
foreach (\range(1, 10) as $) {
foreach (\range(1, 10) as $) {
// Given
$beta = new Beta($, $);
foreach (\range(1, 3) as $_) {
// When
$random = $beta->rand();
// Then
$this->assertTrue(\is_numeric($random));
}
}
}
}
}
```
|
Dom Anselmo Costadoni, O.S.B. Cam., (1714–1785) was an Italian Camaldolese monk, historian and theologian.
Biography
He was born on 6 October 1714, at Venice and christened Giovanni Domenico. The son of a rich merchant, he sacrificed at an early date his prospects of success in the world and took the religious habit of the Camaldolese monks at the Monastery of St. Michael, situated on the island of Murano in the Venetian lagoon. Here he studied philosophy and theology with more than usual success.
At the age of twenty-three he revealed his literary ability in a letter (Lettera critica) written in defense of certain Camaldolese writers, who had been attacked by Giusto Fontanini in his "Library of Italian Eloquence".
Costadoni subsequently collaborated for eighteen years with the learned Dom Gian Benedetto Mittarelli of his monastery in the publication of the "Annales Camaldulenses ordinis S. Benedicti, ab anno 907 ad annum 1770" (The Annals of the Camaldolese of the Order of St. Benedict, 907-1770), printed in 9 volumes folio (Venice, 1755–73). It follows the plan of Mabillon's "Annales ordinis S. Benedicti". (Venice, 1755–73).
He died on 23 January 1785, in Venice.
Works
Some archæological papers due to his pen, such as "Dissertazione sopra il pesce come simbolo degli antichi cristiani", were published in the voluminous collection of historical essays edited by Calogerà, a monk of the same Order.
His works also include: "Avvisi ed istruzioni pratiche intorno ai principali doveri de' regolari" (Faenza, 1770; Venice, 1771); "Lettere consolatorie" (Venice, 1775); "Lettere sopra questione teologiche" (Venice, 1773).
Costadoni's unpublished manuscripts were transferred, after his death, to St. Gregory's monastery at Rome, by order of the Camaldolese abbot, Mauro Cappellari (later Pope Gregory XVI).
Sources
Catholic Encyclopedia article
Camaldolese Order
Italian historians of religion
1714 births
1785 deaths
Italian Benedictines
Benedictine scholars
18th-century Venetian historians
|
```xml
import type { FormEvent } from 'react';
import { useEffect, useState } from 'react';
import { c } from 'ttag';
import { Button } from '@proton/atoms';
import { usePaymentFacade } from '@proton/components/payments/client-extensions';
import { useChargebeeContext } from '@proton/components/payments/client-extensions/useChargebeeContext';
import type { PaymentMethodCardDetails } from '@proton/components/payments/core';
import {
Autopay,
PAYMENT_METHOD_TYPES,
isV5PaymentToken,
paymentMethodPaymentsVersion,
v5PaymentTokenToLegacyPaymentToken,
} from '@proton/components/payments/core';
import { useLoading } from '@proton/hooks';
import {
getPaymentsVersion,
setPaymentMethodV4,
setPaymentMethodV5,
updatePaymentMethod,
} from '@proton/shared/lib/api/payments';
import { captureMessage } from '@proton/shared/lib/helpers/sentry';
import { getSentryError } from '@proton/shared/lib/keys';
import noop from '@proton/utils/noop';
import type { ModalProps } from '../../components';
import { ModalTwo, ModalTwoContent, ModalTwoFooter, ModalTwoHeader } from '../../components';
import { useApi, useEventManager, useNotifications, useSubscription, useUser } from '../../hooks';
import { ChargebeeCreditCardWrapper } from '../../payments/chargebee/ChargebeeWrapper';
import type { CardModel } from '../../payments/core';
import CreditCard from './CreditCard';
import RenewToggle, { useRenewToggle } from './RenewToggle';
interface Props extends Omit<ModalProps<'form'>, 'as' | 'children' | 'size'> {
card?: CardModel;
renewState?: Autopay;
paymentMethod?: PaymentMethodCardDetails;
onMethodAdded?: () => void;
enableRenewToggle?: boolean;
}
const EditCardModal = ({
card: existingCard,
renewState,
paymentMethod,
onMethodAdded,
enableRenewToggle = true,
...rest
}: Props) => {
const api = useApi();
const [user] = useUser();
const [subscription] = useSubscription();
const { call } = useEventManager();
const [processing, withProcessing] = useLoading();
const { createNotification } = useNotifications();
const title = existingCard ? c('Title').t`Edit credit/debit card` : c('Title').t`Add credit/debit card`;
const [chargebeeFormInitialized, setChargebeeFormInitialized] = useState(false);
const {
onChange: renewOnChange,
setRenewState,
...renewToggleProps
} = useRenewToggle({ initialRenewState: renewState });
const chargebeeContext = useChargebeeContext();
const paymentFacade = usePaymentFacade({
amount: 0,
currency: user.Currency,
flow: 'add-card',
billingPlatform: subscription?.BillingPlatform,
chargebeeUserExists: user.ChargebeeUserExists,
onChargeable: async (_, { chargeablePaymentParameters, sourceType }) => {
withProcessing(async () => {
if (!isV5PaymentToken(chargeablePaymentParameters)) {
return;
}
if (sourceType === PAYMENT_METHOD_TYPES.CARD) {
const legacyPaymentToken = v5PaymentTokenToLegacyPaymentToken(chargeablePaymentParameters);
await api(
setPaymentMethodV4({
...legacyPaymentToken.Payment,
Autopay: renewToggleProps.renewState,
})
);
} else if (sourceType === PAYMENT_METHOD_TYPES.CHARGEBEE_CARD) {
await api(
setPaymentMethodV5({
PaymentToken: chargeablePaymentParameters.PaymentToken,
v: 5,
Autopay: renewToggleProps.renewState,
})
);
}
await call();
rest.onClose?.();
if (existingCard) {
createNotification({ text: c('Success').t`Payment method updated` });
} else {
createNotification({ text: c('Success').t`Payment method added` });
onMethodAdded?.();
}
}).catch(noop);
},
user,
});
const paymentMethodId = paymentMethod?.ID;
const process = async () => {
try {
await paymentFacade.selectedProcessor?.processPaymentToken();
} catch (e) {
const error = getSentryError(e);
if (error) {
const context = {
hasExistingCard: !!existingCard,
renewState,
paymentMethodId,
processorType: paymentFacade.selectedProcessor?.meta.type,
paymentsVersion: getPaymentsVersion(),
chargebeeEnabled: chargebeeContext.enableChargebeeRef.current,
};
captureMessage('Payments: failed to add card', {
level: 'error',
extra: { error, context },
});
}
}
};
const loading = paymentFacade.methods.loading;
useEffect(() => {
if (loading) {
return;
}
if (paymentFacade.methods.isMethodTypeEnabled(PAYMENT_METHOD_TYPES.CHARGEBEE_CARD)) {
paymentFacade.methods.selectMethod(PAYMENT_METHOD_TYPES.CHARGEBEE_CARD);
} else {
paymentFacade.methods.selectMethod(PAYMENT_METHOD_TYPES.CARD);
}
}, [loading]);
const isInhouseCard = paymentFacade.selectedMethodType === PAYMENT_METHOD_TYPES.CARD;
const isChargebeeCard = paymentFacade.selectedMethodType === PAYMENT_METHOD_TYPES.CHARGEBEE_CARD;
const formFullyLoaded = isInhouseCard || (isChargebeeCard && chargebeeFormInitialized);
const content = (
<>
{isInhouseCard && <CreditCard {...paymentFacade.card} loading={processing} />}
{isChargebeeCard && (
<ChargebeeCreditCardWrapper
onInitialized={() => setChargebeeFormInitialized(true)}
iframeHandles={paymentFacade.iframeHandles}
chargebeeCard={paymentFacade.chargebeeCard}
themeCode={paymentFacade.themeCode}
/>
)}
{enableRenewToggle && formFullyLoaded && (
<RenewToggle
loading={processing}
onChange={async () => {
const result = await renewOnChange();
// Case when the change wasn't done. For example because user canceled the change and decided to keep the setting as-is.
if (result === null) {
return;
}
// Case when <EditCardModal /> is rendered in Add mode. In this case there is no existing paymentMethodId.
if (!paymentMethodId) {
return;
}
void withProcessing(async () => {
try {
await api(
updatePaymentMethod(
paymentMethodId,
{
Autopay: result,
},
paymentMethodPaymentsVersion(paymentMethod)
)
);
await call().catch(noop);
const text =
result === Autopay.ENABLE
? c('Subscription renewal state').t`Auto-pay is enabled`
: c('Subscription renewal state').t`Auto-pay is disabled`;
createNotification({ text });
rest.onClose?.();
} catch {
setRenewState(result === Autopay.ENABLE ? Autopay.DISABLE : Autopay.ENABLE);
}
});
}}
{...renewToggleProps}
/>
)}
</>
);
return (
<ModalTwo
size="small"
as="form"
onSubmit={(event: FormEvent) => {
event.preventDefault();
// it handles the case when the EditCardModal is rendered as part of SubscriptionContainer.
// We need to prevent premature closing of the SubscriptionContainer by stopping the event propagation
// and subsequent handling
event.stopPropagation();
withProcessing(process()).catch(noop);
}}
{...rest}
>
<ModalTwoHeader title={title} />
<ModalTwoContent>
{/* In the future, this spinner can be passed inside of chargebee card component to
replace its internal spinner and make to loading animation continious
currently there are two stages: first wait till the facade is fully loaded,
then wait till the chargebee form is initialized. We need to find a way to use one loading spinner
for both stages
*/}
{/* {loading ? (
<div
className="flex justify-center items-center h-custom"
style={{
'--h-custom': '27rem',
}}
>
<CircleLoader size="large" />
</div>
) : (
content
)} */}
{content}
</ModalTwoContent>
{formFullyLoaded && (
<ModalTwoFooter>
<Button disabled={processing} onClick={rest.onClose}>{c('Action').t`Cancel`}</Button>
<Button loading={processing} color="norm" type="submit" data-testid="edit-card-action-save">{c(
'Action'
).t`Save`}</Button>
</ModalTwoFooter>
)}
</ModalTwo>
);
};
export default EditCardModal;
```
|
Half Dome Nunatak () is a nunatak lying south of the Cobham Range in Antarctica, at the mouth of Lucy Glacier. It was so named by the northern party of the New Zealand Geological Survey Antarctic Expedition (1961–62) because it is rounded on one side and cut into sheer cliffs on the other side.
References
Nunataks of the Ross Dependency
Shackleton Coast
|
```python
from itchatmp.config import COROUTINE
# if you have itchatmphttp installed
# we will use coroutine requests instead
if COROUTINE:
try:
from itchatmphttp import requests
except ImportError:
raise ImportError('You must installed itchatmphttp to use coroutine features')
else:
import requests
requests.packages.urllib3.disable_warnings()
requests = requests.session()
requests.verify = False
```
|
```html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "path_to_url">
<html xmlns="path_to_url">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/graph_algorithms/basic_graph/graph_representation/graph_vertex/dfs_vertex.h File Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Introduction_to_Algorithms
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('dfs__vertex_8h.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> |
<a href="#namespaces">Namespaces</a> </div>
<div class="headertitle">
<div class="title">dfs_vertex.h File Reference</div> </div>
</div><!--header-->
<div class="contents">
<div class="textblock"><code>#include "<a class="el" href="vertex_8h_source.html">vertex.h</a>"</code><br />
</div>
<p><a href="dfs__vertex_8h_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href=your_sha256_hash_vertex.html">IntroductionToAlgorithm::GraphAlgorithm::DFS_Vertex< KType ></a></td></tr>
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">DFS_Vertex2222.3 <a href=your_sha256_hash_vertex.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:namespace_introduction_to_algorithm"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></td></tr>
<tr class="memdesc:namespace_introduction_to_algorithm"><td class="mdescLeft"> </td><td class="mdescRight">Namespace of IntrodunctionToAlgorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:namespace_introduction_to_algorithm_1_1_graph_algorithm"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html">IntroductionToAlgorithm::GraphAlgorithm</a></td></tr>
<tr class="memdesc:namespace_introduction_to_algorithm_1_1_graph_algorithm"><td class="mdescLeft"> </td><td class="mdescRight">Namespace of <a class="el" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html" title="Namespace of GraphAlgorithm. ">GraphAlgorithm</a>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_aa0a5ddea82682e3e6fbdbaa3337ee0e.html">graph_algorithms</a></li><li class="navelem"><a class="el" href="dir_7ed7dee3af3b488a5e053ec9bcb71f0e.html">basic_graph</a></li><li class="navelem"><a class="el" href="dir_d12496f1fc7378ee9aea361c57814de0.html">graph_representation</a></li><li class="navelem"><a class="el" href="dir_fe18ed58836c2c8442913a14822c363c.html">graph_vertex</a></li><li class="navelem"><a class="el" href="dfs__vertex_8h.html">dfs_vertex.h</a></li>
<li class="footer">Generated by
<a href="path_to_url">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
</ul>
</div>
</body>
</html>
```
|
Floriston railway station was a station which served the rural area around Floristonrigg, Rockcliffe Parish, south of Gretna in the English county of Cumberland (now part of Cumbria). It was served by local trains on what is now known as the West Coast Main Line. The nearest station for Floriston is now at Carlisle.
History
Opened by the Caledonian Railway, it became part of the London Midland and Scottish Railway during the Grouping of 1923 and was then closed by British Railways in 1950.
The station had a few sidings, a signal box on the other side of the level crossing from the platforms, pedestrian overbridge, stationmaster's house, ticket office and a waiting room. The line was double track here, however it is now a triple track section built on the site of one of the platforms, a siding, etc. Floriston was in the vicinity of the bridge over the River Esk.
The site today
Trains pass at speed on the electrified West Coast Main Line. The station platforms and all other buildings have been demolished, the pedestrian overbridge has also been removed, however the level crossing is still present.
References
Notes
Sources
External links
Rail Brit
Floriston Level Crossing
Cumbrian Railways Association
Disused railway stations in Cumbria
Railway stations in Great Britain opened in 1847
Railway stations in Great Britain closed in 1950
Former Caledonian Railway stations
1847 establishments in England
Rockcliffe, Cumbria
|
Kohlberg & Company is an American private equity firm that focuses on leveraged buyout transactions. Founded by investor Jerome Kohlberg, Jr., the firm invests in a variety of transactions including leveraged carveout, take-private transactions, and acquisitions of privately held companies.
History
The firm was founded in 1987, when American businessman and investor Jerome Kohlberg Jr. resigned from Kohlberg Kravis Roberts & Co. over differences in strategy. Kohlberg did not favor the larger buyouts, including Beatrice Companies in 1985 and Safeway in 1986, highly leveraged transactions or hostile takeovers being pursued increasingly by KKR. Instead, Kohlberg chose to return to his roots, acquiring smaller, middle-market companies, and in 1987 he formed Kohlberg & Company along with his son James, who at that time was a KKR executive. Their intent was to concentrate on transactions that could generate returns through revenue growth and operating improvements using only moderate leverage. Jerome Kohlberg retired from Kohlberg & Company in 1994.
Kohlberg & Company is headquartered in Mount Kisco, New York.
See also
History of private equity and venture capital
MarketCast
References
External links
Private equity firms of the United States
Companies based in Westchester County, New York
Kohlberg Kravis Roberts
Financial services companies established in 1987
Companies listed on the Nasdaq
|
Rock The Bayou was a four-day rock festival celebrating the 1980s rock scene. From Houston, Texas the inaugural show took place from Labor Day weekend, August 29–September 1, 2008 on the former location of Houston's AstroWorld theme park and featured a variety of musical acts from genres such as hard rock, heavy metal, glam metal, and classic rock.
The festival had more than 100 bands confirmed, contrary to initial estimates that 40 bands would be playing.
2008 main stage lineup
Over 100 bands appeared on four stages during the 4 days of Rock the Bayou. The headliners for the 2008 Rock the Bayou Concert were Queensrÿche, Sammy Hagar, Alice Cooper, and Bret Michaels.
Besides the main stage, there were a second and third stage of other bands.
The following bands have performed for the main stage from the Rock the Bayou website:
Friday, August 29 — “Day 1”
Queensrÿche
Ratt
Skid Row
Y & T
Lynch Mob
Faster Pussycat
Gilby Clarke
Jetboy
The Barfuss Boys
Saturday, August 30 — “Day 2”
Sammy Hagar
Lita Ford
Dokken
Great White
Enuff Z'Nuff
Bullet Boys with Steven Adler
Britny Fox
Little Caesar
Sunday, August 31 — “Day 3”
Alice Cooper
Warrant
Yngwie Malmsteen
Slaughter
L.A. Guns
Dangerous Toys
Lillian Axe
Black 'N Blue
Monday, September 1 — Day 4
Bret Michaels from Poison
Gypsy Pistoleros
Twisted Sister
Jackyl
KiX
Firehouse
Pretty Boy Floyd
Bang Tango
Broken Teeth
References
External links
2008 in music
Heavy metal festivals in the United States
Music venues in Houston
Music festivals established in 2008
Rock festivals in the United States
|
Whiteman Creek is a creek located in the Okanagan Region of British Columbia. The creek flows into Okanagan Lake from the west. The only settlement on the creek is on its delta, the gated community of Parker Cove.
History
Whiteman Creek was discovered in the 1870s. The creek has been mined.
References
External links
Rivers of the Okanagan
|
Samantha Virgo (born 20 February 1987) is a former Australian rules footballer playing for and co-captaining Gold Coast in the AFL Women's until 2021. She previously played 15 games over three seasons with Brisbane.
Early life
Virgo was born in 1987 in Blackwood, South Australia. She won the club best and fairest at Griffith-Moorooka in 2015 and was equal winner of the Queensland Women's AFL (QWAFL) best and fairest in 2016 while playing at Yeronga South Brisbane.
AFLW career
Brisbane
Virgo was recruited by with the number 66 pick in the 2016 AFL Women's draft. She was announced as one of the Brisbane Lions' "values leaders" to assist captain Emma Zielke alongside Emily Bates, Sabrina Frederick-Traub and Leah Kaslar in January 2017. She made her debut in the Lions' inaugural game against at Casey Fields on 5 February 2017. She was nominated by her teammates for the 2017 AFLW Players' most valuable player award, and was also listed in the 2017 All-Australian team.
Brisbane signed Virgo for the 2018 season during the trade period in May 2017. She missed that season through injury, and instead acted as team manager for the Lions. She returned to playing for the 2019 season as one of three vice-captains under Kaslar.
Gold Coast
Following the 2019 season, Virgo joined the Gold Coast. She was appointed co-captain in January 2020. Virgo retired at the end of the 2021 season.
References
External links
1987 births
Living people
Australian rules footballers from Brisbane
Sportswomen from Queensland
Brisbane Lions (AFLW) players
All-Australians (AFL Women's)
Lesbian sportswomen
Australian lesbians
Australian LGBT sportspeople
LGBT players of Australian rules football
Gold Coast Football Club (AFLW) players
|
The Eye, Ear, Nose and Throat (Eye and ENT) Hospital of Fudan University (), formerly the Shanghai Jewish Hospital (also B'nai B'rith Foundation Polyclinic), is a teaching hospital in Shanghai, China, affiliated with the Shanghai Medical College of Fudan University and the Red Cross Society of Shanghai. It is rated Grade 3, Class A, the highest rating in the Chinese medical system.
Overview
There are 374 beds on the main Fenyang Road campus of the hospital, which comprises the departments of Ophthalmology, Otorhinolaryngology, Radiotherapy, Anesthesia, Emergency Medicine, Stomatology, Laser Therapy and Plastic Surgery.
The hospital has 1,112 employees. It treats 1.8 million outpatients and performs 90,000 surgeries per year, with patients coming from all over China. In addition to the main campus at Fenyang Road in Xuhui District, it has a second site on Baoqing Road, and two other campuses in Pudong and Minhang, respectively. The Minhang campus has an additional 350 beds.
History
The hospital was founded in 1934 by the B'nai B'rith Shanghai Lodge with funds donated by the prominent Jewish businessman Elly Kadoorie. It was originally called the B'nai B'rith Foundation Polyclinic (). In 1940, it opened a dispensary which provided free medicine to the indigent.
After the outbreak of the Pacific War, the Russian Jewish community in the city took over the clinic in 1942, moved it to the current site on Route Pichon (now Fenyang Road), and expanded it into a hospital. On 16 January 1943, the renamed Shanghai Jewish Hospital () was opened. At the time it had 60 beds and state-of-the-art equipment including the X-ray machine, and it provided treatment to the poor free of charge. I. K. Kagan served as chairman of the hospital, and S. Citrin, chairwoman of the ladies' committee, oversaw the house management and the kitchen.
After the founding of the People's Republic of China, the Eye, Ear, Nose and Throat (Eye and ENT) Hospital of the Shanghai Medical College was established in 1952 by professors Hu Maolian () and Guo Bingkuan () on the site of the Jewish Hospital. It adopted the current name in 2000, when the Shanghai Medical College was merged into Fudan University to become its medical school.
The hospital opened a second site on Baoqing Road in 2002, a Pudong campus in 2003, and a Pujiang, Minhang, campus in 2017.
References
Teaching hospitals in Shanghai
Fudan University
Hospitals established in 1934
1934 establishments in China
Hospitals established in 1952
1952 establishments in China
Xuhui District
Minhang District
Jews and Judaism in Shanghai
B'nai B'rith
Otorhinolaryngology organizations
Eye hospitals
Pudong
Red Cross Society of China
|
Vladimir Andreyevich Artemyev () ( in Saint Petersburg - 11 September 1962 in Moscow) was a Soviet Russian rocket scientist at the Gas Dynamics Laboratory, and was one of the inventors of the Katyusha. The first rocket propelled by smokeless trotyl-pyroxylin powder was launched under his direction in 1928. Artem'ev crater is named in his honour.
Biography
Early Years and Service in the Russian Imperial Army
Vladimir Artemyev was born on the in a noble family, his father was a military officer. In 1925 Vladimir graduated from the 1st St Petersburg
Gymnasium and volunteered for the Russo-Japanese War. For his valour he was rewarded with the 4th class Cross of St. George and promoted to the rank of non-commissioned officer.
On he graduated from military school in the rank of second lieutenant and commissioned to the Brest Fortress artillery unit. There he headed the loading room and engaged in experiments with flares. He installed seven aluminium parachute flares into a rocket head, his invention exceeded several standard missiles in the illuminating power. On he was promoted to the rank of lieutenant. Then he served as an engineer under chief technology officer at the GRAU.
Rocket Engineering
After the October Revolution Artemyev didn’t leave the country. In 1920 he acquainted Nikolai Tihomirov and soon became his main assistant. In Spring 1920 Tikhomirov and Artemyev equipped a small laboratory on Tikhvinskaya street in Moscow and conducted a series of experiments with charcoal gunpowder. The scientists financed the research with their own money, to support the laboratory they crafted and sold toys and bicycle supplies. In March 1921 Tikhomirov decided to modify the laboratory and engage in rocket engineering. His main interest was the solid-propellant rocket. In the same year, the scientists started working on air projectiles.
On 22 September 1922 Vladimir Artemyev was arrested on charges of espionage, inaction and negligence that undermined the Red Army’s supply in artillery and projectiles. Under the Special Council of the NKVD decision from 10 June 1923, he was sentenced to 3 years at the Solovki prison camp.
In 1924 Artemyev was released from the camp and returned to work at the Tikhomirov’s laboratory. In the same year he offered to construct propellant charges from smokeless gunpowder based on non-volatile solvents. In 1925 the laboratory relocated to Leningrad. On 3 March 1928 the first rocket on a smokeless gunpowder propellant was tested at one of the training areas near Leningrad. According to Artemyev, that configuration became the prototype of the missiles for ‘Katyusha’. In July 1928 the laboratory was renamed into the Gas Dynamics Laboratory (GDL) of the Revolutionary Military Council. After the decease of Nikolay Tikhomirov, became its new head, in 1931 he was replaced by . Since that year the laboratory has been subjected to the Red Army Office of Military Inventions of the Technical Staff of the Chief of Armaments. In 1932 Ivan Kleymyonov was assigned to the director’s post. In September 1933 GIRD and GDL merged into the Reactive Scientific Research Institute (RNII). Artemyev designed RS-82 fin-stabilized rockets with extended fins. In 1937-1938 Polikarpov I-15, Polikarpov I-16, Polikarpov I-153 were equipped with jet-propelled projectiles. In Summer 1939 RS-82 rockets were successfully used in the Battles of Khalkhin Gol.
In 1938-1941 RNII (now renamed the Research Institute №3 or NII-3) under chief constructor engineers , , , R. I. Popov and Vladimir Artemyev designed the Katyusha rocket launcher. Artemyev was in charge of rocket construction. On 23 March 1943 he was awarded with the 1st class USSR State Prize in honour of his major improvements in mortar tubes and ammunition.
During World War II Artemyev kept working as a military engineer. In 1945 with S. F. Fonaryov he co-created an antisubmarine mortar with depth rocket-propelled missiles. After the war Artemyev kept working on rocket construction at research institutes and laboratories.
Vladimir Artemyev died on 11 September 1962. The ashes were placed in the columbarium at the Novodevichy Cemetery.
Awards
The Order of the Red Banner of Labour (24 November 1942);
the 1st class Order of the Patriotic War (18 November 1944);
the 2d class Stalin Prize (23 March 1941);
the 1st class Stalin Prize (23 March 1943).
Memory
The Artem'ev lunar crater on the far side of the Moon was named after the scientist.
References
Sources
1885 births
1962 deaths
Scientists from Saint Petersburg
Recipients of the Stalin Prize
Recipients of the Cross of St. George
Recipients of the Order of the Red Banner of Labour
Soviet scientists
Burials at Novodevichy Cemetery
Soviet inventors
Rocket scientists
|
Robert Keith Sawyer is an American psychologist. He is the Morgan Distinguished Professor in Educational Innovations at University of North Carolina at Chapel Hill. He is an expert on creativity, innovation and learning.
Books
Selected publications
References
External links
Faculty Page at UNC
1960 births
Living people
Creativity researchers
21st-century American psychologists
University of North Carolina at Chapel Hill faculty
University of Chicago alumni
Massachusetts Institute of Technology alumni
20th-century American psychologists
|
```rust
//! Determining which types for which we cannot emit `#[derive(Trait)]`.
use std::fmt;
use super::{generate_dependencies, ConstrainResult, MonotoneFramework};
use crate::ir::analysis::has_vtable::HasVtable;
use crate::ir::comp::CompKind;
use crate::ir::context::{BindgenContext, ItemId};
use crate::ir::derive::CanDerive;
use crate::ir::function::FunctionSig;
use crate::ir::item::{IsOpaque, Item};
use crate::ir::layout::Layout;
use crate::ir::template::TemplateParameters;
use crate::ir::traversal::{EdgeKind, Trace};
use crate::ir::ty::RUST_DERIVE_IN_ARRAY_LIMIT;
use crate::ir::ty::{Type, TypeKind};
use crate::{Entry, HashMap, HashSet};
/// Which trait to consider when doing the `CannotDerive` analysis.
#[derive(Debug, Copy, Clone, Hash, PartialEq, Eq)]
pub enum DeriveTrait {
/// The `Copy` trait.
Copy,
/// The `Debug` trait.
Debug,
/// The `Default` trait.
Default,
/// The `Hash` trait.
Hash,
/// The `PartialEq` and `PartialOrd` traits.
PartialEqOrPartialOrd,
}
/// An analysis that finds for each IR item whether a trait cannot be derived.
///
/// We use the monotone constraint function `cannot_derive`, defined as follows
/// for type T:
///
/// * If T is Opaque and the layout of the type is known, get this layout as an
/// opaquetype and check whether it can derive using trivial checks.
///
/// * If T is Array, a trait cannot be derived if the array is incomplete,
/// if the length of the array is larger than the limit (unless the trait
/// allows it), or the trait cannot be derived for the type of data the array
/// contains.
///
/// * If T is Vector, a trait cannot be derived if the trait cannot be derived
/// for the type of data the vector contains.
///
/// * If T is a type alias, a templated alias or an indirection to another type,
/// the trait cannot be derived if the trait cannot be derived for type T
/// refers to.
///
/// * If T is a compound type, the trait cannot be derived if the trait cannot
/// be derived for any of its base members or fields.
///
/// * If T is an instantiation of an abstract template definition, the trait
/// cannot be derived if any of the template arguments or template definition
/// cannot derive the trait.
///
/// * For all other (simple) types, compiler and standard library limitations
/// dictate whether the trait is implemented.
#[derive(Debug, Clone)]
pub(crate) struct CannotDerive<'ctx> {
ctx: &'ctx BindgenContext,
derive_trait: DeriveTrait,
// The incremental result of this analysis's computation.
// Contains information whether particular item can derive `derive_trait`
can_derive: HashMap<ItemId, CanDerive>,
// Dependencies saying that if a key ItemId has been inserted into the
// `cannot_derive_partialeq_or_partialord` set, then each of the ids
// in Vec<ItemId> need to be considered again.
//
// This is a subset of the natural IR graph with reversed edges, where we
// only include the edges from the IR graph that can affect whether a type
// can derive `derive_trait`.
dependencies: HashMap<ItemId, Vec<ItemId>>,
}
type EdgePredicate = fn(EdgeKind) -> bool;
fn consider_edge_default(kind: EdgeKind) -> bool {
match kind {
// These are the only edges that can affect whether a type can derive
EdgeKind::BaseMember |
EdgeKind::Field |
EdgeKind::TypeReference |
EdgeKind::VarType |
EdgeKind::TemplateArgument |
EdgeKind::TemplateDeclaration |
EdgeKind::TemplateParameterDefinition => true,
EdgeKind::Constructor |
EdgeKind::Destructor |
EdgeKind::FunctionReturn |
EdgeKind::FunctionParameter |
EdgeKind::InnerType |
EdgeKind::InnerVar |
EdgeKind::Method |
EdgeKind::Generic => false,
}
}
impl<'ctx> CannotDerive<'ctx> {
fn insert<Id: Into<ItemId>>(
&mut self,
id: Id,
can_derive: CanDerive,
) -> ConstrainResult {
let id = id.into();
trace!(
"inserting {:?} can_derive<{}>={:?}",
id,
self.derive_trait,
can_derive
);
if let CanDerive::Yes = can_derive {
return ConstrainResult::Same;
}
match self.can_derive.entry(id) {
Entry::Occupied(mut entry) => {
if *entry.get() < can_derive {
entry.insert(can_derive);
ConstrainResult::Changed
} else {
ConstrainResult::Same
}
}
Entry::Vacant(entry) => {
entry.insert(can_derive);
ConstrainResult::Changed
}
}
}
fn constrain_type(&mut self, item: &Item, ty: &Type) -> CanDerive {
if !self.ctx.allowlisted_items().contains(&item.id()) {
let can_derive = self
.ctx
.blocklisted_type_implements_trait(item, self.derive_trait);
match can_derive {
CanDerive::Yes => trace!(
" blocklisted type explicitly implements {}",
self.derive_trait
),
CanDerive::Manually => trace!(
" blocklisted type requires manual implementation of {}",
self.derive_trait
),
CanDerive::No => trace!(
" cannot derive {} for blocklisted type",
self.derive_trait
),
}
return can_derive;
}
if self.derive_trait.not_by_name(self.ctx, item) {
trace!(
" cannot derive {} for explicitly excluded type",
self.derive_trait
);
return CanDerive::No;
}
trace!("ty: {:?}", ty);
if item.is_opaque(self.ctx, &()) {
if !self.derive_trait.can_derive_union() &&
ty.is_union() &&
self.ctx.options().untagged_union
{
trace!(
" cannot derive {} for Rust unions",
self.derive_trait
);
return CanDerive::No;
}
let layout_can_derive =
ty.layout(self.ctx).map_or(CanDerive::Yes, |l| {
l.opaque().array_size_within_derive_limit(self.ctx)
});
match layout_can_derive {
CanDerive::Yes => {
trace!(
" we can trivially derive {} for the layout",
self.derive_trait
);
}
_ => {
trace!(
" we cannot derive {} for the layout",
self.derive_trait
);
}
};
return layout_can_derive;
}
match *ty.kind() {
// Handle the simple cases. These can derive traits without further
// information.
TypeKind::Void |
TypeKind::NullPtr |
TypeKind::Int(..) |
TypeKind::Complex(..) |
TypeKind::Float(..) |
TypeKind::Enum(..) |
TypeKind::TypeParam |
TypeKind::UnresolvedTypeRef(..) |
TypeKind::Reference(..) |
TypeKind::ObjCInterface(..) |
TypeKind::ObjCId |
TypeKind::ObjCSel => {
return self.derive_trait.can_derive_simple(ty.kind());
}
TypeKind::Pointer(inner) => {
let inner_type =
self.ctx.resolve_type(inner).canonical_type(self.ctx);
if let TypeKind::Function(ref sig) = *inner_type.kind() {
self.derive_trait.can_derive_fnptr(sig)
} else {
self.derive_trait.can_derive_pointer()
}
}
TypeKind::Function(ref sig) => {
self.derive_trait.can_derive_fnptr(sig)
}
// Complex cases need more information
TypeKind::Array(t, len) => {
let inner_type =
self.can_derive.get(&t.into()).cloned().unwrap_or_default();
if inner_type != CanDerive::Yes {
trace!(
" arrays of T for which we cannot derive {} \
also cannot derive {}",
self.derive_trait,
self.derive_trait
);
return CanDerive::No;
}
if len == 0 && !self.derive_trait.can_derive_incomplete_array()
{
trace!(
" cannot derive {} for incomplete arrays",
self.derive_trait
);
return CanDerive::No;
}
if self.derive_trait.can_derive_large_array(self.ctx) {
trace!(" array can derive {}", self.derive_trait);
return CanDerive::Yes;
}
if len > RUST_DERIVE_IN_ARRAY_LIMIT {
trace!(
" array is too large to derive {}, but it may be implemented", self.derive_trait
);
return CanDerive::Manually;
}
trace!(
" array is small enough to derive {}",
self.derive_trait
);
CanDerive::Yes
}
TypeKind::Vector(t, len) => {
let inner_type =
self.can_derive.get(&t.into()).cloned().unwrap_or_default();
if inner_type != CanDerive::Yes {
trace!(
" vectors of T for which we cannot derive {} \
also cannot derive {}",
self.derive_trait,
self.derive_trait
);
return CanDerive::No;
}
assert_ne!(len, 0, "vectors cannot have zero length");
self.derive_trait.can_derive_vector()
}
TypeKind::Comp(ref info) => {
assert!(
!info.has_non_type_template_params(),
"The early ty.is_opaque check should have handled this case"
);
if !self.derive_trait.can_derive_compound_forward_decl() &&
info.is_forward_declaration()
{
trace!(
" cannot derive {} for forward decls",
self.derive_trait
);
return CanDerive::No;
}
// NOTE: Take into account that while unions in C and C++ are copied by
// default, the may have an explicit destructor in C++, so we can't
// defer this check just for the union case.
if !self.derive_trait.can_derive_compound_with_destructor() &&
self.ctx.lookup_has_destructor(
item.id().expect_type_id(self.ctx),
)
{
trace!(
" comp has destructor which cannot derive {}",
self.derive_trait
);
return CanDerive::No;
}
if info.kind() == CompKind::Union {
if self.derive_trait.can_derive_union() {
if self.ctx.options().untagged_union &&
// path_to_url
(!info.self_template_params(self.ctx).is_empty() ||
!item.all_template_params(self.ctx).is_empty())
{
trace!(
" cannot derive {} for Rust union because issue 36640", self.derive_trait
);
return CanDerive::No;
}
// fall through to be same as non-union handling
} else {
if self.ctx.options().untagged_union {
trace!(
" cannot derive {} for Rust unions",
self.derive_trait
);
return CanDerive::No;
}
let layout_can_derive =
ty.layout(self.ctx).map_or(CanDerive::Yes, |l| {
l.opaque()
.array_size_within_derive_limit(self.ctx)
});
match layout_can_derive {
CanDerive::Yes => {
trace!(
" union layout can trivially derive {}",
self.derive_trait
);
}
_ => {
trace!(
" union layout cannot derive {}",
self.derive_trait
);
}
};
return layout_can_derive;
}
}
if !self.derive_trait.can_derive_compound_with_vtable() &&
item.has_vtable(self.ctx)
{
trace!(
" cannot derive {} for comp with vtable",
self.derive_trait
);
return CanDerive::No;
}
// Bitfield units are always represented as arrays of u8, but
// they're not traced as arrays, so we need to check here
// instead.
if !self.derive_trait.can_derive_large_array(self.ctx) &&
info.has_too_large_bitfield_unit() &&
!item.is_opaque(self.ctx, &())
{
trace!(
" cannot derive {} for comp with too large bitfield unit",
self.derive_trait
);
return CanDerive::No;
}
let pred = self.derive_trait.consider_edge_comp();
self.constrain_join(item, pred)
}
TypeKind::ResolvedTypeRef(..) |
TypeKind::TemplateAlias(..) |
TypeKind::Alias(..) |
TypeKind::BlockPointer(..) => {
let pred = self.derive_trait.consider_edge_typeref();
self.constrain_join(item, pred)
}
TypeKind::TemplateInstantiation(..) => {
let pred = self.derive_trait.consider_edge_tmpl_inst();
self.constrain_join(item, pred)
}
TypeKind::Opaque => unreachable!(
"The early ty.is_opaque check should have handled this case"
),
}
}
fn constrain_join(
&mut self,
item: &Item,
consider_edge: EdgePredicate,
) -> CanDerive {
let mut candidate = None;
item.trace(
self.ctx,
&mut |sub_id, edge_kind| {
// Ignore ourselves, since union with ourself is a
// no-op. Ignore edges that aren't relevant to the
// analysis.
if sub_id == item.id() || !consider_edge(edge_kind) {
return;
}
let can_derive = self.can_derive
.get(&sub_id)
.cloned()
.unwrap_or_default();
match can_derive {
CanDerive::Yes => trace!(" member {:?} can derive {}", sub_id, self.derive_trait),
CanDerive::Manually => trace!(" member {:?} cannot derive {}, but it may be implemented", sub_id, self.derive_trait),
CanDerive::No => trace!(" member {:?} cannot derive {}", sub_id, self.derive_trait),
}
*candidate.get_or_insert(CanDerive::Yes) |= can_derive;
},
&(),
);
if candidate.is_none() {
trace!(
" can derive {} because there are no members",
self.derive_trait
);
}
candidate.unwrap_or_default()
}
}
impl DeriveTrait {
fn not_by_name(&self, ctx: &BindgenContext, item: &Item) -> bool {
match self {
DeriveTrait::Copy => ctx.no_copy_by_name(item),
DeriveTrait::Debug => ctx.no_debug_by_name(item),
DeriveTrait::Default => ctx.no_default_by_name(item),
DeriveTrait::Hash => ctx.no_hash_by_name(item),
DeriveTrait::PartialEqOrPartialOrd => {
ctx.no_partialeq_by_name(item)
}
}
}
fn consider_edge_comp(&self) -> EdgePredicate {
match self {
DeriveTrait::PartialEqOrPartialOrd => consider_edge_default,
_ => |kind| matches!(kind, EdgeKind::BaseMember | EdgeKind::Field),
}
}
fn consider_edge_typeref(&self) -> EdgePredicate {
match self {
DeriveTrait::PartialEqOrPartialOrd => consider_edge_default,
_ => |kind| kind == EdgeKind::TypeReference,
}
}
fn consider_edge_tmpl_inst(&self) -> EdgePredicate {
match self {
DeriveTrait::PartialEqOrPartialOrd => consider_edge_default,
_ => |kind| {
matches!(
kind,
EdgeKind::TemplateArgument | EdgeKind::TemplateDeclaration
)
},
}
}
fn can_derive_large_array(&self, ctx: &BindgenContext) -> bool {
if ctx.options().rust_features().larger_arrays {
!matches!(self, DeriveTrait::Default)
} else {
matches!(self, DeriveTrait::Copy)
}
}
fn can_derive_union(&self) -> bool {
matches!(self, DeriveTrait::Copy)
}
fn can_derive_compound_with_destructor(&self) -> bool {
!matches!(self, DeriveTrait::Copy)
}
fn can_derive_compound_with_vtable(&self) -> bool {
!matches!(self, DeriveTrait::Default)
}
fn can_derive_compound_forward_decl(&self) -> bool {
matches!(self, DeriveTrait::Copy | DeriveTrait::Debug)
}
fn can_derive_incomplete_array(&self) -> bool {
!matches!(
self,
DeriveTrait::Copy |
DeriveTrait::Hash |
DeriveTrait::PartialEqOrPartialOrd
)
}
fn can_derive_fnptr(&self, f: &FunctionSig) -> CanDerive {
match (self, f.function_pointers_can_derive()) {
(DeriveTrait::Copy, _) | (DeriveTrait::Default, _) | (_, true) => {
trace!(" function pointer can derive {}", self);
CanDerive::Yes
}
(DeriveTrait::Debug, false) => {
trace!(" function pointer cannot derive {}, but it may be implemented", self);
CanDerive::Manually
}
(_, false) => {
trace!(" function pointer cannot derive {}", self);
CanDerive::No
}
}
}
fn can_derive_vector(&self) -> CanDerive {
match self {
DeriveTrait::PartialEqOrPartialOrd => {
// FIXME: vectors always can derive PartialEq, but they should
// not derive PartialOrd:
// path_to_url
trace!(" vectors cannot derive PartialOrd");
CanDerive::No
}
_ => {
trace!(" vector can derive {}", self);
CanDerive::Yes
}
}
}
fn can_derive_pointer(&self) -> CanDerive {
match self {
DeriveTrait::Default => {
trace!(" pointer cannot derive Default");
CanDerive::No
}
_ => {
trace!(" pointer can derive {}", self);
CanDerive::Yes
}
}
}
fn can_derive_simple(&self, kind: &TypeKind) -> CanDerive {
match (self, kind) {
// === Default ===
(DeriveTrait::Default, TypeKind::Void) |
(DeriveTrait::Default, TypeKind::NullPtr) |
(DeriveTrait::Default, TypeKind::Enum(..)) |
(DeriveTrait::Default, TypeKind::Reference(..)) |
(DeriveTrait::Default, TypeKind::TypeParam) |
(DeriveTrait::Default, TypeKind::ObjCInterface(..)) |
(DeriveTrait::Default, TypeKind::ObjCId) |
(DeriveTrait::Default, TypeKind::ObjCSel) => {
trace!(" types that always cannot derive Default");
CanDerive::No
}
(DeriveTrait::Default, TypeKind::UnresolvedTypeRef(..)) => {
unreachable!(
"Type with unresolved type ref can't reach derive default"
)
}
// === Hash ===
(DeriveTrait::Hash, TypeKind::Float(..)) |
(DeriveTrait::Hash, TypeKind::Complex(..)) => {
trace!(" float cannot derive Hash");
CanDerive::No
}
// === others ===
_ => {
trace!(" simple type that can always derive {}", self);
CanDerive::Yes
}
}
}
}
impl fmt::Display for DeriveTrait {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
let s = match self {
DeriveTrait::Copy => "Copy",
DeriveTrait::Debug => "Debug",
DeriveTrait::Default => "Default",
DeriveTrait::Hash => "Hash",
DeriveTrait::PartialEqOrPartialOrd => "PartialEq/PartialOrd",
};
s.fmt(f)
}
}
impl<'ctx> MonotoneFramework for CannotDerive<'ctx> {
type Node = ItemId;
type Extra = (&'ctx BindgenContext, DeriveTrait);
type Output = HashMap<ItemId, CanDerive>;
fn new(
(ctx, derive_trait): (&'ctx BindgenContext, DeriveTrait),
) -> CannotDerive<'ctx> {
let can_derive = HashMap::default();
let dependencies = generate_dependencies(ctx, consider_edge_default);
CannotDerive {
ctx,
derive_trait,
can_derive,
dependencies,
}
}
fn initial_worklist(&self) -> Vec<ItemId> {
// The transitive closure of all allowlisted items, including explicitly
// blocklisted items.
self.ctx
.allowlisted_items()
.iter()
.cloned()
.flat_map(|i| {
let mut reachable = vec![i];
i.trace(
self.ctx,
&mut |s, _| {
reachable.push(s);
},
&(),
);
reachable
})
.collect()
}
fn constrain(&mut self, id: ItemId) -> ConstrainResult {
trace!("constrain: {:?}", id);
if let Some(CanDerive::No) = self.can_derive.get(&id).cloned() {
trace!(" already know it cannot derive {}", self.derive_trait);
return ConstrainResult::Same;
}
let item = self.ctx.resolve_item(id);
let can_derive = match item.as_type() {
Some(ty) => {
let mut can_derive = self.constrain_type(item, ty);
if let CanDerive::Yes = can_derive {
let is_reached_limit =
|l: Layout| l.align > RUST_DERIVE_IN_ARRAY_LIMIT;
if !self.derive_trait.can_derive_large_array(self.ctx) &&
ty.layout(self.ctx).map_or(false, is_reached_limit)
{
// We have to be conservative: the struct *could* have enough
// padding that we emit an array that is longer than
// `RUST_DERIVE_IN_ARRAY_LIMIT`. If we moved padding calculations
// into the IR and computed them before this analysis, then we could
// be precise rather than conservative here.
can_derive = CanDerive::Manually;
}
}
can_derive
}
None => self.constrain_join(item, consider_edge_default),
};
self.insert(id, can_derive)
}
fn each_depending_on<F>(&self, id: ItemId, mut f: F)
where
F: FnMut(ItemId),
{
if let Some(edges) = self.dependencies.get(&id) {
for item in edges {
trace!("enqueue {:?} into worklist", item);
f(*item);
}
}
}
}
impl<'ctx> From<CannotDerive<'ctx>> for HashMap<ItemId, CanDerive> {
fn from(analysis: CannotDerive<'ctx>) -> Self {
extra_assert!(analysis
.can_derive
.values()
.all(|v| *v != CanDerive::Yes));
analysis.can_derive
}
}
/// Convert a `HashMap<ItemId, CanDerive>` into a `HashSet<ItemId>`.
///
/// Elements that are not `CanDerive::Yes` are kept in the set, so that it
/// represents all items that cannot derive.
pub(crate) fn as_cannot_derive_set(
can_derive: HashMap<ItemId, CanDerive>,
) -> HashSet<ItemId> {
can_derive
.into_iter()
.filter_map(|(k, v)| if v != CanDerive::Yes { Some(k) } else { None })
.collect()
}
```
|
Takrut () is a type of tubular amulet that originated from Thailand. It is also known as "Tangkai" in other cultures. The takrut is similar to a talisman ( / transliterated: ).
The word Takrut, is used for both Singular and Plural, although many people do add an 's' (Takruts). However, the proper way to refer to takrut when in plural, is 'Takrut'.
They are worn by Thai people as a protective amulet and have existed for centuries. They are the most commonly mentioned form of amulet in the Khun Chang Khun Phaen, a Thai epic. They have an elongated scroll-like shape, and are usually made of metal or palm leaf and tied to the body with a cord.
Yant (ยันต์, yantra) are incantations and sacred geometric designs with Pali gatha and Buddhist prayers (invocations and empowerment spells), usually, but not always inscribed using the ancient Khom Pali script (a variant of Khmer script used in Thailand). In Northern Thailand, they use Lan Na Tai Tham script. The takrut is used for all purposes from Maha Sanaeh (attraction), Metta Mahaniyom (business success and popularity), Mercy Charm, Maha Pokasap/Lap (riches attraction), and Kong Grapan (invincibility).
Potential takeouts include gems, especially engraved gems, statues, coins, drawings, pendants, rings, plants and animals; even words in the form of a magical spell, incantation, to repel evil or bad luck.
Takrut has been part of Thai culture even before buddhism arrived in Thailand. After Thai Buddhism take roots, the takrut become the earlier form of buddhism amulets made by monk in 1200-1300A.D.
In ancient Thailand, takrut was very popular as there are constant warfare and poor security conditions. Takruts are mainly blessed for safe keeping (invulnerable) purpose, to bless end user for safety their daily work or business trips or going to war.
Variations of traditional takrut
Takrut are usually put inside a special type of case and worn with a chain around the neck at chest level. They are also worn about the waist but can also be worn as most pieces of jewelry. They are worn about the body to protect specific parts of the body or to grant power to those body parts. But whether it is worn at the chest or the waist, its purpose is still the same: to give protection to its wearer. Some smaller takrut can be kept between the teeth to allow the carrier to be a more powerful speaker. This power is called sariga, a golden tongued celestial magpie, featured in Vedic and Thai Buddhist Legends.
See also
Cetiya
Sacca-kiriyā
Paritta
Jinapañjara
Somdej Toh
Luang pho phet
Kuman thong
Yantra tattooing
Notes
References
External links
Information about Thai Takut
Amulets
Superstitions of Thailand
|
```yaml
---
parsed_sample:
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.100"
neigh_as: "64497"
msg_rcvd: "0"
msg_sent: "0"
in_queue: "0"
out_queue: "0"
up_down: "03:20:10"
state_pfxrcd: "Idle"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "192.168.1.3"
neigh_as: "0"
msg_rcvd: "0"
msg_sent: "0"
in_queue: "0"
out_queue: "0"
up_down: "01:51:38"
state_pfxrcd: "Idle"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.1"
neigh_as: "65000"
msg_rcvd: "2746767"
msg_sent: "2396274"
in_queue: "0"
out_queue: "0"
up_down: "3w0d"
state_pfxrcd: "558720"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.2"
neigh_as: "65001"
msg_rcvd: "2855873"
msg_sent: "2409742"
in_queue: "0"
out_queue: "0"
up_down: "3w0d"
state_pfxrcd: "558720"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.3"
neigh_as: "65002"
msg_rcvd: "695143"
msg_sent: "689871"
in_queue: "0"
out_queue: "0"
up_down: "1y10w"
state_pfxrcd: "0"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.4"
neigh_as: "65003"
msg_rcvd: "1030294"
msg_sent: "1220041"
in_queue: "0"
out_queue: "0"
up_down: "1y50w"
state_pfxrcd: "1351"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.5"
neigh_as: "65004"
msg_rcvd: "26552304"
msg_sent: "14931352"
in_queue: "0"
out_queue: "0"
up_down: "19w5d"
state_pfxrcd: "558720"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.6"
neigh_as: "65005"
msg_rcvd: "26532908"
msg_sent: "14931123"
in_queue: "0"
out_queue: "0"
up_down: "19w5d"
state_pfxrcd: "558720"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.7"
neigh_as: "65006"
msg_rcvd: "12245684"
msg_sent: "9181569"
in_queue: "0"
out_queue: "0"
up_down: "1y10w"
state_pfxrcd: "82"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.8"
neigh_as: "65007"
msg_rcvd: "12250936"
msg_sent: "9181571"
in_queue: "0"
out_queue: "0"
up_down: "1y10w"
state_pfxrcd: "82"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.9"
neigh_as: "65008"
msg_rcvd: "222146"
msg_sent: "14368489"
in_queue: "0"
out_queue: "0"
up_down: "22w0d"
state_pfxrcd: "0"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.10"
neigh_as: "65009"
msg_rcvd: "26930508"
msg_sent: "942614"
in_queue: "0"
out_queue: "0"
up_down: "1y10w"
state_pfxrcd: "Idle (Admin)"
- router_id: "2.2.2.3"
local_as: "102"
vrf: "default"
bgp_neigh: "10.0.0.11"
neigh_as: "65010"
msg_rcvd: "2655204"
msg_sent: "14931352"
in_queue: "0"
out_queue: "0"
up_down: "1w5d"
state_pfxrcd: "4452"
```
|
In Hypertext, a lexia (, ‘diction, word’) is a text unit that links to other lexia, corresponding to a node in a network. This use of the term was introduced by George Landow, and was based on Roland Barthes' use of lexia in S/Z to refer "units of reading". The term is used in scholarship on hypertext, although node is often used synonymously.
Barthes defines lexia as a "series of brief, contiguous fragments, which we shall call call lexia, since they are units of reading". These are not necessarily present in the text before it is read, and can be "arbitrary, but useful" in analysis.
In hypertext, on the other hand, lexia are units of text that are separated from other lexia. The reader must usually click a link to move from one lexia to the next.
George Landow, writing in 1992, was one of the first scholars to analyse literary hypertexts. The term lexia was a key term for him in developing his theoretical and analytical approach to the new genre of hypertext fiction. Landow defined hypertext thus: "Hypertext, as the term will be used in the following pages, denotes text composed of blocks of text — what Barthes terms a lexia — and the electronic links that join them."
Scholars have noted that Landow's actually uses the term lexia quite differently from Barthes.
References
See also
Hypertext fiction
Cybertext
Hypertext
Hypertext fiction
Literary terminology
Narratology
Electronic literature criticism
|
```javascript
/**
* Block helper that compares to values. The body is executed if values are not equal.
* Example:
*
* ```hbs
* {{#ifneq value 10}}
* Value is not 10
* {{else}}
* Value is 10
* {{/ifeq}}
* ```
*
* @param {object} `v1` the first value
* @param {object} `v2` the second value
*/
module.exports = function(v1, v2, options) {
if (v1 !== v2) {
return options.fn(this)
}
return options.inverse(this)
};
```
|
iCarly: Music from and Inspired by the Hit TV Show is the soundtrack album of the Nickelodeon television series iCarly, which premiered on September 8, 2007. It debuted on the Billboard 200 at number 28 with 20,000 copies sold in its opening week. A follow-up soundtrack called iCarly: iSoundtrack II was released on January 24, 2012.
Songs
"Leave It All to Me", performed by Miranda Cosgrove featuring Drake Bell, was released on December 18, 2007. "Stay My Baby", performed by Miranda Cosgrove, was released as a promotional single on June 5, 2008. It was originally sung by Swedish singer Amy Diamond in 2007. The track "Headphones On" was included on Rock Band.
Track listing
Charts
Weekly charts
Year-end charts
References
External links
iCarly on Amazon.com
ICarly
Television soundtracks
2008 soundtrack albums
|
Ravn Rock () is a submerged rock lying in the center of Neptunes Bellows, the entrance to Port Foster, Deception Island, in the South Shetland Islands. Charted by the French Antarctic Expedition under Charcot, 1908–10. Named for the whale catcher Ravn, based at Deception Island at that time.
Rock formations of the South Shetland Islands
Geography of Deception Island
|
Thioacetic acid is an organosulfur compound with the molecular formula . It is a thioic acid: the sulfur analogue of acetic acid (), as implied by the thio- prefix. It is a yellow liquid with a strong thiol-like odor. It is used in organic synthesis for the introduction of thiol groups () in molecules.
Synthesis and properties
Thioacetic acid is prepared by the reaction of acetic anhydride with hydrogen sulfide:
(CH3C(O))2O + H2S -> CH3C(O)SH + CH3C(O)OH
It has also been produced by the action of phosphorus pentasulfide on glacial acetic acid, followed by distillation.
CH3C(O)OH + P2S5 -> CH3C(O)SH + P2OS4
Thioacetic acid is typically contaminated by acetic acid.
The compound exists exclusively as the thiol tautomer, consistent with the strength of the double bond. Reflecting the influence of hydrogen-bonding, the boiling point (93 °C) and melting points are 20 and 75 K lower than those for acetic acid.
Reactivity
Acidity
With a pKa near 3.4, thioacetic acid is about 15 times more acidic than acetic acid. The conjugate base is thioacetate:
CH3C(O)SH -> CH3C(O)S- + H+
In neutral water, thioacetic acid is fully ionized.
Reactivity of thioacetate
Most of the reactivity of thioacetic acid arises from the conjugate base, thioacetate. Salts of this anion, e.g. potassium thioacetate, are used to generate thioacetate esters. Thioacetate esters undergo hydrolysis to give thiols. A typical method for preparing a thiol from an alkyl halide using thioacetic acid proceeds in four discrete steps, some of which can be conducted sequentially in the same flask:
CH3C(O)SH + NaOH -> CH3C(O)SNa + H2O
CH3C(O)SNa{} + RX -> CH3C(O)SR{} + NaX \qquad (X\ =\ Cl,\ Br,\ I,\ \dots)
CH3C(O)SR + 2 NaOH -> CH3CO2Na + RSNa + H2O
RSNa + HCl -> RSH + NaCl
In an application that illustrates the use of its radical behavior, thioacetic acid is used with AIBN in a free radical mediated nucleophilic addition to an exocyclic alkene forming a thioester:
Reductive acetylation
Salts of thioacetic acid such as potassium thioacetate can be used convert nitroarenes to aryl acetamides in one step. This is particularly useful in the preparation of pharmaceuticals, e.g., paracetamol.
References
Organic acids
Reagents for organic chemistry
Organosulfur compounds
Foul-smelling chemicals
|
```javascript
// sample of arrays to sort
var arrayRandom = [9, 2, 5, 6, 4, 3, 7, 10, 1, 8];
var arrayOrdered = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
var arrayReversed = [10, 9, 8, 7, 6, 5, 4, 3, 2, 1];
var countOuter = 0;
var countInner = 0;
var countSwap = 0;
function resetCounters() {
countOuter = 0;
countInner = 0;
countSwap = 0;
}
// basic implementation (pivot is the first element of the array)
function quicksortBasic(array) {
countOuter++;
if(array.length < 2) {
return array;
}
var pivot = array[0];
var lesser = [];
var greater = [];
for(var i = 1; i < array.length; i++) {
countInner++;
if(array[i] < pivot) {
lesser.push(array[i]);
} else {
greater.push(array[i]);
}
}
return quicksortBasic(lesser).concat(pivot, quicksortBasic(greater));
}
quicksortBasic(arrayRandom.slice()); // => outer: 13 inner: 25 swap: 0
console.log('outer:', countOuter, 'inner:', countInner, 'swap:', countSwap);
resetCounters();
quicksortBasic(arrayOrdered.slice()); // => outer: 19 inner: 45 swap: 0
console.log('outer:', countOuter, 'inner:', countInner, 'swap:', countSwap);
resetCounters();
quicksortBasic(arrayReversed.slice()); // => outer: 19 inner: 45 swap: 0
console.log('outer:', countOuter, 'inner:', countInner, 'swap:', countSwap);
resetCounters();
// swap function helper
function swap(array, i, j) {
var temp = array[i];
array[i] = array[j];
array[j] = temp;
}
// classic implementation (with Hoare or Lomuto partition scheme, you can comment either one method or the other to see the difference)
function quicksort(array, left, right) {
countOuter++;
left = left || 0;
right = right || array.length - 1;
// var pivot = partitionLomuto(array, left, right); // you can play with both partition
var pivot = partitionHoare(array, left, right); // you can play with both partition
if(left < pivot - 1) {
quicksort(array, left, pivot - 1);
}
if(right > pivot) {
quicksort(array, pivot, right);
}
return array;
}
// Lomuto partition scheme, it is less efficient than the Hoare partition scheme
function partitionLomuto(array, left, right) {
var pivot = right;
var i = left;
for(var j = left; j < right; j++) {
countInner++;
if(array[j] <= array[pivot]) {
countSwap++;
swap(array, i, j);
i = i + 1;
}
}
countSwap++;
swap(array, i, j);
return i;
}
// Hoare partition scheme, it is more efficient than the Lomuto partition scheme because it does three times fewer swaps on average
function partitionHoare(array, left, right) {
var pivot = Math.floor((left + right) / 2 );
while(left <= right) {
countInner++;
while(array[left] < array[pivot]) {
left++;
}
while(array[right] > array[pivot]) {
right--;
}
if(left <= right) {
countSwap++;
swap(array, left, right);
left++;
right--;
}
}
return left;
}
quicksort(arrayRandom.slice());
// => Hoare: outer: 9 inner: 12 swap: 12 - Lomuto: outer: 10 inner: 35 swap: 28
console.log('outer:', countOuter, 'inner:', countInner, 'swap:', countSwap);
resetCounters();
quicksort(arrayOrdered.slice());
// => Hoare: outer: 9 inner: 9 swap: 9 - Lomuto: outer: 9 inner: 45 swap: 54
console.log('outer:', countOuter, 'inner:', countInner, 'swap:', countSwap);
resetCounters();
quicksort(arrayReversed.slice());
// => Hoare: outer: 9 inner: 13 swap: 13 - Lomuto: outer: 10 inner: 54 swap: 39
console.log('outer:', countOuter, 'inner:', countInner, 'swap:', countSwap);
resetCounters();
```
|
```yaml
# Each section from every release note are combined when the
# CHANGELOG.rst is rendered. So the text needs to be worded so that
# it does not depend on any information only available in another
# section. This may mean repeating some details, but each section
# must be readable independently of the other.
#
# Each section note must be formatted as reStructuredText.
---
fixes:
- |
On Windows, changes the password generating algorithm to have a minimum
length of 16 and a maximum length of 20 (from 12-18). Improves compatibility
with environments that have longer password requirements.
```
|
Ceville is a humorous graphic adventure video game developed by the German game studio Realmforge Studios and published by Kalypso Media. Despite the game's use of 3D environments and models, the gameplay is very true to the graphical point-and-click adventure tradition of gameplay, immortalized by game series like Monkey Island from LucasArts and the King's Quest series from Sierra Online.
Plot
The evil and sarcastic tyrant King Ceville is thrown from power by an angry mob and must find a way to reclaim the crown of the fantasy realm Faeryanis. Together with his sidekick Lilly he travels all over the land and encounters a variety of odd and lovable characters including a Dark Knight who smokes too much and The Good Fairy (character from the classic folk tale Cinderella) who runs a rehabilitation clinic for former archvillains.
Reception
Nowgamer praised the game as resembling Monkey Island and for being a step in the revival of adventure games.
The game was criticized for having a few technical issues, most notably a habit of crashing for no obvious reason. The Norwegian radio program Hardcore praised the game in its review for its elegance and charm.
German Gamestar Magazine gave 86% and two Awards, PC Games 80% and PC Action 81%. Gamestar Hungary rating is 83%. IGN gave the game a triumphant 9.0 grade. IT Reviews hailed it as "a welcome return to the Golden Age of animated adventure gaming."
See also
Monkey Island series
Runaway: A Twist of Fate
References
External links
Official Ceville website at Kalypso Media
Kalypso Media Official website
2009 video games
Adventure games
Point-and-click adventure games
Fantasy video games
Focus Entertainment games
Kalypso Media games
Realmforge Studios games
Video games developed in Germany
Windows games
|
```objective-c
/*
*
*/
/*******************************************************************************
* NOTICE
* The hal is not public api, don't use it in application code.
******************************************************************************/
#pragma once
#include <stdint.h>
#include <stdbool.h>
#include <string.h>
#include "soc/hwcrypto_reg.h"
#include "soc/hp_sys_clkrst_struct.h"
#include "soc/soc_caps.h"
#include "hal/ds_types.h"
#ifdef __cplusplus
extern "C" {
#endif
/**
* @brief Enable the bus clock for DS peripheral module
*
* @param true to enable the module, false to disable the module
*/
static inline void ds_ll_enable_bus_clock(bool enable)
{
HP_SYS_CLKRST.peri_clk_ctrl25.reg_crypto_ds_clk_en = enable;
}
/// use a macro to wrap the function, force the caller to use it in a critical section
/// the critical section needs to declare the __DECLARE_RCC_ATOMIC_ENV variable in advance
#define ds_ll_enable_bus_clock(...) (void)__DECLARE_RCC_ATOMIC_ENV; ds_ll_enable_bus_clock(__VA_ARGS__)
/**
* @brief Reset the DS peripheral module
*/
static inline void ds_ll_reset_register(void)
{
HP_SYS_CLKRST.hp_rst_en2.reg_rst_en_ds = 1;
HP_SYS_CLKRST.hp_rst_en2.reg_rst_en_ds = 0;
// Clear reset on parent crypto, otherwise DS is held in reset
HP_SYS_CLKRST.hp_rst_en2.reg_rst_en_crypto = 0;
}
/// use a macro to wrap the function, force the caller to use it in a critical section
/// the critical section needs to declare the __DECLARE_RCC_ATOMIC_ENV variable in advance
#define ds_ll_reset_register(...) (void)__DECLARE_RCC_ATOMIC_ENV; ds_ll_reset_register(__VA_ARGS__)
static inline void ds_ll_start(void)
{
REG_WRITE(DS_SET_START_REG, 1);
}
/**
* @brief Wait until DS peripheral has finished any outstanding operation.
*/
static inline bool ds_ll_busy(void)
{
return (REG_READ(DS_QUERY_BUSY_REG) > 0) ? true : false;
}
/**
* @brief Busy wait until the hardware is ready.
*/
static inline void ds_ll_wait_busy(void)
{
while (ds_ll_busy());
}
/**
* @brief In case of a key error, check what caused it.
*/
static inline ds_key_check_t ds_ll_key_error_source(void)
{
uint32_t key_error = REG_READ(DS_QUERY_KEY_WRONG_REG);
if (key_error == 0) {
return DS_NO_KEY_INPUT;
} else {
return DS_OTHER_WRONG;
}
}
/**
* @brief Write the initialization vector to the corresponding register field.
*/
static inline void ds_ll_configure_iv(const uint32_t *iv)
{
for (size_t i = 0; i < (SOC_DS_KEY_PARAM_MD_IV_LENGTH / sizeof(uint32_t)); i++) {
REG_WRITE(DS_IV_MEM + (i * 4) , iv[i]);
}
}
/**
* @brief Write the message which should be signed.
*
* @param msg Pointer to the message.
* @param size Length of msg in bytes. It is the RSA signature length in bytes.
*/
static inline void ds_ll_write_message(const uint8_t *msg, size_t size)
{
memcpy((uint8_t*) DS_X_MEM, msg, size);
asm volatile ("fence");
}
/**
* @brief Write the encrypted private key parameters.
*/
static inline void ds_ll_write_private_key_params(const uint8_t *encrypted_key_params)
{
/* Note: as the internal peripheral still has RSA 4096 structure,
but C is encrypted based on the actual max RSA length (ETS_DS_MAX_BITS), need to fragment it
when copying to hardware...
(note if ETS_DS_MAX_BITS == 4096, this should be the same as copying data->c to hardware in one fragment)
*/
typedef struct { uint32_t addr; size_t len; } frag_t;
const frag_t frags[] = {
{DS_Y_MEM, SOC_DS_SIGNATURE_MAX_BIT_LEN / 8},
{DS_M_MEM, SOC_DS_SIGNATURE_MAX_BIT_LEN / 8},
{DS_RB_MEM, SOC_DS_SIGNATURE_MAX_BIT_LEN / 8},
{DS_BOX_MEM, DS_IV_MEM - DS_BOX_MEM},
};
const size_t NUM_FRAGS = sizeof(frags)/sizeof(frag_t);
const uint8_t *from = encrypted_key_params;
for (int i = 0; i < NUM_FRAGS; i++) {
memcpy((uint8_t *)frags[i].addr, from, frags[i].len);
asm volatile ("fence");
from += frags[i].len;
}
}
/**
* @brief Begin signing procedure.
*/
static inline void ds_ll_start_sign(void)
{
REG_WRITE(DS_SET_CONTINUE_REG, 1);
}
/**
* @brief check the calculated signature.
*
* @return
* - DS_SIGNATURE_OK if no issue is detected with the signature.
* - DS_SIGNATURE_PADDING_FAIL if the padding of the private key parameters is wrong.
* - DS_SIGNATURE_MD_FAIL if the message digest check failed. This means that the message digest calculated using
* the private key parameters fails, i.e., the integrity of the private key parameters is not protected.
* - DS_SIGNATURE_PADDING_AND_MD_FAIL if both padding and message digest check fail.
*/
static inline ds_signature_check_t ds_ll_check_signature(void)
{
uint32_t result = REG_READ(DS_QUERY_CHECK_REG);
switch(result) {
case 0:
return DS_SIGNATURE_OK;
case 1:
return DS_SIGNATURE_MD_FAIL;
case 2:
return DS_SIGNATURE_PADDING_FAIL;
default:
return DS_SIGNATURE_PADDING_AND_MD_FAIL;
}
}
/**
* @brief Read the signature from the hardware.
*
* @param result The signature result.
* @param size Length of signature result in bytes. It is the RSA signature length in bytes.
*/
static inline void ds_ll_read_result(uint8_t *result, size_t size)
{
memcpy(result, (uint8_t*) DS_Z_MEM, size);
asm volatile ("fence");
}
/**
* @brief Exit the signature operation.
*
* @note This does not deactivate the module. Corresponding clock/reset bits have to be triggered for deactivation.
*/
static inline void ds_ll_finish(void)
{
REG_WRITE(DS_SET_FINISH_REG, 1);
ds_ll_wait_busy();
}
#ifdef __cplusplus
}
#endif
```
|
Sir George Montgomery, 2nd Baronet (1765 – 10 July 1831) was a British Army officer and Tory politician of Scottish and Anglo-Irish descent.
Biography
Montgomery was the son of Sir William Montgomery, 1st Baronet by his second wife, Anne Evatt. In 1778 he received a commission in the 68th Regiment of Foot. He was promoted to captain in 1783 and transferred to the 14th Dragoons in 1786. In 1788, Montgomery succeeded to his father's baronetcy, his elder half-brother, William, having predeceased the first baronet. He resigned from the army in 1790. Shortly afterwards he received the position of clerk of the head permit office in the Dublin Castle administration, worth £800 a year in income, from William Pitt the Younger's ministry. Montgomery continued to receive reimbursement for the office until 1812, when Lord Liverpool removed him from the compensation list. He appealed to the new Chief Secretary for Ireland, Robert Peel, who managed to pacify Montgomery by offering a compensatory pension.
Montgomery stood for election as the Member of Parliament for the Scottish constituency of Peeblesshire in the January 1831 by-election caused by the retirement of his cousin, Sir James Montgomery, 2nd Baronet. He won the election unopposed, promising to ‘promote the safety of the king and constitution’. He was again returned for the seat unopposed in the 1831 United Kingdom general election, but died on 10 July 1831 shortly after parliament had reconvened. He is not recorded as having spoken in any debates in the Commons.
He died having never married, at which point his title became extinct. Montgomery's property in Scotland and Ireland was divided according to his will, with the family house at Magbie Hill going to his nephew, John Isaac Beresford.
References
1765 births
1831 deaths
14th King's Hussars officers
68th Regiment of Foot officers
Baronets in the Baronetage of Great Britain
Members of the Parliament of the United Kingdom for Scottish constituencies
Tory members of the Parliament of the United Kingdom
UK MPs 1830–1831
UK MPs 1831–1832
|
```go
//
// 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.
package config
import (
"fmt"
"path/filepath"
"testing"
"github.com/stretchr/testify/require"
"github.com/m3db/m3/src/cmd/services/m3query/config"
xconfig "github.com/m3db/m3/src/x/config"
)
// TestProvidedConfigFiles ensures that the files in this directly are all valid, and will load.
func TestProvidedConfigFiles(t *testing.T) {
cfgFiles, err := filepath.Glob("./*.yml")
require.NoError(t, err)
require.True(t, len(cfgFiles) > 0,
"expected some config files in this directory. Move or remove this test if this is no longer true.")
for _, fname := range cfgFiles {
t.Run(fmt.Sprintf("load %s", filepath.Base(fname)), func(t *testing.T) {
var cfg config.Configuration
require.NoError(t, xconfig.LoadFile(&cfg, fname, xconfig.Options{
DisableValidate: false,
}))
})
}
}
```
|
Alice Nicole Kinsella (born 13 March 2001) is an English artistic gymnast and member of the British national gymnastics team. She represented Great Britain at the 2020 Summer Olympics and won a bronze medal in the team event, and was part of the Great Britain team that achieved the highest positions ever achieved in the same event at the 2022 World Championships (silver) and the 2023 European Championships (gold). Kinsella won a Commonwealth Games team title as part of England's gold-winning team all-around squad of 2022.
Individually, she is the 2018 Commonwealth Games and 2019 European champion on the balance beam, and the 2022 Commonwealth Games champion on floor.
Domestically, Kinsella was the 2023 British national all-around champion.
Early career
Kinsella first started gymnastics at Tamworth Olympic Gymnastics Club. She then moved to Park Wrekin Gymnastics Club in Wellington, Shropshire and has continued training there since.
Senior career
2017
Her senior debut came in March 2017 where she finished seventh in the 2017 Stuttgart World Cup.
She competed at the 2017 European Artistic Gymnastics Championships in Cluj-Napoca, Romania where she placed tenth in the all-around.
In October 2017, Alice was chosen to represent Great Britain at the 2017 Artistic Gymnastics World Championships in Montreal, Quebec, Canada. She competed in the all-around in qualifications and placed twenty-fourth overall, qualifying her to the all-around final with a score of 51.365.
On 6 October 2017, British Gymnastics announced that Alice had withdrawn from the all-around final after sustaining a minor ankle injury during qualifications.
2018
On 10 February, Alice competed at the English Championships where she placed seventh in the all-around. She also placed fourth on vault and bars and sixth on floor. On 21 February, Alice was named to the English team for the 2018 Commonwealth Games in Gold Coast, Australia.
In March, Alice competed at the British Championships. She competed in the all-around where she placed fifth with a score of 51.650. She then competed in the beam final where she won a silver medal with a score of 13.350 and also in the floor final where she placed fifth with a score of 13.000. Later on that month, Alice was chosen to compete at the Artistic Gymnastics World Cup in Birmingham to replace teammate Claudia Fragapane who had to withdraw due to injury. She won the bronze medal with a total score of 53.099 behind Russia's Angelina Melnikova and American Margzetta Frazier.
In April Kinsella competed at the Commonwealth Games on all four events in the team final/individual qualifications where she won a silver medal with the English team, finishing behind Canada. She had also qualified in third for the all-around final, second for the beam final and sixth for the floor final. In the all-around final, Alice won bronze with a total score of 53.150 behind gold medal winner Ellie Black from Canada and silver medal winner Georgia Godwin from Australia. Alice competed in the beam final where she won gold with a score of 13.700. She told the BBC after her win:
Alice then competed in the floor final where she placed eighth after falling on her final tumble. She scored 11.666.
On 7–8 July Kinsella competed at the Heerenveen Friendly where she placed third in the team final with Great Britain, second on balance beam behind Sanne Wevers, 4th on floor, and 10th in the all-around after a fall on the beam. On 6 July Kinsella was named to the team to compete at the 2018 European Championships alongside Becky Downie, Georgia-Mae Fenton, Kelly Simm, and Lucy Stanhope. Great Britain finished fourth in team finals.
On September 27, Kinsella was named to the team to compete at the World Championships in Doha, Qatar alongside Becky Downie, Ellie Downie, Georgia-Mae Fenton, and Kelly Simm. Great Britain finished ninth in qualifications and was the first reserve for team finals.
2019
In March Kinsella competed at the English Championships where she placed third in the all-around behind Amelie Morgan and Kelly Simm. She was later selected to compete at the 2019 European Championships alongside Ellie Downie, Morgan, and Simm. At the British Championships Kinsella placed fourth in the all-around, second on uneven bars, fourth on balance beam, and fifth on floor exercise. At the European Championships Kinsella qualified to the all-around final in third place behind Angelina Melnikova and Mélanie de Jesus dos Santos. She additionally qualified to the balance beam final in third and the floor exercise final in seventh. In the all-around final Kinsella finished fifteenth. During event finals she won gold on the balance beam making her the first British gymnast to become a European champion on the apparatus. She later placed seventh in the floor exercise final.
In September Kinsella competed at the British Team Championships where she placed second in the all-around behind Kelly Simm and helped her club, Park Wreckin, place second. Later that month Kinsella was named to the team to compete at the 2019 World Championships in Stuttgart alongside Ellie Downie, Becky Downie, Taeja James, and Georgia-Mae Fenton. During qualifications Kinsella helped Great Britain place seventh, earning a spot in the team final and qualifying a team for Great Britain to the 2020 Olympic Games in Tokyo. Individually she qualified to the all-around final. During the team final she contributed scores on vault, balance beam, and floor exercise towards Great Britain's sixth place finish. In the all-around final Kinsella finished in twelfth place.
2020–21
In early February it was announced that Kinsella was selected to represent Great Britain at the Birmingham World Cup taking place in late March. However, the Birmingham World Cup was later canceled due to the COVID-19 pandemic in the United Kingdom.
In April 2021 Kinsella was selected to represent Great Britain at the European Championships alongside Jessica Gadirova, Jennifer Gadirova (later replaced by Phoebe Jakubczyk), and Amelie Morgan.
On 7 June 2021, Kinsella was selected to represent Great Britain at the 2020 Summer Olympics alongside Jessica Gadirova, Jennifer Gadirova, and Amelie Morgan. During qualifications Kinsella suffered multiple mishaps and did not qualify for any individual event finals; however Great Britain qualified for the team final. During the team final Kinsella performed on all four apparatuses, hitting all of her routines and helping Great Britain win the bronze medal, their first Olympic team medal in 93 years.
In July 2021 Alice became an official ambassador for the gymnastics leotard brand Milano Pro-Sport
Outside of gymnastics, Alice was one of a number of Olympians to appear on CBBC’s Saturday Mash Up. Kinsella was gunged with 20 buckets of slime after losing a public vote.
2022
Kinsella competed at the English and British championships where she finished second and fifth respectively. In June she was selected to represent England at the 2022 Commonwealth Games alongside Ondine Achampong, Georgia-Mae Fenton, Claudia Fragapane, and Kelly Simm. Kinsella was also selected to compete at the European Championships alongside Achampong, Fenton, and Olympic teammates Jennifer and Jessica Gadirova.
At the Commonwealth Games Kinsella led the English team to gold during the women's team final. Individually she qualified to the all-around, balance beam, and floor exercise finals. During the all-around final Kinsella fell off the balance beam and suffered mistakes on floor exercise resulting in a fourth place finish. Additionally she finished fourth in the balance beam final before going on to win gold on floor exercise.
On the first day of competition at the European Championships Kinsella won silver in the all-around behind Asia D'Amato of Italy. Additionally, she helped Great Britain qualify for the team final in second place, and individually she qualified for the uneven bars final. During the team final Kinsella contributed scores on all four apparatuses towards Great Britain's second place finish. During event finals Kinsella finished eighth on uneven bars.
In September Kinsella was named to the team to compete at the 2022 World Championships, once again alongside the Gadirova twins, Achampong, and Fenton. She qualified for the All-Around final, after finishing 14th in the qualifier round. During the team final Kinsella competed on all four apparatuses, helping Great Britain win the silver medal and achieve their highest placement at a World Championships. In the All-around final, Kinsella finished fourth, just beneath team mate Jessica Gadirova in bronze, the two highest finishes in history for a British female gymnast in a global (World or Olympic) all-around final..
2023
Kinsella competed at the English Championships where she placed first on uneven bars and balance beam. She next competed at the Welsh Championships she placed sixth on uneven bars, ninth on balance beam, and seventh on floor exercise. Kinsella was named to the team to compete at the upcoming European Championships alongside Becky Downie, Georgia-Mae Fenton, Jessica Gadirova, and Ondine Achampong. At the British championships she placed first in the all-around, on balance beam, and on floor exercise. At the European Championships Kinsella helped Great Britain win their first team gold medal. Additionally she placed sixth in the all-around during qualifications after falling off the uneven bars; however she did not advance to the final due to teammates Gadirova and Fenton placing higher. She did, however, qualify to the floor exercise final. During the floor exercise final Kinsella won silver behind compatriot Gadirova.
In September Kinsella was selected to represent Great Britain at the 2023 World Championships alongside Gadirova, Achampong, Fenton, and Ruby Evans. While there she helped the team qualify in second to the team final. Individually Kinsella was the third highest placing British all-arounder and therefore did not qualify to the final due to two-per-country limitations. Additionally she was the first reserve for the floor exercise final. During the team final Kinsella contributed scores on uneven bars and floor exercise towards Great Britain's sixth place finish. During warm-ups for the all-around final, Gadirova injured her knee and withdrew and Kinsella was substituted in. Despite being a last minute replacement, Kinsella performed four clean routines and finished seventh. In addition to the all-around final, Kinsella also replaced Gadirova in the floor exercise final, which was Kinsella's first ever World apparatus event final. During the final she finished eighth.
Personal life
Kinsella is the daughter of former Republic of Ireland international footballer Mark Kinsella. Her brother Liam is also a footballer who currently plays with Walsall and has represented Ireland at under-age level.
Competitive history
References
External links
2001 births
Living people
British female artistic gymnasts
English female artistic gymnasts
English people of Irish descent
European champions in gymnastics
Commonwealth Games medallists in gymnastics
Commonwealth Games gold medallists for England
Commonwealth Games silver medallists for England
Commonwealth Games bronze medallists for England
Gymnasts at the 2018 Commonwealth Games
Sportspeople from Birmingham, West Midlands
Gymnasts at the 2020 Summer Olympics
Olympic gymnasts for Great Britain
Olympic medalists in gymnastics
Olympic bronze medallists for Great Britain
Olympic athletes for Great Britain
Medalists at the 2020 Summer Olympics
Medalists at the World Artistic Gymnastics Championships
Gymnasts at the 2022 Commonwealth Games
21st-century British women
Medallists at the 2018 Commonwealth Games
Medallists at the 2022 Commonwealth Games
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.