text
stringlengths 1
22.8M
|
|---|
```css
`vh` and `vw`, `vmin` and `vmax`
Use `border-radius` to style rounded corners of an element
Default to a transparent `border-color` before adding a border to on `:hover` state elements
Matching images to a website's color scheme
Add `line-height` to `body`
```
|
Iliff School of Theology is a graduate Methodist theological school in Denver, Colorado. Founded in 1892, the school's campus is adjacent to the University of Denver. Fewer than 200 students attend the school.
Iliff is one of thirteen United Methodist Church seminaries in the United States. It also has close connections with the United Church of Christ, the Evangelical Lutheran Church in America, the Unitarian Universalist Association, the Episcopal Church, the Presbyterian Church USA, the Metropolitan Community Church, and others. Iliff's student body represents more than thirty faith traditions, and Iliff aims to recruit, enroll, and retain a student body that is fifty percent Black, Indigenous, and Persons of Color (BIPOC) by the fall of 2024.
The school library, called the Ira J. Taylor Library, contains the largest theological collection in the Rocky Mountain area with approximately 205,800 volumes, 60,600 microforms, and over 900 current periodical and serial subscriptions.
Iliff School of Theology is accredited by Association of Theological Schools in the United States and Canada and the North Central Association of Colleges and Schools-Commission on Institutions of Higher Education.
History
Iliff was founded in 1889 as a seminary and school of religious studies of the University of Denver. In 1892, it was named the Iliff School of Theology after John Wesley Iliff (1831–1878) who had wanted to establish a school for training ministers in the territory of Colorado. After he died, his wife Elizabeth Iliff Warren and her second husband, Bishop Henry White Warren, succeeded in starting the Iliff School of Theology. The cornerstone of Iliff Hall was laid on June 8, 1892 and construction was completed in 1893. While the construction was taking place, the first classes began on September 23, 1892.
In the summer of 1900, Iliff closed for various financial and organizational reasons. On August 27, 1903, Iliff School of Theology was incorporated as an independent institution, separate from the University of Denver. It reopened on September 10, 1910 as a freestanding school of theology and Methodist seminary.
"In 1893, Iliff School of Theology took into its library a book, given as a gift, written in Latin that is a History of Christianity. It was covered by the skin of a murdered Indian man. It was treasured by the institution and displayed for 80 years in a case outside of the Library. In 1974, under pressure from students, the book was taken out of public view and in the presence of a representative of the American Indian Movement, the skin cover was removed and repatriated. Everyone present that day were sworn to secrecy and required to sign non-disclosure agreements."
In September 1981, Iliff and the University of Denver inaugurated a joint Ph.D. program leading to the Doctor of Philosophy in Religious and Theological Studies.
Iliff has hosted a number of high-profile leaders for special events, including former Secretary of State Madeleine Albright, the Little Rock Nine, and others. From February 24–27, 2008, Iliff honored the Little Rock Nine in a series of events called "A Celebration of Courage."
In 2011, Iliff established "The Courage Award." The award is given out as a means "to acknowledge and celebrate individuals or organizations whose courage, persistence, and determination has changed an unjust situation in the world." The first recipient of this award was Judy Shepard for her work in telling the story of her son, Matthew Shepard.
Presidents
Presidents of the Iliff School of Theology have included:
1910–1915 Harris Franklin Rall
1916–1920 James Albert Beebe
1921–1924 Edwin Wesley Dunlavy
1925–1932 Elmer Guy Cutshall
1934–1942 Charles Edwin Schofield
1942–1946 Harry T. Morris
1947–1952 Edward Randolph Bartlett
1953–1961 Harold Ford Carr
1962–1969 Lowell Benjamin Swan
1969–1981 Smith Jameson Jones, Jr.
1981–2000 Donald E. Messer
2000–2004 David Maldonado, Jr.
2004–2006 J. Philip Wogaman
2006–2012 David G. Trickett
2012–2013 Albert Hernandez
2013–2023 Thomas V. Wolfe
Notable people
Alumni
Daniel A. Arnold, Professor of the Philosophy of Religion at the Divinity School of the University of Chicago.
Nadia Bolz-Weber, Founder and Pastor of House for All Sinners and Saints in Denver, Colorado
Terrance Carroll, Speaker, Colorado House of Representatives.
Rodger McDaniel, former member of the Wyoming House of Representatives and Wyoming Senate
Otis Moss III, Pastor of Chicago's Trinity United Church of Christ.
Andrew S. Park, Korean American Methodist theologian who teaches at United Theological Seminary in Trotwood, Ohio.
Mary Ann Swenson, American bishop of the United Methodist Church, elected in 1992.
Carol Voisin, member of the faculty at Southern Oregon University
Carrie Ann Lucas, lawyer, disability rights advocate, and activist
Brandan Robertson, writer, activist, and minister.
Matt Morris (musician), songwriter and former Episcopal priest.
Faculty
Miguel A. De La Torre, Professor of Social Ethics
George Tinker, Clifford Baldridge Professor of American Indian Cultures and Religious Traditions
Former faculty
Wallace Clift, Head of Anglican Studies, 1992–2002
Vincent Harding, Professor Emeritus of Religion and Social Transformation, 1981–2004
Dennis MacDonald, Theology and Biblical Studies, 1980-1998.
Donald E. Messer, Henry White Warren Professor of Practical Theology, 1981–2000
References
External links
Universities and colleges in Denver
United Methodist seminaries
Seminaries and theological colleges in Colorado
Educational institutions established in 1892
1892 establishments in Colorado
Iliff School of Theology
|
```xml
export interface IVSCodeIconTheme {
path: string;
_watch: boolean;
}
```
|
Sheila Ann Manson McLean (born 20 June 1951) is International Bar Association Professor of Law and Ethics in Medicine and director of the Institute of Law and Ethics in Medicine at the School of Law of the University of Glasgow. McLean is the Book Reviewers' Editor for Medical Law International.
Early life
Born Sheila Black, she was educated at the Glasgow High School for Girls and studied at the University of Glasgow, graduating LL.B. in 1972. She then worked as an Area Reporter for the Children's Panel, and in 1975 was appointed Lecturer at the School of Law of the University of Glasgow. She was awarded an M.Litt. in 1978, with a dissertation entitled The role of the reporter in the children's hearing system, and in 1987 completed her Ph.D., Information disclosure, consent to medical treatment and the law. She was appointed Senior Lecturer in 1985, and established the Institute of Law and Ethics in Medicine.
Career
In 1990, McLean was appointed the first International Bar Association Professor of Law and Ethics in Medicine, and has since pursued a distinguished research career. She has published widely, in particular on consent, reproductive and end of life issues. She authored a controversial book concerning the ethical future of applied genetic engineering, entitled Modern Dilemma : Choosing Children, and has spoken out with criticism of the Baby Gender Mentor test.
McLean has also held a number of appointments, both nationally and internationally. Currently, she is UK Adviser to the European branch of the World Health Organization on the revision of its Health for All policy, a member of the UNESCO Biomedical Ethics Committee, and Specialist Adviser to the House of Commons Science and Technology Select Committee. Between 1997 and 1998, she chaired the Department of Health review of consent provisions in the Human Fertilisation and Embryology Act 1990 and between 2000 and 2003, chaired the Independent Review Group on Organ Retention at Post Mortem. From 1999 to 2002, she was the first Chairman of the Scottish Criminal Cases Review Commission.
She has been awarded honorary degrees by the Universities of Abertay Dundee and Edinburgh, and Fellowships of the Academy of Medical Sciences, Royal Society of Edinburgh, Royal College of Physicians of Edinburgh, Royal College of General Practitioners and the Royal Society of Arts. She is also a distinguished supporter of Humanists UK.
McLean was appointed Officer of the Order of the British Empire (OBE) in the 2020 New Year Honours for services to health and education.
Personal life
She married Alan McLean in 1976, although the marriage was dissolved in 1987. She is a member of the Lansdowne Club.
References
External links
Professor Sheila McLean, Staff Profile, University of Glasgow
getCITED profile
Interview discussing her book: Modern Dilemma: Choosing Children at the Edinburgh International Book Festival,
Living people
Scottish legal scholars
Scottish humanists
People educated at the High School of Glasgow
Alumni of the University of Glasgow
Academics of the University of Glasgow
Fellows of the Royal Society of Edinburgh
Scholars of medical law
1951 births
Officers of the Order of the British Empire
|
Andrew Hosie was a Scottish amateur footballer who made over 170 appearances as a right back in the Scottish League for Queen's Park. He represented Scotland at amateur level and captained the team on occasion.
References
Scottish men's footballers
Scottish Football League players
Footballers from Glasgow
Place of death missing
Date of death missing
Men's association football wing halves
Year of birth missing
Scotland men's amateur international footballers
Queen's Park F.C. players
|
Hjørring Stadium (Danish: Hjørring Stadion) is a multi-purpose stadium located in Hjørring, Denmark, that is part of Femhøje Sport Center, and hence also known as Femhøje Stadion – Hjørring. It is currently used mostly for association football matches and is the home stadium of Fortuna Hjørring and Vendsyssel FF. The stadium, which is owned and operated by Hjørring Municipality, has a maximum capacity of 10,000 people of which 3,100 are seats. The attendance record of 7,919 spectators was set on 3 June 1973 in a match in the western group of Danish 3rd Division between Hjørring IF and local rivals Frederikshavn fI. It has been known as Nord Energi Arena for sponsorship reasons since July 2017 and had previously been referred to as Bredbånd Nord Arena (2015–2017).
New Stadium
In September 2011 it was decided that Hjørring should have a new stadium, linked to the Park Vendia which would be completed in 2013.
The plan, however, changed when Hjørring came into trouble in terms of the economy to the construction of the new stadium.
Renovation
On May 29, 2013 Hjørring City Council decided to renovate the old stadium. The renovation includes a new and lasting main stand with two sports centers integrated in the back of it. The new main stand with sponsor lounge will accommodate 500 seats under roof.
Opposite the main stand is a small terrace with a capacity of around 1500 people. In order to optimize the intimacy and match experience the fences and advertising boards in both ends were placed closer to the pitch than before.
There is also a new lighting system of 1000 lux. The renovation was completed in the summer 2015.
In the summer of 2018 Vendsyssel FF earned a promotion to the Superliga. To be eligible to play in the highest tier, the stadium needs a total capacity of at least 10,000 people and at least 3,000 seats.
References
External links
Stadium page at vendsysselff.dk
Football venues in Denmark
Multi-purpose stadiums in Denmark
Buildings and structures in Hjørring Municipality
|
```java
package com.github.jvmgo.instructions.stack;
import com.github.jvmgo.instructions.base.NoOperandsInstruction;
import com.github.jvmgo.rtda.Frame;
import com.github.jvmgo.rtda.OperandStack;
import com.github.jvmgo.rtda.Slot;
public class dup2_x1 extends NoOperandsInstruction {
@Override
public int getOpCode() {
return 0x5d;
}
@Override
public void execute(Frame frame) throws Exception {
OperandStack operandStack = frame.getOperandStack();
Slot slot1 = operandStack.popSlot();
Slot slot2 = operandStack.popSlot();
Slot slot3 = operandStack.popSlot();
operandStack.pushSlot(slot2);
operandStack.pushSlot(slot1);
operandStack.pushSlot(slot3);
operandStack.pushSlot(slot2);
operandStack.pushSlot(slot1);
}
}
```
|
The canton of Saint-Apollinaire is an administrative division of the Côte-d'Or department, eastern France. It was created at the French canton reorganisation which came into effect in March 2015. Its seat is in Saint-Apollinaire.
It consists of the following communes:
Arceau
Arc-sur-Tille
Beaumont-sur-Vingeanne
Beire-le-Châtel
Belleneuve
Bèze
Bézouotte
Blagny-sur-Vingeanne
Bourberain
Champagne-sur-Vingeanne
Charmes
Chaume-et-Courchamp
Cheuge
Couternon
Cuiserey
Dampierre-et-Flée
Fontaine-Française
Fontenelle
Jancigny
Licey-sur-Vingeanne
Magny-Saint-Médard
Mirebeau-sur-Bèze
Montigny-Mornay-Villeneuve-sur-Vingeanne
Noiron-sur-Bèze
Oisilly
Orain
Pouilly-sur-Vingeanne
Remilly-sur-Tille
Renève
Saint-Apollinaire
Saint-Maurice-sur-Vingeanne
Saint-Seine-sur-Vingeanne
Savolles
Tanay
Trochères
Varois-et-Chaignot
Viévigne
References
Cantons of Côte-d'Or
|
Grand City Properties S.A. is a residential real estate company, headquartered in Luxembourg. It invests in value-add residential opportunities in the largest cities and metropolitan areas of Germany and London. With 63.000 apartments, Grand City Properties is one of the largest residential real estate companies in Europe.
Company
The company has annual net rent of €560 million and is distributing annual dividends of around €138 million. As of December 2019, the company’s asset value is €11 billion and equity €5 billion. The net profit in 2019 was €493 million and €340 million in 1-9/2020.
The largest single shareholder with 40% is Aroundtown SA, which is 10% owned by Yakir Gabay.
The company's portfolio is focused on properties in the metropolitan areas in the state of North Rhine-Westphalia and the cities of Berlin, Dresden, Leipzig, Hamburg and London.
Sustainability
The European Public Real Estate Association EPRA has awarded Grand City Properties S.A. the Gold Award for sustainability. In addition, the company was awarded the first place in the category "outstanding contribution to society", in which the outstanding tenant service was acknowledged.
2017 for the first time, the company has published a sustainability report and in 2018 an EPRA report.
History
Grand City Properties S.A. business activity was founded by Yakir Gabay in 2004. The first residential acquisitions started in the center of Berlin.
The company’s stock was listed on the Frankfurt Stock Exchange in mid 2012 at a price per share of €2.7 and market cap of €150 million. As of December 2020, the Company is listed on the Frankfurt Prime Standard and is included in the MDAX index, at a share price of €20 and market cap of €3.6 billion. The Company’s IPO is considered the most successful in the Frankfurt Stock Exchange in the last decade, with a 8 fold increase in share price within 8 years.
References
External links
Grand City Properties aims to join major Frankfurt stock index next year
Lured by Pre-Brexit Bargain, German Buyer Goes on London Real Estate Spree
GYC Stock Forecast, Price & News (Grand City Properties)
גרנד סיטי פרופרטיז הנפיקה מניות ואג"ח תמורת 300 מ' א'
הישראלי הכי מצליח בברלין, יקיר גבאי, כבר שווה 650 מיליון דולר
גרנד סיטי פרופרטיז: גידול של 59% ברווח הנקי במחצית הראשונה
Real estate companies of Luxembourg
Companies listed on the Frankfurt Stock Exchange
2012 initial public offerings
Companies in the MDAX
|
John Smith was Leader of the Labour Party and Leader of the Official Opposition from 18 July 1992 until his death on 12 May 1994. Smith became leader upon succeeding Neil Kinnock, who had resigned following the 1992 general election—for the fourth successive time, the Conservatives had won and Labour lost.
Prior to being Leader of the Opposition, Smith had been a member of the Government of James Callaghan as President of the Board of Trade (1978–1979), and served under his predecessor Neil Kinnock's Shadow Cabinet as Shadow Chancellor of the Exchequer (1987–1992).
Smith's tenure as Leader of the Opposition saw the Government's policies of the implementation of the Citizen's Charter, progress in the Northern Ireland peace negotiations, and the creation and centralisation of the European Union. Smith died suddenly on 12 May 1994, and was replaced as Acting Leader by Margaret Beckett, who served until 21 July 1994.
Shadow Cabinet list
Initial Shadow Cabinet
On 24 July 1992, John Smith announced the following Shadow Cabinet:
John Smith – Leader of Her Majesty's Most Loyal Opposition and Leader of the Labour Party
Margaret Beckett – Deputy Leader of Her Majesty's Most Loyal Opposition, Deputy Leader of the Labour Party, Shadow Leader of the House of Commons, and Elections Co-ordinator
Gordon Brown – Shadow Chancellor of the Exchequer.
Jack Cunningham – Shadow Foreign Secretary
Tony Blair – Shadow Home Secretary
David Clark – Shadow Secretary of State for Defence
Ann Taylor – Shadow Secretary of State for Education
Frank Dobson – Shadow Secretary of State for Employment
Jack Straw – Shadow Minister for Local Government and Housing
Chris Smith – Shadow Secretary of State for the Environment and Shadow Minister for London
David Blunkett – Shadow Secretary of State for Health
Donald Dewar – Shadow Secretary of State for Social Security
Bryan Gould – Shadow Secretary of State for National Heritage
Robin Cook – Shadow Secretary of State for Trade and Industry
John Prescott – Shadow Secretary of State for Transport
Tom Clarke – Shadow Secretary of State for Scotland
Ann Clwyd – Shadow Secretary of State for Wales
Kevin McNamara – Shadow Secretary of State for Northern Ireland
Michael Meacher – Shadow Minister for Overseas Development
Mo Mowlam – Shadow Chancellor of the Duchy of Lancaster, Shadow Minister for the Citizen's Charter, and Shadow Minister for the Status of Women
Harriet Harman – Shadow Chief Secretary to the Treasury
Ron Davies – Shadow Minister of Agriculture, Fisheries and Food
Lord Richard – Leader of the Opposition in the House of Lords
Derek Foster – Labour Chief Whip in the House of Commons
Lord Graham of Edmonton – Labour Chief Whip in the House of Lords
Lord Irvine of Lairg – Shadow Lord Chancellor
Changes
29 September 1992: Gould resigned over the Party's stance on the Maastricht Treaty. and was replaced as Shadow National Heritage Secretary by Ann Clwyd, who retained her position as Shadow Welsh Secretary.
1993 reshuffle
Smith reshuffled the Shadow Cabinet on 21 October 1993, following the 1993 Shadow Cabinet elections. Clwyd left the Shadow Cabinet. Mowlam replaced her as Shadow National Heritage Secretary, with Clare Short (who also lost in the Shadow Cabinet elections) replacing her as Shadow Minister for the Status of Women. Meacher replaced Mowlam as Shadow Chancellor of the Duchy of Lancaster and Shadow Minister for the Citizen's Charter. He was in turn replaced by Clarke at the Overseas Development portfolio, and Clarke was replaced as Scottish Spokesperson by new Shadow Cabinet minister George Robertson. Clwyd was replaced as Shadow Welsh Secretary by Davies, who was replaced at Agriculture by Gavin Strang. Prescott and Dobson exchanged portfolios (receiving Employment and Transport, respectively), with Dobson also taking London from Chris Smith. Blunkett became Chair of the Labour Party while retaining the Health portfolio.
John Smith – Leader of Her Majesty's Most Loyal Opposition and Leader of the Labour Party
Margaret Beckett – Deputy Leader of Her Majesty's Most Loyal Opposition, Deputy Leader of the Labour Party, Shadow Leader of the House of Commons, and Elections Co-ordinator
Gordon Brown – Shadow Chancellor of the Exchequer
Jack Cunningham – Shadow Foreign Secretary
Tony Blair – Shadow Home Secretary
David Clark – Shadow Secretary of State for Defence
Ann Taylor – Shadow Secretary of State for Education
Frank Dobson – Shadow Secretary of State for Transport and Shadow Minister for London
Jack Straw – Shadow Minister for Local Government and Housing
Chris Smith – Shadow Secretary of State for the Environment
David Blunkett – Shadow Secretary of State for Health and Chair of the Labour Party
Donald Dewar – Shadow Secretary of State for Social Security
Mo Mowlam – Shadow Secretary of State for National Heritage
Robin Cook – Shadow Secretary of State for Trade and Industry
John Prescott – Shadow Secretary of State for Employment
George Robertson – Shadow Secretary of State for Scotland
Ron Davies – Shadow Secretary of State for Wales
Kevin McNamara – Shadow Secretary of State for Northern Ireland
Tom Clarke – Shadow Minister for Overseas Development
Michael Meacher – Shadow Chancellor of the Duchy of Lancaster and Shadow Minister for the Citizen's Charter
Clare Short – Shadow Minister for the Status of Women
Harriet Harman – Shadow Chief Secretary to the Treasury
Gavin Strang – Shadow Minister of Agriculture, Fisheries and Food
Lord Richard – Leader of the Opposition in the House of Lords
Derek Foster – Labour Chief Whip in the House of Commons
Lord Graham of Edmonton – Labour Chief Whip in the House of Lords
Lord Irvine of Lairg – Shadow Lord Chancellor
See also
1992 Labour Party leadership election
1992 Labour Party (UK) Shadow Cabinet election
1993 Labour Party (UK) Shadow Cabinet election
References
Official Opposition (United Kingdom)
Smith
1992 establishments in the United Kingdom
1993 in the United Kingdom
1994 in the United Kingdom
1992 elections in the United Kingdom
1994 disestablishments in the United Kingdom
British shadow cabinets
John Smith (Labour Party leader)
|
The Chitina Tin Shop, also known as Fred's Place and Schaupp's, is a historic retail building on Main Street in Chitina, Alaska. It is a wood-frame structure, two stories in height, with a flat-topped false front in front of a gable roof. The building is wide and deep. It was built in 1912 by Fred Schaupp, during Chitina's building boom following the arrival of the Copper River and Northwestern Railway. The building is one of only a few surviving tin shops (essentially a metalworking facility) in the state. The first floor was occupied by the workshop, while living quarters were above. Following the closing of the railroad in 1938, the building has seen a variety of other uses. The building has been restored, and now houses an art gallery.
The building was listed on the National Register of Historic Places in 1979.
See also
National Register of Historic Places listings in Copper River Census Area, Alaska
References
1912 establishments in Alaska
Art museums and galleries in Alaska
Buildings and structures on the National Register of Historic Places in Copper River Census Area, Alaska
Commercial buildings completed in 1912
Commercial buildings on the National Register of Historic Places in Alaska
Metal companies of the United States
Retail buildings in Alaska
Tin
|
Cross Church is a Baptist multi-site megachurch with campuses in Springdale, Rogers (Pinnacle Hills) and Fayetteville. It is affiliated with the Southern Baptist Convention. Across its three campuses, Cross Church is one of the largest churches in the state of Arkansas. The senior pastor is Nick Floyd, son of Ronnie Floyd- longtime senior pastor of Cross Church for thirty years when he left to become full-time CEO of the Southern Baptist Convention.
History
The church was founded in 1870 as Landmark Liberty Baptist Church. In 1910, the church was renamed as First Baptist Church of Springdale. Otto Whittington served as pastor from 1940 until 1945. For 16 years, the church was pastored by Cliff Palmer who began his tenure in 1970. In 1976, it founded the Shiloh Christian School. Dr. Ronnie Floyd would become pastor of the church in 1986.
In 2001, it opened a campus in Rogers (Pinnacle Hills). The church changed its name from First Baptist Church of Springdale to Cross Church in 2010.
In 2018, it claimed a weekly attendance of 8,959 people.
In 2019, Nick Floyd became the senior pastor, after the departure of his father Ronnie Floyd.
References
External links
Cross Church
The Summit, Business Persons' Luncheon
Shiloh Christian School
Baptist churches in Arkansas
Evangelical megachurches in the United States
Churches in Washington County, Arkansas
Southern Baptist Convention churches
Buildings and structures in Springdale, Arkansas
Baptist multisite churches
|
Wild Ones were an American dream pop band from Portland, Oregon.
History
Wild Ones began in 2010 with the release of an EP titled You're A Winner. In 2014, they released their first full-length album on Topshelf Records.
In 2015, Wild Ones released an EP titled Heatwave on Topshelf Records.
On December 2nd 2022, Sulivan made a post that advertised a release of previously unreleased music which include live session and demo songs on bandcamp.
Band members
Thomas Himes (keyboard)
Danielle Sullivan (vocals)
Max Stein (bass)
Nick Vicario (guitar)
Seve Sheldon (drums)
Discography
Studio albums
Keep It Safe (2014, Topshelf)
Mirror Touch (2017, Topshelf)
EPs
You're A Winner (2010)
Heatwave (2014, Topshelf)
References
2010 establishments in Oregon
Musical groups from Portland, Oregon
Musical groups established in 2010
American dream pop musical groups
Topshelf Records artists
|
```java
/*
*
*/
package io.debezium.connector.mysql;
import io.debezium.connector.binlog.BinlogMultiTableStatementIT;
/**
* @author Jiri Pechanec
*/
public class MultiTableStatementIT extends BinlogMultiTableStatementIT<MySqlConnector> implements MySqlCommon {
}
```
|
Oichalia , before 1981: Νεοχώρι - Neochori) is a town and a former municipality in the Trikala regional unit, Thessaly, Greece. Since the 2011 local government reform it is part of the municipality Farkadona, of which it is a municipal unit. The municipal unit has an area of 85.628 km2. In 2011 the population of the municipality was 4,781, the population of the town proper was 2,357. Oichalia is located 8 km west of Farkadona centre, and 20 km east of the city of Trikala. It is situated on the edge of the Thessalian Plain. The Greek National Road 6 (Larissa - Trikala - Ioannina - Igoumenitsa) passes south of Oichalia.
Subdivisions
The municipal unit Oichalia is subdivided into the following communities:
Georganades
Klokotos
Krini
Oichalia
Petroto
Population
See also
List of settlements in the Trikala regional unit
External links
Ichalia (municipality) on GTP Travel Pages
Ichalia (small town) on GTP Travel Pages
References
Populated places in Trikala (regional unit)
Farkadona
|
```smalltalk
namespace Asp.Versioning;
using Microsoft.AspNetCore.Http;
public class LowestImplementedApiVersionSelectorTest
{
[Theory]
[ClassData( typeof( MinSelectVersionData ) )]
public void select_version_should_return_min_api_version( IEnumerable<ApiVersion> supportedVersions, IEnumerable<ApiVersion> deprecatedVersions, ApiVersion expectedVersion )
{
// arrange
var options = new ApiVersioningOptions() { DefaultApiVersion = new ApiVersion( 42, 0 ) };
var selector = new LowestImplementedApiVersionSelector( options );
var request = Mock.Of<HttpRequest>();
var versionInfo = new ApiVersionModel( supportedVersions, deprecatedVersions );
// act
var selectedVersion = selector.SelectVersion( request, versionInfo );
// assert
selectedVersion.Should().Be( expectedVersion );
}
}
```
|
Demitrius Irving Tolentino Omphroy (born May 30, 1989) is a painter with a contemporary expressionistic style and a former footballer who played as a defender and a midfielder. Born and raised in the United States, which he represented at under-17 level, he is also a citizen of Panama and the Philippines through descent. He played for the former at under–21 level and for the latter at senior level. He also appeared in the Major League Soccer.
Career
College and Amateur
Omphroy played with Sporting Clube de Portugal Academy Juniores at age 17. He returned to the U.S. and played four years of college soccer for the University of California, Berkeley. During his college career, he also played for the San Francisco Seals in the USL Premier Development League, and for National Premier Soccer League club Bay Area Ambassadors.
Professional
Omphroy was selected by Toronto FC in the second round (26th overall) of the 2011 MLS SuperDraft. He was officially signed by Toronto FC on March 16, 2011. Omphroy made his debut for Toronto June 29 as a second half sub for Joao Plata in a 1–0 home victory over Vancouver Whitecaps FC. Originally a right back, Omphroy was moved to the forward position after a few games with Toronto FC.
Omphroy was waived by Toronto on November 23, 2011.
In September 2012, he signed up for Filipino side Global FC for the 2012–2013 season. His first appearance in the club was on October 20, 2012, coming off the bench against Philippine Navy where the won, 4–0 in the group stage of 2012 UFL Cup. He then scored against Kaya in the 33rd minute to help the club secure a win in 2–1 scoreline and advance to the semi-finals.
International
Omphroy represented the United States at under-18 level. In June 2010 Omphroy was selected by Julio Dely Valdés to play for the Panama under-21 national team in qualifiers for the Central American Games.
In August 2012 he was called up to the Philippines, and was featured in a friendly match with USL PDL club Chicago Inferno which ended in a 1–3 loss. He made his first official appearance coming off the bench in a 1–0 win to Guam at the 2012 Philippine Peace Cup.
Personal
Omphroy's parents were born in the United States, like him. His father was the son of a Panamanian man and a German woman; his mother, the daughter of a Filipino couple.
He has multiple sclerosis, which was first discovered having as a result of a magnetic resonance imaging (MRI) scan in February 2010. He had initially experienced vision problems and numbness in his foot while with Sporting Clube de Portugal Academy Juniores. The symptoms, which later included neck pain, precluded him from signing his first professional contract with Sporting and forced him to return to the United States for medical attention. Toronto FC had no knowledge of his condition when they drafted him. Part of Omphroy's ongoing treatment is daily self-injections of Copaxone.
Omphroy appeared in the music video for the song "Boyfriend" by Canadian pop singer Justin Bieber.
References
External links
Golden Bears profile
1989 births
Living people
American people of German descent
American men's soccer players
American sportspeople of Filipino descent
American sportspeople of Panamanian descent
Men's association football fullbacks
California Golden Bears men's soccer players
Expatriate men's footballers in Portugal
Expatriate men's soccer players in Canada
Filipino expatriate men's footballers
Filipino men's footballers
Filipino people of German descent
Filipino people of Panamanian descent
Global F.C. players
Major League Soccer players
Panamanian men's footballers
Panamanian people of Filipino descent
Panamanian people of German descent
People with multiple sclerosis
Philippines men's international footballers
USL League Two players
San Francisco Seals (soccer) players
Sportspeople from Alameda, California
Soccer players from Alameda County, California
Toronto FC draft picks
Toronto FC players
United States men's youth international soccer players
Panamanian people with disabilities
Filipino people with disabilities
American artists with disabilities
|
This is a list of episodes from The Sylvester & Tweety Mysteries, featuring Granny, Sylvester, Tweety and Hector as globe-trotting detectives.
Series overview
Episodes
Season 1 (1995–96)
Season 2 (1996–97)
Note: All seasons from here on out now have two 11-minute segments instead of a full-length episode.
Season 3 (1997–98)
Season 4 (1998–99)
Season 5 (1999–2002)
Beginning this season, the show switches from traditional hand-painted cels to digital ink and paint. The final episode, consisting of the stories "The Tail End" and "This is the End", was meant to air in 2000 but the show was cancelled before it could air, and didn't air on television until December 18, 2002, on Cartoon Network.
References
External links
Sylvester and Tweety Mysteries
|
The Centridini are a tribe of large apid bees, many of which possess adaptations for carrying floral oils rather than (or in addition to) pollen or nectar. The floral oils are often gathered from plants of the family Malpighiaceae, though other plants may be visited. The oil-collecting species typically have "combs" composed of closely spaced, flattened, blunt bristles on the margins of the first tarsal segments of the front and middle legs; others may have velvety "pads" to absorb the oils. They also commonly gather plant resins for use in nest cell construction. They have a tiny pterostigma in the forewing, the female scopa is very bushy, and the first flagellomere of the antenna is often longer than the scape.
Centris are commonly encountered bees in American deserts, and are active at very high ambient temperatures when many other species are in hiding. They can often be seen in large numbers on palo verde blossoms. A common example in Arizona is Centris pallida.
References
C. D. Michener (2000) The Bees of the World, Johns Hopkins University Press.
Apinae
Bee tribes
|
```objective-c
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
//
//
// This Source Code Form is subject to the terms of the Mozilla
// with this file, You can obtain one at path_to_url
#ifndef EIGEN_SVDBASE_H
#define EIGEN_SVDBASE_H
namespace Eigen {
/** \ingroup SVD_Module
*
*
* \class SVDBase
*
* \brief Base class of SVD algorithms
*
* \tparam Derived the type of the actual SVD decomposition
*
* SVD decomposition consists in decomposing any n-by-p matrix \a A as a product
* \f[ A = U S V^* \f]
* where \a U is a n-by-n unitary, \a V is a p-by-p unitary, and \a S is a n-by-p real positive matrix which is zero outside of its main diagonal;
* the diagonal entries of S are known as the \em singular \em values of \a A and the columns of \a U and \a V are known as the left
* and right \em singular \em vectors of \a A respectively.
*
* Singular values are always sorted in decreasing order.
*
*
* You can ask for only \em thin \a U or \a V to be computed, meaning the following. In case of a rectangular n-by-p matrix, letting \a m be the
* smaller value among \a n and \a p, there are only \a m singular vectors; the remaining columns of \a U and \a V do not correspond to actual
* singular vectors. Asking for \em thin \a U or \a V means asking for only their \a m first columns to be formed. So \a U is then a n-by-m matrix,
* and \a V is then a p-by-m matrix. Notice that thin \a U and \a V are all you need for (least squares) solving.
*
* If the input matrix has inf or nan coefficients, the result of the computation is undefined, but the computation is guaranteed to
* terminate in finite (and reasonable) time.
* \sa class BDCSVD, class JacobiSVD
*/
template<typename Derived>
class SVDBase
{
public:
typedef typename internal::traits<Derived>::MatrixType MatrixType;
typedef typename MatrixType::Scalar Scalar;
typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
typedef typename MatrixType::StorageIndex StorageIndex;
typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3
enum {
RowsAtCompileTime = MatrixType::RowsAtCompileTime,
ColsAtCompileTime = MatrixType::ColsAtCompileTime,
DiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_DYNAMIC(RowsAtCompileTime,ColsAtCompileTime),
MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime,
MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime,
MaxDiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED(MaxRowsAtCompileTime,MaxColsAtCompileTime),
MatrixOptions = MatrixType::Options
};
typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime, MatrixOptions, MaxRowsAtCompileTime, MaxRowsAtCompileTime> MatrixUType;
typedef Matrix<Scalar, ColsAtCompileTime, ColsAtCompileTime, MatrixOptions, MaxColsAtCompileTime, MaxColsAtCompileTime> MatrixVType;
typedef typename internal::plain_diag_type<MatrixType, RealScalar>::type SingularValuesType;
Derived& derived() { return *static_cast<Derived*>(this); }
const Derived& derived() const { return *static_cast<const Derived*>(this); }
/** \returns the \a U matrix.
*
* For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p,
* the U matrix is n-by-n if you asked for \link Eigen::ComputeFullU ComputeFullU \endlink, and is n-by-m if you asked for \link Eigen::ComputeThinU ComputeThinU \endlink.
*
* The \a m first columns of \a U are the left singular vectors of the matrix being decomposed.
*
* This method asserts that you asked for \a U to be computed.
*/
const MatrixUType& matrixU() const
{
eigen_assert(m_isInitialized && "SVD is not initialized.");
eigen_assert(computeU() && "This SVD decomposition didn't compute U. Did you ask for it?");
return m_matrixU;
}
/** \returns the \a V matrix.
*
* For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p,
* the V matrix is p-by-p if you asked for \link Eigen::ComputeFullV ComputeFullV \endlink, and is p-by-m if you asked for \link Eigen::ComputeThinV ComputeThinV \endlink.
*
* The \a m first columns of \a V are the right singular vectors of the matrix being decomposed.
*
* This method asserts that you asked for \a V to be computed.
*/
const MatrixVType& matrixV() const
{
eigen_assert(m_isInitialized && "SVD is not initialized.");
eigen_assert(computeV() && "This SVD decomposition didn't compute V. Did you ask for it?");
return m_matrixV;
}
/** \returns the vector of singular values.
*
* For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p, the
* returned vector has size \a m. Singular values are always sorted in decreasing order.
*/
const SingularValuesType& singularValues() const
{
eigen_assert(m_isInitialized && "SVD is not initialized.");
return m_singularValues;
}
/** \returns the number of singular values that are not exactly 0 */
Index nonzeroSingularValues() const
{
eigen_assert(m_isInitialized && "SVD is not initialized.");
return m_nonzeroSingularValues;
}
/** \returns the rank of the matrix of which \c *this is the SVD.
*
* \note This method has to determine which singular values should be considered nonzero.
* For that, it uses the threshold value that you can control by calling
* setThreshold(const RealScalar&).
*/
inline Index rank() const
{
using std::abs;
eigen_assert(m_isInitialized && "JacobiSVD is not initialized.");
if(m_singularValues.size()==0) return 0;
RealScalar premultiplied_threshold = numext::maxi<RealScalar>(m_singularValues.coeff(0) * threshold(), (std::numeric_limits<RealScalar>::min)());
Index i = m_nonzeroSingularValues-1;
while(i>=0 && m_singularValues.coeff(i) < premultiplied_threshold) --i;
return i+1;
}
/** Allows to prescribe a threshold to be used by certain methods, such as rank() and solve(),
* which need to determine when singular values are to be considered nonzero.
* This is not used for the SVD decomposition itself.
*
* When it needs to get the threshold value, Eigen calls threshold().
* The default is \c NumTraits<Scalar>::epsilon()
*
* \param threshold The new value to use as the threshold.
*
* A singular value will be considered nonzero if its value is strictly greater than
* \f$ \vert singular value \vert \leqslant threshold \times \vert max singular value \vert \f$.
*
* If you want to come back to the default behavior, call setThreshold(Default_t)
*/
Derived& setThreshold(const RealScalar& threshold)
{
m_usePrescribedThreshold = true;
m_prescribedThreshold = threshold;
return derived();
}
/** Allows to come back to the default behavior, letting Eigen use its default formula for
* determining the threshold.
*
* You should pass the special object Eigen::Default as parameter here.
* \code svd.setThreshold(Eigen::Default); \endcode
*
* See the documentation of setThreshold(const RealScalar&).
*/
Derived& setThreshold(Default_t)
{
m_usePrescribedThreshold = false;
return derived();
}
/** Returns the threshold that will be used by certain methods such as rank().
*
* See the documentation of setThreshold(const RealScalar&).
*/
RealScalar threshold() const
{
eigen_assert(m_isInitialized || m_usePrescribedThreshold);
return m_usePrescribedThreshold ? m_prescribedThreshold
: (std::max<Index>)(1,m_diagSize)*NumTraits<Scalar>::epsilon();
}
/** \returns true if \a U (full or thin) is asked for in this SVD decomposition */
inline bool computeU() const { return m_computeFullU || m_computeThinU; }
/** \returns true if \a V (full or thin) is asked for in this SVD decomposition */
inline bool computeV() const { return m_computeFullV || m_computeThinV; }
inline Index rows() const { return m_rows; }
inline Index cols() const { return m_cols; }
/** \returns a (least squares) solution of \f$ A x = b \f$ using the current SVD decomposition of A.
*
* \param b the right-hand-side of the equation to solve.
*
* \note Solving requires both U and V to be computed. Thin U and V are enough, there is no need for full U or V.
*
* \note SVD solving is implicitly least-squares. Thus, this method serves both purposes of exact solving and least-squares solving.
* In other words, the returned solution is guaranteed to minimize the Euclidean norm \f$ \Vert A x - b \Vert \f$.
*/
template<typename Rhs>
inline const Solve<Derived, Rhs>
solve(const MatrixBase<Rhs>& b) const
{
eigen_assert(m_isInitialized && "SVD is not initialized.");
eigen_assert(computeU() && computeV() && "SVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice).");
return Solve<Derived, Rhs>(derived(), b.derived());
}
#ifndef EIGEN_PARSED_BY_DOXYGEN
template<typename RhsType, typename DstType>
void _solve_impl(const RhsType &rhs, DstType &dst) const;
#endif
protected:
static void check_template_parameters()
{
EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar);
}
// return true if already allocated
bool allocate(Index rows, Index cols, unsigned int computationOptions) ;
MatrixUType m_matrixU;
MatrixVType m_matrixV;
SingularValuesType m_singularValues;
bool m_isInitialized, m_isAllocated, m_usePrescribedThreshold;
bool m_computeFullU, m_computeThinU;
bool m_computeFullV, m_computeThinV;
unsigned int m_computationOptions;
Index m_nonzeroSingularValues, m_rows, m_cols, m_diagSize;
RealScalar m_prescribedThreshold;
/** \brief Default Constructor.
*
* Default constructor of SVDBase
*/
SVDBase()
: m_isInitialized(false),
m_isAllocated(false),
m_usePrescribedThreshold(false),
m_computationOptions(0),
m_rows(-1), m_cols(-1), m_diagSize(0)
{
check_template_parameters();
}
};
#ifndef EIGEN_PARSED_BY_DOXYGEN
template<typename Derived>
template<typename RhsType, typename DstType>
void SVDBase<Derived>::_solve_impl(const RhsType &rhs, DstType &dst) const
{
eigen_assert(rhs.rows() == rows());
// A = U S V^*
// So A^{-1} = V S^{-1} U^*
Matrix<Scalar, Dynamic, RhsType::ColsAtCompileTime, 0, MatrixType::MaxRowsAtCompileTime, RhsType::MaxColsAtCompileTime> tmp;
Index l_rank = rank();
tmp.noalias() = m_matrixU.leftCols(l_rank).adjoint() * rhs;
tmp = m_singularValues.head(l_rank).asDiagonal().inverse() * tmp;
dst = m_matrixV.leftCols(l_rank) * tmp;
}
#endif
template<typename MatrixType>
bool SVDBase<MatrixType>::allocate(Index rows, Index cols, unsigned int computationOptions)
{
eigen_assert(rows >= 0 && cols >= 0);
if (m_isAllocated &&
rows == m_rows &&
cols == m_cols &&
computationOptions == m_computationOptions)
{
return true;
}
m_rows = rows;
m_cols = cols;
m_isInitialized = false;
m_isAllocated = true;
m_computationOptions = computationOptions;
m_computeFullU = (computationOptions & ComputeFullU) != 0;
m_computeThinU = (computationOptions & ComputeThinU) != 0;
m_computeFullV = (computationOptions & ComputeFullV) != 0;
m_computeThinV = (computationOptions & ComputeThinV) != 0;
eigen_assert(!(m_computeFullU && m_computeThinU) && "SVDBase: you can't ask for both full and thin U");
eigen_assert(!(m_computeFullV && m_computeThinV) && "SVDBase: you can't ask for both full and thin V");
eigen_assert(EIGEN_IMPLIES(m_computeThinU || m_computeThinV, MatrixType::ColsAtCompileTime==Dynamic) &&
"SVDBase: thin U and V are only available when your matrix has a dynamic number of columns.");
m_diagSize = (std::min)(m_rows, m_cols);
m_singularValues.resize(m_diagSize);
if(RowsAtCompileTime==Dynamic)
m_matrixU.resize(m_rows, m_computeFullU ? m_rows : m_computeThinU ? m_diagSize : 0);
if(ColsAtCompileTime==Dynamic)
m_matrixV.resize(m_cols, m_computeFullV ? m_cols : m_computeThinV ? m_diagSize : 0);
return false;
}
}// end namespace
#endif // EIGEN_SVDBASE_H
```
|
John Whitney Stillman (born January 25, 1952) is an American writer-director and actor known for his 1990 film Metropolitan, which earned him a nomination for the Academy Award for Best Original Screenplay. He is also known for his other films, Barcelona (1994), The Last Days of Disco (1998), Damsels in Distress (2011), as well as his most recent film, Love & Friendship, released in 2016.
Early life and education
Stillman was born in 1952 in Washington, D.C., to Margaret Drinker (née Riley), from Philadelphia, Pennsylvania, and a Democratic politician, John Sterling Stillman, an assistant secretary of commerce under President John F. Kennedy (a classmate of Stillman's father at Harvard), from Washington, D.C. His great-grandfather was businessman James Stillman; his great-great-grandfather, Charles Stillman, founded Brownsville, Texas. Stillman grew up in Cornwall, New York, and experienced depression during puberty. "I was very depressed when I was 11 or 12," he told The Wall Street Journal. "I was sent to the leading Freudian child psychologist in Washington, D.C. It was heck. The last thing I needed to talk about was guilt about sex." However, when his parents separated, he found that his depression ceased: "I actually felt healthier."
Stillman's godfather was E. Digby Baltzell, a University of Pennsylvania professor and chronicler of the American upper class.
He attended the Collegiate School, Potomac School, and Millbrook School, and then studied history at Harvard University, where he wrote for The Harvard Crimson.
Career before filmmaking
After graduating from Harvard in 1973, Stillman began working as an editorial assistant at Doubleday in New York City, followed by a stint as a junior editor at The American Spectator, a conservative magazine. Stillman has subsequently distanced himself from his work for the Spectator, stating that he now hates "to be drawn into ideological debates" and prefers to remain "apolitical".
He was introduced to some film producers from Madrid and persuaded them that he could sell their films to Spanish-language television in the U.S. He worked for the next few years in Madrid and Barcelona as a sales agent for directors Fernando Trueba and Fernando Colomo, and sometimes acted in their films, usually playing comic Americans, as in Trueba's film Sal Gorda.
Career
1990s
Metropolitan (1990)Stillman wrote the screenplay for Metropolitan between 1984 and 1988 while running an illustration agency in New York, and financed the film by selling the insider rights to his apartment (for $50,000) and with the contributions of friends and relatives. Loosely based on Stillman's Manhattan days, with his divorced mother during the week of Christmas break 1969 during his first year at Harvard, Metropolitan tells the story of the alienated Princetonian Tom Townsend's introduction to the "Sally Fowler Rat Pack" (SFRP), a small group of preppy, Upper East Side Manhattanites making the rounds at debutante balls during Christmas break of their first year in college. Though he is a socialist deeply skeptical of the SFRP's upper-class values, Tom (Edward Clements) grows increasingly attached to the cynical Nick (Chris Eigeman) and plays an important part, of which he is largely unaware, in the life of Audrey (Carolyn Farina), a young debutante. Many of the exclusive interior locations were lent to Stillman by family friends and relatives.
The film premiered and was screened as part of the Directors' Fortnight section at the 1990 Cannes Film Festival. Metropolitan was also nominated for the Grand Jury Prize (Drama) at the 1990 Sundance Film Festival. Stillman won Best First Feature at the 6th Independent Spirit Awards and was nominated for an Academy Award in 1991 for Best Original Screenplay. He won the 1990 New York Film Critics Circle Award for Best New Director. The movie was a financial success, grossing about $3 million on a budget of $225,000. In an interview Stillman said of the film, "The material seemed pretty rich, almost rank. And perhaps it's better approaching a subject people feel strongly about, even if that strong feeling is hatred, than something colorless and unspecific. Also, I love anachronism and this was the chance to film, essentially, a costume picture set in the present day or recent past. But a large part of the idea was to disguise our pitifully low budget by filming the most elegant subject available."Barcelona (1994)Barcelona, his first studio-financed film, was inspired by his own experiences in Spain during the early 1980s. Stillman has described the film as An Officer and a Gentleman, but with the title referring to two men rather than one. The men, Ted and Fred, experience the awkwardness of being in love in a foreign country culturally and politically opposed to their own.The Last Days of Disco (1998)'''The Last Days of Disco was based loosely on Stillman's experiences in various Manhattan nightclubs, including Studio 54. The film concerns Ivy League and Hampshire graduates falling in and out of love in the disco scene of Manhattan in the "very early 1980s". Chloë Sevigny and Kate Beckinsale play roommates with opposite personalities who frequent disco clubs together. The Last Days of Disco concludes a trilogy loosely based on Stillman's life and contains many references to the previous two films: a character considers a move to Spain to work for American ad agencies there after meeting with the Barcelona character of Ted Boynton, and Metropolitans heroine Audrey Rouget reappears briefly as a successful publisher, as do a few other characters from that film, as clubgoers. In 2000 Stillman published a novelization of the film, titled The Last Days of Disco, with Cocktails at Petrossian Afterwards. The novelization won the French 2014 Prix Fitzgerald Award.
2000s
Stillman stated in 2006 that he was working on several unfinished scripts. He had been slated to direct a film adaptation of Christopher Buckley's novel Little Green Men, but in a 2009 interview, Stillman said the adaptation is "[not] happening, at least with me." He was writing another film, Dancing Mood, set in Jamaica in the 1960s, which was not produced.
2010s'Damsels in Distress (2011)After a 13-year hiatus, Stillman released his fourth film, Damsels in Distress, starring Greta Gerwig, Adam Brody, Hugo Becker and Lio Tipton (credited as Analeigh Tipton). It premiered September 10 at the 2011 Venice Film Festival as the closing film and received favorable reviews. The film is "about three young women at an East Coast university, the transfer student that joins their group and the young men they become entangled with."The Cosmopolitans (2014)In 2014 Stillman wrote and directed the pilot episode of the TV series The Cosmopolitans for Amazon Studios on August 28, 2014 the pilot was available and Amazon Prime users could watch the pilot episode and vote to pick it up for a full series. On July 11, 2016, Tom Grater reported that Stillman was commissioned by Amazon to write six new scripts to continue his original pilot film for The Cosmopolitans.
"I explained to Amazon that I don’t like outlining or projecting what something’s going to be. I like to allow a story to arise as I’m writing scripts. I find it horrible when I try to think of something for the plot without really being on the ground and seeing where it goes. I was really resistant to do the mini-bible. So I gave them something, but I really didn’t want to do it that way. They also knew about the film, so they commissioned six scripts for the first season that they were going to let me postpone until I finished this film, which is now. So in ten days, we’ll be full on with that. It’s been really good because I think I was waiting for the idea I really want, and I think I have that now. It’s not exactly Paris, it’s a European idea. So it will be Chloe and Adam Brody. We’ll keep the pilot, that’s part of the story, but we’ll be going a different place with it."- Whit Stillman, shortly before the world premiere of Love & Friendship at Sundance
Amazon states (2016-09-25) that, regarding The Cosmopolitans 2014, "Our agreements with the content provider don’t allow purchases of this title at this time."
"The bulk of the pilot of “The Cosmopolitans” involves several of Stillman’s signature subjects. The first is a party: the male trio, plus Aubrey, head to a soirée at the posh apartment of an arrogantly wealthy Parisian acquaintance (or perhaps a German in Paris), Fritz (Freddy Åsblom). For Stillman, parties are laboratories where possibilities arise suddenly from the close and quickly ricocheting contacts of social atoms—and where social rules, hidden beneath the murky surface of daily life, emerge more clearly, in ritualized isolation. The second is something that happens at the party: a dance, but a formally patterned one where the rules are the very subject."- Richard Brody, 27 August 2014Love & Friendship (2016)A film version of one of Jane Austen's early short novels Lady Susan was reported by Entertainment Weekly on January 22, 2016. This followed the indication that Little, Brown and Company would be publishing the screenplay adapted by Stillman The film premiered in January 2016 at the Sundance Film Festival under the title of Love & Friendship. Although the plot of the film is adapted from Lady Susan, the actual title used (Love & Friendship) is from another, unrelated early epistolary novel by Austen, unpublished during her lifetime. It received universal acclaim from critics.
The promotional announcement by Little, Brown and Company summarized Stillman's adaptation stating; "Recently widowed, Lady Susan arrives, unannounced, at her brother-in-law's estate to wait out colorful rumors about her dalliances circulating through polite society. While there, she becomes determined to secure a new husband for herself, and one for her reluctant debutante daughter, Frederica, too. As Lady Susan embarks on a controversial relationship with a married man, seduction, deception, broken hearts, and gossip all ensue. With a pitch-perfect Austenian sensibility, Stillman breathes new life into Austen's work, making it his own by adding original narration from a character comically loyal to the story's fiendishly manipulative heroine, Lady Susan."
Filmmaking style
Stillman wrote and directed three comedies of manners released in the 1990s: Metropolitan (1990), Barcelona (1994), and The Last Days of Disco (1998); he published a novel based on the last of these films. After completing his film trilogy, Stillman left independent comedy and started researching and writing a series of scripts set abroad. In August 1998 (shortly after The Last Days of Disco was released) he left his loft conversion in Manhattan's SoHo and moved to Paris. He returned to New York in 2010.
A fourth film, Damsels in Distress, was released in 2011, premiering out of competition as the closing film at the 68th Venice International Film Festival. The Guardian in 2012 compared Stillman to Terrence Malick, another filmmaker who has "come to owe a good part of their mystique to the very paucity of their oeuvre...The lengthy gaps in between (films) have created expectations that are hard to fulfil, and admirers have been inclined to overestimate their achievement." A reviewer at Salon wrote that the reason for the long gaps between his films is that "Stillman is sometimes simply too damn smart for his own good. You can't always tell at whom he's poking fun, or why, and it becomes unfortunately easy to typecast him as the WASP answer to Woody Allen and conclude that his movies are insufferably irritating documents of privilege. He himself is aware of that possibility the whole time, and bastes his entire worldview in a rueful, ironic-romantic glaze."
Stillman's effectiveness at the box-office has been mixed. He filmed Metropolitan for about $250,000, according to Stillman, with a box-office return of about $3 million. Barcelona was then filmed on a budget of under $3 million, returning just under $8 million. His third film was not a box-office success; its budget of $8 million returned about $3 million. Stillman, in an AOL interview following the twenty-fifth anniversary of Metropolitan, refers to himself as having been put into "director's prison" for more than 10 years before he made Damsels. His 2016 film Love & Friendship, a comedy based on a Jane Austen story, was a box-office success, grossing more than $20 million worldwide against a production budget of $3 million.
Filmography
Film
Television
Awards and nominations
Honors and legacy 25-Year Wexner Center film retrospectiveThe Wexner Center for the Arts at the Ohio State University held a 25-year retrospective of the career and films of Stillman including his film titled Love & Friendship. At the time of the retrospective, Stillman was asked: "Your films all have a sort of costume drama sensibility, but without the costumes, and now you've made a costume drama, period dress and all." Stillman responded by stating that: "Love & Friendship doesn't loom as a costume drama, because it's a pretty funny comedy, so it's really not what you might anticipate. It's not Downton Abbey in any way, shape or form. There are a lot of very good English comic actors who have done the supporting parts and really shine. I love Jane Austen. I sort of wanted something of my own to work on between paid script writing assignments. It's good that I had so much time with no producer or studio executive wanting delivery quickly because it's an incredibly funny novella she wrote, but hard to read and hard to dramatize. It's an epistolary form from the 18th century and there are all these very funny ideas and lines buried within. It's kind of an inaccessible format and it was a long process of adaptation." Criterion Collection Release 'In April 2016, The Criterion Collection released a retrospective box set edition of Metropolitan, Barcelona, and The Last Days of Disco, available on Blu-ray and DVD. Stillman himself oversaw the digital transfers of the films and recorded audio commentaries along with members of the casts and crews.
Bibliography
Stillman wrote a novelization of The Last Days of Disco published by Farrar, Straus and Giroux under the same title, with the added subtitle "...With Cocktails at Petrossian Afterwards". It won the French 2014 Prix Fitzgerald Award. Stillman also wrote the novelization of his 2016 film Love & Friendship.
Books
Articles
Notes
References
Further reading
External links
Whit Stillman website
A conversation with Whit Stillman on The Charlie Rose Show, June 8, 1998
A conversation with Whit Stillman on The Charlie Rose Show, September 27, 2000
Whit Stillman, Carolyn Farina, and Dylan Hundley interviewed in 2015 for Metropolitan'' by BUILD Series NYC
American male film actors
Collegiate School (New York) alumni
1952 births
Living people
People from Cornwall, New York
The Harvard Crimson people
Journalists from New York City
Film directors from Washington, D.C.
Journalists from Washington, D.C.
Male actors from New York City
Male actors from Washington, D.C.
20th-century American male actors
20th-century American journalists
American male journalists
Film directors from New York City
The American Spectator people
|
```objective-c
/*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* FFmpeg is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef AVUTIL_ARM_BSWAP_H
#define AVUTIL_ARM_BSWAP_H
#include <stdint.h>
#include "config.h"
#include "libavutil/attributes.h"
#ifdef __ARMCC_VERSION
#if HAVE_ARMV6
#define av_bswap32 av_bswap32
static av_always_inline av_const uint32_t av_bswap32(uint32_t x)
{
return __rev(x);
}
#endif /* HAVE_ARMV6 */
#elif HAVE_INLINE_ASM
#if HAVE_ARMV6_INLINE
#define av_bswap16 av_bswap16
static av_always_inline av_const unsigned av_bswap16(unsigned x)
{
__asm__("rev16 %0, %0" : "+r"(x));
return x;
}
#endif
#if AV_GCC_VERSION_AT_MOST(4,4)
#define av_bswap32 av_bswap32
static av_always_inline av_const uint32_t av_bswap32(uint32_t x)
{
#if HAVE_ARMV6_INLINE
__asm__("rev %0, %0" : "+r"(x));
#else
uint32_t t;
__asm__ ("eor %1, %0, %0, ror #16 \n\t"
"bic %1, %1, #0xFF0000 \n\t"
"mov %0, %0, ror #8 \n\t"
"eor %0, %0, %1, lsr #8 \n\t"
: "+r"(x), "=&r"(t));
#endif /* HAVE_ARMV6_INLINE */
return x;
}
#endif /* AV_GCC_VERSION_AT_MOST(4,4) */
#endif /* __ARMCC_VERSION */
#endif /* AVUTIL_ARM_BSWAP_H */
```
|
Harpactira gigas, sometimes called the common baboon spider, is a species of spider belonging to the family Theraphosidae. It is found in South Africa from Western Cape Province north to Limpopo Province.
This reclusive spider, rarely encountered outside its burrow, reaches a body length of 55 mm, the female usually slightly larger than the male. The black carapace is marked with a distinctive pattern of radiating light brown lines, like the spokes of a wheel. Like all tarantulas, and almost all other spiders, this species is not considered dangerous to people.
References
Endemic fauna of South Africa
Theraphosidae
Spiders of South Africa
Spiders described in 1898
|
A by-election was in the Tasmanian Legislative Council seat of Pembroke on 10 September 2022, triggered by the resignation of Jo Siejka, who did so in order to spend more time with her family.
Background
Jo Siejka, nominated by the Australian Labor Party, was first elected to the seat of Pembroke at a 2017 by-election following the resignation Vanessa Goodwin who had been diagnosed with multiple brain tumours in March of that year, defeating her Liberal opponent by 7.4% in the two-party preferred count. Siejka, who was Leader of the Opposition in the Legislative Council and held the shadow portfolios of disability, ageing and veterans, announced that she would resign before the expiry of her electoral mandate, in order to spend more time with her family.
Candidates
Results
References
2022 elections in Australia
Tasmania state by-elections
|
```go
package filemode
import (
"encoding/binary"
"fmt"
"os"
"strconv"
)
// A FileMode represents the kind of tree entries used by git. It
// resembles regular file systems modes, although FileModes are
// considerably simpler (there are not so many), and there are some,
// like Submodule that has no file system equivalent.
type FileMode uint32
const (
// Empty is used as the FileMode of tree elements when comparing
// trees in the following situations:
//
// - the mode of tree elements before their creation. - the mode of
// tree elements after their deletion. - the mode of unmerged
// elements when checking the index.
//
// Empty has no file system equivalent. As Empty is the zero value
// of FileMode, it is also returned by New and
// NewFromOsNewFromOSFileMode along with an error, when they fail.
Empty FileMode = 0
// Dir represent a Directory.
Dir FileMode = 0040000
// Regular represent non-executable files. Please note this is not
// the same as golang regular files, which include executable files.
Regular FileMode = 0100644
// Deprecated represent non-executable files with the group writable
// bit set. This mode was supported by the first versions of git,
// but it has been deprecated nowadays. This library uses them
// internally, so you can read old packfiles, but will treat them as
// Regulars when interfacing with the outside world. This is the
// standard git behaviour.
Deprecated FileMode = 0100664
// Executable represents executable files.
Executable FileMode = 0100755
// Symlink represents symbolic links to files.
Symlink FileMode = 0120000
// Submodule represents git submodules. This mode has no file system
// equivalent.
Submodule FileMode = 0160000
)
// New takes the octal string representation of a FileMode and returns
// the FileMode and a nil error. If the string can not be parsed to a
// 32 bit unsigned octal number, it returns Empty and the parsing error.
//
// Example: "40000" means Dir, "100644" means Regular.
//
// Please note this function does not check if the returned FileMode
// is valid in git or if it is malformed. For instance, "1" will
// return the malformed FileMode(1) and a nil error.
func New(s string) (FileMode, error) {
n, err := strconv.ParseUint(s, 8, 32)
if err != nil {
return Empty, err
}
return FileMode(n), nil
}
// NewFromOSFileMode returns the FileMode used by git to represent
// the provided file system modes and a nil error on success. If the
// file system mode cannot be mapped to any valid git mode (as with
// sockets or named pipes), it will return Empty and an error.
//
// Note that some git modes cannot be generated from os.FileModes, like
// Deprecated and Submodule; while Empty will be returned, along with an
// error, only when the method fails.
func NewFromOSFileMode(m os.FileMode) (FileMode, error) {
if m.IsRegular() {
if isSetTemporary(m) {
return Empty, fmt.Errorf("no equivalent git mode for %s", m)
}
if isSetCharDevice(m) {
return Empty, fmt.Errorf("no equivalent git mode for %s", m)
}
if isSetUserExecutable(m) {
return Executable, nil
}
return Regular, nil
}
if m.IsDir() {
return Dir, nil
}
if isSetSymLink(m) {
return Symlink, nil
}
return Empty, fmt.Errorf("no equivalent git mode for %s", m)
}
func isSetCharDevice(m os.FileMode) bool {
return m&os.ModeCharDevice != 0
}
func isSetTemporary(m os.FileMode) bool {
return m&os.ModeTemporary != 0
}
func isSetUserExecutable(m os.FileMode) bool {
return m&0100 != 0
}
func isSetSymLink(m os.FileMode) bool {
return m&os.ModeSymlink != 0
}
// Bytes return a slice of 4 bytes with the mode in little endian
// encoding.
func (m FileMode) Bytes() []byte {
ret := make([]byte, 4)
binary.LittleEndian.PutUint32(ret, uint32(m))
return ret
}
// IsMalformed returns if the FileMode should not appear in a git packfile,
// this is: Empty and any other mode not mentioned as a constant in this
// package.
func (m FileMode) IsMalformed() bool {
return m != Dir &&
m != Regular &&
m != Deprecated &&
m != Executable &&
m != Symlink &&
m != Submodule
}
// String returns the FileMode as a string in the standard git format,
// this is, an octal number padded with ceros to 7 digits. Malformed
// modes are printed in that same format, for easier debugging.
//
// Example: Regular is "0100644", Empty is "0000000".
func (m FileMode) String() string {
return fmt.Sprintf("%07o", uint32(m))
}
// IsRegular returns if the FileMode represents that of a regular file,
// this is, either Regular or Deprecated. Please note that Executable
// are not regular even though in the UNIX tradition, they usually are:
// See the IsFile method.
func (m FileMode) IsRegular() bool {
return m == Regular ||
m == Deprecated
}
// IsFile returns if the FileMode represents that of a file, this is,
// Regular, Deprecated, Executable or Link.
func (m FileMode) IsFile() bool {
return m == Regular ||
m == Deprecated ||
m == Executable ||
m == Symlink
}
// ToOSFileMode returns the os.FileMode to be used when creating file
// system elements with the given git mode and a nil error on success.
//
// When the provided mode cannot be mapped to a valid file system mode
// (e.g. Submodule) it returns os.FileMode(0) and an error.
//
// The returned file mode does not take into account the umask.
func (m FileMode) ToOSFileMode() (os.FileMode, error) {
switch m {
case Dir:
return os.ModePerm | os.ModeDir, nil
case Submodule:
return os.ModePerm | os.ModeDir, nil
case Regular:
return os.FileMode(0644), nil
// Deprecated is no longer allowed: treated as a Regular instead
case Deprecated:
return os.FileMode(0644), nil
case Executable:
return os.FileMode(0755), nil
case Symlink:
return os.ModePerm | os.ModeSymlink, nil
}
return os.FileMode(0), fmt.Errorf("malformed mode (%s)", m)
}
```
|
The Southern Maryland Electric Cooperative (SMECO) is an electric distribution cooperative which is headquartered in Hughesville, Maryland, United States. SMECO serves approximately 161,000 customers in Calvert, Charles, Prince George's, and St. Mary's counties of southern Maryland. Under its rules as a nonprofit cooperative, SMECO passes on its costs to its customer-members without markup or profit.
History
In 1937 two committees of citizens from three counties which were seeking aid to construct a local rural electric distribution system under the New Deal's Rural Electrictrification Administration formed the Southern Maryland Tri-County Electric Cooperative Association. This was reorganized as a cooperative under the SMECO name in 1942. Customers were allowed to select suppliers of electricity beginning in 2001 under the Maryland Electric Deregulation legislation enacted in 1999. From 2007 to 2011, SMECO has won the J.D. Power and Associates award for best customer service for a midsize utility.
SMECO owned a 77 MW gas turbine generator located at the Chalk Point Generating Station which began operation in 1990 and was operated and maintained by NRG Energy. In 2015 NRG acquired the turbine plant from SMECO.
FERC solar complaint
SMECO has filed a complaint with the US Federal Energy Regulatory Commission (FERC), alleging that the Maryland Public Service Commission (PSC) coerced utilities into purchasing excess solar power generated by the state's community solar program at much higher retail rates rather than paying the amount it would have cost these utilities to create the power themselves, also known as the avoided cost. This would be in violation with the federal Public Utility Regulatory Policies Act (PURPA), which establishes that any payment given to such qualifying power plants equate the utility's avoided cost. In addition, PURPA mandates that these plants do not exceed 80 MW of power.
Recently, the development of community solar programs has become increasingly prevalent in order to meet the ever-growing demand for new, viable energy sources; however, there has been much controversy regarding the surge in net metering consumers due to the resulting cost shifts which negatively affect the non-solar community now facing much higher payments to even out the increased benefits given to solar projects.
Because of the continual reduction in the cost of power, FERC has become more concerned with the discrepancy between avoided costs and wholesale prices, which continue to prevail. This has placed more focus on PURPA's roles and responsibilities in the maintenance and balance of the current energy market.
References
External links
Companies based in Maryland
Electric power companies of the United States
Electric generation and transmission cooperatives in the United States
Charles County, Maryland
Energy companies established in 1937
1937 establishments in Maryland
|
```php
<div class="panel mt10">
<a class="twitter-timeline" data-height="400" href="path_to_url{{ $twitter_account }}">Tweets by {{ $twitter_account }}</a> <script async src="//platform.twitter.com/widgets.js" charset="utf-8"></script>
</div>
```
|
```vue
<template>
<el-dialog title="" :visible.sync="isVisible" :before-close="closeDialog">
<el-form label-width="130px">
<el-form-item label="Executor">
<el-col :span="22">
<b>{{executorAllocationInfo.executorName}}</b>
</el-col>
</el-form-item>
<el-form-item label="">
<el-col :span="22">
<b>{{executorAllocationInfo.totalLoadLevel}}</b>
</el-col>
</el-form-item>
<el-form-item label="">
<el-col :span="22">
<div v-if="Object.entries(executorAllocationInfo.allocationMap).length === 0"></div>
<div v-else>
<el-tag class="form-tags" v-for="item in Object.entries(executorAllocationInfo.allocationMap)" :key="item[0]">{{item[0]}} : {{item[1]}}</el-tag>
</div>
</el-col>
</el-form-item>
</el-form>
<div slot="footer" class="dialog-footer">
<el-button @click="closeDialog()"></el-button>
</div>
</el-dialog>
</template>
<script>
export default {
props: ['executorAllocationInfo'],
data() {
return {
isVisible: true,
};
},
methods: {
closeDialog() {
this.$emit('close-dialog');
},
},
};
</script>
<style lang="sass">
.allocation-popper {
max-width: 300px;
}
</style>
```
|
```batchfile
rem @echo off
set target_version=%1
if "%target_version%"=="" set target_version=3.0.0.0
call msbuild /m /p:Configuration=Release,Platform=x86,CppWinRTBuildVersion=%target_version% cppwinrt.sln /t:fast_fwd
call msbuild /m /p:Configuration=Release,Platform=x64,CppWinRTBuildVersion=%target_version% cppwinrt.sln /t:fast_fwd
call msbuild /m /p:Configuration=Release,Platform=arm,CppWinRTBuildVersion=%target_version% cppwinrt.sln /t:fast_fwd
call msbuild /m /p:Configuration=Release,Platform=arm64,CppWinRTBuildVersion=%target_version% cppwinrt.sln /t:fast_fwd
call msbuild /m /p:Configuration=Release,Platform=x86,CppWinRTBuildVersion=%target_version% cppwinrt.sln /t:cppwinrt
nuget pack nuget\Microsoft.Windows.CppWinRT.nuspec -Properties target_version=%target_version%;cppwinrt_exe=%cd%\_build\x86\Release\cppwinrt.exe;cppwinrt_fast_fwd_x86=%cd%\_build\x86\Release\cppwinrt_fast_forwarder.lib;cppwinrt_fast_fwd_x64=%cd%\_build\x64\Release\cppwinrt_fast_forwarder.lib;cppwinrt_fast_fwd_arm=%cd%\_build\arm\Release\cppwinrt_fast_forwarder.lib;cppwinrt_fast_fwd_arm64=%cd%\_build\arm64\Release\cppwinrt_fast_forwarder.lib
```
|
```objective-c
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.
#pragma once
#include "paddle/phi/backends/all_context.h"
#include "paddle/phi/common/transform.h"
#include "paddle/phi/core/dense_tensor.h"
#include "paddle/phi/kernels/empty_kernel.h"
#include "paddle/phi/kernels/funcs/common_shape.h"
#include "paddle/phi/kernels/funcs/elementwise_utils.h"
#include "paddle/phi/kernels/funcs/math_function.h"
#if defined(__NVCC__) || defined(__HIPCC__) || defined(__xpu__)
#include "paddle/phi/backends/gpu/gpu_launch_config.h"
#include "paddle/phi/kernels/funcs/aligned_vector.h"
#include "paddle/phi/kernels/funcs/function_traits.h"
#include "paddle/phi/kernels/primitive/kernel_primitives.h"
#define HOSTDEVICE __host__ __device__
namespace kps = phi::kps;
#endif
namespace phi {
/* Packing scalar type T(float, int etc.) into Array<T, NumOuts> type
for supporting multiple-output feature in elementwise system.*/
template <class T, int Num>
using ConditionalT = typename std::conditional_t<Num == 1, T, Array<T, Num>>;
namespace funcs {
using DDim = phi::DDim;
template <typename T, typename DeviceContext>
class RowwiseTransformIterator;
template <typename T, typename DeviceContext>
class MidWiseTransformIterator;
// NOTE(dzhwinter): ptrdiff_t in iterator is deprecated in c++17
template <typename T>
class RowwiseTransformIterator<T, CPUContext>
: public std::iterator<std::random_access_iterator_tag,
T,
std::ptrdiff_t,
T *,
T &> {
public:
RowwiseTransformIterator(const T *ptr, int n) : ptr_(ptr), i_(0), n_(n) {}
RowwiseTransformIterator<T, CPUContext> &operator++() {
++i_;
if (UNLIKELY(i_ == n_)) {
i_ = 0;
}
return *this;
}
RowwiseTransformIterator<T, CPUContext> &operator+(int n) {
while (n-- > 0) {
++i_;
if (UNLIKELY(i_ == n_)) {
i_ = 0;
}
}
return *this;
}
bool operator==(const RowwiseTransformIterator<T, CPUContext> &rhs) const {
return (ptr_ + i_) == &(*rhs);
}
bool operator!=(const RowwiseTransformIterator<T, CPUContext> &rhs) const {
return (ptr_ + i_) != &(*rhs);
}
const T &operator*() { return ptr_[i_]; }
private:
const T *ptr_;
int i_;
int64_t n_;
};
template <typename T>
class MidWiseTransformIterator<T, CPUContext>
: public std::iterator<std::random_access_iterator_tag,
T,
std::ptrdiff_t,
T *,
T &> {
public:
MidWiseTransformIterator(const T *ptr, int n, int post)
: ptr_(ptr), i_(0), j_(0), n_(n), post_(post) {}
MidWiseTransformIterator<T, CPUContext> &operator++() {
++j_;
if (UNLIKELY(j_ == post_)) {
++i_;
j_ = 0;
if (UNLIKELY(i_ == n_)) {
i_ = 0;
}
}
return *this;
}
MidWiseTransformIterator<T, CPUContext> &operator+(int n) {
while (n-- > 0) {
++j_;
if (UNLIKELY(j_ == post_)) {
++i_;
j_ = 0;
if (UNLIKELY(i_ == n_)) {
i_ = 0;
}
}
}
return *this;
}
bool operator==(const MidWiseTransformIterator<T, CPUContext> &rhs) const {
return (ptr_ + i_) == &(*rhs);
}
bool operator!=(const MidWiseTransformIterator<T, CPUContext> &rhs) const {
return (ptr_ + i_) != &(*rhs);
}
const T &operator*() { return ptr_[i_]; }
private:
const T *ptr_;
int64_t i_;
int64_t j_;
int64_t n_;
int64_t post_;
};
#if defined(__NVCC__) || defined(__HIPCC__)
template <typename T>
class RowwiseTransformIterator<T, GPUContext>
: public thrust::iterator_adaptor<RowwiseTransformIterator<T, GPUContext>,
const T *> {
public:
typedef thrust::iterator_adaptor<RowwiseTransformIterator<T, GPUContext>,
const T *>
super_t;
HOSTDEVICE RowwiseTransformIterator(const T *x, int n)
: super_t(x), begin_(x), n_(n) {}
friend class thrust::iterator_core_access;
private:
unsigned int n_;
const T *begin_;
HOSTDEVICE typename super_t::reference dereference() const {
return *(begin_ + (this->base() - begin_) % n_);
}
};
template <typename T>
class MidWiseTransformIterator<T, GPUContext>
: public thrust::iterator_adaptor<MidWiseTransformIterator<T, GPUContext>,
const T *> {
public:
typedef thrust::iterator_adaptor<MidWiseTransformIterator<T, GPUContext>,
const T *>
super_t;
HOSTDEVICE MidWiseTransformIterator(const T *x, int n, int post)
: super_t(x), begin_(x), n_(n), post_(post) {}
friend class thrust::iterator_core_access;
private:
unsigned int post_;
unsigned int n_;
const T *begin_;
HOSTDEVICE typename super_t::reference dereference() const {
return *(begin_ + (((this->base() - begin_) / post_) % n_));
}
};
#endif
template <typename Functor,
typename T,
typename DeviceContext,
typename OutType = T>
class TransformFunctor {
public:
TransformFunctor(const DenseTensor &x,
const DenseTensor &y,
DenseTensor *z,
const DeviceContext &ctx,
Functor func,
const bool is_xsize_larger = true)
: x_(x.data<T>()),
y_(y.data<T>()),
z_(ctx.template Alloc<OutType>(z)),
nx_(x.numel()),
ctx_(ctx),
func_(func),
is_xsize_larger_(is_xsize_larger) {
if (is_xsize_larger_ == false) {
nx_ = y.numel();
}
}
inline void Run() const {
phi::Transform<DeviceContext> trans;
trans(ctx_, x_, x_ + nx_, y_, z_, func_);
}
inline void RunRowWise(int n) const {
phi::Transform<DeviceContext> trans;
if (is_xsize_larger_) {
trans(ctx_,
x_,
x_ + nx_,
RowwiseTransformIterator<T, DeviceContext>(y_, n),
z_,
func_);
} else {
trans(ctx_,
y_,
y_ + nx_,
RowwiseTransformIterator<T, DeviceContext>(x_, n),
z_,
func_);
}
}
inline void RunMidWise(int n, int post) const {
phi::Transform<DeviceContext> trans;
if (is_xsize_larger_) {
trans(ctx_,
x_,
x_ + nx_,
MidWiseTransformIterator<T, DeviceContext>(y_, n, post),
z_,
func_);
} else {
trans(ctx_,
y_,
y_ + nx_,
MidWiseTransformIterator<T, DeviceContext>(x_, n, post),
z_,
func_);
}
}
private:
const T *x_;
const T *y_;
OutType *z_;
int64_t nx_;
const DeviceContext &ctx_;
Functor func_;
bool is_xsize_larger_;
};
template <typename Functor, typename T, typename OutType = T>
void CommonForwardBroadcastCPU(const DenseTensor &x,
const DenseTensor &y,
DenseTensor *z,
int *x_dims_array,
int *y_dims_array,
int *out_dims_array,
int max_dim,
const CPUContext &ctx,
Functor func,
const bool is_xsize_larger = true) {
std::vector<int> index_array(max_dim, 0);
const T *x_data = x.data<T>();
const T *y_data = y.data<T>();
PADDLE_ENFORCE_NOT_NULL(
x_data, errors::InvalidArgument("The input X should not be empty."));
PADDLE_ENFORCE_NOT_NULL(
y_data, errors::InvalidArgument("The input Y should not be empty."));
OutType *out_data = ctx.Alloc<OutType>(z);
const int out_size = std::accumulate(
out_dims_array, out_dims_array + max_dim, 1, std::multiplies<int>());
int x_index, y_index;
for (int out_index = 0; out_index < out_size; ++out_index) {
x_index = GetElementwiseIndex(x_dims_array, max_dim, index_array.data());
y_index = GetElementwiseIndex(y_dims_array, max_dim, index_array.data());
if (is_xsize_larger) {
out_data[out_index] = func(x_data[x_index], y_data[y_index]);
} else {
out_data[out_index] = func(y_data[y_index], x_data[x_index]);
}
UpdateElementwiseIndexArray(out_dims_array, max_dim, index_array.data());
}
}
template <typename Functor, typename T, typename OutType = T>
void CommonElementwiseBroadcastForward(const CPUContext &dev_ctx,
const DenseTensor &x,
const DenseTensor &y,
DenseTensor *z,
const DDim &x_dims,
const DDim &y_dims,
Functor func,
int axis,
const bool is_xsize_larger = true) {
int max_dim = (std::max)(x_dims.size(), y_dims.size());
axis = (axis == -1 ? std::abs(x_dims.size() - y_dims.size()) : axis);
PADDLE_ENFORCE_GE(
axis,
0,
common::errors::InvalidArgument(
"Axis should be great than or equal to 0, but received axis is %d.",
axis));
PADDLE_ENFORCE_LE(
axis,
max_dim,
common::errors::InvalidArgument(
"Axis should be less than or equal to %d, but received axis is %d.",
max_dim,
axis));
std::vector<int> x_dims_array(max_dim);
std::vector<int> y_dims_array(max_dim);
std::vector<int> out_dims_array(max_dim);
GetBroadcastDimsArrays(x_dims,
y_dims,
x_dims_array.data(),
y_dims_array.data(),
out_dims_array.data(),
max_dim,
axis);
CommonForwardBroadcastCPU<Functor, T, OutType>(x,
y,
z,
x_dims_array.data(),
y_dims_array.data(),
out_dims_array.data(),
max_dim,
dev_ctx,
func,
is_xsize_larger);
}
// It is a common CPU implementation to compute binary calculation with the
// support of broadcast. Note:
// 1. CPU implementation cannot support the case when x needs broadcast, thus
// this function need to be called with XxxFunctor and XxxInverseFunctor,
// like AddFunctor and InverseAddFunctor.
// 2. The corresponding GPU implementation supports all the broadcast cases,
// thus there is no need to define and call with XxxInverseFunctor.
// TODO(liuyiqun): optimize the CPU implementation to support all broadcast
// cases and avoid the need of XxxInverseFunctor.
template <typename Functor, typename T, typename OutType = T>
void ElementwiseCompute(const CPUContext &dev_ctx,
const DenseTensor &x,
const DenseTensor &y,
Functor func,
DenseTensor *z,
int axis = -1) {
dev_ctx.Alloc<OutType>(z);
auto x_dims = x.dims();
auto y_dims = y.dims();
bool is_xsize_larger = true;
int max_dim = x_dims.size();
if (x_dims.size() < y_dims.size()) {
is_xsize_larger = false;
max_dim = y_dims.size();
}
TransformFunctor<Functor, T, CPUContext, OutType> functor(
x, y, z, dev_ctx, func, is_xsize_larger);
if (x_dims == y_dims) {
functor.Run();
return;
}
axis = (axis == -1 ? std::abs(x_dims.size() - y_dims.size()) : axis);
PADDLE_ENFORCE_GE(
axis,
0,
errors::InvalidArgument(
"Axis should be great than or equal to 0, but received axis is %d.",
axis));
PADDLE_ENFORCE_LE(
axis,
max_dim,
errors::InvalidArgument(
"Axis should be less than or equal to %d, but received axis is %d.",
max_dim,
axis));
int pre, n, post, is_run_common_broadcast, axis_trim = 0;
if (is_xsize_larger) {
auto y_dims_trimed = TrimTrailingSingularDims(y_dims);
axis_trim = (y_dims_trimed.size() == 0) ? x_dims.size() : axis;
GetMidDims(x_dims,
y_dims_trimed,
axis_trim,
&pre,
&n,
&post,
&is_run_common_broadcast);
} else {
auto x_dims_trimed = TrimTrailingSingularDims(x_dims);
axis_trim = (x_dims_trimed.size() == 0) ? y_dims.size() : axis;
GetMidDims(y_dims,
x_dims_trimed,
axis_trim,
&pre,
&n,
&post,
&is_run_common_broadcast);
}
// special case for common implementation.
// case 1: x=[2,3,1,5], y=[2,1,4,1]
// case 2: x=[2,3,4], y=[1,1,4]
if (is_run_common_broadcast == 1) {
CommonElementwiseBroadcastForward<Functor, T, OutType>(
dev_ctx, x, y, z, x_dims, y_dims, func, axis, is_xsize_larger);
return;
}
if (post == 1) {
functor.RunRowWise(n);
return;
} else {
functor.RunMidWise(n, post);
return;
}
}
// for broadcast backwards
static inline std::vector<int> GetReduceDim(const DDim &in,
const DDim &out,
int axis) {
axis =
(axis == -1 ? std::abs(static_cast<int>(out.size() - in.size())) : axis);
std::vector<int> dims;
for (int i = 0; i < axis; ++i) {
dims.push_back(i);
}
for (int i = 0; i < in.size(); ++i) {
if (out[i + axis] != in[i]) {
dims.push_back(i + axis);
}
}
for (int i = axis + in.size(); i < out.size(); ++i) {
dims.push_back(i);
}
return dims;
}
template <typename DeviceContext, typename T>
static inline void GetDoubleGradSafeTensor(const DeviceContext &dev_ctx,
const DenseTensor &x,
const DenseTensor *ddx,
DenseTensor *ddx_safe) {
if (ddx) {
*ddx_safe = *ddx;
} else {
auto meta = phi::DenseTensorMeta(x.dtype(), x.dims(), x.layout());
*ddx_safe = phi::Empty(dev_ctx, std::move(meta));
dev_ctx.template Alloc<T>(ddx_safe);
SetConstant<DeviceContext, T> set_zero;
set_zero(dev_ctx, ddx_safe, static_cast<T>(0));
}
}
inline void ElementwiseGradPreProcess(const DenseTensor &dout,
DenseTensor *dx) {
if (dx != nullptr) {
dx->set_lod(dout.lod());
}
}
#if defined(__NVCC__) || defined(__HIPCC__) || defined(__xpu__)
// static unroller
template <template <int Index, int VecSize> typename Func,
int VecSize,
int End,
int Begin = 0>
struct Unroller {
template <typename... Args>
static HOSTDEVICE inline void step(Args &&...args) {
Func<Begin, VecSize>::Apply(std::forward<Args>(args)...);
Unroller<Func, VecSize, End, Begin + 1>::step(args...);
}
};
template <template <int Index, int VecSize> typename Func, int VecSize, int End>
struct Unroller<Func, VecSize, End, End> {
template <typename... Args>
static HOSTDEVICE inline void step(Args &&...args) {}
};
// static unroller without VecSize for broadcast
template <template <int Index> typename Func, int End, int Begin = 0>
struct UnrollerWithoutVecSize {
template <typename... Args>
static HOSTDEVICE inline void step(Args &&...args) {
Func<Begin>::Apply(std::forward<Args>(args)...);
UnrollerWithoutVecSize<Func, End, Begin + 1>::step(args...);
}
};
template <template <int Index> typename Func, int End>
struct UnrollerWithoutVecSize<Func, End, End> {
template <typename... Args>
static HOSTDEVICE inline void step(Args &&...args) {}
};
template <int Index, int VecSize>
struct Loader {
template <typename Array, typename ArgsT>
static __device__ __forceinline__ void Apply(const Array &in,
ArgsT *args,
kps::IndexType offset,
int num,
int read_lens,
bool is_boundary) {
using Type = std::tuple_element_t<Index, ArgsT>;
kps::Init<Type, ArgsT, Index, VecSize>(
args, static_cast<Type>(1.0f), read_lens);
if (is_boundary) {
kps::ReadData<Type, VecSize, 1, ArgsT, Index, true>(
args,
reinterpret_cast<const _ptr_ Type *>(in[Index]) + offset,
num,
read_lens);
} else {
kps::ReadData<Type, VecSize, 1, ArgsT, Index, false>(
args,
reinterpret_cast<const _ptr_ Type *>(in[Index]) + offset,
num,
read_lens);
}
}
};
template <int Index>
struct InputSetter {
template <typename Array, typename ArgsT>
static void Apply(const std::vector<const DenseTensor *> &ins_tensor,
const ArgsT &args,
Array *ins_data) {
using Type = std::tuple_element_t<Index, ArgsT>;
(*ins_data)[Index] = (const _ptr_ char *)(ins_tensor[Index]->data<Type>());
}
};
static int GetVectorizedSizeForTensors(
const std::vector<const DenseTensor *> &ins,
const std::vector<DenseTensor *> &outs) {
#ifdef PADDLE_WITH_XPU_KP
int vec_size = 256;
#else
int vec_size = 4;
for (size_t i = 0; i < ins.size(); ++i) {
vec_size = std::min(vec_size, phi::GetVectorizedSize(ins[i]));
}
for (size_t i = 0; i < outs.size(); ++i) {
vec_size = std::min(vec_size, phi::GetVectorizedSize(outs[i]));
}
#endif
return vec_size;
}
namespace detail {
template <class F, class Tuple, std::size_t... Index>
// GCC/Clang need the decltype() return type
HOSTDEVICE constexpr decltype(auto) ApplyImpl(F &&f,
Tuple &&t,
std::index_sequence<Index...>) {
return std::forward<F>(f)(std::get<Index>(std::forward<Tuple>(t))...);
}
} // namespace detail
template <class F, class Tuple>
HOSTDEVICE constexpr decltype(auto) Apply(F &&f, Tuple &&t) {
return detail::ApplyImpl(
std::forward<F>(f),
std::forward<Tuple>(t),
std::make_index_sequence<
std::tuple_size<std::remove_reference_t<Tuple>>::value>{});
}
template <typename OutT,
int VecSize,
typename Functor,
typename ArgsT,
int Arity>
struct SameDimsElementwisePrimitiveCaller {
__device__ inline void operator()(Functor func,
ArgsT *args,
OutT *result,
int read_lens) {
#ifdef PADDLE_WITH_XPU_KP
for (int idx = 0; idx < read_lens; ++idx) {
result[idx] = static_cast<OutT>(Apply(func, args[idx]));
}
#else
#pragma unroll
for (int idx = 0; idx < VecSize; ++idx) {
result[idx] = static_cast<OutT>(Apply(func, args[idx]));
}
#endif
}
};
template <typename OutT, int VecSize, bool IsBoundary, int NumOuts>
struct ElementwiseWriteDataCallerBc {
__device__ __forceinline__ void operator()(
Array<_ptr_ OutT *, NumOuts> outs,
ConditionalT<OutT, NumOuts> src[VecSize],
kps::IndexType block_offset,
int num,
int read_lens) {
OutT dst[NumOuts][VecSize];
#pragma unroll
for (int i = 0; i < read_lens; ++i) {
#pragma unroll
for (int j = 0; j < NumOuts; ++j) {
dst[j][i] = (src[i])[j];
}
}
#pragma unroll
for (int i = 0; i < NumOuts; ++i) {
kps::WriteData<OutT, VecSize, 1, IsBoundary>(
outs[i] + block_offset, dst[i], num, read_lens);
}
}
};
template <typename OutT, int VecSize, bool IsBoundary>
struct ElementwiseWriteDataCallerBc<OutT, VecSize, IsBoundary, 1> {
__device__ __forceinline__ void operator()(Array<_ptr_ OutT *, 1> outs,
OutT src[VecSize],
kps::IndexType block_offset,
int num,
int read_lens) {
kps::WriteData<OutT, VecSize, 1, IsBoundary>(
outs[0] + block_offset, src, num, read_lens);
}
};
template <typename OutT,
typename Functor,
int Arity,
int NumOuts,
int VecSize,
bool IsBoundary>
__device__ void VectorizedElementwiseKernelImpl(
const Array<const _ptr_ char *__restrict__, Arity> &in,
Array<_ptr_ OutT *, NumOuts> outs,
kps::IndexType offset,
int num,
int read_lens,
Functor func) {
using Traits = phi::funcs::FunctionTraits<Functor>;
using ArgsT = typename Traits::ArgsTuple;
ArgsT args[VecSize];
ConditionalT<OutT, NumOuts> result[VecSize];
Unroller<Loader, VecSize, Arity>::step(
in, args, offset, num, read_lens, IsBoundary);
SameDimsElementwisePrimitiveCaller<ConditionalT<OutT, NumOuts>,
VecSize,
Functor,
ArgsT,
Arity>()(func, args, result, read_lens);
ElementwiseWriteDataCallerBc<OutT, VecSize, IsBoundary, NumOuts>()(
outs, result, offset, num, read_lens);
}
template <typename OutT, typename Functor, int Arity, int NumOuts, int VecSize>
__global__ void VectorizedElementwiseKernel(
Array<const _ptr_ char *__restrict__, Arity> ins,
Array<_ptr_ OutT *, NumOuts> outs,
kps::IndexType numel,
kps::IndexType main_offset,
int read_lens,
Functor func) {
kps::IndexType data_offset =
static_cast<kps::IndexType>(BLOCK_ID_X) * BLOCK_NUM_X * read_lens;
kps::IndexType stride =
static_cast<kps::IndexType>(BLOCK_NUM_X) * GRID_NUM_X * read_lens;
for (; data_offset < main_offset; data_offset += stride) {
VectorizedElementwiseKernelImpl<OutT,
Functor,
Arity,
NumOuts,
VecSize,
false>(
ins, outs, data_offset, read_lens * BLOCK_NUM_X, read_lens, func);
}
kps::IndexType remain = numel - data_offset;
if (remain > 0) {
VectorizedElementwiseKernelImpl<OutT,
Functor,
Arity,
NumOuts,
VecSize,
true>(
ins, outs, data_offset, static_cast<int>(remain), read_lens, func);
}
}
template <typename OutT, typename Functor, int Arity, int NumOuts, int VecSize>
void LaunchElementwiseKernel(const KPDevice &ctx,
const std::vector<const DenseTensor *> &ins,
std::vector<DenseTensor *> *outs,
Functor func) {
// There are at least 1 output, but maybe 0 input (ins.size() == 0).
// For large tensor numel * sizeof(T) > 2^31, we must use int64_t as index
// type.
int64_t numel = (*outs)[0]->numel();
Array<const _ptr_ char *__restrict__, Arity> ins_data;
Array<_ptr_ OutT *, NumOuts> outs_data;
using Traits = phi::funcs::FunctionTraits<Functor>;
using ArgsT = typename Traits::ArgsTuple;
ArgsT arg;
UnrollerWithoutVecSize<InputSetter, Arity>::step(ins, arg, &ins_data);
for (int i = 0; i < outs->size(); ++i) {
outs_data[i] = (*outs)[i]->data<OutT>();
}
#ifdef PADDLE_WITH_XPU_KP
int block_size = 64;
int grid_size = 8;
int read_lens = kps::details::GetXpuReadLens(numel, block_size, grid_size);
auto stream = ctx.x_context()->xpu_stream;
int64_t main_offset =
(numel / (read_lens * block_size)) * read_lens * block_size;
VectorizedElementwiseKernel<OutT, Functor, Arity, NumOuts, VecSize>
<<<grid_size, block_size, 0, stream>>>(
ins_data, outs_data, numel, main_offset, read_lens, func);
#else
auto gpu_config =
phi::backends::gpu::GetGpuLaunchConfig1D(ctx, numel, VecSize);
int64_t main_offset = (numel / (VecSize * gpu_config.GetBlockSize())) *
VecSize * gpu_config.GetBlockSize();
auto stream = ctx.stream();
VectorizedElementwiseKernel<OutT, Functor, Arity, NumOuts, VecSize>
<<<gpu_config.block_per_grid, gpu_config.thread_per_block, 0, stream>>>(
ins_data, outs_data, numel, main_offset, VecSize, func);
#endif
}
template <typename OutT, typename Functor, int Arity, int NumOuts = 1>
typename std::enable_if<!NeedVectorized<OutT>::value, void>::type
ElementwiseKernelForDifferentVecSize(
const KPDevice &ctx,
const std::vector<const DenseTensor *> &ins,
std::vector<DenseTensor *> *outs,
Functor func) {
LaunchElementwiseKernel<OutT, Functor, Arity, NumOuts, VecSizeS>(
ctx, ins, outs, func);
}
template <typename OutT, typename Functor, int Arity, int NumOuts = 1>
typename std::enable_if<NeedVectorized<OutT>::value, void>::type
ElementwiseKernelForDifferentVecSize(
const KPDevice &ctx,
const std::vector<const DenseTensor *> &ins,
std::vector<DenseTensor *> *outs,
Functor func) {
// calculate the max vec_size for all ins and outs
int vec_size = GetVectorizedSizeForTensors(ins, *outs);
switch (vec_size) {
case VecSizeL:
LaunchElementwiseKernel<OutT, Functor, Arity, NumOuts, VecSizeL>(
ctx, ins, outs, func);
break;
case VecSizeM:
LaunchElementwiseKernel<OutT, Functor, Arity, NumOuts, VecSizeM>(
ctx, ins, outs, func);
break;
case VecSizeS:
LaunchElementwiseKernel<OutT, Functor, Arity, NumOuts, VecSizeS>(
ctx, ins, outs, func);
break;
default: {
PADDLE_THROW(common::errors::Unimplemented(
"Unsupported vectorized size: %d !", vec_size));
break;
}
}
}
template <typename OutT, typename Functor, int NumOuts = 1>
void ElementwiseKernel(const KPDevice &ctx,
const std::vector<const DenseTensor *> &ins,
std::vector<DenseTensor *> *outs,
Functor func) {
using Traits = phi::funcs::FunctionTraits<Functor>;
const int kArity = Traits::arity;
PADDLE_ENFORCE_EQ(ins.size(),
kArity,
common::errors::InvalidArgument(
"The number of inputs is expected to be equal to the "
"arity of functor. But received: the number of inputs "
"is %d, the arity of functor is %d.",
ins.size(),
kArity));
PADDLE_ENFORCE_EQ(outs->size(),
NumOuts,
common::errors::InvalidArgument(
"Number of outputs shall equal to number of functions, "
"but number of outputs is %d, of functions is %d.",
outs->size(),
NumOuts));
for (int i = 0; i < outs->size(); ++i) {
if (i > 0) {
PADDLE_ENFORCE_EQ(
(*outs)[i]->dims(),
(*outs)[0]->dims(),
common::errors::InvalidArgument(
"The shape of each output tensor shall be identical yet, "
"but %dth output tensor`s shape is not.",
i));
}
ctx.template Alloc<OutT>((*outs)[i]);
}
ElementwiseKernelForDifferentVecSize<OutT, Functor, kArity, NumOuts>(
ctx, ins, outs, func);
}
#endif
} // namespace funcs
} // namespace phi
```
|
```kotlin
package de.westnordost.streetcomplete.data.osm.edits.update_tags
import kotlin.test.Test
import kotlin.test.assertEquals
import kotlin.test.assertFalse
import kotlin.test.assertTrue
class StringMapEntryAddTest {
@Test fun `conflicts if already added with different value`() {
assertTrue(StringMapEntryAdd("a", "b").conflictsWith(mutableMapOf("a" to "c")))
}
@Test fun `does not conflict if already added with different value`() {
assertFalse(StringMapEntryAdd("a", "b").conflictsWith(mutableMapOf("a" to "b")))
}
@Test fun `does not conflict if not added yet`() {
assertFalse(StringMapEntryAdd("a", "b").conflictsWith(mutableMapOf()))
}
@Test fun `toString is as expected`() {
assertEquals(
"ADD \"a\"=\"b\"",
StringMapEntryAdd("a", "b").toString()
)
}
@Test fun apply() {
val m = mutableMapOf<String, String>()
StringMapEntryAdd("a", "b").applyTo(m)
assertEquals("b", m["a"])
}
@Test fun reverse() {
val m = HashMap<String, String>()
val add = StringMapEntryAdd("a", "b")
val reverseAdd = add.reversed()
add.applyTo(m)
reverseAdd.applyTo(m)
assertTrue(m.isEmpty())
}
}
```
|
```java
Java Virtual Machine
The trade-off between short and descriptive names
Ternary operator
Connecting to FTP using Java
How range operations work
```
|
```c++
# /* **************************************************************************
# * *
# * accompanying file LICENSE_1_0.txt or copy at *
# * path_to_url *
# * *
# ************************************************************************** */
#
# /* Revised by Edward Diener (2020) */
#
# /* See path_to_url for most recent version. */
#
# ifndef BOOST_PREPROCESSOR_VARIADIC_ELEM_HPP
# define BOOST_PREPROCESSOR_VARIADIC_ELEM_HPP
#
# include <boost/preprocessor/cat.hpp>
# include <boost/preprocessor/config/config.hpp>
#
# /* BOOST_PP_VARIADIC_ELEM */
#
# if BOOST_PP_VARIADICS_MSVC
# define BOOST_PP_VARIADIC_ELEM(n, ...) BOOST_PP_VARIADIC_ELEM_I(n,__VA_ARGS__)
# define BOOST_PP_VARIADIC_ELEM_I(n, ...) BOOST_PP_CAT(BOOST_PP_CAT(BOOST_PP_VARIADIC_ELEM_, n)(__VA_ARGS__,),)
# else
# define BOOST_PP_VARIADIC_ELEM(n, ...) BOOST_PP_CAT(BOOST_PP_VARIADIC_ELEM_, n)(__VA_ARGS__,)
# endif
#
# if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_STRICT()
#
# define BOOST_PP_VARIADIC_ELEM_0(e0, ...) e0
# define BOOST_PP_VARIADIC_ELEM_1(e0, e1, ...) e1
# define BOOST_PP_VARIADIC_ELEM_2(e0, e1, e2, ...) e2
# define BOOST_PP_VARIADIC_ELEM_3(e0, e1, e2, e3, ...) e3
# define BOOST_PP_VARIADIC_ELEM_4(e0, e1, e2, e3, e4, ...) e4
# define BOOST_PP_VARIADIC_ELEM_5(e0, e1, e2, e3, e4, e5, ...) e5
# define BOOST_PP_VARIADIC_ELEM_6(e0, e1, e2, e3, e4, e5, e6, ...) e6
# define BOOST_PP_VARIADIC_ELEM_7(e0, e1, e2, e3, e4, e5, e6, e7, ...) e7
# define BOOST_PP_VARIADIC_ELEM_8(e0, e1, e2, e3, e4, e5, e6, e7, e8, ...) e8
# define BOOST_PP_VARIADIC_ELEM_9(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, ...) e9
# define BOOST_PP_VARIADIC_ELEM_10(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, ...) e10
# define BOOST_PP_VARIADIC_ELEM_11(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, ...) e11
# define BOOST_PP_VARIADIC_ELEM_12(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, ...) e12
# define BOOST_PP_VARIADIC_ELEM_13(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, ...) e13
# define BOOST_PP_VARIADIC_ELEM_14(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, ...) e14
# define BOOST_PP_VARIADIC_ELEM_15(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, ...) e15
# define BOOST_PP_VARIADIC_ELEM_16(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, ...) e16
# define BOOST_PP_VARIADIC_ELEM_17(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, ...) e17
# define BOOST_PP_VARIADIC_ELEM_18(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, ...) e18
# define BOOST_PP_VARIADIC_ELEM_19(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, ...) e19
# define BOOST_PP_VARIADIC_ELEM_20(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, ...) e20
# define BOOST_PP_VARIADIC_ELEM_21(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, ...) e21
# define BOOST_PP_VARIADIC_ELEM_22(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, ...) e22
# define BOOST_PP_VARIADIC_ELEM_23(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, ...) e23
# define BOOST_PP_VARIADIC_ELEM_24(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, ...) e24
# define BOOST_PP_VARIADIC_ELEM_25(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, ...) e25
# define BOOST_PP_VARIADIC_ELEM_26(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, ...) e26
# define BOOST_PP_VARIADIC_ELEM_27(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, ...) e27
# define BOOST_PP_VARIADIC_ELEM_28(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, ...) e28
# define BOOST_PP_VARIADIC_ELEM_29(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, ...) e29
# define BOOST_PP_VARIADIC_ELEM_30(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, ...) e30
# define BOOST_PP_VARIADIC_ELEM_31(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, ...) e31
# define BOOST_PP_VARIADIC_ELEM_32(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, ...) e32
# define BOOST_PP_VARIADIC_ELEM_33(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, ...) e33
# define BOOST_PP_VARIADIC_ELEM_34(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, ...) e34
# define BOOST_PP_VARIADIC_ELEM_35(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, ...) e35
# define BOOST_PP_VARIADIC_ELEM_36(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, ...) e36
# define BOOST_PP_VARIADIC_ELEM_37(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, ...) e37
# define BOOST_PP_VARIADIC_ELEM_38(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, ...) e38
# define BOOST_PP_VARIADIC_ELEM_39(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, ...) e39
# define BOOST_PP_VARIADIC_ELEM_40(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, ...) e40
# define BOOST_PP_VARIADIC_ELEM_41(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, ...) e41
# define BOOST_PP_VARIADIC_ELEM_42(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, ...) e42
# define BOOST_PP_VARIADIC_ELEM_43(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, ...) e43
# define BOOST_PP_VARIADIC_ELEM_44(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, ...) e44
# define BOOST_PP_VARIADIC_ELEM_45(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, ...) e45
# define BOOST_PP_VARIADIC_ELEM_46(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, ...) e46
# define BOOST_PP_VARIADIC_ELEM_47(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, ...) e47
# define BOOST_PP_VARIADIC_ELEM_48(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, ...) e48
# define BOOST_PP_VARIADIC_ELEM_49(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, ...) e49
# define BOOST_PP_VARIADIC_ELEM_50(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, ...) e50
# define BOOST_PP_VARIADIC_ELEM_51(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, ...) e51
# define BOOST_PP_VARIADIC_ELEM_52(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, ...) e52
# define BOOST_PP_VARIADIC_ELEM_53(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, ...) e53
# define BOOST_PP_VARIADIC_ELEM_54(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, ...) e54
# define BOOST_PP_VARIADIC_ELEM_55(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, e55, ...) e55
# define BOOST_PP_VARIADIC_ELEM_56(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, e55, e56, ...) e56
# define BOOST_PP_VARIADIC_ELEM_57(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, e55, e56, e57, ...) e57
# define BOOST_PP_VARIADIC_ELEM_58(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, e55, e56, e57, e58, ...) e58
# define BOOST_PP_VARIADIC_ELEM_59(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, e55, e56, e57, e58, e59, ...) e59
# define BOOST_PP_VARIADIC_ELEM_60(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, e55, e56, e57, e58, e59, e60, ...) e60
# define BOOST_PP_VARIADIC_ELEM_61(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, e55, e56, e57, e58, e59, e60, e61, ...) e61
# define BOOST_PP_VARIADIC_ELEM_62(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, e55, e56, e57, e58, e59, e60, e61, e62, ...) e62
# define BOOST_PP_VARIADIC_ELEM_63(e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11, e12, e13, e14, e15, e16, e17, e18, e19, e20, e21, e22, e23, e24, e25, e26, e27, e28, e29, e30, e31, e32, e33, e34, e35, e36, e37, e38, e39, e40, e41, e42, e43, e44, e45, e46, e47, e48, e49, e50, e51, e52, e53, e54, e55, e56, e57, e58, e59, e60, e61, e62, e63, ...) e63
#
# else
#
# include <boost/preprocessor/config/limits.hpp>
#
# if BOOST_PP_LIMIT_VARIADIC == 64
# include <boost/preprocessor/variadic/limits/elem_64.hpp>
# elif BOOST_PP_LIMIT_VARIADIC == 128
# include <boost/preprocessor/variadic/limits/elem_64.hpp>
# include <boost/preprocessor/variadic/limits/elem_128.hpp>
# elif BOOST_PP_LIMIT_VARIADIC == 256
# include <boost/preprocessor/variadic/limits/elem_64.hpp>
# include <boost/preprocessor/variadic/limits/elem_128.hpp>
# include <boost/preprocessor/variadic/limits/elem_256.hpp>
# else
# error Incorrect value for the BOOST_PP_LIMIT_TUPLE limit
# endif
#
# endif
#
# endif
```
|
Blacklock is a surname of Scottish and English origin. Notable people with the surname include:
Ambrose Blacklock (1784–1866), Scottish-born farmer, physician and political figure in Upper Canada
Charlotte Blacklock (1857–1931), British suffragette, given a Hunger Strike Medal
Craig Blacklock (born 1954), nature photographer best known for his book The Lake Superior Images
Hugh Blacklock (1893–1954), professional American football offensive tackle in the National Football League
Judith Blacklock, author of five books on floral design, teacher, and regular arranger of the flowers at Kensington Palace
Nadine Blacklock (1953–1998), nature photographer best known for her detailed nature photography of the Lake Superior area
Nathan Blacklock (born 1976), Australian former rugby league, and rugby union footballer
Norman Blacklock KCVO OBE FRCS (1928–2006), surgeon in the Royal Navy, later professor of medicine at Manchester University
Ross Blacklock (born 1997), American football player
Thomas Blacklock (1721–1791), blind Scottish poet and ordained minister
Wendy Blacklock, Australia-based theatre and TV actor, who played Edie MacDonald in the 1970s TV soap opera Number 96
William James Blacklock (1816–1858), English landscape painter, painting scenery in Cumbria and the Scottish Borders
See also
Blacklock (horse), a Thoroughbred racehorse
Blacklock Elementary School, public elementary school in Langley, British Columbia part of School District 35 Langley
William Blacklock House, built in 1800, is one of the United States' most important Adamesque houses
|
```python
import sys
import os
REMOVE_THESE = ["-I/usr/include", "-I/usr/include/", "-L/usr/lib", "-L/usr/lib/"]
class Pkg:
def __init__(self, pkg_name):
self.name = pkg_name
self.priority = 0
self.vars = {}
def parse(self, pkg_config_path):
f = None
for pkg_path in pkg_config_path.split(':'):
if pkg_path[-1] != '/':
pkg_path += '/'
fname = pkg_path + self.name + '.pc'
try:
f = open(fname, "r")
break
except:
continue
if not f:
#sys.stderr.write("pkgconfig.py: unable to find %s.pc in %s\n" % (self.name, pkg_config_path))
return False
for line in f.readlines():
line = line.strip()
if not line:
continue
if line[0]=='#':
continue
pos1 = line.find('=')
pos2 = line.find(':')
if pos1 > 0 and (pos1 < pos2 or pos2 < 0):
pos = pos1
elif pos2 > 0 and (pos2 < pos1 or pos1 < 0):
pos = pos2
else:
continue
name = line[:pos].lower()
value = line[pos+1:]
self.vars[name] = value
f.close()
for name in self.vars.keys():
value = self.vars[name]
while True:
pos1 = value.find("${")
if pos1 < 0:
break
pos2 = value.find("}")
if pos2 < 0:
break
value = value.replace(value[pos1:pos2+1], self.vars[value[pos1+2:pos2]])
self.vars[name] = value
return True
def requires(self):
if not 'requires' in self.vars:
return []
deps = []
req_list = self.vars['requires']
for req_item in req_list.split(','):
req_item = req_item.strip()
for i in range(len(req_item)):
if "=<>".find(req_item[i]) >= 0:
deps.append(req_item[:i].strip())
break
return deps
def libs(self):
if not 'libs' in self.vars:
return []
return self.vars['libs'].split(' ')
def cflags(self):
if not 'cflags' in self.vars:
return []
return self.vars['cflags'].split(' ')
def calculate_pkg_priority(pkg, pkg_dict, loop_cnt):
if loop_cnt > 10:
sys.stderr.write("Circular dependency with pkg %s\n" % (pkg))
return 0
reqs = pkg.requires()
prio = 1
for req in reqs:
if not req in pkg_dict:
continue
req_pkg = pkg_dict[req]
prio += calculate_pkg_priority(req_pkg, pkg_dict, loop_cnt+1)
return prio
if __name__ == "__main__":
pkg_names = []
pkg_dict = {}
commands = []
exist_check = False
for i in range(1,len(sys.argv)):
if sys.argv[i][0] == '-':
cmd = sys.argv[i]
commands.append(cmd)
if cmd=='--exists':
exist_check = True
elif cmd=="--help":
print "This is not very helpful, is it"
sys.exit(0)
elif cmd=="--version":
print "0.1"
sys.exit(0)
else:
pkg_names.append(sys.argv[i])
# Fix search path
PKG_CONFIG_PATH = os.getenv("PKG_CONFIG_PATH", "").strip()
if not PKG_CONFIG_PATH:
PKG_CONFIG_PATH="/usr/local/lib/pkgconfig:/usr/lib/pkgconfig"
PKG_CONFIG_PATH = PKG_CONFIG_PATH.replace(";", ":")
# Parse files
for pkg_name in pkg_names:
pkg = Pkg(pkg_name)
if not pkg.parse(PKG_CONFIG_PATH):
sys.exit(1)
pkg_dict[pkg_name] = pkg
if exist_check:
sys.exit(0)
# Calculate priority based on dependency
for pkg_name in pkg_dict.keys():
pkg = pkg_dict[pkg_name]
pkg.priority = calculate_pkg_priority(pkg, pkg_dict, 1)
# Sort package based on dependency
pkg_names = sorted(pkg_names, key=lambda pkg_name: pkg_dict[pkg_name].priority, reverse=True)
# Get the options
opts = []
for cmd in commands:
if cmd=='--libs':
for pkg_name in pkg_names:
libs = pkg_dict[pkg_name].libs()
for lib in libs:
opts.append(lib)
if lib[:2]=="-l":
break
for pkg_name in pkg_names:
opts += pkg_dict[pkg_name].libs()
elif cmd=='--cflags':
for pkg_name in pkg_names:
opts += pkg_dict[pkg_name].cflags()
elif cmd[0]=='-':
sys.stderr.write("pkgconfig.py: I don't know how to handle " + sys.argv[i] + "\n")
filtered_opts = []
for opt in opts:
opt = opt.strip()
if not opt:
continue
if REMOVE_THESE.count(opt) != 0:
continue
if opt != '-framework' and opt != '--framework' and filtered_opts.count(opt) != 0:
if len(filtered_opts) and (filtered_opts[-1] == '-framework' or filtered_opts[-1] == '--framework'):
filtered_opts.pop()
continue
filtered_opts.append(opt)
print ' '.join(filtered_opts)
```
|
```c++
//////////////////////////////////////////////////////////////////////////////
//
// LICENSE_1_0.txt or copy at path_to_url
//
// See path_to_url for documentation.
//
//////////////////////////////////////////////////////////////////////////////
#ifndef BOOST_INTERPROCESS_DETAIL_SPIN_SEMAPHORE_HPP
#define BOOST_INTERPROCESS_DETAIL_SPIN_SEMAPHORE_HPP
#ifndef BOOST_CONFIG_HPP
# include <boost/config.hpp>
#endif
#
#if defined(BOOST_HAS_PRAGMA_ONCE)
# pragma once
#endif
#include <boost/interprocess/detail/config_begin.hpp>
#include <boost/interprocess/detail/workaround.hpp>
#include <boost/interprocess/detail/atomic.hpp>
#include <boost/interprocess/detail/os_thread_functions.hpp>
#include <boost/interprocess/detail/posix_time_types_wrk.hpp>
#include <boost/interprocess/sync/detail/common_algorithms.hpp>
#include <boost/interprocess/sync/detail/locks.hpp>
#include <boost/cstdint.hpp>
namespace boost {
namespace interprocess {
namespace ipcdetail {
class spin_semaphore
{
spin_semaphore(const spin_semaphore &);
spin_semaphore &operator=(const spin_semaphore &);
public:
spin_semaphore(unsigned int initialCount);
~spin_semaphore();
void post();
void wait();
bool try_wait();
bool timed_wait(const boost::posix_time::ptime &abs_time);
// int get_count() const;
private:
volatile boost::uint32_t m_count;
};
inline spin_semaphore::~spin_semaphore()
{}
inline spin_semaphore::spin_semaphore(unsigned int initialCount)
{ ipcdetail::atomic_write32(&this->m_count, boost::uint32_t(initialCount)); }
inline void spin_semaphore::post()
{
ipcdetail::atomic_inc32(&m_count);
}
inline void spin_semaphore::wait()
{
ipcdetail::lock_to_wait<spin_semaphore> lw(*this);
return ipcdetail::try_based_lock(lw);
}
inline bool spin_semaphore::try_wait()
{
return ipcdetail::atomic_add_unless32(&m_count, boost::uint32_t(-1), boost::uint32_t(0));
}
inline bool spin_semaphore::timed_wait(const boost::posix_time::ptime &abs_time)
{
ipcdetail::lock_to_wait<spin_semaphore> lw(*this);
return ipcdetail::try_based_timed_lock(lw, abs_time);
}
//inline int spin_semaphore::get_count() const
//{
//return (int)ipcdetail::atomic_read32(&m_count);
//}
} //namespace ipcdetail {
} //namespace interprocess {
} //namespace boost {
#include <boost/interprocess/detail/config_end.hpp>
#endif //BOOST_INTERPROCESS_DETAIL_SPIN_SEMAPHORE_HPP
```
|
```sqlpl
create table ACT_GE_PROPERTY (
NAME_ NVARCHAR2(64),
VALUE_ NVARCHAR2(300),
REV_ INTEGER,
primary key (NAME_)
);
create table ACT_GE_BYTEARRAY (
ID_ NVARCHAR2(64),
REV_ INTEGER,
NAME_ NVARCHAR2(255),
DEPLOYMENT_ID_ NVARCHAR2(64),
BYTES_ BLOB,
GENERATED_ NUMBER(1,0) CHECK (GENERATED_ IN (1,0)),
primary key (ID_)
);
insert into ACT_GE_PROPERTY
values ('common.schema.version', '7.1.0.1', 1);
insert into ACT_GE_PROPERTY
values ('next.dbid', '1', 1);
create table ACT_RU_ENTITYLINK (
ID_ NVARCHAR2(64),
REV_ INTEGER,
CREATE_TIME_ TIMESTAMP(6),
LINK_TYPE_ NVARCHAR2(255),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
PARENT_ELEMENT_ID_ NVARCHAR2(255),
REF_SCOPE_ID_ NVARCHAR2(255),
REF_SCOPE_TYPE_ NVARCHAR2(255),
REF_SCOPE_DEFINITION_ID_ NVARCHAR2(255),
ROOT_SCOPE_ID_ NVARCHAR2(255),
ROOT_SCOPE_TYPE_ NVARCHAR2(255),
HIERARCHY_TYPE_ NVARCHAR2(255),
primary key (ID_)
);
create index ACT_IDX_ENT_LNK_SCOPE on ACT_RU_ENTITYLINK(SCOPE_ID_, SCOPE_TYPE_, LINK_TYPE_);
create index ACT_IDX_ENT_LNK_REF_SCOPE on ACT_RU_ENTITYLINK(REF_SCOPE_ID_, REF_SCOPE_TYPE_, LINK_TYPE_);
create index ACT_IDX_ENT_LNK_ROOT_SCOPE on ACT_RU_ENTITYLINK(ROOT_SCOPE_ID_, ROOT_SCOPE_TYPE_, LINK_TYPE_);
create index ACT_IDX_ENT_LNK_SCOPE_DEF on ACT_RU_ENTITYLINK(SCOPE_DEFINITION_ID_, SCOPE_TYPE_, LINK_TYPE_);
create table ACT_HI_ENTITYLINK (
ID_ NVARCHAR2(64),
LINK_TYPE_ NVARCHAR2(255),
CREATE_TIME_ TIMESTAMP(6),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
PARENT_ELEMENT_ID_ NVARCHAR2(255),
REF_SCOPE_ID_ NVARCHAR2(255),
REF_SCOPE_TYPE_ NVARCHAR2(255),
REF_SCOPE_DEFINITION_ID_ NVARCHAR2(255),
ROOT_SCOPE_ID_ NVARCHAR2(255),
ROOT_SCOPE_TYPE_ NVARCHAR2(255),
HIERARCHY_TYPE_ NVARCHAR2(255),
primary key (ID_)
);
create index ACT_IDX_HI_ENT_LNK_SCOPE on ACT_HI_ENTITYLINK(SCOPE_ID_, SCOPE_TYPE_, LINK_TYPE_);
create index ACT_IDX_HI_ENT_LNK_REF_SCOPE on ACT_HI_ENTITYLINK(REF_SCOPE_ID_, REF_SCOPE_TYPE_, LINK_TYPE_);
create index ACT_IDX_HI_ENT_LNK_ROOT_SCOPE on ACT_HI_ENTITYLINK(ROOT_SCOPE_ID_, ROOT_SCOPE_TYPE_, LINK_TYPE_);
create index ACT_IDX_HI_ENT_LNK_SCOPE_DEF on ACT_HI_ENTITYLINK(SCOPE_DEFINITION_ID_, SCOPE_TYPE_, LINK_TYPE_);
create table ACT_RU_IDENTITYLINK (
ID_ NVARCHAR2(64),
REV_ INTEGER,
GROUP_ID_ NVARCHAR2(255),
TYPE_ NVARCHAR2(255),
USER_ID_ NVARCHAR2(255),
TASK_ID_ NVARCHAR2(64),
PROC_INST_ID_ NVARCHAR2(64),
PROC_DEF_ID_ NVARCHAR2(64),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
primary key (ID_)
);
create index ACT_IDX_IDENT_LNK_USER on ACT_RU_IDENTITYLINK(USER_ID_);
create index ACT_IDX_IDENT_LNK_GROUP on ACT_RU_IDENTITYLINK(GROUP_ID_);
create index ACT_IDX_IDENT_LNK_SCOPE on ACT_RU_IDENTITYLINK(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_IDENT_LNK_SUB_SCOPE on ACT_RU_IDENTITYLINK(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_IDENT_LNK_SCOPE_DEF on ACT_RU_IDENTITYLINK(SCOPE_DEFINITION_ID_, SCOPE_TYPE_);
create table ACT_HI_IDENTITYLINK (
ID_ NVARCHAR2(64),
GROUP_ID_ NVARCHAR2(255),
TYPE_ NVARCHAR2(255),
USER_ID_ NVARCHAR2(255),
TASK_ID_ NVARCHAR2(64),
CREATE_TIME_ TIMESTAMP(6),
PROC_INST_ID_ NVARCHAR2(64),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
primary key (ID_)
);
create index ACT_IDX_HI_IDENT_LNK_USER on ACT_HI_IDENTITYLINK(USER_ID_);
create index ACT_IDX_HI_IDENT_LNK_SCOPE on ACT_HI_IDENTITYLINK(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_HI_IDENT_LNK_SUB_SCOPE on ACT_HI_IDENTITYLINK(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_HI_IDENT_LNK_SCOPE_DEF on ACT_HI_IDENTITYLINK(SCOPE_DEFINITION_ID_, SCOPE_TYPE_);
create table ACT_RU_JOB (
ID_ NVARCHAR2(64) NOT NULL,
REV_ INTEGER,
CATEGORY_ NVARCHAR2(255),
TYPE_ NVARCHAR2(255) NOT NULL,
LOCK_EXP_TIME_ TIMESTAMP(6),
LOCK_OWNER_ NVARCHAR2(255),
EXCLUSIVE_ NUMBER(1,0) CHECK (EXCLUSIVE_ IN (1,0)),
EXECUTION_ID_ NVARCHAR2(64),
PROCESS_INSTANCE_ID_ NVARCHAR2(64),
PROC_DEF_ID_ NVARCHAR2(64),
ELEMENT_ID_ NVARCHAR2(255),
ELEMENT_NAME_ NVARCHAR2(255),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
CORRELATION_ID_ NVARCHAR2(255),
RETRIES_ INTEGER,
EXCEPTION_STACK_ID_ NVARCHAR2(64),
EXCEPTION_MSG_ NVARCHAR2(2000),
DUEDATE_ TIMESTAMP(6),
REPEAT_ NVARCHAR2(255),
HANDLER_TYPE_ NVARCHAR2(255),
HANDLER_CFG_ NVARCHAR2(2000),
CUSTOM_VALUES_ID_ NVARCHAR2(64),
CREATE_TIME_ TIMESTAMP(6),
TENANT_ID_ NVARCHAR2(255) DEFAULT '',
primary key (ID_)
);
create table ACT_RU_TIMER_JOB (
ID_ NVARCHAR2(64) NOT NULL,
REV_ INTEGER,
CATEGORY_ NVARCHAR2(255),
TYPE_ NVARCHAR2(255) NOT NULL,
LOCK_EXP_TIME_ TIMESTAMP(6),
LOCK_OWNER_ NVARCHAR2(255),
EXCLUSIVE_ NUMBER(1,0) CHECK (EXCLUSIVE_ IN (1,0)),
EXECUTION_ID_ NVARCHAR2(64),
PROCESS_INSTANCE_ID_ NVARCHAR2(64),
PROC_DEF_ID_ NVARCHAR2(64),
ELEMENT_ID_ NVARCHAR2(255),
ELEMENT_NAME_ NVARCHAR2(255),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
CORRELATION_ID_ NVARCHAR2(255),
RETRIES_ INTEGER,
EXCEPTION_STACK_ID_ NVARCHAR2(64),
EXCEPTION_MSG_ NVARCHAR2(2000),
DUEDATE_ TIMESTAMP(6),
REPEAT_ NVARCHAR2(255),
HANDLER_TYPE_ NVARCHAR2(255),
HANDLER_CFG_ NVARCHAR2(2000),
CUSTOM_VALUES_ID_ NVARCHAR2(64),
CREATE_TIME_ TIMESTAMP(6),
TENANT_ID_ NVARCHAR2(255) DEFAULT '',
primary key (ID_)
);
create table ACT_RU_SUSPENDED_JOB (
ID_ NVARCHAR2(64) NOT NULL,
REV_ INTEGER,
CATEGORY_ NVARCHAR2(255),
TYPE_ NVARCHAR2(255) NOT NULL,
EXCLUSIVE_ NUMBER(1,0) CHECK (EXCLUSIVE_ IN (1,0)),
EXECUTION_ID_ NVARCHAR2(64),
PROCESS_INSTANCE_ID_ NVARCHAR2(64),
PROC_DEF_ID_ NVARCHAR2(64),
ELEMENT_ID_ NVARCHAR2(255),
ELEMENT_NAME_ NVARCHAR2(255),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
CORRELATION_ID_ NVARCHAR2(255),
RETRIES_ INTEGER,
EXCEPTION_STACK_ID_ NVARCHAR2(64),
EXCEPTION_MSG_ NVARCHAR2(2000),
DUEDATE_ TIMESTAMP(6),
REPEAT_ NVARCHAR2(255),
HANDLER_TYPE_ NVARCHAR2(255),
HANDLER_CFG_ NVARCHAR2(2000),
CUSTOM_VALUES_ID_ NVARCHAR2(64),
CREATE_TIME_ TIMESTAMP(6),
TENANT_ID_ NVARCHAR2(255) DEFAULT '',
primary key (ID_)
);
create table ACT_RU_DEADLETTER_JOB (
ID_ NVARCHAR2(64) NOT NULL,
REV_ INTEGER,
CATEGORY_ NVARCHAR2(255),
TYPE_ NVARCHAR2(255) NOT NULL,
EXCLUSIVE_ NUMBER(1,0) CHECK (EXCLUSIVE_ IN (1,0)),
EXECUTION_ID_ NVARCHAR2(64),
PROCESS_INSTANCE_ID_ NVARCHAR2(64),
PROC_DEF_ID_ NVARCHAR2(64),
ELEMENT_ID_ NVARCHAR2(255),
ELEMENT_NAME_ NVARCHAR2(255),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
CORRELATION_ID_ NVARCHAR2(255),
EXCEPTION_STACK_ID_ NVARCHAR2(64),
EXCEPTION_MSG_ NVARCHAR2(2000),
DUEDATE_ TIMESTAMP(6),
REPEAT_ NVARCHAR2(255),
HANDLER_TYPE_ NVARCHAR2(255),
HANDLER_CFG_ NVARCHAR2(2000),
CUSTOM_VALUES_ID_ NVARCHAR2(64),
CREATE_TIME_ TIMESTAMP(6),
TENANT_ID_ NVARCHAR2(255) DEFAULT '',
primary key (ID_)
);
create table ACT_RU_HISTORY_JOB (
ID_ NVARCHAR2(64) NOT NULL,
REV_ INTEGER,
LOCK_EXP_TIME_ TIMESTAMP(6),
LOCK_OWNER_ NVARCHAR2(255),
RETRIES_ INTEGER,
EXCEPTION_STACK_ID_ NVARCHAR2(64),
EXCEPTION_MSG_ NVARCHAR2(2000),
HANDLER_TYPE_ NVARCHAR2(255),
HANDLER_CFG_ NVARCHAR2(2000),
CUSTOM_VALUES_ID_ NVARCHAR2(64),
ADV_HANDLER_CFG_ID_ NVARCHAR2(64),
CREATE_TIME_ TIMESTAMP(6),
SCOPE_TYPE_ NVARCHAR2(255),
TENANT_ID_ NVARCHAR2(255) DEFAULT '',
primary key (ID_)
);
create table ACT_RU_EXTERNAL_JOB (
ID_ NVARCHAR2(64) NOT NULL,
REV_ INTEGER,
CATEGORY_ NVARCHAR2(255),
TYPE_ NVARCHAR2(255) NOT NULL,
LOCK_EXP_TIME_ TIMESTAMP(6),
LOCK_OWNER_ NVARCHAR2(255),
EXCLUSIVE_ NUMBER(1,0) CHECK (EXCLUSIVE_ IN (1,0)),
EXECUTION_ID_ NVARCHAR2(64),
PROCESS_INSTANCE_ID_ NVARCHAR2(64),
PROC_DEF_ID_ NVARCHAR2(64),
ELEMENT_ID_ NVARCHAR2(255),
ELEMENT_NAME_ NVARCHAR2(255),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
CORRELATION_ID_ NVARCHAR2(255),
RETRIES_ INTEGER,
EXCEPTION_STACK_ID_ NVARCHAR2(64),
EXCEPTION_MSG_ NVARCHAR2(2000),
DUEDATE_ TIMESTAMP(6),
REPEAT_ NVARCHAR2(255),
HANDLER_TYPE_ NVARCHAR2(255),
HANDLER_CFG_ NVARCHAR2(2000),
CUSTOM_VALUES_ID_ NVARCHAR2(64),
CREATE_TIME_ TIMESTAMP(6),
TENANT_ID_ NVARCHAR2(255) DEFAULT '',
primary key (ID_)
);
create index ACT_IDX_JOB_EXCEPTION on ACT_RU_JOB(EXCEPTION_STACK_ID_);
create index ACT_IDX_JOB_CUSTOM_VAL_ID on ACT_RU_JOB(CUSTOM_VALUES_ID_);
create index ACT_IDX_JOB_CORRELATION_ID on ACT_RU_JOB(CORRELATION_ID_);
create index ACT_IDX_TJOB_EXCEPTION on ACT_RU_TIMER_JOB(EXCEPTION_STACK_ID_);
create index ACT_IDX_TJOB_CUSTOM_VAL_ID on ACT_RU_TIMER_JOB(CUSTOM_VALUES_ID_);
create index ACT_IDX_TJOB_CORRELATION_ID on ACT_RU_TIMER_JOB(CORRELATION_ID_);
create index ACT_IDX_SJOB_EXCEPTION on ACT_RU_SUSPENDED_JOB(EXCEPTION_STACK_ID_);
create index ACT_IDX_SJOB_CUSTOM_VAL_ID on ACT_RU_SUSPENDED_JOB(CUSTOM_VALUES_ID_);
create index ACT_IDX_SJOB_CORRELATION_ID on ACT_RU_SUSPENDED_JOB(CORRELATION_ID_);
create index ACT_IDX_DJOB_EXCEPTION on ACT_RU_DEADLETTER_JOB(EXCEPTION_STACK_ID_);
create index ACT_IDX_DJOB_CUSTOM_VAL_ID on ACT_RU_DEADLETTER_JOB(CUSTOM_VALUES_ID_);
create index ACT_IDX_DJOB_CORRELATION_ID on ACT_RU_DEADLETTER_JOB(CORRELATION_ID_);
create index ACT_IDX_EJOB_EXCEPTION on ACT_RU_EXTERNAL_JOB(EXCEPTION_STACK_ID_);
create index ACT_IDX_EJOB_CUSTOM_VAL_ID on ACT_RU_EXTERNAL_JOB(CUSTOM_VALUES_ID_);
create index ACT_IDX_EJOB_CORRELATION_ID on ACT_RU_EXTERNAL_JOB(CORRELATION_ID_);
alter table ACT_RU_JOB
add constraint ACT_FK_JOB_EXCEPTION
foreign key (EXCEPTION_STACK_ID_)
references ACT_GE_BYTEARRAY (ID_);
alter table ACT_RU_JOB
add constraint ACT_FK_JOB_CUSTOM_VAL
foreign key (CUSTOM_VALUES_ID_)
references ACT_GE_BYTEARRAY (ID_);
alter table ACT_RU_TIMER_JOB
add constraint ACT_FK_TJOB_EXCEPTION
foreign key (EXCEPTION_STACK_ID_)
references ACT_GE_BYTEARRAY (ID_);
alter table ACT_RU_TIMER_JOB
add constraint ACT_FK_TJOB_CUSTOM_VAL
foreign key (CUSTOM_VALUES_ID_)
references ACT_GE_BYTEARRAY (ID_);
alter table ACT_RU_SUSPENDED_JOB
add constraint ACT_FK_SJOB_EXCEPTION
foreign key (EXCEPTION_STACK_ID_)
references ACT_GE_BYTEARRAY (ID_);
alter table ACT_RU_SUSPENDED_JOB
add constraint ACT_FK_SJOB_CUSTOM_VAL
foreign key (CUSTOM_VALUES_ID_)
references ACT_GE_BYTEARRAY (ID_);
alter table ACT_RU_DEADLETTER_JOB
add constraint ACT_FK_DJOB_EXCEPTION
foreign key (EXCEPTION_STACK_ID_)
references ACT_GE_BYTEARRAY (ID_);
alter table ACT_RU_DEADLETTER_JOB
add constraint ACT_FK_DJOB_CUSTOM_VAL
foreign key (CUSTOM_VALUES_ID_)
references ACT_GE_BYTEARRAY (ID_);
alter table ACT_RU_EXTERNAL_JOB
add constraint ACT_FK_EJOB_EXCEPTION
foreign key (EXCEPTION_STACK_ID_)
references ACT_GE_BYTEARRAY (ID_);
alter table ACT_RU_EXTERNAL_JOB
add constraint ACT_FK_EJOB_CUSTOM_VAL
foreign key (CUSTOM_VALUES_ID_)
references ACT_GE_BYTEARRAY (ID_);
create index ACT_IDX_JOB_SCOPE on ACT_RU_JOB(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_JOB_SUB_SCOPE on ACT_RU_JOB(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_JOB_SCOPE_DEF on ACT_RU_JOB(SCOPE_DEFINITION_ID_, SCOPE_TYPE_);
create index ACT_IDX_TJOB_SCOPE on ACT_RU_TIMER_JOB(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_TJOB_SUB_SCOPE on ACT_RU_TIMER_JOB(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_TJOB_SCOPE_DEF on ACT_RU_TIMER_JOB(SCOPE_DEFINITION_ID_, SCOPE_TYPE_);
create index ACT_IDX_TJOB_DUEDATE on ACT_RU_TIMER_JOB(DUEDATE_);
create index ACT_IDX_SJOB_SCOPE on ACT_RU_SUSPENDED_JOB(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_SJOB_SUB_SCOPE on ACT_RU_SUSPENDED_JOB(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_SJOB_SCOPE_DEF on ACT_RU_SUSPENDED_JOB(SCOPE_DEFINITION_ID_, SCOPE_TYPE_);
create index ACT_IDX_DJOB_SCOPE on ACT_RU_DEADLETTER_JOB(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_DJOB_SUB_SCOPE on ACT_RU_DEADLETTER_JOB(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_DJOB_SCOPE_DEF on ACT_RU_DEADLETTER_JOB(SCOPE_DEFINITION_ID_, SCOPE_TYPE_);
create index ACT_IDX_EJOB_SCOPE on ACT_RU_EXTERNAL_JOB(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_EJOB_SUB_SCOPE on ACT_RU_EXTERNAL_JOB(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_EJOB_SCOPE_DEF on ACT_RU_EXTERNAL_JOB(SCOPE_DEFINITION_ID_, SCOPE_TYPE_);
create table FLW_RU_BATCH (
ID_ NVARCHAR2(64) not null,
REV_ INTEGER,
TYPE_ NVARCHAR2(64) not null,
SEARCH_KEY_ NVARCHAR2(255),
SEARCH_KEY2_ NVARCHAR2(255),
CREATE_TIME_ TIMESTAMP(6) not null,
COMPLETE_TIME_ TIMESTAMP(6),
STATUS_ NVARCHAR2(255),
BATCH_DOC_ID_ NVARCHAR2(64),
TENANT_ID_ NVARCHAR2(255) default '',
primary key (ID_)
);
create table FLW_RU_BATCH_PART (
ID_ NVARCHAR2(64) not null,
REV_ INTEGER,
BATCH_ID_ NVARCHAR2(64),
TYPE_ NVARCHAR2(64) not null,
SCOPE_ID_ NVARCHAR2(64),
SUB_SCOPE_ID_ NVARCHAR2(64),
SCOPE_TYPE_ NVARCHAR2(64),
SEARCH_KEY_ NVARCHAR2(255),
SEARCH_KEY2_ NVARCHAR2(255),
CREATE_TIME_ TIMESTAMP(6) not null,
COMPLETE_TIME_ TIMESTAMP(6),
STATUS_ NVARCHAR2(255),
RESULT_DOC_ID_ NVARCHAR2(64),
TENANT_ID_ NVARCHAR2(255) default '',
primary key (ID_)
);
create index FLW_IDX_BATCH_PART on FLW_RU_BATCH_PART(BATCH_ID_);
alter table FLW_RU_BATCH_PART
add constraint FLW_FK_BATCH_PART_PARENT
foreign key (BATCH_ID_)
references FLW_RU_BATCH (ID_);
create table ACT_RU_TASK (
ID_ NVARCHAR2(64),
REV_ INTEGER,
EXECUTION_ID_ NVARCHAR2(64),
PROC_INST_ID_ NVARCHAR2(64),
PROC_DEF_ID_ NVARCHAR2(64),
TASK_DEF_ID_ NVARCHAR2(64),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
PROPAGATED_STAGE_INST_ID_ NVARCHAR2(255),
STATE_ NVARCHAR2(255),
NAME_ NVARCHAR2(255),
PARENT_TASK_ID_ NVARCHAR2(64),
DESCRIPTION_ NVARCHAR2(2000),
TASK_DEF_KEY_ NVARCHAR2(255),
OWNER_ NVARCHAR2(255),
ASSIGNEE_ NVARCHAR2(255),
DELEGATION_ NVARCHAR2(64),
PRIORITY_ INTEGER,
CREATE_TIME_ TIMESTAMP(6),
IN_PROGRESS_TIME_ TIMESTAMP(6),
IN_PROGRESS_STARTED_BY_ NVARCHAR2(255),
CLAIM_TIME_ TIMESTAMP(6),
CLAIMED_BY_ NVARCHAR2(255),
SUSPENDED_TIME_ TIMESTAMP(6),
SUSPENDED_BY_ NVARCHAR2(255),
IN_PROGRESS_DUE_DATE_ TIMESTAMP(6),
DUE_DATE_ TIMESTAMP(6),
CATEGORY_ NVARCHAR2(255),
SUSPENSION_STATE_ INTEGER,
TENANT_ID_ NVARCHAR2(255) DEFAULT '',
FORM_KEY_ NVARCHAR2(255),
IS_COUNT_ENABLED_ NUMBER(1,0) CHECK (IS_COUNT_ENABLED_ IN (1,0)),
VAR_COUNT_ INTEGER,
ID_LINK_COUNT_ INTEGER,
SUB_TASK_COUNT_ INTEGER,
primary key (ID_)
);
create index ACT_IDX_TASK_CREATE on ACT_RU_TASK(CREATE_TIME_);
create index ACT_IDX_TASK_SCOPE on ACT_RU_TASK(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_TASK_SUB_SCOPE on ACT_RU_TASK(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_TASK_SCOPE_DEF on ACT_RU_TASK(SCOPE_DEFINITION_ID_, SCOPE_TYPE_);
create table ACT_HI_TASKINST (
ID_ NVARCHAR2(64) not null,
REV_ INTEGER default 1,
PROC_DEF_ID_ NVARCHAR2(64),
TASK_DEF_ID_ NVARCHAR2(64),
TASK_DEF_KEY_ NVARCHAR2(255),
PROC_INST_ID_ NVARCHAR2(64),
EXECUTION_ID_ NVARCHAR2(64),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
PROPAGATED_STAGE_INST_ID_ NVARCHAR2(255),
PARENT_TASK_ID_ NVARCHAR2(64),
STATE_ NVARCHAR2(255),
NAME_ NVARCHAR2(255),
DESCRIPTION_ NVARCHAR2(2000),
OWNER_ NVARCHAR2(255),
ASSIGNEE_ NVARCHAR2(255),
START_TIME_ TIMESTAMP(6) not null,
IN_PROGRESS_TIME_ TIMESTAMP(6),
IN_PROGRESS_STARTED_BY_ NVARCHAR2(255),
CLAIM_TIME_ TIMESTAMP(6),
CLAIMED_BY_ NVARCHAR2(255),
SUSPENDED_TIME_ TIMESTAMP(6),
SUSPENDED_BY_ NVARCHAR2(255),
END_TIME_ TIMESTAMP(6),
COMPLETED_BY_ NVARCHAR2(255),
DURATION_ NUMBER(19,0),
DELETE_REASON_ NVARCHAR2(2000),
PRIORITY_ INTEGER,
IN_PROGRESS_DUE_DATE_ TIMESTAMP(6),
DUE_DATE_ TIMESTAMP(6),
FORM_KEY_ NVARCHAR2(255),
CATEGORY_ NVARCHAR2(255),
TENANT_ID_ NVARCHAR2(255) default '',
LAST_UPDATED_TIME_ TIMESTAMP(6),
primary key (ID_)
);
create table ACT_HI_TSK_LOG (
ID_ NUMBER(19),
TYPE_ NVARCHAR2(64),
TASK_ID_ NVARCHAR2(64) not null,
TIME_STAMP_ TIMESTAMP(6) not null,
USER_ID_ NVARCHAR2(255),
DATA_ NVARCHAR2(2000),
EXECUTION_ID_ NVARCHAR2(64),
PROC_INST_ID_ NVARCHAR2(64),
PROC_DEF_ID_ NVARCHAR2(64),
SCOPE_ID_ NVARCHAR2(255),
SCOPE_DEFINITION_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
TENANT_ID_ NVARCHAR2(255) default '',
primary key (ID_)
);
create sequence act_hi_task_evt_log_seq start with 1 increment by 1;
create index ACT_IDX_HI_TASK_SCOPE on ACT_HI_TASKINST(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_HI_TASK_SUB_SCOPE on ACT_HI_TASKINST(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_HI_TASK_SCOPE_DEF on ACT_HI_TASKINST(SCOPE_DEFINITION_ID_, SCOPE_TYPE_);
create index ACT_IDX_ACT_HI_TSK_LOG_TASK on ACT_HI_TSK_LOG(TASK_ID_);
create table ACT_RU_VARIABLE (
ID_ NVARCHAR2(64) not null,
REV_ INTEGER,
TYPE_ NVARCHAR2(255) not null,
NAME_ NVARCHAR2(255) not null,
EXECUTION_ID_ NVARCHAR2(64),
PROC_INST_ID_ NVARCHAR2(64),
TASK_ID_ NVARCHAR2(64),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
BYTEARRAY_ID_ NVARCHAR2(64),
DOUBLE_ NUMBER(*,10),
LONG_ NUMBER(19,0),
TEXT_ NVARCHAR2(2000),
TEXT2_ NVARCHAR2(2000),
META_INFO_ NVARCHAR2(2000),
primary key (ID_)
);
create index ACT_IDX_RU_VAR_SCOPE_ID_TYPE on ACT_RU_VARIABLE(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_RU_VAR_SUB_ID_TYPE on ACT_RU_VARIABLE(SUB_SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_VAR_BYTEARRAY on ACT_RU_VARIABLE(BYTEARRAY_ID_);
alter table ACT_RU_VARIABLE
add constraint ACT_FK_VAR_BYTEARRAY
foreign key (BYTEARRAY_ID_)
references ACT_GE_BYTEARRAY (ID_);
create table ACT_HI_VARINST (
ID_ NVARCHAR2(64) not null,
REV_ INTEGER default 1,
PROC_INST_ID_ NVARCHAR2(64),
EXECUTION_ID_ NVARCHAR2(64),
TASK_ID_ NVARCHAR2(64),
NAME_ NVARCHAR2(255) not null,
VAR_TYPE_ NVARCHAR2(100),
SCOPE_ID_ NVARCHAR2(255),
SUB_SCOPE_ID_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(255),
BYTEARRAY_ID_ NVARCHAR2(64),
DOUBLE_ NUMBER(*,10),
LONG_ NUMBER(19,0),
TEXT_ NVARCHAR2(2000),
TEXT2_ NVARCHAR2(2000),
META_INFO_ NVARCHAR2(2000),
CREATE_TIME_ TIMESTAMP(6),
LAST_UPDATED_TIME_ TIMESTAMP(6),
primary key (ID_)
);
create index ACT_IDX_HI_PROCVAR_NAME_TYPE on ACT_HI_VARINST(NAME_, VAR_TYPE_);
create index ACT_IDX_HI_VAR_SCOPE_ID_TYPE on ACT_HI_VARINST(SCOPE_ID_, SCOPE_TYPE_);
create index ACT_IDX_HI_VAR_SUB_ID_TYPE on ACT_HI_VARINST(SUB_SCOPE_ID_, SCOPE_TYPE_);
create table ACT_RU_EVENT_SUBSCR (
ID_ NVARCHAR2(64) not null,
REV_ integer,
EVENT_TYPE_ NVARCHAR2(255) not null,
EVENT_NAME_ NVARCHAR2(255),
EXECUTION_ID_ NVARCHAR2(64),
PROC_INST_ID_ NVARCHAR2(64),
ACTIVITY_ID_ NVARCHAR2(64),
CONFIGURATION_ NVARCHAR2(255),
CREATED_ TIMESTAMP(6) not null,
PROC_DEF_ID_ NVARCHAR2(64),
SUB_SCOPE_ID_ NVARCHAR2(64),
SCOPE_ID_ NVARCHAR2(64),
SCOPE_DEFINITION_ID_ NVARCHAR2(64),
SCOPE_DEFINITION_KEY_ NVARCHAR2(255),
SCOPE_TYPE_ NVARCHAR2(64),
LOCK_TIME_ TIMESTAMP(6),
LOCK_OWNER_ NVARCHAR2(255),
TENANT_ID_ NVARCHAR2(255) DEFAULT '',
primary key (ID_)
);
create index ACT_IDX_EVENT_SUBSCR_CONFIG_ on ACT_RU_EVENT_SUBSCR(CONFIGURATION_);
create index ACT_IDX_EVENT_SUBSCR on ACT_RU_EVENT_SUBSCR(EXECUTION_ID_);
create index ACT_IDX_EVENT_SUBSCR_SCOPEREF_ on ACT_RU_EVENT_SUBSCR(SCOPE_ID_, SCOPE_TYPE_);
```
|
Élie Doté (born 9 July 1948) is a Central African politician. He was Prime Minister of the Central African Republic from June 2005 to January 2008.
Biography
Born in Bangui on 9 July 1948, Doté has a doctorate degree in rural economy from the University of Montpellier in France. He worked at the Agriculture and Animal Husbandry Ministry from 1974 to 1980 before becoming an expert at the African Development Bank (ADB) in Abidjan, Ivory Coast. At the ADB, he held various portfolios within the agro-economic field. His last post at the ADB was that of chief of agriculture and rural development from 2001 to 2005. Doté received the National Order of Burkina Faso on 8 April 2005.
His appointment as Prime Minister by President François Bozizé on 13 June 2005, following a presidential and parliamentary election, was considered surprising; Doté, who had previously been working outside the country in Tunis for the ADB, was at the time largely unknown in CAR. Pierre Gonifei-Ngaibonanou had met Doté in Tunis and mentioned he would be a good candidate for prime minister to Bozizé. In the end, he was chosen for his "technocratic qualities" and was responsible for implementing the development program developed by Bozizé. In a cabinet reshuffle in early September 2006, Doté became Minister of Finance in addition to his post as prime minister.
On 17 January 2008, after a civil service strike began early in the month, demanding that the government pay wage arrears, a majority of deputies in the National Assembly filed a censure motion against Doté's government, and the motion was to be considered on 19 January. On 18 January 2008, it was announced that Doté and his government had resigned and Bozizé had accepted the resignation. His successor, university rector Faustin-Archange Touadéra, was appointed by Bozizé on 22 January 2008.
In 2015, he gave a speech requesting help from France and the international community to end the chaos in his country. He called on President Catherine Samba-Panza and her government to step down for their failure to implement the roadmap for transition.
Notes
References
1947 births
Living people
Finance ministers of the Central African Republic
Prime Ministers of the Central African Republic
People from Bangui
University of Montpellier alumni
|
Tonny Bruins Slot (1 April 1947 – 1 November 2020) was a Dutch association football coach who was well known for his analysis of matches and opponents.
Career
Tonny Bruins Slot was coach of FC Amsterdam from 1978 to 1980 and assistant-coach of Ajax, also in Amsterdam, from 1982 to 1988. Bruins Slot was the assistant of Aad de Mos at Ajax. In 1985, Bruins Slot was briefly the head coach of AFC Ajax, after Aad de Mos stepped down in May 1985 due to conflicts with the board of administration. Bruins Slot became head coach for the final five matches of the season, winning the Eredivisie title in the 1984–85 season, with players such as Frank Rijkaard, Ronald Koeman, Gerald Vanenburg, John van 't Schip, Marco van Basten, Rob de Wit and John Bosman. From the second half of 1985 until January 1988, Bruins Slot was the assistant of Johan Cruijff at Ajax, winning the European Cup Winners' Cup in 1987.
From 1988 to 1996, Bruins Slot was the right-hand man of Johan Cruijff at FC Barcelona, achieving great success, winning the UEFA Champions League (1992) and four national titles (1991–1994).
Afterwards Ronald Koeman made use of his knowledge, working with Koeman at Ajax, Benfica, and during the 2007–08 season for PSV Eindhoven. When Koeman joined Valencia as the club's newly appointed head coach, he took Bruins Slot with him.
On 17 May 2009, back in the Netherlands, Tonny Bruins Slot took a position as an assistant manager at AZ from Alkmaar, where he was responsible for the tactical analysis of the opponents. On 5 December of the same year, he and head coach Ronald Koeman were both dismissed.
Bruins Slot was a member of the board of AFC Ajax. On 21 December 2011, Bruins Slot was appointed to the Executive Board of the club, along with five other candidates.
On 26 January 2011, it was announced that Bruins Slot would take the position as an analyst of the next opponent for Ajax Amsterdam. He made team reports of the next opponents for head coach Frank de Boer.
On 1 November 2020, Bruins Slot died at the age of 73.
Honours
Manager
Ajax
Eredivisie (1): 1984–85
Assistant manager
Ajax
UEFA Cup Winners' Cup (1): 1986–87
Eredivisie (3): 1982–83, 2001–02, 2003–04
KNVB Cup (4): 1982–83, 1985–86, 1986–87, 2001–02
Johan Cruijff Shield (1): 2002
Amsterdam Tournament (6): 1985, 1987, 2001, 2002, 2003, 2004
Barcelona
European Cup (1): 1991–92
UEFA Cup Winners' Cup (1): 1988–89
UEFA Super Cup (1): 1992
La Liga (4): 1990–91, 1991–92, 1992–93, 1993–94
Copa del Rey (1): 1989–90
Supercopa de España (3): 1991, 1992, 1994
Benfica
Supertaça Cândido de Oliveira (1): 2005
PSV
Eredivisie (1): 2006–07
References
1947 births
2020 deaths
AFC Ajax managers
AFC Ajax non-playing staff
Dutch football managers
Sportspeople from Amsterdam
|
```xml
import * as React from 'react';
import { css, createArray } from '@fluentui/react/lib/Utilities';
import { Checkbox } from '@fluentui/react/lib/Checkbox';
import { MarqueeSelection, Selection, IObjectWithKey } from '@fluentui/react/lib/MarqueeSelection';
import { getTheme, mergeStyleSets } from '@fluentui/react/lib/Styling';
import { useBoolean, useConst, useForceUpdate } from '@fluentui/react-hooks';
interface IPhoto extends IObjectWithKey {
url: string;
width: number;
height: number;
}
const PHOTOS: IPhoto[] = createArray(250, (index: number) => {
const randomWidth = 50 + Math.floor(Math.random() * 150);
return {
key: index,
url: `path_to_url{randomWidth}x100.png`,
width: randomWidth,
height: 100,
};
});
const theme = getTheme();
const styles = mergeStyleSets({
photoList: {
display: 'inline-block',
border: '1px solid ' + theme.palette.neutralTertiary,
margin: 0,
padding: 10,
overflow: 'hidden',
userSelect: 'none',
},
photoCell: {
position: 'relative',
display: 'inline-block',
margin: 2,
boxSizing: 'border-box',
background: theme.palette.neutralLighter,
lineHeight: 100,
verticalAlign: 'middle',
textAlign: 'center',
selectors: {
'&.is-selected': {
background: theme.palette.themeLighter,
border: '1px solid ' + theme.palette.themePrimary,
},
},
},
checkbox: {
margin: '10px 0',
},
});
export const MarqueeSelectionBasicExample: React.FunctionComponent = () => {
const [isMarqueeEnabled, { toggle: toggleIsMarqueeEnabled }] = useBoolean(true);
const forceUpdate = useForceUpdate();
const selection = useConst(
() =>
new Selection<IPhoto>({
items: PHOTOS,
onSelectionChanged: forceUpdate,
}),
);
return (
<MarqueeSelection selection={selection} isEnabled={isMarqueeEnabled}>
<Checkbox
className={styles.checkbox}
label="Is marquee enabled"
defaultChecked
onChange={toggleIsMarqueeEnabled}
/>
<p>Drag a rectangle around the items below to select them:</p>
<ul className={styles.photoList}>
{PHOTOS.map((photo, index) => (
<div
key={index}
className={css(styles.photoCell, selection.isIndexSelected(index) && 'is-selected')}
data-is-focusable
data-selection-index={index}
style={{ width: photo.width, height: photo.height }}
>
{index}
</div>
))}
</ul>
</MarqueeSelection>
);
};
```
|
Atlastins (ATLs) are a class of endoplasmic reticulum (ER) GTPases. Invertebrates have a single ATL, while vertebrates possess three ATL proteins (ATL1-3) that are differentially expressed. ATL1 is the predominant paralog of the central nervous system, whereas ATL2 and ATL3 are mainly expressed in tissues outside of the CNS. Loss of all ATLs in mammalian cells dramatically impacts ER structure, including a reduction in tubule three-way junctions.
Function and Regulation
ATLs maintain the ER tubular network via homotypic fusion. ATLs have a conserved domain structure consisting of a globular G domain, a three-helix bundle, two transmembrane domains, and an amphipathic helix. The ATL fusion cycle consists of two ATL monomers in opposing membranes binding GTP, which induces trans G domain dimerization and a crossing over of the three-helix bundle. Crossover and subsequent insertion of the amphipathic helix into the lipid bilayer triggers lipids to mix for fusion. Lastly, GTP is hydrolyzed driving the dimer to disassembly and resetting the fusion machinery.
While most of the human ATL protein structure is conserved between paralogs, the proteins have non-conserved N- and C-termini with the C-termini of ATL1 and ATL2 being autoinhibitory. ATL1 has been shown to interact with a range of proteins including spastin and REEP1, with spastin enhancing ATL1 fusion activity in vitro. ATL1 and ATL2 have also been observed as interacting with ER protein TMCC3, and ATL3 with nonstructural viral proteins, however it is not currently known how these interactions modulate protein function.
ATLs and Disease
Mutations in ATLs are linked to human disease. Mutations in ATL3 are associated with hereditary sensory neuropathy (HSN), and mutations in ATL1 are linked to HSN and hereditary spastic paraplegia (HSP). Research has identified a number of mutations that correspond to the disease phenotype, including the ATL3 Y192C disease mutation that is equivalent to the Y196C mutation in ATL1. Work to identify disease mutants remains ongoing, with a novel nonsense ATL3 mutation being identified in early 2023. ATL3 HSN mutations affect the protein’s fusion cycle by causing aberrant tethering. Similarly, an ATL1 HSP mutation was shown to increase tethering but not impact GTPase activity.
References
Endoplasmic reticulum
|
Count of Santa Cruz (in Portuguese Conde de Santa Cruz) was a Portuguese title of nobility created by a royal decree of King Philip II of Portugal, also known as Philip III of Spain, dated from October 3, 1593, and granted to Francisco de Mascarenhas (1530-1608), nephew of Dom Pedro de Mascarenhas, 6th Viceroy of Portuguese India.
Through a remarkable marriage policy, this family inherited several other titles and estates, such as Marquess of Gouveia in 1686, and Duke of Aveiro in 1745.
List of the counts
Francisco de Mascarenhas (1530–1608), 1st Count of Vila da Horta and 13th Viceroy of Portuguese India;
Martinho Mascarenhas (1570–?), 2nd Count of Santa Cruz;
Beatriz Mascarenhas (1610–? ), 3rd Countess of Santa Cruz. She married a distant cousin, João de Mascarenhas (1600-1668), who became 3rd Count of Santa Cruz by marriage;
Martinho Mascarenhas (1630–1676), 4th Count of Santa Cruz;
João Mascarenhas (1650–1691), 5th Count of Santa Cruz;
Martinho Mascarenhas (1681–1723), 6th Count of Santa Cruz and 3rd Marquess of Gouveia;
João Mascarenhas (1699–?), 7th Count of Santa Cruz and 4th Marquess of Gouveia, forced to renounce the title after fleeing Portugal for adultery, he chose to live maritally with his mother;
José Mascarenhas da Silva e Lencastre (1708–1759), 8th Count of Santa Cruz, 5th Marquess of Gouveia and 8th Duke of Aveiro;
Martinho Mascarenhas (1740–1804), 9th Count of Santa Cruz and 6th Marquess of Gouveia. The last Count of Santa Cruz before the title was extinct following the Távora affair.
See also
Marquess of Gouveia
Duke of Aveiro
Távora affair
Count and Marquis of Santa Cruz (Brazilian title)
During the Brazilian Empire, there was also a title of Count of Santa Cruz, later upgraded to Marquis of Santa Cruz, granted to Romualdo António de Seixas (1787-1860), and it should not be confused with this Portuguese title.
External links
Genealogical information on the Counts of Santa Cruz (Portugal)
Genealogical information on the Count od Santa Cruz (Brazil)
Santa Cruz
Brazilian noble titles
1593 establishments in Portugal
Noble titles created in 1593
Philip III of Spain
|
```javascript
import { useEffect, useState } from 'react';
import { WhatsNew } from './whats-new';
export const EditorDrawer = ( { anchorPosition = 'left' } ) => {
const [ isOpen, setIsOpen ] = useState( true );
useEffect( () => {
elementor.on( 'elementor/editor/panel/whats-new/clicked', () => setIsOpen( true ) );
}, [] );
return (
<WhatsNew
isOpen={ isOpen }
setIsOpen={ setIsOpen }
setIsRead={ () => document.body.classList.remove( 'e-has-notification' ) }
anchorPosition={ anchorPosition }
/>
);
};
EditorDrawer.propTypes = {
anchorPosition: PropTypes.oneOf( [ 'left', 'top', 'right', 'bottom' ] ),
};
```
|
```javascript
/* @flow */
/* eslint no-unused-vars: 0 */
import type {
ReporterSpinnerSet,
ReporterSelectOption,
Trees,
Package,
ReporterSpinner,
QuestionOptions,
PromptOptions,
} from './types.js';
import type {LanguageKeys} from './lang/en.js';
import type {Formatter} from './format.js';
import BaseReporter from './base-reporter.js';
export default class NoopReporter extends BaseReporter {
lang(key: LanguageKeys, ...args: Array<mixed>): string {
return 'do nothing';
}
verbose(msg: string) {}
verboseInspect(val: any) {}
initPeakMemoryCounter() {}
checkPeakMemory() {}
close() {}
getTotalTime(): number {
return 0;
}
list(key: string, items: Array<string>, hints?: Object) {}
tree(key: string, obj: Trees) {}
step(current: number, total: number, message: string, emoji?: string) {}
error(message: string) {}
info(message: string) {}
warn(message: string) {}
success(message: string) {}
log(message: string) {}
command(command: string) {}
inspect(value: any) {}
header(command: string, pkg: Package) {}
footer(showPeakMemory: boolean) {}
table(head: Array<string>, body: Array<Array<string>>) {}
activity(): ReporterSpinner {
return {
tick(name: string) {},
end() {},
};
}
activitySet(total: number, workers: number): ReporterSpinnerSet {
return {
spinners: Array(workers).fill({
clear() {},
setPrefix() {},
tick() {},
end() {},
}),
end() {},
};
}
question(question: string, options?: QuestionOptions = {}): Promise<string> {
return Promise.reject(new Error('Not implemented'));
}
async questionAffirm(question: string): Promise<boolean> {
await this.question(question);
return false;
}
select(header: string, question: string, options: Array<ReporterSelectOption>): Promise<string> {
return Promise.reject(new Error('Not implemented'));
}
progress(total: number): () => void {
return function() {};
}
disableProgress() {
this.noProgress = true;
}
prompt<T>(message: string, choices: Array<*>, options?: PromptOptions = {}): Promise<Array<T>> {
return Promise.reject(new Error('Not implemented'));
}
}
```
|
```php
<?php
return [
'footer_copyright' => ' <i class="voyager-heart"></i> ',
'footer_copyright2' => ' ',
];
```
|
Fluxinella is a genus of sea snails, marine gastropod mollusks in the tribe Fluxinellini ( of the subfamily Seguenziinae in the family Seguenziidae.
Species
Species within the genus Fluxinella include:
Fluxinella asceta Marshall, B.A., 1991
Fluxinella brychia Marshall, B.A., 1991
Fluxinella discula (Dall, 1889)
Fluxinella euphanes Marshall, B.A., 1991
Fluxinella gellida (Barnard, 1963)
Fluxinella lenticulosa Marshall, B.A., 1983
Fluxinella lepida Marshall, B.A., 1983
Fluxinella marginata (Schepman, 1909)
† Fluxinella maxwelli B. A. Marshall, 1983
Fluxinella megalomphala Marshall, B.A., 1991
Fluxinella membranacea Marshall, B.A., 1991
Fluxinella polita Marshall, B.A., 1991
Fluxinella runcinata Marshall, B.A., 1991
Fluxinella solarium (Barnard, 1963)
Fluxinella stellaris Bozzetti, 2008
Fluxinella stenomphala (Melvill, 1910)
Fluxinella stirophora Marshall, B.A., 1991
Fluxinella tenera Marshall, B.A., 1991
Fluxinella trochiformis (Schepman, 1909)
Fluxinella vitrea (Okutani, 1968)
Fluxinella vitrina Poppe, Tagaro & Stahlschmidt, 2015
Fluxinella xysila Marshall, B.A., 1991
References
Marshall, B. A. (1983). Recent and Tertiary Seguenziidae (Mollusca: Gastropoda) from the New Zealand region. New Zealand Journal of Zoology 10: 235-262.
External links
Seguenziidae
Gastropod genera
|
The degree-Rips bifiltration is a simplicial filtration used in topological data analysis for analyzing the shape of point cloud data. It is a multiparameter extension of the Vietoris–Rips filtration that possesses greater stability to data outliers than single-parameter filtrations, and which is more amenable to practical computation than other multiparameter constructions. Introduced in 2015 by Lesnick and Wright, the degree-Rips bifiltration is a parameter-free and density-sensitive vehicle for performing persistent homology computations on point cloud data.
Definition
It is standard practice in topological data analysis (TDA) to associate a sequence of nested simplicial complexes to a finite data set in order to detect the persistence of topological features over a range of scale parameters. One way to do this is by considering the sequence of Vietoris–Rips complexes of a finite set in a metric space indexed over all scale parameters.
If is a finite set in a metric space, then this construction is known as the Vietoris–Rips (or simply "Rips") filtration on , commonly denoted or . The Rips filtration can be expressed as a functor from the real numbers (viewed as a poset category) to the category of simplicial complexes and simplicial maps, a subcategory of the category of topological spaces and continuous maps via the geometric realization functor.
The Rips filtration is indexed over a single parameter, but we can capture more information (e.g., density) about the underlying data set by considering multiparameter filtrations. A filtration indexed by the product of two totally-ordered sets is known as a bifiltration, first introduced by Gunnar Carlsson and Afra Zomorodian in 2009.
The degree-Rips bifiltration filters each simplicial complex in the Rips filtration by the degree of each vertex in the graph isomorphic to the 1-skeleton at each index. More formally, let be an element of and define to be the subgraph of the 1-skeleton of containing all vertices whose degree is at least . Subsequently building the maximal simplicial complex possible on this 1-skeleton, we obtain a complex . By doing this for all possible vertex degrees, and across all scale parameters in the Rips filtration, we extend the Rips construction to a bifiltration .
Note that since the size of each complex will decrease as increases, we should identify the indexing set with , where is the opposite poset category of . Therefore the degree-Rips bifiltration can be viewed as a functor .
The idea behind the degree-Rips bifiltration is that vertices of higher degree will correspond to higher density regions of the underlying data set. However, since degree-Rips does not depend on an arbitrary choice of a parameter (such as a pre-selected density parameter, which is a priori difficult to determine), it is a convenient tool for analyzing data.
Applications to Data Analysis
The degree-Rips bifiltration possesses several properties that make it a useful tool in data analysis. For example, each of its skeleta has polynomial size; the k-dimensional skeleton of has simplices, where denotes an asymptotic upper bound. Moreover, it has been shown that the degree-Rips bifiltration possesses reasonably strong stability properties with respect to perturbations of the underlying data set. Further work has also been done examining the stable components and homotopy types of degree-Rips complexes.
The software RIVET was created in order to visualize several multiparameter invariants (i.e., data structures that attempt to capture underlying geometric information of the data) of 2-parameter persistence modules, including the persistent homology modules of the degree-Rips bifiltration. These invariants include the Hilbert function, rank invariant, and fibered barcode.
As a follow-up to the introduction of degree-Rips in their original 2015 paper, Lesnick and Wright showed in 2022 that a primary component of persistent homology computations (namely, computing minimal presentations and bigraded Betti numbers) can be achieved efficiently in a way that outperforms other persistent homology software. Methods of improving algorithmic efficiency of multiparameter persistent homology have also been explored that suggest the possibility of substantial speed increases for data analysis tools such as RIVET.
The degree-Rips bifiltration has been used for data analysis on random point clouds, as well as for analyzing data clusters with respect to variations in density. There has been some preliminary experimental analysis of the performance of degree-Rips with respect to outliers in particular, but this is an ongoing area of research as of February 2023.
References
Applied mathematics
Computational topology
Data analysis
|
```yaml
allowempty: True
mapping:
version:
type: "str"
required: False
allowempty: False
stories:
type: "seq"
matching: "any"
sequence:
- type: "map"
mapping:
story:
type: "str"
allowempty: False
metadata:
type: "any"
required: False
steps:
type: "seq"
matching: "any"
sequence:
- type: "map"
mapping: &intent_and_entities
intent:
type: "str"
allowempty: False
user:
type: "str"
allowempty: False
entities:
type: "seq"
matching: "any"
sequence:
- type: "map"
mapping:
regex;(.*):
type: "any"
role:
type: "str"
group:
type: "str"
- type: "str"
- type: "map"
mapping: &active_loop
active_loop:
type: "str"
allowempty: False
- type: "map"
mapping: &action
action:
type: "str"
allowempty: False
- type: "map"
mapping:
bot:
type: "str"
allowempty: False
- type: "map"
mapping: &slot_was_set_seq
slot_was_set: &slot_was_set_seq_value
type: "seq"
matching: "any"
sequence:
- type: "map"
mapping:
regex;(.*):
type: "text"
- type: "map"
mapping:
regex;(.*):
type: "bool"
- type: "map"
mapping:
regex;(.*):
type: "seq"
matching: "any"
sequence:
- type: "map"
mapping:
regex;(.*):
type: "text"
- type: "map"
mapping:
regex;(.*):
type: "bool"
- type: "text"
- type: "str"
- type: "map"
allowempty: True
- type: "map"
matching-rule: 'any'
mapping:
checkpoint:
type: "str"
allowempty: False
slot_was_set: *slot_was_set_seq_value
- type: "map"
mapping: &or_statement
or:
type: "seq"
matching: "any"
sequence:
- type: "map"
mapping: *intent_and_entities
- type: "map"
mapping: *slot_was_set_seq
rules:
type: "seq"
matching: "any"
sequence:
- type: "map"
mapping:
rule:
type: "str"
allowempty: False
metadata:
type: "any"
required: False
steps:
type: "seq"
matching: "any"
sequence:
- type: "map"
mapping: *intent_and_entities
- type: "map"
mapping: *action
- type: "map"
mapping: *active_loop
- type: "map"
mapping: *slot_was_set_seq
- type: "map"
mapping: *or_statement
condition:
type: "seq"
matching: "any"
sequence:
- type: "map"
mapping: *active_loop
- type: "map"
mapping: *slot_was_set_seq
conversation_start:
type: "bool"
allowempty: False
wait_for_user_input:
type: "bool"
allowempty: False
regex;(.*):
type: "any"
```
|
The pharyngeal branches of the glossopharyngeal nerve are three or four filaments which unite, opposite the Constrictor pharyngis medius, with the pharyngeal branches of the vagus and sympathetic, to form the pharyngeal plexus.
Branches from this plexus perforate the muscular coat of the pharynx and supply its muscles and mucous membrane.
References
External links
()
Glossopharyngeal nerve
|
María Isabel Carlota Jaramillo, stage name Carlota Jaramillo (9 July 1904 – 10 December 1987) was an Ecuadorian pasillo singer, known as "La Reina de la Canción Nacional" (Queen of National Song).
Early life
Jaramillo was born in Calacalí, in 1904. Her parents, Isaac Jaramillo Jaramillo and Natalia Jaramillo, were farmers. She grew in a musical family, one of her uncles and her maternal grandfather were musicians. Carlota studied in her hometown primary school and attended the “Manuela Cañizares” normal school in Quito to graduate as a teacher.
Career
In 1922 Jaramillo and her sister won a song contest at the Teatro Sucre in Quito. They were the only women in the competition. After that Jaramillo pursued a musical career. She recorded her first record in 1938, the pasillo Amor Grande y Lejano. In 1942 she recorded with Luis Alberto Valencia, Sendas Distintas, composed by her husband, Jorge Araujo Chiriboga. Other hit songs by her include La ingratitud, Sombras, Honda pena, and Para mi tus recuerdos.
Death and homages
Jaramillo died on 10 December 1987 of cerebral traumatisms after a fall in her home. She received a funeral with full honors from the Ecuadorian society. A monument in her honor was built in Calacalí in 1972. Her house was transformed into a museum in 2004.
References
1904 births
1987 deaths
20th-century Ecuadorian women singers
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
/**
* Group element entries according to an indicator function.
*
* @module @stdlib/array/base/group-entries-by
*
* @example
* var groupEntriesBy = require( '@stdlib/array/base/group-entries-by' );
*
* function indicator( v ) {
* return v[ 0 ];
* }
*
* var x = [ 'beep', 'boop', 'foo', 'bar' ];
*
* var out = groupEntriesBy( x, indicator );
* // returns { 'b': [ [ 0, 'beep' ], [ 1, 'boop' ], [ 3, 'bar' ] ], 'f': [ [ 2, 'foo' ] ] }
*/
// MODULES //
var main = require( './main.js' );
// EXPORTS //
module.exports = main;
```
|
is a Japanese shōjo manga by Haruka Fukushima. The manga was published in English by Tokyopop; the Tokyopop version of the manga is out of print as of August 31, 2009.
In 2009, a spinoff was serialized in Nakayoshi called , with different characters; it has just one volume.
Story
Natsumi Kawashima is a young fifth-grader who longs to grow up and become a woman. While crushing on an older hair stylist, Natsumi is embarrassed because of her age. Natsumi runs away and steals some nuts from a lady handing them out to women only in the mall. When Natsumi is eating the nuts, she notices that some of them are pink. The next morning, Natsumi wakes up with the body of a beautiful young woman. She does not notice her body transformation until her older crush, Toji Yashiki, asks her about being a hair model. They go on a fabulous date after Yashiki gives her a makeover. The next day, Natsumi is "kidnapped" by some college students and finds out that one of them created the nuts she ate earlier. Dr. Yunosuke Morinomiya, the creator of the nuts, forbids Natsumi from eating them due to unknown side-effects. Natsumi disobeys the orders to say goodbye to Yashiki. When Natsumi plans to tell him good bye, he takes her on a cruise for the salon he works at. But while on the cruise, the nuts' effect wears off but instead, Natsumi turns into a baby! Dr. Morinomiya and Natsumi's neighbor, Asuma Yoneyama, return her back to normal. Natsumi says goodbye to Yashiki for good without telling him about the nuts or her real age. Natsumi learns her lesson and as she and Asuma play videogames, she finds out that Asuma sent pictures of her as a young woman to a modeling contest so he could get a game. Natsumi gets a package in the mail and inside it is the nuts. Dr. Morinomiya sent them to her because he finished his project and the nuts no longer had side effects. Natsumi uses the nuts for the photo shoot in the Southern Islands that she had won from the contest.
Later on in the series Natsumi finds out that Asuma actually likes her.
Many letters were sent to the author by viewers who wanted Asuma to turn into a man.
Characters
Natsumi is a young 10-year-old girl who just wants to grow up. When she eats Dr. Morinomiya's miracle nuts, she turns into a curvy young woman. Because of her "grown-up" side, she finds herself in several sticky situations, such as almost marrying a billionaire, becoming a model, and starting a rivalry with Dr. Morinomiya's childhood friend. Despite this, her friend Asuma sticks with her. In a special in volume 2, a side-effect of the Miracle Nuts causes her and Asuma to switch bodies. In the final volume, she marries Asuma, but as children, due to Dr. Morinomiya accidentally giving them Miracle Nuts, making them ten years younger, instead of the "Relaxation Nuts".
He is called "an annoying hairstylist" by Asuma. Yashiki is a hairstylist for young women. He is the first suitor for grown-up Natsumi. He tried to kiss Natsumi during a cruise. Natsumi dumped him after the cruise because she realized that looks aren't everything.
The creator of the Miracle Nuts. He is often mistaken for a woman. Even though he and Nanao are rival scientists who live on different sides of the world, they get married in the beginning of volume 4, because they realized just how much they missed each other.
He has loved Natsumi ever since he was little. He gets jealous easily, especially if Natsumi is with another man. In a special in volume 2, a side-effect of the Miracle Nuts causes Asuma to switch bodies with Natsumi. In the final volume, he marries Natsumi. They get married as children because Dr. Morinomiya accidentally replaced the Relaxation Nuts with the experimental version of the Miracle Nuts, which make a person ten years younger.
A rich, genius pretty boy who becomes Natsumi's second suitor. He almost married Natsumi, but Natsumi escaped from the chapel because she realized that money can't buy everything in life.
Dr. Nanao is Dr. Yunosuke Morinomiya's childhood friend. She is often mistaken for a man. Even though she and Yunosuku are rival scientists who live on different sides of the world, they get married in the beginning of volume 4 because they realized just how much they missed each other.
Karin Amatsu
Karin is in love with Asuma. In a special in volume 2, she tries to get Asuma to like her by pretending to not know how to ski. She then falls on him on purpose and kisses him (however at this time, Natsumi and Asuma had switched bodies due to the side-effects of the Miracle Nuts, so it was really Natsumi she wound up kissing).
Seki
He has a crush on Natsumi. In a special in volume 2, he was placed next to Karin after he fainted. When they woke up, Karin said, "It was destiny that we found each other all alone in that cottage."
Mr. Tarumizu
He is Natsumi and Asuma's teacher. He has a bad habit of crying.
Volumes
Japanese
published in March 2001
published in August 2001
published in January 2002
published in July 2002
References
External links
Manga Review
Shōjo manga
Romance anime and manga
Tokyopop titles
2001 manga
|
A mower is a machine designed to cut grass or crops or other plants growing close to the ground.
Mower or The Mower may also refer to:
Equipment
Flail mower
Lawn mower, a small mower
Roller mower
Rotary mower, a mower with a horizontally spinning blade
Art and entertainment
Mower (band), an American hardcore/punk jazz band or their self-titled 2003 debut album
"The Mower", a 1979 poem by Philip Larkin
"The Mower" (folk song), folk song listed as item 833 in the Roud Folk Song Index
"The Mower's Song", a 1681 poem by Andrew Marvell
"The Mower", a 1970 poem by William Heyen
People
Andrew Mower (born 1975), Scottish-Australian rugby union player
Barry Mower, American businessperson
Caryn Mower (born 1965), American professional wrestler actress, and stuntwoman
Charles Mower (1875–1942), American yacht designer and author
Eric Mower (born 1944), American marketing executive
Jack Mower (1890–1965), American film actor
John Edward Mower (1815–1879), member of Minnesota territorial legislature
Joseph A. Mower (1827–1870), Union general during the American Civil War
Liam Mower (born 1992), English actor and dancer
Morton Mower (born 1933), American cardiologist and the co-inventor of the automatic implantable cardioverter defibrillator
Patrick Mower (born 1938), English actor
Places
Mower, New Jersey, U.S.
Mower County, Minnesota, U.S.
Other
Mower (company), American marketing agency, originally named the Eric Mower and Associates
23833 Mowers, a main belt asteroid
Mower General Hospital, a U.S. Army Federal military hospital during the American Civil War
USAT Sgt. Charles E. Mower, originally named the USS Tryon (APH-1)
See also
Moa, nine species of extinct flightless birds
Mowers (surname)
Occupational surnames
|
```php
<?php
/*
* This file is part of Piplin.
*
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace Piplin\Console\Commands;
use Carbon\Carbon;
use Illuminate\Console\Command;
use Illuminate\Foundation\Bus\DispatchesJobs;
use Piplin\Bus\Jobs\Repository\UpdateGitMirrorJob;
use Piplin\Models\Project;
/**
* Updates the mirrors for all git repositories.
*/
class UpdateGitMirrors extends Command
{
use DispatchesJobs;
const UPDATES_TO_QUEUE = 3;
const UPDATE_FREQUENCY_MINUTES = 5;
/**
* The name and signature of the console command.
*
* @var string
*/
protected $signature = 'piplin:update-mirrors';
/**
* The console command description.
*
* @var string
*/
protected $description = 'Pulls in updates for git mirrors';
/**
* Create a new command instance.
*
* @return void
*/
public function __construct()
{
parent::__construct();
}
/**
* Execute the console command.
*
* @return mixed
*/
public function handle()
{
$last_mirrored_since = Carbon::now()->subMinutes(self::UPDATE_FREQUENCY_MINUTES);
$todo = self::UPDATES_TO_QUEUE;
Project::where('last_mirrored', '<', $last_mirrored_since)->chunk($todo, function ($projects) {
foreach ($projects as $project) {
$this->dispatch(new UpdateGitMirrorJob($project));
}
});
}
}
```
|
Bursa is an electoral district of the Grand National Assembly of Turkey. It elects eighteen members of parliament (deputies) to represent the province of the same name for a four-year term by the D'Hondt method, a party-list proportional representation system.
Members
Population reviews of each electoral district are conducted before each general election, which can lead to certain districts being granted a smaller or greater number of parliamentary seats.
General elections
2011
June 2015
November 2015
2018
Presidential elections
2014
References
Electoral districts of Turkey
Politics of Bursa Province
|
Rhythmix is a United Kingdom music charity that provides a range of music-making opportunities for young people across the South East region. Since 1999, Rhythmix has worked with more than 40,000 young people.
Activities
Rhythmix works with partner organisations to provide music-making opportunities to children and young people in challenging circumstances, and to people with dementia.
Rhythmix has five main fields of work:
Alternative Education - Music-making for children and young people outside of mainstream schools
Make Waves - Music-making sessions for 11-19 year olds across Hastings and Rother
SEN/D: Innovate - Musical opportunities for children and young people with special educational needs and disabilities
Music in Mind - Group music-making for children and young people with acute mental health problems
Wishing Well - Music-making in healthcare settings for unwell children and people with dementia
2011 The X Factor dispute
In 2011, Rhythmix came to widespread media attention when the television presenter and music promoter Simon Cowell attempted to trademark the name Rhythmix in relation to a girl group that featured on the eighth series of The X Factor. After a legal challenge, Cowell's company, Syco, dropped the trademarking application and the group agreed to change their name to Little Mix.
In response to the X Factor naming controversy, an online protest was launched that promoted the Nirvana single "Smells Like Teen Spirit" to become 2011 Christmas number one in the UK Singles Chart. This was an attempt to emulate a successful 2009 Facebook campaign that promoted Rage Against the Machine's song "Killing in the Name" and prevented the X Factor winner from taking the spot. The attempt failed: Little Mix got their number one the week before Christmas, and singing group Military Wives took the Christmas number one.
References
External links
Educational charities based in the United Kingdom
Organisations based in East Sussex
Music charities based in the United Kingdom
Youth charities based in the United Kingdom
1999 establishments in England
|
Stars and the Moon is the ninth studio album by Japanese jazz fusion band T-Square, who were then known as The Square. It was released on December 1, 1984.
Track listing
Sources
References
T-Square (band) albums
1984 albums
|
```c++
// (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
// See path_to_url for the library home page.
//
//!@file
//!@brief contains wrappers, which allows to build Boost.Test with no exception
// ***************************************************************************
#ifndef BOOST_TEST_DETAIL_THROW_EXCEPTION_HPP
#define BOOST_TEST_DETAIL_THROW_EXCEPTION_HPP
// Boost
#include <boost/config.hpp> // BOOST_NO_EXCEPTIONS
#ifdef BOOST_NO_EXCEPTIONS
// C RUNTIME
#include <stdlib.h>
#endif
#include <boost/test/detail/suppress_warnings.hpp>
//your_sha256_hash____________//
namespace boost {
namespace unit_test {
namespace ut_detail {
#ifdef BOOST_NO_EXCEPTIONS
template<typename E>
BOOST_NORETURN inline void
throw_exception(E const& e) { abort(); }
#define BOOST_TEST_I_TRY
#define BOOST_TEST_I_CATCH( T, var ) for(T const& var = *(T*)0; false;)
#define BOOST_TEST_I_CATCH0( T ) if(0)
#define BOOST_TEST_I_CATCHALL() if(0)
#define BOOST_TEST_I_RETHROW
#else
template<typename E>
BOOST_NORETURN inline void
throw_exception(E const& e) { throw e; }
#define BOOST_TEST_I_TRY try
#define BOOST_TEST_I_CATCH( T, var ) catch( T const& var )
#define BOOST_TEST_I_CATCH0( T ) catch( T const& )
#define BOOST_TEST_I_CATCHALL() catch(...)
#define BOOST_TEST_I_RETHROW throw
#endif
//your_sha256_hash____________//
#define BOOST_TEST_I_THROW( E ) unit_test::ut_detail::throw_exception( E )
#define BOOST_TEST_I_ASSRT( cond, ex ) if( cond ) {} else BOOST_TEST_I_THROW( ex )
} // namespace ut_detail
} // namespace unit_test
} // namespace boost
//your_sha256_hash____________//
#include <boost/test/detail/enable_warnings.hpp>
#endif // BOOST_TEST_DETAIL_THROW_EXCEPTION_HPP
```
|
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
"""Show the set of dependency diffs introduced by a branch.
Usage:
show-upgrade-diffs.py [-d <directory>] <user> <branch>
Assumes that there is a <user>/nomulus repository on github with the specified
branch name.
"""
import argparse
import os
import six
import subprocess
import sys
import tempfile
from typing import cast, Dict, Set, Tuple, Union
def run(*args):
if subprocess.call(args):
raise Abort(f'"{" ".join(args)}" failed')
PackageName = Tuple[bytes, bytes]
VersionSet = Set[bytes]
PackageMap = Dict[PackageName, VersionSet]
RED = b'\033[40;31;1m'
GREEN = b'\033[40;32;1m'
class Abort(Exception):
"""Raised to abort processing and record an error."""
def merge(dest: PackageMap, new: PackageMap) -> None:
for key, val in new.items():
dest[key] = dest.setdefault(key, set()) | val
def parse_lockfile(filename: str) -> PackageMap:
result: PackageMap = {}
for line in open(filename, 'rb'):
if line.startswith(b'#'):
continue
line = line.rstrip()
package = line.split(b'=')[0]
if package == 'empty':
continue
package = cast(Tuple[bytes, bytes, bytes], tuple(package.split(b':')))
result.setdefault(package[:-1], set()).add(package[-1])
return result
def get_all_package_versions(dir: str) -> PackageMap:
"""Return list of all package versions in the directory."""
packages = {}
for file in os.listdir(dir):
file = os.path.join(dir, file)
if file.endswith('.lockfile'):
merge(packages, parse_lockfile(file))
elif os.path.isdir(file):
merge(packages, get_all_package_versions(file))
return packages
def pr(*args: Union[str, bytes]) -> None:
"""Print replacement that prints bytes without weird conversions."""
for text in args:
sys.stdout.buffer.write(six.ensure_binary(text))
sys.stdout.buffer.flush()
def format_versions(a: VersionSet, b: VersionSet, missing_esc: bytes) -> bytes:
"""Returns a formatted string of the elements of "a".
Returns the elements of "a" as a comma-separated string, colorizes the
elements of "a" that are not also in "b" with "missing_esc".
Args:
a: Elements to print.
b: Other set, if a printed element is not a member of "b" it is
colorized.
missing_esc: ANSI terminal sequence to use to colorize elements that
are missing from "b".
"""
elems = []
for item in a:
if item in b:
elems.append(item)
else:
elems.append(missing_esc + item + b'\033[0m')
return b', '.join(elems)
def main():
parser = argparse.ArgumentParser(description=__doc__)
parser.add_argument('--directory', '-d', type=str, default='',
dest='directory',
help=('Directory to use for a local git '
'repository. By default, this script clones '
'the nomulus repo into a temporary directory '
'which is deleted after the script is run. '
'This option allows you to specify the '
'directory and causes it to be retained (not '
'deleted) after the script is run, allowing '
'it to be reused for subsequent runs, speeding '
'them up considerably.'))
parser.add_argument('user', type=str,
help=('The name of the user on github. The full '
'github repository name is presumed to be '
'"$user/nomulus".'))
parser.add_argument('branch', type=str,
help='The git branch containing the changes.')
args = parser.parse_args()
user = args.user
branch = args.branch
if not args.directory:
tempdir = tempfile.TemporaryDirectory()
dir = tempdir.name
else:
dir = args.directory
# Either clone or fetch the master branch if it exists.
if args.directory and os.path.exists(dir):
pr(f'Reusing directory {dir}\n')
os.chdir(dir)
run('git', 'fetch', 'git@github.com:google/nomulus', 'master')
run('git', 'checkout', 'origin/master')
else:
run('git', 'clone', 'git@github.com:google/nomulus', dir)
os.chdir(dir)
old_packages = get_all_package_versions('.')
run('git', 'fetch', f'path_to_url{user}/nomulus.git',
f'{branch}:{branch}')
run('git', 'checkout', branch)
new_packages = get_all_package_versions('.')
if new_packages != old_packages:
pr('\n\nPackage version change report:\n')
pr('change package-name: {old versions} -> {new versions}\n')
pr('=====================================================\n\n')
for package, new_versions in new_packages.items():
old_versions = old_packages.get(package)
if not old_versions:
pr('added ', b':'.join(package), ': {',
format_versions(new_versions, set(), GREEN),
'}\n')
elif new_versions != old_versions:
# Print out "package-name: {old versions} -> {new versions} with
# pretty colors.
formatted_old_versions = (
format_versions(old_versions, new_versions, RED))
formatted_new_versions = (
format_versions(new_versions, old_versions, GREEN))
pr('updated ', b':'.join(package), ': {',
formatted_old_versions, '} -> {',
formatted_new_versions, '}\n')
# Print the list of packages that were removed.
for package in old_packages:
if package not in new_packages:
pr('removed ', b':'.join(package), '\n')
else:
pr('Package versions not updated!\n')
if args.directory:
pr(f'\nRetaining git directory {dir}, to delete: rm -rf {dir}\n')
if __name__ == '__main__':
main()
```
|
Adamson University (; AdU or ADU) is a private Catholic university operated by the Congregation of the Mission located in Manila, Philippines. The university has academic programs in graduate school, law, the liberal arts, sciences, engineering, nursing, pharmacy, architecture, business administration, and education, as well as secondary, elementary, and preschool. It is one of the universities in the country to received an autonomous status by the Commission on Higher Education.
Adamson University has been regularly included in the rankings of top universities in the Philippines. It was included in the top 201+ universities in Asia in the Quacquarelli Symonds (QS) Asia University Rankings in multiple occasions, most recently in 2022, where it placed 651+ mark. The university is a member of the University Athletic Association of the Philippines. In its 80th season, the university won first place in the cheerdancing competition.
History
George Lucas Adamson, a Greek chemist, founded the Adamson School of Industrial Chemistry on June 20, 1932 as a single-classroom school for industrial chemistry. His cousin, Alexander Athos Adamson, came to the country in 1932 to assist him in administering the then-newly founded school, where he served as its vice president, treasurer, and registrar. Alexander's brother, George Athos Adamson, arrived two years after to serve as a professor and dean of both the school and the College of Engineering. On February 19, 1936, the school was renamed as the Adamson School of Industrial Chemistry and Engineering. In 1939, George Lucas' wife, Evdoxia Savaides Adamson, began working at the school, serving as a professor and eventually dean of both Colleges of Education and Liberal Arts and Sciences. She was soon followed by George Athos' wife, Sofia Adamson, who taught in the College of Education and briefly served as the Junior Normal College's Director. The school became university on February 5, 1941 upon the approval of the Department of Public Instruction.
The Adamsons worked at the university after the Second World War, except for George Athos and Sofia, who left the country after the war. George Lucas Adamson served as the university's president for 35 years. During his tenure, the university became a probationary member of the University Athletics Association of the Philippines in 1952; it was granted full membership in 1971. On December 4, 1964, the university was turned over to the Congregation of the Mission and was incorporated into the Adamson-Ozanam Education Institutions, Inc. Its patron saint is Saint Vincent de Paul.
Spanish priest Leandro I. Montañana became the university's second president, holding the office until 1985. He was succeeded by priest Rolando S. Dela Goza, the first Filipino president of the university. He hold the office until 1994, where he was succeeded by priest Jimmy Belita who served as president until 2003. Gregorio L. Bañaga, Jr. became the university's fifth president, a position he held until 2015.
The university celebrated its diamond jubilee in 2007. The National Historical Commission of th Philippines designated the university as a historical site. A memorial was installed in front of the St. Vincent Building, the oldest building on campus, commemorating this heritage.
Adamson University was granted autonomous status by the Commission on Higher Education in 2010, giving greater powers to the administration of the university independent to the commission.
On November 16, 2012, the university inaugurated a museum dedicated to its founders, inside the St. Vincent Building. The inauguration was part of the celebration of its 80th anniversary. In 2013, the university received a ISO 9001:2008 Management Systems certification from TÜV Rheinland.
In 2015, priest Marcelo V. Manimtim became the sixth and current president of the university, succeeding Bañaga.
Campus
Adamson University is located in San Marcelino Street, Ermita, Manila, in an area known colloquially as the "University Belt". The Technological University of the Philippines, Santa Isabel College Manila, Emilio Aguinaldo College, and Philippine Normal University are its nearest neighbors. Adamson University has eight buildings occupying 10.7 hectares of land.
The school was located in three different campuses: Santa Cruz (1932–1933), San Miguel (1933–1939), and Intramuros (1939-1941) before finally settling on its present location in 1946. The university expanded its campus in San Marcelino by acquiring the Meralco building in 1968 and the St. Theresa's College-Manila site just across the street in 1977.
Alumni
Politics and governance
Ruthlane Uy Asmundson, former mayor of Davis, California
Cynthia Barker, Mayor of Hertsmere, a local government district and borough in Hertfordshire, England
Eduardo del Rosario, Secretary of Department of Human Settlements and Urban Development
Romulo Peña Jr., Representative of the First District of Makati
Angelito Gatlabayan, former city mayor and representative of the 2nd District of Antipolo
Jose Catindig Jr., former mayor or Santa Rosa, Laguna
Roberto Uy, governor of Zamboanga del Norte
Noel Rosal, former mayor of Legazpi, Albay
Sports
Rafael "Paeng" Nepomuceno, World Champion bowler
Carlos Yulo, 2019 World Artistic Gymnastics Championships gold medalist in floor exercise finals
Kenneth Duremdes, basketball player, UNTV Cup Senate Defenders Head Coach,
Marlou Aquino, basketball player
Hector Calma, basketball player
Louie Alas, Letran Knights coach
Edward Joseph Feihl, basketball player
Gherome Ejercito, basketball player
Eddie Laure, basketball player
Alex Nuyles, basketball player
Lester Alvarez, basketball player
Ken Bono, basketball player
Chad Alonzo, basketball player
Melvin Mamaclay, basketball player
Jericho Cruz, basketball player
Rodney Brondial, basketball player
Eric Camson, basketball player
Don Trollano. basketball player
Jansen Rios, basketball player
Sean Manganti, basketball player
Jerrick Ahanmisi, basketball player
Mylene Paat, Volleyball player, Philippine National Women's Volleyball Team Member
Jema Galanza, Volleyball player, Creamline Cool Smashers
Tatan Pantone, Volleyball player, PLDT Home Fibr Hitters
Louie Romero, Volleyball player
Trisha Genesis, Volleyball player, Akari Chargers
Dante Alinsunurin, champion volleyball coach
Sherwin Meneses, champion volleyball coach
Ana Santiago, 15-time champion softball coach in the UAAP
Arts, culture, religion, and entertainment
Prince Villanueva, actor
Hazel Ann Mendoza, actress
Nida Blanca, actress
Francine Prieto, actress
Jestoni Alarcon, actor
Neil Coleta, actor
Mario O'Hara, film director, film producer and screenwriter
Guillermo Gómez Rivera, historian and writer
Fernando Suarez, priest
Florentino Floro, judge
Science and research
Mary Jane Alvero, CEO of Geoscience Testing Laboratory, United Arab Emirates
References
External links
Adamson University Official Website
Adamson University Official Facebook Page
Universities
Catholic universities and colleges in Manila
Education in Ermita
Universities and colleges in Manila
University Athletic Association of the Philippines universities
Universities and colleges established in 1932
1932 establishments in the Philippines
|
```go
package mdm
import (
"bytes"
"context"
"crypto/x509"
"encoding/base64"
"io/ioutil"
"net/http"
"github.com/go-kit/kit/endpoint"
"github.com/go-kit/kit/log"
httptransport "github.com/go-kit/kit/transport/http"
"github.com/gorilla/mux"
"github.com/groob/plist"
"github.com/micromdm/micromdm/pkg/crypto"
"github.com/pkg/errors"
"github.com/smallstep/pkcs7"
)
type Endpoints struct {
CheckinEndpoint endpoint.Endpoint
AcknowledgeEndpoint endpoint.Endpoint
}
func MakeServerEndpoints(s Service) Endpoints {
return Endpoints{
CheckinEndpoint: MakeCheckinEndpoint(s),
AcknowledgeEndpoint: MakeAcknowledgeEndpoint(s),
}
}
func RegisterHTTPHandlers(r *mux.Router, e Endpoints, v *crypto.PKCS7Verifier, logger log.Logger) {
options := []httptransport.ServerOption{
httptransport.ServerErrorEncoder(encodeError),
httptransport.ServerErrorLogger(logger),
httptransport.ServerBefore(httptransport.PopulateRequestContext),
httptransport.ServerBefore((verifier{PKCS7Verifier: v}).populateDeviceCertificateFromSignRequestHeader),
}
r.Methods(http.MethodPut).Path("/mdm/checkin").Handler(httptransport.NewServer(
e.CheckinEndpoint,
decodeCheckinRequest,
encodeResponse,
options...,
))
r.Methods(http.MethodPut).Path("/mdm/connect").Handler(httptransport.NewServer(
e.AcknowledgeEndpoint,
decodeAcknowledgeRequest,
encodeResponse,
options...,
))
}
type contextKey int
const (
ContextKeyDeviceCertificate contextKey = iota
ContextKeyDeviceCertificateVerifyError
)
func DeviceCertificateFromContext(ctx context.Context) (*x509.Certificate, error) {
cert := ctx.Value(ContextKeyDeviceCertificate).(*x509.Certificate)
err, _ := ctx.Value(ContextKeyDeviceCertificateVerifyError).(error)
return cert, err
}
type verifier struct {
*crypto.PKCS7Verifier
}
func (v verifier) populateDeviceCertificateFromSignRequestHeader(ctx context.Context, r *http.Request) context.Context {
bodyReader := r.Body
defer bodyReader.Close()
// We can't gracefully bubble up errors from this function,
// so we silently disregard them (terrible)
body, _ := ioutil.ReadAll(r.Body)
// Replace our body object with a fully buffered response
r.Body = ioutil.NopCloser(bytes.NewBuffer(body))
cert, err := v.verifySignature(r.Header.Get("Mdm-Signature"), body)
ctx = context.WithValue(ctx, ContextKeyDeviceCertificate, cert)
ctx = context.WithValue(ctx, ContextKeyDeviceCertificateVerifyError, err)
return ctx
}
// TODO: If we ever use Go client cert auth we can use
// r.TLS.PeerCertificates to return the client cert. Unnecessary
// now as default config is uses Mdm-Signature header method instead
// (for better compatilibity with proxies, etc.)
// func populateDeviceCertificateFromTLSPeerCertificates()
// Extract (raw) body bytes, parse property list
func mdmRequestBody(r *http.Request, s interface{}) ([]byte, error) {
defer r.Body.Close()
body, err := ioutil.ReadAll(r.Body)
if err != nil {
return nil, errors.Wrap(err, "reading MDM acknowledge HTTP body")
}
err = plist.Unmarshal(body, s)
if err != nil {
return body, errors.Wrap(err, "unmarshal MDM acknowledge plist")
}
return body, nil
}
// Verify MDM header signature. Note: does NOT verify device certificate
func (v verifier) verifySignature(header string, body []byte) (*x509.Certificate, error) {
if header == "" {
return nil, errors.New("signature missing")
}
sig, err := base64.StdEncoding.DecodeString(header)
if err != nil {
return nil, errors.Wrap(err, "decode MDM SignMessage header")
}
p7, err := pkcs7.Parse(sig)
if err != nil {
return nil, errors.Wrap(err, "CMS parse decoded MDM SignMessage signature")
}
p7.Content = body
if err := v.Verify(p7); err != nil {
return nil, errors.Wrap(err, "CMS verify MDM Signed Message")
}
cert := p7.GetOnlySigner()
if cert == nil {
return nil, errors.New("invalid or missing CMS signer")
}
return cert, nil
}
// According to the MDM Check-in protocol, the server must respond with 200 OK
// to successful Check-in requests.
func encodeResponse(ctx context.Context, w http.ResponseWriter, response interface{}) error {
type failer interface {
Failed() error
}
if e, ok := response.(failer); ok && e.Failed() != nil {
return e.Failed()
}
w.WriteHeader(http.StatusOK)
type payloader interface {
Response() []byte
}
var err error
if r, ok := response.(payloader); ok {
_, err = w.Write(r.Response())
}
return errors.Wrap(err, "write acknowledge response")
}
func encodeError(ctx context.Context, err error, w http.ResponseWriter) {
err = errors.Cause(err)
type rejectUserAuthError interface {
error
UserAuthReject() bool
}
if e, ok := err.(rejectUserAuthError); ok && e.UserAuthReject() {
w.WriteHeader(http.StatusGone)
return
}
type checkoutErr interface {
error
Checkout() bool
}
if e, ok := err.(checkoutErr); ok && e.Checkout() {
w.WriteHeader(http.StatusUnauthorized)
return
}
w.WriteHeader(http.StatusInternalServerError)
}
```
|
```tex
\documentclass{article}
\author{s3in!c $\langle$s3inlc@hashes.org$\rangle$ }
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage[left=10mm, right=10mm, top=20mm, bottom=20mm]{geometry}
\usepackage[english]{babel}
\usepackage{fancyvrb}
\usepackage[dvipsnames]{xcolor}
\begin{document}
\title{Hashtopolis User API (V1)}
\maketitle
\section*{Introduction}
The communication for the User API is always in JSON formatted values. When sending a request to the server, it should be a POST containing the JSON data.
Every request has a \textit{section} and a \textit{request} field to state which action should be executed. Every response again then contains the requested section and request and gives a \textit{status} to indicate if the query was successful or not. To increase the readability of this document, requests are always in blue, successful responses in green and error messages in red.
\section*{Errors}
In case of an error with the query which the user sends to the server, the response will have following format with the corresponding action which was requested and the error message which should help in getting information about this error.
{
\color{BrickRed}
\begin{verbatim}
{
"section":"task",
"request":"create",
"status":"ERROR",
"message":"You are not allowed to create tasks!"
}
\end{verbatim}
}
\section*{Sections}
This part lists all sections available on the API. The value in the brackets denotes the according value to be sent on API queries.
\begin{itemize}
\item{Access Control (\textit{access})}
\item{Agents (\textit{agent})}
\item{Server Config (\textit{config})}
\item{Crackers (\textit{cracker})}
\item{Files (\textit{file})}
\item{Groups (\textit{group})}
\item{Hashlists (\textit{hashlist})}
\item{Preconfigured Tasks (\textit{pretask})}
\item{Superhashlists (\textit{superhaslist})}
\item{Supertasks (\textit{supertask})}
\item{Tasks (\textit{task})}
\item{Test (\textit{test})}
\item{User Management (\textit{user})}
\end{itemize}
\pagebreak
\input{sections/test.tex}
\pagebreak
\input{sections/agent.tex}
\pagebreak
\input{sections/task.tex}
\pagebreak
\input{sections/pretask.tex}
\pagebreak
\input{sections/supertask.tex}
\pagebreak
\input{sections/hashlist.tex}
\pagebreak
\input{sections/superhashlist.tex}
\pagebreak
\input{sections/file.tex}
\pagebreak
\input{sections/cracker.tex}
\pagebreak
\input{sections/config.tex}
\pagebreak
\input{sections/user.text}
\pagebreak
\input{sections/group.tex}
\pagebreak
\input{sections/access.tex}
\pagebreak
\input{sections/account.tex}
%\subsection*{\textit{temporary}}
% TODO
% {
% \color{blue}
% \begin{verbatim}
% {
% "section": "agent",
% "request": "deleteVoucher",
% "voucher": "Gjawgidkr4",
% "accessKey": "mykey"
% }
% \end{verbatim}
% }
% {
% \color{OliveGreen}
% \begin{verbatim}
% {
% "section": "agent",
% "request": "deleteVoucher",
% "response": "OK"
% }
% \end{verbatim}
% }
\end{document}
```
|
Black Tie Nights is a softcore drama anthology series which aired on Cinemax in the United States from 2004 to 2005.
This anthology show revolved around the adventures of Olivia Hartley and Cooper Snow who ran Black Tie dating service. They were assisted by their geeky sidekick, Ryan Lundy. Each week they would encounter new or returning customers and try to play matchmaker. The first season had two main subplots that continued in each episode. The first was the budding romance between Ryan and Cooper. The second was Olivia getting over the loss of her husband and dating again.
In the second season, the show was retooled. The anthology series was renamed Hollywood Sexcapades and the characters of Olivia and Cooper were said to be out of the country opening a new branch. Candi Hicks, a recurring customer in the first season, became the new employee of Black Tie dating service. She and Ryan (who was no longer nerdish) partnered to run the company, and the continuing subplot was the budding romance between these two characters. Each week they would continue to try to play matchmaker to that episode's guest stars.
Cast
Glen Meadows as Ryan Lundy
Beverly Lynne as Candi Hicks
Tiffany Bolton as Cooper Snow
Amy Lindsay as Olivia Hartley
Episodes
Season 1 (2004)
"Date and Switch" – June 4, 2004
"Naughty and Nice" – June 11, 2004
"Beauty and the Beach" – June 18, 2004
"A Girl Thing" – June 25, 2004
"The Sex Sense" – July 2, 2004
"Luck Be a Lady" – July 9, 2004
"Girl on Page 19" – July 16, 2004
"Makeover" – July 23, 2004
"Love is Blind" – July 30, 2004
"The Legend" – August 6, 2004
"Whose Thong Is It, Anyway?" – August 13, 2004
"Internal Affairs" – August 20, 2004
"Something Wilder" – August 27, 2004
Season 2 (2005)
"Dutch Treat" – October 7, 2005
"Competitive Juices" – October 14, 2005
"Sexual Healing" – October 21, 2005
"Confessions in the Dark" – October 28, 2005
"Undercover Girl" – November 4, 2005
"Mile High Club" – November 11, 2005
"Pajama Club" – November 18, 2005
"Sensational" – November 25, 2005
"Chick Boxers" – December 2, 2005
"Let's Play Doctor" – December 9, 2005
"In Good Hands" – December 16, 2005
"Sexperience" – December 23, 2005
"Candi Hearts" – December 30, 2005
External links
2004 American television series debuts
2005 American television series endings
2000s American drama television series
2000s American romance television series
Cinemax original programming
Television series by Warner Bros. Television Studios
Erotic television series
|
```smalltalk
namespace Volo.Abp.AspNetCore.Mvc.UI.Bootstrap.TagHelpers.Border;
public enum AbpBorderType
{
Default,
_0,
Primary,
Secondary,
Success,
Danger,
Warning,
Info,
Light,
Dark,
White,
Primary_0,
Secondary_0,
Success_0,
Danger_0,
Warning_0,
Info_0,
Light_0,
Dark_0,
White_0,
Top,
Top_0,
Top_Primary,
Top_Secondary,
Top_Success,
Top_Danger,
Top_Warning,
Top_Info,
Top_Light,
Top_Dark,
Top_White,
Top_Primary_0,
Top_Secondary_0,
Top_Success_0,
Top_Danger_0,
Top_Warning_0,
Top_Info_0,
Top_Light_0,
Top_Dark_0,
Top_White_0,
Right,
Right_0,
Right_Primary,
Right_Secondary,
Right_Success,
Right_Danger,
Right_Warning,
Right_Info,
Right_Light,
Right_Dark,
Right_White,
Right_Primary_0,
Right_Secondary_0,
Right_Success_0,
Right_Danger_0,
Right_Warning_0,
Right_Info_0,
Right_Light_0,
Right_Dark_0,
Right_White_0,
Left,
Left_0,
Left_Primary,
Left_Secondary,
Left_Success,
Left_Danger,
Left_Warning,
Left_Info,
Left_Light,
Left_Dark,
Left_White,
Left_Primary_0,
Left_Secondary_0,
Left_Success_0,
Left_Danger_0,
Left_Warning_0,
Left_Info_0,
Left_Light_0,
Left_Dark_0,
Left_White_0,
Bottom,
Bottom_0,
Bottom_Primary,
Bottom_Secondary,
Bottom_Success,
Bottom_Danger,
Bottom_Warning,
Bottom_Info,
Bottom_Light,
Bottom_Dark,
Bottom_White,
Bottom_Primary_0,
Bottom_Secondary_0,
Bottom_Success_0,
Bottom_Danger_0,
Bottom_Warning_0,
Bottom_Info_0,
Bottom_Light_0,
Bottom_Dark_0,
Bottom_White_0,
}
```
|
Palestine competed at the 2022 World Aquatics Championships in Budapest, Hungary from 17 June to 3 July.
Swimming
Palestine entered two swimmers.
Men
Women
References
Nations at the 2022 World Aquatics Championships
Palestine at the World Aquatics Championships
Aqua
|
```c++
#ifndef BOOST_MPL_COUNT_HPP_INCLUDED
#define BOOST_MPL_COUNT_HPP_INCLUDED
//
// (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
//
// See path_to_url for documentation.
// $Id: count.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/count_fwd.hpp>
#include <boost/mpl/sequence_tag.hpp>
#include <boost/mpl/aux_/count_impl.hpp>
#include <boost/mpl/aux_/na_spec.hpp>
#include <boost/mpl/aux_/lambda_support.hpp>
namespace boost { namespace mpl {
template<
typename BOOST_MPL_AUX_NA_PARAM(Sequence)
, typename BOOST_MPL_AUX_NA_PARAM(T)
>
struct count
: count_impl< typename sequence_tag<Sequence>::type >
::template apply<Sequence,T>
{
BOOST_MPL_AUX_LAMBDA_SUPPORT(2,count,(Sequence,T))
};
BOOST_MPL_AUX_NA_SPEC(2, count)
}}
#endif // BOOST_MPL_COUNT_HPP_INCLUDED
```
|
Fabiola Jean-Louis (born September 10, 1978) is a Haitian artist working in photography, paper textile design, and sculpture. Her work examines the intersectionality of the Black experience, particularly that of women, to address the absence and imbalance of historical representation of African American and Afro-Caribbean people. Jean-Louis has earned residencies at the Museum of Art and Design (MAD), New York City, the Lux Art Institute, San Diego, and the Andrew Freedman Home in The Bronx. In 2021, Jean-Louis became the first Haitian woman artist to exhibit at the Metropolitan Museum of Art. Fabiola lives and works in New York City.
Biography
Fabiola Jean-Louis was born in Port au Prince, Haiti in 1978 before relocating with her family to Harlem, New York around the age of 2. Jean-Louis is an alumna of both Fashion Industries High-school and City-As-School. She later attended Nova Southeastern University in Fort Lauderdale, Florida with plans to study medicine before dropping out three months shy of graduation to pursue a career in art. She is currently based in Brooklyn, New York.
Career
Fabiola Jean-Louis is an artist who uses photography to recreate elaborate eighteenth century-inspired portraiture that centers Black women. As part of her process, Jean-Louis creates opulent dresses and other fashion accessories out of paper and then stages idealized eighteenth century scenes. She says, "My work always centralizes around the black and brown female body, and it's looking at society--our place in society." Art critic, Felicia Feaster, states, "Jean-Louis is in the business of both questioning the uniformity of our visual culture -- and its glorification of only the dominant European ruling class -- while also pondering a disturbing element of many classical paintings, which balance refined beauty against scenes of war, rape and destruction."
Jean-Louis's rise to fame began in 2014 when she started experimenting with conceptional photography by blending science, technology, art, and design with the magical, mystical, and fantastical. She used paper to recreate baroque gowns because, "As a black woman, I learned to do without, to make the best of having nothing sometimes. And fine fabric is expensive. You want to make these amazing, baroque gowns but you need to have the money for that."
In 2021, the Metropolitan Museum of Art commissioned Fabiola to make a life-size paper sculpture to be featured in their two year exhibition, Before Yesterday We Could Fly: An Afrofuturist Period Room. This made Jean-Louis the first Haitian woman to be exhibited in the museum.
Works
ReWriting History
ReWriting History is a series by Jean-Louis that sheds light on the absence of Black people in historical portraiture with antithetical scenes of reappropriated history. Consisting of photographs and sculpture, Jean-Louis makes paper dresses and accessories reminiscent of garments worn by old-world nobility then photographs her subjects wearing them. The series is confounded by the mistreatment of Black bodies over centuries of enslavement, using references such as "The Whipped Back" of Gordon that features keloid scaring replicated on the dress seen in Jean-Louis' photograph, "Madame Beauvoir's Painting." In April of 2021, Beinecke Rare Book & Manuscript Library at Yale University announced the acquisition of the Rewriting History portfolio.
Solo exhibitions
2019: Andrew Freedman Home, Bronx, NY
2019: Lux Art Institute, San Diego, CA
2018: BRIC Gallery, Brooklyn, NY
2017: DuSable Museum of African American History, Chicago, IL
2017: Alan Avery Art Company, Atlanta, GA
2016: The Harlem School of the Arts, Harlem, NY
Group exhibitions
2022: Our Colonial Inheritance, Tropenmuseum, Amsterdam, Netherlands
2021: Before Yesterday We Could Fly: An Afrofuturist Period Room, Metropolitan Museum of Art, New York City, NY
2019: The Rest of History, Virginia Museum of Contemporary Art, Virginia Beach, VA
2018: Dressed, The Window Gallery at The Paul Robeson Galleries, Newark, NJ
2018: Bordering the Imaginary: Art from the Dominican Republic, Haiti, and their Diasporas, BRIC, Brooklyn, NY
2017: Visionary Aponte; Art and Black Freedom, Art of Black Miami, Little Haiti Cultural Center, Art Basel, Miami, FL
2017: High John the Conqueror Ain’t Got Nothing on Me: American Hoodoo and Southern Black American-Centric Spiritual Ways, Rush Philanthropic, Rush Arts Philadelphia, Philadelphia, PA
2016: Africa Forecast: Fashioning Contemporary Life, Spelman College Museum of Fine Art, Atlanta, GA
2016: The Boundless Group Exhibition, Brooklyn Historical Society, Brooklyn, NY
2016: Metamorphosis Group Exhibition, Arts East New York Gallery, Brooklyn, NY
2015: Women as Witness, TI Art Studios, Brooklyn, NY
2014: Sixth Annual Juried Student Exhibition, Nova Southeastern University, Fort Lauderdale-Davie, FL
Artist residency
2021: University of Central Arkansas, Conway, AR
2019: Lux Art Institute, San Diego, CA
2017: Museum of Arts and Design, New York City, NY
Selected collections
Andrew Freedman Home, The Bronx, NY
Hunter Museum, Chattanooga, TN
New York University, New York City, NY
Spelman College Museum, Atlanta, GA
Yale University, New Haven, CT
References
Living people
1978 births
Haitian women photographers
Haitian photographers
Haitian women painters
Haitian painters
Artists from New York City
External links
Fabiola Jean-Louis
Fabiola Jean-Louis on Instagram
|
Alice Jenkins or Alice Brook; born Alice Glyde (1886–1967) was a British abortion campaigner. She co-founded the Abortion Law Reform Association which reformed UK abortion law. Her book "Law For The Rich" proved pivotal in the creation of the UK's 1967 Abortion Act which made abortion accessible in mainland Britain eight days before she died.
Biography
Jenkins was born, Alice Glyde, in Ilkley in 1886. Her mother, Charlotte Glyde, had six children and they all became involved in politics. Her mother was a servant. In 1907 she started a partnership with William James Jenkins, they never married, but they had three children.
On 17 February 1936, Jenkins along with Janet Chance and Stella Browne began the Abortion Law Reform Association (ALRA). At the end of their first year they had 35 new members, and by 1939 they had almost 400. The membership were gathered from the working class using labour groups and women’s branches of the co-operative movement. These women wanted the privileges that “moneyed classes had enjoyed for years.”
The ALRA was very active between 1936 and 1939 sending speakers around the country to talk about Labour and Equal Citizenship and attempted to have letters and articles published in newspapers. They were in the frame when a member of the ALRA’s Medico-Legal Committee received the case of a fourteen-year-old girl who had been raped, and she received a termination of this pregnancy from Dr. Joan Malleson, a progenitor of the ALRA.
Jenkins wrote an important book titled "Law For The Rich" which was published in 1960. He book drew attention to the double standards that faced women with unwanted pregnancies. Abortion was illegal so many women had to give birth to unplanned children, however rich women could persuade their private doctors that their mental health was at risk. The doctors were then able to carry out an abortion that was denied to most women in Britain.
The ALRA's major victory was to gain the support of the liberal politician David Steel. He was a liberal M.P. who had been lucky enough to win a third chance of placing a private members bill through the house of commons. He rejected a call to amend the rights of plumbers and homosexuals and decided to reform the laws of abortion. He cites Alice Jenkin's argument in her book "Law For The Rich" as being pivotal in his decision. Steele put forward a private members bill that was backed by the government and it resulted in the 1967 Abortion Act.
Views on Catholicism and Irish immigrants
The Dublin-based Life Institute (which opposes abortion), has accused Jenkins' of anti-Irish racism and anti-Catholic bigotry, due to opinions featured in her book Law for the Rich, where she states "Roman Catholic congregations are amongst the most poverty-stricken sections of the community; their numerical strength is growing and their poverty is intensified by their large families. Most people believe in free speech and a free Press, and the Roman Catholic Church has the right to voice its opinions. But we may well ask why it is allowed to exercise so much indirect and often insidious influence in our country, out of all proportion to its numbers. We are told that in 1958 the number of Irish immigrants from Eire (sic) was estimated to be 60,000. The number of marriages solemnised in Roman Catholic Churches in this country is greatly increasing, and, if this trend continues, it looks as though there might be a reversion to Roman Catholicism within 150 years. So it is later than we think! Far too few leading British newspapers concern themselves with this danger." She cites the xenophobic work Your Future is Now by Will Thorne, which complains about "boatload after boatload of Irish" arriving in England, increasing the number of Catholics in the country.
Death and legacy
Jenkins died on Christmas Day 1967. She was the only surviving member of the original ALRA executive and she did see the act pass into UK law eight days before she died.
References
1886 births
1967 deaths
British abortion-rights activists
People from Ilkley
Anti-Irish sentiment
Anti-Catholicism in the United Kingdom
|
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8" />
<link rel="icon" href="%PUBLIC_URL%/favicon.ico" />
<meta name="viewport" content="width=device-width, initial-scale=1" />
<meta name="theme-color" content="#000000" />
<meta
name="description"
content="Web site created using create-react-app"
/>
<link rel="apple-touch-icon" href="%PUBLIC_URL%/logo192.png" />
<!--
manifest.json provides metadata used when your web app is installed on a
user's mobile device or desktop. See path_to_url
-->
<link rel="manifest" href="%PUBLIC_URL%/manifest.json" />
<!--
Notice the use of %PUBLIC_URL% in the tags above.
It will be replaced with the URL of the `public` folder during the build.
Only files inside the `public` folder can be referenced from the HTML.
Unlike "/favicon.ico" or "favicon.ico", "%PUBLIC_URL%/favicon.ico" will
work correctly both with client-side routing and a non-root public URL.
Learn how to configure a non-root public URL by running `npm run build`.
-->
<title>React App</title>
</head>
<body>
<noscript>You need to enable JavaScript to run this app.</noscript>
<div id="root"></div>
<!--
This HTML file is a template.
If you open it directly in the browser, you will see an empty page.
You can add webfonts, meta tags, or analytics to this file.
The build step will place the bundled scripts into the <body> tag.
To begin the development, run `npm start` or `yarn start`.
To create a production bundle, use `npm run build` or `yarn build`.
-->
</body>
</html>
```
|
```java
package com.eventyay.organizer.core.speakerscall.create;
import com.eventyay.organizer.common.mvp.view.Erroneous;
import com.eventyay.organizer.common.mvp.view.Progressive;
import com.eventyay.organizer.common.mvp.view.Successful;
public interface CreateSpeakersCallView extends Progressive, Successful, Erroneous {
void dismiss();
}
```
|
Following is a list of all Article III United States federal judges appointed by President George W. Bush during his presidency, including a partial list of Judges appointed under Article I.
In total Bush appointed 327 Article III federal judges, including 2 Justices to the Supreme Court of the United States (including one Chief Justice), 62 judges to the United States Courts of Appeals, 261 judges to the United States district courts and 2 judges to the United States Court of International Trade. Additionally, he made appointments to various courts established under Article I and Article IV.
United States Supreme Court justices
Courts of appeals
District courts
United States Court of International Trade
Specialty courts (Article I)
United States Court of Federal Claims
United States Court of Appeals for Veterans Claims
United States Court of Appeals for the Armed Forces
United States Tax Court
Territorial courts (Article IV)
Notes
Courts
Renominations
References
General
Specific
Sources
Federal Judicial Center
Bush
Presidency of George W. Bush
George W. Bush-related lists
|
The Lotus 34 is an open-wheel race car built by Team Lotus for the 1964 Indianapolis 500. Driven by Jim Clark, who qualified on pole, and Dan Gurney, tyre failure led to Clark retiring and Gurney being withdrawn.
Development history
The Lotus 34 was a very similar car to the 29. It differed principally in featuring a four-cam 4195 cc (255ci) DOHC Ford V8 with Hilborn fuel injection, producing , through a ZF 2DS20 gearbox.
Race history
At Indianapolis, Jim Clark qualified on pole, with Dan Gurney qualifying sixth. The Dunlop tyres failed during the race, leading to Clark crashing and Dan Gurney being withdrawn, much to Ford's displeasure. Later that year Parnelli Jones won twice in a Lotus 43 at Milwaukee and Trenton.
In 1965 A.J. Foyt won three USAC races in a Lotus 34 on his way to second in that years championship, while Parnelli Jones finished second at Indianapolis behind Jim Clark's Lotus 38.
References
Further reading
Andrew Ferguson, Lotus: The Indianapolis Years (Patrick Stephens, 1996)
34
American Championship racing cars
|
Juan Pablo Arenas Núñez (born 22 April 1987) is a Chilean former professional footballer who played as a midfielder.
He played for Colo-Colo and also played (on loan) in Deportes Melipilla.
Club career
Arenas made his professional debut with Colo-Colo at the young age of seventeen against arch rival Universidad de Chile on August 1, 2004. Arenas still has not been able to find a regular spot on the first team.
International career
Arenas has been capped at the under-20 level. He was selected in the squad for the 2007 FIFA U-20 World Cup in Canada, he did not play any minutes during the that tournament. He scored two goals at U20 level. His first goal came against Colombia with a magnificent shot from near midfield to clinch the 5-0 Chilean victory.
Honours
Player
Colo-Colo
Primera División de Chile (4): 2006-A, 2006-C, 2007-A, 2007-C
Copa Sudamericana (1): Runner-up 2006
Magallanes
Tercera División A (1): 2010
References
External links
Juan Pablo Arenas at PlaymakerStats
1987 births
Living people
Footballers from Santiago
Men's association football midfielders
Chilean men's footballers
Chilean expatriate men's footballers
Chile men's under-20 international footballers
Colo-Colo footballers
Santiago Morning footballers
Deportes Melipilla footballers
Deportes Magallanes footballers
Provincial Osorno footballers
Trasandino de Los Andes footballers
Segunda División Profesional de Chile players
Chilean Primera División players
Primera B de Chile players
Tercera División de Chile players
Segunda División de Costa Rica players
Chilean expatriate sportspeople in Costa Rica
Expatriate men's footballers in Costa Rica
|
Siegrid Pallhuber (born 1 May 1970) is an Italian biathlete. She competed at the 1992 Winter Olympics and the 2002 Winter Olympics.
References
1970 births
Living people
Biathletes at the 1992 Winter Olympics
Biathletes at the 2002 Winter Olympics
Italian female biathletes
Olympic biathletes for Italy
Place of birth missing (living people)
Sportspeople from Bruneck
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var bench = require( '@stdlib/bench' );
var pow = require( '@stdlib/math/base/special/pow' );
var isTypedArray = require( '@stdlib/assert/is-typed-array' );
var constantFunction = require( '@stdlib/utils/constant-function' );
var pkg = require( './../package.json' ).name;
var filledarray = require( './../lib' );
// FUNCTIONS //
/**
* Creates a benchmark function.
*
* @private
* @param {PositiveInteger} len - array length
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
return benchmark;
/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var clbk;
var arr;
var i;
clbk = constantFunction( 1.0 );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
arr = filledarray( len, 'float64', clbk );
if ( arr.length !== len ) {
b.fail( 'unexpected length' );
}
}
b.toc();
if ( !isTypedArray( arr ) ) {
b.fail( 'should return a typed array' );
}
b.pass( 'benchmark finished' );
b.end();
}
}
// MAIN //
/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var f;
var i;
min = 1; // 10^min
max = 6; // 10^max
for ( i = min; i <= max; i++ ) {
len = pow( 10, i );
f = createBenchmark( len );
bench( pkg+':dtype=float64,len='+len, f );
}
}
main();
```
|
```html
<div class="pt-2 pt-lg-3 px-0 px-lg-3">
<h3 class="mb-2"><ng-container i18n>Select your language</ng-container></h3>
<form
#selectLanguageFormRef="ngForm"
*ngIf="selectLanguageForm"
[class.needs-validation]="!selectLanguageFormRef.submitted"
[class.was-validated]="selectLanguageFormRef.submitted"
[formGroup]="selectLanguageForm">
<div class="col-12 col-lg-6 col-xl-5 col-xxl-4">
<p class="small mb-2 mb-md-3" i18n>The page will be reloaded.</p>
<div class="form-check d-flex justify-content-center justify-content-lg-start mb-2">
<input
class="form-check-input me-1"
formControlName="language"
id="spanish"
name="language"
type="radio"
value="es" />
<label class="form-check-label" for="spanish"> Espaol </label>
</div>
<div class="form-check d-flex justify-content-center justify-content-lg-start">
<input
class="form-check-input me-1"
formControlName="language"
id="english"
name="language"
type="radio"
value="en" />
<label class="form-check-label" for="english"> English </label>
</div>
</div>
</form>
</div>
```
|
Lokhandi is a small village in Jashpur district of Chhattisgarh state of India.
See also
Jashpur district
References
Villages in Jashpur district
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.shardingsphere.readwritesplitting.distsql.handler.constant;
import lombok.AccessLevel;
import lombok.NoArgsConstructor;
/**
* Readwrite-splitting DistSQL constants.
*/
@NoArgsConstructor(access = AccessLevel.PRIVATE)
public final class ReadwriteSplittingDistSQLConstants {
public static final String CREATE_READWRITE_SPLITTING_RULE = "CREATE READWRITE_SPLITTING RULE";
public static final String READWRITE_SPLITTING_FOR_STATIC = " %s ("
+ System.lineSeparator()
+ "WRITE_STORAGE_UNIT=%s,"
+ System.lineSeparator()
+ "READ_STORAGE_UNITS(%s),"
+ System.lineSeparator()
+ "TRANSACTIONAL_READ_QUERY_STRATEGY='%s'%s"
+ System.lineSeparator()
+ ")";
public static final String READ_RESOURCE = "%s";
}
```
|
```shell
CPU benchmark with `dd`
Force a time update with `ntp`
Find out if the system's architecture is 32 or 64 bit
Preventing a user from logging into the system
Fixing `locale` issues in Debian systems
```
|
Capital punishment in France ( is banned by Article 66-1 of the Constitution of the French Republic, voted as a constitutional amendment by the Congress of the French Parliament on 19 February 2007 and simply stating "No one can be sentenced to the death penalty" (). The death penalty was already declared illegal on 9 October 1981 when President François Mitterrand signed a law prohibiting the judicial system from using it and commuting the sentences of the seven people on death row to life imprisonment. The last execution took place by guillotine, being the main legal method since the French Revolution; Hamida Djandoubi, a Tunisian citizen convicted of torture and murder on French soil, who was put to death in September 1977 in Marseille.
Major French death penalty abolitionists across time have included philosopher Voltaire; poet Victor Hugo; politicians Léon Gambetta, Jean Jaurès and Aristide Briand; and writers Alphonse de Lamartine and Albert Camus.
History
Ancien Régime
Prior to 1791, under the Ancien Régime, there existed a variety of means of capital punishment in France, depending on the crime and the status of the condemned person:
Hanging was the most common punishment.
Decapitation by sword, for nobles only.
Burning for arson, bestiality, heresy, sodomy, and witchcraft. The convict was occasionally discreetly strangled.
Breaking wheel for brigandage and murder. The convict could be strangled before having his limbs broken or after, depending on the atrocity of his crime.
Death by boiling for counterfeiting.
Dismemberment for high treason, parricide, and regicide.
On 6 July 1750, Jean Diot and Bruno Lenoir were strangled and burned at the stake in Place de Grève for sodomy, the last known execution for sodomy in France. Also in 1750, Jacques Ferron was either hanged or burned at the stake in Vanvres for bestiality, the last known execution for bestiality in France.
Adoption of the guillotine
The first campaign towards the abolition of the death penalty began on 30 May 1791, but on 6 October that year the National Assembly refused to pass a law abolishing the death penalty. However, they did abolish torture, and also declared that there would now be only one method of execution: 'Tout condamné à mort aura la tête tranchée' (All condemned to death will have their heads cut off).
In 1789, physician Joseph-Ignace Guillotin proposed that all executions be carried out by a simple and painless mechanism, which led to the development and eventual adoption of the guillotine. Beheading had previously been reserved only for nobles and carried out manually by handheld axes or blades; commoners would usually be hanged or subjected to more brutal methods. Therefore, the adoption of the guillotine for all criminals regardless of social status not only made executions more efficient and less painful, but it also removed the class divisions in capital punishment altogether. As a result, many felt the device made the death penalty more humane and egalitarian.
The guillotine was first used on Nicolas Jacques Pelletier on 25 April 1792. Guillotine usage then spread to other countries such as Germany (where it had been used since before the revolution), Italy, Sweden (used in a single execution), the Netherlands and French colonies in Africa, Canada, French Guiana and French Indochina. Although other governments employed the device, France has executed more people by guillotine than any other nation.
Penal Code of 1791
On October 6, 1791, the Penal Code of 1791 was enacted, which abolished capital punishment in the Kingdom of France for bestiality, blasphemy, heresy, pederasty, sacrilege, sodomy, and witchcraft.
1939 onwards
Public executions were the norm and continued until 1939. From the mid-19th century, the usual time of day for executions changed from around 3 pm to morning and then to dawn. Executions had been carried out in large central public spaces such as market squares but gradually moved towards the local prison. In the early 20th century, the guillotine was set up just outside the prison gates. The last person to be publicly guillotined was six-time murderer Eugen Weidmann who was executed on 17 June 1939 outside the St-Pierre prison in Versailles. Photographs of the execution appeared in the press, and apparently this spectacle led the government to stop public executions and to hold them instead in prison courtyards, such as La Santé Prison in Paris. Following the law, the first to be guillotined inside a prison was Jean Dehaene, who had murdered his estranged wife and father-in-law, executed on 19 July 1939 at St-Brieuc.
The 1940s and the wartime period saw an increase in the number of executions, including the first executions of women since the 19th century.
Marie-Louise Giraud was executed on 30 July 1943 for being an abortion provider, which was labeled a crime against state security.
In the 1950s to the 1970s, the number of executions steadily decreased, with for example President Georges Pompidou, between 1969 and 1974, giving clemency to all but three people out of the fifteen sentenced to death. President Valéry Giscard d'Estaing oversaw the last executions.
Up to 1981, the French penal code stated that:
Article 12: "Any person sentenced to death shall be decapitated."
Article 13: "By exception to article 12, when the death penalty is handed down for crimes against the safety of the State, execution shall take place by firing squad."
Article 14: "If the families of the executed persons wish to reclaim the bodies, they shall have them; it shall then be for them to have them buried without any pomp."
In addition, crimes such as treason, espionage, insurrection, piracy, aggravated murder, kidnapping with torture, felonies committed with the use of torture, setting a bomb in a street, arson of a dwelling house, and armed robbery made their authors liable to the death penalty; moreover, committing some military offenses such as mutiny or desertion or being accomplice or attempting to commit a capital felony were also capital offenses.
Clemency
The right to commute death sentences belonged exclusively to the President of the Republic, whereas it had belonged exclusively to the monarch in earlier ages.
President Charles de Gaulle, who supported capital punishment, commuted 24 death sentences. During his term of office, 24 people were guillotined, 4 others executed by firing squad for crimes against the security of the state, while 3 other were reprieved by amnesty in 1968. The last of those executed by firing squad was OAS member Lt. Colonel Jean-Marie Bastien-Thiry, who was an organizer of the infamous assassination attempt on de Gaulle in 1962.
No executions took place during two-term Interim President Alain Poher, in 1969 and 1974.
President Georges Pompidou, who opposed capital punishment, commuted all but three death sentences imposed during his term.
President Valéry Giscard d'Estaing, who stated that he "felt a deep aversion to the death penalty", also commuted all but three death sentences. He was President at the time of the last execution in France.
Amnesty
Parliament (rather than the executive) held the power to grant amnesty for death sentences. One example of general amnesty for all people sentenced to death and awaiting execution took place in 1959 after de Gaulle's inauguration when an Act of Parliament commuted all such sentences.
Abolition
The first official debate on the death penalty in France took place on 30 May 1791 with the presentation of a bill aimed at abolishing it. The advocate was Louis-Michel Lepeletier of Saint-Fargeau and revolutionary leader Maximilien de Robespierre supported the bill. However, the National Constituent Assembly, on 6 October 1791, refused to abolish the death penalty. Soon after, tens of thousands of people of various social classes would be executed by guillotine during the Reign of Terror.
On 26 October 1795, the National Convention abolished capital punishment, but only to signify the day of general peace. The death penalty was reinstated on 12 February 1810, under Emperor Napoleon I, in the French Imperial Penal Code.
In 1848, the provisional government of the French Second Republic, established by the February Revolution, decreed the abolition of the death penalty for political crimes.
President Armand Fallières, a supporter of abolition, systematically pardoned every convict condemned to death over the first three years of his term (1906-1913). In 1906 the Commission of the Budget of the Chamber of Deputies voted for withdrawing funding for the guillotine, with the aim of stopping the execution procedure. On 3 July 1908 the Garde des Sceaux, Aristide Briand, submitted a draft law to the Deputies, dated November 1906, on the abolition of the death penalty. Despite the support of Jean Jaurès, the bill was rejected on 8 December by 330 votes to 201.
Under the pro-Nazi Vichy Regime, Marshal Pétain refused to pardon five women due to be guillotined; no woman had been guillotined in France in over five decades. Pétain was himself sentenced to death following the overthrow of the Vichy Regime, but General Charles de Gaulle commuted Pétain's sentence to life imprisonment on the grounds of his old age (89 years), as well as his previous military duty during the First World War. Other Vichy officials, including notably Pierre Laval, were not so fortunate and were shot. Under Vincent Auriol's presidency, three more women were beheaded, one in Algeria and two in France. The last Frenchwoman to be beheaded (Germaine Leloy-Godefroy) was executed in Angers in 1949. In 1963, Lt. Colonel Jean-Marie Bastien-Thiry became the last person to be executed by a firing squad.
Defended by lawyer Robert Badinter, child murderer Patrick Henry narrowly escaped being condemned to death on 20 January 1977, and numerous newspapers predicted the end of the death penalty. On 10 September 1977, Hamida Djandoubi was guillotined and became both the last person executed in France as well as the last person executed by beheading in the Western world, and by any means in Western Europe. On September 18, 1981, Badinterthe new Minister of Justiceproposed the final abolition of the death penalty in the Assemblée Nationale, the same day as the newly-elected socialist president François Mitterrand backed his efforts, and the Assemblée Nationale finally pushed abolition through that same year. Badinter had been a longtime opponent of capital punishment and the defense attorney of some of the last men to be executed.
Abolition process in 1981
16 March 1981: During the presidential election campaign, François Mitterrand declared that he was against the death penalty. This was taken up in the Socialist Party's 110 Propositions for France electoral program, along with other justice reforms.
19 March: The last sentence of death (against Philippe Maurice) was confirmed by the court of cassation, the last to gain legal force.
10 May: Mitterrand was elected President in the second round against Valery Giscard d'Estaing.
25 May: François Mitterrand pardoned Philippe Maurice, commuting the sentence to life imprisonment. He was released on license in 2000.
26 August: the Council of Ministers approved the bill to abolish the death penalty.
17 September: Robert Badinter presented the bill to the Assemblée Nationale. It passed on 18 September, by 363 votes to 117.
28 September: The cour d'assises of Haut-Rhin issued the very last sentence of death against tailor Jean-Michel Marx for attempted murder. A total of four sentences of death were issued by the lower courts after Philippe's case, but never ratified by the Court of cassation. On the same day, Robert Badinter presented his bill to abolish the death penalty before the Sénat.
30 September: several amendments were rejected in the Sénat. The law was officially passed by the two chambers.
9 October: the law was promulgated and all seven remaining sentences commuted. The last Western European country to practise the death penalty abolished it.
Current status
Today, the death penalty has been abolished in France. Although a few modern-day French politicians (notably the far-right Front national former leader Jean-Marie Le Pen) advocate restoring the death penalty, its re-establishment would not be possible without the unilateral French rejection of several international treaties. (Repudiation of international treaties is not unknown to the French system, as France renounced its obligations under the NATO treaty in 1966, though it rejoined the pact in 2009.)
On 20 December 1985, France ratified Additional Protocol number 6 to the European Convention to Safeguard Human Rights and fundamental liberties. This prevents France from re-establishing the death penalty, except in times of war or by denouncing the Convention.
On 21 June 2001, Jacques Chirac sent a letter to the association "Ensemble" saying he was against the death penalty: "It's a fight we have to lead with determination and conviction, because no justice is infallible and each execution can kill an innocent; because nothing can legitimise the execution of minors or of people suffering from mental deficiencies; because death can never constitute an act of justice." On 3 May 2002, France and 30 other countries signed Protocol number 13 to the European Convention on Human Rights. This forbids the death penalty in all circumstances, even in times of war. It went into effect on 1 July 2003, after having been ratified by 10 states.
Despite these efforts, in 2004, a law proposition (number 1521) was placed before the French National Assembly, suggesting re-establishment of the death penalty for terrorist acts. The bill was not adopted. On 3 January 2006, Jacques Chirac announced a revision of the Constitution aimed at writing out the death penalty. (On the previous 13 October, the Constitutional Council had deemed the ratification of the Second Optional Protocol to the international pact necessitated such a revision of the Constitution. The protocol concerned civil and political rights aimed at abolishing the death penalty.)
On 19 February 2007, the Congress of the French Parliament (the National Assembly and the Senate, reunited for the day) voted overwhelmingly for a modification of the Constitution stating that "no one can be sentenced to the death penalty." There were 828 votes for the modification, and 26 against. The amendment entered the Constitution on 23 February.
Variations in French opinion
During the 20th century, French opinion on the death penalty has greatly changed, as many polls have showed large differences from one time to another.
In 1908, Le Petit Parisien published a poll in which 77% of people asked were in favour of the death penalty.
In 1960, a survey from the IFOP showed that 50% of the French were against, while 39% were for.
In 1972, in a survey from the same institute, 27% of those surveyed were for abolition while 63% were for capital punishment.
In 1981, Le Figaro carried out a survey the day after the vote for abolition. It indicated that 62% of the French were for maintaining the death penalty.
In 1998, IFOP's and France-Soir'''s survey showed that opinions were split in half, with 54% against the death penalty and 44% for it.
In 2006, TNS Sofres survey show opposition of the French people to death penalty generally: 52% are now against death penalty and 41% are pro-death penalty.
In 2007, according to Angus Reid Global Monitor, 52% of French are anti-death penalty and 45% are pro-death penalty.
In 2013, a Opinionway survey shows that 50% of the French people support re-introduction of the death penalty, up from 45% in 2012 and 35% in 2011.
In 2020, a Ipsos/Sopra Steria survey showed that 55% of the French people support re-introduction of the death penalty. The survey found that 85% percent of voters of the National Rally party (RN) support the death penalty, with 71% for the conservative party Les Républicains, and 39% for voters of the liberal LREM, the Socialist Party, the green EELV and the far-left LFI.
Executions from 1958 to abolition
The following people were executed during the Fifth Republic (between 1959 and 1977), making them the last executed people in France.
Notable opponents
Michel de Montaigne (writer and philosopher)
Voltaire (writer and philosopher)
Nicolas de Condorcet (philosopher)
Victor Hugo (writer and politician)
Alphonse de Lamartine (writer and politician)
Léon Gambetta (politician)
Joseph Reinach (politician)
Jean Jaurès (Socialist leader)
Aristide Briand (politician, long-time President of the Council and Minister)
Gaston Leroux (writer)
Albert Camus (writer)
Noëlla Rouget (French Resistance member and teacher)
Michel Foucault (philosopher)
Robert Badinter (attorney and Minister of Justice)
Julien Clerc (singer)
Notable advocates
Francis I of France (King of France)
Catherine de' Medici (Queen Regent and Queen consort of France)
Henry IV of France (King of France)
Cardinal Richelieu (Prime Minister of France)
Louis XIII (King of France)
Louis XIV (King of France)
Louis XV (King of France)
Charles de Secondat, baron de Montesquieu (philosopher)
Jean-Jacques Rousseau (philosopher)
Louis XVI (King of France, then King of the French)
Marie Antoinette (Queen consort of France)
Napoleon Bonaparte (Emperor of the French)
Napoleon III (Emperor of the French)
Louis XVIII (King of the French)
Charles X (King of France)
Louis-Philippe I (King of the French)
Joseph De Maistre (philosopher and diplomat)
Alexis De Tocqueville (philosopher and diplomat)
Benjamin Constant (philosopher and politician)
Auguste Comte (philosopher)
Maurice Barrès (writer and politician)
Charles Maurras (writer and philosopher)
Philippe Petain (leader of Vichy France)
Charles de Gaulle (President) (only for men; commuted half of the sentences)
Jean-Marie Le Pen (politician)
Alain Madelin (politician)
Robert Ménard (politician)
Éric Zemmour (writer and journalist)
References
Bibliography
Klemettilä, Hannele: The executioner in late medieval French culture''. Turun yliopiston julkaisuja. Sarja B, Humaniora. vol.268. Tuku: Turun Yliplisto, 2003. .
Law enforcement in France
1981 in France
1981 disestablishments in France
Death in France
|
```turing
#require no-eden
$ eagerepo
Set up test environment.
$ configure mutation
$ enable amend rebase tweakdefaults
$ mkcommit() {
> echo "$1" > "$1"
> hg add "$1"
> echo "add $1" > msg
> hg ci -l msg
> }
$ reset() {
> cd ..
> rm -rf userestack
> hg init userestack
> cd userestack
> }
$ showgraph() {
> hg log --graph -r '(::.)::' -T "{desc|firstline}" | sed \$d
> }
$ hg init userestack && cd userestack
Test that no preamend bookmark is created.
$ mkcommit a
$ mkcommit b
$ mkcommit c
$ mkcommit d
$ hg up 7c3bad9141dcb46ff89abf5f61856facd56e476c
0 files updated, 0 files merged, 2 files removed, 0 files unresolved
$ hg amend -m "amended" --no-rebase
hint[amend-restack]: descendants of 7c3bad9141dc are left behind - use 'hg restack' to rebase them
hint[hint-ack]: use 'hg hint --ack amend-restack' to silence these hints
$ hg book
no bookmarks set
Test hg amend --fixup.
$ showgraph
@ amended
o add d
o add c
x add b
o add a
$ hg amend --fixup
warning: --fixup is deprecated and WILL BE REMOVED. use 'hg restack' instead.
rebasing 4538525df7e2 "add c"
rebasing 47d2a3944de8 "add d"
$ showgraph
o add d
o add c
@ amended
o add a
Test that the operation field on the metadata is correctly set.
$ hg debugmutation -r "all()"
* 1f0dee641bb7258c56bd60e93edfa2405381c41e
* amend by test at 1970-01-01T00:00:00 from: (glob)
7c3bad9141dcb46ff89abf5f61856facd56e476c
* rebase by test at 1970-01-01T00:00:00 from: (glob)
4538525df7e2b9f09423636c61ef63a4cb872a2d
* rebase by test at 1970-01-01T00:00:00 from: (glob)
47d2a3944de8b013de3be9578e8e344ea2e6c097
Test hg amend --rebase
$ hg amend -m "amended again" --rebase
rebasing * "add c" (glob)
rebasing * "add d" (glob)
$ showgraph
o add d
o add c
@ amended again
o add a
```
|
```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 discovery
import (
"github.com/montanaflynn/stats"
"github.com/openark/golib/log"
)
// AggregatedQueueMetrics contains aggregate information some part queue metrics
type AggregatedQueueMetrics struct {
ActiveMinEntries float64
ActiveMeanEntries float64
ActiveMedianEntries float64
ActiveP95Entries float64
ActiveMaxEntries float64
QueuedMinEntries float64
QueuedMeanEntries float64
QueuedMedianEntries float64
QueuedP95Entries float64
QueuedMaxEntries float64
}
// we pull out values in ints so convert to float64 for metric calculations
func intSliceToFloat64Slice(someInts []int) stats.Float64Data {
var slice stats.Float64Data
for _, v := range someInts {
slice = append(slice, float64(v))
}
return slice
}
// DiscoveryQueueMetrics returns some raw queue metrics based on the
// period (last N entries) requested.
func (q *Queue) DiscoveryQueueMetrics(period int) []QueueMetric {
q.Lock()
defer q.Unlock()
// adjust period in case we ask for something that's too long
if period > len(q.metrics) {
log.Debugf("DiscoveryQueueMetrics: wanted: %d, adjusting period to %d", period, len(q.metrics))
period = len(q.metrics)
}
a := q.metrics[len(q.metrics)-period:]
log.Debugf("DiscoveryQueueMetrics: returning values: %+v", a)
return a
}
// AggregatedDiscoveryQueueMetrics Returns some aggregate statistics
// based on the period (last N entries) requested. We store up to
// config.Config.DiscoveryQueueMaxStatisticsSize values and collect once
// a second so we expect period to be a smaller value.
func (q *Queue) AggregatedDiscoveryQueueMetrics(period int) *AggregatedQueueMetrics {
wanted := q.DiscoveryQueueMetrics(period)
var activeEntries, queuedEntries []int
// fill vars
for i := range wanted {
activeEntries = append(activeEntries, wanted[i].Active)
queuedEntries = append(queuedEntries, wanted[i].Queued)
}
a := &AggregatedQueueMetrics{
ActiveMinEntries: min(intSliceToFloat64Slice(activeEntries)),
ActiveMeanEntries: mean(intSliceToFloat64Slice(activeEntries)),
ActiveMedianEntries: median(intSliceToFloat64Slice(activeEntries)),
ActiveP95Entries: percentile(intSliceToFloat64Slice(activeEntries), 95),
ActiveMaxEntries: max(intSliceToFloat64Slice(activeEntries)),
QueuedMinEntries: min(intSliceToFloat64Slice(queuedEntries)),
QueuedMeanEntries: mean(intSliceToFloat64Slice(queuedEntries)),
QueuedMedianEntries: median(intSliceToFloat64Slice(queuedEntries)),
QueuedP95Entries: percentile(intSliceToFloat64Slice(queuedEntries), 95),
QueuedMaxEntries: max(intSliceToFloat64Slice(queuedEntries)),
}
log.Debugf("AggregatedDiscoveryQueueMetrics: returning values: %+v", a)
return a
}
```
|
```objective-c
//
//
//
// path_to_url
//
// or in the "license" file accompanying this file. This file is distributed
// on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
//
// RootViewController.m
//
#import "RootViewController.h"
@implementation RootViewController
{
NSArray *array;
NSArray *titles;
}
- (void)viewDidLoad {
[super viewDidLoad];
[self.navigationItem setTitle:@"Style Dictionary Example"];
array = @[[ColorViewController class], [IconsViewController class], [SizeViewController class], [PropertiesViewController class]];
titles = @[@"Colors", @"Icons", @"Sizes", @"All Properties"];
UIScrollView *scrollView = [[UIScrollView alloc] initWithFrame:CGRectMake(0, 0, self.view.frame.size.width, self.view.frame.size.height)];
[self.view addSubview:scrollView];
UIStackView *stackView = [[UIStackView alloc] init];
stackView.axis = UILayoutConstraintAxisVertical;
stackView.distribution = UIStackViewDistributionEqualSpacing;
stackView.alignment = UIStackViewAlignmentLeading;
stackView.spacing = StyleDictionarySizePaddingLarge;
stackView.translatesAutoresizingMaskIntoConstraints = false;
[scrollView addSubview:stackView];
[stackView.topAnchor constraintEqualToAnchor:scrollView.topAnchor constant:StyleDictionarySizePaddingBase].active = true;
[stackView.leftAnchor constraintEqualToAnchor:scrollView.leftAnchor constant:StyleDictionarySizePaddingBase].active = true;
[stackView.rightAnchor constraintEqualToAnchor:scrollView.rightAnchor constant:StyleDictionarySizePaddingBase].active = true;
[stackView.bottomAnchor constraintEqualToAnchor:scrollView.bottomAnchor].active = true;
[stackView.widthAnchor constraintEqualToConstant:scrollView.frame.size.width - (StyleDictionarySizePaddingBase *2)].active = true;
for (int i = 0; i < [titles count]; i++) {
StyleDictionaryButton *button = [StyleDictionaryButton primaryButton];
[button setTitle:titles[i] forState:UIControlStateNormal];
[button addTarget:self action:@selector(linkAction:) forControlEvents:UIControlEventTouchUpInside];
[stackView addArrangedSubview:button];
[button.widthAnchor constraintEqualToAnchor:stackView.widthAnchor].active = YES;
}
}
- (void)linkAction:(StyleDictionaryButton *)sender {
NSUInteger index = [titles indexOfObject:sender.titleLabel.text];
Class nextClass = array[index];
UIViewController *nextController = [[nextClass alloc] init];
if ([nextController isKindOfClass:[PropertiesViewController class]]) {
((PropertiesViewController *)nextController).properties = [StyleDictionaryProperties properties];
((PropertiesViewController *)nextController).name = @"All Properties";
}
[[self navigationController] pushViewController:nextController animated:YES];
}
@end
```
|
```objective-c
#ifndef VALHALLA_MJOLNIR_GRAPHTILEBUILDER_H_
#define VALHALLA_MJOLNIR_GRAPHTILEBUILDER_H_
#include <algorithm>
#include <boost/functional/hash.hpp>
#include <cstdint>
#include <list>
#include <memory>
#include <string>
#include <unordered_map>
#include <utility>
#include <valhalla/baldr/admin.h>
#include <valhalla/baldr/graphid.h>
#include <valhalla/baldr/graphtile.h>
#include <valhalla/baldr/graphtileheader.h>
#include <valhalla/baldr/nodetransition.h>
#include <valhalla/baldr/sign.h>
#include <valhalla/baldr/signinfo.h>
#include <valhalla/baldr/transitdeparture.h>
#include <valhalla/baldr/transitroute.h>
#include <valhalla/baldr/transitschedule.h>
#include <valhalla/baldr/transitstop.h>
#include <valhalla/baldr/turnlanes.h>
#include <valhalla/mjolnir/complexrestrictionbuilder.h>
#include <valhalla/mjolnir/directededgebuilder.h>
#include <valhalla/mjolnir/edgeinfobuilder.h>
#include <valhalla/mjolnir/landmarks.h>
namespace valhalla {
namespace mjolnir {
using edge_tuple = std::tuple<uint32_t, baldr::GraphId, baldr::GraphId>;
/**
* Graph information for a tile within the Tiled Hierarchical Graph.
*/
class GraphTileBuilder : public baldr::GraphTile {
public:
/**
* Constructor given an existing tile. This is used to read in the tile
* data and then add to it (e.g. adding node connections between hierarchy
* levels. If the deserialize flag is set then all objects are serialized
* from memory into builders that can be added to and then stored using
* StoreTileData.
* @param tile_dir Base directory path
* @param graphid GraphId used to determine the tileid and level
* @param deserialize If true the existing objects in the tile are
* converted into builders so they can be added to.
* @param serialize_turn_lanes If true, the offsets are truly text offsets.
* If false, the offsets are indexes into unique name file
*/
GraphTileBuilder(const std::string& tile_dir,
const GraphId& graphid,
const bool deserialize,
bool serialize_turn_lanes = true);
/**
* Output the tile to file. Stores as binary data.
* @param graphid GraphID to store.
* @param hierarchy Gives info about number of tiles per level
*/
void StoreTileData();
/**
* Update a graph tile with new nodes and directed edges. Assumes no new
* nodes or edges are added. Attributes within existing nodes and edges
* are updated. This is used in GraphValidator to update directed edge
* information.
* @param nodes Updated list of nodes
* @param directededges Updated list of edges.
*/
void Update(const std::vector<NodeInfo>& nodes, const std::vector<DirectedEdge>& directededges);
/**
* Get the current list of node builders.
* @return Returns the node info builders.
*/
std::vector<NodeInfo>& nodes();
/**
* Gets the current list of directed edge (builders).
* @return Returns the directed edge builders.
*/
std::vector<DirectedEdge>& directededges();
/**
* Gets the current list of directed edge extension (builders).
* @return Returns the directed edge extension builders.
*/
std::vector<DirectedEdgeExt>& directededges_ext();
/**
* Gets the current list of node transition (builders).
* @return Returns a reference to node transition builders.
*/
std::vector<NodeTransition>& transitions() {
return transitions_builder_;
}
/**
* Add a transit departure.
* @param departure Transit departure record.
*/
void AddTransitDeparture(const baldr::TransitDeparture& departure);
/**
* Add a transit stop.
* @param stop Transit stop record.
*/
void AddTransitStop(const baldr::TransitStop& stop);
/**
* Add a transit route.
* @param route Transit route record.
*/
void AddTransitRoute(const baldr::TransitRoute& route);
/**
* Add a transit schedule.
* @param schedule Transit schedule record.
*/
void AddTransitSchedule(const baldr::TransitSchedule& schedule);
/**
* Add an access restriction.
* @param access_restriction Access Restriction record.
*/
void AddAccessRestriction(const baldr::AccessRestriction& access_restriction);
/**
* Add restriction.
* @param restrictions Access restrictions
*/
void AddAccessRestrictions(const std::vector<AccessRestriction>& restrictions);
/**
* Add sign information.
* @param idx Directed edge index.
* @param signs Sign information.
*/
void AddSigns(const uint32_t idx,
const std::vector<baldr::SignInfo>& signs,
const std::vector<std::string>& linguistics);
/**
* Add sign information.
* @param idx Directed edge index.
* @param signs Sign information.
*/
void AddSigns(const uint32_t idx, const std::vector<baldr::SignInfo>& signs);
/**
* Add lane connectivity information.
* @param idx Directed edge index.
* @param lc Lane connectivity information.
*/
void AddLaneConnectivity(const std::vector<baldr::LaneConnectivity>& lc);
/**
* Add forward complex restriction.
* @param res Complex restriction.
*/
void AddForwardComplexRestriction(const ComplexRestrictionBuilder& res);
/**
* Add reverse complex restriction.
* @param res Complex restriction.
*/
void AddReverseComplexRestriction(const ComplexRestrictionBuilder& res);
/**
*
* @param edgeindex The index of the edge - used with nodea and nodeb to
* form tuple that uniquely identifies the edge info since
* there are two directed edges per edge info.
* @param nodea One of two nodes - used with edgeindex and nodeb to
* form tuple that uniquely identifies the edge info since
* there are two directed edges per edge info.
* @param nodeb One of two nodes - used with edgeindex and nodea to
* form tuple that uniquely identifies the edge info since
* there are two directed edges per edge info.
* @param edge_info_offset the index of the edge info within the tile
*
* @return The edge info offset that will be stored in the directed edge.
*/
bool HasEdgeInfo(const uint32_t edgeindex,
const baldr::GraphId& nodea,
const baldr::GraphId& nodeb,
uint32_t& edge_info_offset);
/**
* Process Tagged values for the edge.
* @param edgeindex The edgeindex we are processing.
* @param names The names to add.
* @param name_count The current name count.
* @param name_info_list The list to add the name infos
*/
void ProcessTaggedValues(const uint32_t edgeindex,
const std::vector<std::string>& names,
size_t& name_count,
std::vector<NameInfo>& name_info_list);
/**
* Add the edge info to the tile.
*
* @param edgeindex The index of the edge - used with nodea and nodeb to
* form tuple that uniquely identifies the edge info since
* there are two directed edges per edge info.
* @param nodea One of two nodes - used with edgeindex and nodeb to
* form tuple that uniquely identifies the edge info since
* there are two directed edges per edge info.
* @param nodeb One of two nodes - used with edgeindex and nodea to
* form tuple that uniquely identifies the edge info since
* there are two directed edges per edge info.
* @param wayid The target edge is part of this the way id.
* @param elev Mean elevation.
* @param bn Bike network.
* @param spd Speed limit. [kph]
* @param lls The shape of the target edge.
* @param names The names of the target edge.
* @param linguistics The pronunciations and languages of the target edge.
* @param types Bits indicating if the name is a ref vs a name.
* @param added Set to true if the target edge was newly added to the list,
* set to false if the target edge was already in the list.
* @param diff_names Indicates the opposing direction has different names.
* If true a new EdgeInfo is always added.
* @return The edge info offset that will be stored in the directed edge.
*/
template <class shape_container_t>
uint32_t AddEdgeInfo(const uint32_t edgeindex,
baldr::GraphId nodea,
baldr::GraphId nodeb,
const uint64_t wayid,
const float elev,
const uint32_t bn,
const uint32_t spd,
const shape_container_t& lls,
const std::vector<std::string>& names,
const std::vector<std::string>& tagged_values,
const std::vector<std::string>& linguistics,
const uint16_t types,
bool& added,
bool diff_names = false);
/**
* Add the edge info to the tile. This method accepts an encoded shape string.
* @param edgeindex The index of the edge - used with nodea and nodeb to
* form tuple that uniquely identifies the edge info since
* there are two directed edges per edge info.
* @param nodea One of two nodes - used with edgeindex and nodeb to
* form tuple that uniquely identifies the edge info since
* there are two directed edges per edge info.
* @param nodeb One of two nodes - used with edgeindex and nodea to
* form tuple that uniquely identifies the edge info since
* there are two directed edges per edge info.
* @param wayid The target edge is part of this the way id.
* @param elev Mean elevation.
* @param bn Bike network.
* @param spd Speed limit.
* @param llstr The shape of the target edge as an encoded string.
* @param names The names of the target edge.
* @param tagged_values The tagged names of the target edge.
* @param linguistics The pronunciations and languages of the target edge.
* @param types Bits indicating if the name is a ref vs a name.
* @param added Set to true if the target edge was newly added to the list,
* set to false if the target edge was already in the list.
* @param diff_names Indicates the opposing direction has different names.
* If true a new EdgeInfo is always added.
* @return The edge info offset that will be stored in the directed edge.
*/
uint32_t AddEdgeInfo(const uint32_t edgeindex,
baldr::GraphId nodea,
baldr::GraphId nodeb,
const uint64_t wayid,
const float elev,
const uint32_t bn,
const uint32_t spd,
const std::string& llstr,
const std::vector<std::string>& names,
const std::vector<std::string>& tagged_values,
const std::vector<std::string>& linguistics,
const uint16_t types,
bool& added,
bool diff_names = false);
/**
* Set the mean elevation in the most recently added EdgeInfo.
* @param elev Mean elevation.
*/
void set_mean_elevation(const float elev);
/**
* Set mean elevation and encoded elevation within the EdgeInfo given the edge info offset.
* This requires a serialized tile builder.
* @param offset Edge info offset.
* @param mean_elevation Mean elevation.
* @param encoded_elevation Encoded elevation.
* @return Returns size of the updated EdgeInfo data.
*/
uint32_t set_elevation(const uint32_t offset,
const float mean_elevation,
const std::vector<int8_t>& encoded_elevation);
/**
* Add a name to the text list.
* @param name Name/text to add.
* @return Returns offset (bytes) to the name.
*/
uint32_t AddName(const std::string& name);
/**
* Add admin info to the tile.
* @param country_name Country name of the admin
* @param state_name State name of the admin
* @param country_iso Country ISO Code. ISO3166-1
* @param state_iso State ISO Code. ISO3166-2 Example://
* Prince Edward Island = PE
* Country ISO + dash + state ISO will give
* you ISO3166-2 for state.
* @return The admin offset that will be stored on the node.
*/
uint32_t AddAdmin(const std::string& country_name,
const std::string& state_name,
const std::string& country_iso,
const std::string& state_iso);
/**
* Gets a reference to the header builder.
* @return Returns a reference to the header builder.
*/
GraphTileHeader& header_builder();
/**
* Gets a node from an existing tile.
* @param idx Index of the node within the tile.
* @return Returns a reference to the node builder.
*/
NodeInfo& node(const size_t idx);
/**
* Get the node at the specified index.
* @param idx Index of the node builder.
* @return Returns a reference to the node builder.
*/
NodeInfo& node_builder(const size_t idx);
/**
* Gets a directed edge from existing tile data.
* @param idx Index of the directed edge within the tile.
* @return Returns a reference to the directed edge.
*/
DirectedEdge& directededge(const size_t idx);
/**
* Gets a directed edge extension from existing tile data.
* @param idx Index of the directed edge extension within the tile.
* @return Returns a reference to the directed edge extension.
*/
DirectedEdgeExt& directededge_ext(const size_t idx);
/**
* Gets a pointer to directed edges within the list being built.
* @param idx Index of the directed edge within the tile.
* @return Returns a pointer to the directed edge builder (allows
* accessing all directed edges from a node).
*/
const DirectedEdge* directededges(const size_t idx) const;
/**
* Gets a pointer to directed edge extensions within the list being built.
* @param idx Index of the directed edge within the tile.
* @return Returns a pointer to the directed edge extension builder (allows
* accessing all directed edge extensions from a node).
*/
const DirectedEdgeExt* directededges_ext(const size_t idx) const;
/**
* Get the directed edge builder at the specified index.
* @param idx Index of the directed edge builder.
* @return Returns a reference to the directed edge builder.
*/
DirectedEdge& directededge_builder(const size_t idx);
/**
* Get the directed edge extension builder at the specified index.
* @param idx Index of the directed edge extension builder.
* @return Returns a reference to the directed edge extension builder.
*/
DirectedEdgeExt& directededge_ext_builder(const size_t idx);
/**
* Gets a non-const access restriction from existing tile data.
* @param idx Index of the restriction (index in the array, not the
* directed edge index) within the tile.
* @return Returns a reference to the access restriction.
*/
AccessRestriction& accessrestriction(const size_t idx);
/**
* Gets an access restriction builder at the specified index.
* @param idx Index of the restriction (index in the array, not the
* directed edge index) within the tile.
* @return Returns a reference to the access restriction (builder).
*/
AccessRestriction& accessrestriction_builder(const size_t idx);
/**
* Gets a non-const sign (builder) from existing tile data.
* @param idx Index of the sign (index in the array, not the
* directed edge index) within the tile.
* @return Returns a reference to the sign builder.
*/
valhalla::baldr::Sign& sign(const size_t idx);
/**
* Get the sign builder at the specified index.
* @param idx Index of the sign builder.
* @return Returns a reference to the sign builder.
*/
valhalla::baldr::Sign& sign_builder(const size_t idx);
/**
* Gets a const admin builder at specified index.
* @param idx Index of the admin builder in the list.
*/
const Admin& admins_builder(size_t idx);
/**
* Sets the tile creation date.
* @param tile_creation_date number of days from pivot date
*/
void AddTileCreationDate(const uint32_t tile_creation_date);
/**
* Generates bin information for the edges in the provided tile
* @param hierarchy to perform the intersection with the bins' geoms
* @param tile the tile whose edges need the binned
* @param tweeners the additional bins in other tiles that intersect this tiles edges
*/
using tweeners_t = std::unordered_map<GraphId, std::array<std::vector<GraphId>, kBinCount>>;
static std::array<std::vector<GraphId>, kBinCount> BinEdges(const graph_tile_ptr& tile,
tweeners_t& tweeners);
/**
* Adds to the bins the tile already has, only modifies the header to reflect the new counts
* and the bins themselves, everything else is copied directly without ever looking at it
* @param tile_dir Base tile directory
* @param tile the tile that needs the bins added
* @param more_bins the extra bin data to append to the tile
*/
static void AddBins(const std::string& tile_dir,
const graph_tile_ptr& tile,
const std::array<std::vector<GraphId>, kBinCount>& more_bins);
/**
* Get the turn lane builder at the specified index.
* @param idx Index of the turn lane builder.
* @return Returns a reference to the turn lane builder.
*/
TurnLanes& turnlane_builder(const size_t idx);
/**
* Add turn lane information for a directed edge.
* @param idx Directed edge index.
* @param str Turn lane information.
*/
void AddTurnLanes(const uint32_t idx, const std::string& str);
/**
* Add turn lane information for a directed edge.
* @param idx Directed edge index.
* @param tl_idx Turn lane index into the OSMData name_offset map
*/
void AddTurnLanes(const uint32_t idx, const uint32_t tl_idx);
/**
* Add turn lanes
* @param turn_lanes vector of turn lanes
*/
void AddTurnLanes(const std::vector<TurnLanes>& turn_lanes);
/**
* Add a predicted speed profile for a directed edge.
* @param idx Edge Id within the tile.
* @param profile Compressed profile (200 short int)
* @param predicted_count_hint How many predicted speeds should we expect to add
*/
void AddPredictedSpeed(const uint32_t idx,
const std::array<int16_t, kCoefficientCount>& coefficients,
const size_t predicted_count_hint = 256);
/**
* Updates a tile with predictive speed data. Also updates directed edges with
* free flow and constrained flow speeds and the predicted traffic flag. The
* predicted traffic is written after turn lane data.
* @param directededges Updated directed edge information.
*/
void UpdatePredictedSpeeds(const std::vector<DirectedEdge>& directededges);
/**
* Adds a landmark to the given edge id by modifying its edgeinfo to add a name and tagged value
*
* @param edge_id the edge id to modify
* @param landmark the landmark to associate to the edge
*/
void AddLandmark(const baldr::GraphId& edge_id, const Landmark& landmark);
/**
* Is there an opposing edge with matching edgeinfo offset. The end node of the directed edge
* must be in the same tile as the directed edge. This is called during the building of the
* tiles; therefore, we can't use GetOpposingEdgeId as it has not been set yet.
* @param tile Graph tile of the edge
* @param directededge Directed edge to check.
*/
bool OpposingEdgeInfoDiffers(const graph_tile_ptr& tile, const DirectedEdge* edge);
protected:
struct EdgeTupleHasher {
std::size_t operator()(const edge_tuple& k) const {
std::size_t seed = 13;
boost::hash_combine(seed, index_hasher(std::get<0>(k)));
boost::hash_combine(seed, id_hasher(std::get<1>(k)));
boost::hash_combine(seed, id_hasher(std::get<2>(k)));
return seed;
}
// function to hash each id
std::hash<uint32_t> index_hasher;
std::hash<valhalla::baldr::GraphId> id_hasher;
};
// Edge tuple for sharing edges that have common nodes and edgeindex
static edge_tuple EdgeTuple(const uint32_t edgeindex,
const valhalla::baldr::GraphId& nodea,
const valhalla::baldr::GraphId& nodeb) {
return (nodea < nodeb) ? std::make_tuple(edgeindex, nodea, nodeb)
: std::make_tuple(edgeindex, nodeb, nodea);
}
// Write all edgeinfo items to specified stream
void SerializeEdgeInfosToOstream(std::ostream& out) const;
// Write all textlist items to specified stream
void SerializeTextListToOstream(std::ostream& out) const;
// Base tile directory
std::string tile_dir_;
// Header information for the tile
GraphTileHeader header_builder_;
// List of nodes. This is a fixed size structure so it can be
// indexed directly.
std::vector<NodeInfo> nodes_builder_;
// List of directed edges. This is a fixed size structure so it can be
// indexed directly.
std::vector<DirectedEdge> directededges_builder_;
// Optional list of directed edge extended attributes. If this is used it must be the same size
// as the directededges_builder.
std::vector<DirectedEdgeExt> directededges_ext_builder_;
// List of node transitions. This is a fixed size structure so it can be
// indexed directly.
std::vector<NodeTransition> transitions_builder_;
// List of transit departures. Sorted by directed edge Id and
// departure time
std::vector<baldr::TransitDeparture> departure_builder_;
// Transit stops.
std::vector<baldr::TransitStop> stop_builder_;
// Transit route.
std::vector<baldr::TransitRoute> route_builder_;
// Transit schedules.
std::vector<baldr::TransitSchedule> schedule_builder_;
// List of restrictions. Sorted by directed edge Id
std::vector<baldr::AccessRestriction> access_restriction_builder_;
// List of signs. This is a fixed size structure so it can be
// indexed directly.
std::vector<valhalla::baldr::Sign> signs_builder_;
// List of admins. This is a fixed size structure so it can be
// indexed directly.
std::vector<Admin> admins_builder_;
// Admin info offset
std::unordered_map<std::string, size_t> admin_info_offset_map_;
// The forward complex restriction list
std::vector<ComplexRestrictionBuilder> complex_restriction_forward_builder_;
// The reverse complex restriction list
std::vector<ComplexRestrictionBuilder> complex_restriction_reverse_builder_;
// Edge info offset and map
size_t edge_info_offset_ = 0;
std::unordered_map<edge_tuple, size_t, EdgeTupleHasher> edge_offset_map_;
std::unordered_map<uint32_t, EdgeInfoBuilder*> edgeinfo_offset_map_;
// The edgeinfo list
std::list<EdgeInfoBuilder> edgeinfo_list_;
// Text list offset and map
uint32_t text_list_offset_ = 0;
std::unordered_map<std::string, uint32_t> text_offset_map_;
// Text list. List of names used within this tile
std::list<std::string> textlistbuilder_;
// List of lane connectivity records.
std::vector<LaneConnectivity> lane_connectivity_builder_;
// List of turn lanes.
std::vector<TurnLanes> turnlanes_builder_;
// Offsets into predicted speed profiles for each directed edge.
std::vector<uint32_t> speed_profile_offset_builder_;
// Predicted speed profiles. 200 short int for each directed edge which has predicted speed.
std::vector<int16_t> speed_profile_builder_;
// lane connectivity list offset
uint32_t lane_connectivity_offset_ = 0;
};
#ifdef ENABLE_THREAD_SAFE_TILE_REF_COUNT
using graph_tile_builder_ptr = std::shared_ptr<GraphTileBuilder>;
#else
using graph_tile_builder_ptr = boost::intrusive_ptr<GraphTileBuilder>;
#endif
} // namespace mjolnir
} // namespace valhalla
#endif // VALHALLA_MJOLNIR_GRAPHTILEBUILDER_H_
```
|
The Monopoly Bureau Building is a Renaissance-style red brick building located in Nan Chang Street, Taipei City, Taiwan. It is in the Zhongzheng District, near Aiguo West Road, Park Road and Nanchang intersection ring, and Taipei's city south gate. It is also located nearby the Republic of China Ministry of Finance and the President of the Republic of China's Official Residence. The building was built in 1913 during the Japanese rule of Taiwan.
The building was designed by the architect and constructed in 1913 by the Kobe Group. The six-story tower topped with a spire is the most unusual feature of the building. In addition to the tower, the building is decorated with a copper roof.
The building housed the offices of the Monopoly Bureau of the Taiwan Governor's Office during Japanese rule and the Taiwan Tobacco and Wine Monopoly Bureau under ROC rule. It now houses the headquarters office for the Taiwan Tobacco and Liquor Corporation.
References
External links
Monopoly Bureau at the Bureau of Cultural Heritage website
1913 establishments in Taiwan
Government buildings completed in 1913
Buildings and structures in Taipei
National monuments of Taiwan
|
"All I Wanted" is a single by the band Kansas. The song was released on the band's 1986 album Power and written by Steve Walsh and Steve Morse.
Background
It was their 21st single, as well as their seventh (and final) Top 40 appearance and their fourth Top 20 hit, charting at #19 on the Billboard Hot 100 chart. The song takes a more pop approach than the band's previous songs.
Reception
Billboard said that it's "synth-based and relatively mellow." Cash Box called it a "classic-sounding McCartney composition which elicits memories of some of his strongest material with Wings" with a taut rock beat punctuated by an urgent horn section."
Chart performance
References
1986 singles
Kansas (band) songs
Song recordings produced by Andrew Powell
Songs written by Steve Walsh (musician)
1986 songs
|
```html
---
layout: single
property_name: list-style
---
<section id="list-style" class="property property--shorthand">
<header class="property-header">
<nav class="property-links">
<a class="property-links-direct" href="{{site.url}}/property/list-style/" data-property-name="list-style" data-tooltip="Single page for this property">Permalink</a>
<a class="property-share" data-tooltip="Share on Twitter or Facebook" data-property-name="list-style">Share</a>
<a target="_blank" href="path_to_url" data-tooltip="See on Mozilla Developer Network" rel="external">MDN</a>
</nav>
<h2 class="property-name">
<a href="#list-style"><span>#</span>list-style</a>
</h2>
<div class="property-description">
<p>Shorthand property for <code class="shorthand"><a class="hash" href="{{site.url}}/property/list-style-type" data-property-name="list-style-type">list-style-type</a></code> <code class="shorthand"><a class="hash" href="{{site.url}}/property/list-style-image" data-property-name="list-style-image">list-style-image</a></code> and <code class="shorthand"><a class="hash" href="{{site.url}}/property/list-style-position" data-property-name="list-style-position">list-style-position</a></code>.</p>
</div>
</header>
</section>
```
|
```rust
//! For processing the raw save-analysis data from rustc into the rls
//! in-memory representation.
use crate::analysis::{Def, Glob, PerCrateAnalysis, Ref};
#[cfg(feature = "idents")]
use crate::analysis::{IdentBound, IdentKind, IdentsByColumn, IdentsByLine};
use crate::loader::AnalysisLoader;
use crate::raw::{self, CrateId, DefKind, RelationKind};
use crate::util;
use crate::{AResult, AnalysisHost, Id, Span, NULL};
use std::collections::hash_map::Entry;
use std::collections::{HashMap, HashSet};
use std::iter::Extend;
use std::path::{Path, PathBuf};
use std::time::Instant;
use std::u32;
use fst;
use itertools::Itertools;
// f is a function used to record the lowered crate into analysis.
pub fn lower<F, L>(
raw_analysis: Vec<raw::Crate>,
base_dir: &Path,
analysis: &AnalysisHost<L>,
mut f: F,
) -> AResult<()>
where
F: FnMut(&AnalysisHost<L>, PerCrateAnalysis, CrateId) -> AResult<()>,
L: AnalysisLoader,
{
let rss = util::get_resident().unwrap_or(0);
let t_start = Instant::now();
// Keep a queue of crates that we are yet to overwrite as part of the lowering
// process (to know which already-existing defs we can overwrite and lower)
let mut invalidated_crates: Vec<_> = raw_analysis.iter().map(|c| c.id.clone()).collect();
for c in raw_analysis {
let t_start = Instant::now();
let (per_crate, id) = CrateReader::read_crate(analysis, c, base_dir, &invalidated_crates);
invalidated_crates.retain(|elem| *elem != id);
let time = t_start.elapsed();
info!(
"Lowering {} in {:.2}s",
format!("{} ({:?})", id.name, id.disambiguator),
time.as_secs() as f64 + f64::from(time.subsec_nanos()) / 1_000_000_000.0
);
info!(" defs: {}", per_crate.defs.len());
info!(" refs: {}", per_crate.ref_spans.len());
info!(" globs: {}", per_crate.globs.len());
f(analysis, per_crate, id)?;
}
let time = t_start.elapsed();
let rss = util::get_resident().unwrap_or(0) as isize - rss as isize;
info!(
"Total lowering time: {:.2}s",
time.as_secs() as f64 + f64::from(time.subsec_nanos()) / 1_000_000_000.0
);
info!("Diff in rss: {:.2}KB", rss as f64 / 1000.0);
Ok(())
}
fn lower_span(raw_span: &raw::SpanData, base_dir: &Path, path_rewrite: &Option<PathBuf>) -> Span {
let file_name = &raw_span.file_name;
// Go from relative to absolute paths.
let file_name = if let Some(ref prefix) = *path_rewrite {
// Invariant: !file_name.is_absolute()
// We don't assert this because better to have an incorrect span than to
// panic.
let prefix = &Path::new(prefix);
prefix.join(file_name)
} else if file_name.is_absolute() {
file_name.to_owned()
} else {
base_dir.join(file_name)
};
// Rustc uses 1-indexed rows and columns, the RLS uses 0-indexed.
span::Span::new(
raw_span.line_start.zero_indexed(),
raw_span.line_end.zero_indexed(),
raw_span.column_start.zero_indexed(),
raw_span.column_end.zero_indexed(),
file_name,
)
}
/// Responsible for processing the raw `data::Analysis`, including translating
/// from local crate ids to global crate ids, and creating lowered
/// `PerCrateAnalysis`.
struct CrateReader<'a> {
/// This is effectively a map from local crate id -> global crate id, where
/// local crate id are indices 0...external_crate_count.
crate_map: Vec<u32>,
base_dir: PathBuf,
crate_name: String,
path_rewrite: Option<PathBuf>,
crate_homonyms: Vec<CrateId>,
/// List of crates that are invalidated (replaced) as part of the current
/// lowering process. These will be overriden and their definitions should
/// not be taken into account when checking if we need to ignore duplicated
/// item.
invalidated_crates: &'a [CrateId],
}
impl<'a> CrateReader<'a> {
fn from_prelude(
mut prelude: raw::CratePreludeData,
master_crate_map: &mut HashMap<CrateId, u32>,
base_dir: &Path,
path_rewrite: Option<PathBuf>,
invalidated_crates: &'a [CrateId],
) -> CrateReader<'a> {
fn fetch_crate_index(map: &mut HashMap<CrateId, u32>, id: CrateId) -> u32 {
let next = map.len() as u32;
*map.entry(id).or_insert(next)
}
// When reading a local crate and its external crates, we need to:
// 1. Update a global crate id map if we encounter any new crate
// 2. Prepare a local crate id -> global crate id map, so we can easily
// map those when lowering symbols with local crate ids into global registry
// It's worth noting, that we assume that local crate id is 0, whereas
// the external crates will have num in 1..count contiguous range.
let crate_id = prelude.crate_id;
trace!("building crate map for {:?}", crate_id);
let index = fetch_crate_index(master_crate_map, crate_id.clone());
let mut crate_map = vec![index];
trace!(" {} -> {}", crate_id.name, master_crate_map[&crate_id]);
prelude.external_crates.sort_by(|a, b| a.num.cmp(&b.num));
for c in prelude.external_crates {
assert!(c.num == crate_map.len() as u32);
let index = fetch_crate_index(master_crate_map, c.id.clone());
crate_map.push(index);
trace!(" {} -> {}", c.id.name, master_crate_map[&c.id]);
}
CrateReader {
crate_map,
base_dir: base_dir.to_owned(),
crate_homonyms: master_crate_map
.keys()
.filter(|cid| cid.name == crate_id.name)
.cloned()
.collect(),
crate_name: crate_id.name,
path_rewrite,
invalidated_crates,
}
}
/// Lowers a given `raw::Crate` into `AnalysisHost`.
fn read_crate<L: AnalysisLoader>(
project_analysis: &AnalysisHost<L>,
krate: raw::Crate,
base_dir: &Path,
invalidated_crates: &[CrateId],
) -> (PerCrateAnalysis, CrateId) {
let reader = CrateReader::from_prelude(
krate.analysis.prelude.unwrap(),
&mut project_analysis.master_crate_map.lock().unwrap(),
base_dir,
krate.path_rewrite,
invalidated_crates,
);
let mut per_crate = PerCrateAnalysis::new(krate.timestamp, krate.path);
let is_distro_crate = krate.analysis.config.distro_crate;
reader.read_defs(krate.analysis.defs, &mut per_crate, is_distro_crate, project_analysis);
reader.read_imports(krate.analysis.imports, &mut per_crate, project_analysis);
reader.read_refs(krate.analysis.refs, &mut per_crate, project_analysis);
reader.read_impls(krate.analysis.relations, &mut per_crate, project_analysis);
per_crate.global_crate_num = reader.crate_map[0];
{
let analysis = &mut project_analysis.analysis.lock().unwrap();
analysis
.as_mut()
.unwrap()
.crate_names
.entry(krate.id.name.clone())
.or_insert_with(Vec::new)
.push(krate.id.clone());
}
(per_crate, krate.id)
}
fn read_imports<L: AnalysisLoader>(
&self,
imports: Vec<raw::Import>,
analysis: &mut PerCrateAnalysis,
project_analysis: &AnalysisHost<L>,
) {
for i in imports {
let span = lower_span(&i.span, &self.base_dir, &self.path_rewrite);
if !i.value.is_empty() {
// A glob import.
if !self.has_congruent_glob(&span, project_analysis) {
let glob = Glob { value: i.value };
trace!("record glob {:?} {:?}", span, glob);
analysis.globs.insert(span, glob);
}
} else if let Some(ref ref_id) = i.ref_id {
// Import where we know the referred def.
let def_id = self.id_from_compiler_id(*ref_id);
self.record_ref(def_id, span, analysis, project_analysis);
if let Some(alias_span) = i.alias_span {
let alias_span = lower_span(&alias_span, &self.base_dir, &self.path_rewrite);
self.record_ref(def_id, alias_span, analysis, project_analysis);
let mut analysis = project_analysis.analysis.lock().unwrap();
analysis.as_mut().unwrap().aliased_imports.insert(def_id);
}
}
}
}
fn record_ref<L: AnalysisLoader>(
&self,
def_id: Id,
span: Span,
analysis: &mut PerCrateAnalysis,
project_analysis: &AnalysisHost<L>,
) {
if def_id != NULL
&& (project_analysis.has_def(def_id) || analysis.defs.contains_key(&def_id))
{
trace!("record_ref {:?} {}", span, def_id);
match analysis.def_id_for_span.entry(span.clone()) {
Entry::Occupied(mut oe) => {
let new = oe.get().add_id(def_id);
oe.insert(new);
}
Entry::Vacant(ve) => {
ve.insert(Ref::Id(def_id));
}
}
#[cfg(feature = "idents")]
{
Self::record_ident(analysis, &span, def_id, IdentKind::Ref);
}
analysis.ref_spans.entry(def_id).or_insert_with(Vec::new).push(span);
}
}
#[cfg(feature = "idents")]
fn record_ident(analysis: &mut PerCrateAnalysis, span: &Span, id: Id, kind: IdentKind) {
let row_start = span.range.row_start;
let col_start = span.range.col_start;
let col_end = span.range.col_end;
analysis
.idents
.entry(span.file.clone())
.or_insert_with(IdentsByLine::new)
.entry(row_start)
.or_insert_with(IdentsByColumn::new)
.entry(col_start)
.or_insert_with(|| IdentBound::new(col_end, id, kind));
}
// We are sometimes asked to analyze the same crate twice. This can happen due to duplicate data,
// but more frequently is due to compiling it twice with different Cargo targets (e.g., bin and test).
// In that case there will be two crates with the same names, but different disambiguators. We
// want to ensure that we only record defs once, even if the defintion is in multiple crates.
// So we compare the crate-local id and span and skip any subsequent defs which match already
// present defs.
fn has_congruent_def<L: AnalysisLoader>(
&self,
local_id: u32,
span: &Span,
project_analysis: &AnalysisHost<L>,
) -> bool {
self.has_congruent_item(project_analysis, |per_crate| {
per_crate.has_congruent_def(local_id, span)
})
}
fn has_congruent_glob<L: AnalysisLoader>(
&self,
span: &Span,
project_analysis: &AnalysisHost<L>,
) -> bool {
self.has_congruent_item(project_analysis, |per_crate| per_crate.globs.contains_key(span))
}
fn has_congruent_item<L, P>(&self, project_analysis: &AnalysisHost<L>, pred: P) -> bool
where
L: AnalysisLoader,
P: Fn(&PerCrateAnalysis) -> bool,
{
if self.crate_homonyms.is_empty() {
return false;
}
let project_analysis = project_analysis.analysis.lock().unwrap();
let project_analysis = project_analysis.as_ref().unwrap();
// Don't take into account crates that we are about to replace as part
// of the lowering. This often happens when we reload definitions for
// the same crate. Naturally most of the definitions will stay the same
// for incremental changes but will be overwritten - don't ignore them!
let homonyms_to_consider =
self.crate_homonyms.iter().filter(|c| !self.invalidated_crates.contains(c));
homonyms_to_consider.filter_map(|ch| project_analysis.per_crate.get(ch)).any(pred)
}
fn read_defs<L: AnalysisLoader>(
&self,
defs: Vec<raw::Def>,
analysis: &mut PerCrateAnalysis,
distro_crate: bool,
project_analysis: &AnalysisHost<L>,
) {
let mut defs_to_index = Vec::new();
for d in defs {
if bad_span(&d.span, d.kind == DefKind::Mod) {
continue;
}
let span = lower_span(&d.span, &self.base_dir, &self.path_rewrite);
if self.has_congruent_def(d.id.index, &span, project_analysis) {
trace!("read_defs: has_congruent_def({}, {:?}), skipping", d.id.index, span);
continue;
}
let id = self.id_from_compiler_id(d.id);
if id != NULL && !analysis.defs.contains_key(&id) {
let file_name = span.file.clone();
analysis.defs_per_file.entry(file_name).or_insert_with(Vec::new).push(id);
let decl_id = match d.decl_id {
Some(ref decl_id) => {
let def_id = self.id_from_compiler_id(*decl_id);
analysis
.ref_spans
.entry(def_id)
.or_insert_with(Vec::new)
.push(span.clone());
Ref::Id(def_id)
}
None => Ref::Id(id),
};
match analysis.def_id_for_span.entry(span.clone()) {
Entry::Occupied(_) => {
debug!("def already exists at span: {:?} {:?}", span, d);
}
Entry::Vacant(ve) => {
ve.insert(decl_id);
}
}
analysis.def_names.entry(d.name.clone()).or_insert_with(Vec::new).push(id);
// NOTE not every Def will have a name, e.g. test_data/hello/src/main is analyzed with an implicit module
// that's fine, but no need to index in def_trie
if d.name != "" {
defs_to_index.push((d.name.to_lowercase(), id));
}
let parent = d.parent.map(|id| self.id_from_compiler_id(id));
if let Some(parent) = parent {
let children = analysis.children.entry(parent).or_insert_with(HashSet::new);
children.insert(id);
}
if !d.children.is_empty() {
let children_for_id = analysis.children.entry(id).or_insert_with(HashSet::new);
children_for_id
.extend(d.children.iter().map(|id| self.id_from_compiler_id(*id)));
}
#[cfg(feature = "idents")]
{
Self::record_ident(analysis, &span, id, IdentKind::Def);
}
let def = Def {
kind: d.kind,
span,
name: d.name,
value: d.value,
qualname: format!("{}{}", self.crate_name, d.qualname),
distro_crate,
parent,
docs: d.docs,
// sig: d.sig.map(|ref s| self.lower_sig(s, &self.base_dir)),
};
trace!(
"record def: {:?}/{:?} ({}): {:?}",
id,
d.id,
self.crate_map[d.id.krate as usize],
def
);
if d.kind == super::raw::DefKind::Mod && def.name == "" {
assert!(analysis.root_id.is_none());
analysis.root_id = Some(id);
}
analysis.defs.insert(id, def);
}
}
let (def_fst, def_fst_values) = build_index(defs_to_index);
analysis.def_fst = def_fst;
analysis.def_fst_values = def_fst_values;
// We must now run a pass over the defs setting parents, because
// save-analysis often omits parent info.
for (parent, children) in &analysis.children {
for c in children {
if let Some(def) = analysis.defs.get_mut(c) {
def.parent = Some(*parent);
}
}
}
}
fn read_refs<L: AnalysisLoader>(
&self,
refs: Vec<raw::Ref>,
analysis: &mut PerCrateAnalysis,
project_analysis: &AnalysisHost<L>,
) {
for r in refs {
if r.span.file_name.to_str().map(|s| s.ends_with('>')).unwrap_or(true) {
continue;
}
let def_id = self.id_from_compiler_id(r.ref_id);
let span = lower_span(&r.span, &self.base_dir, &self.path_rewrite);
self.record_ref(def_id, span, analysis, project_analysis);
}
}
fn read_impls<L: AnalysisLoader>(
&self,
relations: Vec<raw::Relation>,
analysis: &mut PerCrateAnalysis,
project_analysis: &AnalysisHost<L>,
) {
for r in relations {
match r.kind {
RelationKind::Impl { .. } => {}
_ => continue,
}
let self_id = self.id_from_compiler_id(r.from);
let trait_id = self.id_from_compiler_id(r.to);
let span = lower_span(&r.span, &self.base_dir, &self.path_rewrite);
if self_id != NULL {
if let Some(self_id) = abs_ref_id(self_id, analysis, project_analysis) {
trace!("record impl for self type {:?} {}", span, self_id);
analysis.impls.entry(self_id).or_insert_with(Vec::new).push(span.clone());
}
}
if trait_id != NULL {
if let Some(trait_id) = abs_ref_id(trait_id, analysis, project_analysis) {
trace!("record impl for trait {:?} {}", span, trait_id);
analysis.impls.entry(trait_id).or_insert_with(Vec::new).push(span);
}
}
}
}
// fn lower_sig(&self, raw_sig: &raw::Signature, base_dir: &Path) -> Signature {
// Signature {
// span: lower_span(&raw_sig.span, base_dir, &self.path_rewrite),
// text: raw_sig.text.clone(),
// ident_start: raw_sig.ident_start as u32,
// ident_end: raw_sig.ident_end as u32,
// defs: raw_sig.defs.iter().map(|se| self.lower_sig_element(se)).collect(),
// refs: raw_sig.refs.iter().map(|se| self.lower_sig_element(se)).collect(),
// }
// }
// fn lower_sig_element(&self, raw_se: &raw::SigElement) -> SigElement {
// SigElement {
// id: self.id_from_compiler_id(raw_se.id),
// start: raw_se.start,
// end: raw_se.end,
// }
// }
/// Recreates resulting crate-local (`u32`, `u32`) id from compiler
/// to a global `u64` `Id`, mapping from a local to global crate id.
fn id_from_compiler_id(&self, id: data::Id) -> Id {
if id.krate == u32::MAX || id.index == u32::MAX {
return NULL;
}
let krate = self.crate_map[id.krate as usize];
Id::from_crate_and_local(krate, id.index)
}
}
fn abs_ref_id<L: AnalysisLoader>(
id: Id,
analysis: &PerCrateAnalysis,
project_analysis: &AnalysisHost<L>,
) -> Option<Id> {
if project_analysis.has_def(id) || analysis.defs.contains_key(&id) {
return Some(id);
}
// TODO
None
}
fn build_index(mut defs: Vec<(String, Id)>) -> (fst::Map<Vec<u8>>, Vec<Vec<Id>>) {
defs.sort_by(|(n1, _), (n2, _)| n1.cmp(n2));
let by_name = defs.into_iter().group_by(|(n, _)| n.clone());
let mut values: Vec<Vec<Id>> = Vec::new();
let fst = {
let defs = by_name.into_iter().enumerate().map(|(i, (name, defs))| {
values.push(defs.map(|(_, id)| id).collect());
(name, i as u64)
});
fst::Map::from_iter(defs).expect("defs are sorted by lowercase name")
};
(fst, values)
}
fn bad_span(span: &raw::SpanData, is_mod: bool) -> bool {
span.file_name.to_str().map(|s| s.ends_with('>')).unwrap_or(true)
|| (!is_mod && span.byte_start == 0 && span.byte_end == 0)
}
```
|
Mamborê is a municipality in the state of Paraná in the Southern Region of Brazil.
See also
List of municipalities in Paraná
References
Municipalities in Paraná
|
Nuclear Terrorism: The Ultimate Preventable Catastrophe is a 2004 book by Harvard scholar Graham Allison. Allison explains that terrorists have been striving to acquire and then use nuclear weapons against the United States. During the 2004 U.S. Presidential election, President George W. Bush and Senator John Kerry featured the issue of terrorism in their foreign policy platforms, and both said it is the nation's foremost security challenge. Nuclear Terrorism is described as a well-written report for general readers on the terrorist threat and what is needed to reduce it.
According to Warren Buffett in 2005:
See also
List of books about nuclear issues
On Nuclear Terrorism
The Four Faces of Nuclear Terrorism
The Seventh Decade
References
External links
(16th Annual Margolis Lecture, given by Dr. Graham Allison at U.C. Irvine)
2004 non-fiction books
Books about politics of the United States
American political books
Nuclear terrorism
Books about nuclear issues
Books about terrorism
|
Agalychnis danieli, also known as the Antioquia leaf frog, is a species of frog in the subfamily Phyllomedusinae. It is endemic to Colombia and only known from its type locality in the northern part of the western flank of the Cordillera Occidental in the Antioquia Department. The specific name danieli honours Brother Daniel Gonzales Patiño, a Colombian monk with naturalist inclinations who became the director of Natural History Museum of the Instituto de La Salle, Bogotá.
Agalychnis danieli is only known from a juvenile specimen collected from a leaf on vegetation near a stream in primary forest at about above sea level. Later survey to the type locality did not reveal new specimens. The habitat of this species is threatened by clearing of the forest for fruit and cacao cultivation. It might occur in the adjacent Las Orquídeas National Natural Park and Mesenia-Paramillo Nature Reserve.
References
danieli
Amphibians of the Andes
Amphibians of Colombia
Endemic fauna of Colombia
Amphibians described in 1988
Taxa named by José Vicente Rueda Almonacid
Taxonomy articles created by Polbot
Fauna of the northwestern Andean montane forests
|
The Houses of Montlhéry and Le Puiset (referred to as the Montlhéry Clan by Riley-Smith) is the name given by two powerful families, joined in marriage, that played a major role in the 11th and 12th centuries in both the Crusades as well as the administration of the Holy Land. The Montlhéry branch consists of the relatives (descendants and in-laws) of Guy I of Montlhéry (referred to here as simply Guy) and Hodierna of Gometz. The Le Puiset branch consists of the descendants of Everard I of Breteuil. Everard’s son Hugh I of Le Puiset (or simply Hugh) married Guy’s daughter Alice, bringing the families together. Prominent members of the families are as follows.
Knights who Took the Cross (First Crusade unless otherwise noted)
Milo I of Montlhéry (d. 1102), son of Guy
Guy III Trousseau (d. 1109), son of the previous
Guy I of Dampierre (d. 1151), grandson of Milo I
Guy II of Dampierre (d. 1216), grandson of the previous (Third Crusade)
Hugh II Bardoul of Broyes (d. before 1121), son-in-law of Milo I
Hugh III of Broyes (d. 1199), grandson of the previous (Second Crusade)
Guy II the Red of Rochefort (d. 1108), son of Guy
Hugh I of Rethel (d. 1108), son-in-law of Guy
Guitier of Rethel (d. 1171), grandson of the previous
Walter of Saint-Valéry (d. after 1098), son-in-law of Guy
Bernard II of Saint-Valéry (d. unknown), son of the previous
Eudon of Saint-Valéry (d. unknown), brother of the previous
Éverard III (d. 1099), son of Hugh and grandson of Guy
Hugh III of Le Puiset (d. 1132), son of the previous
Ralph the Red of Pont-Echanfray (d. 1120 in the White Ship disaster), grandson-in-law of Hugh
Guy of Puiset (d. 1127), son of Hugh
Walo II of Chaumont-en-Vexin (d. 1098), son-in-law of Hugh
Drogo de Chaumont (d. 1099), son of the previous
Waleran of Le Puiset (d. 1126), son of Hugh
Joscelin IV of Lèves (d. unknown), son-in-law of Hugh and father-in-law of Ralph the Red
Héribrand III of Hierges, son-in-law of Hugh I of Rethel.
Kings of Jerusalem
Baldwin II (d. 1131), son of Hugh I of Rethel
Melisende, Queen of Jerusalem (d. 1153), daughter of the previous
Subsequent kings.
Princes of Galilee
William I of Bures (d. 1142), son of Hugh of Crécy, and grandson of Guy
William II of Bures (d. 1158), brother of the previous.
Counts of Edessa
Joscelin I (d. 1131), grandson of Guy
Joscelin II (d. 1159), son of the previous.
Counts of Jaffa
Hugh I of Jaffa (d. between 1112 and 1118), son of Hugh
Hugh II of Jaffa (d. 1134), son of the previous.
Others
Gilduin of Le Puiset (d. 1135), Abbot of St. Mary of the Valley of Jehoshaphat, son of Hugh
Cecilia of Le Bourcq, Lady of Tarsus, sister of King Baldwin II
Manasses of Hierges, Constable of Jerusalem, grandson of Hugh I of Rethel
Renaud of Montlhéry, Bishop of Troyes, son of Milo I
Guy of Dampierre, Bishop of Chalon, son of Guy I of Dampierre
Hugh de Puiset, Bishop of Durham (d. 1195), son of Hugh III of Le Puiset
Hugh of Crécy (d. 1147), seneschal, son of Guy II the Red of Rochefort.
Related Houses
House of Dampierre (Guy I of Dampierre)
House of Courtenay (Joscelin I, Lord of Courtenay, son-in-law of Guy)
House of Dammartin (Drogo de Chaumont)
House of Châteaudun (descendants of Melisende and her husband Fulk the Younger, King of Jerusalem).
The family trees of the Montlhéry and Le Puiset houses can be found in Riley-Smith.
Sources
Riley-Smith, Johathan, The First Crusaders, 1095-1131, Cambridge University Press, London, 1997
La Monte, John L.,The Lords of Le Puiset on the Crusades, Speculum, 1942
Runciman, Steven, A History of the Crusades, Volume I: The First Crusade and the Foundation of the Kingdom of Jerusalem, Cambridge University Press, London, 1951
Riley-Smith, Jonathan, The Atlas of the Crusades, Facts On File, New York, 1990, pg 14
References
Christians of the First Crusade
Crusade01
|
Aleesha Barber (born 16 May 1987) is a Trinidadian sprint hurdler. She is a 2007 NCAA All-American honoree, a six-time Big Ten Conference champion, and a seven-time collegiate record holder. She set a personal best time of 12.85 seconds at the 2010 NCAA Eastern First Round Championships on the campus of North Carolina A&T State University in Greensboro, North Carolina. Barber also won a gold medal for the 100 m hurdles at the 2010 Central American and Caribbean Games in Mayagüez, Puerto Rico, clocking at 13.09 seconds.
Barber represented Trinidad and Tobago at the 2008 Summer Olympics in Beijing, where she competed in the women's 100 m hurdles. She ran in the fifth and final heat against seven other athletes, including Jamaica's Brigitte Foster-Hylton, and United States' Dawn Harper, who later dominated this event by winning an Olympic gold medal. She finished the race in fourth place by two hundredths of a second (0.02) behind Kazakhstan's Anastassiya Pilipenko, with a national record-breaking time of 13.01 seconds. Barber, however, failed to advance into the semi-finals, as she placed eighteenth overall, and was ranked below two mandatory slots for the next round.
Barber is also a member of the track and field team for the Penn State Nittany Lions, and a management graduate at Penn State University in University Park, Pennsylvania.
See also
List of Pennsylvania State University Olympians
References
External links
Profile – Penn State Nittany Lions
TTOC Profile
Trinidad and Tobago female hurdlers
Living people
Olympic athletes for Trinidad and Tobago
Athletes (track and field) at the 2008 Summer Olympics
1987 births
Athletes (track and field) at the 2010 Commonwealth Games
Central American and Caribbean Games gold medalists for Trinidad and Tobago
Competitors at the 2010 Central American and Caribbean Games
Central American and Caribbean Games medalists in athletics
Commonwealth Games competitors for Trinidad and Tobago
|
Mark Moisevich Rosenthal (; 1906–1975) was a Soviet philosopher and teacher, specializing in the fields of dialectical materialism, aesthetics, and the history of philosophy. He and Pavel Fyodorovich Yudin were the main authors of A Dictionary of Philosophy, a Soviet dictionary on philosophy.
Life
Mark Rosenthal was born in Ustia, Ukraine, in 1906. He lost both parents to typhus at an early age.
In 1925 he joined the Communist Party of the Soviet Union (CPSU). He worked at a metal factory and at a sugar mill before being admitted to the School of Philosophy in Moscow in 1928. In 1933, he graduated from the Institute of Red Professors. In 1946 he received a doctorate in philosophy.
Later in life he edited a journal of literary criticism and headed the department of Historical and Dialectical Materialism at the CPSU Central Committee's Higher Party School.
Works
Dialectics of the Present Epoch (Novosti, n.d.)
Contra la sociología vulgar en la teoría literaria (1936)
Dialéctica materialista (1937)
Problemas de la Estética de Plejanov (1939)
El método dialéctico marxista (1951)
Principios de la lógica dialéctica (1960)
Lenin y la dialéctica (1963)
Teoría leninista del conocimiento (1965)
Dialéctica de El Capital de Marx (1967)
A Dictionary of Philosophy, written with Pavel Yudin (Progress Publishers, 1967)
Awards
Order of the Red Banner of Labour
Científico de Honor de la RSFSR (1966)
References
1906 births
1975 deaths
Soviet philosophers
20th-century Russian Jews
20th-century Russian philosophers
Institute of Red Professors alumni
Communist Party of the Soviet Union members
Recipients of the Order of the Red Banner
Recipients of the Order of the Red Banner of Labour
|
Karallı is a village in the Kızılırmak District of Çankırı Province in Turkey. Its population is 320 (2021).
References
Villages in Kızılırmak District
|
Long Creek may refer to:
United States
Waterways
Long Creek (White River tributary), a stream in Boone and Carroll counties of Arkansas
Long Creek (Iowa River tributary), a stream in Iowa
Long Creek (Beaver Creek tributary), a stream in Taney County, Missouri
Long Creek (New York), a salt-water channel on Long Island
Long Creek (Fore River tributary), a stream in Maine
Communities
Long Creek, Illinois
Long Creek Township, Macon County, Illinois
Long Creek Township, Decatur County, Iowa
Long Creek, North Carolina
Long Creek, North Dakota
Long Creek, Oregon
Long Creek School (Oregon)
Long Creek, South Carolina
Long Creek Academy
Long Creek, Sunnyvale, Texas
Canada
Long Creek, Prince Edward Island, a community
Long Creek (Saskatchewan), a river near Estevan
Long Creek Bridge
|
```c++
//
// file LICENSE_1_0.txt or copy at path_to_url
// #define BOOST_SPIRIT_LEXERTL_DEBUG
#define BOOST_VARIANT_MINIMIZE_SIZE
#include <boost/detail/lightweight_test.hpp>
#include <boost/config/warning_disable.hpp>
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/lex_lexertl.hpp>
#include <boost/spirit/include/phoenix_operator.hpp>
#include <iostream>
#include <string>
namespace qi = boost::spirit::qi;
namespace lex = boost::spirit::lex;
enum tokenids
{
IDANY = lex::min_token_id + 10 // Lower 8 bits is 0x0a, same as '\n'
};
template <typename Lexer>
struct word_count_tokens : lex::lexer<Lexer>
{
word_count_tokens()
{
this->self.add_pattern
("TEST", "A")
;
word = "{TEST}";
this->self.add
(word)
('\n')
(".", IDANY)
;
}
lex::token_def<std::string> word;
};
template <typename Iterator>
struct word_count_grammar : qi::grammar<Iterator>
{
template <typename TokenDef>
word_count_grammar(TokenDef const& tok)
: word_count_grammar::base_type(start)
, c(0), w(0), l(0)
{
using boost::phoenix::ref;
using qi::lit;
using qi::token;
start = *( tok.word [++ref(w)]
| lit('\n') [++ref(l)]
| token(IDANY) [++ref(c)]
)
;
}
std::size_t c, w, l;
qi::rule<Iterator> start;
};
int main()
{
typedef lex::lexertl::token<
const char*, boost::mpl::vector<std::string>
> token_type;
typedef lex::lexertl::lexer<token_type> lexer_type;
typedef word_count_tokens<lexer_type>::iterator_type iterator_type;
word_count_tokens<lexer_type> word_count; // Our lexer
word_count_grammar<iterator_type> g (word_count); // Our parser
std::string str ("A\nBCDEFGHI");
char const* first = str.c_str();
char const* last = &first[str.size()];
BOOST_TEST(lex::tokenize_and_parse(first, last, word_count, g));
BOOST_TEST(g.l == 1 && g.w == 1 && g.c == 8);
return boost::report_errors();
}
```
|
Jimmy Morales (born 1969) was the 38th President of Guatemala.
Jimmy, Jim or Jaime Morales may also refer to:
Jaime Morales Carazo (born 1936), former Vice President of Nicaragua
Jim Morales, a character in Code Lyoko, see List of Code Lyoko characters#Jim Morales
See also
Tnte. FAP Jaime Montreuil Morales Airport, an airport in Chimbote, Peru
|
```c++
/*
*
* This program is free software: you can redistribute it and/or modify
* the Free Software Foundation, either version 2 or (at your option)
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with this program. If not, see <path_to_url
*/
#include "SettingsPageKeeShare.h"
#include "gui/DatabaseTabWidget.h"
#include "gui/Icons.h"
#include "keeshare/SettingsWidgetKeeShare.h"
#include <QObject>
SettingsPageKeeShare::SettingsPageKeeShare(DatabaseTabWidget* tabWidget)
: m_tabWidget(tabWidget)
{
}
QString SettingsPageKeeShare::name()
{
return "KeeShare";
}
QIcon SettingsPageKeeShare::icon()
{
return icons()->icon("preferences-system-network-sharing");
}
QWidget* SettingsPageKeeShare::createWidget()
{
auto* widget = new SettingsWidgetKeeShare();
QObject::connect(widget,
SIGNAL(settingsMessage(QString, MessageWidget::MessageType)),
m_tabWidget,
SIGNAL(messageGlobal(QString, MessageWidget::MessageType)));
return widget;
}
void SettingsPageKeeShare::loadSettings(QWidget* widget)
{
Q_UNUSED(widget);
SettingsWidgetKeeShare* settingsWidget = reinterpret_cast<SettingsWidgetKeeShare*>(widget);
settingsWidget->loadSettings();
}
void SettingsPageKeeShare::saveSettings(QWidget* widget)
{
Q_UNUSED(widget);
SettingsWidgetKeeShare* settingsWidget = reinterpret_cast<SettingsWidgetKeeShare*>(widget);
return settingsWidget->saveSettings();
}
```
|
Lauren Marie Boyle (born 14 December 1987) is a former competitive swimmer from New Zealand. She has competed at three Commonwealth Games and three Olympic Games.
Career
Boyle won a bronze medal with Helen Norfolk, Alison Fitch and Melissa Ingram in the 4 × 200 m freestyle relay at the 2006 Commonwealth Games.
At the 2008 Olympic Games she was a member of the New Zealand 4 × 200 m freestyle relay team which was disqualified in the heats.
She won a silver medal with Penelope Marshall, Amaka Gessler and Natasha Hind in the 4 × 200 m freestyle relay at the 2010 Commonwealth Games.
At the 2012 Olympics in London, Boyle was fourth fastest in the heats of the 400m freestyle in a New Zealand record 4:03.63. In the final she finished 8th. In the 800m heats she swam 8:25.91, also a New Zealand record, qualifying fifth fastest for the final. In the final she swam another record of 8:22.72 to finish fourth, 2.40 seconds from the bronze medal which went to defending champion and world record holder Rebecca Adlington.
In August 2013, Boyle claimed three medals at the FINA World Swimming Championships in Barcelona, becoming only the second New Zealander to achieve this feat (after Danyon Loader in 1994).
At the 2014 Commonwealth Games, Boyle won gold in the 400m freestyle and a silver medal in the 800m freestyle. She also finished fourth in the final of the 200m freestyle after breaking the New Zealand record in the heats. In the 400 m freestyle, she set a new Games record in the final.
At the Wellington Winter Short Course meet in August 2014 Boyle broke the World Short Course record in the women's 1500m freestyle with a time of 15:22.68.
At the 2016 Summer Olympics, Boyle was 14th fastest in the semi-finals of the 400 m freestyle, and did not make the final. In the 800 m freestyle, she was 0.29 of a second off making the final.
Boyle is a graduate of the University of California, Berkeley. She announced her retirement from competitive swimming on 1 August 2017 due to ongoing injury problems.
In the 2020 New Year Honours, Boyle was appointed a Member of the New Zealand Order of Merit, for services to swimming.
See also
List of World Aquatics Championships medalists in swimming (women)
List of Commonwealth Games medallists in swimming (women)
World record progression 1500 metres freestyle
References
External links
1987 births
Living people
California Golden Bears women's swimmers
Commonwealth Games bronze medallists for New Zealand
Commonwealth Games gold medallists for New Zealand
Commonwealth Games silver medallists for New Zealand
Medalists at the FINA World Swimming Championships (25 m)
New Zealand female swimmers
Olympic swimmers for New Zealand
Swimmers from Auckland
Swimmers at the 2008 Summer Olympics
Swimmers at the 2012 Summer Olympics
Swimmers at the 2006 Commonwealth Games
Swimmers at the 2010 Commonwealth Games
Swimmers at the 2014 Commonwealth Games
World Aquatics Championships medalists in swimming
Swimmers at the 2016 Summer Olympics
Commonwealth Games medallists in swimming
Universiade medalists in swimming
FISU World University Games gold medalists for New Zealand
Universiade silver medalists for New Zealand
Universiade bronze medalists for New Zealand
Members of the New Zealand Order of Merit
Medalists at the 2011 Summer Universiade
Medallists at the 2006 Commonwealth Games
Medallists at the 2010 Commonwealth Games
Medallists at the 2014 Commonwealth Games
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.