text
stringlengths 1
22.8M
|
|---|
Kayaralam is one of the villages in Mayyil Gram panchayat in the Kannur District, state of Kerala, India.
Demographics
As of 2011 Census, Kayaralam had a population of 17,159 with 8,042 males (46.9%) and 9,117 females (53.1%). Kayaralam village has an area of with 3,800 families residing in it. The average male female sex ratio was 1,134 higher than state average of 1,084. In Kayaralam, 11.75% of the population was under 6 years age. Kayaralam had overall literacy of 94.1% higher than state average of 94%.
Administration
Before the formation of the Mayyil panchayath, it was a panchayath. Orappadi is the nearest town.
Transportation
The national highway passes through Valapattanam town. Goa and Mumbai can be accessed on the northern side and Cochin and Thiruvananthapuram can be accessed on the southern side. The road to the east of Iritty connects to Mysore and Bangalore. The nearest railway station is Kannur on Mangalore-Palakkad line.
Trains are available to almost all parts of India subject to advance booking over the internet. There are airports at Mattanur, Mangalore and Calicut. All of them are international airports but direct flights are available only to Middle Eastern countries.
References
Villages near Mayyil
|
```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 randu = require( '@stdlib/random/iter/randu' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var isIteratorLike = require( '@stdlib/assert/is-iterator-like' );
var pkg = require( './../package.json' ).name;
var iterRamp = require( './../lib' );
// MAIN //
bench( pkg, function benchmark( b ) {
var rand;
var iter;
var i;
rand = randu();
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
iter = iterRamp( rand );
if ( typeof iter !== 'object' ) {
b.fail( 'should return an object' );
}
}
b.toc();
if ( !isIteratorLike( iter ) ) {
b.fail( 'should return an iterator protocol-compliant object' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::iteration', function benchmark( b ) {
var rand;
var iter;
var z;
var i;
rand = randu();
iter = iterRamp( rand );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
z = iter.next().value;
if ( isnan( z ) ) {
b.fail( 'should not return NaN' );
}
}
b.toc();
if ( isnan( z ) ) {
b.fail( 'should not return NaN' );
}
b.pass( 'benchmark finished' );
b.end();
});
```
|
The Union Pacific Railroad is a Class I freight-hauling railroad that operates 8,300 locomotives over routes in 23 U.S. states west of Chicago and New Orleans. Union Pacific is the second largest railroad in the United States after BNSF, with which it shares a duopoly on transcontinental freight rail lines in the Western, Midwestern and West South Central United States.
Founded in 1862, the original Union Pacific Rail Road was part of the first transcontinental railroad project, later known as the Overland Route. Over the next century, UP absorbed the Missouri Pacific Railroad, the Western Pacific Railroad, the Missouri–Kansas–Texas Railroad and the Chicago, Rock Island and Pacific Railroad. In 1995, the Union Pacific merged with Chicago and North Western Transportation Company, completing its reach into the Upper Midwest. In 1996, the company merged with Southern Pacific Transportation Company, itself a giant system that was absorbed by the Denver and Rio Grande Western Railroad. The Union Pacific Railroad Company is the principal operating company of the Union Pacific Corporation, which are both headquartered at the Union Pacific Center, in Omaha, Nebraska.
History
Union Pacific in the 19th century
The original company, the "Union Pacific Rail Road", incorporated on July 1, 1862, under the Pacific Railroad Act of 1862. President Abraham Lincoln had approved the act, which authorized railroad construction from the Missouri River to the Pacific to ensure the stability of the Union throughout the American Civil War, but construction did not complete until after that conflict's conclusion. The resulting track ran westward from Council Bluffs, Iowa to meet in Utah the Central Pacific Railroad line, which had been constructed eastward from Sacramento, California. The combined Union Pacific–Central Pacific line became known as the first transcontinental railroad and later the Overland Route.
The line was constructed primarily by Irish labor who had learned their craft during the recent Civil War. Under the guidance of its dominant stockholder Dr. Thomas Clark Durant, the namesake of the city of Durant, Iowa, the first rails were laid in Omaha. The two lines were joined at Promontory Summit, Utah, west of Ogden on May 10, 1869, hence creating the first transcontinental railroad in North America.Subsequently, the UP purchased three Mormon-built roads: the Utah Central Railroad extending south from Ogden to Salt Lake City, the Utah Southern Railroad extending south from Salt Lake City into the Utah Valley, and the Utah Northern Railroad extending north from Ogden into Idaho.
The original UP was entangled in the Crédit Mobilier scandal, exposed in 1872. As detailed by the New York Sun, Union Pacific's largest construction company, Crédit Mobilier, had overcharged Union Pacific; the railroad would then pass the inflated costs on to the United States government. To convince the federal government to accept the increased costs, Crédit Mobilier had bribed multiple congressmen. Several prominent UP board members (including Durant) had been involved in the scheme. The ensuing financial crisis of 1873 led to a credit crunch, but not bankruptcy.
As boom followed bust, the Union Pacific continued to expand. A new company, with dominant stockholder Jay Gould, purchased the old on January 24, 1880. Gould already owned the Kansas Pacific (originally called the Union Pacific, Eastern Division, though in essence a separate railroad), and sought to merge it with UP. Through that merger, the original "Union Pacific Rail Road" transformed into "Union Pacific Railway".
Extending towards the Pacific Northwest, Union Pacific built or purchased local lines to reach Portland, Oregon. Towards Colorado, it built the Union Pacific, Denver and Gulf Railway: a system combining narrow-gauge trackage into the heart of the Rockies and a standard gauge line that ran south from Denver, across New Mexico, and into Texas.
The Union Pacific Railway would later declare bankruptcy during the Panic of 1893. The resulting corporate reorganization reversed Gould's name change: Union Pacific "Railway" merged into a new Union Pacific "Railroad".
Union Pacific in the 20th century
In the early 20th century, Union Pacific's focus shifted from expansion to internal improvement. Recognizing that farmers in the Central and Salinas Valleys of California grew produce far in excess of local markets, Union Pacific worked with its rival Southern Pacific to develop a spoilage-resistant rail-based transport system. These efforts came culminated in the 1906 founding of Pacific Fruit Express, soon to be the world's largest lessee of refrigerated railcars.
Meanwhile, Union Pacific worked to construct a faster, and more direct substitute for the original climb to Promontory Summit. In 1904, the Lucin cutoff opened, reducing curvature and grades. The original route would eventually be stripped of track in 1942 to provide war scrap.
To attract customers during the Great Depression, Union Pacific's chairman W. Averell Harriman simultaneously sought to "spruce up" the quality of its rolling stock and to make its unique locations more desirable travel destinations. The first effort resulted in the purchase of the first streamlined train: the M-10000. The latter resulted in the Sun Valley ski resort in central Idaho; it opened in 1936 and finally was sold in 1964. Despite the fact that the M-10000 and its successors were among the first diesel locomotives, Union Pacific completed dieselization relatively late. In 1944, UP finally received delivery of its last steam locomotive: Union Pacific 844.
As the 20th century waned, Union Pacific recognized—like most railroads—that remaining a regional railroad would only lead to bankruptcy. On December 31, 1925, UP and its subsidiaries operated routes and tracks; in 1980, these numbers had remained roughly constant (9,266 route-miles and 15,647 track-miles). But in 1982, UP acquired the Missouri Pacific and Western Pacific railroads, and 1988, the Missouri–Kansas–Texas. By 1993, Union Pacific had doubled its system to routes.
By then, few large (class I) railroads remained. The same year that Union Pacific merged with the Chicago and North Western (1995), Burlington Northern and ATSF announced merger plans. The impending BNSF amalgamation would leave one mega-railroad in control of the west. To compete, UP merged with Southern Pacific, thereby incorporating D&RGW and Cotton Belt, and forming a duopoly in the West. The merged railroad took the Union Pacific name. As of 1999, the UP had of track, about 33,000 employees, nearly 7,000 locomotives and over 155,000 rail cars.
Facilities
The Union Pacific system includes hundreds of yards. Most are flat yards used for local switching. Other types of yards include intermodal terminals and hump yards. Most UP intermodal terminals are typically ports, but UP also has inland terminals for transfers to trucks, such as the terminal in San Antonio that opened in 2009 or the one in Santa Teresa, New Mexico, that opened in 2014.
Hump yards
In 2006, Union Pacific had 11 major active hump yards:
Bailey Yard in North Platte, Nebraska
Beaumont Yard in Beaumont, Texas
Davidson Yard in Fort Worth, Texas
Davis Yard in Roseville, California
Englewood Yard in Houston, Texas
Gateway Yard in East St Louis, Illinois, owned by subsidiary Alton and Southern Railway
Livonia Yard in Livonia, Louisiana
North Little Rock Yard in North Little Rock, Arkansas
Proviso Yard in Northlake, Illinois, owned by Chicago and North Western Transportation Company until 1995
Strang Yard in La Porte, Texas
West Colton Yard in Bloomington, California
In the late 2010s, Union Pacific began deactivating hump yards in favor of flat switching. In this, Union Pacific followed the industry-wide trend towards Precision Scheduled Railroading (PSR); railway executive Hunter Harrison explained that under PSR, few yards receive enough variegated traffic to necessitate a hump. Union Pacific also closed facilities in Kansas City ("Neff yard"), Hinkle, Oregon, and Pine Bluff, Arkansas in 2019.
Locomotives and rolling stock
Union Pacific has owned some of the most powerful locomotives. These include members of the Challenger-type (including the 3985), and the Northern-type (including the 844), as well as the Big Boy steam locomotives (including the 4014). Union Pacific ordered the first diesel streamliner, the largest fleet of turbine-electric locomotives in the world, and the largest diesel locomotives ever built (including 6936).
Paint and colors
The yellow paint scheme was introduced in the spring of 1934. Engineers claimed the visibility of yellow would reduce grade crossing accidents. In 1941, UP introduced its yellow and gray color scheme with red highlights, which remains in use today.
The middle two-thirds of the locomotive body is painted Armour Yellow, a color used by Armour and Company on the packaging of its meat products. A thin band of Signal Red divides this from the Harbor Mist Gray (a light gray) used for the body and roof above that point. There is also a thin band of Signal Red along the bottom of the locomotive body, but this color has gradually become yellow as new Federal Railroad Administration (FRA) regulations for reflectorized tape came into effect in 2005; the trucks (painted Aluminum from 1955 to 1982), underframe, fuel tanks and everything else beneath that line are also Harbor Mist Gray. Lettering and numbering are in Signal Red, with black outlines. Most locomotives have white-outlined blue "wings" on the nose, on either side of the renowned shield featuring white lettering on a blue background and, below it, red and white vertical stripes. Beginning in early 2002, a number of units were repainted with a large, billowing American flag with the corporate motto "Building America" on the side, where the 'UNION PACIFIC' lettering is normally positioned.
Merger partner locomotives
Until 2017, UP operated some locomotives still in the paint scheme of their former railroads. In addition, some locomotives were renumbered by UP, varying in the degree of the previous railroads' logos being eradicated, but always with a yellow patch applied over the locomotive's former number and a new UP number applied on the cab. That allowed UP to number locomotives into its roster without spending the time and money necessary to perform a complete repaint. In May 2015, UP rostered 212 "patches", consisting of:
22 Chicago and North Western (whose CNW logos have been hidden by the "patches"),
174 Southern Pacific (AC4400CW, GP40-2, MP15AC, and GP60)
14 St. Louis Southwestern (GP60)
2 Denver and Rio Grande Western (GP60)
While not technically a predecessor locomotive in the traditional sense, UP also rostered a single SD40-2 (3564, since retired) still in the 1970s paint scheme, not counting DDA40X No. 6936, which was part of the Union Pacific Heritage Fleet until 2022.
In 2017, Union Pacific decided to repaint all locomotives which were not in the current corporate colors. only 41 locomotives remained unpainted.
Commemorative color schemes
From the second half of 2005 to the summer of 2006, UP unveiled a new set of six EMD SD70ACe locomotives in "Heritage Colors", painted in schemes reminiscent of railroads acquired by the Union Pacific Corporation since the 1980s. The engine numbers match the year that the predecessor railroad became part of the Union Pacific system. The locomotives commemorate the Missouri Pacific with UP 1982, the Western Pacific with UP 1983, the Missouri–Kansas–Texas with UP 1988, the Chicago and North Western with UP 1995, the Southern Pacific with UP 1996, and the Denver and Rio Grande Western with UP 1989.
In October 2005, UP unveiled SD70ACe 4141, commissioned in honor of George Bush. The locomotive has "George Bush 41" on the sides and its paint scheme resembles that of Air Force One. It was sent into storage in 2007, but returned in 2018 to power Bush's funeral train. It was donated to the George H.W. Bush Presidential Library and Museum on November 8, 2019.
On March 31, 2010, UP dedicated a specially painted GE ES44AC locomotive commemorating the centennial of the Boy Scouts of America.
On September 28, 2010, UP dedicated a specially painted GE ES44AC locomotive, as a tribute to Susan G. Komen for the Cure.
On October 19, 2017, Union Pacific unveiled SD70AH 1943, "The Spirit of the Union Pacific", which is painted in a scheme to honor the United States armed forces.
On June 6, 2019, Union Pacific unveiled SD70ACe 1111, the "Powered By Our People" unit.
In April 2021, Union Pacific repainted an SD70M into a commemorative paint scheme called "We Are ONE" to honor Juneteenth and Pride Month.
UP also has a collection of locomotives painted for Operation Lifesaver, a rail safety organization founded in 1970.
2013 locomotive roster
As of October 2013, the Union Pacific had 8,185 locomotives on its active roster. The locomotive fleet consists of 43 different models and had an average age of 17.8 years. According to Union Pacific, this is the largest fleet of diesel-electric locomotives in the US.
Heritage equipment
Union Pacific continues to use a small number of "heritage" steam locomotives and early streamlined diesel locomotives. This equipment is used on special charters (excursions).
Low-emissions locomotives
Union Pacific maintains a fleet of low-emissions locomotives. Most are used in Los Angeles basin rail yards, to satisfy an air quality agreement with the local authorities.
Facts and figures
According to UP's 2007 Annual Report to Investors, at the end of 2007 it had more than 50,000 employees, 8,721 locomotives, and 94,284 freight cars.
Broken down by specific type of car, owned and leased:
35,437 covered hoppers
12,272 boxcars
18,647 open-top hoppers
13,780 gondolas
14,148 "other" types of cars
In addition, it owns 6,950 different pieces of maintenance of way work equipment. At the end of 2007, the average age of UP's locomotive fleet was 14.8 years, the freight car fleet 28 years.
UP was ranked 134th on the 2019 Fortune 500 list of the largest United States corporations by revenue and had 41,967 employees. The president of Union Pacific since August 14 2023 is Jim Vena.
in 2019 Union Pacific has been rated the worst company to work for by 247wallst.com, citing Past CEO Lance Fritz's 12% approval rating and the 22% recommendation rating from Glassdoor.com.
Passenger service
Commuter services
When Union Pacific bought out the Chicago & North Western in 1995, it inherited the railroad's Metra commuter rail services in the Chicago metropolitan area: the UP North, UP Northwest, and UP West lines, all of which operate from the Ogilvie Transportation Center (the former North Western Station–a name still used by many Chicago residents). In order to ensure uniformity across the Chicago area commuter rail system, trains are branded as Metra services and use Metra equipment. However, Union Pacific crews continue to operate the trains under a purchase-of-service agreement.
Former services
Between 1869 and 1971, Union Pacific operated passenger service throughout its historic "Overland Route". These trains ran between Chicago and Omaha on the Chicago & Northwestern trackage starting in 1936. Disputes over trackage rights and passenger revenues with the C&NW prompted the UP to switch to the Milwaukee Road for the handling of its streamliner trains between Chicago and Omaha beginning in late 1955. The last intercity passenger train operated by UP was the westbound City of Los Angeles, arriving at Los Angeles Union Station on May 2. Since then, Union Pacific has satisfied its common carrier requirements by hosting Amtrak trains.
Hosted trains
Many Amtrak and commuter rail routes use Union Pacific rails. This list excludes the commuter services the company directly operates in Chicago (see above).
Amtrak
Amtrak Cascades
California Zephyr
Capitol Corridor
Coast Starlight
Lincoln Service
Missouri River Runner
Pacific Surfliner
San Joaquin
Sunset Limited
Texas Eagle
Commuter trains
Altamont Corridor Express
Caltrain
FrontRunner
Metrolink
Riverside Line
Ventura County Line
RTD commuter rail
G Line
Trinity Railway Express
Notable accidents
21st century
September 4, 2007: a Union Pacific train derailment split the small town of Sergeant Bluff, Iowa. About 16 cars derailed, most carrying salt that spilled into snow-like piles. The derailment interrupted traffic for about two hours.
June 24, 2012: three crew members died and caused a property damage of $15 million when two Union Pacific trains collided head-on just east of Goodwell, Oklahoma. The eastbound train passed a stop signal on the main track and struck the westbound train in a siding about east of the meeting point. The NTSB provided the probable causes as eastbound train's operator's vision problems and failure by the conductor to get backup assistance as required. NTSB stated UP did not comply with its own policies when it medically recertified the operator. The company only had six color tests despite the policy requiring a color test for 10 signals.
November 15, 2012: A UP train struck a parade float in Midland, Texas, killing four and injuring 16 passengers on the parade float.
May 25, 2013: in Chaffee, Missouri, a Union Pacific train collided with a BNSF train at a level junction, injuring seven, and causing damages exceeding $10 million. The accident caused a Missouri Route M overpass to partially collapse and caused a fire. The investigation concluded the engineer most likely fell asleep, due to sleep apnea. The uncontrolled train violated four progressively more restrictive signals before colliding with the BNSF train at roughly . Three months later, the Route M overpass reopened with a new design.
June 3, 2016: a 96-car oil train derailed in the Columbia River Gorge near Mosier, Oregon. Eleven cars derailed, at least one caught on fire, and of Bakken crude oil spilled, some going into the Columbia River. Some were eventually recovered.
Mid-late 2018: the Niland Geyser, a moving mud pot, encroached on the railroad near the eastern shore of the Salton Sea, requiring extensive engineering work to first delay the movement and then build a temporary diversion.
September 7, 2019: a Union Pacific train of two locomotives and three tank cars carrying liquefied petroleum gas derailed and crashed into an overpass support column at the Albina Yard in Portland, Oregon The support column is for the eastbound lanes of the six-lane Going Street overpass, which is the only public access to the major industrial area Swan Island for cars and trucks. Four lanes were left unsafe after the derailment. Two of six lanes remain closed as of November 14, 2019. The cause of the crash was broken rails. There was nobody on board the train which was remotely operated at the time of crash. In May 2020, another Union Pacific derailment damaged a different overpass which The Skanner described as an ongoing safety concern.
March 21, 2022: a Union Pacific freight train derailed and fell from a viaduct in Colton, California.
San Antonio area
On June 28, 2004, a UP train collided with an idle BNSF train in a San Antonio suburb. In the course of the derailment, a 90-ton tank car carrying liquified chlorine was punctured. As the chlorine vaporized, a toxic "yellow cloud" formed, killing three and causing 43 hospitalizations. The costs of cleanup and property damaged during the incident exceeded $7 million.
Investigations of the Macdona incident revealed several serious safety lapses on the part of the Union Pacific and its employees, including employees not following the company's own safety rules. While the immediate cause of the derailment was the UP crew's "fatigue", chlorine tank cars had been improperly placed near the front of the train, a danger in the case of derailment.
The Macdona incident was not the first derailment in the San Antonio area. Between May and November 1994, Union Pacific trains derailed five times, killing at least 4 people. Between June 2004 and March 2005, 10 trains derailed, killing as many people.
In the aftermath of Macdona, the Federal Railroad Administration signed a compliance agreement with the railroad in which the railroad promised to rectify the "notable deficiencies" that regulators found. But the relative impunity UP seemed to exhibit regarding the derailment led to suggestions that the FRA was far "too cozy...to the railroads." In March 2005, Texas Governor Rick Perry supported a plan to reroute trains around large urban population centers in Texas, including San Antonio, but such a plan was purely voluntary and had no timetable associated.
Trains have continued to derail in the area including an incident in June 2009 where tank cars containing chlorine and petroleum naptha xylene derailed, but did not spill.
Community responsibility
Transient camp and graffiti issues
The City of San Jose, California, threatened Union Pacific with a lawsuit in 2019 after years of complaints about transient and graffiti blight going unaddressed. For the first time in many years, Union Pacific cleaned out along the tracks starting in November 2019. San Jose Councilman Sergio Jimenez said "The reality is that Union Pacific has not been a good neighbor".
San Jose's mayor Sam Liccardo said"At any given conference of mayors, you won't hear anyone expressing confidence that Union Pacific will respond nimbly or collaboratively," and "But we are hopeful that the (memorandum of understanding) will turn a page on Union Pacific's behavior in the past to enable a more collaborative relationship going forward."The Mercury News reports that company has been uncooperative and non responsive to working together, such as failing to come through with graffiti abatement as Union Pacific had promised the city.
2022 Utah Legislative Action
In 2022, legislators in Utah brought forth two separate bills specifically aimed at Union Pacific. The first, HB181, was raised after some municipalities encountered resistance from Union Pacific when attempting to upgrade rail crossings. In Logan, Utah, Union Pacific altered a construction agreement to require the city to pay maintenance fees in perpetuity for an upgraded crossing, a mandate which was against state code. The proposed legislation would make it easier for municipalities to get crossing improvements approved, and clarifies which party must pay associated maintenance costs. The second bill, HB405, would have required Union Pacific to replace their aging fleet of Tier 0 switching locomotives with hydrogen or electric engines by 2028, due to Utah having very poor air quality in winter months. According to Utah Senator Schultz, Union Pacific was uncooperative on the switching locomotive bill if Utah did not drop the railroad crossings bill. Ultimately, HB181 passed, and HB405 was dropped after Union Pacific made voluntary commitments to replace several tier 0 switching locomotives with less polluting tier 2 locomotives, as well as to test some all electric ones in the Utah Roper Rail Yard.
Environmental record
In Eugene, Oregon, where pollution from a century-old rail yard has been seeping into groundwater, the UP and the Oregon Department of Environmental Quality launched a study of ground contamination in 2008. The pollutants are mostly petroleum hydrocarbons, industrial solvents, and metals.
In 2007, Union Pacific Railroad worked with the US EPA to develop a way to reduce locomotive exhaust emissions. They discovered that adding an oxidation catalyst filtering canister to the diesel engine's exhaust manifold and using ultra-low-sulfur diesel fuel would reduce particulate emissions by about half, unburned hydrocarbons by 38 percent, and carbon monoxide by 82 percent.
The company's Fuel Master program rewards locomotive engineers who save the most fuel each month. The program has saved the company millions of dollars, much of which has been returned to the engineers. In 2006, the program's founder, Wayne Kennedy, received the John H. Chafee Environmental Award, and the program was recognized by Transportation Secretary Norman Mineta.
In January 2018, a former waste water operator at Union Pacific Albina Yard in Portland, Oregon, employed by the railroad's contractor Mott MacDonald negligently released thousands of gallons of oil into the environment. The operator was distracted by a cell phone and allowed the tank to overflow for over an hour. An engineering firm hired by Union Pacific estimates of it was released into nearby Willamette River, not including the spill that was captured by the containment booms. Employees of United States Environmental Protection Agency who were working at facilities nearby placed booms to contain the oil spill. Federal prosecutors have charged the operator Robert LaRue Webb II with violation of the Clean Water Act for releasing the oil into the environment. Webb pleaded guilty in August 2019, and was sentenced to two years probation and a $2,500 fine.
In 2016, the Union Pacific Railroad Co. was named as a defendant in a lawsuit seeking cleanup of a contaminated rail yard site that operated in Lafayette, Louisiana, from the late 1800s until the 1960s.
In 2020, Houston residents living near a Union Pacific Railroad Company rail yard filed lawsuits against the Union Pacific. These lawsuits followed the finding by the State of Texas of a higher-than-expected incidence of certain cancers in residents living close to the yard.
A State of Texas report released in 2021 identified an additional cancer cluster of lymphoblastic leukemia in children.
EMP
Union Pacific and Norfolk Southern are the largest owner-partners of Equipment Management Pool (EMP), a domestic freight interline intermodal freight transport service that rents and moves more than 35,000 53-foot containers and chassis throughout North America. Other partners in the freight company include Canadian National Railway, I&M Rail Link, Iowa Interstate Railroad, Wisconsin Central Ltd., and Kansas City Southern Railway.
In 2022, Canadian Pacific Railway was dropped from the pool, leaving CN as the only Canadian member.
Union Pacific Railroad Museum
The Union Pacific Railroad Museum is a former Carnegie library in Council Bluffs, Iowa that houses artifacts, photographs, and documents that trace the development of the railroad and the American West. The company pays upkeep on the privately owned building, which houses part of Union Pacific's corporate collection, one of the oldest in the United States. Holdings include weapons from the late 19th and 20th centuries, outlaw paraphernalia, a sampling of the immigrants' possessions, and a photograph collection comprising more than 500,000 images.
See also
Central Pacific Railroad
First transcontinental railroad
Hell on Wheels (TV series involving Union Pacific set in 1865)
History of rail transportation in California
Kansas Pacific Railway
Los Angeles and Salt Lake Railroad
Missouri–Kansas–Texas Railroad
Missouri Pacific Railroad
Oregon Railroad and Navigation Company
Oregon Short Line
Pacific Fruit Express
Railex
Southern Pacific Transportation Company
Sun Valley, Idaho
Western Pacific Railroad
Notes
References
Further reading
– covers impact of the railroad on the region it served from the 1860s to the 1890s.
– heavily illustrated
– the standard scholarly history
illustrated account of the Union Pacific and other North American Railroads
External links
1862 establishments in Nebraska Territory
American companies established in 1862
Class I railroads in North America
First transcontinental railroad
Arizona railroads
Arkansas railroads
California railroads
Colorado railroads
Idaho railroads
Illinois railroads
Iowa railroads
Kansas railroads
Louisiana railroads
Minnesota railroads
Missouri railroads
Montana railroads
Nebraska railroads
Nevada railroads
New Mexico railroads
Oklahoma railroads
Oregon railroads
Tennessee railroads
Texas railroads
Utah railroads
Washington (state) railroads
Wisconsin railroads
Wyoming railroads
Southern Pacific Railroad
Rail lines receiving land grants
Railway companies established in 1862
Railway companies disestablished in 1880
Railway companies established in 1897
Companies based in Omaha, Nebraska
Companies listed on the New York Stock Exchange
Defunct Michigan railroads
Defunct South Dakota railroads
Rail in St. Louis
Railway lines in Omaha, Nebraska
Superfund sites in Oregon
Economy of the Western United States
|
St Paul's Church is a redundant Anglican parish church in St Paul's Square, Preston, Lancashire, England. It is recorded in the National Heritage List for England as a designated Grade II listed building. It was a Commissioners' church, having received a grant towards its construction from the Church Building Commission.
The building also housed radio station Red Rose Radio (later Rock FM and Greatest Hits Radio Lancashire) from 1981 to 2020.
History
St Paul's was built between 1823 and 1825, and was designed by Thomas Rickman and Henry Hutchinson. A grant of £6,221 () was given towards its construction by the Church Building Commission. In 1882 a chancel was added to the church, and a baptistery was created within the church, by T. H. Myers. The church was declared redundant on 1 January 1979. In 1981 it was bought for £35,000 by Red Rose Radio who spent £780,000 to convert it into a radio station. The conversion was carried out by Sandy Brown Associates. Two radio stations, 97.4 Rock FM and Greatest Hits Lancashire, used to broadcast from the building until 2020.
Architecture
The former church is constructed in sandstone with a tiled roof. Its architectural style is Early English. The plan consists of a seven-bay nave with full-height aisles, a two-bay chancel and offices. It has a three-span roof. The west end is in three sections; the central section is gabled, and the side sections are smaller with angle buttresses. Octagonal turrets rise at the junctions of the sections. In the lower part of the central section is a three-bay arcade, each arch containing a window. Above the arcade are three stepped lancet windows, over which is a small circular window. The turrets are slim and contain open arcading, and an embattled cap over which is a tall pinnacle with a quatrefoil finial. Each side section contains a tall lancet window. Along the side of the church, the bays are divided by buttresses. The first bays contain a doorway with a window above it, and all the other bays have pairs of lancet windows. At the east end of the church are three stepped lancet windows and pinnacles similar to those at the west end.
War Memorial
The parish war memorial stands in the northern corner of the former church's grounds having been relocated there from its original location nearby due to vandalism. It takes the form of a slim hexagonal column of sandstone, similar to the church, on a small stepped base surmounted by six grouped columns with a Celtic-style cross on the top. Originally it bore metal plates commemorating the men of the parish who lost their lives in World War One (and World War Two?) but these have been removed at some point and their location is unknown.
See also
Listed buildings in Preston, Lancashire
List of Commissioners' churches in Northeast and Northwest England
References
Grade II listed churches in Lancashire
Church of England church buildings in Lancashire
Gothic Revival church buildings in England
Gothic Revival architecture in Lancashire
Churches completed in 1825
19th-century Church of England church buildings
Churches completed in 1882
Commissioners' church buildings
Former Church of England church buildings
St Paul's Church
Thomas Rickman buildings
Former churches in Lancashire
|
```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.
############################################################################*/
/// TPM log error prints
/*! \file */
#ifndef EPID_MEMBER_TPM2_IBM_TSS_PRINTTSS_H_
#define EPID_MEMBER_TPM2_IBM_TSS_PRINTTSS_H_
#if !defined(EPID_ENABLE_DEBUG_PRINT)
/// Do not print tpm2 response error if EPID_ENABLE_DEBUG_PRINT is undefined
#define print_tpm2_response_code(...)
#else
#include <tss2/TPM_Types.h>
#include <tss2/tss.h>
/// Print TPM 2.0 response code as human readable message
/*!
* \param[in] operation The operation that returned the code
* \param[in] rc The response code
*/
void print_tpm2_response_code(char const* operation, TPM_RC rc);
#endif
#endif // EPID_MEMBER_TPM2_IBM_TSS_PRINTTSS_H_
```
|
Bartłomiej Kluth (born 20 December 1992) is a Polish professional volleyball player who plays as an opposite spiker for ZAKSA Kędzierzyn-Koźle. He is a three–time Champions League winner (2021, 2022) and the current PlusLiga record holder in number of scored points in one match (40).
Honours
Club
CEV Champions League
2020–21 – with ZAKSA Kędzierzyn-Koźle
2021–22 – with ZAKSA Kędzierzyn-Koźle
2022–23 – with ZAKSA Kędzierzyn-Koźle
Domestic
2020–21 Polish SuperCup, with ZAKSA Kędzierzyn-Koźle
2020–21 Polish Cup, with ZAKSA Kędzierzyn-Koźle
2021–22 Polish Cup, with ZAKSA Kędzierzyn-Koźle
2021–22 Polish Championship, with ZAKSA Kędzierzyn-Koźle
2022–23 Polish Cup, with ZAKSA Kędzierzyn-Koźle
References
External links
Player profile at LegaVolley.it
Player profile at PlusLiga.pl
Player profile at Volleybox.net
1992 births
Living people
People from Lidzbark County
Sportspeople from Warmian-Masurian Voivodeship
Polish men's volleyball players
Polish expatriate sportspeople in Israel
Expatriate volleyball players in Israel
Polish expatriate sportspeople in Italy
Expatriate volleyball players in Italy
Ślepsk Suwałki players
Blu Volley Verona players
ZAKSA Kędzierzyn-Koźle players
Opposite hitters
|
Greenhouse debt is the measure to which an individual person, incorporated association, business enterprise, government instrumentality or / [and] (per Neb., USA) geographic community exceeds its permitted greenhouse footprint and emits greenhouse gases that contribute to global warming and climate change.
Friends of the Earth and similar organisations put forward the concept to define specifically the environmental harm caused by developed countries' past and present policies. Some governments, at least the Australian Labor leadership, have a tendency to accept such a line of reasoning. The concept, however, makes no sense without a clear numerical value for the permitted greenhouse footprint, which is not easily defined or estimated.
The greenhouse debt assessment thus forms an ecological footprint analysis, but can be used separately. Taken conjointly with a 'water debt' analysis and an ecological impact assessment, greenhouse debt analysis is basic to giving individuals, organisations, governments and communities an understanding of the effects they are having on Gaia, life, and global warming.
Ensuring that the greenhouse debt is zero is essential towards achieving ecologically sustainable development or a sustainable retreat. Any greenhouse debt incurred will contribute to making life harder for future generations of humans and non-human lifeforms.
There are three possible consequences that occur as a result of a greenhouse debt.
Mitigation: finding compensatory ways of reducing the greenhouse debt so its effects are neutralised
Adaptation: finding ways of adjusting to the resulting global warming or climate change
Suffering: having one's quality of life reduced as a result of the consequences
See also
Ecological debt
Ecological deficit
Ecological footprint
References
Climate change assessment and attribution
Greenhouse gas emissions
Sustainable development
|
```css
Sass Extend/Inheritance
Sass Supported Comments
Using SassScripts Interactive Shell
SassScript Color Operations
SassScript String Operations
```
|
```emacs lisp
;;; rmailkwd.el --- part of the "RMAIL" mail reader for Emacs
;; Inc.
;; Maintainer: emacs-devel@gnu.org
;; Keywords: mail
;; Package: rmail
;; This file is part of GNU Emacs.
;; GNU Emacs is free software: you can redistribute it and/or modify
;; (at your option) any later version.
;; GNU Emacs 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 GNU Emacs. If not, see <path_to_url
;;; Commentary:
;;; Code:
(require 'rmail)
;; Global to all RMAIL buffers. It exists for the sake of completion.
;; It is better to use strings with the label functions and let them
;; worry about making the label.
(defvar rmail-label-obarray (make-vector 47 0)
"Obarray of labels used by Rmail.
`rmail-read-label' uses this to offer completion.")
;; Initialize with the standard labels.
(mapc (lambda (s) (intern (cadr s) rmail-label-obarray))
rmail-attr-array)
(defun rmail-make-label (s)
"Intern string S as a downcased symbol in `rmail-label-obarray'."
(intern (downcase s) rmail-label-obarray))
;;;###autoload
(defun rmail-add-label (label)
"Add LABEL to labels associated with current RMAIL message.
Completes (see `rmail-read-label') over known labels when reading.
LABEL may be a symbol or string. Only one label is allowed."
(interactive (list (rmail-read-label "Add label")))
(rmail-set-label label t))
;;;###autoload
(defun rmail-kill-label (label)
"Remove LABEL from labels associated with current RMAIL message.
Completes (see `rmail-read-label') over known labels when reading.
LABEL may be a symbol or string. Only one label is allowed."
(interactive (list (rmail-read-label "Remove label")))
(rmail-set-label label nil))
;;;###autoload
(defun rmail-read-label (prompt)
"Read a label with completion, prompting with PROMPT.
Completions are chosen from `rmail-label-obarray'. The default
is `rmail-last-label', if that is non-nil. Updates `rmail-last-label'
according to the choice made, and returns a symbol."
(let* ((old nil)
(result
(progn
;; If the summary exists, we've already read all the
;; existing labels. If not, read the ones in this message.
(or (eq major-mode 'rmail-summary-mode)
(rmail-summary-exists)
(and (setq old (rmail-get-keywords))
(mapc 'rmail-make-label (split-string old ", "))))
(completing-read (concat prompt
(if rmail-last-label
(concat " (default "
(symbol-name rmail-last-label)
"): ")
": "))
rmail-label-obarray
nil
nil))))
(if (string= result "")
rmail-last-label
(setq rmail-last-label (rmail-make-label result)))))
(declare-function rmail-summary-update-line "rmailsum" (n))
(defun rmail-set-label (label state &optional msg)
"Set LABEL as present or absent according to STATE in message MSG.
LABEL may be a symbol or string."
(or (stringp label) (setq label (symbol-name label)))
(if (string-match "," label)
(error "More than one label specified"))
(with-current-buffer rmail-buffer
(rmail-maybe-set-message-counters)
(if (zerop (or msg (setq msg rmail-current-message)))
(error "No message"))
;; Force recalculation of summary for this message.
(aset rmail-summary-vector (1- msg) nil)
(let (attr-index)
;; Is this label an attribute?
(dotimes (i (length rmail-attr-array))
(if (string= (cadr (aref rmail-attr-array i)) label)
(setq attr-index i)))
(if attr-index
;; If so, set it as an attribute.
(rmail-set-attribute attr-index state msg)
;; Is this keyword already present in msg's keyword list?
(let* ((header (rmail-get-keywords msg))
(regexp (concat ", " (regexp-quote label) ","))
(present (not (null
(string-match regexp (concat ", " header ","))))))
;; If current state is not correct,
(unless (eq present state)
;; either add it or delete it.
(rmail-set-header
rmail-keyword-header msg
(if state
;; Add this keyword at the end.
(if (and header (not (string= header "")))
(concat header ", " label)
label)
;; Delete this keyword.
(let ((before (substring header 0
(max 0 (- (match-beginning 0) 2))))
(after (substring header
(min (length header)
(- (match-end 0) 1)))))
(cond ((string= before "")
;; If before and after both empty, delete the header.
(unless (string= after "")
after))
((string= after "")
before)
(t (concat before ", " after))))))))))
(if (rmail-summary-exists)
(rmail-select-summary (rmail-summary-update-line msg)))
(if (= msg rmail-current-message)
(rmail-display-labels))))
;; Motion on messages with keywords.
;;;###autoload
(defun rmail-previous-labeled-message (n labels)
"Show previous message with one of the labels LABELS.
LABELS should be a comma-separated list of label names.
If LABELS is empty, the last set of labels specified is used.
With prefix argument N moves backward N messages with these labels."
(interactive "p\nsMove to previous msg with labels: ")
(rmail-next-labeled-message (- n) labels))
(declare-function mail-comma-list-regexp "mail-utils" (labels))
;;;###autoload
(defun rmail-next-labeled-message (n labels)
"Show next message with one of the labels LABELS.
LABELS should be a comma-separated list of label names.
If LABELS is empty, the last set of labels specified is used.
With prefix argument N moves forward N messages with these labels."
;; FIXME show the default in the prompt.
(interactive "p\nsMove to next msg with labels: ")
(if (string= labels "")
(setq labels rmail-last-multi-labels))
(or labels
(error "No labels to find have been specified previously"))
(set-buffer rmail-buffer)
(setq rmail-last-multi-labels labels)
(rmail-maybe-set-message-counters)
(let ((lastwin rmail-current-message)
(current rmail-current-message)
(regexp (concat " \\("
(mail-comma-list-regexp labels)
"\\)\\(,\\|\\'\\)")))
(while (and (> n 0) (< current rmail-total-messages))
(setq current (1+ current))
(if (string-match regexp (rmail-get-labels current))
(setq lastwin current n (1- n))))
(while (and (< n 0) (> current 1))
(setq current (1- current))
(if (string-match regexp (rmail-get-labels current))
(setq lastwin current n (1+ n))))
(if (< n 0)
(error "No previous message with labels %s" labels)
(if (> n 0)
(error "No following message with labels %s" labels)
(rmail-show-message-1 lastwin)))))
(provide 'rmailkwd)
;; Local Variables:
;; generated-autoload-file: "rmail-loaddefs.el"
;; End:
;;; rmailkwd.el ends here
```
|
```xml
"use client"
import * as React from "react"
import * as SwitchPrimitives from "@radix-ui/react-switch"
import { cn } from "@/lib/utils"
const Switch = React.forwardRef<
React.ElementRef<typeof SwitchPrimitives.Root>,
React.ComponentPropsWithoutRef<typeof SwitchPrimitives.Root>
>(({ className, ...props }, ref) => (
<SwitchPrimitives.Root
className={cn(
"peer inline-flex h-[24px] w-[44px] shrink-0 cursor-pointer items-center rounded-full border-2 border-transparent transition-colors focus-visible:outline-none focus-visible:ring-2 focus-visible:ring-primary focus-visible:ring-offset-2 focus-visible:ring-offset-white disabled:cursor-not-allowed disabled:opacity-50 data-[state=checked]:bg-primary data-[state=unchecked]:bg-slate-200",
className
)}
{...props}
ref={ref}
>
<SwitchPrimitives.Thumb
className={cn(
"pointer-events-none block h-5 w-5 rounded-full bg-white shadow-lg ring-0 transition-transform data-[state=checked]:translate-x-5 data-[state=unchecked]:translate-x-0"
)}
/>
</SwitchPrimitives.Root>
))
Switch.displayName = SwitchPrimitives.Root.displayName
export { Switch }
```
|
```swift
import SwiftUI
struct ComplexModificationsAdvancedView: View {
@ObservedObject private var settings = LibKrbn.Settings.shared
var body: some View {
VStack(alignment: .leading, spacing: 24.0) {
GroupBox(label: Text("type:basic parameters")) {
VStack(alignment: .leading, spacing: 12.0) {
HStack {
Text("to_if_alone_timeout_milliseconds:")
IntTextField(
value: $settings.complexModificationsParameterToIfAloneTimeoutMilliseconds,
range: 0...10000,
step: 100,
width: 50)
Text("(Default value is 1000)")
Spacer()
}
Divider()
HStack {
Text("to_if_held_down_threshold_milliseconds:")
IntTextField(
value: $settings.complexModificationsParameterToIfHeldDownThresholdMilliseconds,
range: 0...10000,
step: 100,
width: 50)
Text("(Default value is 500)")
Spacer()
}
Divider()
HStack {
Text("to_delayed_action_delay_milliseconds:")
IntTextField(
value: $settings.complexModificationsParameterToDelayedActionDelayMilliseconds,
range: 0...10000,
step: 100,
width: 50)
Text("(Default value is 500)")
Spacer()
}
Divider()
HStack {
Text("simultaneous_threshold_milliseconds:")
IntTextField(
value: $settings.complexModificationsParameterSimultaneousThresholdMilliseconds,
range: 0...1000,
step: 20,
width: 50)
Text("(Default value is 50)")
Spacer()
}
}
.padding(6.0)
}
GroupBox(label: Text("type:mouse_motion_to_scroll parameters")) {
VStack(alignment: .leading, spacing: 12.0) {
HStack {
Text("speed:")
IntTextField(
value: $settings.complexModificationsParameterMouseMotionToScrollSpeed,
range: 0...10000,
step: 10,
width: 50)
Text("% (Default value is 100)")
Spacer()
}
}
.padding(6.0)
}
Spacer()
}
.padding()
}
}
struct ComplexModificationsAdvancedView_Previews: PreviewProvider {
static var previews: some View {
ComplexModificationsAdvancedView()
}
}
```
|
State Highway 231 (SH 231) is a state highway in Pueblo County, Colorado, United States. SH 231's southern terminus is at U.S. Route 50 Business (US 50 Bus.) in Vineland, and the northern terminus is at U.S. Route 50 (US 50) and SH 96 in Devine.
Route description
SH 231 runs , starting at a junction with US 50 Bus., heading north across the Arkansas River and ending at a junction with US 50 / SH 96.
Major intersections
See also
List of state highways in Colorado
References
External links
231
Transportation in Pueblo County, Colorado
|
The Alliance of Sahel States (; AES) is a mutual defense pact created between Mali, Niger, and Burkina Faso on 16 September 2023. The pact was created during the 2023 Nigerien crisis, in which the West African political bloc ECOWAS threatened to intervene militarily to restore civilian rule after a coup in Niger earlier that year.
The alliance's stated goal is to protect against possible threats of armed rebellion or external aggression, emphasizing that "any attack on the sovereignty and territorial integrity of one or more contracted parties will be considered an aggression against the other parties".
Background
The Sahel region has been the site of an ongoing jihadist insurgency since 2003, which has led to many conflicts in the region, such as the Mali War and the Boko Haram insurgency. All three member states have had their pro-Western governments overthrown by their militaries, and each is ruled by a junta as part of the Coup Belt.
In the 2021 Malian coup d'état, Assimi Goïta and the National Committee for the Salvation of the People seized power in Mali taking over from Bah Ndaw who himself came to power in the 2020 Malian coup d'état overthrowing the last democratically elected President of Mali, Ibrahim Boubacar Keïta.
Just months later, in the 2021 Guinean coup d'état the National Committee of Reconciliation and Development installed Mamady Doumbouya as the new president, overthrowing the elected Alpha Condé.
Burkina Faso's military overthrew their existing military government in the September 2022 Burkina Faso coup d'état, installing Ibrahim Traoré over Paul-Henri Sandaogo Damiba who came to power in the January 2022 Burkina Faso coup d'état which toppled the democratic government of President Roch Marc Christian Kaboré.
Most recently the National Council for the Safeguard of the Homeland has overthrown the elected government of Niger's Mohamed Bazoum, installing Abdourahamane Tchiani and a new junta in the 2023 Nigerien coup d'état.
All three of the alliance's member states are suspended members of ECOWAS; following the coup in Niger, ECOWAS has threatened to intervene militarily and restore President Bazoum's government, resulting in the 2023 Nigerien crisis. The Nigerien government has the backing of Mali and Burkina Faso, which promised military aid to Niger in the event of an intervention, and Guinea, which has been offering diplomatic support. The promises of military aid resulted in the creation of AES as a mutual defense block for the three nations in an attempt to stave off an ECOWAS intervention.
See also
G5 Sahel
Coup Belt
References
2023 Nigerien crisis
21st-century military alliances
Treaties entered into force in 2023
Military history of Burkina Faso
Military history of Mali
Military history of Niger
2023 in international relations
External links
Charter of Liptako-Gourma establishing the Alliance of Sahel States
|
James Wright Gordon (1809 – December 1853), usually referred to as J. Wright Gordon, was a Whig politician from the U.S. state of Michigan.
Life and politics in Michigan
Gordon was born in Plainfield, Connecticut and studied law at Harvard University. He was a descendant of Edmond Gordon the immigrant, who arrived from England in 1635 as part of the Puritan migration to New England.
He later moved to Michigan, establishing a practice in Marshall, and also lived for a time in Battle Creek. He was a member of the Michigan State Senate (6th district) in 1839 and served as the second lieutenant governor of Michigan from 1840 to 1841.
Gordon became the third governor of Michigan ex officio, when William Woodbridge resigned on February 23, 1841, to become a U.S. Senator. He completed the remainder of Woodbridge's term, until January 3, 1842.
He ran unsuccessfully for U.S. Representative from Michigan's 2nd congressional district in 1846 and 1847, being defeated by John Smith Chipman.
Death in Brazil
Gordon was at the U.S. Consul in Pernambuco, Brazil from 1850 to 1853 and died at the age of 44, while in office, when he accidentally fell to his death from a second-story balcony. He is buried in Brazil.
References
The Political Graveyard
1809 births
1853 deaths
Accidental deaths in Brazil
Accidental deaths from falls
American consuls
People from Plainfield, Connecticut
Michigan Whigs
Whig Party state governors of the United States
19th-century American politicians
Governors of Michigan
Lieutenant Governors of Michigan
Michigan state senators
19th-century American diplomats
|
Streptocephalus proboscideus, sometimes called the Sudanese fairy shrimp, is a species of fairy shrimp found in eastern Africa.
Characteristics
S. proboscideus may reach in length. The colouring varies from translucent to almost black. The Latin name, Streptocephalus proboscideus, means "twisted head with a proboscis", referring to a median appendage on the head between the antennae. The male antennae are the main identification feature of this species.
It is an active swimmer, requiring a water temperature of or higher. This fairy shrimp may filter up to of water in 24 hours. S. proboscideus may live as long as 9 months under laboratory conditions.
Ecology
The Sudanese fairy shrimp is found in shallow rain pools where it may form huge swarms. Its eggs may lie dormant in dry mud for several years. This fairy shrimp is an omnivore that can filter particles as small as yeast cells or as large as 0.2 mm. It may also eat nauplii of its own species or other species indiscriminately.
Life cycle
An S. proboscideus nauplius turns into a mature individual in less than two weeks. The female produces clutches of 100–300 eggs. An average female may produce 35–40 such clutches in her lifetime. She must be fertilised after each clutch.
References
Grzimek's Animal Life Encyclopedia. Volume 2 — Protostomes.
Further reading
Branchiopoda
Freshwater crustaceans of Africa
Crustaceans described in 1873
Taxa named by Georg Ritter von Frauenfeld
|
St. Roch's Secondary School is a Roman Catholic secondary school located in Royston, Glasgow. It is named for the Christian Saint Roch.
Notable alumni
Willie Bain - Labour Member of Parliament for Glasgow North East
Mo Johnston - Celtic, Rangers, Nantes, Scotland football player, first high-profile Catholic to play for Rangers post-World War II
Stevie Chalmers - Celtic, Partick Thistle and Scotland - a member of the Lisbon Lions team that won the European Cup
References
External links
St Roch's Secondary's page on Scottish Schools Online
Catholic secondary schools in Glasgow
Springburn
1928 establishments in Scotland
Educational institutions established in 1928
|
```java
/*
* FindBugs - Find Bugs in Java programs
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
package edu.umd.cs.findbugs;
/**
* @author pugh
*/
public class PluginDoesntContainMetadataException extends PluginException {
public PluginDoesntContainMetadataException(String msg) {
super(msg);
}
}
```
|
```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';
var constantFunction = require( './../lib' );
var fcn;
var arr;
var v;
var i;
fcn = constantFunction( 3.14 );
for ( i = 0; i < 10; i++ ) {
v = fcn();
console.log( v );
// => 3.14
}
arr = [ 1, 2, 3 ];
fcn = constantFunction( arr );
for ( i = 0; i < 10; i++ ) {
v = fcn();
console.log( v === arr );
// => true
}
```
|
```python
from c7n.utils import yaml_load
from .common import BaseTest
import logging
from pprint import pformat
logger = logging.getLogger(name="c7n.tests")
class PutMetricsTest(BaseTest):
record = False
EXAMPLE_EC2_POLICY = """
policies:
- name: track-attached-ebs
resource: ec2
comment: |
Put the count of the number of EBS attached disks to an instance
#filters:
# - Name: tracked-ec2-instance
actions:
- type: put-metric
key: BlockDeviceMappings[].DeviceName
namespace: Usage Metrics
metric_name: Attached Disks
dimensions:
- { a: b }
op: distinct_count
"""
EXAMPLE_S3_POLICY = """
policies:
- name: bucket-count
resource: s3
comment: |
Count all the buckets!
#filters:
# - Name: passthru
# type: value
# key: Name
# value: 0
actions:
- type: put-metric
key: Name
namespace: Usage Metrics
metric_name: S3 Buckets
op: count
"""
def _get_test_policy(self, name, yaml_doc, record=False):
if record:
logger.warn("TestPutMetrics is RECORDING")
session_factory = self.record_flight_data("test_cw_put_metrics_" + name)
else:
logger.debug("TestPutMetrics is replaying")
session_factory = self.replay_flight_data("test_cw_put_metrics_" + name)
policy = self.load_policy(
yaml_load(yaml_doc)["policies"][0], session_factory=session_factory
)
return policy
def _test_putmetrics_s3(self):
""" This test fails when replaying flight data due to an issue with placebo.
"""
policy = self._get_test_policy(
name="s3test", yaml_doc=self.EXAMPLE_S3_POLICY, record=self.record
)
resources = policy.run()
logger.debug(
"these are the results from the policy, assumed to be resources that were processed"
)
logger.debug(pformat(resources))
self.assertGreaterEqual(
len(resources), 1, "PutMetricsTest appears to have processed 0 resources."
)
def test_putmetrics_ec2(self):
policy = self._get_test_policy(
name="ec2test", yaml_doc=self.EXAMPLE_EC2_POLICY, record=self.record
)
resources = policy.run()
logger.debug(
"these are the results from the policy, assumed to be resources that were processed"
)
logger.debug(pformat(resources))
self.assertGreaterEqual(
len(resources),
1,
"PutMetricsTest appears to have processed 0 resources. "
"Are there any running ec2 instances?",
)
def test_putmetrics_permissions(self):
from c7n.actions import PutMetric
self.assertTrue("cloudwatch:PutMetricData" in PutMetric.permissions)
pma = PutMetric()
self.assertTrue("cloudwatch:PutMetricData" in pma.get_permissions())
def test_putmetrics_schema(self):
import jsonschema
from c7n.actions import PutMetric
data = yaml_load(self.EXAMPLE_EC2_POLICY)
action_schema = PutMetric.schema
res = jsonschema.validate(data["policies"][0]["actions"][0], action_schema)
self.assertIsNone(res, "PutMetric.schema failed to validate.")
```
|
Lungelihle Zwane (born 30 March 2000), known professionally as Uncle Waffles, is a Swazi-born DJ and record producer based in South Africa. She is noted for her work in the amapiano genre and her dance abilities, with Billboard describing her as the "princess of amapiano". Her debut single, "Tanzania", reached number one in South Africa, and was certified 7x platinum in South Africa.
Early life
Zwane was born and raised in Eswatini (formerly Swaziland). She didn't know her parents and had been brought up by her grandma through her childhood years, until she reconciled with her mother as a teenager with whom she had a strained relationship thereafter. Zwane grew up listening to South African house and kwaito music from artists such as Black Coffee, Lebo Mathosa and DJ Kent. Before her success as a DJ, Zwane used to be a television presenter on Studio1 on Eswatini TV, but was replaced in January 2022 after parting from the show., as of having worked as A Receptionist/Personal Assistant for 2 years. It was here that she first was introduced to DJ'ing by friend who also worked at the studio and was on the show with her, known as Dj Stunner, as there was a fifteen-year old set of DJ decks there. In 2017 She then emigrated to South Africa ,enrolling in The University of KwaZulu-Natal in pursuit to study Information Technology.
Career
Uncle Waffles learned how to DJ in 2020 during the COVID-19 lockdowns, and claims to have practiced for eight hours each day. She signed with South African creative agency KreativeKornerr, who managed to book gigs for her in the country's "heavily saturated" music industry. After filling in for a withdrawn DJ at the Zone 6 nightclub in Soweto in October 2021, she gained prominence after a video of her dancing to the song "Adiwele" by Young Stunna during her set went viral. and would begin openly endorsing her on the platform. Uncle Waffles soon ventured into music production, and released her debut single "Tanzania" in March 2022 in anticipation of her debut extended play (EP), Red Dragon, which was released later that month. The single, which had reportedly taken her three months to perfect, was ranked by Rolling Stone as the eighth best afropop song of 2022, with critics describing her as "a global ambassador for amapiano". In April 2022, Uncle Waffles embarked on her first-ever tour of the United Kingdom and Ireland. The tour was closely interlinked with a series of shows organized by Piano People, which she headlined alongside DJ Maphorisa and Focalistic, and is deemed the first all-star amapiano tour in the region.
Uncle Waffles released her debut music video for the track "Tanzania" in September 2022. In that same month, Uncle Waffles announced that she would be hosting a residency on BBC Radio 1. She was the only DJ that performed at the 2022 Global Citizen Festival in Accra. She partnered with KFC South Africa to launch an exclusive "Uncle Waffles burger" which was made available for purchase in local branches in December 2022, and later again in September 2023. She then embarked on a concert tour of the United States, and then Australia. British publication Mixmag hailed Uncle Waffles as one of the top breakthrough DJs of the year 2022 worldwide. Streaming platform Audiomack also hailed her as an "#UpNow" artist in March 2023. Uncle Waffles' second EP, Asylum, was released in March 2023 and featured the track "Yahyuppiyah", which had been released as the first single from the project. The EP was certified gold by the Recording Industry of South Africa (RISA) within one week of its release. In April 2023, she became the first amapiano musician to ever perform at the Coachella Valley Music and Arts Festival. Her song "Tanzania" was sampled by American singer Beyoncé in a dance break on the Renaissance World Tour setlist, to which Uncle Waffles reacted with the statement "I'm crying, wow," on Instagram. She was nominated for Best International Act at the 2023 BET Awards. Uncle Waffles released the EP Solace (2023) as the follow-up to Asylum in what she called a double-sided project titled "An Asylum of Solace". It was supported by the single "Echoes", featuring Tony Duardo, which was released on 4 August 2023.
Discography
Extended plays
Singles
Other charted songs
Awards and nominations
References
2000 births
Living people
Swazi musicians
Swazi expatriates in South Africa
Electronic dance music DJs
Women DJs
Amapiano musicians
Swazi women
|
USNS Cesar Chavez (T-AKE-14), a Lewis and Clark-class dry cargo ship, is the first ship operated by the United States Navy to be named for Cesar Chavez (1927–1993), labor leader and civil rights activist.
Chávez joined the Navy at the age of seventeen in 1944 during World War II, and served for two years.
Cesar Chavezs keel was laid down on 9 May 2011 by the National Steel and Shipbuilding Company (NASSCO) in San Diego.
The ship was launched on 5 May 2012.
Notes
External links
Lewis and Clark-class dry cargo ships
2012 ships
Cesar Chavez
Vessels involved in the search for Malaysia Airlines Flight 370
|
```xml
import { c } from 'ttag';
import { naiveGetIsDecryptionError } from '@proton/shared/lib/calendar/helper';
export const getEventErrorMessage = (error: Error) => {
if (!error) {
return '';
}
const errorMessage = error.message || '';
return naiveGetIsDecryptionError(error)
? c('Error').t`Decryption error: Decryption of this event's content failed.`
: c('Error').t`Error: ${errorMessage}`;
};
export const getEventLoadingMessage = () => c('Info').t`Loading event`;
```
|
Abd-ol Seyyed (, also Romanized as ‘Abd-ol Seyyed; also known as ‘Abd-e Sa‘īd, ‘Abd ol Sa‘īd-e Marīvash) is a village in Shoaybiyeh-ye Gharbi Rural District, Shadravan District, Shushtar County, Khuzestan Province, Iran. At the 2006 census, its population was 643, with 107 families.
References
Populated places in Shushtar County
|
```python
"""SCons.Tool.aixc++
Tool-specific initialization for IBM xlC / Visual Age C++ compiler.
There normally shouldn't be any need to import this module directly.
It will usually be imported through the generic SCons.Tool.Tool()
selection method.
"""
#
#
# Permission is hereby granted, free of charge, to any person obtaining
# a copy of this software and associated documentation files (the
# "Software"), to deal in the Software without restriction, including
# without limitation the rights to use, copy, modify, merge, publish,
# distribute, sublicense, and/or sell copies of the Software, and to
# permit persons to whom the Software is furnished to do so, subject to
# the following conditions:
#
# The above copyright notice and this permission notice shall be included
# in all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
# KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
# WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
# LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
# OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
# WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#
__revision__ = "src/engine/SCons/Tool/aixcxx.py bee7caf9defd6e108fc2998a2520ddb36a967691 2019-12-17 02:07:09 bdeegan"
import os.path
import SCons.Platform.aix
import SCons.Tool.cxx
cplusplus = SCons.Tool.cxx
#cplusplus = __import__('cxx', globals(), locals(), [])
packages = ['vacpp.cmp.core', 'vacpp.cmp.batch', 'vacpp.cmp.C', 'ibmcxx.cmp']
def get_xlc(env):
xlc = env.get('CXX', 'xlC')
return SCons.Platform.aix.get_xlc(env, xlc, packages)
def generate(env):
"""Add Builders and construction variables for xlC / Visual Age
suite to an Environment."""
path, _cxx, version = get_xlc(env)
if path and _cxx:
_cxx = os.path.join(path, _cxx)
if 'CXX' not in env:
env['CXX'] = _cxx
cplusplus.generate(env)
if version:
env['CXXVERSION'] = version
def exists(env):
path, _cxx, version = get_xlc(env)
if path and _cxx:
xlc = os.path.join(path, _cxx)
if os.path.exists(xlc):
return xlc
return None
# Local Variables:
# tab-width:4
# indent-tabs-mode:nil
# End:
# vim: set expandtab tabstop=4 shiftwidth=4:
```
|
Pristimantis ashaninka is a species of frog in the Craugastoridae family. It is found in the Pui Pui Protection Forest in central Peru. It is 23 to 26 millimeters long, and is characterized by containing small conical tubercles in its skin, giving a spiny appearance, and by having no tympanic membrane. The species was described in 2017 after morphological and genetic analyses and was named Pristimantis ashaninka in honor of the indigenous people Asháninka, who live in the regions near the protection forest. The species was listed by the International Union for Conservation of Nature as a least-concern species. There is still no information about its behavior and/or reproduction, but it is assumed that the tadpoles have direct development, as this is a common characteristic of the genus.
Taxonomy
The species was described by herpetologists Edgar Lehr and Jiří Moravec on January 12, 2017 by the scientific journal ZooKeys. From the similarity to other species and from genetic analyses, it was possible to identify that the species belonged to the genus Pristimantis. After this, tests were done to identify the species, such as morphological and DNA analyses and comparisons with other species, and from the data obtained it was possible to discover that it was a new species. So, the species was named Pristimantis ashaninka in honor of the indigenous people Asháninka, who live in the Peruvian regions of Huánuco, Junín, Pasco and Ucayali.
Distribution and conservation
The species is currently found in only one location, in the northeastern Pui Pui Protection Forest, 18 kilometers from the city of Satipo in Peru. The site is a valley through which the Bravo river flows, with altitudes between 1,700 and 1,800 meters, and has around the valley mountainous slopes covered by primary forests 15 to 20 meters high, where bromeliads, ferns and mosses are abundant. The temperature varies between 6 and 15°C, and is characterized by a cold and humid climate. It is common to find several species of amphibians and reptiles in the area, several of which have been described recently, such as the Attenborough's rubber frog (Pristimantis attenboroughi). The species has been reviewed by the International Union for Conservation of Nature (IUCN) as a least-concern species because there is no significant threat to its habitat, which is currently preserved, and because it is likely to have a larger range. With the discovery of the species, 130 species are counted in the genus Pristimantis in Peru.
Description
The species measures between 23.1 to 26.7 millimeters. Its head is slightly narrower than its body, with the latter being longer and wider. It has no neural crest, and its muzzle is moderately long, being under-crowned when viewed from above and rounded when viewed from the side. The distance between the eye and nostril is 77% of the eye diameter, with the nostril in a narrow protuberance, directed to the back and side. The canthus rostralis is fairly long, being rounded when viewed from the side and slightly concave when viewed from above. It has several tubercles, including on top of the eyelids. The supratympanic fold is small and clear, extending to the eyelid, and has no tympanic membrane. Its choana is small and oval.
The back has a large, reddish-brown, hourglass-shaped spot with rounded, cream-brown edges on the side. It has two dark grayish-brown markings on the sacral region, delimiting the hourglass region. The upper front legs are creamy brown, and the hind legs are reddish brown, except for the discs, which are creamy brown. The throat, crop, legs, and belly are grayish, and the iris is bronze, with small black spots.
There are no significant differences between males and females, obeying the color patterns of the species. The young and juveniles, on the other hand, have some differences, with the tubercles more evident, and the skin on the back darker, with the color of the throat varying from black to gray.
The species is differentiated from others of the genus by having tubercles on the skin on the back, giving the appearance of being spiny, by the absence of the tympanic membrane, and by the black dots on the iris. The most similar species are Pristimantis lirellus, Pristimantis martiae, and Pristimantis rhabdocnemus, but it also differs from these by being larger.
References
External links
ahsaninka
Amphibians of South America
Amphibians of Central America
Amphibians of Peru
Amphibians described in 2017
|
Sang Hongyang (Chinese: ; c. 152–80 BC) was a Chinese politician. He was a prominent official of the Han Dynasty, who served Emperor Wu of Han and his successor Emperor Zhao. He is famous for his economic policies during the reign of Emperor Wu, the best known of which include the state monopolies over iron and salt - systems which would be imitated by other dynasties throughout Chinese history. Due to political conflict, he was executed in 80 BC by Huo Guang (d. 68 BC).
Sang was one of the participants in the debate of Salt and Iron which took place in 81 BC.
Youth and Officialdom
Sang Hongyang was born in Luoyang, one of the Han Dynasty's major commercial centres, to a family of merchants. In his youth, he was known for his mathematical prowess. When Emperor Wu ascended to the throne in 141 BC, Sang came to his notice and was eventually invited to become an Attendant (). This was one way which the Emperor gained and retained talented individuals in the palace, and by which many important officials began their careers. Sang would remain an Attendant for 26 years.
Rise to Importance
Sang's skill at economic policy would only come into play during the middle of Emperor Wu's reign. By then, the ongoing campaigns against the Xiongnu had drained the wealth built up by Emperor Wu's predecessors, and the state had entered a financial crisis. In 120 BC, the Minister of Agriculture, Zheng Dangshi, first proposed the idea of state monopolies on iron and salt, recommending two powerful salt and iron magnates to join the government and manage the industry on a national scale. Sang Hongyang was then assigned to aid the magnates in their planning. With the success of the monopolies in improving the empire's financial situation, Sang eventually rose to become Assistant Minister of Agriculture.
As the Assistant Minister, Sang soon implemented several more measures to refill the national coffers. These included an asset tax, payable by artisans, bankers, merchants, and owners of carriages and boats, which was calculated according to the amount of assets. Smallholders only needed to pay half the official rate of tax. At the same time, laws were enacted under which false reporting and concealment of assets was punishable by confiscation of assets and exile to the borders for a year. People were encouraged to report cases of concealment with half the confiscated assets being awarded to the reporters.
Imperial Secretary
In 87 BC, Sang Hongyang became the Imperial Secretary (also known as Imperial Counsellor and Grandee Secretary), one of the three most senior posts in government known as the Three Excellencies. In the wake of the death of Emperor Wu and the installation of the child Emperor Zhao of Han in that year, Sang became one of the key politicians during the period of the triumvirate formed by Huo Guang, Jin Midi, and Shangguan Jie. However, Sang was executed in 80 BC by the regent Huo Guang on charges of treason for his alleged involvement in the attempted coup by Liu Dan, King of Yan, aimed at taking over the throne of Han and having Huo Guang murdered. As a result, Sang's biography was not included in the Book of Han.
References
Loewe, Michael. (1986). "The Former Han Dynasty," in The Cambridge History of China: Volume I: the Ch'in and Han Empires, 221 B.C. – A.D. 220, 103–222. Edited by Denis Twitchett and Michael Loewe. Cambridge: Cambridge University Press. .
150s BC births
80 BC deaths
1st-century BC executions
Executed Han dynasty people
Executed people from Henan
Han dynasty government officials
People executed by the Han dynasty
Politicians from Luoyang
Chinese reformers
|
```javascript
Allow an element to go fullscreen
High Resolution Time API
Navigation Timing API
FileReader.readAsDataURL()
Geolocation
```
|
KCMK may refer to:
KCMK-LP, a low-power radio station (97.3 FM) licensed to serve La Rue, Texas, United States
KMXV, a radio station (93.3 FM) licensed to serve Kansas City, Missouri, United States, which held the call sign KCMK from 1958 to 1971
|
Godlove Orth Dietz (August 17, 1872 – March 23, 1929) was an American college football player, coach, lawyer, and judge. He served as the head football coach at Drake University in 1902 and Kansas State Agricultural College—now known as Kansas State University—in 1903, compiling a career college football record of 7–7–2.
Playing career
Dietz graduated from the Grand Prairie Seminary in Onarga, Illinois. Dietz then attended Northwestern University, which was affiliated with the seminary. At Northwestern, Dietz played as a back for four seasons for the football team. Also starting on the team during three of these years was Dietz's brother, Cyrus E. Dietz. G. O. Dietz graduated from Northwestern with a law degree, and was a member of the Delta Chi fraternity along with his brother Cyrus.
Coaching career
Drake
Dietz got his first head coaching job as the sixth head football coach at Drake University located in Des Moines, Iowa for the 1902 season. His record at Drake was 4–3–1. The last game of his season at Drake would provide his career coaching highlight with at 47–0 pounding over Grinnell College on November 26, 1902.
Kansas State
The next year, Dietz was named the eighth head football coach for the Kansas State Wildcats in Manhattan, Kansas for the 1903 season, succeeding his brother Cyrus in the job. His record at Kansas State was 3–4–1.
Legal career
Dietz and his brother subsequently went into the practice of law together, opening a law firm in Moline, Illinois, with Burton Peek. In the 1920s, Dietz served as a judge on the Moline City Court.
Head coaching record
References
External links
1872 births
1929 deaths
19th-century players of American football
Drake Bulldogs football coaches
Kansas State Wildcats football coaches
Northwestern Wildcats football players
Illinois state court judges
Northwestern University Pritzker School of Law alumni
People from Iroquois County, Illinois
Coaches of American football from Illinois
Players of American football from Illinois
|
Admiral Johnson may refer to:
Alfred Wilkinson Johnson (1876–1963), U.S. Navy vice admiral.
Charles Johnson (Royal Navy officer) (1869–1930), British Royal Navy admiral
Gregory G. Johnson (born 1946), U.S. Navy admiral
Harvey E. Johnson Jr. (fl. 1970s–2000s), U.S. Coast Guard vice admiral
James Johnson (South African Navy officer) (1918–1990), South African Navy vice admiral
Jay L. Johnson (born 1946), U.S. Navy admiral
Jerome L. Johnson (born 1935), U.S. Navy admiral
Roy L. Johnson (1906–1999), U.S. Navy admiral
Stephen E. Johnson (born 1955), U.S. Navy rear admiral
See also
Folke Hauger Johannessen (1913–1997), Royal Norwegian Navy admiral
Rolf Johannesson (1900–1989), German Bundesmarine Konteradmiral (rear admiral equivalent)
|
```css
/* Move down content because we have a fixed navbar that is 50px tall */
@font-face {
font-family: 'Droid Sans Mono';
font-style: normal;
font-weight: 400;
src: local('Droid Sans Mono'), local('DroidSansMono'), url('../fonts/DroidSansMono.ttf') format('truetype');
}
* {
font-family: 'Droid Sans Mono';
}
body {
padding-top: 50px;
font: DroidSansMono;
}
```
|
Anolis boettgeri, also known commonly as Boettger's anole, is a species of lizard in the family Dactyloidae. The species is endemic to Peru.
Etymology
The specific name, boettgeri, is in honor of Enrique Böttger (1856–1944), a Peruvian who collected the type series.
Geographic range
A. boettgeri is found in Oxapampa Province, Peru.
Reproduction
A. boettgeri is oviparous.
Taxonomy
A. boettgeri has been referred to the Dactyloa punctata species group.
References
Further reading
Boulenger GA (1911). "Descriptions of new Reptiles from the Andes of South America, preserved in the British Museum". Annals and Magazine of Natural History, Eighth Series 7: 19–25. (Anolis boettgeri, new species, pp. 19–20).
Nicholson KE, Crother BI, Guyer C, Savage JM (2012). "It is time for a new classification of anoles (Squamata: Dactyloidae)". Zootaxa 3477: 1–108. (Dactyloa boettgeri, new combination, p. 82).
Poe S, Yañez-Miranda C, Lehr E (2008). "Notes on Variation in Anolis boettgeri Boulenger 1911, Assessment of the Status of Anolis albimaculatus Henle & Ehrl 1991, and Description of a New Species of Anolis (Squamata: Iguania) Similar to Anolis boettgeri ". Journal of Herpetology 42 (2): 251–259.
Anoles
Reptiles of Peru
Endemic fauna of Peru
Reptiles described in 1911
Taxa named by George Albert Boulenger
|
This is a complete list of Acts of the Parliament of Great Britain for the year 1790. For Acts passed up until 1707 see List of Acts of the Parliament of England and List of Acts of the Parliament of Scotland. See also the List of Acts of the Parliament of Ireland to 1700 and the List of Acts of the Parliament of Ireland, 1701–1800.
For Acts passed from 1801 onwards see List of Acts of the Parliament of the United Kingdom. For Acts of the devolved parliaments and assemblies in the United Kingdom, see the List of Acts of the Scottish Parliament, the List of Acts of the Northern Ireland Assembly, and the List of Acts and Measures of Senedd Cymru; see also the List of Acts of the Parliament of Northern Ireland.
The number shown after each Act's title is its chapter number. Acts are cited using this number, preceded by the year(s) of the reign during which the relevant parliamentary session was held; thus the Union with Ireland Act 1800 is cited as "39 & 40 Geo 3 c 67", meaning the 67th Act passed during the session that started in the 39th year of the reign of George III and which finished in the 40th year of that reign. Note that the modern convention is to use Arabic numerals in citations (thus "41 Geo 3" rather than "41 Geo III"). Acts of the last session of the Parliament of Great Britain and the first session of the Parliament of the United Kingdom are both cited as "41 Geo 3".
Acts passed by the Parliament of Great Britain did not have a short title; however, some of these Acts have subsequently been given a short title by Acts of the Parliament of the United Kingdom (such as the Short Titles Act 1896).
Before the Acts of Parliament (Commencement) Act 1793 came into force on 8 April 1793, Acts passed by the Parliament of Great Britain were deemed to have come into effect on the first day of the session in which they were passed. Because of this, the years given in the list below may in fact be the year before a particular Act was passed.
30 Geo. 3
The seventh session of the 16th Parliament of Great Britain, which met from 21 January 1790 until 10 June 1790.
Public acts
| {{|Land Tax Act 1790|public|2|25-02-1790|repealed=y|archived=n|An Act for granting an Aid to His Majesty by a Land Tax, to be raised in Great Britain, for the Service of the Year One thousand seven hundred and ninety.|note4= }}
| {{|Malt Duties Act 1790|public|3|25-02-1790|repealed=y|archived=n|An Act for continuing and granting to His Majesty certain Duties upon Malt, Mum, Cyder, and Perry, for the Service of the Year One thousand seven hundred and ninety.|note4= }}
| {{|Customs Act 1790|public|4|01-04-1790|repealed=y|archived=n|An Act for taking off the Duties upon unwrought Tin exported to any of the Countries beyond the Cape of Good Hope.|note4= }}
| {{|Payment of Creditors (Scotland) Act 1790|public|5|01-04-1790|repealed=y|archived=n|An Act for continuing the Term of so much of an Act made in the Twenty-third Year of the Reign of His present Majesty, as relates to the rendering the Payment of Creditors more equal and expeditious in that Part of Great Britain called Scotland.|note4= }}
| {{|Mutiny Act 1790|public|6|25-02-1790|repealed=y|archived=n|An Act for punishing Mutiny and Desertion, and for the better Payment of the Army and their Quarters.|note4= }}
| {{|Marine Mutiny Act 1790|public|7|25-02-1790|repealed=y|archived=n|An Act for the Regulation of His Majesty's Marine Forces while on Shore.|note4= }}
| {{|Trade Act 1790|public|8|01-04-1790|repealed=y|archived=n|An Act to amend Two Acts made in the Twenty-eighth Year of the Reign of His present Majesty, the one intituled, "An Act for regulating the Trade between the Subjects of His Majesty's Colonies and Plantations in North America and in the West India Islands, and the Countries belonging to the United States of America, and between His Majesty's said Subjects, and the Foreign Islands in the West Indies;" and the other, intituled, "An Act to allow the Importation of Rum, or other Spirits from His Majesty's Colonies or Plantations in the West Indies, into the Province of Quebec, without Payment of Duty, under certain Conditions and Restrictions.|note4= }}
| {{|Militia Pay Act 1790|public|9|01-04-1790|repealed=y|archived=n|An Act for defraying the Charge of Pay and Cloathing of the Militia in that Part of Great Britain called England, for One Year, beginning the Twenty-fifth Day of March One thousand seven hundred and ninety.|note4= }}
| {{|Speaker of House of Commons Act 1790|public|10|01-04-1790|repealed=y|archived=n|An Act for the better Support of the Dignity of the Speaker of the House of Commons, and for disabling the Speaker of the House of Commons for the Time being, from holding any Office or Place of Profit, during Pleasure under the Crown.|note4= }}
| {{|Trade with America Act 1790|public|11|01-04-1790|repealed=y|archived=n|An Act to continue the Laws now in Force, for regulating the Trade between the Subjects of His Majesty's Dominions, and the Inhabitants of the Territories belonging to the United States of America, so far as the same relate to the Trade and Commerce carried on between this Kingdom, and the Inhabitants of the Countries belonging to the said United States.|note4= }}
| {{|Indemnity Act 1790|note1=|public|12|01-04-1790|repealed=y|archived=n|An Act to indemnify such Persons as have omitted to qualify themselves for Offices and Employments, and to indemnify Justices of the Peace or others, who have omitted to register or deliver in their Qualifications within the Time limited by Law, and for giving further Time for those Purposes; and to indemnify Members and Officers in Cities, Corporations, and Borough Towns, whose Admissions have been omitted to be stamped according to Law, or having been stamped, have been lost, or mislaid, and for allowing them Time to provide Admissions duly stamped; to give further Time to such Persons as have omitted to make and file Affidavits of the Execution of Indentures of Clerks to Attornies and Solicitors, and for indemnifying Deputy Lieutenants and Officers of the Militia, who have neglected to transmit Descriptions of their Qualifications to the Clerks of the Peace within the Time limited by Law, and for giving further Time for that Purpose.|note4= }}
| {{|Land Tax (Commissioners) Act 1790|public|13|28-04-1790|repealed=y|archived=n|An Act for appointing Commissioners to put in Execution an Act of this Session of Parliament, intituled, "An Act for granting an Aid to His Majesty by a Land Tax, to be raised in Great Britain, for the Service of the Year One thousand seven hundred and ninety," together with those named in Two former Acts, for appointing Commissioners of the Land Tax.|note4= }}
| {{|Discovery of Longitude at Sea Act 1790|public|14|28-04-1790|repealed=y|archived=n|An Act for continuing the Encouragement and Reward of Persons making certain Discoveries for finding the Longitude at Sea, or making other useful Discoveries and Improvements in Navigation, and for making Experiments relating thereto; and for adding a Commissioner to execute the several Acts for the Discovery of the Longitude at Sea.|note4= }}
| {{|Loans or Exchequer Bills Act 1790|public|15|28-04-1790|repealed=y|archived=n|An Act for raising a certain Sum of Money by Loans or Exchequer Bills, for the Service of the Year One thousand seven hundred and ninety.|note4= }}
| {{|Loans or Exchequer Bills (No. 2) Act 1790|public|16|28-04-1790|repealed=y|archived=n|An Act for raising a further Sum of Money by Loans or Exchequer Bills, for the Service of the Year One thousand seven hundred and ninety.|note4= }}
| {{|Exchequer, etc. Courts (Scotland) Act 1790|public|17|07-05-1790|repealed=y|archived=n|An Act for altering the Time appointed for holding the Summer Session in the Court of Session in Scotland, and for altering Whitsuntide and Lammas Terms in the Court of Exchequer in Scotland.|note4= }}
| {{|Continuance of Laws Act 1790|public|18|28-04-1790|repealed=y|archived=n|An Act to continue the several Laws therein mentioned, relating to encouraging the Manufacture of Leather by lowering the Duty payable upon the Importation of Oak Bark, when the Price of such Bark shall exceed a certain Rate; to the prohibiting the Exportation of Tools and Utensils made use of in the Iron and Steel Manufactures of this Kingdom; and to prevent the seducing of Artificers and Workmen employed in those Manufactures to go into Parts beyond the Seas; and to the ascertaining the Strength of Spirits by Clarke's Hydrometer.|note4= }}
| {{|Papists Act 1790|public|19|28-04-1790|repealed=y|archived=n|An Act for allowing further Time for Enrolment of Deeds and Wills made by Papists, and for Relief of Protestant Purchasers.|note4= }}
| {{|Saint Thomas Church, Bristol Act 1790|public|20|01-04-1790|archived=n|An Act for rebuilding the Parish Church and Tower of St. Thomas, within the City of Bristol.}}
| {{|Norwich Water Act 1790|public|21|01-04-1790|archived=n|An Act for better supplying the City of Norwich, and the Parts adjacent with Water.}}
| {{|Colneis and Carlford Hundreds, Suffolk Poor Relief Act 1790|public|22|01-04-1790|archived=n|An Act for the better Relief and Employment of the Poor, within the Hundreds of Colneis and Carlford, in the County of Suffolk.}}
| {{|Post Horse Duties Act 1790|public|23|09-06-1790|repealed=y|archived=n|An Act to continue for a limited Time, an Act made in the Twenty-seventh Year of the Reign of His present Majesty, intituled, "An Act to enable the Lord High Treasurer, or Commissioners of the Treasury for the Time being, to let to Farm the Duties granted by an Act made in the Twenty-fifth Year of His present Majesty's Reign, on Horses let to hire for travelling Post, and by Time, to such Persons as should be willing to contract for the same."|note4= }}
| {{|Loans or Exchequer Bills Act 1790|public|24|09-06-1790|repealed=y|archived=n|An Act for enabling His Majesty to raise the Sum of One Million, for the Uses and Purposes therein mentioned.|note4= }}
| {{|Honiton Improvement Act 1790|public|25|07-05-1790|archived=n|An Act for paving and otherwise improving the Town of Honiton, in the County of Devon.}}
| {{|Auction Duty, etc. Act 1790|note1=|public|26|09-06-1790|repealed=y|archived=n|An Act to exempt Goods and Chattels, imported from the Settlement of Yucatan, in South America, and sold by Auction in Great Britain, from the Duty imposed on such Sales, and for allowing a Drawback of the Duties on Goods exported to Yucatan. |note4= }}
| {{|Settlers in American Colonies Act 1790|public|27|09-06-1790|repealed=y|archived=n|An Act for encouraging new Settlers in His Majesty's Colonies and Plantations in America. |note4= }}
| {{|Importation Act 1790|note1=|public|28|09-06-1790|repealed=y|archived=n|An Act for permitting the Importation of Cashew Gum from His Majesty's West India Islands, upon Payment of the like Duty as is paid upon the Importation of Gum Arabic or Gum Senega. |note4= }}
| {{|Importation and Exportation Act 1790|note1=|public|29|09-06-1790|repealed=y|archived=n|An Act for amending an Act passed in the Twenty-seventh Year of the Reign of His present Majesty, intituled, "An Act for allowing the Importation and Exportation of certain Goods, Wares, and Merchandize, in the Ports of Kingston, Savannah la Mar; Montego Bay, and Santa Lucea, in the Island of Jamaica; in the Port of Saint George, in the Island of Grenada; in the Port of Roseau, in the Island of Dominica; and in the Port of Nassau, in the Island of New Providence, One of the Bahama Islands, under certain Regulations and Restrictions;" and for regulating the Duties on the Importation of Goods and Commodities, the Growth and Production of the Countries bordering on the Province of Quebec. |note4= }}
| {{|Lotteries Act 1790|public|30|10-06-1790|repealed=y|archived=n|An Act for granting to His Majesty a certain Sum of Money, to be raised by a Lottery.|note4= }}
| {{|Silver Plate Act 1790|note1=|public|31|09-06-1790|repealed=y|archived=n|An Act to alter so much of an Act made in the Twelfth Year of the Reign of His late Majesty King George the Second, intituled, "An Act for the better preventing Frauds and Abuses in Gold and Silver Wares;" and also so much of another Act made in the Twenty-fourth Year of the Reign of His present Majesty, intituled, "An Act for granting to His Majesty certain Duties on all Gold and Silver Plate imported, and also certain Duties on all Gold and Silver Wrought Plate made in Great Britain," as relates to the marking of Silver Wares.|note4= }}
| {{|Appropriation Act 1790|public|32|10-06-1790|repealed=y|archived=n|An Act for granting to His Majesty a certain Sum of Money out of the Consolidated Fund, for applying certain Monies therein mentioned, for the Service of the Year One thousand seven hundred and ninety; and for further appropriating the Supplies granted in this Session of Parliament.|note4= }}
| {{|Slave Trade Act 1790|public|33|09-06-1790|repealed=y|archived=n|An Act to amend and continue for a limited Time, several Acts of Parliament for regulating the shipping and carrying Slaves in British Vessels from the Coast of Africa.|note4= }}
| {{|American Loyalists, etc. Act 1790|note1=|public|34|09-06-1790|repealed=y|archived=n|An Act for giving Relief to such Persons as have suffered in their Rights and Properties, during the late unhappy Dissensions in America, in consequence of their Loyalty to His Majesty, and Attachment to the British Government; for making Compensation to Persons who furnished Provisions, or other necessary Articles to the Army or Navy in America during the War, or whose Property was used, seized, or destroyed, for the carrying on the Public Service there; and also, for making Compensation to such Persons as have suffered in their Properties, in consequence of the Cession of the Province of East Florida to the King of Spain.|note4= }}
| {{|Parliamentary Elections Act 1790|public|35|10-06-1790|repealed=y|archived=n|An Act to explain and amend an Act passed in the Twentieth Year of the Reign of His present Majesty, touching the Election for Knights of the Shire to serve in Parliament for that Part of Great Britain called England.|note4= }}
| {{|Stage Coaches Act 1790|public|36|10-06-1790|repealed=y|archived=n|An Act to alter, explain, and amend an Act made in the Twenty-eighth Year of the Reign of His present Majesty, intituled, "An Act for limiting the Number of Persons to be carried on the Outside of Stage Coaches or other Carriages," and for regulating the Conduct of the Drivers and Guards thereof.|note4= }}
| {{|Excise Act 1790|note1=|public|37|09-06-1790|repealed=y|archived=n|An Act to continue Two Acts made in the Twenty-eighth and Twenty-ninth Years of the Reign of His present Majesty, for discontinuing for a limited Time the several Duties payable in Scotland upon Low Wines and Spirits, and upon Worts, Wash, and other Liquors there used in the Distillation of Spirits, and for granting to His Majesty other Duties in lieu thereof; and for better regulating the Exportation of British made Spirits from England to Scotland, and from Scotland to England; and to continue for a limited Time an Act made in the Twenty-sixth Year of the Reign of His present Majesty, "To discontinue for a limited Time the Payment of the Duties upon Low Wines and Spirits for Home Consumption, and for granting and securing the due Payment of other Duties in lieu thereof; and for the better Regulation of the making and vending British Spirits; and for discontinuing for a limited Time certain Imposts and Duties upon Rum and Spirits imported from the West Indies," and for amending the said Act made in the Twenty-ninth Year of His present Majesty's Reign. |note4= }}
| {{|Retail of Liquors Act 1790|public|38|10-06-1790|archived=n|An Act for repealing the Duties upon Licences for retailing Wine and Sweets, and upon Licences for retailing distilled Spirituous Liquors, and for granting other Duties in lieu thereof.}}
| {{|Allowances to Distillers (Scotland) Act 1790|public|39|09-06-1790|repealed=y|archived=n|An Act for making Allowances to Distillers of Low Wines and Spirits from Malt, Corn, or Grain in Scotland, in respect to the Duties imposed by an Act made in the Twenty-fourth Year of the Reign of His present Majesty.|note4= }}
| {{|Duty on Tobacco and Snuff Act 1790|public|40|10-06-1790|repealed=y|archived=n|An Act to explain and amend an Act made in the last Session of Parliament, intituled, "An Act for repealing the Duties on Tobacco and Snuff, and for granting new Duties in lieu thereof.|note4= }}
| {{|Importation Act 1790|note1=|public|41|10-06-1790|repealed=y|archived=n|An Act for laying a Duty on the Importation from any of the Provinces in North America of Rape Seed, and all other Seeds used for extracting Oil; and for allowing the Importation from the said Provinces, of Rape Cakes, or Cakes made of Rape Seed, used for Manure, Duty free.|note4= }}
| {{|Importation and Exportation Act 1790|note1=|public|42|10-06-1790|repealed=y|archived=n|An Act to continue for a limited Time certain Provisions contained in an Act made in this present Session of Parliament, intituled, "An Act for indemnifying all Persons who have been concerned in advising or carrying into Execution certain Orders of Council respecting the Importation and Exportation of Corn and Grain; and also, certain Orders issued by the Governor General of His Majesty's Colonies in America, and for preventing Suits in consequence of the same; and for making further Provisions relative thereto, relating to the Importation and Exportation of Corn and Grain; and to authorize His Majesty to permit the Exportation of Corn, Grain, Meal, or Flour, and to prohibit the Importation thereof on the Low Duties.|note4= }}
| {{|Customs Seizures Act 1790|public|43|10-06-1790|repealed=y|archived=n|An Act to authorize the Commissioners of the Customs to defray Charges on Seizures out of His Majesty's Share of Seizures in general.|note4= }}
| {{|Annuity to Doctor Willis Act 1790|public|44|09-06-1790|repealed=y|archived=n|An Act to enable His Majesty to settle a certain Annuity on the Reverend Francis Willis, Doctor of Physic.|note4= }}
| {{|Tontine Annuities Act 1790|public|45|10-06-1790|archived=n|An Act for converting certain Annuities, to be attended with the Benefit of Survivorship in Classes, established by an Act of the last Session of Parliament, into certain Annuities, for an absolute Term of Years, and for enabling the Commissioners of the Treasury to nominate Lives for the Shares so converted.}}
| {{|Annuity (Penn's Descendants) Act 1790|public|46|09-06-1790|archived=n|An Act for settling and securing a certain Annuity for the Use of the Heirs and Descendants of William Penn Esquire, the original Proprietor of the Province of Pennsylvania, in Consideration of the meritorious Services of the said William Penn, and of the Losses which his Family have sustained in consequence of the unhappy Dissensions in America.}}
| {{|Transportation Act 1790|public|47|09-06-1790|repealed=y|archived=n|An Act for enabling His Majesty to authorize His Governor, or Lieutenant Governor of such Places beyond the Seas, to which Felons or other Offenders may be transported, to remit the Sentences of such Offenders.|note4= }}
| {{|Treason Act 1790|public|48|09-06-1790|archived=n|An Act for discontinuing the Judgement which has been required by Law to be given against Women convicted of certain Crimes, and substituting another Judgement in lieu thereof.}}
| {{|Workhouses Act 1790|note1=|public|49|09-06-1790|archived=n|An Act to empower Justices and other Persons to visit Parish Workhouses or Poor Houses, and examine and certify the State and Condition of the Poor therein to the Quarter Sessions.}}
| {{|Land Revenues of the Crown Act 1790|public|50|10-06-1790|repealed=y|archived=n|An Act to continue and amend an Act made in the Twenty-sixth Year of the Reign of His present Majesty, intituled, "An Act for appointing Commissioners to enquire into the State and Condition of the Woods, Forests, and Land Revenues belonging to the Crown, and to sell or alienate Fee Farm and other unimproveable Rents."|note4= }}
| {{|Crown Lands at Catterick and Tunstall, Yorkshire Act 1790|public|51|09-06-1790|archived=n|An Act for divesting out of the Crown the Reversion in Fee of and in certain Hereditaments, heretofore the Estate of Sir Roger Strickland Knight, deceased, in Catterick and Tunstall, in the County of York, and for vesting the same in the several Persons entitled to the said Hereditaments; and for extinguishing and destroying a certain Term of One hundred Years, for which the said Hereditaments were limited in Trust for His late Majesty King George the First, His Heirs and Successors.}}
| {{|Ouse (Sussex): Navigation Act 1790|public|52|28-04-1790|archived=n|An Act for improving, continuing, and extending the Navigation of the River Ouse, from Lewes Bridge, at the Town of Lewes, to Hammer Bridge, in the Parish of Cuckfield, and to the Extent of the said Parish of Cuckfield; and also of a Branch of the said River to Shortbridge, in the Parish of Fletching, in the County of Sussex.}}
| {{|Westminster Improvements Act 1790|public|53|09-06-1790|archived=n|An Act to alter, explain, amend, and render more effectual, several Acts made for paving, cleansing, and lighting the Squares, Streets, Lanes, and other Places within the City and Liberty of Westminster, and Parts adjacent, and for putting certain Streets therein mentioned, commonly called Optional Streets, under the Management of Parochial Committees, subject to the Control of the Commissioners appointed by, or in pursuance of the said several Acts; and for removing and preventing Nuisances, Annoyances, Obstructions, and Encroachments, in the said Streets and other Places, and for other Purposes.}}
| {{|Westminster Fish Market Act 1790|public|54|09-06-1790|repealed=y|archived=n|An Act for vesting the Estate and Property of the Trustees of Westminster Fish Market in the Marine Society, for the Purposes therein mentioned; and for discontinuing the Powers of the said Trustees.|note4= }}
| {{|Hubberston and Pill, Pembroke, Docks and Piers Act 1790|public|55|09-06-1790|archived=n|An Act to enable Sir William Hamilton, Knight of the Most Honourable Order of the Bath, his Heirs and Assigns, to make and provide Quays, Docks, Piers, and other Erections, and to establish a Market with proper Roads and Avenues thereto respectively, within the Manor or Lordship of Hubberstone and Pill, in the County of Pembroke.}}
| {{|Erewash Canal Act 1790|public|56|01-04-1790|archived=n|An Act to alter and amend an Act passed in the last Session of Parliament, for making and maintaining a Navigable Canal from, or from near to Cromford Bridge, in the County of Derby, to join and communicate with the Erewash Canal, at or near Langley Bridge, and also a Collateral Cut from the said intended Canal, at or near Codnor Park Mill, to or near Pinxton Mill, in the said County.}}
| {{|Ipswich and Stowmarket Navigation Act 1790|public|57|01-04-1790|archived=n|An Act for making and maintaining a Navigable Communication between Stowmarket and Ipswich, in the County of Suffolk.}}
| {{|Edington, Somerset Drainage, etc. Act 1790|public|58|28-04-1790|archived=n|An Act for draining, dividing, and enclosing certain Moors, Commons, or Waste Lands, called Edington, otherwise Burtle Moor, East Heath, West Heath, and Clyde Batch, within the Hamlet of Edington, and Parish of Moorlinch, in the County of Somerset.}}
| {{|Anglesey Drainage Act 1790|public|59|28-04-1790|archived=n|An Act for more effectually embanking the Marsh called Malldraeth and Corsddaugau, in the County of Anglesey, and draining and preserving the same, and the enclosed Low Lands contiguous thereto.}}
| {{|Stourbridge and Birmingham and Fazeley Canal Act 1790|public|60|07-05-1790|archived=n|An Act for effectually carrying into Execution Two Acts of the Sixteenth and Twenty-fifth Years of His present Majesty, for making and maintaining a Navigable Canal from the Stourbridge Navigation to the Birmingham, and Birmingham and Fazely Canal Navigations, in the Counties of Worcester and Stafford.}}
| {{|Plymouth Dock to Torpoint: Ferry Act 1790|public|61|07-05-1790|archived=n|An Act for authorizing and enabling the Right Honourable George Earl of Mount Edgcumbe, and Reginald Pole Carew Esquire, to establish and maintain a Common Ferry over and across the River Tamer, between a certain Place North of Plymouth Dock, in the Parish of Stoke Damarel, in the County of Devon and Torpoint, in the Parish of Antony Saint Jacob, otherwise Antony in the East, in the County of Cornwall.}}
| {{|Truro Streets Act 1790|public|62|07-05-1790|archived=n|An Act for paving, cleansing, lighting, and widening the Streets, Lanes, and Passages; for removing and preventing Encroachments, Nuisances, and Annoyances; and for regulating the Porters and Drivers of Carts within the Borough of Truro, and Part of the adjoining Parishes in the County of Cornwall.}}
| {{|Bradford, Yorkshire Water Supply Act 1790|public|63|07-05-1790|archived=n|An Act for preserving the Works made for supplying the Town of Bradford, in the County of York, and Part of the Township of Horton, in the Parish of Bradford aforesaid, with Water; for the more easy Recovery of the Rents for the said Water, and to enable the Proprietors thereof to borrow Money for the improving such Works.}}
| {{|Ramsgate Chapel of Ease Act 1790|public|64|07-05-1790|archived=n|An Act for establishing a Chapel at Ramsgate, in the Parish of Saint Laurence, in the Isle of Thanet, in the County of Kent, as a Chapel of Ease to the Church of the same Parish.}}
| {{|Leeds and Liverpool Canal Act 1790|public|65|09-06-1790|archived=n|An Act to enable the Company of Proprietors of the Canal Navigation from Leeds to Liverpool, to vary the Line of the said Canal Navigation, and to raise a further Sum of Money for the Purpose of completing the said Canal Navigation, and for other Purposes.}}
| {{|Peterborough Streets Act 1790|public|66|09-06-1790|archived=n|An Act for paving and otherwise improving the City and Township of Peterborough.}}
| {{|Durham Streets Act 1790|public|67|09-06-1790|archived=n|An Act for paving, cleansing, lighting, watching, and regulating the Streets, Lanes, Ways, and Public Passages and Places within the City of Durham and Borough of Framwelgate, and the Suburbs thereof, and Streets thereto adjoining; for removing and preventing Nuisances, Annoyances, Encroachments, and Obstructions therein; for widening and rendering more commodious several of the said Streets, Lanes, Ways, and Public Passages and Places; and for regulating and improving the Markets within the said City and Suburbs.}}
| {{|Leeds Water Supply Act 1790|public|68|09-06-1790|archived=n|An Act for better supplying the Town and Neighbourhood of Leeds, in the County of York, with Water, and for more effectually lighting and cleansing the Streets and other Places within the said Town and Neighbourhood; and removing and preventing Nuisances, Annoyances, Encroachments, and Obstructions therein.}}
| {{|Saint James Church, Clerkenwell Act 1790|public|69|09-06-1790|archived=n|An Act for amending and enlarging the Powers of and rendering more effectual an Act made in the Twenty-eighth Year of the Reign of His present Majesty, intituled, "An Act for pulling down the Church of Saint James at Clerkenwell, in the County of Middlesex, and for building a new Church, and making a new Church Yard or Cemetery in the said Parish, with convenient Avenues and Passages thereto;" and for purchasing Pentonville Chapel, and making the same a Chapel of Ease to the said Church.}}
| {{|Saint James, Westminster: Improvement Act 1790|public|70|09-06-1790|archived=n|An Act to amend an Act of the last Session of Parliament for providing an additional Burial Ground for the Parish of Saint James, Westminster, and erecting a Chapel adjoining thereto; and also a House for the Residence of a Clergyman to officiate in burying the Dead.}}
| {{|Saint John Church, Hackney Act 1790|public|71|09-06-1790|archived=n|An Act for taking down the Church and Tower belonging to the Parish of Saint John at Hackney, in the County of Middlesex; and for building another Church and Tower for the Use of the said Parish; and for making an additional Cemetery or Church Yard.}}
| {{|Banbury Church Act 1790|public|72|09-06-1790|archived=n|An Act for taking down the Church, Chancel, and Tower, belonging to the Parish of Banbury, in the County of Oxford, and for re-building the same.}}
| {{|Forth and Clyde and Monkland Canal Act 1790|public|73|09-06-1790|archived=n|An Act for forming a Junction between the Forth and Clyde Navigation, and the Monkland Navigation, and for altering, enlarging, and explaining, several former Acts passed, for making and maintaining the said Navigations.}}
| {{|Waterbeach Level Drainage Act 1790|public|74|09-06-1790|archived=n|An Act to alter and amend an Act made in the Fourteenth Year of the Reign of His late Majesty King George the Second, intituled, "An Act for the effectual Draining and Preservation of Waterbeach Level, in the County of Cambridge, and to establish an Agreement made between the Lord of the Manor of Waterbeach cum Denny, and the Commoners within the said Manor."}}
| {{|Severn Navigation Act 1790|public|75|09-06-1790|archived=n|An Act to enable the Company of Proprietors of the Staffordshire and Worcestershire Navigation to improve the Navigation of the River Severn from Stourport, in the County of Worcester, to a Place called Diglis, near the City of Worcester.}}
| {{|Hans Town, Chelsea Improvement Act 1790|public|76|09-06-1790|archived=n|An Act for forming and keeping in Repair the Streets and other Public Passages and Places within a certain District in the Parish of Saint Luke, Chelsea, in the County of Middlesex, called Hans Town, and for otherwise improving the same.}}
| {{|Coventry Streets Act 1790|public|77|09-06-1790|archived=n|An Act for the better paving, cleansing, lighting, and watching, the City of Coventry, and the Suburbs thereof; and removing and preventing Nuisances and Annoyances therein; and for regulating the Public Wells and Pumps within the said City and Suburbs.}}
| {{|Newcastle and Sunderland Coals Act 1790|public|78|21-01-1790|archived=n|An Act to continue an Act made in the Sixth Year of His present Majesty's Reign, intituled, "An Act to regulate the Loading of Ships with Coals in the Ports of Newcastle and Sunderland.}}
| {{|East Grinstead Church Act 1790|public|79|09-06-1790|archived=n|An Act for re-building the Parish Church of East Grinstead, in the County of Sussex.}}
| {{|Streatham Poor Relief Act 1790|public|80|09-06-1790|archived=n|An Act for providing a Workhouse for, and for the better Relief and Employment of the Poor of the Parish of Streatham, in the County of Surrey; and for appointing an additional Overseer for the better Government of the Poor of the said Parish.}}
| {{|Manchester Poor Relief Act 1790|public|81|09-06-1790|archived=n|An Act for providing a new Poor House for, and for the better Relief and Government of the Poor of the Township of Manchester, in the County of Lancaster.}}
| {{|Merthyr Tidvill to Cardiff Canal Act 1790|public|82|09-06-1790|archived=n|An Act for making and maintaining a Navigable Canal from Merthyr Tidvile, to and through a Place called The Bank, near the Town of Cardiff, in the County of Glamorgan.}}
| {{|Ouse Navigation Act 1790|public|83|07-05-1790|archived=n|An Act for empowering Persons navigating Boats, Barges, and other Vessels, in the River Ouze, in the County of Norfolk, to hale or tow with Horses or other Beasts on the Banks or Sea Walls of the said River, and for making Satisfaction to the Owners of the said Banks or Sea Walls.}}
| {{|Liston Essex Roads Act 1790|public|84|01-04-1790|archived=n|An Act to empower William Henry Campbell Esquire, to shut up a Road and Foot Paths in the Parish of Liston, in the County of Essex; and to oblige him to make and keep in Repair for the future, another Road and Foot Path in lieu thereof.}}
| {{|Norwich to Bixley Roads Act 1790|public|85|01-04-1790|archived=n|An Act for continuing an Act of the Tenth Year of the Reign of His present Majesty, for amending the Road from Saint Stephen's Gate, in the City of Norwich, to Block Hill, in Trowse, at the Angle, where the Road divides to Bixley and Kirby, in the County of Norfolk.}}
| {{|Norwich Roads Act 1790|public|86|01-04-1790|archived=n|An Act for continuing an Act of the Ninth Year of the Reign of His present Majesty, for amending the Road from Bishopsgate Bridge, in the City of Norwich, to a Stone formerly called the Two Mile Stone, where the Norwich Road joins the Caister Causeway, Two Miles and a Half short of the Town of Great Yarmouth.}}
| {{|Norfolk Roads Act 1790|public|87|01-04-1790|archived=n|An Act for continuing an Act of the Twelfth Year of His present Majesty, for repairing and widening the Road from Berstreet Gates, in the City of Norwich, to New Buckenham, in the County of Norfolk.}}
| {{|Chester and Derby Roads Act 1790|public|88|01-04-1790|archived=n|An Act to enlarge the Term and Powers of an Act passed in the Tenth Year of the Reign of His present Majesty, for repairing, widening, and altering the Road from Macclesfield, in the County of Chester, to the Turnpike Road at Randle Carr Lane Head, in Fernilee, in the County of Derby, leading to Chapel in the Frith.}}
| {{|Hertfordshire and Huntingdonshire Roads Act 1790|public|89|01-04-1790|archived=n|An Act for continuing the Term, and altering and enlarging the Powers of certain Acts of Parliament, for repairing the Roads from Royston, in the County of Hertford, to Wandesford Bridge, in the County of Huntingdon, and from the Town of Huntingdon to the Causeway at or near the West End of the Town of Somersham, in the County of Huntingdon, so far as relates to the Middle and South Divisions, and separate District of the said Road.}}
| {{|Kent Roads Act 1790|public|90|01-04-1790|archived=n|An Act for enlarging the Term and Powers of an Act of the Eighth Year of His present Majesty, for amending, widening, and keeping in Repair, several Roads leading to and through the Town of Goudhurst, in the County of Kent.}}
| {{|Pembroke Roads Act 1790|public|91|01-04-1790|archived=n|An Act for enlarging the Term of an Act of the Eleventh Year of His present Majesty, for repairing, widening, and keeping in Repair, several Roads leading from Tavernspite to the Towns of Pembroke and Tenby, and to Hubberston Haking, in the County of Pembroke.}}
| {{|Leicester Roads Act 1790|public|92|01-04-1790|archived=n|An Act to enlarge the Term and Powers of an Act passed in the Twenty-eighth Year of the Reign of His present Majesty, for repairing and widening the Road from the Leicester and Welford Turnpike Road, in the Counties of Leicester and Northampton, near Foston Lane, to the Turnpike Road leading from Hinckley to Ashby de la Zouch, in the said County of Leicester; and for repairing and widening Two Pieces of Road, called Hunt's Lane and Wood Lane, in the Parishes of Desford and Newbold Verdon.}}
| {{|Fife Roads Act 1790|public|93|01-04-1790|archived=n|An Act for making and repairing the Road from Newmiln Bridge, by Foodie's Mill, Inverkeithing, Aberdour, Kirkcaldy, Gallatown, and Cameron Bridge, to Craill, and other Roads in the County of Fife.}}
| {{|Cambridge Roads Act 1790|public|94|01-04-1790|archived=n|An Act for enlarging the Term of several Acts made for repairing the Roads from Stump Cross to Newmarket Heath, and from Stump Cross aforesaid, to the End of the Town of Trumpington next to Shelford, and from Shelford Pound to Wittlesford; and for making more effectual Provision for repairing the said Roads, and also One Mile of the Road between Trumpington and Cambridge, commencing at the South End of Trumpington aforesaid; and for amending the Road from Chesterford Bridge, to the End of Wittlesford, next to Shelford, all in the County of Cambridge.}}
| {{|Dorset Roads Act 1790|public|95|01-04-1790|archived=n|An Act to enlarge the Term and Powers of so much of an Act made in the Ninth Year of the Reign of His present Majesty as relates to the amending, widening, altering, clearing, and keeping in Repair several Roads leading from the Borough of Dorchester, in the County of Dorset.}}
| {{|Wiltshire Roads Act 1790|public|96|01-04-1790|archived=n|An Act for enlarging the Terms and altering the Powers of Two Acts made in the Sixteenth Year of the Reign of His late Majesty, and in the Ninth Year of the Reign of His present Majesty, for repairing the Roads leading from Marlborough, through West Kennett, to Sheppard's Shord; and from the Hare and Hounds in Beckhampton, to the Top of Cherrill Hill; and from the Town of Avebury, to the Cross Way at Beckhampton; and from the Turnpike Gate at Avebury, to Wroughton; and from the North Side of Swindon, to the Carpenter's Arms in Blunsden, in the County of Wilts; and for diverting, turning, and altering Part of the said Roads; and for repairing, and widening the Road on the West Side of the Three Barrows, from the Direction Post there, on the New Road leading from Beckhampton to Devizes, to the Distance of One Mile from the said Direction Post Westward.}}
| {{|Surrey and Sussex Roads Act 1790|public|97|01-04-1790|archived=n|An Act for continuing the Term and enlarging, altering, and amending the Powers of an Act made in the Tenth Year of His present Majesty, for repairing, widening, and keeping in Repair the Road from New Chappell, in the County of Surrey, over Copthorn, in the County of Sussex, through Lindfield, to the Town of Ditchling, up to the Top of Ditchling Bost Hills, in the said County of Sussex.}}
| {{|Wiltshire Roads (No. 2) Act 1790|public|98|01-04-1790|archived=n|An Act for repairing and widening the Road from Rowde Ford to Red Hill, and from Chittoe Heath to the Town of Calne, in the County of Wilts; and for repealing Three Acts made in the Second and Twenty-fifth Years of the Reign of His late Majesty King George the Second, and in the Twenty-third Year of His present Majesty, for repairing the Highways between Sheppard's Shord and Horsley Upright Gate, leading down Bagdown Hill, in the County of Wilts, and other ruinous Parts of the Highways thereunto adjacent.}}
| {{|Yorkshire Roads Act 1790|public|99|01-04-1790|archived=n|An Act for continuing the Term and altering and enlarging the Powers of certain Acts made for repairing the Road from Keighley, in the West Riding of the County of York, to Kirkby in Kendall, in the County of Westmorland; so far as relates to such Part of the said Road as lies within the County of York.}}
| {{|Stafford Roads Act 1790|public|100|28-04-1790|archived=n|An Act for making, amending, and keeping in Repair the Road, from Fosbrook, in the Parish of Dillorn, through Dillorn, and from thence to or near to Chedleton, in the County of Stafford.}}
| {{|Bromsgrove to Birmingham Road Act 1790|public|101|28-04-1790|archived=n|An Act to enlarge the Terms and Powers of Three several Acts made in the Thirteenth Year of the Reign of King George the First, the Twenty-first Year of the Reign of King George the Second, and the Eleventh Year of the Reign of His present Majesty, for repairing the Road leading from the Town of Bromsgrove, in the County of Worcester, to the Town of Birmingham, in the County of Warwick.}}
| {{|Worcester Salop and Stafford Roads Act 1790|public|102|28-04-1790|archived=n|An Act for making, amending, widening, and keeping in Repair, a Road from Eve Hill near Dudley, to the New Inn, in the Parish of Pattingham, and from the Turnpike Road at or near Street End, in the Parish of Kingswinford, to the Turnpike Road leading from Dudley to Wolverhampton, in the Counties of Worcester, Salop, and Stafford.}}
| {{|Huntingdonshire Roads Act 1790|public|103|28-04-1790|archived=n|An Act to continue the Term and alter and enlarge the Powers of an Act of the Tenth Year of His present Majesty, for repairing the Road from Biggleswade, in the County of Bedford, through Bugden and Alconbury, to the Top of Alconbury Hill, and from Bugden to Huntingdon, and from Cross Hall to Great Stoughton Common, in the County of Huntingdon; and also the Road leading out of the aforesaid Road at or near the Ferry House, in the Parish of Tempsford, to and through Little Barford, Eynesbury, and Saint Neots, to the Turnpike Road at the End of Cross Hall Lane.}}
| {{|Norfolk Roads Act 1790|public|104|07-05-1790|archived=n|An Act for continuing and amending an Act of the Tenth Year of His present Majesty, for amending and widening the Road from Saint Stephen's Gate, in the County of the City of Norwich to the Windmill in the Town of Watton, in the County of Norfolk.}}
| {{|Linlithgow Roads Act 1790|public|105|07-05-1790|archived=n|An Act to continue the Term and alter the Powers of so much of Two Acts made in the Twenty-fifth and Thirty-first Years of the Reign of His late Majesty, for repairing several Roads in the Counties of Linlithgow and Stirling, as relates to the Roads lying within the County of Linlithgow.}}
| {{|Berkshire Roads Act 1790|public|106|07-05-1790|archived=n|An Act for enlarging the Term and Powers of an Act passed in the Eighth Year of the Reign of His present Majesty King George the Third, for repairing and widening the Road from the Mayor's Stone in Abingdon, in the County of Berks, through Cumner, to the ancient Horse Road at Swinford, in the said County.}}
| {{|Staffordshire Roads Act 1790|public|107|09-06-1790|archived=n|An Act to continue the Term, and alter and enlarge the Powers of an Act passed in the Ninth Year of the Reign of His present Majesty, for repairing and widening the Road from Cheadle to Botham House, and from thence to Butterton Moor End, in the County of Stafford.}}
| {{|Linlithgow and Stirling Roads Act 1790|public|108|09-06-1790|archived=n|An Act to continue the Term and alter the Powers of so much of Two Acts made in the Twenty-fifth and Thirty-first Years of the Reign of His late Majesty for repairing several Roads in the Counties of Linlithgow and Stirling, as relates to the Roads lying within the County of Stirling; and for repairing the Road from Loanhead to Saint Ninian's, in the said County of Stirling.}}
| {{|Stirling and Dumbarton Roads Act 1790|public|109|09-06-1790|archived=n|An Act for repairing several Roads in the Counties of Stirling and Dumbarton.}}
| {{|Denbigh and Flint Roads Act 1790|public|110|09-06-1790|archived=n|An Act for more effectually amending, widening, and keeping in Repair, the Road from the Town of Denbigh, to the Turnpike Road between Northop and Holywell, and from Afton Wen, to the Town of Mold, in the Counties of Denbigh and Flint.}}
| {{|Salop Roads Act 1790|public|111|09-06-1790|archived=n|An Act for enlarging the Term and Powers of an Act passed in the Ninth Year of the Reign of His present Majesty King George the Third, for repairing and widening the Road from the End of the Turnpike Road in Shawbury, in the County of Salop, to Drayton in Hales, in the said County, and from thence to Newcastle under Line, in the County of Stafford, and from Shawbury aforesaid, to the Turnpike Road in High Ercall, in the said County of Salop, and from Shawbury aforesaid, to Wem, in the said County, and from thence to the Turnpike Road in Sandford, in the said County.}}
| {{|Stafford and Chester Roads Act 1790|public|112|09-06-1790|archived=n|An Act for enlarging the Term and Powers of an Act passed in the Tenth Year of the Reign of His present Majesty, for repairing and widening the Road from Tunstall, in the County of Stafford, to Bosley, in the County of Chester, and from Great Chell to Shelton, in the said County of Stafford.}}
| {{|Derby Nottinghamshire Roads Act 1790|public|113|09-06-1790|archived=n|An Act to enlarge the Term and Powers of an Act made in the Fourth Year of the Reign of His present Majesty, for repairing, widening, and keeping in Repair, the High Roads leading from Alfreton, in the County of Derby, through Carter Lane, to a certain Place in the Town of Mansfield, called Stockwell, and from the Bridle Gate, at the Division of the Liberties of Blackwell and Hucknall, through the Town of Sutton in Ashfield, to the Mansfield and Newark Turnpike, at or near Python Hill, in the Forest of Sherwood, in the County of Nottingham.}}
| {{|Bedford and Buckinghamshire Roads Act 1790|public|114|09-06-1790|archived=n|An Act for amending, widening, and keeping in Repair the Road from the East End of Bromham Bridge, in the County of Bedford, to the Turnpike Road leading from Wellingborough to Olney, in the County of Bucks; and also the Road from the said Turnpike Road at or near the South End of the Town of Olney aforesaid to the Turnpike Road leading from Northampton to Newport Pagnell, in the same County.}}
| {{|Hertford and Bedford Roads Act 1790|public|115|09-06-1790|archived=n|An Act for continuing the Term, and enlarging the Powers of certain Acts, for repairing the Road from the Town of Hitchin, through Shefford, to the Turnpike Road from Saint Alban's to Bedford, and other Roads therein mentioned, in the Counties of Hertford and Bedford.}}
}}
Private and personal acts
| {{|Linton (Yorkshire, West Riding) Inclosure Act 1790|private|2|25-02-1790|repealed=n|archived=n|An Act for dividing and enclosing several Open Fields, and a Stinted Pasture called Linton Pasture, within the Township of Linton, in the West Riding of the County of York.}}
| {{|Naturalization of Gottlob Schusler Act 1790|private|3|25-02-1790|repealed=n|archived=n|An Act for naturalizing Gottlob Gotthelff Schusler.}}
| {{|James Money's Estate Act 1790|private|4|01-04-1790|repealed=n|archived=n|An Act for vesting Part of the Freehold Estates devised by the Will of James Money Esquire deceased, in Trustees to be sold, and for laying out the Money arising thereby, in the Purchase of other Hereditaments, to be settled to the same Uses as the Estates to be sold now stand limited to.}}
| {{|Francis Rybot's divorce from Alicia Fowler, and other provisions.|private|5|01-04-1790|repealed=n|archived=n|An Act to dissolve the Marriage of Francis Thomas Rybot with Alicia Fowler his now Wife, and to enable him to marry again; and for other Purposes therein mentioned.}}
| {{|Old Buckenham (Norfolk) Inclosure Act 1790|private|6|01-04-1790|repealed=n|archived=n|An Act for dividing and enclosing the Commons, Fens, and Waste Lands, within the Parish of Old Buckenham, in the County of Norfolk.}}
| {{|Burton Leonard (Yorkshire) Inclosure Act 1790|private|7|01-04-1790|repealed=n|archived=n|An Act for dividing and enclosing several Open Fields in the Township of Burton Leonard, in the County of York.}}
| {{|Harewood (Yorkshire) Inclosure Act 1790|private|8|01-04-1790|repealed=n|archived=n|An Act for dividing and enclosing the several Moors, Commons, or Waste Grounds called Dunkeswick Common, Huby Common, Wescoe-hill Common, and Weeton Green, within the Manor and Parish of Harewood, in the County of York.}}
| {{|Dibden (Hampshire) Inclosure Act 1790|private|9|01-04-1790|repealed=n|archived=n|An Act for dividing and allotting the intermixt or Commonable Lands and Grounds and Common Pastures or Waste Lands, within the Manor and Parish of Dibden, in the County of Southampton.}}
| {{|North Collingham (Nottinghamshire) Inclosure Act 1790|private|10|01-04-1790|repealed=n|archived=n|An Act for dividing, allotting, enclosing, and regulating the Open Fields, Meadows, Pastures, Moors, Commons, and Waste Grounds, in the Parish of North Collingham, in the County of Nottingham.}}
| {{|Killingworth Moor (Northumberland) Inclosure Act 1790|private|11|01-04-1790|repealed=n|archived=n|An Act for dividing and enclosing a certain Common, Moor, or Tract of Waste Ground, called Killingworth Moor, in the Parish of Long Benton, in the County of Northumberland.}}
| {{|Thomas Watson's Name Act 1790|private|12|01-04-1790|repealed=n|archived=n|An Act to enable Thomas Samwell Watson Samwell Esquire, (lately called Thomas Samwell Watson), and his Heirs Male, to take the Surname and use the Arms of Samwell, pursuant to the Will of Sir Thomas Samwell Baronet, deceased.}}
| {{|Naturalization of George Paetsch, John Garbers, and John Pasteur.|private|13|01-04-1790|repealed=n|archived=n|An Act for naturalizing George Pætsch, John Christian Hartwig Garbers, and John Henry Pasteur.}}
| {{|Naturalization of Julius Bierbaum Act 1790|private|14|01-04-1790|repealed=n|archived=n|An Act for naturalizing Julius George Bierbaum.}}
| {{|Naturalization of Noah Turmine's Act 1790|private|15|01-04-1790|repealed=n|archived=n|An Act for naturalizing Noah Turmine.}}
| {{|Naturalization of Matthias Koops Act 1790|private|16|01-04-1790|repealed=n|archived=n|An Act for naturalizing Matthias Koops.}}
| {{|Terrington St. Clement's and Terrington St. John's (Norfolk) Embanking and Inclosure Act 1790|private|17|28-04-1790|repealed=n|archived=n|An Act for embanking the Common Salt Marsh within the Parishes of Terrington Saint Clement's and Terrington Saint John's, in the County of Norfolk; and for dividing and enclosing the same and other Commons within the said Parishes.}}
| {{|Deverill Longbridge, Hussey Deverill and Monkton Deverill (Wiltshire): division and allotment of open and commonable lands.|private|18|28-04-1790|repealed=n|archived=n|An Act for dividing and allotting the Open and Commonable Lands within the Manor of Deverill Longbridge, Hussey Deverill, and Monkton Deverill, in the County of Wilts.}}
| {{|Dormstone (Worcestershire) Inclosure Act 1790|private|19|28-04-1790|repealed=n|archived=n|An Act for dividing and enclosing the Open Common Fields and other Commonable Lands within the Parish of Dormstone, in the County of Worcester.}}
| {{|Harby (Leicestershire) Inclosure Act 1790|private|20|28-04-1790|repealed=n|archived=n|An Act for dividing and enclosing the Open Common Fields, Pastures, and other Commonable Lands and Waste Grounds, within the Parish of Harby, in the County of Leicester.}}
| {{|Willem Blaauw Naturalization Act 1790|private|21|28-04-1790|repealed=n|archived=n|An Act for naturalizing Willem Blaauw.}}
| {{|Mickleover (Derbyshire) Inclosure Act 1790|private|22|07-05-1790|repealed=n|archived=n|An Act for dividing and enclosing the Open Fields, Common Meadows and Pastures, Common and Waste Lands, in the Liberty or Lordship of Mickleover, in the County of Derby.}}
| {{|Road Common (Somerset, Wiltshire) Inclosure Act 1790|private|23|07-05-1790|repealed=n|archived=n|An Act for dividing and enclosing Part of a certain Common or Waste Land, called Road Common, within the Manor of Road and Langham, in the Parishes of Road and North Bradley, in the Counties of Somerset and Wilts.}}
| {{|Bleaton (Westmorland) Inclosure Act 1790|private|24|07-05-1790|repealed=n|archived=n|An Act for dividing and enclosing the Common and Waste Grounds within the Manor of Bleatarn, in the Parish of Warcop, in the County of Westmorland.}}
| {{|Cotgrave (Nottinghamshire) Inclosure Act 1790|private|25|07-05-1790|repealed=n|archived=n|An Act to confirm and establish the Division, Allotments, and Enclosure of the Open Fields, Meadows, Pastures, Commons, and Waste Grounds, lying in the Parish of Cotgrave, in the County of Nottingham, and also several Exchanges of Lands within the said Parish.}}
| {{|Polebrook (Northamptonshire) Inclosure Act 1790|private|26|07-05-1790|repealed=n|archived=n|An Act for dividing and enclosing the Common and Open Fields, Meadows, Commonable Lands and Waste Grounds, in the Parish of Polebrook, in the County of Northampton.}}
| {{|Duke of Newcastle's Estate Act 1790|private|27|09-06-1790|repealed=n|archived=n|An Act for empowering the Trustees of the Most Noble Henry Duke of Newcastle, to lay out Part of his settled Money in the Purchase of a Leasehold Manor, Messuages, Farms, Lands, Tythes, Tenements, and Hereditaments, lying intermixed, or convenient to be enjoyed, with his settled Estates, in the Counties of Nottingham and York, upon the like Trusts, and with the like Powers, as his said Estates now stand settled upon, or are subject or liable to.}}
| {{|Richard Wilson's Estate Act 1790|private|28|09-06-1790|repealed=n|archived=n|An Act for Sale of Part of the settled Estates of Richard Wilson Esquire, deceased, in the County of York, and for settling other Estates in the County of the City of York, in lieu thereof.}}
| {{|Reverend Stephen White's estate: vesting estates in London, Surrey, Middlesex and Hertfordshire in trustees, to be sold, purchase of other land to be settled in lieu and power to grant building and repairing leases.|private|29|09-06-1790|repealed=n|archived=n|An Act for vesting the settled Estates of the Reverend Stephen White, Doctor of Laws, in London, Middlesex, Surrey, and Hertfordshire, in Trustees to be sold, and for laying out the Purchase Money in other Estates, to be settled to the same Uses, and for enabling the Trustees in the mean Time, to grant building and repairing Leases.}}
| {{|Sir John Riddell, Surname, and Archibald Buchanan's Estate Act 1790|private|30|09-06-1790|repealed=n|archived=n|An Act to enable Sir John Riddell Baronet, to use the Surname and Arms of Buchanan, pursuant to the Will of Archibald Buchanan Esquire, deceased; and for vesting certain Estates in the Counties of Bedford and Bucks devised by the said Will, to the Uses therein mentioned, in Trustees to sell the same, for discharging Incumbrances thereon; and to lay out the Residue of the Money arising by such Sale in the Purchase of Lands to be settled to the same Uses; and for other Purposes.}}
| {{|Reverend John Templer's Estate Act 1790|private|31|09-06-1790|repealed=n|archived=n|An Act for exchanging the settled Estate of the Reverend John Templer, in the County of Kent, for another Estate of greater Value, in the County of Devon, to be settled in lieu thereof.}}
| {{|Margaret Lawrie's Estate Act 1790|private|32|09-06-1790|repealed=n|archived=n|An Act for settling and securing the Lands of Quintinespie, Kirklands, and others, and the Tiends, Parsonage, and Vicarage of the Lands of Redcastle and others lying in the Stewartry of Kirkcudbright, to and in Favour of Mistress Margaret Laurie of Redcastle, Widow of the deceased Andrew Laurie Esquire, of Redcastle, and the same Series of Heirs in Fee Tail, and under the same Conditions and Limitations as are mentioned and contained in Two Deeds of Entail, made in the Years One thousand seven hundred and twenty-seven, and One thousand seven hundred and thirty-three, by Mr. Walter Laurie of Redcastle, and for vesting in the aforesaid Mistress Margaret Laurie and her Heirs and Assigns, in Fee-Simple, the Lands of Mool and Cairn, and others, in the County of Wigton.}}
| {{|Thomas Estcourt's Estate Act 1790|private|33|09-06-1790|repealed=n|archived=n|An Act for vesting certain Parts of the settled Estates of Thomas Estcourt Esquire, in the Counties of Gloucester and Wilts, in Trustees to be sold and exchanged; and for laying out Part of the Money arising by Sale in other Estates, to be settled to the same Uses; and for applying the Residue in Discharge of Incumbrances.}}
| {{|William Colbourn and Eton College: exchange of advowsons of united rectories of Creeting All Saints and Creeting Saint Olaves (Suffolk) for advowson of rectory of East Wretham (Norfolk).|private|34|09-06-1790|repealed=n|archived=n|An Act to effectuate and establish an Exchange between William Colhoun Esquire with the Provost and College of Eton, of the Advowson and Right of Patronage of and to the consolidated or united Rectories of Creeting All Saints and Creeting Saint Olaves, in the County of Suffolk, for the Advowson and Right of Patronage of and to the Rectory of East Wretham, in the County of Norfolk.}}
| {{|William Colbourne and King's College, Cambridge: exchange of advowson of rectory of Hepworth (Suffolk), and land in Hepworth, for advowson of rectory of West Wretham (Norfolk).|private|35|09-06-1790|repealed=n|archived=n|An Act to effectuate and establish an Exchange between William Colhoun Esquire, and the Provost and Scholars of the King's College of Blessed Mary and Saint Nicholas, of Cambridge, of the Advowson and Right of Patronage of and to the Rectory of Hepworth, in the County of Suffolk, and certain Pieces of Land and Hereditaments in Hepworth aforesaid, for the Advowson and Right of Patronage of, and to the Rectory of West Wretham, in the County of Norfolk.}}
| {{|Duke of Norfolk's Estate Act 1790|private|36|09-06-1790|repealed=n|archived=n|An Act for vesting Part of the settled Estates of the Most Noble Charles Duke of Norfolk, in the County of Sussex, in him the said Duke, in Fee, and for settling other Estates of the said Duke in the same County, of equal or greater Value, in lieu thereof.}}
| {{|Duke of Bolton's Estate Act 1790|private|37|09-06-1790|repealed=n|archived=n|An Act for vesting the Manor of Fisherton Delamere, otherwise Fisherton Delamore, and other Hereditaments, in the County of Wilts, devised by the Will of the Most Noble Charles, formerly Duke of Bolton, with the Appurtenances, in Trustees, discharged of the Uses and Trusts of the said Will, for the Purpose of more effectually carrying into Execution certain Decrees or Decretal Orders of the Court of Chancery, for the Sale of the said Estates.}}
| {{|Earl of Abergavenny's Estate Act 1790|private|38|09-06-1790|repealed=n|archived=n|An Act to confirm a Lease lately made by Henry Nevill Earl of Abergavenny, of certain entailed Mines and other Hereditaments, in the County of Monmouth, and to enable granting future Leases of the said entailed Mines and other Hereditaments, and also of all other Estates, of which the said Earl is seized as Tenant in Tail Male, under an Act of Parliament passed in the Second and Third Years of the Reign of King Philip and Queen Mary, and under the Limitations in the last Will of George Lord Abergavenny, in the said Act of Philip and Mary mentioned.}}
| {{|Richard and Katherine Hatchett's Estate Act 1790|private|39|09-06-1790|repealed=n|archived=n|An Act for vesting the settled Estates of Richard Hatchett Esquire, and Katherine his Wife, in the County of Chester, and Part of their settled Estates in the County of Salop, in Trustees to be sold, and for laying out the Purchase Money in other Estates, to be settled to the same Uses.}}
| {{|Bowbrickhill and Fenny Stratford (Buckinghamshire) Inclosure Act 1790|private|40|09-06-1790|repealed=n|archived=n|An Act for dividing and enclosing the Open and Common Fields, Meadows, Heath, and Waste Grounds, within the Parish of Bowbrickhill, and Hamlet of Fenny Stratford, in the County of Buckingham.}}
| {{|Lutterworth (Leicestershire) Inclosure Act 1790|private|41|09-06-1790|repealed=n|archived=n|An Act for dividing and enclosing the Open Fields and Commonable Places, in the Parish of Lutterworth, in the County of Leicester.}}
| {{|Clayworth (Nottinghamshire) Inclosure Act 1790|private|42|09-06-1790|repealed=n|archived=n|An Act for dividing, allotting, enclosing, and regulating certain Open Fields, Meadows, Pastures, Carrs, Commons, and Waste Grounds, within the Township and Liberty of Clayworth, in the Parish of Clayworth, in the County of Nottingham.}}
| {{|Whychurch, Milborne and Little Somerford (Wiltshire) inclosure and drainage.|private|43|09-06-1790|repealed=n|archived=n|An Act for draining, dividing, allotting, and enclosing, certain Commons and Waste Lands, and also a certain Open Common Meadow, within the Manors of Whychurch and Milborne, and Little Somerford, in the County of Wilts.}}
| {{|Tickton Carr (Yorkshire, East Riding) Inclosure Act 1790|private|44|09-06-1790|repealed=n|archived=n|An Act for dividing and enclosing Tickton Carr or Common, in the County of York.}}
| {{|Great and Little Bedwin and Preshute (Wiltshire) division and allotment of open and common lands.|private|45|09-06-1790|repealed=n|archived=n|An Act for dividing and allotting several Open and Common Lands and Grounds, within the Parishes of Great Bedwin, Little Bedwin, and Preshute, in the County of Wilts.}}
| {{|Hutton Bushell (Yorkshire, North Riding) inclosure.|private|46|09-06-1790|repealed=n|archived=n|An Act for dividing and enclosing the Open Fields, Ings, Commons, and Waste Grounds, within the Manor and Township of Hutton Bushell, in the North Riding of the County of York.}}
| {{|Naturalization of Françoise De Luc Act 1790|private|47|09-06-1790|repealed=n|archived=n|An Act for naturalizing Francoise Antoinette De Luc.}}
| {{|Naturalization of August Schonberg Act 1790|private|48|09-06-1790|repealed=n|archived=n|An Act for naturalizing August Leberecht Schonberg.}}
| {{|Sir Peter Burrell's and Reverend Edward Brackenbury's Estates Act 1790|private|49|10-06-1790|repealed=n|archived=n|An Act for the Partition of divers Messuages, Lands, and Hereditaments, in Skendleby and other Parishes, in the County of Lincoln, in which Sir Peter Burrell Baronet, in Right of the Right Honourable Priscilla Barbara Elizabeth Baroness Willoughby of Eresby his Wife, and the Reverend Edward Brackenbury, have now undivided Moieties or Half Parts.}}
}}
Sources
See also
List of Acts of the Parliament of Great Britain
References
1790
1790s in Great Britain
|
The List of railway routes in Thuringia provides a list of all railway routes in Thuringia. This includes Intercity-Express, Intercity, Regional-Express, Regionalbahn services. In the route tables, the major stations are shown in bold text. Where intermediate stations are not given, these are replaced by three dots "...".
Regional services
The following Regional-Express and Regionalbahn services run through Thuringia:
Regional rail in Germany
Transport in Thuringia
Thuringia-related lists
Thuringia
|
pc Quest was a pop music group in the 1990s from Oklahoma. They were managed by George Tobin, best known for managing Tiffany, and Tim James, one half of the duo Rock Mafia. They were featured in Bop and Teen Beat magazine as teen idols.
The quartet was originally signed to Geffen Records in 1990, but an initial release of "After The Summer's Gone" that fall to Contemporary hit radio stations through both Geffen and Giant Records failed to chart. Months later, now signed to Tobin's Headlinerecords and RCA Records, their "Can I Call You My Girl?" became a minor hit, followed by a reissue of "After The Summer's Gone", which narrowly missed the top 40 on the Billboard Hot 100. A 1992 follow-up album failed to yield any hits, and the group parted ways.
Group member Chad Petree would find success years later as one of the leaders of indie rock band Shiny Toy Guns, with brother Stephen credited as a writer on several of the band's songs.
Members
Chad Petree
Stephen Petree
Drew Nichols
Kim Whipkey
Discography
pc Quest (1991)
Directions (1992)
Singles
"Can I Call You My Girl" #58 Hot 100 (1991)
"Can't You See" (1991)
"After the Summer's Gone" #41 Hot 100 (1991)
"I Have To Go On Alone" (1992)
External links
pc Quest at Discogs
[ pc Quest] at Allmusic
American pop music groups
Musical groups established in 1990
Musical groups disestablished in 1992
Musical groups from Oklahoma
|
```java
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.jsoup.nodes.Element;
import org.jsoup.select.Elements;
import javax.net.ssl.HttpsURLConnection;
import javax.net.ssl.SSLContext;
import javax.net.ssl.TrustManager;
import javax.net.ssl.X509TrustManager;
import java.nio.charset.Charset;
/**
* JSoup Hello World
*
* Created by vedenin on 16.01.16.
*/
public class URLDownloadTests {
private final static String USER_AGENT = "Mozilla/5.0 (Macintosh; Intel Mac OS X 10_9_2) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/33.0.1750.152 Safari/537.36";
private static void initHTTPSDownload() throws Exception {
// Create a new trust manager that trust all certificates
TrustManager[] trustAllCerts = new TrustManager[]{
new X509TrustManager() {
public java.security.cert.X509Certificate[] getAcceptedIssuers() {
return null;
}
public void checkClientTrusted(
java.security.cert.X509Certificate[] certs, String authType) {
}
public void checkServerTrusted(
java.security.cert.X509Certificate[] certs, String authType) {
}
}
};
// Activate the new trust manager
try {
SSLContext sc = SSLContext.getInstance("SSL");
sc.init(null, trustAllCerts, new java.security.SecureRandom());
HttpsURLConnection.setDefaultSSLSocketFactory(sc.getSocketFactory());
} catch (Exception e) {
System.out.print(e.getMessage());
}
}
private static String testJsoup(String url) throws Exception {
return Jsoup.connect(url).userAgent(USER_AGENT).cookie("auth", "token")
.timeout(30000).get().html();
}
private static String testJsoupHeadlines(String url) throws Exception {
Document doc = Jsoup.connect(url).userAgent(USER_AGENT).cookie("auth", "token")
.timeout(30000).get();
Elements newsHeadlines = doc.select("#mp-itn b a");
return newsHeadlines.html();
}
private static void testHtmlParser(String url) throws Exception {
Document doc = Jsoup.connect(url).userAgent(USER_AGENT).cookie("auth", "token")
.timeout(30000).get();
Charset charset = doc.charset();
System.out.println("charset = " + charset);
System.out.println("location = " + doc.location());
System.out.println("nodeName = " + doc.nodeName());
Document.OutputSettings outputSettings = doc.outputSettings();
System.out.println("charset = " + outputSettings.charset());
System.out.println("indentAmount = " + outputSettings.indentAmount());
System.out.println("syntax = " + outputSettings.syntax());
System.out.println("escapeMode = " + outputSettings.escapeMode());
System.out.println("prettyPrint = " + outputSettings.prettyPrint());
System.out.println("outline = " + outputSettings.outline());
System.out.println("title = " + doc.title());
System.out.println("baseUri = " + doc.baseUri());
Element head = doc.head();
Elements children = head.children();
for(Element child: children) {
System.out.print(child.tag().getName() + " : ");
System.out.println(child);
}
printElements(doc.body().children());
}
private static void printElements(Elements children) {
for(Element child: children) {
if(!child.text().isEmpty()) {
System.out.print(child.tag().getName() + " : ");
System.out.println(child.text());
}
printElements(child.children());
}
}
public static void main(String[] s) throws Exception {
initHTTPSDownload();
String wikipedia = testJsoup("path_to_url");
System.out.println(wikipedia.length()); // print something about 70694
String headlines = testJsoupHeadlines("path_to_url");
System.out.println(headlines);
String stackoverflow = testJsoup("path_to_url");
System.out.println(stackoverflow.length()); // print something about 70694
testHtmlParser("path_to_url");
}
}
```
|
The Clearwater Women's Open was a tournament for professional female tennis players played on outdoor hard courts. The event was classified as a $25,000 ITF Women's Circuit tournament and was held in Clearwater, Florida, United States, from 2005 to 2012.
Past finals
Singles
Doubles
External links
ITF search
ITF Women's World Tennis Tour
Hard court tennis tournaments in the United States
Clearwater Women's Open
Recurring sporting events established in 2005
Recurring sporting events disestablished in 2012
Sports in Clearwater, Florida
2005 establishments in Florida
2012 disestablishments in Florida
Women's sports in Florida
|
Homostichanthidae is a family of sea anemones belonging to the order Actiniaria.
Genera:
Homostichanthus
References
Actinioidea
Cnidarian families
|
Pat Barnes (born February 23, 1975) is a former National Football League (NFL) quarterback. He played from 1997 to 2003 in the NFL, XFL, and CFL.
Barnes played as a quarterback at University of California, where he started a couple of games as a freshman and emerged as a budding star through his college career. Barnes played for Steve Mariucci at Cal, where he threw 420 passes during the 1996 season, and learned Mariucci's version of the West Coast offense. Barnes gained the reputation as a QB who spread the ball out to all his receivers, and threw very well on the run. He set a Pac-10 record for touchdowns in 1996, and had a 31-8 touchdown to interception ratio. Barnes finished the year as a second-team All-American selection behind Jake Plummer.
Barnes, a graduate and football standout at University of California, was drafted in the fourth round (110th overall) of the 1997 NFL Draft by the Kansas City Chiefs. He participated in 7 NFL seasons for seven different teams. Though he never threw a pass in the NFL, Barnes played very well in his five seasons playing outside the NFL, throwing 30 touchdown passes in his two seasons with the Frankfurt Galaxy.
After four seasons out of the league, he signed with the Cleveland Browns on February 10, 2003. He was released on June 6. His football career ended when the Winnipeg Blue Bombers of the CFL released him on December 9, 2003, at his request and subsequent retirement from the game.
College statistics
1995: 197/362 for 2,685 yards with 17 TD vs 11 INT.
1996: 250/420 for 3,499 yards with 31 TD vs 8 INT.
References
External links
Pat Barnes profile
1975 births
Living people
Sportspeople from Arlington Heights, Illinois
American football quarterbacks
California Golden Bears football players
Kansas City Chiefs players
Oakland Raiders players
San Francisco 49ers players
Frankfurt Galaxy players
Winnipeg Blue Bombers players
San Francisco Demons players
Canadian football quarterbacks
Trabuco Hills High School alumni
Players of American football from Mission Viejo, California
|
```html
<mwl-demo-utils-calendar-header [(view)]="view" [(viewDate)]="viewDate">
</mwl-demo-utils-calendar-header>
<div class="alert alert-info">
<div [ngSwitch]="view">
<span *ngSwitchCase="'month'"
>Click on a month label to change the view to that month.</span
>
<span *ngSwitchCase="'week'"
>Click on a day header to change the view to that day.</span
>
<span *ngSwitchCase="'day'">There is no other view to navigate to.</span>
</div>
</div>
<div [ngSwitch]="view">
<mwl-calendar-month-view
*ngSwitchCase="'month'"
[viewDate]="viewDate"
[events]="events"
(dayClicked)="changeDay($event.day.date)"
>
</mwl-calendar-month-view>
<mwl-calendar-week-view
*ngSwitchCase="'week'"
[viewDate]="viewDate"
[events]="events"
(dayHeaderClicked)="changeDay($event.day.date)"
>
</mwl-calendar-week-view>
<mwl-calendar-day-view
*ngSwitchCase="'day'"
[viewDate]="viewDate"
[events]="events"
>
</mwl-calendar-day-view>
</div>
```
|
Van den Bosch is a Dutch toponymic surname, originally indicating either an association with a forest ("bosch", modern Dutch "bos"), with a place/dwelling named "Den Bosch" or with the city Den Bosch. In the Netherlands about 10,200 carried the name in 2007, while in Belgium 3,755 people were named Van Den Bosch and another 3,164 were named Vandenbosch, Vandebosch or Vanden Bosch in 2008. Other variant spellings are Van der Bosch and Van den Bos.
People with this surname include:
Antal van den Bosch (born 1969), Dutch language researcher
Dirk van den Bosch (1906–1994), Dutch sports shooter
(1789-1851), Dutch admiral and Minister of Colonies
François Van Den Bosch (born 1934), Belgian cyclist
Hippolyte Van den Bosch (1926-2011), Belgian footballer
Jean Van Den Bosch (1898-1985), Belgian cyclist
Jean van den Bosch (1910-1985), Belgian diplomat
Jean Van den Bosch, guitarist and vocalist of The Vipers Skiffle Group
Johannes van den Bosch (1780-1844), Dutch Minister of State and Governor-General of the Dutch East Indies
Johannes van den Bosch (1906-1994), Dutch chess player
Johannes Adrianus van den Bosch (1813-1870), Dutch officer and politician; Minister of War from 1866 to 1868
Kyle Vanden Bosch (b. 1978), American football player
Linde van den Bosch (b. 1963), Dutch linguist
Monique van den Bosch (b. 1964), Dutch wheelchair tennis player
Pieter van den Bosch (1612–1673), Dutch painter
Pieter Van den Bosch (1927-2009), Belgian footballer
Rinus van den Bosch (1938-1996), Dutch artist
Roelof Benjamin van den Bosch (1810-1862), Dutch botanist
Tjalling van den Bosch (b. 1958), Dutch strongman
(b. 1985), Belgian cyclo-cross racer
Van der Bosch
Peter van der Bosch (1686-1736), Flemish Jesuit hagiographer
Vandebosch
Ingrid Vandebosch (b. 1970), Belgian model
See also
Van den Bos, Dutch surname
Van den Bossche, Flemish surname
Van den Bosch (noble family), Dutch noble family
Bosch (surname), both a Dutch and Catalan surname.
Fort van den Bosch a fort on Java named after Governor General Johannes van den Bosch
Vandenboschia, fern genus named after Roelof Benjamin van den Bosch
References
Dutch-language surnames
Dutch toponymic surnames
|
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
//go:build linux || netbsd
package unix
import "unsafe"
type mremapMmapper struct {
mmapper
mremap func(oldaddr uintptr, oldlength uintptr, newlength uintptr, flags int, newaddr uintptr) (xaddr uintptr, err error)
}
var mapper = &mremapMmapper{
mmapper: mmapper{
active: make(map[*byte][]byte),
mmap: mmap,
munmap: munmap,
},
mremap: mremap,
}
func (m *mremapMmapper) Mremap(oldData []byte, newLength int, flags int) (data []byte, err error) {
if newLength <= 0 || len(oldData) == 0 || len(oldData) != cap(oldData) || flags&mremapFixed != 0 {
return nil, EINVAL
}
pOld := &oldData[cap(oldData)-1]
m.Lock()
defer m.Unlock()
bOld := m.active[pOld]
if bOld == nil || &bOld[0] != &oldData[0] {
return nil, EINVAL
}
newAddr, errno := m.mremap(uintptr(unsafe.Pointer(&bOld[0])), uintptr(len(bOld)), uintptr(newLength), flags, 0)
if errno != nil {
return nil, errno
}
bNew := unsafe.Slice((*byte)(unsafe.Pointer(newAddr)), newLength)
pNew := &bNew[cap(bNew)-1]
if flags&mremapDontunmap == 0 {
delete(m.active, pOld)
}
m.active[pNew] = bNew
return bNew, nil
}
func Mremap(oldData []byte, newLength int, flags int) (data []byte, err error) {
return mapper.Mremap(oldData, newLength, flags)
}
func MremapPtr(oldAddr unsafe.Pointer, oldSize uintptr, newAddr unsafe.Pointer, newSize uintptr, flags int) (ret unsafe.Pointer, err error) {
xaddr, err := mapper.mremap(uintptr(oldAddr), oldSize, newSize, flags, uintptr(newAddr))
return unsafe.Pointer(xaddr), err
}
```
|
```toml
# This file has been moved to path_to_url
```
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<resources>
<string name="app_name">Simpla Dosieradministrilo</string>
<string name="app_launcher_name">Dosieradministrilo</string>
<string name="press_back_again">Press back again to exit</string>
<string name="go_to_home_folder">Go to home folder</string>
<string name="set_as_home_folder">Set as home folder</string>
<string name="home_folder_updated">Home folder updated</string>
<string name="copy_path">Copy path to clipboard</string>
<string name="path_copied">Path copied</string>
<string name="select_audio_file">Please select an audio file</string>
<string name="search_folder">Search folder</string>
<string name="rooted_device_only">This operation works only on rooted devices</string>
<string name="recents">Recents</string>
<string name="show_recents">Show recents</string>
<string name="pdf_viewer">PDF Viewer</string>
<string name="invert_colors">Invert colors</string>
<!-- Open as -->
<string name="open_as">Malfermi kiel</string>
<string name="text_file">Teksta dosiero</string>
<string name="image_file">Bilda dosiero</string>
<string name="audio_file">Sondosiero</string>
<string name="video_file">Filma dosiero</string>
<string name="other_file">Alia dosiero</string>
<!-- Compression -->
<string name="compress">Densigi</string>
<string name="compress_pro">Densigi (Pro)</string>
<string name="decompress">Maldensigi</string>
<string name="compress_as">Densigi kiel</string>
<string name="compressing">Densigante</string>
<string name="decompressing">Maldensigante</string>
<string name="compression_successful">Densigo sukcesis</string>
<string name="decompression_successful">Maldensigo sukcesis</string>
<string name="compressing_failed">Densigo malsukcesis</string>
<string name="decompressing_failed">Maldensigo malsukcesis</string>
<!-- Favorites -->
<string name="manage_favorites">Manage favorites</string>
<string name="go_to_favorite">Go to favorite</string>
<string name="favorites_activity_placeholder">You can add frequently used folders to favorites for easy access from anywhere.</string>
<!-- File Editor -->
<string name="file_editor">Dosierredaktilo</string>
<!-- Storage analysis -->
<string name="storage_analysis">Storage analysis</string>
<string name="images">Bildoj</string>
<string name="videos">Filmoj</string>
<string name="audio">Sonoj</string>
<string name="documents">Dokumentoj</string>
<string name="downloads">Elutoj</string>
<string name="archives">Archives</string>
<string name="others">Aliaj</string>
<string name="storage_free">free</string>
<string name="total_storage">Total storage: %s</string>
<!-- Settings -->
<string name="enable_root_access">Enable root access</string>
<string name="press_back_twice">Require pressing Back twice to leave the app</string>
<!--
Haven't found some strings? There's more at
path_to_url
-->
</resources>
```
|
Yosemite Sam is an American animated cartoon character in the Looney Tunes and Merrie Melodies series of cartoons produced by Warner Bros. Animation. The character appeared in dozens of cartoons from the 1940s to the 2000s.
Golden Age Саrtoоnѕ
1945
Hare Trigger (debut)
1947
Along Came Daffy (pitting Yosemite Sam and his brother against Daffy Duck; one of only two Sam cartoons not to feature Bugs Bunny)
1948
Buccaneer Bunny
Bugs Bunny Rides Again
1949
High Diving Hare
1950
Mutiny on the Bunny
Big House Bunny
Bunker Hill Bunny
1951
Rabbit Every Monday
The Fair-Haired Hare
Ballot Box Bunny
1952
14 Carrot Rabbit
Hare Lift
1953
Southern Fried Rabbit
Hare Trimmed
1954
Captain Hareblower
1955
Sahara Hare
This Is a Life?
Roman Legion-Hare
1956
Rabbitson Crusoe
A Star Is Bored
1957
Piker's Peak
1958
Knighty Knight Bugs
1959
Wild and Woolly Hare
Hare-Abian Nights (Directed by Ken Harris of the Chuck Jones unit; only one from the "classic" era that is not directed by Friz Freleng or a member of the Friz Freleng unit)
1960
From Hare to Heir
Lighter Than Hare
Horse Hare
1961
Prince Violent
1962
Honey's Money (the second of Sam's only two cartoons not to feature Bugs Bunny)
Shishkabugs (Friz Freleng's last completely original cartoon with Yosemite Sam in the original Looney Tunes era)
1963
Devil's Feud Cake (Friz Freleng's last overall appearance of Yosemite Sam in the original Looney Tunes era)
1964
Dumb Patrol (Sam's last cartoon in the original Looney Tunes era, and the only one directed by a member of the unit of Friz Freleng other than Freleng himself)
Pancho's Hideaway (features a Mexican relative, Pancho Vanilla, who is designed much like his cousin Sam but has a different accent)
After the Golden Age
1979
Bugs Bunny's Christmas Carol (Friz Freleng's last Yosemite Sam cartoon overall)
1980
The Bugs Bunny Mystery Special
1981
The Looney Looney Looney Bugs Bunny Movie (movie)
1982
Bugs Bunny's 3rd Movie: 1001 Rabbit Tales (movie)
1983
Daffy Duck's Fantastic Island (movie)
1988
Who Framed Roger Rabbit (movie)
1990
Tiny Toon Adventures (TV series)
1991
(Blooper) Bunny
1992
Invasion of the Bunny Snatchers
1994
The Warners 65th Anniversary Special (Animaniacs guest appearance)
1995
Carrotblanca
1996
Space Jam (movie)
1997
From Hare to Eternity
2000
Tweety's High-Flying Adventure (movie)
2003
Looney Tunes: Back in Action (movie)
2004
Hare and Loathing in Las Vegas
2006
Bah, Humduck! A Looney Tunes Christmas (movie)
2011
The Looney Tunes Show (TV series)
2015
Looney Tunes: Rabbits Run (movie)
New Looney Tunes (TV series)
2020
Looney Tunes Cartoons (HBO Max)
2021
Space Jam: A New Legacy (movie)
References
Yosemite Sam
|
The Volunteers of America Classic is a women's professional golf tournament in Texas on the LPGA Tour. It debuted in April 2013 at Las Colinas Country Club in Irving, northwest of downtown Dallas.
Volunteers of America, the title sponsor, is a faith-based nonprofit organization that provides affordable housing and other assistance, primarily to low-income people, throughout the United States.
Inbee Park won the inaugural event, one stroke ahead of Carlota Ciganda, and became its first multiple winner in 2015. In between, Stacy Lewis won by six strokes in 2014 and set the tournament record at 268 (−16).
In 2018, the tournament moved north to the Old American Golf Club in The Colony, along Lewisville Lake.
Tournament names
2013–2014: North Texas LPGA Shootout
2015: Volunteers of America North Texas Shootout Presented by JTBC
2016–2017: Volunteers of America Texas Shootout Presented by JTBC
2018: Volunteers of America LPGA Texas Classic
2019–2021: Volunteers of America Classic
2022–present: The Ascendant LPGA benefitting Volunteers of America
Winners
Tournament records
References
External links
Coverage on LPGA Tour official site
Old American Golf Club
Las Colinas Country Club – former host
LPGA Tour events
Golf in Texas
Sports in Irving, Texas
Recurring sporting events established in 2013
2013 establishments in Texas
Women's sports in Texas
|
Harold Herman Raether (October 10, 1932 – September 26, 2020), nicknamed "Bud", was an American Major League Baseball relief pitcher. He appeared in only two games in MLB, one for the Philadelphia Athletics, and one for the Kansas City Athletics three years later, after the franchise moved to Kansas City, Missouri. Raether threw and batted right-handed, stood tall and weighed .
Raether played at the collegiate level at the University of Wisconsin-Madison. His pro career began in 1954 and lasted for four seasons (1954–55 and 1957–58). In the majors, he allowed three earned runs and three hits in four full innings pitched; he issued four bases on balls and did not record a strikeout. One of the hits he surrendered was a home run, hit by eventual Baseball Hall of Famer George Kell on May 19, 1957.
Raether died on September 26, 2020, at the age of 87.
References
1932 births
2020 deaths
Albany Senators players
Baseball players from Wisconsin
Columbia Gems players
Kansas City Athletics players
Lancaster Red Roses players
Major League Baseball pitchers
People from Lake Mills, Wisconsin
Philadelphia Athletics players
Rochester/Winona A's players
Savannah A's players
Wisconsin Badgers baseball players
|
This table shows an overview of the protected heritage sites in the Walloon town Onhaye. This list is part of Belgium's national heritage.
|}
See also
List of protected heritage sites in Namur (province)
References
Belgian heritage register: Direction générale opérationnelle - Aménagement du territoire, Logement, Patrimoine et Energie (DG4)
www.dglive.be
Onhaye
|
Federalist No. 24, titled "The Powers Necessary to the Common Defense Further Considered", is a political essay written by Alexander Hamilton and the twenty-fourth of The Federalist Papers. It was first published in New York newspapers on December 19, 1787, under the pseudonym Publius, the name under which all The Federalist Papers were published. It is one of two essays by Hamilton arguing in favor of a national standing army during peacetime, along with Federalist No. 25.
Federalist No. 24 challenged those who wish to prohibit a standing army in peacetime, arguing that its formation is essential for the security of the nation while concerns about its existence are exaggerated. Hamilton explained that provisions against the creation of a standing army already did not exist under the law of the time, and he warned of potential threats that would necessitate a standing army. Federalist No. 24 was written at a time in which standing armies were viewed with skepticism, but such an army has come to be expected in the United States since Hamilton's time.
Summary
Hamilton challenges the idea that the proposed constitution should prohibit standing armies in peacetime. He says that it is merely an assertion that lacks an argument behind it. Speculating about the perspective of someone who heard the cries for this position without reading the constitution, he supposes that such a person would assume the constitution mandated a standing army or that the executive branch of the government would control levying of soldiers. He explains that neither premise is true: no such provision would require a standing army and levying of soldiers is a power granted to the legislature.
Continuing with his hypothetical newcomer to the debate, Hamilton suggests that this person would be surprised to find that only two state constitutions had such a provision and that the Articles of Confederation had none. He describes the surprise and frustration that this person would feel to learn that apprehensions surrounding a standing army in peacetime, as Hamilton describes it, are unfounded.
Hamilton moves on to explain why a standing army during peacetime is necessary. He warns of British and Spanish colonies as well as Native American tribes, and he suggests that the United States would be under threat from attacks by both land and sea. Hamilton describes already existing garrisons of soldiers who are stationed to prevent such attacks. He explains that these garrisons can be run by professional soldiers or by militias, and he expresses his preference for trained soldiers.
Background and publication
Federalist No. 24 was written by Alexander Hamilton. Like all of the Federalist Papers, it was published under the pseudonym Publius in New York newspapers to explain the provisions of the Constitution of the United States and persuade New York to ratify it. It was first published in the Independent Journal, the Daily Advertiser, and the New-York Journal on December 19, 1787. It was then published in the New-York Packet on December 21.
Analysis
Federalist No. 24 challenged the refrain that the constitution was flawed because it did not prohibit a standing army during peacetime. During the 18th century, standing armies in peacetime were unpopular among proponents of civic republicanism, and they were often seen as a challenge to liberty, leading to a preference for militias to serve as soldiers only when necessary. Hamilton argued that a standing army was necessary and that such a prohibition would be harmful. He rejected the idea that a militia could perform as adequately as a standing army, and he also expressed concern that rotating militias would disrupt both industry and individual families. American military leaders such as George Washington agreed that a standing army was necessary instead of a militia.
Hamilton was skeptical that long term peace was plausible. He noted that neither the Articles of Confederation nor most of the existing state constitutions had such a provision regarding standing armies. He also emphasized that a safeguard was provided in that the legislature rather than the executive would control the military's funding. To demonstrate the need for a standing army, Hamilton pointed to the constant threats from adversaries that bordered the United States. He warned of Spanish colonies to the south, Native American tribes to the west, British colonies to the north, and the potential of naval attacks from the east. Hamilton further warned against complacence in that European powers were far away, saying that advances in naval technology allowed distant nations to operate as if they were neighbors. For these reasons, he advocated garrisons in the western frontier and along the eastern coast.
Aftermath
Hamilton continued the same argument in Federalist No. 25. A standing army in peacetime has since become a widely accepted concept in the United States, including both active duty soldiers and military reserve forces. In peacetime, the latter often double as humanitarian workers during natural disasters. In addition to domestic and coastal defense garrisons as described by Hamilton, American soldiers also make up garrisons in other countries around the world, and the separation of nations by oceans has become less relevant in military considerations.
Federalist No. 24 has been cited in cases before the Supreme Court of the United States: Lewis F. Powell Jr. cited it in Selective Service System v. Minnesota Public Interest Research Group (1984) and Wayte v. United States (1985), and Antonin Scalia cited it in Harmelin v. Michigan (1991).
References
External links
Full text of Federalist No. 24 at Avalon Project
24
1787 in American law
1787 essays
1787 in the United States
|
```javascript
Function constructor vs. function declaration vs. function expression
`.bind()`
Move cursor at the end of text input
Check if a document is done loading
Changing a functions context with `fn.call(object)`
```
|
Connections is a 1995 educational adventure video game.
Plot
Based on the show Connections on The Learning Channel, the game revolves around a plot of the player aiming to fix a computer program, by finding a series of connections that glue the world together.
Gameplay
Players progress through a series of graphic screens, and FMV video to find a series of connections. Items can be manipulated using hotspots. The game is narrated by James Burke. Players can toggle a hints system, adjust volume, save the game, and choose their gender.
Critical reception
Lisa Karen Savignano of Allgame wrote that the game was "exceptional" but that it had the potential to leave players endlessly frustrated. GameZone's Craig Majaski thought the game would appeal to players who had enjoyed Myst or Return to Zork. Meanwhile, The AV Club contributor Brian Clair said the game succeeded as a learning tool. MacWorld's George and Ben Beekman thought the game was well below the industry standard for the genre. Entertainment Weekly thought the game was a missed opportunity; instead of being interesting and unique it was merely "Myst with a twist".
The November 1996 edition of Computer Gaming World deemed the video game the #13 Top Sleeper Of All Time.
References
External links
Main page
Connections at CGW
1995 video games
Educational video games
Classic Mac OS games
Windows games
Video games developed in the United States
|
The Quino checkerspot (Euphydryas editha quino) is a butterfly native to southern California and northwestern Baja California. It is a subspecies of the common Edith's checkerspot (Euphydryas editha) and the second such subspecies to be listed under the federal Endangered Species Act.
Taxonomy
This taxon, like many others, has undergone several changes in nomenclature and classification. It was originally described as Melitaea quino in 1863 and then in 1929 it was reduced to a subspecies of Euphydryas chalcedona. In 1998 it was concluded through Hans Hermann Behr's 1863 description that it should be classified as E. editha, not E. chalcedona. Moreover, the subspecies E. editha wrighti was demoted to a junior synonym for E. editha quino.
Description
Appearance
A member of the brush-footed butterfly family, Nymphalidae, the Quino checkerspot is a medium-sized butterfly with a wingspan of approximately 3 cm. The dorsal wing surfaces are a colorful checkerboard of brown, red and yellow spots. The Quino differs from other E. editha subspecies in that its spots tend to be a darker red.
It also differentiates itself through its size and larval and pupal phenotypes. The ventral side of the butterfly are dominated by a checkered red and cream pattern. Its abdomen has red stripes across the dorsal side. After a second molt, the Quino checkerspot is recognized by the dark black coloration and row of 8 to 9 orange tubercles on their back. Before the larvae first molt they are mostly yellowish. After first molt and before their second molt they are gray with black markings. The pupae are mottled black on a blue-gray background.
The Quino checkerspot is easily confused in the field by inexperienced butterfly searchers. It is generally confused with three other co-occurring butterfly species, the Chalcedon or variable checkerspot (Euphydryas chalcedona), Gabb's checkerspot (Chlosyne gabbii) and Wright's checkerspot (Thessalia leonira wrighti).
Life cycle
The life cycle of the Quino checkerspot closely mirrors that of the close Bay checkerspot. They share the same host plant and similar chronology of developmental stages. Sometimes, organisms molt seven times before reaching adulthood. There are typically only one generation of adults every year. The flight period is between February through May.
Habitat
The obvious factor in the decline of the Quino checkerspot is urban development. Much of the historic scrub land that it occupied, much like the Mission blue butterfly, also endangered, has been built over. The persisting habitat faces other threats. Invasive species, in the form of non-native plant life and overgrazing are just two of the hurdles facing the recovery of the Quino checkerspot. Today, there are eight populations of the Quino known.
Range
Habitat declined and, thus, distribution and population of the Quino checkerspot has been greatly reduced during the last 100 years, likely around 75%. Nearly all of the blame lies in agricultural and urban development in southern California. The other impactors to the decline include non-native grasses and fire suppression practices as well as grazing. The Quino checkerspot became the second subspecies of Euphydryas editha to be listed under the Endangered Species Act (ESA). The first was the Bay checkerspot.
Currently, the Quino checkerspot is only found in a very few locales. Western Riverside County, southern San Diego County and northern Baja California, Mexico. The animal's historic range once included much of coastal California south of Ventura County as well as the inland valleys south of the Tehachapi Mountains. Regardless, more than 75% of the butterfly's original range has been lost. The range loss translates directly into population decline. Quino checkerspot butterfly populations appear to have decreased by more than 95% range wide.
Impact of barrier construction along Mexico-United States border
American President Donald Trump proposed expansion of the border wall between Mexico and the US to prevent illegal entry by foreign nationals through Mexico into the US during his presidential campaign and upon being elected. The construction of additional border walls in new locations would likely have adverse effects on many species, including the Quino checkerspot. Because the range of the subspecies is so reduced and threatened already, the construction of a wall would separate the organisms in Mexico and the US, which would reduce the genetic diversity between the populations. In addition, the proposed wall could harm the native vegetation the butterflies need and may spread invasive species in areas disturbed by the construction.
References
Euphydryas
Fauna of California
Fauna of the Baja California Peninsula
Fauna of the California chaparral and woodlands
Natural history of Baja California
Natural history of the Peninsular Ranges
Natural history of the Transverse Ranges
Butterflies of North America
Endangered fauna of California
Endangered biota of Mexico
Endangered fauna of North America
ESA endangered species
Butterfly subspecies
|
```java
/**
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.thingsboard.server.dao.timeseries;
import com.google.common.util.concurrent.ListenableFuture;
import org.thingsboard.server.common.data.id.DeviceProfileId;
import org.thingsboard.server.common.data.id.EntityId;
import org.thingsboard.server.common.data.id.TenantId;
import org.thingsboard.server.common.data.kv.DeleteTsKvQuery;
import org.thingsboard.server.common.data.kv.TsKvEntry;
import org.thingsboard.server.common.data.kv.TsKvLatestRemovingResult;
import java.util.List;
import java.util.Optional;
public interface TimeseriesLatestDao {
/**
* Optional TsKvEntry if the value is present in the DB
*
*/
ListenableFuture<Optional<TsKvEntry>> findLatestOpt(TenantId tenantId, EntityId entityId, String key);
/**
* Returns new BasicTsKvEntry(System.currentTimeMillis(), new StringDataEntry(key, null)) if the value is NOT present in the DB
*
*/
ListenableFuture<TsKvEntry> findLatest(TenantId tenantId, EntityId entityId, String key);
ListenableFuture<List<TsKvEntry>> findAllLatest(TenantId tenantId, EntityId entityId);
ListenableFuture<Long> saveLatest(TenantId tenantId, EntityId entityId, TsKvEntry tsKvEntry);
ListenableFuture<TsKvLatestRemovingResult> removeLatest(TenantId tenantId, EntityId entityId, DeleteTsKvQuery query);
List<String> findAllKeysByDeviceProfileId(TenantId tenantId, DeviceProfileId deviceProfileId);
List<String> findAllKeysByEntityIds(TenantId tenantId, List<EntityId> entityIds);
}
```
|
```smalltalk
namespace UnityEngine.Purchasing
{
/// <summary>
/// Reasons for which purchasing initialization could fail.
/// </summary>
public enum InitializationFailureReason
{
/// <summary>
/// In App Purchases disabled in device settings.
/// </summary>
PurchasingUnavailable,
/// <summary>
/// No products available for purchase,
/// typically indicating a configuration error.
/// </summary>
NoProductsAvailable,
/// <summary>
/// The store reported the app as unknown.
/// Typically indicates the app has not been created
/// on the relevant developer portal, or the wrong
/// identifier has been configured.
/// </summary>
AppNotKnown
}
}
```
|
This is a list of television films produced for the cable networks Hallmark Channel (HC) and Hallmark Movies & Mysteries (HMM). Such films are currently called Hallmark Channel Original Movies and Hallmark Movies and Mysteries.
The Hallmark Channel was officially launched in August 2001, with its sister channel Hallmark Movies & Mysteries (originally Hallmark Movie Channel) launched in January 2004. In addition to stand-alone original films, both channels broadcast a number of original film series, including Garage Sale Mystery, Jesse Stone, Signed, Sealed, Delivered, the Aurora Teagarden Mysteries and The Good Witch, as well having produced mystery-themed wheel series.
The Hallmark Channel achieved its highest-ever broadcast premiere ratings with the 2014 original movie Christmas Under Wraps, starring Candace Cameron Bure, which was watched by 5.8 million viewers. Both networks receive their highest ratings during their "Countdown to Christmas" period, with a succession of festive original films being broadcast from late October to late December.
A number of these films are also carried in Canada by the W Network and Citytv under content distribution agreements with Hallmark parent Crown Media; the vast majority of Hallmark Channel films are filmed in Canada and thus qualify for Canadian content quotas. In the United Kingdom, Hallmark Original Movies are shown on Movies 24, a sister channel.
Umbrella series
The channels have broadcast a number of umbrella or 'wheel series', featuring premieres of original films.
* Hallmark Hall of Fame originally premiered back in 1951 on NBC, but its movies began to be shown exclusively on Hallmark Channel starting on November 30, 2014 with the release of One Christmas Eve.
Seasonal programming
The channels also produce annual seasonal programming blocks, which include premieres of original films.
* Formerly known as The Most Wonderful Movies of Christmas and The Most Wonderful Miracles of Christmas.
† Formerly known as Countdown to Valentine's Day and Love Ever After.
‡ Formerly known as Spring Fever and Spring Fling.
# Formerly known as Winterfest.
✤ Formerly known as Fall Harvest.
Film series
Some Hallmark films are a part of a larger film series. Below is an alphabetically-sorted list of all film series and the number of films in each.
(HD) Hallmark Drama is a sister channel to HC and HMM.
* Film added to wheel series after an original stand-alone film.
† Jesse Stone films premiere on HC, but are repeated on, and considered to be a key franchise for, HMM.
+ Also TV series.
Hallmark Entertainment
Some of the movies do not fall under any of the aforementioned groups. The following list consists of television films and miniseries produced for or by Hallmark Entertainment that did not premiere on either Hallmark Channel, its sister channels, or as part of the Hallmark Hall of Fame anthology series.
Hallmark Channel Original Movies (2000–2015)
2016
Hallmark Channel
(W) Winterfest, (CtVD) Countdown to Valentine's Day, (SF) Spring Fling, (JW) June Weddings, (SN) Summer Nights, (FH) Fall Harvest, and (CtC) Countdown to Christmas are seasonal programming blocks.
Hallmark Movies & Mysteries
2017
Hallmark Channel
(W) Winterfest, (CtVD) Countdown to Valentine's Day, (SF) Spring Fling, (JW) June Weddings, (SN) Summer Nights, (FH) Fall Harvest, and (CtC) Countdown to Christmas are seasonal programming blocks.
Simultaneous premiere on HC and HMM.
Hallmark Movies & Mysteries
2018
Hallmark Channel
(W) Winterfest, (CtVD) Countdown to Valentine's Day, (SF) Spring Fever, (JW) June Weddings, (SN) Summer Nights, (FH) Fall Harvest, and (CtC) Countdown to Christmas are seasonal programming blocks.
Hallmark Movies & Mysteries
(MoC) Miracles of Christmas is a seasonal programming block.
2019
Hallmark Channel
(W) Winterfest, (CtVD) Countdown to Valentine's Day, (SF) Spring Fever, (CtS) Countdown to Summer, (JW) June Weddings, (SN) Summer Nights, (FH) Fall Harvest, and (CtC) Countdown to Christmas are seasonal programming blocks.
Hallmark Movies & Mysteries
(MoC) Miracles of Christmas is a seasonal programming block.
Simultaneous premiere on HC and HMM.
† Part of Gold Crown Christmas Week: Christmas in July.
2020
Hallmark Channel
(W) Winterfest, (LEA) Love Ever After, (SF) Spring Fling, (ALR) A Little Romance, (SN) Summer Nights, (FH) Fall Harvest, and (CtC) Countdown to Christmas are seasonal programming blocks.
Hallmark Movies & Mysteries
(MoC) Miracles of Christmas is a seasonal programming block.
Simultaneous premiere on HC and HMM.
2021
Hallmark Channel
(NYNM) New Year New Movies!, (LEA) Love Ever After, (SF) Spring Fling, (SN) Summer Nights, (FH) Fall Harvest, and (CtC) Countdown to Christmas are seasonal programming blocks.
† Part of Christmas in July.
Hallmark Movies & Mysteries
(MoC) Miracles of Christmas is a seasonal programming block.
Hallmark Movies Now
2022
Hallmark Channel
(NYNM) New Year New Movies!, (L) Loveuary, (SiL) Spring into Love, (SN) Summer Nights, (CiJ) Christmas in July, (FiL) Fall into Love, and (CtC) Countdown to Christmas are seasonal programming blocks.
Hallmark Movies & Mysteries
(HM) Hallmark Mahogany are films under Hallmark's Mahogany banner. (HD) Hallmark DaySpring are films under Hallmark's DaySpring banner. (MoC) Miracles of Christmas is a seasonal programming block.
2023
Hallmark Channel
{|class="wikitable sortable"
|-
! scope="col" class="unsortable"|Movie
! scope="col" class="unsortable" |Starring
! scope="col" class="unsortable"|Director
! scope="col" class="unsortable"|Original airdate
! scope="col"|Viewers
! scope="col" class="unsortable"|Ref
! scope="col" class="unsortable"|DVD
|-
|The Dog Lover's Guide to Dating (NYNM)
|Rebecca Dalton and Corey Sevier
|Craig Pryce
|January 1, 2023
|1.68
|
|
|-
|The Wedding Veil Expectations (NYNM)
|Lacey Chabert and Kevin McGarry
|Peter Benson
|January 7, 2023
|2.48
|
|
|-
|The Wedding Veil Inspiration (NYNM)
|Autumn Reeser and Paolo Bernardini
|Terry Ingram
|January 14, 2023
|2.28
|
|
|-
|The Wedding Veil Journey (NYNM)
|Alison Sweeney and Victor Webster
|Ron Oliver
|January 21, 2023
|2.29
|
|
|-
|Love in Glacier National: A National Park Romance (NYNM)
|Ashley Newbrough and Stephen Huszar
|Christie Will
|January 28, 2023
|1.98
|
|
|-
|Sweeter Than Chocolate (L)
|Eloise Mumford and Dan Jeannotte
|David Weaver
|February 4, 2023
|2.06
|
|
|-
|A Paris Proposal (L)
|Alexa PenaVega and Nicholas Bishop
|Jessica Harmon
|February 11, 2023
|1.88
|
|
|-
|Welcome to Valentine (L)
|Kathryn Davis and Markian Tarasiuk
|Stefan Brogren
|February 18, 2023
|1.85
|
|
|-
|Made for Each Other (L)
|Alexandra Turshen and Matt Cohen
|Jeff Beesley
|February 25, 2023
|1.62
|
|
|-
|Game of Love
|Kimberley Sustad and Brooks Darnell
|Jason Bourque
|March 11, 2023
|1.47
|
|
|-
|A Winning Team
|Nadia Hatta and Kristoffer Polaha
|Jason Furukawa
|March 18, 2023
|1.38
|
|
|-
|A Picture of Her (SiL)
|Rhiannon Fish and Tyler Hynes
|Michael Robison
|March 25, 2023
|1.73
|
|
|-
|Love in the Maldives (SiL)
|Jocelyn Hudon and Jake Manley
|Colin Theys
|April 1, 2023
|1.38
|
|
|-
|The Professional Bridesmaid (SiL)
|Hunter King and Chandler Massey
|Peter Benson
|April 8, 2023
|1.40
|
|
|-
|The Wedding Cottage (SiL)
|Erin Krakow and Brendan Penny
|Terry Ingram
|April 15, 2023
|1.98
|
|
|-
|A Pinch of Portugal (SiL)
|Heather Hemmens and Luke Mitchell
|Clare Niederpruem
|April 22, 2023
|1.59
|
|
|-
|Hearts in the Game (SiL)
|Erin Cahill and Marco Grazzini
|Stacey N. Harding
|April 29, 2023
|1.54
|
|
|-
|When Love Springs (SiL)
|Rhiannon Fish and James O’Halloran
|Jo-Anne Brechin
|May 6, 2023
|1.38
|
|
|-
|Dream Moms
|Tamera Mowry-Housley and Chelsea Hobbs
|Jessica Harmon
|May 13, 2023
|1.18
|
|
|-
|Love in Zion National: A National Park Romance
|Cindy Busby and David Gridley
|Sam Irvin
|May 20, 2023
|1.51
|
|
|-
|Wedding Season (JW)
|Stephanie Bennett and Casey Deidrick
|David Weaver
|June 3, 2023
|1.34
|
|
|-
|Love's Greek to Me (JW)
|Torrey DeVitto and Yannis Tsimitselis
|Michael Robison
|June 10, 2023
|1.57
|
|
|-
|The Wedding Contract (JW)
|Becca Tobin and Jake Epstein
|Peter DeLuise
|June 17, 2023
|1.40
|
|
|-
|Make Me a Match (JW)
|Rushi Kota and Eva Bourne
|Heather Hawthorn Doyle
|June 24, 2023
|1.23
|
|
|-
|A Royal Christmas Crush (CiJ)
|Katie Cassidy and Stephen Huszar
|Marita Jane Grabiak
|July 8, 2023
|1.56
|
|
|-
|Take Me Back for Christmas (CiJ)
|Vanessa Lengies and Corey Sevier
|Corey Sevier
|July 15, 2023
|1.39
|
|
|-
|Aloha Heart (SN)
|Taylor Cole and Kanoa Goo
|Seth Jarrett
|July 29, 2023
|1.46
|
|
|-
|Making Waves (SN)
|Holland Roden and Corey Cott
|Terry Ingram
|August 5, 2023
|1.45
|
|
|-
|A Safari Romance (SN)
|Andrew Walker and Brittany Bristow
|Leif Bristow
|August 12, 2023
|1.50
|
|
|-
|Never Too Late to Celebrate (SN)
|Alexa PenaVega and Carlos PenaVega
|Felipe Rodriguez
|August 19, 2023
|1.37
|
|
|-
|Napa Ever After (SN) (HM)
|Denise Boutté and Colin Lawrence
|Alfons Adetuyi
|August 26, 2023
|1.09
|
|
|-
|Love in the Great Smoky Mountains: A National Park Romance (FiL)
|Arielle Kebbel and Zach Roerig
|Danny J. Boyle
|September 2, 2023
|1.49
|
|
|-
|Fourth Down and Love (FiL)
|Pascale Hutton and Ryan Paevey
|Allan Harmon
|September 9, 2023
|1.58
|
|
|-
|Notes of Autumn (FiL)
|Ashley Williams and Luke Macfarlane
|Troy Scott
|September 16, 2023
|1.49
|
|
|-
|Retreat to You (FiL)
|Emilie Ullerup and Peter Mooney
|Terry Ingram
|September 23, 2023
|1.43
|
|
|-
|A Very Venice Romance (FiL)
|Stephanie Leonidas and Raniero Monaco Di Lapio
|Liz Farrer
|September 30, 2023
|1.23
|
|
|-
|3 Bed, 2 Bath, 1 Ghost (FiL)
|Julie Gonzalo and Chris McNally
|Kevin Fair
|October 7, 2023
|2.25
|
|
|-
|Field Day (FiL)
|Rachel Boston and Benjamin Ayres
|David Winning
|October 14, 2023
|1.53
|
|
|-
|Checkin' it Twice (CtC)
|Kim Matula and Kevin McGarry
|Kevin Fair
|October 20, 2023
|1.66
|
|
|-
|Where Are You, Christmas? (CtC)
|Lyndsy Fonseca and Michael Rady
|Dustin Rikert
|October 21, 2023
|1.78
|
|
|-
|Under the Christmas Sky (CtC)
|Jessica Parker Kennedy and Ryan Paevey
|Seán Geraughty
|October 22, 2023
|1.53
|
|
|-
|Christmas by Design (CtC)
|Rebecca Dalton and Jonathan Keltz
|Max McGuire
|October 27, 2023
|1.31
|
|
|-
|Mystic Christmas (CtC)
|Jessy Schram and Chandler Massey
|Marlo Hunter
|October 28, 2023
|1.72
|
|
|-
|Joyeux Noel (CtC)
|Jaicy Elliot and Brant Daugherty
|Jessica Harmon
|October 29, 2023
|1.74
|
|
|-
|Flipping for Christmas (CtC)
|Ashley Newbrough and Marcus Rosner
|Katherine Barrell
|November 3, 2023
|
|
|
|-
|Never Been Chris'd (CtC)
|Janel Parrish, Pascal Lamothe-Kipnes, and Tyler Hynes
|Jeff Beesley
|November 4, 2023
|
|
|
|-
|The Santa Summit (CtC)
|Hunter King and Benjamin Hollingsworth
|Jeff Beesley
|November 5, 2023
|
|
|
|-
|Everything Christmas (CtC)
|Cindy Busby and Corey Sevier
|Marni Banack
|November 10, 2023
|
|
|
|-
|Christmas Island (CtC)
|Rachel Skarsten and Andrew Walker
|David Weaver
|November 11, 2023
|
|
|
|-
|A Heidelberg Holiday (CtC)
|Ginna Claire Mason and Frédéric Brossier
|Maclain Nelson
|November 12, 2023
|
|
|
|-
|Navigating Christmas (CtC)
|Chelsea Hobbs and Stephen Huszar
|Peter Benson
|November 17, 2023
|
|
|
|-
|A Merry Scottish Christmas (CtC)
|Lacey Chabert and Scott Wolf
|Dustin Rikert
|November 18, 2023
|
|
|
|-
|Holiday Hotline (CtC)
|Emily Tennant and Niall Matter
|Mark Jean
|November 19, 2023
|
|
|
|-
|Catch Me If You Claus (CtC)
|Italia Ricci and Luke Macfarlane
|Bradley Walsh
|November 23, 2023
|
|
|
|-
|Letters to Santa (CtC)
|Katie Leclerc and Rafael de la Fuente
|John Stimpson
|November 24, 2023
|
|
|
|-
|Holiday Road (CtC)
|Sara Canning and Warren Christie
|Martin Wood
|November 24, 2023
|
|
|
|-
|Christmas in Notting Hill (CtC)
|Sarah Ramos and William Moseley
|Ali Liebert
|November 25, 2023
|
|
|
|-
|Haul Out the Holly: Lit Up (CtC)
|Lacey Chabert and Wes Brown
|Maclain Nelson
|November 25, 2023
|
|
|
|-
|Our Christmas Mural (CtC)
|Alex Paxton-Beesley and Dan Jeannotte
|
|November 26, 2023
|
|
|
|-
|A Biltmore Christmas (CtC)
|Bethany Joy Lenz and Kristoffer Polaha
|John Putch
|November 26, 2023
|
|
|
|-
|My Norwegian Holiday (CtC)
|Rhiannon Fish and David Elsendoorn
|David Mackay
|December 1, 2023
|
|
|
|-
|A Not So Royal Christmas (CtC)
|Brooke D'Orsay and Will Kemp
|Jonathan Wright
|December 2, 2023
|
|
|
|-
|Christmas with a Kiss (CtC) (HM)
|Mishael Morgan and Ronnie Rowe Jr.
|Roger Bobb
|December 3, 2023
|
|
|
|-
|Magic in Mistletoe (CtC)
|Lyndie Greenwood and Paul Campbell
|Paula Elle
|December 8, 2023
|
|
|
|-
|Christmas on Cherry Lane (CtC)
|Erin Cahill and John Brotherton
|Gail Harvey
|December 9, 2023
|
|
|
|-
|Round and Round (CtC)
|Vic Michaelis and Bryan Greenberg
|Stacey N. Harding
|December 10, 2023
|
|
|
|-
|The Secret Gift of Christmas (CtC)
|Meghan Ory and Christopher Russell
|Christie Will Wolf
|December 15, 2023
|
|
|
|-
|Sealed with a List (CtC)
|Katie Findlay and Evan Roderick
|Lucie Guest
|December 16, 2023
|
|
|
|-
|Friends & Family Christmas (CtC)
|Humberly Gonzalez and Ali Liebert
|Anne Wheeler
|December 17, 2023
|
|
|
|}
(NYNM) New Year New Movies!, (L) Loveuary, (SiL) Spring into Love, (JW) June Weddings, (CiJ) Christmas in July, (SN) Summer Nights, (FiL) Fall into Love, and (CtC) Countdown to Christmas are seasonal programming blocks.
(HM) Hallmark Mahogany are films under Hallmark's Mahogany banner.
Hallmark Movies & Mysteries
(HM) Hallmark Mahogany are films under Hallmark's Mahogany banner. (HD) Hallmark DaySpring are films under Hallmark's DaySpring banner. (MoC) Miracles of Christmas is a seasonal programming block.
Hallmark Movies Now
Announced or In Development31 Second ChancesBetty's Bad Luck in LoveMy Week in Wyoming''
Highest-rated premieres
Hallmark Channel
Top 10 Christmas premieres
Within a calendar year
Hallmark Movies & Mysteries
Top 10 Christmas premieres
Within a calendar year
See also
List of Hallmark Hall of Fame episodes (and Category)
List of programs broadcast by Hallmark Channel (and Category)
References
External links
Official websites
Hallmark Channel
Hallmark Movies & Mysteries
Hallmark Drama
Hallmark Movies Now
Crown Media Family Networks (parent company)
Crown Media Press
Other
Hallmark Channel on IMDbPro
Hallmark Entertainment on IMDbPro
Hallmark
|
```javascript
$(function () {
new Vue({
el: '#app',
data: {
page: 1,
limit: 15,
count: 0,
items: []
},
mounted: function () {
this.load();
},
methods: {
load: function () {
let that = this;
let pagedQuery = getPagedQuery();
http.get(`/api/v1.0/agents?${pagedQuery}`, function (result) {
that.page = result.data.page;
that.limit = result.data.limit;
that.count = result.data.count;
that.items = [];
result.data.data.forEach(x => {
that.items.push(x);
});
});
},
exit: function (event) {
swal({
title: "Sure to stop this agent?",
type: "warning",
showCancelButton: true
}, function () {
let id = $(event.toElement).parent().parent().parent().attr('id');
debugger
http.put('/api/v1.0/agents/' + id + '/exit', null, function () {
swal('Success', 'Send signal success', "success");
}, function () {
swal('Error', 'Stop agent failed', "error");
});
});
},
remove: function (event) {
const that = this;
swal({
title: "Sure to remove this agent?",
type: "warning",
showCancelButton: true
}, function () {
let id = $(event.toElement).parent().parent().parent().attr('id');
debugger
http.delete('/api/v1.0/agents/' + id, function () {
that.load();
}, function () {
swal('Error', 'Remove agent failed', "error");
});
});
}
}
});
});
```
|
```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.
#include <string>
#include "source/opt/scalar_replacement_pass.h"
#include "test/opt/assembly_builder.h"
#include "test/opt/pass_fixture.h"
#include "test/opt/pass_utils.h"
namespace spvtools {
namespace opt {
namespace {
using ScalarReplacementPassName = ::testing::Test;
TEST_F(ScalarReplacementPassName, Default) {
auto srp = ScalarReplacementPass();
EXPECT_STREQ(srp.name(), "scalar-replacement=100");
}
TEST_F(ScalarReplacementPassName, Large) {
auto srp = ScalarReplacementPass(0xffffffffu);
EXPECT_STREQ(srp.name(), "scalar-replacement=4294967295");
}
using ScalarReplacementTest = PassTest<::testing::Test>;
TEST_F(ScalarReplacementTest, SimpleStruct) {
const std::string text = R"(
;
; CHECK: [[struct:%\w+]] = OpTypeStruct [[elem:%\w+]]
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: [[elem_ptr:%\w+]] = OpTypePointer Function [[elem]]
; CHECK: OpConstantNull [[struct]]
; CHECK: [[null:%\w+]] = OpConstantNull [[elem]]
; CHECK-NOT: OpVariable [[struct_ptr]]
; CHECK: [[one:%\w+]] = OpVariable [[elem_ptr]] Function [[null]]
; CHECK-NEXT: [[two:%\w+]] = OpVariable [[elem_ptr]] Function [[null]]
; CHECK-NOT: OpVariable [[elem_ptr]] Function [[null]]
; CHECK-NOT: OpVariable [[struct_ptr]]
; CHECK-NOT: OpInBoundsAccessChain
; CHECK: [[l1:%\w+]] = OpLoad [[elem]] [[two]]
; CHECK-NOT: OpAccessChain
; CHECK: [[l2:%\w+]] = OpLoad [[elem]] [[one]]
; CHECK: OpIAdd [[elem]] [[l1]] [[l2]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %6 "simple_struct"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%3 = OpTypeStruct %2 %2 %2 %2
%4 = OpTypePointer Function %3
%5 = OpTypePointer Function %2
%6 = OpTypeFunction %2
%7 = OpConstantNull %3
%8 = OpConstant %2 0
%9 = OpConstant %2 1
%10 = OpConstant %2 2
%11 = OpConstant %2 3
%12 = OpFunction %2 None %6
%13 = OpLabel
%14 = OpVariable %4 Function %7
%15 = OpInBoundsAccessChain %5 %14 %8
%16 = OpLoad %2 %15
%17 = OpAccessChain %5 %14 %10
%18 = OpLoad %2 %17
%19 = OpIAdd %2 %16 %18
OpReturnValue %19
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, StructInitialization) {
const std::string text = R"(
;
; CHECK: [[elem:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct:%\w+]] = OpTypeStruct [[elem]] [[elem]] [[elem]] [[elem]]
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: [[elem_ptr:%\w+]] = OpTypePointer Function [[elem]]
; CHECK: [[zero:%\w+]] = OpConstant [[elem]] 0
; CHECK: [[undef:%\w+]] = OpUndef [[elem]]
; CHECK: [[two:%\w+]] = OpConstant [[elem]] 2
; CHECK: [[null:%\w+]] = OpConstantNull [[elem]]
; CHECK-NOT: OpVariable [[struct_ptr]]
; CHECK: OpVariable [[elem_ptr]] Function [[null]]
; CHECK-NEXT: OpVariable [[elem_ptr]] Function [[two]]
; CHECK-NOT: OpVariable [[elem_ptr]] Function [[undef]]
; CHECK-NEXT: OpVariable [[elem_ptr]] Function
; CHECK-NEXT: OpVariable [[elem_ptr]] Function [[zero]]
; CHECK-NOT: OpVariable [[elem_ptr]] Function [[undef]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %6 "struct_init"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%3 = OpTypeStruct %2 %2 %2 %2
%4 = OpTypePointer Function %3
%20 = OpTypePointer Function %2
%6 = OpTypeFunction %1
%7 = OpConstant %2 0
%8 = OpUndef %2
%9 = OpConstant %2 2
%30 = OpConstant %2 1
%31 = OpConstant %2 3
%10 = OpConstantNull %2
%11 = OpConstantComposite %3 %7 %8 %9 %10
%12 = OpFunction %1 None %6
%13 = OpLabel
%14 = OpVariable %4 Function %11
%15 = OpAccessChain %20 %14 %7
OpStore %15 %10
%16 = OpAccessChain %20 %14 %9
OpStore %16 %10
%17 = OpAccessChain %20 %14 %30
OpStore %17 %10
%18 = OpAccessChain %20 %14 %31
OpStore %18 %10
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, SpecConstantInitialization) {
const std::string text = R"(
;
; CHECK: [[int:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct:%\w+]] = OpTypeStruct [[int]] [[int]]
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: [[int_ptr:%\w+]] = OpTypePointer Function [[int]]
; CHECK: [[spec_comp:%\w+]] = OpSpecConstantComposite [[struct]]
; CHECK: [[ex0:%\w+]] = OpSpecConstantOp [[int]] CompositeExtract [[spec_comp]] 0
; CHECK: [[ex1:%\w+]] = OpSpecConstantOp [[int]] CompositeExtract [[spec_comp]] 1
; CHECK-NOT: OpVariable [[struct]]
; CHECK: OpVariable [[int_ptr]] Function [[ex1]]
; CHECK-NEXT: OpVariable [[int_ptr]] Function [[ex0]]
; CHECK-NOT: OpVariable [[struct]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %6 "spec_const"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%3 = OpTypeStruct %2 %2
%4 = OpTypePointer Function %3
%20 = OpTypePointer Function %2
%5 = OpTypeFunction %1
%6 = OpConstant %2 0
%30 = OpConstant %2 1
%7 = OpSpecConstant %2 0
%8 = OpSpecConstantOp %2 IAdd %7 %7
%9 = OpSpecConstantComposite %3 %7 %8
%10 = OpFunction %1 None %5
%11 = OpLabel
%12 = OpVariable %4 Function %9
%13 = OpAccessChain %20 %12 %6
%14 = OpLoad %2 %13
%15 = OpAccessChain %20 %12 %30
%16 = OpLoad %2 %15
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
// TODO(alanbaker): Re-enable when vector and matrix scalarization is supported.
// TEST_F(ScalarReplacementTest, VectorInitialization) {
// const std::string text = R"(
// ;
// ; CHECK: [[elem:%\w+]] = OpTypeInt 32 0
// ; CHECK: [[vector:%\w+]] = OpTypeVector [[elem]] 4
// ; CHECK: [[vector_ptr:%\w+]] = OpTypePointer Function [[vector]]
// ; CHECK: [[elem_ptr:%\w+]] = OpTypePointer Function [[elem]]
// ; CHECK: [[zero:%\w+]] = OpConstant [[elem]] 0
// ; CHECK: [[undef:%\w+]] = OpUndef [[elem]]
// ; CHECK: [[two:%\w+]] = OpConstant [[elem]] 2
// ; CHECK: [[null:%\w+]] = OpConstantNull [[elem]]
// ; CHECK-NOT: OpVariable [[vector_ptr]]
// ; CHECK: OpVariable [[elem_ptr]] Function [[zero]]
// ; CHECK-NOT: OpVariable [[elem_ptr]] Function [[undef]]
// ; CHECK-NEXT: OpVariable [[elem_ptr]] Function
// ; CHECK-NEXT: OpVariable [[elem_ptr]] Function [[two]]
// ; CHECK-NEXT: OpVariable [[elem_ptr]] Function [[null]]
// ; CHECK-NOT: OpVariable [[elem_ptr]] Function [[undef]]
// ;
// OpCapability Shader
// OpCapability Linkage
// OpMemoryModel Logical GLSL450
// OpName %6 "vector_init"
// %1 = OpTypeVoid
// %2 = OpTypeInt 32 0
// %3 = OpTypeVector %2 4
// %4 = OpTypePointer Function %3
// %20 = OpTypePointer Function %2
// %6 = OpTypeFunction %1
// %7 = OpConstant %2 0
// %8 = OpUndef %2
// %9 = OpConstant %2 2
// %30 = OpConstant %2 1
// %31 = OpConstant %2 3
// %10 = OpConstantNull %2
// %11 = OpConstantComposite %3 %10 %9 %8 %7
// %12 = OpFunction %1 None %6
// %13 = OpLabel
// %14 = OpVariable %4 Function %11
// %15 = OpAccessChain %20 %14 %7
// OpStore %15 %10
// %16 = OpAccessChain %20 %14 %9
// OpStore %16 %10
// %17 = OpAccessChain %20 %14 %30
// OpStore %17 %10
// %18 = OpAccessChain %20 %14 %31
// OpStore %18 %10
// OpReturn
// OpFunctionEnd
// )";
//
// SinglePassRunAndMatch<opt::ScalarReplacementPass>(text, true);
// }
//
// TEST_F(ScalarReplacementTest, MatrixInitialization) {
// const std::string text = R"(
// ;
// ; CHECK: [[float:%\w+]] = OpTypeFloat 32
// ; CHECK: [[vector:%\w+]] = OpTypeVector [[float]] 2
// ; CHECK: [[matrix:%\w+]] = OpTypeMatrix [[vector]] 2
// ; CHECK: [[matrix_ptr:%\w+]] = OpTypePointer Function [[matrix]]
// ; CHECK: [[float_ptr:%\w+]] = OpTypePointer Function [[float]]
// ; CHECK: [[vec_ptr:%\w+]] = OpTypePointer Function [[vector]]
// ; CHECK: [[zerof:%\w+]] = OpConstant [[float]] 0
// ; CHECK: [[onef:%\w+]] = OpConstant [[float]] 1
// ; CHECK: [[one_zero:%\w+]] = OpConstantComposite [[vector]] [[onef]]
// [[zerof]] ; CHECK: [[zero_one:%\w+]] = OpConstantComposite [[vector]]
// [[zerof]] [[onef]] ; CHECK: [[const_mat:%\w+]] = OpConstantComposite
// [[matrix]] [[one_zero]]
// [[zero_one]] ; CHECK-NOT: OpVariable [[matrix]] ; CHECK-NOT: OpVariable
// [[vector]] Function [[one_zero]] ; CHECK: [[f1:%\w+]] = OpVariable
// [[float_ptr]] Function [[zerof]] ; CHECK-NEXT: [[f2:%\w+]] = OpVariable
// [[float_ptr]] Function [[onef]] ; CHECK-NEXT: [[vec_var:%\w+]] = OpVariable
// [[vec_ptr]] Function [[zero_one]] ; CHECK-NOT: OpVariable [[matrix]] ;
// CHECK-NOT: OpVariable [[vector]] Function [[one_zero]]
// ;
// OpCapability Shader
// OpCapability Linkage
// OpMemoryModel Logical GLSL450
// OpName %7 "matrix_init"
// %1 = OpTypeVoid
// %2 = OpTypeFloat 32
// %3 = OpTypeVector %2 2
// %4 = OpTypeMatrix %3 2
// %5 = OpTypePointer Function %4
// %6 = OpTypePointer Function %2
// %30 = OpTypePointer Function %3
// %10 = OpTypeInt 32 0
// %7 = OpTypeFunction %1 %10
// %8 = OpConstant %2 0.0
// %9 = OpConstant %2 1.0
// %11 = OpConstant %10 0
// %12 = OpConstant %10 1
// %13 = OpConstantComposite %3 %9 %8
// %14 = OpConstantComposite %3 %8 %9
// %15 = OpConstantComposite %4 %13 %14
// %16 = OpFunction %1 None %7
// %31 = OpFunctionParameter %10
// %17 = OpLabel
// %18 = OpVariable %5 Function %15
// %19 = OpAccessChain %6 %18 %11 %12
// OpStore %19 %8
// %20 = OpAccessChain %6 %18 %11 %11
// OpStore %20 %8
// %21 = OpAccessChain %30 %18 %12
// OpStore %21 %14
// OpReturn
// OpFunctionEnd
// )";
//
// SinglePassRunAndMatch<opt::ScalarReplacementPass>(text, true);
// }
TEST_F(ScalarReplacementTest, ElideAccessChain) {
const std::string text = R"(
;
; CHECK: [[var:%\w+]] = OpVariable
; CHECK-NOT: OpAccessChain
; CHECK: OpStore [[var]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %6 "elide_access_chain"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%3 = OpTypeStruct %2 %2 %2 %2
%4 = OpTypePointer Function %3
%20 = OpTypePointer Function %2
%6 = OpTypeFunction %1
%7 = OpConstant %2 0
%8 = OpUndef %2
%9 = OpConstant %2 2
%10 = OpConstantNull %2
%11 = OpConstantComposite %3 %7 %8 %9 %10
%12 = OpFunction %1 None %6
%13 = OpLabel
%14 = OpVariable %4 Function %11
%15 = OpAccessChain %20 %14 %7
OpStore %15 %10
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ElideMultipleAccessChains) {
const std::string text = R"(
;
; CHECK: [[var:%\w+]] = OpVariable
; CHECK-NOT: OpInBoundsAccessChain
; CHECK OpStore [[var]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %6 "elide_two_access_chains"
%1 = OpTypeVoid
%2 = OpTypeFloat 32
%3 = OpTypeStruct %2 %2
%4 = OpTypeStruct %3 %3
%5 = OpTypePointer Function %4
%6 = OpTypePointer Function %2
%7 = OpTypeFunction %1
%8 = OpConstant %2 0.0
%9 = OpConstant %2 1.0
%10 = OpTypeInt 32 0
%11 = OpConstant %10 0
%12 = OpConstant %10 1
%13 = OpConstantComposite %3 %9 %8
%14 = OpConstantComposite %3 %8 %9
%15 = OpConstantComposite %4 %13 %14
%16 = OpFunction %1 None %7
%17 = OpLabel
%18 = OpVariable %5 Function %15
%19 = OpInBoundsAccessChain %6 %18 %11 %12
OpStore %19 %8
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ReplaceAccessChain) {
const std::string text = R"(
;
; CHECK: [[param:%\w+]] = OpFunctionParameter
; CHECK: [[var:%\w+]] = OpVariable
; CHECK: [[access:%\w+]] = OpAccessChain {{%\w+}} [[var]] [[param]]
; CHECK: OpStore [[access]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %7 "replace_access_chain"
%1 = OpTypeVoid
%2 = OpTypeFloat 32
%10 = OpTypeInt 32 0
%uint_2 = OpConstant %10 2
%3 = OpTypeArray %2 %uint_2
%4 = OpTypeStruct %3 %3
%5 = OpTypePointer Function %4
%20 = OpTypePointer Function %3
%6 = OpTypePointer Function %2
%7 = OpTypeFunction %1 %10
%8 = OpConstant %2 0.0
%9 = OpConstant %2 1.0
%11 = OpConstant %10 0
%12 = OpConstant %10 1
%13 = OpConstantComposite %3 %9 %8
%14 = OpConstantComposite %3 %8 %9
%15 = OpConstantComposite %4 %13 %14
%16 = OpFunction %1 None %7
%32 = OpFunctionParameter %10
%17 = OpLabel
%18 = OpVariable %5 Function %15
%19 = OpAccessChain %6 %18 %11 %32
OpStore %19 %8
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ArrayInitialization) {
const std::string text = R"(
;
; CHECK: [[float:%\w+]] = OpTypeFloat 32
; CHECK: [[array:%\w+]] = OpTypeArray
; CHECK: [[array_ptr:%\w+]] = OpTypePointer Function [[array]]
; CHECK: [[float_ptr:%\w+]] = OpTypePointer Function [[float]]
; CHECK: [[float0:%\w+]] = OpConstant [[float]] 0
; CHECK: [[float1:%\w+]] = OpConstant [[float]] 1
; CHECK: [[float2:%\w+]] = OpConstant [[float]] 2
; CHECK-NOT: OpVariable [[array_ptr]]
; CHECK: [[var0:%\w+]] = OpVariable [[float_ptr]] Function [[float0]]
; CHECK-NEXT: [[var1:%\w+]] = OpVariable [[float_ptr]] Function [[float1]]
; CHECK-NEXT: [[var2:%\w+]] = OpVariable [[float_ptr]] Function [[float2]]
; CHECK-NOT: OpVariable [[array_ptr]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "array_init"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%float = OpTypeFloat 32
%uint_0 = OpConstant %uint 0
%uint_1 = OpConstant %uint 1
%uint_2 = OpConstant %uint 2
%uint_3 = OpConstant %uint 3
%float_array = OpTypeArray %float %uint_3
%array_ptr = OpTypePointer Function %float_array
%float_ptr = OpTypePointer Function %float
%float_0 = OpConstant %float 0
%float_1 = OpConstant %float 1
%float_2 = OpConstant %float 2
%const_array = OpConstantComposite %float_array %float_2 %float_1 %float_0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%3 = OpVariable %array_ptr Function %const_array
%4 = OpInBoundsAccessChain %float_ptr %3 %uint_0
OpStore %4 %float_0
%5 = OpInBoundsAccessChain %float_ptr %3 %uint_1
OpStore %5 %float_0
%6 = OpInBoundsAccessChain %float_ptr %3 %uint_2
OpStore %6 %float_0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, NonUniformCompositeInitialization) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[long:%\w+]] = OpTypeInt 64 1
; CHECK: [[dvector:%\w+]] = OpTypeVector
; CHECK: [[vector:%\w+]] = OpTypeVector
; CHECK: [[array:%\w+]] = OpTypeArray
; CHECK: [[matrix:%\w+]] = OpTypeMatrix
; CHECK: [[struct1:%\w+]] = OpTypeStruct [[uint]] [[vector]]
; CHECK: [[struct2:%\w+]] = OpTypeStruct [[struct1]] [[matrix]] [[array]] [[uint]]
; CHECK: [[struct1_ptr:%\w+]] = OpTypePointer Function [[struct1]]
; CHECK: [[matrix_ptr:%\w+]] = OpTypePointer Function [[matrix]]
; CHECK: [[array_ptr:%\w+]] = OpTypePointer Function [[array]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[struct2_ptr:%\w+]] = OpTypePointer Function [[struct2]]
; CHECK: [[const_array:%\w+]] = OpConstantComposite [[array]]
; CHECK: [[const_matrix:%\w+]] = OpConstantNull [[matrix]]
; CHECK: [[const_struct1:%\w+]] = OpConstantComposite [[struct1]]
; CHECK: OpUndef [[uint]]
; CHECK: OpUndef [[vector]]
; CHECK: OpUndef [[long]]
; CHECK: OpFunction
; CHECK-NOT: OpVariable [[struct2_ptr]] Function
; CHECK: OpVariable [[uint_ptr]] Function
; CHECK-NEXT: OpVariable [[matrix_ptr]] Function [[const_matrix]]
; CHECK-NOT: OpVariable [[struct1_ptr]] Function [[const_struct1]]
; CHECK-NOT: OpVariable [[struct2_ptr]] Function
;
OpCapability Shader
OpCapability Linkage
OpCapability Int64
OpCapability Float64
OpMemoryModel Logical GLSL450
OpName %func "non_uniform_composite_init"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%int64 = OpTypeInt 64 1
%float = OpTypeFloat 32
%double = OpTypeFloat 64
%double2 = OpTypeVector %double 2
%float4 = OpTypeVector %float 4
%int64_0 = OpConstant %int64 0
%int64_1 = OpConstant %int64 1
%int64_2 = OpConstant %int64 2
%int64_3 = OpConstant %int64 3
%int64_array3 = OpTypeArray %int64 %int64_3
%matrix_double2 = OpTypeMatrix %double2 2
%struct1 = OpTypeStruct %uint %float4
%struct2 = OpTypeStruct %struct1 %matrix_double2 %int64_array3 %uint
%struct1_ptr = OpTypePointer Function %struct1
%matrix_double2_ptr = OpTypePointer Function %matrix_double2
%int64_array_ptr = OpTypePointer Function %int64_array3
%uint_ptr = OpTypePointer Function %uint
%struct2_ptr = OpTypePointer Function %struct2
%const_uint = OpConstant %uint 0
%const_int64_array = OpConstantComposite %int64_array3 %int64_0 %int64_1 %int64_2
%const_double2 = OpConstantNull %double2
%const_matrix_double2 = OpConstantNull %matrix_double2
%undef_float4 = OpUndef %float4
%const_struct1 = OpConstantComposite %struct1 %const_uint %undef_float4
%const_struct2 = OpConstantComposite %struct2 %const_struct1 %const_matrix_double2 %const_int64_array %const_uint
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct2_ptr Function %const_struct2
%3 = OpAccessChain %struct1_ptr %var %int64_0
OpStore %3 %const_struct1
%4 = OpAccessChain %matrix_double2_ptr %var %int64_1
OpStore %4 %const_matrix_double2
%5 = OpAccessChain %int64_array_ptr %var %int64_2
OpStore %5 %const_int64_array
%6 = OpAccessChain %uint_ptr %var %int64_3
OpStore %6 %const_uint
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ElideUncombinedAccessChains) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[const:%\w+]] = OpConstant [[uint]] 0
; CHECK: [[var:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK-NOT: OpAccessChain
; CHECK: OpStore [[var]] [[const]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "elide_uncombined_access_chains"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint
%struct2 = OpTypeStruct %struct1
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%struct2_ptr = OpTypePointer Function %struct2
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct2_ptr Function
%3 = OpAccessChain %struct1_ptr %var %uint_0
%4 = OpAccessChain %uint_ptr %3 %uint_0
OpStore %4 %uint_0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ElideSingleUncombinedAccessChains) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[array:%\w+]] = OpTypeArray [[uint]]
; CHECK: [[array_ptr:%\w+]] = OpTypePointer Function [[array]]
; CHECK: [[const:%\w+]] = OpConstant [[uint]] 0
; CHECK: [[param:%\w+]] = OpFunctionParameter [[uint]]
; CHECK: [[var:%\w+]] = OpVariable [[array_ptr]] Function
; CHECK: [[access:%\w+]] = OpAccessChain {{.*}} [[var]] [[param]]
; CHECK: OpStore [[access]] [[const]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "elide_single_uncombined_access_chains"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%uint_1 = OpConstant %uint 1
%array = OpTypeArray %uint %uint_1
%struct2 = OpTypeStruct %array
%uint_ptr = OpTypePointer Function %uint
%array_ptr = OpTypePointer Function %array
%struct2_ptr = OpTypePointer Function %struct2
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void %uint
%1 = OpFunction %void None %func
%param = OpFunctionParameter %uint
%2 = OpLabel
%var = OpVariable %struct2_ptr Function
%3 = OpAccessChain %array_ptr %var %uint_0
%4 = OpAccessChain %uint_ptr %3 %param
OpStore %4 %uint_0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ReplaceWholeLoad) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct1:%\w+]] = OpTypeStruct [[uint]] [[uint]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[const:%\w+]] = OpConstant [[uint]] 0
; CHECK: [[var1:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[var0:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[l1:%\w+]] = OpLoad [[uint]] [[var1]]
; CHECK: [[l0:%\w+]] = OpLoad [[uint]] [[var0]]
; CHECK: OpCompositeConstruct [[struct1]] [[l0]] [[l1]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "replace_whole_load"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%uint_1 = OpConstant %uint 1
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%load = OpLoad %struct1 %var
%3 = OpAccessChain %uint_ptr %var %uint_0
OpStore %3 %uint_0
%4 = OpAccessChain %uint_ptr %var %uint_1
OpStore %4 %uint_0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ReplaceWholeLoadCopyMemoryAccess) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct1:%\w+]] = OpTypeStruct [[uint]] [[uint]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[undef:%\w+]] = OpUndef [[uint]]
; CHECK: [[var0:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[l0:%\w+]] = OpLoad [[uint]] [[var0]] Nontemporal
; CHECK: OpCompositeConstruct [[struct1]] [[l0]] [[undef]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "replace_whole_load_copy_memory_access"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%load = OpLoad %struct1 %var Nontemporal
%3 = OpAccessChain %uint_ptr %var %uint_0
OpStore %3 %uint_0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ReplaceWholeStore) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct1:%\w+]] = OpTypeStruct [[uint]] [[uint]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[const:%\w+]] = OpConstant [[uint]] 0
; CHECK: [[const_struct:%\w+]] = OpConstantComposite [[struct1]] [[const]] [[const]]
; CHECK: [[var0:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[ex0:%\w+]] = OpCompositeExtract [[uint]] [[const_struct]] 0
; CHECK: OpStore [[var0]] [[ex0]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "replace_whole_store"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%const_struct = OpConstantComposite %struct1 %uint_0 %uint_0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
OpStore %var %const_struct
%3 = OpAccessChain %uint_ptr %var %uint_0
%4 = OpLoad %uint %3
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ReplaceWholeStoreCopyMemoryAccess) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct1:%\w+]] = OpTypeStruct [[uint]] [[uint]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[const:%\w+]] = OpConstant [[uint]] 0
; CHECK: [[const_struct:%\w+]] = OpConstantComposite [[struct1]] [[const]] [[const]]
; CHECK: [[var0:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK-NOT: OpVariable
; CHECK: [[ex0:%\w+]] = OpCompositeExtract [[uint]] [[const_struct]] 0
; CHECK: OpStore [[var0]] [[ex0]] Aligned 4
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "replace_whole_store_copy_memory_access"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%const_struct = OpConstantComposite %struct1 %uint_0 %uint_0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
OpStore %var %const_struct Aligned 4
%3 = OpAccessChain %uint_ptr %var %uint_0
%4 = OpLoad %uint %3
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DontTouchVolatileLoad) {
const std::string text = R"(
;
; CHECK: [[struct:%\w+]] = OpTypeStruct
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: OpLabel
; CHECK-NEXT: OpVariable [[struct_ptr]]
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "dont_touch_volatile_load"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%3 = OpAccessChain %uint_ptr %var %uint_0
%4 = OpLoad %uint %3 Volatile
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DontTouchVolatileStore) {
const std::string text = R"(
;
; CHECK: [[struct:%\w+]] = OpTypeStruct
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: OpLabel
; CHECK-NEXT: OpVariable [[struct_ptr]]
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "dont_touch_volatile_store"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%3 = OpAccessChain %uint_ptr %var %uint_0
OpStore %3 %uint_0 Volatile
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DontTouchSpecNonFunctionVariable) {
const std::string text = R"(
;
; CHECK: [[struct:%\w+]] = OpTypeStruct
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Uniform [[struct]]
; CHECK: OpConstant
; CHECK-NEXT: OpVariable [[struct_ptr]]
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "dont_touch_spec_constant_access_chain"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint
%uint_ptr = OpTypePointer Uniform %uint
%struct1_ptr = OpTypePointer Uniform %struct1
%uint_0 = OpConstant %uint 0
%var = OpVariable %struct1_ptr Uniform
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%3 = OpAccessChain %uint_ptr %var %uint_0
OpStore %3 %uint_0 Volatile
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DontTouchSpecConstantAccessChain) {
const std::string text = R"(
;
; CHECK: [[array:%\w+]] = OpTypeArray
; CHECK: [[array_ptr:%\w+]] = OpTypePointer Function [[array]]
; CHECK: OpLabel
; CHECK-NEXT: OpVariable [[array_ptr]]
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "dont_touch_spec_constant_access_chain"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%uint_1 = OpConstant %uint 1
%array = OpTypeArray %uint %uint_1
%uint_ptr = OpTypePointer Function %uint
%array_ptr = OpTypePointer Function %array
%uint_0 = OpConstant %uint 0
%spec_const = OpSpecConstant %uint 0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %array_ptr Function
%3 = OpAccessChain %uint_ptr %var %spec_const
OpStore %3 %uint_0 Volatile
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, NoPartialAccesses) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: OpLabel
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "no_partial_accesses"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%const = OpConstantNull %struct1
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
OpStore %var %const
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DontTouchPtrAccessChain) {
const std::string text = R"(
;
; CHECK: [[struct:%\w+]] = OpTypeStruct
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: OpLabel
; CHECK-NEXT: OpVariable [[struct_ptr]]
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "dont_touch_ptr_access_chain"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%3 = OpPtrAccessChain %uint_ptr %var %uint_0 %uint_0
OpStore %3 %uint_0
%4 = OpAccessChain %uint_ptr %var %uint_0
OpStore %4 %uint_0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, false);
}
TEST_F(ScalarReplacementTest, DontTouchInBoundsPtrAccessChain) {
const std::string text = R"(
;
; CHECK: [[struct:%\w+]] = OpTypeStruct
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: OpLabel
; CHECK-NEXT: OpVariable [[struct_ptr]]
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "dont_touch_in_bounds_ptr_access_chain"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%3 = OpInBoundsPtrAccessChain %uint_ptr %var %uint_0 %uint_0
OpStore %3 %uint_0
%4 = OpInBoundsAccessChain %uint_ptr %var %uint_0
OpStore %4 %uint_0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, false);
}
TEST_F(ScalarReplacementTest, DonTouchAliasedDecoration) {
const std::string text = R"(
;
; CHECK: [[struct:%\w+]] = OpTypeStruct
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: OpLabel
; CHECK-NEXT: OpVariable [[struct_ptr]]
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "aliased"
OpDecorate %var Aliased
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%3 = OpAccessChain %uint_ptr %var %uint_0
%4 = OpLoad %uint %3
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, CopyRestrictDecoration) {
const std::string text = R"(
;
; CHECK: OpName
; CHECK-NEXT: OpDecorate [[var0:%\w+]] Restrict
; CHECK-NEXT: OpDecorate [[var1:%\w+]] Restrict
; CHECK: [[int:%\w+]] = OpTypeInt
; CHECK: [[struct:%\w+]] = OpTypeStruct
; CHECK: [[int_ptr:%\w+]] = OpTypePointer Function [[int]]
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: OpLabel
; CHECK-NEXT: [[var1]] = OpVariable [[int_ptr]]
; CHECK-NEXT: [[var0]] = OpVariable [[int_ptr]]
; CHECK-NOT: OpVariable [[struct_ptr]]
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "restrict"
OpDecorate %var Restrict
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%uint_1 = OpConstant %uint 1
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%3 = OpAccessChain %uint_ptr %var %uint_0
%4 = OpLoad %uint %3
%5 = OpAccessChain %uint_ptr %var %uint_1
%6 = OpLoad %uint %5
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DontClobberDecoratesOnSubtypes) {
const std::string text = R"(
;
; CHECK: OpDecorate [[array:%\w+]] ArrayStride 1
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[array]] = OpTypeArray [[uint]]
; CHECK: [[array_ptr:%\w+]] = OpTypePointer Function [[array]]
; CHECK: OpLabel
; CHECK-NEXT: OpVariable [[array_ptr]] Function
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "array_stride"
OpDecorate %array ArrayStride 1
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%uint_1 = OpConstant %uint 1
%array = OpTypeArray %uint %uint_1
%struct1 = OpTypeStruct %array
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void %uint
%1 = OpFunction %void None %func
%param = OpFunctionParameter %uint
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%3 = OpAccessChain %uint_ptr %var %uint_0 %param
%4 = OpLoad %uint %3
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DontCopyMemberDecorate) {
const std::string text = R"(
;
; CHECK-NOT: OpDecorate
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct:%\w+]] = OpTypeStruct [[uint]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[struct_ptr:%\w+]] = OpTypePointer Function [[struct]]
; CHECK: OpLabel
; CHECK-NEXT: OpVariable [[uint_ptr]] Function
; CHECK-NOT: OpVariable
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "member_decorate"
OpMemberDecorate %struct1 0 Offset 1
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%uint_1 = OpConstant %uint 1
%struct1 = OpTypeStruct %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%func = OpTypeFunction %void %uint
%1 = OpFunction %void None %func
%2 = OpLabel
%var = OpVariable %struct1_ptr Function
%3 = OpAccessChain %uint_ptr %var %uint_0
%4 = OpLoad %uint %3
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, NoPartialAccesses2) {
const std::string text = R"(
;
; CHECK: [[float:%\w+]] = OpTypeFloat 32
; CHECK: [[float_ptr:%\w+]] = OpTypePointer Function [[float]]
; CHECK: OpVariable [[float_ptr]] Function
; CHECK: OpVariable [[float_ptr]] Function
; CHECK: OpVariable [[float_ptr]] Function
; CHECK: OpVariable [[float_ptr]] Function
; CHECK: OpVariable [[float_ptr]] Function
; CHECK: OpVariable [[float_ptr]] Function
; CHECK: OpVariable [[float_ptr]] Function
; CHECK-NOT: OpVariable
;
OpCapability Shader
%1 = OpExtInstImport "GLSL.std.450"
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %main "main" %fo
OpExecutionMode %main OriginUpperLeft
OpSource GLSL 430
OpName %main "main"
OpName %S "S"
OpMemberName %S 0 "x"
OpMemberName %S 1 "y"
OpName %ts1 "ts1"
OpName %S_0 "S"
OpMemberName %S_0 0 "x"
OpMemberName %S_0 1 "y"
OpName %U_t "U_t"
OpMemberName %U_t 0 "g_s1"
OpMemberName %U_t 1 "g_s2"
OpMemberName %U_t 2 "g_s3"
OpName %_ ""
OpName %ts2 "ts2"
OpName %_Globals_ "_Globals_"
OpMemberName %_Globals_ 0 "g_b"
OpName %__0 ""
OpName %ts3 "ts3"
OpName %ts4 "ts4"
OpName %fo "fo"
OpMemberDecorate %S_0 0 Offset 0
OpMemberDecorate %S_0 1 Offset 4
OpMemberDecorate %U_t 0 Offset 0
OpMemberDecorate %U_t 1 Offset 8
OpMemberDecorate %U_t 2 Offset 16
OpDecorate %U_t BufferBlock
OpDecorate %_ DescriptorSet 0
OpMemberDecorate %_Globals_ 0 Offset 0
OpDecorate %_Globals_ Block
OpDecorate %__0 DescriptorSet 0
OpDecorate %__0 Binding 0
OpDecorate %fo Location 0
%void = OpTypeVoid
%15 = OpTypeFunction %void
%float = OpTypeFloat 32
%S = OpTypeStruct %float %float
%_ptr_Function_S = OpTypePointer Function %S
%S_0 = OpTypeStruct %float %float
%U_t = OpTypeStruct %S_0 %S_0 %S_0
%_ptr_Uniform_U_t = OpTypePointer Uniform %U_t
%_ = OpVariable %_ptr_Uniform_U_t Uniform
%int = OpTypeInt 32 1
%int_0 = OpConstant %int 0
%_ptr_Uniform_S_0 = OpTypePointer Uniform %S_0
%_ptr_Function_float = OpTypePointer Function %float
%int_1 = OpConstant %int 1
%uint = OpTypeInt 32 0
%_Globals_ = OpTypeStruct %uint
%_ptr_Uniform__Globals_ = OpTypePointer Uniform %_Globals_
%__0 = OpVariable %_ptr_Uniform__Globals_ Uniform
%_ptr_Uniform_uint = OpTypePointer Uniform %uint
%bool = OpTypeBool
%uint_0 = OpConstant %uint 0
%_ptr_Output_float = OpTypePointer Output %float
%fo = OpVariable %_ptr_Output_float Output
%main = OpFunction %void None %15
%30 = OpLabel
%ts1 = OpVariable %_ptr_Function_S Function
%ts2 = OpVariable %_ptr_Function_S Function
%ts3 = OpVariable %_ptr_Function_S Function
%ts4 = OpVariable %_ptr_Function_S Function
%31 = OpAccessChain %_ptr_Uniform_S_0 %_ %int_0
%32 = OpLoad %S_0 %31
%33 = OpCompositeExtract %float %32 0
%34 = OpAccessChain %_ptr_Function_float %ts1 %int_0
OpStore %34 %33
%35 = OpCompositeExtract %float %32 1
%36 = OpAccessChain %_ptr_Function_float %ts1 %int_1
OpStore %36 %35
%37 = OpAccessChain %_ptr_Uniform_S_0 %_ %int_1
%38 = OpLoad %S_0 %37
%39 = OpCompositeExtract %float %38 0
%40 = OpAccessChain %_ptr_Function_float %ts2 %int_0
OpStore %40 %39
%41 = OpCompositeExtract %float %38 1
%42 = OpAccessChain %_ptr_Function_float %ts2 %int_1
OpStore %42 %41
%43 = OpAccessChain %_ptr_Uniform_uint %__0 %int_0
%44 = OpLoad %uint %43
%45 = OpINotEqual %bool %44 %uint_0
OpSelectionMerge %46 None
OpBranchConditional %45 %47 %48
%47 = OpLabel
%49 = OpLoad %S %ts1
OpStore %ts3 %49
OpBranch %46
%48 = OpLabel
%50 = OpLoad %S %ts2
OpStore %ts3 %50
OpBranch %46
%46 = OpLabel
%51 = OpLoad %S %ts3
OpStore %ts4 %51
%52 = OpAccessChain %_ptr_Function_float %ts4 %int_1
%53 = OpLoad %float %52
OpStore %fo %53
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ReplaceWholeLoadAndStore) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct1:%\w+]] = OpTypeStruct [[uint]] [[uint]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[const:%\w+]] = OpConstant [[uint]] 0
; CHECK: [[undef:%\w+]] = OpUndef [[uint]]
; CHECK: [[var0:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[var1:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK-NOT: OpVariable
; CHECK: [[l0:%\w+]] = OpLoad [[uint]] [[var0]]
; CHECK: [[c0:%\w+]] = OpCompositeConstruct [[struct1]] [[l0]] [[undef]]
; CHECK: [[e0:%\w+]] = OpCompositeExtract [[uint]] [[c0]] 0
; CHECK: OpStore [[var1]] [[e0]]
; CHECK: [[l1:%\w+]] = OpLoad [[uint]] [[var1]]
; CHECK: [[c1:%\w+]] = OpCompositeConstruct [[struct1]] [[l1]] [[undef]]
; CHECK: [[e1:%\w+]] = OpCompositeExtract [[uint]] [[c1]] 0
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "replace_whole_load"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%uint_1 = OpConstant %uint 1
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var2 = OpVariable %struct1_ptr Function
%var1 = OpVariable %struct1_ptr Function
%load1 = OpLoad %struct1 %var1
OpStore %var2 %load1
%load2 = OpLoad %struct1 %var2
%3 = OpCompositeExtract %uint %load2 0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ReplaceWholeLoadAndStore2) {
// TODO: We can improve this case by ensuring that |var2| is processed first.
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct1:%\w+]] = OpTypeStruct [[uint]] [[uint]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[const:%\w+]] = OpConstant [[uint]] 0
; CHECK: [[undef:%\w+]] = OpUndef [[uint]]
; CHECK: [[var1:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[var0a:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[var0b:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK-NOT: OpVariable
; CHECK: [[l0a:%\w+]] = OpLoad [[uint]] [[var0a]]
; CHECK: [[l0b:%\w+]] = OpLoad [[uint]] [[var0b]]
; CHECK: [[c0:%\w+]] = OpCompositeConstruct [[struct1]] [[l0b]] [[l0a]]
; CHECK: [[e0:%\w+]] = OpCompositeExtract [[uint]] [[c0]] 0
; CHECK: OpStore [[var1]] [[e0]]
; CHECK: [[l1:%\w+]] = OpLoad [[uint]] [[var1]]
; CHECK: [[c1:%\w+]] = OpCompositeConstruct [[struct1]] [[l1]] [[undef]]
; CHECK: [[e1:%\w+]] = OpCompositeExtract [[uint]] [[c1]] 0
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "replace_whole_load"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct1 = OpTypeStruct %uint %uint
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%uint_1 = OpConstant %uint 1
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var1 = OpVariable %struct1_ptr Function
%var2 = OpVariable %struct1_ptr Function
%load1 = OpLoad %struct1 %var1
OpStore %var2 %load1
%load2 = OpLoad %struct1 %var2
%3 = OpCompositeExtract %uint %load2 0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, CreateAmbiguousNullConstant1) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct1:%\w+]] = OpTypeStruct [[uint]] [[struct_member:%\w+]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[const:%\w+]] = OpConstant [[uint]] 0
; CHECK: [[undef:%\w+]] = OpUndef [[struct_member]]
; CHECK: [[var0a:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[var1:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[var0b:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK-NOT: OpVariable
; CHECK: OpStore [[var1]]
; CHECK: [[l1:%\w+]] = OpLoad [[uint]] [[var1]]
; CHECK: [[c1:%\w+]] = OpCompositeConstruct [[struct1]] [[l1]] [[undef]]
; CHECK: [[e1:%\w+]] = OpCompositeExtract [[uint]] [[c1]] 0
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "replace_whole_load"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct2 = OpTypeStruct %uint
%struct3 = OpTypeStruct %uint
%struct1 = OpTypeStruct %uint %struct2
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%uint_1 = OpConstant %uint 1
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var1 = OpVariable %struct1_ptr Function
%var2 = OpVariable %struct1_ptr Function
%load1 = OpLoad %struct1 %var1
OpStore %var2 %load1
%load2 = OpLoad %struct1 %var2
%3 = OpCompositeExtract %uint %load2 0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, SpecConstantArray) {
const std::string text = R"(
; CHECK: [[int:%\w+]] = OpTypeInt
; CHECK: [[spec_const:%\w+]] = OpSpecConstant [[int]] 4
; CHECK: [[spec_op:%\w+]] = OpSpecConstantOp [[int]] IAdd [[spec_const]] [[spec_const]]
; CHECK: [[array1:%\w+]] = OpTypeArray [[int]] [[spec_const]]
; CHECK: [[array2:%\w+]] = OpTypeArray [[int]] [[spec_op]]
; CHECK: [[ptr_array1:%\w+]] = OpTypePointer Function [[array1]]
; CHECK: [[ptr_array2:%\w+]] = OpTypePointer Function [[array2]]
; CHECK: OpLabel
; CHECK-NEXT: OpVariable [[ptr_array1]] Function
; CHECK-NEXT: OpVariable [[ptr_array2]] Function
; CHECK-NOT: OpVariable
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
%void = OpTypeVoid
%void_fn = OpTypeFunction %void
%int = OpTypeInt 32 0
%spec_const = OpSpecConstant %int 4
%spec_op = OpSpecConstantOp %int IAdd %spec_const %spec_const
%array_1 = OpTypeArray %int %spec_const
%array_2 = OpTypeArray %int %spec_op
%ptr_array_1_Function = OpTypePointer Function %array_1
%ptr_array_2_Function = OpTypePointer Function %array_2
%func = OpFunction %void None %void_fn
%1 = OpLabel
%var_1 = OpVariable %ptr_array_1_Function Function
%var_2 = OpVariable %ptr_array_2_Function Function
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, CreateAmbiguousNullConstant2) {
const std::string text = R"(
;
; CHECK: [[uint:%\w+]] = OpTypeInt 32 0
; CHECK: [[struct1:%\w+]] = OpTypeStruct [[uint]] [[struct_member:%\w+]]
; CHECK: [[uint_ptr:%\w+]] = OpTypePointer Function [[uint]]
; CHECK: [[const:%\w+]] = OpConstant [[uint]] 0
; CHECK: [[undef:%\w+]] = OpUndef [[struct_member]]
; CHECK: [[var0a:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[var1:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: [[var0b:%\w+]] = OpVariable [[uint_ptr]] Function
; CHECK: OpStore [[var1]]
; CHECK: [[l1:%\w+]] = OpLoad [[uint]] [[var1]]
; CHECK: [[c1:%\w+]] = OpCompositeConstruct [[struct1]] [[l1]] [[undef]]
; CHECK: [[e1:%\w+]] = OpCompositeExtract [[uint]] [[c1]] 0
;
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %func "replace_whole_load"
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%struct3 = OpTypeStruct %uint
%struct2 = OpTypeStruct %uint
%struct1 = OpTypeStruct %uint %struct2
%uint_ptr = OpTypePointer Function %uint
%struct1_ptr = OpTypePointer Function %struct1
%uint_0 = OpConstant %uint 0
%uint_1 = OpConstant %uint 1
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%var1 = OpVariable %struct1_ptr Function
%var2 = OpVariable %struct1_ptr Function
%load1 = OpLoad %struct1 %var1
OpStore %var2 %load1
%load2 = OpLoad %struct1 %var2
%3 = OpCompositeExtract %uint %load2 0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
// Test that a struct of size 4 is not replaced when there is a limit of 2.
TEST_F(ScalarReplacementTest, TestLimit) {
const std::string text = R"(
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %6 "simple_struct"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%3 = OpTypeStruct %2 %2 %2 %2
%4 = OpTypePointer Function %3
%5 = OpTypePointer Function %2
%6 = OpTypeFunction %2
%7 = OpConstantNull %3
%8 = OpConstant %2 0
%9 = OpConstant %2 1
%10 = OpConstant %2 2
%11 = OpConstant %2 3
%12 = OpFunction %2 None %6
%13 = OpLabel
%14 = OpVariable %4 Function %7
%15 = OpInBoundsAccessChain %5 %14 %8
%16 = OpLoad %2 %15
%17 = OpAccessChain %5 %14 %10
%18 = OpLoad %2 %17
%19 = OpIAdd %2 %16 %18
OpReturnValue %19
OpFunctionEnd
)";
auto result =
SinglePassRunAndDisassemble<ScalarReplacementPass>(text, true, false, 2);
EXPECT_EQ(Pass::Status::SuccessWithoutChange, std::get<1>(result));
}
// Test that a struct of size 4 is replaced when there is a limit of 0 (no
// limit). This is the same spir-v as a test above, so we do not check that it
// is correctly transformed. We leave that to the test above.
TEST_F(ScalarReplacementTest, TestUnimited) {
const std::string text = R"(
OpCapability Shader
OpCapability Linkage
OpMemoryModel Logical GLSL450
OpName %6 "simple_struct"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%3 = OpTypeStruct %2 %2 %2 %2
%4 = OpTypePointer Function %3
%5 = OpTypePointer Function %2
%6 = OpTypeFunction %2
%7 = OpConstantNull %3
%8 = OpConstant %2 0
%9 = OpConstant %2 1
%10 = OpConstant %2 2
%11 = OpConstant %2 3
%12 = OpFunction %2 None %6
%13 = OpLabel
%14 = OpVariable %4 Function %7
%15 = OpInBoundsAccessChain %5 %14 %8
%16 = OpLoad %2 %15
%17 = OpAccessChain %5 %14 %10
%18 = OpLoad %2 %17
%19 = OpIAdd %2 %16 %18
OpReturnValue %19
OpFunctionEnd
)";
auto result =
SinglePassRunAndDisassemble<ScalarReplacementPass>(text, true, false, 0);
EXPECT_EQ(Pass::Status::SuccessWithChange, std::get<1>(result));
}
TEST_F(ScalarReplacementTest, AmbigousPointer) {
const std::string text = R"(
; CHECK: [[s1:%\w+]] = OpTypeStruct %uint
; CHECK: [[s2:%\w+]] = OpTypeStruct %uint
; CHECK: [[s3:%\w+]] = OpTypeStruct [[s2]]
; CHECK: [[s3_const:%\w+]] = OpConstantComposite [[s3]]
; CHECK: [[s2_ptr:%\w+]] = OpTypePointer Function [[s2]]
; CHECK: OpCompositeExtract [[s2]] [[s3_const]]
OpCapability Shader
%1 = OpExtInstImport "GLSL.std.450"
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %2 "main"
OpExecutionMode %2 OriginUpperLeft
OpSource ESSL 310
%void = OpTypeVoid
%5 = OpTypeFunction %void
%uint = OpTypeInt 32 0
%_struct_7 = OpTypeStruct %uint
%_struct_8 = OpTypeStruct %uint
%_struct_9 = OpTypeStruct %_struct_8
%uint_1 = OpConstant %uint 1
%11 = OpConstantComposite %_struct_8 %uint_1
%12 = OpConstantComposite %_struct_9 %11
%_ptr_Function__struct_9 = OpTypePointer Function %_struct_9
%_ptr_Function__struct_7 = OpTypePointer Function %_struct_7
%2 = OpFunction %void None %5
%15 = OpLabel
%var = OpVariable %_ptr_Function__struct_9 Function
OpStore %var %12
%ld = OpLoad %_struct_9 %var
%ex = OpCompositeExtract %_struct_8 %ld 0
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
// Test that scalar replacement does not crash when there is an OpAccessChain
// with no index. If we choose to handle this case in the future, then the
// result can change.
TEST_F(ScalarReplacementTest, TestAccessChainWithNoIndexes) {
const std::string text = R"(
OpCapability Shader
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %1 "main"
OpExecutionMode %1 OriginLowerLeft
%void = OpTypeVoid
%3 = OpTypeFunction %void
%float = OpTypeFloat 32
%_struct_5 = OpTypeStruct %float
%_ptr_Function__struct_5 = OpTypePointer Function %_struct_5
%1 = OpFunction %void None %3
%7 = OpLabel
%8 = OpVariable %_ptr_Function__struct_5 Function
%9 = OpAccessChain %_ptr_Function__struct_5 %8
OpReturn
OpFunctionEnd
)";
auto result =
SinglePassRunAndDisassemble<ScalarReplacementPass>(text, true, false);
EXPECT_EQ(Pass::Status::SuccessWithoutChange, std::get<1>(result));
}
// Test that id overflow is handled gracefully.
TEST_F(ScalarReplacementTest, IdBoundOverflow1) {
const std::string text = R"(
OpCapability ImageQuery
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %4 "main"
OpExecutionMode %4 OriginUpperLeft
OpDecorate %4194302 DescriptorSet 1073495039
%2 = OpTypeVoid
%3 = OpTypeFunction %2
%6 = OpTypeFloat 32
%7 = OpTypeStruct %6 %6
%557056 = OpTypeStruct %7
%9 = OpTypePointer Function %7
%18 = OpTypeFunction %7 %9
%4 = OpFunction %2 Pure|Const %3
%1836763 = OpLabel
%4194302 = OpVariable %9 Function
%10 = OpVariable %9 Function
OpKill
%4194301 = OpLabel
%524296 = OpLoad %7 %4194302
OpKill
OpFunctionEnd
)";
SetAssembleOptions(SPV_TEXT_TO_BINARY_OPTION_PRESERVE_NUMERIC_IDS);
std::vector<Message> messages = {
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."},
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."}};
SetMessageConsumer(GetTestMessageConsumer(messages));
auto result = SinglePassRunToBinary<ScalarReplacementPass>(text, true, false);
EXPECT_EQ(Pass::Status::Failure, std::get<1>(result));
}
// Test that id overflow is handled gracefully.
TEST_F(ScalarReplacementTest, IdBoundOverflow2) {
const std::string text = R"(
OpCapability Shader
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %4 "main" %17
OpExecutionMode %4 OriginUpperLeft
%2 = OpTypeVoid
%3 = OpTypeFunction %2
%6 = OpTypeFloat 32
%7 = OpTypeVector %6 4
%8 = OpTypeStruct %7
%9 = OpTypePointer Function %8
%16 = OpTypePointer Output %7
%21 = OpTypeInt 32 1
%22 = OpConstant %21 0
%23 = OpTypePointer Function %7
%17 = OpVariable %16 Output
%4 = OpFunction %2 None %3
%5 = OpLabel
%4194300 = OpVariable %23 Function
%10 = OpVariable %9 Function
%4194301 = OpAccessChain %23 %10 %22
%4194302 = OpLoad %7 %4194301
OpStore %4194300 %4194302
%15 = OpLoad %7 %4194300
OpStore %17 %15
OpReturn
OpFunctionEnd
)";
SetAssembleOptions(SPV_TEXT_TO_BINARY_OPTION_PRESERVE_NUMERIC_IDS);
std::vector<Message> messages = {
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."}};
SetMessageConsumer(GetTestMessageConsumer(messages));
auto result = SinglePassRunToBinary<ScalarReplacementPass>(text, true, false);
EXPECT_EQ(Pass::Status::Failure, std::get<1>(result));
}
// Test that id overflow is handled gracefully.
TEST_F(ScalarReplacementTest, IdBoundOverflow3) {
const std::string text = R"(
OpCapability InterpolationFunction
OpExtension "z"
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %4 "main"
OpExecutionMode %4 OriginUpperLeft
%2 = OpTypeVoid
%3 = OpTypeFunction %2
%6 = OpTypeFloat 32
%7 = OpTypeStruct %6 %6
%9 = OpTypePointer Function %7
%18 = OpTypeFunction %7 %9
%21 = OpTypeInt 32 0
%22 = OpConstant %21 4293000676
%4194302 = OpConstantNull %6
%4 = OpFunction %2 Inline|Pure %3
%786464 = OpLabel
%4194298 = OpVariable %9 Function
%10 = OpVariable %9 Function
%4194299 = OpUDiv %21 %22 %22
%4194300 = OpLoad %7 %10
%50959 = OpLoad %7 %4194298
OpKill
OpFunctionEnd
%1 = OpFunction %7 None %18
%19 = OpFunctionParameter %9
%147667 = OpLabel
%2044391 = OpUDiv %21 %22 %22
%25 = OpLoad %7 %19
OpReturnValue %25
OpFunctionEnd
%4194295 = OpFunction %2 None %3
%4194296 = OpLabel
OpKill
OpFunctionEnd
)";
SetAssembleOptions(SPV_TEXT_TO_BINARY_OPTION_PRESERVE_NUMERIC_IDS);
std::vector<Message> messages = {
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."},
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."},
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."},
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."},
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."},
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."},
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."},
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."},
{SPV_MSG_ERROR, "", 0, 0, "ID overflow. Try running compact-ids."}};
SetMessageConsumer(GetTestMessageConsumer(messages));
auto result = SinglePassRunToBinary<ScalarReplacementPass>(text, true, false);
EXPECT_EQ(Pass::Status::Failure, std::get<1>(result));
}
// Test that replacements for OpAccessChain do not go out of bounds.
// path_to_url
TEST_F(ScalarReplacementTest, OutOfBoundOpAccessChain) {
const std::string text = R"(
OpCapability Shader
%1 = OpExtInstImport "GLSL.std.450"
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %main "main" %_GLF_color
OpExecutionMode %main OriginUpperLeft
OpSource ESSL 310
OpName %main "main"
OpName %a "a"
OpName %_GLF_color "_GLF_color"
OpDecorate %_GLF_color Location 0
%void = OpTypeVoid
%3 = OpTypeFunction %void
%int = OpTypeInt 32 1
%_ptr_Function_int = OpTypePointer Function %int
%int_1 = OpConstant %int 1
%float = OpTypeFloat 32
%uint = OpTypeInt 32 0
%uint_1 = OpConstant %uint 1
%_arr_float_uint_1 = OpTypeArray %float %uint_1
%_ptr_Function__arr_float_uint_1 = OpTypePointer Function %_arr_float_uint_1
%_ptr_Function_float = OpTypePointer Function %float
%_ptr_Output_float = OpTypePointer Output %float
%_GLF_color = OpVariable %_ptr_Output_float Output
%main = OpFunction %void None %3
%5 = OpLabel
%a = OpVariable %_ptr_Function__arr_float_uint_1 Function
%21 = OpAccessChain %_ptr_Function_float %a %int_1
%22 = OpLoad %float %21
OpStore %_GLF_color %22
OpReturn
OpFunctionEnd
)";
SetAssembleOptions(SPV_TEXT_TO_BINARY_OPTION_PRESERVE_NUMERIC_IDS);
auto result =
SinglePassRunAndDisassemble<ScalarReplacementPass>(text, true, false);
EXPECT_EQ(Pass::Status::SuccessWithoutChange, std::get<1>(result));
}
TEST_F(ScalarReplacementTest, CharIndex) {
const std::string text = R"(
; CHECK: [[int:%\w+]] = OpTypeInt 32 0
; CHECK: [[ptr:%\w+]] = OpTypePointer Function [[int]]
; CHECK: OpVariable [[ptr]] Function
OpCapability Shader
OpCapability Int8
OpMemoryModel Logical GLSL450
OpEntryPoint GLCompute %main "main"
OpExecutionMode %main LocalSize 1 1 1
%void = OpTypeVoid
%int = OpTypeInt 32 0
%int_1024 = OpConstant %int 1024
%char = OpTypeInt 8 0
%char_1 = OpConstant %char 1
%array = OpTypeArray %int %int_1024
%ptr_func_array = OpTypePointer Function %array
%ptr_func_int = OpTypePointer Function %int
%void_fn = OpTypeFunction %void
%main = OpFunction %void None %void_fn
%entry = OpLabel
%var = OpVariable %ptr_func_array Function
%gep = OpAccessChain %ptr_func_int %var %char_1
OpStore %gep %int_1024
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true, 0);
}
TEST_F(ScalarReplacementTest, OutOfBoundsOpAccessChainNegative) {
const std::string text = R"(
OpCapability Shader
OpCapability Int8
OpMemoryModel Logical GLSL450
OpEntryPoint GLCompute %main "main"
OpExecutionMode %main LocalSize 1 1 1
%void = OpTypeVoid
%int = OpTypeInt 32 0
%int_1024 = OpConstant %int 1024
%char = OpTypeInt 8 1
%char_n1 = OpConstant %char -1
%array = OpTypeArray %int %int_1024
%ptr_func_array = OpTypePointer Function %array
%ptr_func_int = OpTypePointer Function %int
%void_fn = OpTypeFunction %void
%main = OpFunction %void None %void_fn
%entry = OpLabel
%var = OpVariable %ptr_func_array Function
%gep = OpAccessChain %ptr_func_int %var %char_n1
OpStore %gep %int_1024
OpReturn
OpFunctionEnd
)";
auto result =
SinglePassRunAndDisassemble<ScalarReplacementPass>(text, true, true, 0);
EXPECT_EQ(Pass::Status::SuccessWithoutChange, std::get<1>(result));
}
TEST_F(ScalarReplacementTest, RelaxedPrecisionMemberDecoration) {
const std::string text = R"(
; CHECK: OpDecorate {{%\w+}} RelaxedPrecision
; CHECK: OpDecorate [[new_var:%\w+]] RelaxedPrecision
; CHECK: [[new_var]] = OpVariable %_ptr_Function_v3float Function
; CHECK: OpLoad %v3float [[new_var]]
OpCapability Shader
OpMemoryModel Logical GLSL450
OpEntryPoint Vertex %1 "Draw2DTexCol_VS" %2 %3
OpSource HLSL 600
OpDecorate %2 Location 0
OpDecorate %3 Location 1
OpDecorate %3 RelaxedPrecision
OpMemberDecorate %_struct_4 1 RelaxedPrecision
%float = OpTypeFloat 32
%int = OpTypeInt 32 1
%int_1 = OpConstant %int 1
%v3float = OpTypeVector %float 3
%_ptr_Input_v3float = OpTypePointer Input %v3float
%void = OpTypeVoid
%11 = OpTypeFunction %void
%_struct_4 = OpTypeStruct %v3float %v3float
%_ptr_Function__struct_4 = OpTypePointer Function %_struct_4
%_ptr_Function_v3float = OpTypePointer Function %v3float
%2 = OpVariable %_ptr_Input_v3float Input
%3 = OpVariable %_ptr_Input_v3float Input
%1 = OpFunction %void None %11
%14 = OpLabel
%15 = OpVariable %_ptr_Function__struct_4 Function
%16 = OpLoad %v3float %2
%17 = OpLoad %v3float %3
%18 = OpCompositeConstruct %_struct_4 %16 %17
OpStore %15 %18
%19 = OpAccessChain %_ptr_Function_v3float %15 %int_1
%20 = OpLoad %v3float %19
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DebugDeclare) {
const std::string text = R"(
OpCapability Shader
OpCapability Linkage
%ext = OpExtInstImport "OpenCL.DebugInfo.100"
OpMemoryModel Logical GLSL450
%test = OpString "test"
OpName %6 "simple_struct"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%uint_32 = OpConstant %2 32
%3 = OpTypeStruct %2 %2 %2 %2
%4 = OpTypePointer Function %3
%5 = OpTypePointer Function %2
%6 = OpTypeFunction %2
%7 = OpConstantNull %3
%8 = OpConstant %2 0
%9 = OpConstant %2 1
%10 = OpConstant %2 2
%11 = OpConstant %2 3
%null_expr = OpExtInst %1 %ext DebugExpression
%src = OpExtInst %1 %ext DebugSource %test
%cu = OpExtInst %1 %ext DebugCompilationUnit 1 4 %src HLSL
%dbg_tf = OpExtInst %1 %ext DebugTypeBasic %test %uint_32 Float
%main_ty = OpExtInst %1 %ext DebugTypeFunction FlagIsProtected|FlagIsPrivate %1
%dbg_main = OpExtInst %1 %ext DebugFunction %test %main_ty %src 0 0 %cu %test FlagIsProtected|FlagIsPrivate 0 %12
%dbg_foo = OpExtInst %1 %ext DebugLocalVariable %test %dbg_tf %src 0 0 %dbg_main FlagIsLocal
%12 = OpFunction %2 None %6
%13 = OpLabel
%scope = OpExtInst %1 %ext DebugScope %dbg_main
%14 = OpVariable %4 Function %7
; CHECK: [[deref:%\w+]] = OpExtInst %void [[ext:%\w+]] DebugOperation Deref
; CHECK: [[dbg_local_var:%\w+]] = OpExtInst %void [[ext]] DebugLocalVariable
; CHECK: [[deref_expr:%\w+]] = OpExtInst %void [[ext]] DebugExpression [[deref]]
; CHECK: [[repl3:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl2:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl1:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl0:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl3]] [[deref_expr]] %int_3
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl2]] [[deref_expr]] %int_2
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl1]] [[deref_expr]] %int_1
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl0]] [[deref_expr]] %int_0
; CHECK-NOT: DebugDeclare
%decl = OpExtInst %1 %ext DebugDeclare %dbg_foo %14 %null_expr
%15 = OpInBoundsAccessChain %5 %14 %8
%16 = OpLoad %2 %15
%17 = OpAccessChain %5 %14 %10
%18 = OpLoad %2 %17
%19 = OpIAdd %2 %16 %18
OpReturnValue %19
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DebugValue) {
const std::string text = R"(
OpCapability Shader
OpCapability Linkage
%ext = OpExtInstImport "OpenCL.DebugInfo.100"
OpMemoryModel Logical GLSL450
%test = OpString "test"
OpName %6 "simple_struct"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%uint_32 = OpConstant %2 32
%3 = OpTypeStruct %2 %2 %2 %2
%4 = OpTypePointer Function %3
%5 = OpTypePointer Function %2
%6 = OpTypeFunction %2
%7 = OpConstantNull %3
%8 = OpConstant %2 0
%9 = OpConstant %2 1
%10 = OpConstant %2 2
%11 = OpConstant %2 3
%deref = OpExtInst %1 %ext DebugOperation Deref
%deref_expr = OpExtInst %1 %ext DebugExpression %deref
%null_expr = OpExtInst %1 %ext DebugExpression
%src = OpExtInst %1 %ext DebugSource %test
%cu = OpExtInst %1 %ext DebugCompilationUnit 1 4 %src HLSL
%dbg_tf = OpExtInst %1 %ext DebugTypeBasic %test %uint_32 Float
%main_ty = OpExtInst %1 %ext DebugTypeFunction FlagIsProtected|FlagIsPrivate %1
%dbg_main = OpExtInst %1 %ext DebugFunction %test %main_ty %src 0 0 %cu %test FlagIsProtected|FlagIsPrivate 0 %12
%dbg_foo = OpExtInst %1 %ext DebugLocalVariable %test %dbg_tf %src 0 0 %dbg_main FlagIsLocal
%12 = OpFunction %2 None %6
%13 = OpLabel
%scope = OpExtInst %1 %ext DebugScope %dbg_main
%14 = OpVariable %4 Function %7
; CHECK: [[deref:%\w+]] = OpExtInst %void [[ext:%\w+]] DebugOperation Deref
; CHECK: [[deref_expr:%\w+]] = OpExtInst %void [[ext]] DebugExpression [[deref]]
; CHECK: [[dbg_local_var:%\w+]] = OpExtInst %void [[ext]] DebugLocalVariable
; CHECK: [[repl3:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl2:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl1:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl0:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl0]] [[deref_expr]] %int_0
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl1]] [[deref_expr]] %int_1
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl2]] [[deref_expr]] %int_2
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl3]] [[deref_expr]] %int_3
%value = OpExtInst %1 %ext DebugValue %dbg_foo %14 %deref_expr
%15 = OpInBoundsAccessChain %5 %14 %8
%16 = OpLoad %2 %15
%17 = OpAccessChain %5 %14 %10
%18 = OpLoad %2 %17
%19 = OpIAdd %2 %16 %18
OpReturnValue %19
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DebugDeclareRecursive) {
const std::string text = R"(
OpCapability Shader
OpCapability Linkage
%ext = OpExtInstImport "OpenCL.DebugInfo.100"
OpMemoryModel Logical GLSL450
%test = OpString "test"
OpName %6 "simple_struct"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%uint_32 = OpConstant %2 32
%float = OpTypeFloat 32
%float_1 = OpConstant %float 1
%member = OpTypeStruct %2 %float
%3 = OpTypeStruct %2 %member %float
%4 = OpTypePointer Function %3
%5 = OpTypePointer Function %2
%ptr_float_Function = OpTypePointer Function %float
%6 = OpTypeFunction %2
%cmember = OpConstantComposite %member %uint_32 %float_1
%7 = OpConstantComposite %3 %uint_32 %cmember %float_1
%8 = OpConstant %2 0
%9 = OpConstant %2 1
%10 = OpConstant %2 2
%null_expr = OpExtInst %1 %ext DebugExpression
%src = OpExtInst %1 %ext DebugSource %test
%cu = OpExtInst %1 %ext DebugCompilationUnit 1 4 %src HLSL
%dbg_tf = OpExtInst %1 %ext DebugTypeBasic %test %uint_32 Float
%main_ty = OpExtInst %1 %ext DebugTypeFunction FlagIsProtected|FlagIsPrivate %1
%dbg_main = OpExtInst %1 %ext DebugFunction %test %main_ty %src 0 0 %cu %test FlagIsProtected|FlagIsPrivate 0 %12
%dbg_foo = OpExtInst %1 %ext DebugLocalVariable %test %dbg_tf %src 0 0 %dbg_main FlagIsLocal
%12 = OpFunction %2 None %6
%13 = OpLabel
%scope = OpExtInst %1 %ext DebugScope %dbg_main
%14 = OpVariable %4 Function %7
; CHECK: [[deref:%\w+]] = OpExtInst %void [[ext:%\w+]] DebugOperation Deref
; CHECK: [[dbg_local_var:%\w+]] = OpExtInst %void [[ext]] DebugLocalVariable
; CHECK: [[deref_expr:%\w+]] = OpExtInst %void [[ext]] DebugExpression [[deref]]
; CHECK: [[repl2:%\w+]] = OpVariable %_ptr_Function_float Function %float_1
; CHECK: [[repl1:%\w+]] = OpVariable %_ptr_Function_uint Function %uint_32
; CHECK: [[repl3:%\w+]] = OpVariable %_ptr_Function_float Function %float_1
; CHECK: [[repl0:%\w+]] = OpVariable %_ptr_Function_uint Function %uint_32
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl3]] [[deref_expr]] %int_2
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl1]] [[deref_expr]] %int_1 %int_0
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl2]] [[deref_expr]] %int_1 %int_1
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl0]] [[deref_expr]] %int_0
; CHECK-NOT: DebugDeclare
%decl = OpExtInst %1 %ext DebugDeclare %dbg_foo %14 %null_expr
%15 = OpInBoundsAccessChain %5 %14 %8
%16 = OpLoad %2 %15
%17 = OpAccessChain %ptr_float_Function %14 %10
%18 = OpLoad %float %17
%value = OpConvertFToU %2 %18
%19 = OpIAdd %2 %16 %value
OpReturnValue %19
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DebugValueWithIndex) {
const std::string text = R"(
OpCapability Shader
OpCapability Linkage
%ext = OpExtInstImport "OpenCL.DebugInfo.100"
OpMemoryModel Logical GLSL450
%test = OpString "test"
OpName %6 "simple_struct"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%uint_32 = OpConstant %2 32
%3 = OpTypeStruct %2 %2 %2 %2
%4 = OpTypePointer Function %3
%5 = OpTypePointer Function %2
%6 = OpTypeFunction %2
%7 = OpConstantNull %3
%8 = OpConstant %2 0
%9 = OpConstant %2 1
%10 = OpConstant %2 2
%11 = OpConstant %2 3
%deref = OpExtInst %1 %ext DebugOperation Deref
%deref_expr = OpExtInst %1 %ext DebugExpression %deref
%null_expr = OpExtInst %1 %ext DebugExpression
%src = OpExtInst %1 %ext DebugSource %test
%cu = OpExtInst %1 %ext DebugCompilationUnit 1 4 %src HLSL
%dbg_tf = OpExtInst %1 %ext DebugTypeBasic %test %uint_32 Float
%main_ty = OpExtInst %1 %ext DebugTypeFunction FlagIsProtected|FlagIsPrivate %1
%dbg_main = OpExtInst %1 %ext DebugFunction %test %main_ty %src 0 0 %cu %test FlagIsProtected|FlagIsPrivate 0 %12
%dbg_foo = OpExtInst %1 %ext DebugLocalVariable %test %dbg_tf %src 0 0 %dbg_main FlagIsLocal
%12 = OpFunction %2 None %6
%13 = OpLabel
%scope = OpExtInst %1 %ext DebugScope %dbg_main
%14 = OpVariable %4 Function %7
; CHECK: [[deref:%\w+]] = OpExtInst %void [[ext:%\w+]] DebugOperation Deref
; CHECK: [[deref_expr:%\w+]] = OpExtInst %void [[ext]] DebugExpression [[deref]]
; CHECK: [[dbg_local_var:%\w+]] = OpExtInst %void [[ext]] DebugLocalVariable
; CHECK: [[repl3:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl2:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl1:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl0:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl0]] [[deref_expr]] %uint_0 %uint_1 %uint_2 %int_0
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl1]] [[deref_expr]] %uint_0 %uint_1 %uint_2 %int_1
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl2]] [[deref_expr]] %uint_0 %uint_1 %uint_2 %int_2
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl3]] [[deref_expr]] %uint_0 %uint_1 %uint_2 %int_3
%value = OpExtInst %1 %ext DebugValue %dbg_foo %14 %deref_expr %8 %9 %10
%15 = OpInBoundsAccessChain %5 %14 %8
%16 = OpLoad %2 %15
%17 = OpAccessChain %5 %14 %10
%18 = OpLoad %2 %17
%19 = OpIAdd %2 %16 %18
OpReturnValue %19
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, DebugDeclareForVariableInOtherBB) {
const std::string text = R"(
OpCapability Shader
OpCapability Linkage
%ext = OpExtInstImport "OpenCL.DebugInfo.100"
OpMemoryModel Logical GLSL450
%test = OpString "test"
OpName %6 "simple_struct"
%1 = OpTypeVoid
%2 = OpTypeInt 32 0
%uint_32 = OpConstant %2 32
%3 = OpTypeStruct %2 %2 %2 %2
%4 = OpTypePointer Function %3
%5 = OpTypePointer Function %2
%6 = OpTypeFunction %2
%7 = OpConstantNull %3
%8 = OpConstant %2 0
%9 = OpConstant %2 1
%10 = OpConstant %2 2
%11 = OpConstant %2 3
%deref = OpExtInst %1 %ext DebugOperation Deref
%deref_expr = OpExtInst %1 %ext DebugExpression %deref
%null_expr = OpExtInst %1 %ext DebugExpression
%src = OpExtInst %1 %ext DebugSource %test
%cu = OpExtInst %1 %ext DebugCompilationUnit 1 4 %src HLSL
%dbg_tf = OpExtInst %1 %ext DebugTypeBasic %test %uint_32 Float
%main_ty = OpExtInst %1 %ext DebugTypeFunction FlagIsProtected|FlagIsPrivate %1
%dbg_main = OpExtInst %1 %ext DebugFunction %test %main_ty %src 0 0 %cu %test FlagIsProtected|FlagIsPrivate 0 %12
%dbg_foo = OpExtInst %1 %ext DebugLocalVariable %test %dbg_tf %src 0 0 %dbg_main FlagIsLocal
%12 = OpFunction %2 None %6
%13 = OpLabel
%scope = OpExtInst %1 %ext DebugScope %dbg_main
%14 = OpVariable %4 Function %7
; CHECK: [[dbg_local_var:%\w+]] = OpExtInst %void [[ext:%\w+]] DebugLocalVariable
; CHECK: [[repl3:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl2:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl1:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: [[repl0:%\w+]] = OpVariable %_ptr_Function_uint Function
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl3]] [[deref_expr:%\w+]] %int_3
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl2]] [[deref_expr]] %int_2
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl1]] [[deref_expr]] %int_1
; CHECK: OpExtInst %void [[ext]] DebugValue [[dbg_local_var]] [[repl0]] [[deref_expr]] %int_0
OpBranch %20
%20 = OpLabel
%value = OpExtInst %1 %ext DebugDeclare %dbg_foo %14 %null_expr
%15 = OpInBoundsAccessChain %5 %14 %8
%16 = OpLoad %2 %15
%17 = OpAccessChain %5 %14 %10
%18 = OpLoad %2 %17
%19 = OpIAdd %2 %16 %18
OpReturnValue %19
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, ImageTexelPointer) {
// Test whether the scalar replacement correctly checks the
// OpImageTexelPointer user of an aggregate with an image type.
const std::string text = R"(
;
; CHECK: [[imgTy:%\w+]] = OpTypeImage %uint Buffer 2 0 0 2 R32ui
; CHECK: [[ptrImgTy:%\w+]] = OpTypePointer Function [[imgTy]]
; CHECK: [[img:%\w+]] = OpVariable [[ptrImgTy]] Function
; CHECK: [[imgTexelPtr:%\w+]] = OpImageTexelPointer {{%\w+}} [[img]] %uint_0 %uint_0
; CHECK: OpAtomicIAdd %uint [[imgTexelPtr]] %uint_1 %uint_0 %uint_1
;
OpCapability Shader
OpCapability SampledBuffer
OpCapability ImageBuffer
OpMemoryModel Logical GLSL450
OpEntryPoint GLCompute %1 "main"
OpExecutionMode %1 LocalSize 64 1 1
%void = OpTypeVoid
%uint = OpTypeInt 32 0
%uint_0 = OpConstant %uint 0
%uint_1 = OpConstant %uint 1
%_ptr_Image_uint = OpTypePointer Image %uint
%type_buffer_image = OpTypeImage %uint Buffer 2 0 0 2 R32ui
%_ptr_Function_type_buffer_image = OpTypePointer Function %type_buffer_image
%image_struct = OpTypeStruct %type_buffer_image %type_buffer_image
%_ptr_Function_image_struct = OpTypePointer Function %image_struct
%func = OpTypeFunction %void
%1 = OpFunction %void None %func
%2 = OpLabel
%3 = OpVariable %_ptr_Function_image_struct Function
%4 = OpAccessChain %_ptr_Function_type_buffer_image %3 %uint_1
%5 = OpImageTexelPointer %_ptr_Image_uint %4 %uint_0 %uint_0
%6 = OpAtomicIAdd %uint %5 %uint_1 %uint_0 %uint_1
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, false);
}
TEST_F(ScalarReplacementTest, FunctionDeclaration) {
// Make sure the pass works with a function declaration that is called.
const std::string text = R"(OpCapability Addresses
OpCapability Linkage
OpCapability Kernel
OpCapability Int8
%1 = OpExtInstImport "OpenCL.std"
OpMemoryModel Physical64 OpenCL
OpEntryPoint Kernel %2 "_Z23julia__1166_kernel_77094Bool"
OpExecutionMode %2 ContractionOff
OpSource Unknown 0
OpDecorate %3 LinkageAttributes "julia_error_7712" Import
%void = OpTypeVoid
%5 = OpTypeFunction %void
%3 = OpFunction %void None %5
OpFunctionEnd
%2 = OpFunction %void None %5
%6 = OpLabel
%7 = OpFunctionCall %void %3
OpReturn
OpFunctionEnd
)";
SinglePassRunAndCheck<ScalarReplacementPass>(text, text, false);
}
TEST_F(ScalarReplacementTest, UndefImageMember) {
// Test that scalar replacement creates an undef for a type that cannot have
// and OpConstantNull.
const std::string text = R"(
; CHECK: [[image_type:%\w+]] = OpTypeSampledImage {{%\w+}}
; CHECK: [[struct_type:%\w+]] = OpTypeStruct [[image_type]]
; CHECK: [[undef:%\w+]] = OpUndef [[image_type]]
; CHECK: {{%\w+}} = OpCompositeConstruct [[struct_type]] [[undef]]
OpCapability Shader
%1 = OpExtInstImport "GLSL.std.450"
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %2 "main"
OpExecutionMode %2 OriginUpperLeft
%void = OpTypeVoid
%4 = OpTypeFunction %void
%float = OpTypeFloat 32
%6 = OpTypeImage %float 2D 0 0 0 1 Unknown
%7 = OpTypeSampledImage %6
%_struct_8 = OpTypeStruct %7
%9 = OpTypeFunction %_struct_8
%10 = OpUndef %_struct_8
%_ptr_Function__struct_8 = OpTypePointer Function %_struct_8
%2 = OpFunction %void None %4
%11 = OpLabel
%16 = OpVariable %_ptr_Function__struct_8 Function
OpStore %16 %10
%12 = OpLoad %_struct_8 %16
OpReturn
OpFunctionEnd
)";
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
TEST_F(ScalarReplacementTest, RestrictPointer) {
// This test makes sure that a variable with the restrict pointer decoration
// is replaced, and that the pointer is applied to the new variable.
const std::string text = R"(
; CHECK: OpDecorate [[new_var:%\w+]] RestrictPointer
; CHECK: [[struct_type:%\w+]] = OpTypeStruct %int
; CHECK: [[ptr_type:%\w+]] = OpTypePointer PhysicalStorageBuffer [[struct_type]]
; CHECK: [[dup_struct_type:%\w+]] = OpTypeStruct %int
; CHECK: {{%\w+}} = OpTypePointer PhysicalStorageBuffer [[dup_struct_type]]
; CHECK: [[var_type:%\w+]] = OpTypePointer Function [[ptr_type]]
; CHECK: [[new_var]] = OpVariable [[var_type]] Function
OpCapability Shader
OpCapability PhysicalStorageBufferAddresses
%1 = OpExtInstImport "GLSL.std.450"
OpMemoryModel PhysicalStorageBuffer64 GLSL450
OpEntryPoint Fragment %2 "main"
OpExecutionMode %2 OriginUpperLeft
OpMemberDecorate %3 0 Offset 0
OpDecorate %3 Block
OpMemberDecorate %4 0 Offset 0
OpDecorate %4 Block
OpDecorate %5 RestrictPointer
%6 = OpTypeVoid
%7 = OpTypeFunction %6
%8 = OpTypeInt 32 1
%9 = OpConstant %8 0
%3 = OpTypeStruct %8
%10 = OpTypePointer PhysicalStorageBuffer %3
%11 = OpTypeStruct %10
%4 = OpTypeStruct %8
%12 = OpTypePointer PhysicalStorageBuffer %4
%13 = OpTypePointer Function %11
%14 = OpTypePointer Function %10
%15 = OpTypePointer Function %12
%16 = OpUndef %11
%2 = OpFunction %6 None %7
%17 = OpLabel
%5 = OpVariable %13 Function
OpStore %5 %16
%18 = OpAccessChain %14 %5 %9
OpReturn
OpFunctionEnd
)";
SetTargetEnv(SPV_ENV_UNIVERSAL_1_6);
SinglePassRunAndMatch<ScalarReplacementPass>(text, true);
}
} // namespace
} // namespace opt
} // namespace spvtools
```
|
```python
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing,
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# specific language governing permissions and limitations
# pylint: disable=no-else-return, unidiomatic-typecheck, invalid-name
import pytest
import tvm
from tvm import relay
def test_callgraph_construct():
mod = tvm.IRModule({})
x = relay.var("x", shape=(2, 3))
y = relay.var("y", shape=(2, 3))
mod["g1"] = relay.Function([x, y], x + y)
call_graph = relay.analysis.CallGraph(mod)
assert "g1" in str(call_graph)
tvm.ir.assert_structural_equal(mod, call_graph.module)
def test_print_element():
mod = tvm.IRModule({})
x0 = relay.var("x0", shape=(2, 3))
y0 = relay.var("y0", shape=(2, 3))
mod["g0"] = relay.Function([x0, y0], x0 + y0)
x1 = relay.var("x1", shape=(2, 3))
y1 = relay.var("y1", shape=(2, 3))
mod["g1"] = relay.Function([x1, y1], x1 - y1)
call_graph = relay.analysis.CallGraph(mod)
assert "#refs = 0" in str(call_graph.print_var("g0"))
assert "#refs = 0" in str(call_graph.print_var("g1"))
def test_global_call_count():
mod = tvm.IRModule({})
x0 = relay.var("x0", shape=(2, 3))
y0 = relay.var("y0", shape=(2, 3))
g0 = relay.GlobalVar("g0")
mod[g0] = relay.Function([x0, y0], x0 + y0)
x1 = relay.var("x1", shape=(2, 3))
y1 = relay.var("y1", shape=(2, 3))
g1 = relay.GlobalVar("g1")
mod[g1] = relay.Function([x1, y1], g0(x1, y1))
call_graph = relay.analysis.CallGraph(mod)
p0 = relay.var("p0", shape=(2, 3))
p1 = relay.var("p1", shape=(2, 3))
func = relay.Function([p0, p1], g0(p0, p1) * g1(p0, p1))
mod["main"] = func
call_graph = relay.analysis.CallGraph(mod)
assert call_graph.global_call_count(g0) == 0
assert call_graph.global_call_count(g1) == 1
assert call_graph.global_call_count("main") == 2
def test_ref_count():
mod = tvm.IRModule({})
x0 = relay.var("x0", shape=(2, 3))
y0 = relay.var("y0", shape=(2, 3))
g0 = relay.GlobalVar("g0")
mod[g0] = relay.Function([x0, y0], x0 + y0)
x1 = relay.var("x1", shape=(2, 3))
y1 = relay.var("y1", shape=(2, 3))
g1 = relay.GlobalVar("g1")
mod[g1] = relay.Function([x1, y1], x1 - y1)
call_graph = relay.analysis.CallGraph(mod)
p0 = relay.var("p0", shape=(2, 3))
p1 = relay.var("p1", shape=(2, 3))
func = relay.Function([p0, p1], g0(p0, p1) * g1(p0, p1))
mod["main"] = func
call_graph = relay.analysis.CallGraph(mod)
assert call_graph.ref_count(g0) == 1
assert call_graph.ref_count(g1) == 1
assert call_graph.ref_count("main") == 0
def test_nested_ref():
mod = tvm.IRModule({})
x0 = relay.var("x0", shape=(2, 3))
y0 = relay.var("y0", shape=(2, 3))
g0 = relay.GlobalVar("g0")
mod[g0] = relay.Function([x0, y0], x0 + y0)
x1 = relay.var("x1", shape=(2, 3))
y1 = relay.var("y1", shape=(2, 3))
g1 = relay.GlobalVar("g1")
mod[g1] = relay.Function([x1, y1], g0(x1, y1))
call_graph = relay.analysis.CallGraph(mod)
p0 = relay.var("p0", shape=(2, 3))
p1 = relay.var("p1", shape=(2, 3))
func = relay.Function([p0, p1], g0(p0, p1) * g1(p0, p1))
mod["main"] = func
call_graph = relay.analysis.CallGraph(mod)
assert call_graph.ref_count(g0) == 2
assert call_graph.ref_count(g1) == 1
assert call_graph.ref_count("main") == 0
def test_recursive_func():
mod = tvm.IRModule({})
x = relay.var("x", shape=[], dtype="int32")
fn0 = relay.Function([x], x)
gx = relay.GlobalVar("gx")
mod[gx] = fn0
sum_up = relay.GlobalVar("sum_up")
i = relay.var("i", shape=[], dtype="int32")
sb = relay.ScopeBuilder()
with sb.if_scope(relay.equal(i, relay.const(0, dtype="int32"))):
sb.ret(i)
with sb.else_scope():
one_less = relay.subtract(i, relay.const(1, dtype="int32"))
global_call = gx(i)
rec_call = relay.Call(sum_up, [one_less]) + global_call
sb.ret(relay.add(rec_call, i))
func = relay.Function([i], sb.get(), ret_type=relay.TensorType([], "int32"))
func = func.with_attr("Compiler", "a")
mod[sum_up] = func
iarg = relay.var("i", shape=[], dtype="int32")
mod["main"] = relay.Function([iarg], sum_up(iarg))
call_graph = relay.analysis.CallGraph(mod)
assert call_graph.is_recursive(sum_up)
assert call_graph.ref_count(sum_up) == 2
assert call_graph.ref_count(gx) == 1
assert call_graph.ref_count("main") == 0
if __name__ == "__main__":
tvm.testing.main()
```
|
Gianluigi Colalucci (24 December 1929 – 28 March 2021) was an Italian Master Restorer and academic most known for being the chief restorer of the Sistine Chapel in the Vatican City from 1980 to 1994.
Career
Colalucci graduated in the restoration of painting on wood, mural, and canvas, from the in 1953, where he was a pupil of Cesare Brandi.
Colalucci began working with the Vatican in 1960, and between 1980 and 1994 led the restoration of the Sistine Chapel frescoes, directing a team of twelve, and removing centuries of smoke, dust, glue, varnishes, and wine which had dulled the frescoes, as well as allowing art historians to visit the chapel during this work and observe the team's restoration technique. He initially faced opposition, with art historian James Beck describing the restoration as an "artistic Chernobyl", and with prominent artists including Andy Warhol, Robert Motherwell, George Segal, Robert Rauschenberg petitioning Pope John Paul II to pause the work; Colalucci said art scholars "preferred a brooding Michelangelo", and because of the restoration "there's a younger generation of art historians just waiting the interpret him differently".
The work included restoring Michelangelo's work The Last Judgment, and the vaulted Sistine Chapel ceiling also painted by Michelangelo. Additionally, loincloths and coverings painted over the initial work to cover nudity were removed, reverting part of what has been dubbed as the fig-leaf campaign. A year before his death, in an interview with the Vatican Museums he reflected on the risk of the restoration, saying "If these two brushstrokes get ruined while you are cleaning, you are lost. The painting is lost. We are all lost", saying he reflected on it before starting the restoration, "then I faced it", "it did not betray me".
The Vatican Museum attributed the current "dazzling splendour" of the works to Colalucci's restoration effort, and a Queen's Quarterly contributor suggested "every book on Michelangelo would now have to be rewritten" due to the vibrant colours and details that are now visible. In a New York Times obituary, Carmen C. Bambach, a curator at the Metropolitan Museum of Art and Renaissance scholar is quoted as saying, "It changed art history. All of a sudden there was a new Michelangelo."
For his work restoring the Sistine Chapel frescoes, in 1991 he was awarded the honorary degree Doctor Honoris Causa by New York University, and the same degree in 1995 by the Polytechnic University of Valencia. He was a consultant with the University of Lleida.
He retired from the Vatican Museums in 1995, a year after the restoration work had finished.
He wrote several books and articles on, as well as teaching about the restoration of frescoes. He restored works by Giotto in the Scrovegni Chapel, and the works of Raphael, Titian, and Buonamico Buffalmacco, among others. From 2009, he worked as a technical director of restoration with the Camposanto Monumentale di Pisa, including supervising works such as the restoration of The Triumph of Death by Buffalmacco, which was then re-located back to its original location.
Until recently before his death, he continued to give advice on restoration and conservation efforts relating to the Sistine Chapel, including the Room of Constantine.
Personal life
Colalucci was born in Rome, Italy, in 1929, being the son of a lawyer.
His wife Daniela is also a conservator, with one son having worked as a restorer and the other having a degree in Art History.
He had "heart ailments", and died on 28 March 2021 in Rome, Italy, at the age of 91.
He and his wife Daniela Bartoletti Colalucci had received a private tour of the Vatican Museums along with museums director Barbara Jatta "only a few days" before his death.
Selected works
References
Vatican Museums
1929 births
Conservator-restorers
2021 deaths
|
The Royal Order of Saint Hubert (), or sometimes () is a Roman Catholic dynastic order of knighthood founded in 1444 or 1445 by Gerhard VII, Duke of Jülich-Berg. He sought to commemorate his victory over the House of Egmond at the Battle of Linnich on 3 November, which is Saint Hubert's day.
The establishment of the Order occurred during a long-term, intermittent territorial dispute, initially between the Dukes of Jülich and the Dukes of Guelders, who were descended from a female line of the House of Jülich. The dispute began in the 1430s, when Arnold, Duke of Gelderland claimed the duchy of Jülich and the county of Ravensberg, and was resolved in the 1614 Treaty of Xanten, which established the United Duchies of Jülich-Cleves-Berg of the counties of Ravensberg and Mark with the duchies of Cleves, Jülich and Berg. In 1778, Charles Theodore, Duke of Jülich and Berg and the Count-Elector Palatine, succeeded his childless cousin, Maximilian III Joseph, Elector of Bavaria and brought the Order to Bavaria.
Initially, the order was open to men and women, although limiting the number of male companions to sixty. It commemorated the conversion of Saint Hubert and his standing as the patron saint of hunters and knights. Over time, the award had other uses as a reward for loyalty to the monarch and service to the princely state.
History
Foundation
Sources agree that the Order of Saint Hubert honors a military victory of the Duke of Jülich, on Saint Hubert's day, 3 November 1444. Sources differ on the specific date of establishment of the Order, whether it celebrated the victory at the Battle of Linnich between Gebhard V of Jülich and Arnold of Egmont (or Egmond), or commemorated the battle at a future date. Consequently, the date of the founding depends on the source. Still other sources date the founding of the Order as late as 1473 or 1475.
Twentieth century investigation has helped to clear up some of the confusion. The original Latin statutes of the foundation use Good Friday, in this case 26 March 1445. Furthermore, there is clear written evidence that the Order existed prior to March 1445: The original German statutes were dated immediately after the battle. It is also possible that Gerhard proclaimed the establishment of the Order immediately after the victory of his knights at Linnich, but the documents were not drawn up until later, leading to discrepancy in the dates of 1444 or 1445. To further obfuscate the date of founding, Gerhard's son, William III, renewed the Order upon his own succession to the ducal dignities in 1475, in the so-called New Statutes, which were prepared in Latin and German. These remained the governing documents of the Order until 1708. In this confirmation probably lies the root of confusion over the date of the Order's foundation.
Initially the Order was a knightly brotherhood (Rittersbruderschaft), reflecting the overlapping religious and military aspects of medieval court life. Saint Hubert was the patron saint of hunters and knights. The founding of the Order of the Golden Fleece in the early 15th century started a trend in confraternal princely orders. The purpose of these, whether established by monarchs or princes, was to foster loyalty to a sovereign, replacing to the old Chivalric orders developed in the Crusades. Although some historians classify the Order of the Saint Hubert as a confraternal order, during its 600-year-life, its purpose changed as the fortunes and needs of the Dukes of Jülich and Berg and their successors changed.
Order under the House of Jülich
When Reinhold IV, Duke of Gelder, died in 1423, his nephew Arnold inherited the dukedom. Arnold's cousin, Adolf of Berg, inherited territories near Liège. Arnold believed that Adolf had inherited the better of the two properties, and coveted it for himself. He tried to take it by force and failed; a compromise was reached by which the two agreed to a truce. Adolf of Berg died in 1437 and his cousin, Gerhard IV, the Duke of Jülich and Count of Ravensburg (Westphalia), inherited both the Liège properties and the Duchy of Berg. Arnold reasserted his old claim, maintaining that the truce to which he and Adolf agreed was no longer valid, and prepared to take the duchies by force. Confident in his right to the inheritance, Gerhard met Arnold in battle, at the village of Linnich, in the county of Ravensburg (Westphalia). He and his knights defeated Arnold and his knights on Saint Hubert's day in 1444. In celebration, Gerhard declared the founding of the Order, to reward his loyal and victorious knights.
The Order remained in collateral branches of the family of the Dukes of Jülich and Berg until 1521, when the male line holding the two duchies and the county of Ravensberg became extinct. A daughter, Maria von Geldern, remained to inherit the duchies and the county, but, under the Salic law practiced in the northwestern German states, women could only hold property through a husband or guardian. Consequently, the territories passed to her husband—who was also her distant relative—John III, Duke of Cleves and Mark. The couple had three daughters, one of whom, Ann of Cleves, married Henry VIII of England in 1540, and one son, Wilhelm, who subsequently inherited the duchies and the administration of the Order. The duchies included most of the present-day North Rhine-Westphalia that lay outside the ecclesiastical territories of the Electorate of Cologne and Münster. Wilhelm was known as Wilhelm the Rich.
Order under the House of Wittelsbach-Palatine
In March 1609, Duke John William of Jülich-Cleves-Berg died childless. Both Duke Wolfgang William of Palatinate-Neuberg and Elector John Sigismund of Brandenburg claimed the territories. In the subsequent succession chaos, the Order fell into disuse. By the late 17th century, the Duchy of Jülich passed into the jurisdiction of the Prince-Elector Johann Wilhelm, Duke of Neuberg, who descended from a cadet branch of the Palatine line of the House of Wittelsbach. In May 1708, he restored the Order of Saint Hubert and assumed the position of grand master for himself. To reward loyalty and service, he conferred the cross of the Order on several of his courtiers. He also gave the recipients generous pensions on the condition that a tenth be set aside for the poor, and a significant sum be distributed on the day of their reception into the order.
In 1777, the death of Maximilian III Joseph of Bavaria without a legitimate male heir ended the main line of Wittelsbach; after the War of the Bavarian Succession, a brief and relatively bloodless contest, Charles Theodore inherited his cousin's dignities. The Order moved with the new Elector to Bavaria, where it eventually was confirmed again on 30 March 1800 by Maximilian IV, Elector of Bavaria. In the French Revolutionary and Napoleonic wars, the Order functioned primarily as a military order, similar to the Military Order of Maria Theresa or the Order of Leopold. The present head of the House of Wittelsbach, Franz Bonaventura Adalbert Maria, Duke of Bavaria, is the current Grand Master of the order.
Structure and requirements
Initially, hierarchy of membership was relatively flat. The statutes called for a grand master, in this case the Duke of Jülich, four masters, and a provost, or arms master. Of the four masters, two were required to be representative of families of the Duchies of Jülich or Berg; the origins of the others had no geographic limitations. The masters were the clearing house for membership; they investigated the admission of new members and any alleged infractions by the existing membership. The Provost, a weapons master, maintained the weapons and arms of the brotherhood, and himself wore a special medallion.
The Order was open to men and women, and both genders were entitled companions. Until 1476, there were no limits on the number of companions to be admitted, but that year, with the new edition of the Order's statutes, the Duke limited the number of men to 60; unlimited women could be admitted. The editions of the Order's statutes, two in Latin and two in German, established similar requirements for membership. The Latin editions stipulated that the man be of noble birth—eight generations of noble grandparents—and of unblemished reputation; the German versions required that only four grandparents of the man be noble. Women were to be spouses of a companion; in the 1476 versions of the statutes, both Latin and German, female members of the Duchess' household could be admitted even if their husbands were not members or if the women were single, but were required to resign if they left the service of the Duchess. The exception to this clause provided for their continued membership if their husbands became companions of the order.
Restructuring under Maximilian Joseph IV
In confirming the Order, on 18 May 1808, the King of Bavaria declared the Order to be the first in the kingdom and linked it to the Order of Civic of Merit. He limited membership to twelve knights from the ranks of counts and barons, excluding himself, as grandmaster, and members (native and foreign), who may be nominated by the sovereign. Entrance fees were 200 gold ducats for princes. Those under the rank of prince paid an entrance fee of 100 silver ducats, which amounted to 120 Reichsthaler; the silver Reichsthaler was 29.44g of .989 fineness. He also established a dress costume for festival days, which included not only the insignia of the Order, but a black collar with a sash, narrow, short breeches with poppy-colored garters and bows, a short black cape, a sword, and a plumed hat. Ludwig II was laid in state and was buried in this apparel.
Collars, Badges and Stars
The gold-enameled cross lies in a white field, and surmounted by a crown; on one side is represented the conversion of Saint Hubert, with the legend In trau vast (firm in fidelity) in Gothic letters. On the reverse, lies the imperial orb and the Latin inscription "In memoriam recuperatæ dignitatis a vitæ 1708" ("In remembrance of the restoration of the original dignity, 1708"). Originally, it consisted of a collar and a pendant jewel. The Jülich collar consisted of stylized horns (six for men, four for women), intertwined with a cloud-like figure eight. The jewel depicted a relief of the conversion of Saint Hubert. Its overall design alluded to the Saint as the patron of hunters, and thus the patron of knights. The great cross was only worn on special days; on all other days, a smaller cross must be worn, and the member was fined 20 thalers for any and each omission). The smaller cross was decorated appropriately for its size.
The collar of the Order under the Wittelsbach dynasty consisted of forty-four gold links, twenty-two of which consisted of a rectangular representation of the conversion of Saint Hubert in open relief surrounded by a gold and white enamel frame. These alternated with twenty-two other links consisted of the intertwined initial letters of the motto In trau vast, (firm in fidelity), i.e., I, T and V in Gothic letters radiating small golden rays, each of these links being alternatively enameled red or green. From the center rectangular link hung a white enameled Maltese cross, each arm strewn with numerous small golden flames and each point of the cross was tipped with a small gold ball. Between each arm of this cross were five straight gold rays and in the center of the cross was a round medallion bearing a golden representation in relief of the conversion of Saint Hubert against a green enamel background. The reverse of this cross bore the same design with this same representation but against a red enamel background.
The sash of the Order was poppy red moire with narrow green borders, but under the knot, at the ends of this sash, these green borders as well as the ends of the sash were covered with gold metallic ribbon. Like the sash of the Order of the Garter this sash was worn from the left shoulder to the right hip. The cross worn with this sash was a Maltese cross with narrow arms also enameled white strewn with numerous golden flames, with three straight rays between each arm, each point of the cross being tipped with a small gold ball. Between the two gold balls on the top arm of the cross was a three-dimensional gold representation of the Bavarian crown, by which the cross hung from its sash. In the center of the cross was a large round medallion consisting of a small golden representation of the conversion of Saint Hubert against a green enamel background and surrounded by a wide border in red enamel with the motto the order In trau vast in Gothic letters set with small diamonds. On the reverse, in the center of the cross was a golden representation in relief of the imperial orb and cross (i.e., the heraldic symbol of the Prince-Elector as the Arch-Steward of the Holy Roman Empire) against a red enamel background and surrounded with a white enamel scroll-like border with the inscription "In memoriam recuperatae dignitatis aviate. 1708" ("In remembrance of the restoration of the original dignity, 1708"). The star of the order, worn on the left breast, was a radiant silver star of eight points surrounding a gold,
white enameled cross pattée strewn with golden flames and with a round poppy red enameled central medallion bearing the motto In trau vast in golden Gothic letters and surrounded by a white enameled and gold border.
Partial list of recipients
Recipients in Austrian Service
These recipients of the Order of Saint Hubert attained the rank of General in Austrian military service during the French Revolutionary and Napoleonic Wars.
August Maria Raimund Prinz und Herzog von Arenberg, Graf von der Marck (1753–1833)
Karl Joseph Franz, Graf u. Prinz von Auersperg ( –1800)
Wilhelm Ignaz Cajetan, Prince von Auersperg (1749–1822)
Heinrich, Count von Bellegarde (1756–1845)
Anton (Antal), Fürst Esterházy de Galántha (1738–1794)
Nikolaus II, Fürst Esterházy de Galántha (1765–1833)
Nikolaus IV. Ferdinand Franz Fürst Esterházy de Galántha(-Edelstetten) (1765–1833)
Karl Aloys zu Fürstenberg (1760–1799)
George IV of the United Kingdom (1762–1830)
Louis Aloysius, Prince of Hohenlohe-Waldenburg-Bartenstein (1765–1829)
Friedrich Karl Wilhelm, Prince Hohenlohe-Ingelfingen (1752–1816)
Karl Wilhelm Georg, Landgraf zu Hessen-Darmstadt (1757–1795)
Friedrich (VI) Joseph Ludwig, Prince of Hessen-Homburg (1769–1829)
Karl Emanuel, Landgraf zu Hessen-Rheinfels-Rothenburg (1746–1812)
Archduke Charles, Duke of Teschen (1771–1847)
Francis IV, Duke of Modena (1779–1846)
Archduke John of Austria (1782–1859)
Archduke Louis of Austria (1784–1864)
Joseph Radetzky von Radetz (1766–1858)
Heinrich XV. Fürst zu Reuss-Plauen (1751–1825)
Karl Philipp Fürst zu Schwarzenberg (1771–1820)
Franz de Paula Fürst von Sulkowski, Herzog von Bielitz (1733–1812)
Alexander Suvorov (1729–1800)
Maximilian Joseph Fürst von Thurn und Taxis (1769–1831)
Christian August Prinz zu Waldeck und Pyrmont (1744–1798)
George I, Prince of Waldeck and Pyrmont (1747–1813)
Diplomats
Alexander Kurakin (1752–1818)
French recipients
Napoleon (1769–1821)
Eugène de Beauharnais (1781–1824)
Armand Augustin Louis de Caulaincourt (1773–1827)
André Masséna (1758–1817)
Nicolas Soult (1769–1851)
Henri Jacques Guillaume Clarke (1765–1818)
Georges Mouton (1770–1838)
Belgian Knights of Saint Hubert
King Leopold II
Prince Charles, Count of Flanders
King Albert I, Wedding gift in 1900
Post Napoleonic Recipients
Prince Franz Maria Luitpold of Bavaria (1875–1957).
Prince Arthur of Connaught (1883–1938)
Ernest Augustus, Duke of Brunswick (1887–1953)
Grandmasters of the Order
Compiled from various sources.<ref>Robert Beatson. A Political Index to the Histories ..." London: Longman, Hurst, Rees, and Orme, 1806, pp. 488–489. Frederick Martin et al., "Bavaria." The Statesman's year-book. London [etc.] Palgrave [etc.], 1877, pp 130–132. Thomas Henry Dyer. Modern Europe from the fall of Constantinople to the establishment of the German Empire, A.D. 1453–1871. London, G. Bell & Sons, 1877, Chapter 29.</ref>
Gerhard VII, Duke of Jülich-Berg (1445-1475)
William IV, Duke of Jülich-Berg (1475-1511)
John III, Duke of Cleves (1511–1538)
Wilhelm, Duke of Jülich-Cleves-Berg (1538–1592)
John William, Duke of Jülich-Cleves-Berg (1592–1609)
(Order unused until reinstated in 1708)
Johann Wilhelm, Elector Palatine (1708–1716)
Charles III Philip, Elector Palatine (1716–1742)
Charles Theodore, Elector of Bavaria (1742–1799)
Maximilian I Joseph of Bavaria (1799–1825)
Ludwig I of Bavaria (1825–1848)
Maximilian II of Bavaria (1848–1864)
Ludwig II of Bavaria (1864–1886)
Otto, King of Bavaria (1886–1916)
Ludwig III of Bavaria (1916–1921)
Rupprecht, Crown Prince of Bavaria (1921–1955)
Albrecht, Duke of Bavaria (1955–1996)
Franz, Duke of Bavaria (1996-present)
Sources
Notes
Citations
Bibliography
Beatson, Robert. A Political Index to the Histories ..." London: Longman, Hurst, Rees, and Orme, 1806.
Boulton, D'Arcy Jonathan Dacre. The Knights of the Crown : the monarchical orders of knighthood in later medieval Europe 1325–1520. Woodbridge: Boydell, 1987, , p. 604.
Burke, John Bernard. Book of Orders of Knighthood and Decorations of Honour of all Nations. London: Hurst and Blackett, 1858.
Burke, John Bernard. Burke's Peerage. London: Burke's Peerage Ltd, 1914.
Butler, Alban. The lives of the fathers, martyrs, and other principal saints. Dublin: James Duffy, 1866.
Chisholm, Hugh. "Knighthood: Orders of Knighthood (Bavaria)." Encyclopædia Britannica. New York, The Encyclopædia Britannica Co., 1910–11. Volume 15.
Coby, Patrick. Thomas Cromwell: Machiavellian statecraft and the English Reformation. Lanham: Lexington Books, 2009. .
" Decorations and Awards: Bavaria.". Napoleon Series. Robert Burnham, Editor in Chief. Accessed 17 March 2010.
Dyer, Thomas Henry . Modern Europe from the fall of Constantinople to the establishment of the German Empire, A.D. 1453–1871. London, G. Bell & Sons, 1877.
Emedals Catalog. Bavarian House and Knightly Orders. See item GST757. Burlington Ontario, Canada. Accessed 17 March 2010.
Guthrie, William, John Knox and James Ferguson. A new geographical, historical, and commercial grammar... London: Vernon & Hood [etc., etc.] 1801.
Henderson, Ernest Flagg. A short history of Germany (volume 2). New York: Macmillan, 1917,
Israel, Jonathan Irvine. Conflicts of Empires: Spain, the Low countries and the struggle for world supremacy, 1585–1713. London: Hambledon Press, 1997, .
Jensen, Nathan D. Georges Mouton Virtual Arc d Triumphe. 2005-2009 Accessed 17 March 2010.
Martin, Frederick et al., "Bavaria." The Statesman's year-book. London [etc.] Palgrave [etc.], 1877.
McIntosh, Christopher. The Swan King: Ludwig II of Bavaria. London: Tauris, 2000, .
Reichard, M. Itinerary of Germany, or A Traveller's Guide. London: Leigh, 1819.
Rudge, F.M. "Military Orders of St. Hubert." The Catholic Encyclopedia. Vol. 7. New York: Robert Appleton Company, 1910. 20 January 2010.
Sainty, Guy Stair (editor), and Rafal Heydel-Mankoo (deputy editor). World Orders of Knighthood & Merit. Burke's Peerage, 2006. .
Smith, Digby, and Leopold Kudrna (compilers). A biographical dictionary of all Austrian Generals in the French Revolutionary and Napoleonic Wars, 1792–1815. The Napoleon Series, Robert Burnham, editor in chief. April 2008 version. Accessed 23 February 2010.
Tagore, Sourindro Mohun. The orders of knighthood, British and foreign, with a brief review of the titles of rank and merit in ancient Hindusthan. Calcutta, 1884.
Velde, François. Essay and Heradica. Heraldica. 12 March 2006. Accessed 16 February 2010.
Wilhelm, Thomas. "Hubert, St. Order of." A military dictionary and gazetteer. Philadelphia: L.R. Hamersly & Co., 1881.
1444 establishments in Europe
1440s establishments in the Holy Roman Empire
|
Albigence Waldo Putnam (born in Marietta, Ohio, 11 March 1799; died in Nashville, Tennessee, 20 January 1869) was a United States lawyer and historian.
Biography
He studied law, practised in Mississippi, and in 1836 settled in Nashville, Tennessee, and was president of the Tennessee Historical Society, to whose publications he was a contributor. In addition to articles in periodicals, he wrote:
History of Middle Tennessee (Nashville, 1859)
Life and Times of Gen. James Robertson (1859)
“Life of Gen. John Sevier,” in Wheeler's History of North Carolina
Notes
References
1799 births
1869 deaths
American historians
People from Nashville, Tennessee
Albigence Waldo
|
```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.mode.manager.cluster.workerid;
import com.google.common.base.Preconditions;
import lombok.extern.slf4j.Slf4j;
import org.apache.shardingsphere.infra.exception.core.ShardingSpherePreconditions;
import org.apache.shardingsphere.infra.instance.workerid.WorkerIdAssignedException;
import org.apache.shardingsphere.infra.instance.workerid.WorkerIdGenerator;
import org.apache.shardingsphere.mode.manager.cluster.persist.ReservationPersistService;
import org.apache.shardingsphere.mode.persist.service.ComputeNodePersistService;
import org.apache.shardingsphere.mode.repository.cluster.ClusterPersistRepository;
import java.util.Collection;
import java.util.Optional;
import java.util.PriorityQueue;
import java.util.Properties;
import java.util.concurrent.atomic.AtomicBoolean;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
/**
* Worker ID generator for cluster mode.
*/
@Slf4j
public final class ClusterWorkerIdGenerator implements WorkerIdGenerator {
private final String instanceId;
private final ComputeNodePersistService computeNodePersistService;
private final ReservationPersistService reservationPersistService;
private final AtomicBoolean isWarned = new AtomicBoolean(false);
public ClusterWorkerIdGenerator(final ClusterPersistRepository repository, final String instanceId) {
this.instanceId = instanceId;
computeNodePersistService = new ComputeNodePersistService(repository);
reservationPersistService = new ReservationPersistService(repository);
}
@Override
public int generate(final Properties props) {
int result = loadExistedWorkerId().orElseGet(this::generateNewWorkerId);
logWarning(result, props);
return result;
}
private Optional<Integer> loadExistedWorkerId() {
return computeNodePersistService.loadInstanceWorkerId(instanceId);
}
private int generateNewWorkerId() {
Optional<Integer> generatedWorkId;
do {
generatedWorkId = generateAvailableWorkerId();
} while (!generatedWorkId.isPresent());
int result = generatedWorkId.get();
computeNodePersistService.persistInstanceWorkerId(instanceId, result);
return result;
}
private Optional<Integer> generateAvailableWorkerId() {
Collection<Integer> assignedWorkerIds = computeNodePersistService.getAssignedWorkerIds();
ShardingSpherePreconditions.checkState(assignedWorkerIds.size() <= MAX_WORKER_ID + 1, WorkerIdAssignedException::new);
PriorityQueue<Integer> availableWorkerIds = IntStream.range(0, 1024).boxed().filter(each -> !assignedWorkerIds.contains(each)).collect(Collectors.toCollection(PriorityQueue::new));
Integer preselectedWorkerId = availableWorkerIds.poll();
Preconditions.checkNotNull(preselectedWorkerId, "Preselected worker-id can not be null.");
return reservationPersistService.reserveWorkerId(preselectedWorkerId, instanceId);
}
private void logWarning(final int generatedWorkerId, final Properties props) {
if (!isWarned.get() && props.containsKey(WORKER_ID_KEY)) {
isWarned.set(true);
log.warn("It is unnecessary to configure {} in cluster mode, system assigned {} was {}", WORKER_ID_KEY, WORKER_ID_KEY, generatedWorkerId);
}
}
}
```
|
Vedea can refer to:
Vedea, a river of Romania
Vedea, Teleorman, a commune in Romania
Vedea, Giurgiu, a commune in Romania
Vedea (programming language), a visualization programming language from Microsoft
|
```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 main
import (
"go.universe.tf/netboot/out/ipxe"
"go.universe.tf/netboot/pixiecore"
"go.universe.tf/netboot/pixiecore/cli"
)
func main() {
cli.Ipxe[pixiecore.FirmwareX86PC] = ipxe.MustAsset("third_party/ipxe/src/bin/undionly.kpxe")
cli.Ipxe[pixiecore.FirmwareEFI32] = ipxe.MustAsset("third_party/ipxe/src/bin-i386-efi/ipxe.efi")
cli.Ipxe[pixiecore.FirmwareEFI64] = ipxe.MustAsset("third_party/ipxe/src/bin-x86_64-efi/ipxe.efi")
cli.Ipxe[pixiecore.FirmwareEFIBC] = ipxe.MustAsset("third_party/ipxe/src/bin-x86_64-efi/ipxe.efi")
cli.Ipxe[pixiecore.FirmwareX86Ipxe] = ipxe.MustAsset("third_party/ipxe/src/bin/ipxe.pxe")
cli.CLI()
}
```
|
Malacoscylus elegantulus is a species of beetle in the family Cerambycidae. It was described by Galileo and Martins in 2005. It is known from Peru.
References
Hemilophini
Beetles described in 2005
|
```css
Making shapes with `transform`
Manipulating shapes using CSS: `shape-outside`
Manipulating shapes using CSS: `clip-path`
Declaring linear gradients using the `background` property
Use the `box-shadow` property to create shadow effects on an element
```
|
Mahlon Dickerson (1770–1853) was a U.S. Senator from New Jersey. Senator Dickerson may also refer to:
Steven Dickerson (fl. 2010s), Tennessee State Senate
Tommy Dickerson (born 1945), Mississippi State Senate
|
```c
/*
*
*/
#include <stdio.h>
#include <sys/utsname.h>
int main(void)
{
struct utsname info;
uname(&info);
printf("\nPrinting everything in utsname...\n");
printf("sysname[%zu]: %s\n", sizeof(info.sysname), info.sysname);
printf("nodename[%zu]: %s\n", sizeof(info.nodename), info.nodename);
printf("release[%zu]: %s\n", sizeof(info.release), info.release);
printf("version[%zu]: %s\n", sizeof(info.version), info.version);
printf("machine[%zu]: %s\n", sizeof(info.machine), info.machine);
return 0;
}
```
|
```go
package trafficstats
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
import (
"encoding/json"
"errors"
"fmt"
"net/http"
"github.com/apache/trafficcontrol/v8/traffic_ops/traffic_ops_golang/dbhelpers"
"github.com/apache/trafficcontrol/v8/lib/go-rfc"
"github.com/apache/trafficcontrol/v8/lib/go-tc"
"github.com/apache/trafficcontrol/v8/traffic_ops/traffic_ops_golang/api"
influx "github.com/influxdata/influxdb/client/v2"
)
var (
cMetricTypes = map[string]interface{}{
"maxkbps": struct{}{},
"connections": struct{}{},
"bandwidth": struct{}{},
}
)
const (
cSummaryQuery = `
SELECT mean(value) AS "average",
percentile(value, 5) AS "fifthPercentile",
percentile(value, 95) AS "ninetyFifthPercentile",
percentile(value, 98) AS "ninetyEighthPercentile",
min(value) AS "min",
max(value) AS "max",
count(value) AS "count"
FROM "%s"."monthly"."%s.cdn.1min"
WHERE cdn = $cdn_name
AND time < $end
AND time > $start`
cSeriesQuery = `
SELECT sum(value)/count(value)
FROM "%s"."monthly"."%s.cdn.1min"
WHERE cdn = $cdn_name
AND time > $start
AND time < $end
GROUP BY time(%s, %s), cdn%s`
)
func cacheConfigFromRequest(r *http.Request, i *api.Info) (tc.TrafficCacheStatsConfig, int, error) {
c := tc.TrafficCacheStatsConfig{}
statsConfig, rc, e := tsConfigFromRequest(r, i)
if e != nil {
return c, rc, e
}
c.TrafficStatsConfig = statsConfig
c.MetricType = i.Params["metricType"]
if _, ok := cMetricTypes[c.MetricType]; !ok {
e = fmt.Errorf("Unknown metric type: %s", c.MetricType)
return c, http.StatusBadRequest, e
}
var ok bool
if c.CDN, ok = i.Params["cdnName"]; !ok {
e = errors.New("you must specify cdnName")
return c, http.StatusBadRequest, e
}
return c, http.StatusOK, nil
}
// GetCacheStats handler for getting cache stats
func GetCacheStats(w http.ResponseWriter, r *http.Request) {
// Perl didn't require "interval", but it would only return summary data if it was not given
inf, userErr, sysErr, errCode := api.NewInfo(r, []string{"metricType", "startDate", "endDate", "cdnName"}, nil)
tx := inf.Tx.Tx
if userErr != nil || sysErr != nil {
api.HandleErr(w, r, tx, errCode, userErr, sysErr)
return
}
defer inf.Close()
var c tc.TrafficCacheStatsConfig
if c, errCode, userErr = cacheConfigFromRequest(r, inf); userErr != nil {
sysErr = fmt.Errorf("Unable to process cache_stats request: %v", userErr)
api.HandleErr(w, r, tx, errCode, userErr, sysErr)
return
}
exists, err := dbhelpers.CDNExists(c.CDN, tx)
if err != nil {
api.HandleErr(w, r, tx, http.StatusInternalServerError, nil, err)
return
} else if !exists {
userErr = fmt.Errorf("no such CDN: %s", c.CDN)
api.HandleErr(w, r, tx, http.StatusNotFound, userErr, nil)
return
}
client, err := inf.CreateInfluxClient()
if err != nil {
api.HandleErr(w, r, tx, http.StatusInternalServerError, nil, err)
return
} else if client == nil {
sysErr = errors.New("Traffic Stats is not configured, but Cache stats were requested")
api.HandleErr(w, r, tx, http.StatusInternalServerError, nil, sysErr)
return
}
defer (*client).Close()
resp := struct {
Response tc.TrafficStatsResponse `json:"response"`
}{
Response: tc.TrafficStatsResponse{
Series: nil,
Summary: nil,
},
}
if !c.ExcludeSummary {
summary, err := getCacheSummary(client, &c, inf.Config.ConfigInflux.CacheDBName)
if err != nil {
sysErr = fmt.Errorf("Getting summary response from Influx: %v", err)
api.HandleErr(w, r, tx, http.StatusInternalServerError, nil, sysErr)
return
}
// match Perl implementation and set summary to zero values if no data
if summary != nil {
resp.Response.Summary = summary
} else {
resp.Response.Summary = &tc.TrafficStatsSummary{}
}
}
if !c.ExcludeSeries {
series, err := getCacheSeries(client, &c, inf.Config.ConfigInflux.CacheDBName)
if err != nil {
sysErr = fmt.Errorf("Getting summary response from Influx: %v", err)
api.HandleErr(w, r, tx, http.StatusInternalServerError, nil, sysErr)
return
}
// match Perl implementation and omit series if no data
if series != nil {
if !c.Unix {
series.FormatTimestamps()
}
resp.Response.Series = series
}
}
respBts, err := json.Marshal(resp)
if err != nil {
sysErr = fmt.Errorf("Marshalling response: %v", err)
errCode = http.StatusInternalServerError
api.HandleErr(w, r, tx, errCode, nil, sysErr)
return
}
if c.Unix {
w.Header().Set(rfc.ContentType, jsonWithUnixTimestamps.String())
} else {
w.Header().Set(rfc.ContentType, jsonWithRFCTimestamps.String())
}
w.Header().Set(http.CanonicalHeaderKey("vary"), http.CanonicalHeaderKey("Accept"))
api.WriteAndLogErr(w, r, append(respBts, '\n'))
}
func getCacheSummary(client *influx.Client, conf *tc.TrafficCacheStatsConfig, db string) (*tc.TrafficStatsSummary, error) {
qStr := fmt.Sprintf(cSummaryQuery, db, conf.MetricType)
q := influx.NewQueryWithParameters(qStr,
db,
"rfc3339",
map[string]interface{}{
"cdn_name": conf.CDN,
"start": conf.Start,
"end": conf.End,
})
return getSummary(db, q, client)
}
func getCacheSeries(client *influx.Client, conf *tc.TrafficCacheStatsConfig, db string) (*tc.TrafficStatsSeries, error) {
extraClauses := buildExtraClauses(&conf.TrafficStatsConfig)
qStr := fmt.Sprintf(cSeriesQuery, db, conf.MetricType, conf.Interval, conf.TrafficStatsConfig.OffsetString(), extraClauses)
q := influx.NewQueryWithParameters(qStr,
db,
"rfc3339",
map[string]interface{}{
"cdn_name": conf.CDN,
"start": conf.Start,
"end": conf.End,
})
return getSeries(db, q, client)
}
```
|
Conus betulinus, common name the betuline cone, is a species of sea snail, a marine gastropod mollusk in the family Conidae, the cone snails and their allies.
These snails are predatory and venomous. They are capable of "stinging" humans.
Description
The size of the shell varies between 40 mm and 170 mm. The color of the shell is yellow orange-brown, or white, with revolving series of spots, and short lines of chocolate upon narrow white bands. The spire is radiated with chocolate. The base of the shell is strongly grooved.
Distribution
This marine species occurs off
Aldabra
Chagos
Madagascar
Mascarene Basin
Mauritius
Mozambique
Seychelles
Tanzania
Also off Indo-China, Indo-Malaysia, Philippines, New Caledonia,
Solomon Islands and Queensland, Australia.
References
Linnaeus, C. (1758). Systema Naturae per regna tria naturae, secundum classes, ordines, genera, species, cum characteribus, differentiis, synonymis, locis. Editio decima, reformata. Laurentius Salvius: Holmiae. ii, 824 pp
Röding, P.F. 1798. Museum Boltenianum sive Catalogus cimeliorum e tribus regnis naturae quae olim collegerat Joa. Hamburg : Trappii 199 pp
Reeve, L.A. 1843. Monograph of the genus Conus. pls 1–39 in Reeve, L.A. (ed.). Conchologica Iconica. London : L. Reeve & Co. Vol. 1.
Smith, E.A. 1891. On a collection of marine shells from Aden, with some remarks upon the relationship of the Molluscan Fauna of the Red Sea and the Mediterranean. Proceedings of the Zoological Society of London 1891(3): 390–436
Oostingh, C.H. 1925. Report on a collection of recent shells from Obi and Halmahera, Molluccas. Mededeelingen van de Landbouwhoogeschool te Wageningen 29(1): 1–362
Dautzenberg, P. 1937. Gastéropodes marins. 3-Famille Conidae'; Résultats Scientifiques du Voyage aux Indes Orientales Néerlandaises de LL. AA. RR. Le Prince et la Princesse Lé Belgique. Mémoires du Musée Royal d'Histoire Naturelle de Belgique 2(18): 284 pp, 3 pls
Salvat, B. & Rives, C. 1975. Coquillages de Polynésie. Tahiti : Papeete les editions du pacifique, pp. 1–391.
Cernohorsky, W.O. 1978. Tropical Pacific marine shells. Sydney : Pacific Publications 352 pp., 68 pls.
Petuch, E.J. 1979. Twelve new Indo-Pacific gastropods. Nemouria 23: 1–20
Wilson, B.R. & Gillett, K. 1971. Australian Shells: illustrating and describing 600 species of marine gastropods found in Australian waters. Sydney : Reed Books 168 pp.
Wilson, B. 1994. Australian Marine Shells. Prosobranch Gastropods. Kallaroo, WA : Odyssey Publishing Vol. 2 370 pp.
Röckel, D., Korn, W. & Kohn, A.J. 1995. Manual of the Living Conidae. Volume 1: Indo-Pacific Region. Wiesbaden : Hemmen 517 pp.
Puillandre N., Duda T.F., Meyer C., Olivera B.M. & Bouchet P. (2015). One, four or 100 genera? A new classification of the cone snails. Journal of Molluscan Studies. 81: 1–23
External links
The Conus Biodiversity website
Cone Shells – Knights of the Sea
betulinus
Molluscs of the Indian Ocean
Molluscs of the Pacific Ocean
Gastropods of Africa
Gastropods of Asia
Marine molluscs of Asia
Least concern biota of Asia
Gastropods described in 1758
Taxa named by Carl Linnaeus
|
Healy is a census-designated place (CDP) and the borough seat of Denali Borough in the U.S. state of Alaska. The population was 966 at the time of the 2020 census, down from 1,021 in 2010.
History
The history of Healy is intertwined with that of coal mining and construction of the Alaska Railroad, which both began in the area in 1918 and 1919 respectively.
Healy was originally named Healy Fork after the Healy River. The Healy River was named after Capt. John J. Healy, manager of the North American Trading and Transportation Company.
Geography
Healy is located at (63.970833, -149.126944). The George Parks Highway (Alaska Route 3) runs through the community, leading south to Denali Park and north to Nenana.
According to the United States Census Bureau, the Healy CDP has a total area of , of which is land and , or 0.03%, is water. By area, it is the second-largest CDP in the United States, exceeded by only Willow, Alaska.
Climate
As is typical of the Alaska Interior, Healy experiences a subarctic climate (Köppen Dfc) with very long, bitterly cold winters and short, warm summers, and straddles the border between USDA Plant Hardiness Zone 2 and 3, indicating the coldest temperature of the year is typically around . Average temperatures are below freezing from early October to mid-April, though occasionally chinook winds will push temperatures up to even in the depths of winter.
Economy
Usibelli Coal Mine, Golden Valley Electric Association, the Denali Borough School District, and the National Park Service are the major employers in Healy. Proximity to Denali National Park & Preserve supports local RV parks, hotels, restaurants, bed and breakfast, and other small businesses. The Denali Chamber of Commerce represents the economic interests of Healy and the Denali Borough, Alaska. The 24 MW Eva Creek Wind Farm opened in 2013, 12 miles north of Healy.
Demographics
Healy first appeared on the 1930 U.S. Census as the unincorporated community of "Healey Fork." In 1940, it appeared as Healy Fork. It was shortened to *Healy beginning in 1950. It was made a census-designated place (CDP) in 1980.
Note there was also another locale named "Healey (Healy) Village" on the 1930 & 1940 U.S. Censuses (with a population of 16 and 77, respectively). It was stated that this place was located in the Fairbanks Recording District rather than Nenana (where then Healy Fork was located). It is unclear whether this was a geographic error on the census and both places were located at or around Healy Fork and merged in 1950, or if the former was a native village on or near present-day Healy Lake (within Southeast Fairbanks Census Area).
At the 2000 census there were 1,000 people, 436 households, and 245 families in the CDP. The population density was 1.5 people per square mile (0.6/km). There were 604 housing units at an average density of 0.9 per square mile (0.3/km). The racial makeup of the CDP was 90.20% White, 0.30% Black or African American, 2.30% Native American, 1.90% Asian, 0.70% Pacific Islander, 0.80% from other races, and 3.80% from two or more races. 2.00%. were Hispanic or Latino of any race.
Of the 436 households 33.9% had children under the age of 18 living with them, 48.4% were married couples living together, 3.0% had a female householder with no husband present, and 43.6% were non-families. 37.6% of households were one person and 0.9% were one person aged 65 or older. The average household size was 2.29 and the average family size was 3.12.
The age distribution was 27.4% under the age of 18, 5.5% from 18 to 24, 34.3% from 25 to 44, 30.6% from 45 to 64, and 2.2% 65 or older. The median age was 38 years. For every 100 females, there were 132.0 males. For every 100 females age 18 and over, there were 142.8 males.
The median household income was $60,000 and the median family income was $77,806. Males had a median income of $65,729 versus $30,227 for females. The per capita income for the CDP was $28,225. About 2.5% of families and 4.9% of the population were below the poverty line, including 3.9% of those under age 18 and none of those age 65 or over.
Education
K-12 students attend Tri-Valley School, operated by the Denali Borough School District. The district is headquartered in Healy.
See also
Healy Clean Coal Project
References
External links
Borough seats in Alaska
Census-designated places in Alaska
Census-designated places in Denali Borough, Alaska
Mining communities in Alaska
|
```smalltalk
/* ====================================================================
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.
==================================================================== */
namespace TestCases.SS.UserModel
{
using System;
using NUnit.Framework;
using NPOI.SS.Util;
using TestCases.SS;
using NPOI.SS.UserModel;
using System.Text;
/**
* @author Yegor Kozlov
*/
[TestFixture]
public abstract class BaseTestWorkbook
{
private ITestDataProvider _testDataProvider;
public BaseTestWorkbook()
{
_testDataProvider = TestCases.HSSF.HSSFITestDataProvider.Instance;
}
protected BaseTestWorkbook(ITestDataProvider TestDataProvider)
{
_testDataProvider = TestDataProvider;
}
[Test]
public void TestCreateSheet()
{
IWorkbook wb = _testDataProvider.CreateWorkbook();
Assert.AreEqual(0, wb.NumberOfSheets);
//getting a sheet by invalid index or non-existing name
Assert.IsNull(wb.GetSheet("Sheet1"));
try
{
wb.GetSheetAt(0);
Assert.Fail("should have thrown exceptiuon due to invalid sheet index");
}
catch (ArgumentException ex)
{
// expected during successful Test
// no negative index in the range message
Assert.IsFalse(ex.Message.Contains("-1"));
}
ISheet sheet0 = wb.CreateSheet();
ISheet sheet1 = wb.CreateSheet();
Assert.AreEqual("Sheet0", sheet0.SheetName);
Assert.AreEqual("Sheet1", sheet1.SheetName);
Assert.AreEqual(2, wb.NumberOfSheets);
//fetching sheets by name is case-insensitive
ISheet originalSheet = wb.CreateSheet("Sheet3");
ISheet fetchedSheet = wb.GetSheet("sheet3");
if (fetchedSheet == null)
{
throw new AssertionException("Identified bug 44892");
}
Assert.AreEqual("Sheet3", fetchedSheet.SheetName);
Assert.AreEqual(3, wb.NumberOfSheets);
Assert.AreSame(originalSheet, fetchedSheet);
try
{
wb.CreateSheet("sHeeT3");
Assert.Fail("should have thrown exceptiuon due to duplicate sheet name");
}
catch (ArgumentException e)
{
// expected during successful Test
Assert.AreEqual("The workbook already contains a sheet of this name", e.Message);
}
//names cannot be blank or contain any of /\*?[]
String[] invalidNames = {"", "Sheet/", "Sheet\\",
"Sheet?", "Sheet*", "Sheet[", "Sheet]", "'Sheet'",
"My:Sheet"};
foreach (String sheetName in invalidNames)
{
try
{
wb.CreateSheet(sheetName);
Assert.Fail("should have thrown exception due to invalid sheet name: " + sheetName);
}
catch (ArgumentException)
{
// expected during successful Test
}
}
//still have 3 sheets
Assert.AreEqual(3, wb.NumberOfSheets);
//change the name of the 3rd sheet
wb.SetSheetName(2, "I Changed!");
//try to assign an invalid name to the 2nd sheet
try
{
wb.SetSheetName(1, "[I'm invalid]");
Assert.Fail("should have thrown exceptiuon due to invalid sheet name");
}
catch (ArgumentException)
{
// expected during successful Test
}
//try to assign an invalid name to the 2nd sheet
try
{
wb.CreateSheet(null);
Assert.Fail("should have thrown exceptiuon due to invalid sheet name");
}
catch (ArgumentException)
{
// expected during successful Test
}
try
{
wb.SetSheetName(2, null);
Assert.Fail("should have thrown exceptiuon due to invalid sheet name");
}
catch (ArgumentException)
{
// expected during successful Test
}
//check
Assert.AreEqual(0, wb.GetSheetIndex("sheet0"));
Assert.AreEqual(1, wb.GetSheetIndex("sheet1"));
Assert.AreEqual(2, wb.GetSheetIndex("I Changed!"));
Assert.AreSame(sheet0, wb.GetSheet("sheet0"));
Assert.AreSame(sheet1, wb.GetSheet("sheet1"));
Assert.AreSame(originalSheet, wb.GetSheet("I Changed!"));
Assert.IsNull(wb.GetSheet("unknown"));
//serialize and read again
wb = _testDataProvider.WriteOutAndReadBack(wb);
Assert.AreEqual(3, wb.NumberOfSheets);
Assert.AreEqual(0, wb.GetSheetIndex("sheet0"));
Assert.AreEqual(1, wb.GetSheetIndex("sheet1"));
Assert.AreEqual(2, wb.GetSheetIndex("I Changed!"));
}
/**
* POI allows creating sheets with names longer than 31 characters.
*
* Excel opens files with long sheet names without error or warning.
* However, long sheet names are silently tRuncated to 31 chars. In order to
* avoid funny duplicate sheet name errors, POI enforces uniqueness on only the first 31 chars.
* but for the purpose of uniqueness long sheet names are silently tRuncated to 31 chars.
*/
[Test]
public void TestCreateSheetWithLongNames()
{
IWorkbook wb = _testDataProvider.CreateWorkbook();
String sheetName1 = "My very long sheet name which is longer than 31 chars";
String tRuncatedSheetName1 = sheetName1.Substring(0, 31);
ISheet sh1 = wb.CreateSheet(sheetName1);
Assert.AreEqual(tRuncatedSheetName1, sh1.SheetName);
Assert.AreSame(sh1, wb.GetSheet(tRuncatedSheetName1));
// now via wb.SetSheetName
wb.SetSheetName(0, sheetName1);
Assert.AreEqual(tRuncatedSheetName1, sh1.SheetName);
Assert.AreSame(sh1, wb.GetSheet(tRuncatedSheetName1));
String sheetName2 = "My very long sheet name which is longer than 31 chars " +
"and sheetName2.Substring(0, 31) == sheetName1.Substring(0, 31)";
try
{
ISheet sh2 = wb.CreateSheet(sheetName2);
Assert.Fail("expected exception");
}
catch (ArgumentException e)
{
// expected during successful Test
Assert.AreEqual("The workbook already contains a sheet of this name", e.Message);
}
String sheetName3 = "POI allows creating sheets with names longer than 31 characters";
String tRuncatedSheetName3 = sheetName3.Substring(0, 31);
ISheet sh3 = wb.CreateSheet(sheetName3);
Assert.AreEqual(tRuncatedSheetName3, sh3.SheetName);
Assert.AreSame(sh3, wb.GetSheet(tRuncatedSheetName3));
//serialize and read again
wb = _testDataProvider.WriteOutAndReadBack(wb);
Assert.AreEqual(2, wb.NumberOfSheets);
Assert.AreEqual(0, wb.GetSheetIndex(tRuncatedSheetName1));
Assert.AreEqual(1, wb.GetSheetIndex(tRuncatedSheetName3));
}
[Test]
public void TestRemoveSheetAt()
{
IWorkbook workbook = _testDataProvider.CreateWorkbook();
try
{
workbook.CreateSheet("sheet1");
workbook.CreateSheet("sheet2");
workbook.CreateSheet("sheet3");
Assert.AreEqual(3, workbook.NumberOfSheets);
Assert.AreEqual(0, workbook.ActiveSheetIndex);
workbook.RemoveSheetAt(1);
Assert.AreEqual(2, workbook.NumberOfSheets);
Assert.AreEqual("sheet3", workbook.GetSheetName(1));
Assert.AreEqual(0, workbook.ActiveSheetIndex);
workbook.RemoveSheetAt(0);
Assert.AreEqual(1, workbook.NumberOfSheets);
Assert.AreEqual("sheet3", workbook.GetSheetName(0));
Assert.AreEqual(0, workbook.ActiveSheetIndex);
workbook.RemoveSheetAt(0);
Assert.AreEqual(0, workbook.NumberOfSheets);
Assert.AreEqual(0, workbook.ActiveSheetIndex);
//re-create the sheets
workbook.CreateSheet("sheet1");
workbook.CreateSheet("sheet2");
workbook.CreateSheet("sheet3");
Assert.AreEqual(3, workbook.NumberOfSheets);
workbook.CreateSheet("sheet4");
Assert.AreEqual(4, workbook.NumberOfSheets);
Assert.AreEqual(0, workbook.ActiveSheetIndex);
workbook.SetActiveSheet(2);
Assert.AreEqual(2, workbook.ActiveSheetIndex);
workbook.RemoveSheetAt(2);
Assert.AreEqual(2, workbook.ActiveSheetIndex);
workbook.RemoveSheetAt(1);
Assert.AreEqual(1, workbook.ActiveSheetIndex);
workbook.RemoveSheetAt(0);
Assert.AreEqual(0, workbook.ActiveSheetIndex);
workbook.RemoveSheetAt(0);
Assert.AreEqual(0, workbook.ActiveSheetIndex);
}
finally
{
workbook.Close();
}
}
[Test]
public void TestDefaultValues()
{
IWorkbook b = _testDataProvider.CreateWorkbook();
Assert.AreEqual(0, b.ActiveSheetIndex);
Assert.AreEqual(0, b.FirstVisibleTab);
Assert.AreEqual(0, b.NumberOfNames);
Assert.AreEqual(0, b.NumberOfSheets);
}
[Test]
public void TestSheetSelection()
{
IWorkbook b = _testDataProvider.CreateWorkbook();
b.CreateSheet("Sheet One");
b.CreateSheet("Sheet Two");
b.SetActiveSheet(1);
b.SetSelectedTab(1);
b.FirstVisibleTab = (/*setter*/1);
Assert.AreEqual(1, b.ActiveSheetIndex);
Assert.AreEqual(1, b.FirstVisibleTab);
}
[Test]
public void TestPrintArea()
{
IWorkbook workbook = _testDataProvider.CreateWorkbook();
ISheet sheet1 = workbook.CreateSheet("Test Print Area");
String sheetName1 = sheet1.SheetName;
// workbook.SetPrintArea(0, reference);
workbook.SetPrintArea(0, 1, 5, 4, 9);
String retrievedPrintArea = workbook.GetPrintArea(0);
Assert.AreEqual("'" + sheetName1 + "'!$B$5:$F$10", retrievedPrintArea);
String reference = "$A$1:$B$1";
workbook.SetPrintArea(0, reference);
retrievedPrintArea = workbook.GetPrintArea(0);
Assert.AreEqual("'" + sheetName1 + "'!" + reference, retrievedPrintArea);
workbook.RemovePrintArea(0);
Assert.IsNull(workbook.GetPrintArea(0));
}
[Test]
public void TestGetSetActiveSheet()
{
IWorkbook workbook = _testDataProvider.CreateWorkbook();
Assert.AreEqual(0, workbook.ActiveSheetIndex);
workbook.CreateSheet("sheet1");
workbook.CreateSheet("sheet2");
workbook.CreateSheet("sheet3");
// Set second sheet
workbook.SetActiveSheet(1);
// Test if second sheet is Set up
Assert.AreEqual(1, workbook.ActiveSheetIndex);
workbook.SetActiveSheet(0);
// Test if second sheet is Set up
Assert.AreEqual(0, workbook.ActiveSheetIndex);
}
[Test]
public void TestSetSheetOrder()
{
IWorkbook wb = _testDataProvider.CreateWorkbook();
for (int i = 0; i < 10; i++)
{
wb.CreateSheet("Sheet " + i);
}
// Check the Initial order
Assert.AreEqual(0, wb.GetSheetIndex("Sheet 0"));
Assert.AreEqual(1, wb.GetSheetIndex("Sheet 1"));
Assert.AreEqual(2, wb.GetSheetIndex("Sheet 2"));
Assert.AreEqual(3, wb.GetSheetIndex("Sheet 3"));
Assert.AreEqual(4, wb.GetSheetIndex("Sheet 4"));
Assert.AreEqual(5, wb.GetSheetIndex("Sheet 5"));
Assert.AreEqual(6, wb.GetSheetIndex("Sheet 6"));
Assert.AreEqual(7, wb.GetSheetIndex("Sheet 7"));
Assert.AreEqual(8, wb.GetSheetIndex("Sheet 8"));
Assert.AreEqual(9, wb.GetSheetIndex("Sheet 9"));
// check active sheet
Assert.AreEqual(0, wb.ActiveSheetIndex);
// Change
wb.SetSheetOrder("Sheet 6", 0);
Assert.AreEqual(1, wb.ActiveSheetIndex);
wb.SetSheetOrder("Sheet 3", 7);
wb.SetSheetOrder("Sheet 1", 9);
// now the first sheet is at index 1
Assert.AreEqual(1, wb.ActiveSheetIndex);
// Check they're currently right
Assert.AreEqual(0, wb.GetSheetIndex("Sheet 6"));
Assert.AreEqual(1, wb.GetSheetIndex("Sheet 0"));
Assert.AreEqual(2, wb.GetSheetIndex("Sheet 2"));
Assert.AreEqual(3, wb.GetSheetIndex("Sheet 4"));
Assert.AreEqual(4, wb.GetSheetIndex("Sheet 5"));
Assert.AreEqual(5, wb.GetSheetIndex("Sheet 7"));
Assert.AreEqual(6, wb.GetSheetIndex("Sheet 3"));
Assert.AreEqual(7, wb.GetSheetIndex("Sheet 8"));
Assert.AreEqual(8, wb.GetSheetIndex("Sheet 9"));
Assert.AreEqual(9, wb.GetSheetIndex("Sheet 1"));
IWorkbook wbr = _testDataProvider.WriteOutAndReadBack(wb);
Assert.AreEqual(0, wbr.GetSheetIndex("Sheet 6"));
Assert.AreEqual(1, wbr.GetSheetIndex("Sheet 0"));
Assert.AreEqual(2, wbr.GetSheetIndex("Sheet 2"));
Assert.AreEqual(3, wbr.GetSheetIndex("Sheet 4"));
Assert.AreEqual(4, wbr.GetSheetIndex("Sheet 5"));
Assert.AreEqual(5, wbr.GetSheetIndex("Sheet 7"));
Assert.AreEqual(6, wbr.GetSheetIndex("Sheet 3"));
Assert.AreEqual(7, wbr.GetSheetIndex("Sheet 8"));
Assert.AreEqual(8, wbr.GetSheetIndex("Sheet 9"));
Assert.AreEqual(9, wbr.GetSheetIndex("Sheet 1"));
Assert.AreEqual(1, wb.ActiveSheetIndex);
// Now Get the index by the sheet, not the name
for (int i = 0; i < 10; i++)
{
ISheet s = wbr.GetSheetAt(i);
Assert.AreEqual(i, wbr.GetSheetIndex(s));
}
}
[Test]
public void TestCloneSheet()
{
IWorkbook book = _testDataProvider.CreateWorkbook();
ISheet sheet = book.CreateSheet("TEST");
sheet.CreateRow(0).CreateCell(0).SetCellValue("Test");
sheet.CreateRow(1).CreateCell(0).SetCellValue(36.6);
sheet.AddMergedRegion(new CellRangeAddress(0, 1, 0, 2));
sheet.AddMergedRegion(new CellRangeAddress(1, 2, 0, 2));
Assert.IsTrue(sheet.IsSelected);
ISheet ClonedSheet = book.CloneSheet(0);
Assert.AreEqual("TEST (2)", ClonedSheet.SheetName);
Assert.AreEqual(2, ClonedSheet.PhysicalNumberOfRows);
Assert.AreEqual(2, ClonedSheet.NumMergedRegions);
Assert.IsFalse(ClonedSheet.IsSelected);
//Cloned sheet is a deep copy, Adding rows in the original does not affect the clone
sheet.CreateRow(2).CreateCell(0).SetCellValue(1);
sheet.AddMergedRegion(new CellRangeAddress(0, 2, 0, 2));
Assert.AreEqual(2, ClonedSheet.PhysicalNumberOfRows);
Assert.AreEqual(2, ClonedSheet.PhysicalNumberOfRows);
ClonedSheet.CreateRow(2).CreateCell(0).SetCellValue(1);
ClonedSheet.AddMergedRegion(new CellRangeAddress(0, 2, 0, 2));
Assert.AreEqual(3, ClonedSheet.PhysicalNumberOfRows);
Assert.AreEqual(3, ClonedSheet.PhysicalNumberOfRows);
}
[Test]
public void TestParentReferences()
{
IWorkbook workbook = _testDataProvider.CreateWorkbook();
ISheet sheet = workbook.CreateSheet();
Assert.AreSame(workbook, sheet.Workbook);
IRow row = sheet.CreateRow(0);
Assert.AreSame(sheet, row.Sheet);
ICell cell = row.CreateCell(1);
Assert.AreSame(sheet, cell.Sheet);
Assert.AreSame(row, cell.Row);
workbook = _testDataProvider.WriteOutAndReadBack(workbook);
sheet = workbook.GetSheetAt(0);
Assert.AreSame(workbook, sheet.Workbook);
row = sheet.GetRow(0);
Assert.AreSame(sheet, row.Sheet);
cell = row.GetCell(1);
Assert.AreSame(sheet, cell.Sheet);
Assert.AreSame(row, cell.Row);
}
/**
* Test is kept to ensure stub for deprecated business method passes test.
*
* @Deprecated remove this test when
* {@link Workbook#setRepeatingRowsAndColumns(int, int, int, int, int)}
*
*/
[Obsolete("remove this test when Workbook#setRepeatingRowsAndColumns(int, int, int, int, int) is removed ")]
[Test]
public void TestSetRepeatingRowsAnsColumns()
{
IWorkbook wb = _testDataProvider.CreateWorkbook();
ISheet sheet1 = wb.CreateSheet();
wb.SetRepeatingRowsAndColumns(wb.GetSheetIndex(sheet1), 0, 0, 0, 3);
Assert.AreEqual("1:4", sheet1.RepeatingRows.FormatAsString());
Assert.AreEqual("A:A", sheet1.RepeatingColumns.FormatAsString());
//must handle sheets with quotas, see Bugzilla #47294
ISheet sheet2 = wb.CreateSheet("My' Sheet");
wb.SetRepeatingRowsAndColumns(wb.GetSheetIndex(sheet2), 0, 0, 0, 3);
Assert.AreEqual("1:4", sheet2.RepeatingRows.FormatAsString());
Assert.AreEqual("A:A", sheet1.RepeatingColumns.FormatAsString());
}
/**
* Tests that all of the unicode capable string fields can be Set, written and then read back
*/
[Test]
public void TestUnicodeInAll()
{
System.Threading.Thread.CurrentThread.CurrentCulture = System.Globalization.CultureInfo.CreateSpecificCulture("en-US");
IWorkbook wb = _testDataProvider.CreateWorkbook();
ICreationHelper factory = wb.GetCreationHelper(/*getter*/);
//Create a unicode dataformat (Contains euro symbol)
IDataFormat df = wb.CreateDataFormat();
String formatStr = "_([$\u20ac-2]\\\\\\ * #,##0.00_);_([$\u20ac-2]\\\\\\ * \\\\\\(#,##0.00\\\\\\);_([$\u20ac-2]\\\\\\ *\\\"\\-\\\\\"??_);_(@_)";
short fmt = df.GetFormat(formatStr);
//Create a unicode sheet name (euro symbol)
ISheet s = wb.CreateSheet("\u20ac");
//Set a unicode header (you guessed it the euro symbol)
IHeader h = s.Header;
h.Center = (/*setter*/"\u20ac");
h.Left = (/*setter*/"\u20ac");
h.Right = (/*setter*/"\u20ac");
//Set a unicode footer
IFooter f = s.Footer;
f.Center = (/*setter*/"\u20ac");
f.Left = (/*setter*/"\u20ac");
f.Right = (/*setter*/"\u20ac");
IRow r = s.CreateRow(0);
ICell c = r.CreateCell(1);
c.SetCellValue(12.34);
c.CellStyle.DataFormat = (/*setter*/fmt);
ICell c2 = r.CreateCell(2); // TODO - c2 unused but changing next line ('c'->'c2') causes Test to fail
c.SetCellValue(factory.CreateRichTextString("\u20ac"));
ICell c3 = r.CreateCell(3);
String formulaString = "TEXT(12.34,\"\u20ac###,##\")";
c3.CellFormula = (/*setter*/formulaString);
wb = _testDataProvider.WriteOutAndReadBack(wb);
//Test the sheetname
s = wb.GetSheet("\u20ac");
Assert.IsNotNull(s);
//Test the header
h = s.Header;
Assert.AreEqual(h.Center, "\u20ac");
Assert.AreEqual(h.Left, "\u20ac");
Assert.AreEqual(h.Right, "\u20ac");
//Test the footer
f = s.Footer;
Assert.AreEqual(f.Center, "\u20ac");
Assert.AreEqual(f.Left, "\u20ac");
Assert.AreEqual(f.Right, "\u20ac");
//Test the dataformat
r = s.GetRow(0);
c = r.GetCell(1);
df = wb.CreateDataFormat();
Assert.AreEqual(formatStr, df.GetFormat(c.CellStyle.DataFormat));
//Test the cell string value
c2 = r.GetCell(2);
Assert.AreEqual(c.RichStringCellValue.String, "\u20ac");
//Test the cell formula
c3 = r.GetCell(3);
Assert.AreEqual(c3.CellFormula, formulaString);
}
private IWorkbook newSetSheetNameTestingWorkbook()
{
IWorkbook wb = _testDataProvider.CreateWorkbook();
ISheet sh1 = wb.CreateSheet("Worksheet");
ISheet sh2 = wb.CreateSheet("Testing 47100");
ISheet sh3 = wb.CreateSheet("To be Renamed");
IName name1 = wb.CreateName();
name1.NameName = (/*setter*/"sale_1");
name1.RefersToFormula = (/*setter*/"Worksheet!$A$1");
IName name2 = wb.CreateName();
name2.NameName = (/*setter*/"sale_2");
name2.RefersToFormula = (/*setter*/"'Testing 47100'!$A$1");
IName name3 = wb.CreateName();
name3.NameName = (/*setter*/"sale_3");
name3.RefersToFormula = (/*setter*/"'Testing 47100'!$B$1");
IName name4 = wb.CreateName();
name4.NameName = (/*setter*/"sale_4");
name4.RefersToFormula = (/*setter*/"'To be Renamed'!$A$3");
sh1.CreateRow(0).CreateCell(0).CellFormula = (/*setter*/"SUM('Testing 47100'!A1:C1)");
sh1.CreateRow(1).CreateCell(0).CellFormula = (/*setter*/"SUM('Testing 47100'!A1:C1,'To be Renamed'!A1:A5)");
sh1.CreateRow(2).CreateCell(0).CellFormula = (/*setter*/"sale_2+sale_3+'Testing 47100'!C1");
sh2.CreateRow(0).CreateCell(0).SetCellValue(1);
sh2.GetRow(0).CreateCell(1).SetCellValue(2);
sh2.GetRow(0).CreateCell(2).SetCellValue(3);
sh3.CreateRow(0).CreateCell(0).SetCellValue(1);
sh3.CreateRow(1).CreateCell(0).SetCellValue(2);
sh3.CreateRow(2).CreateCell(0).SetCellValue(3);
sh3.CreateRow(3).CreateCell(0).SetCellValue(4);
sh3.CreateRow(4).CreateCell(0).SetCellValue(5);
sh3.CreateRow(5).CreateCell(0).CellFormula = (/*setter*/"sale_3");
sh3.CreateRow(6).CreateCell(0).CellFormula = (/*setter*/"'Testing 47100'!C1");
return wb;
}
/**
* Ensure that Workbook#setSheetName updates all dependent formulas and named ranges
*
* @see <a href="path_to_url">Bugzilla 47100</a>
*/
[Test]
public void TestSetSheetName()
{
IWorkbook wb = newSetSheetNameTestingWorkbook();
ISheet sh1 = wb.GetSheetAt(0);
IName sale_2 = wb.GetNameAt(1);
IName sale_3 = wb.GetNameAt(2);
IName sale_4 = wb.GetNameAt(3);
Assert.AreEqual("sale_2", sale_2.NameName);
Assert.AreEqual("'Testing 47100'!$A$1", sale_2.RefersToFormula);
Assert.AreEqual("sale_3", sale_3.NameName);
Assert.AreEqual("'Testing 47100'!$B$1", sale_3.RefersToFormula);
Assert.AreEqual("sale_4", sale_4.NameName);
Assert.AreEqual("'To be Renamed'!$A$3", sale_4.RefersToFormula);
IFormulaEvaluator Evaluator = wb.GetCreationHelper(/*getter*/).CreateFormulaEvaluator();
ICell cell0 = sh1.GetRow(0).GetCell(0);
ICell cell1 = sh1.GetRow(1).GetCell(0);
ICell cell2 = sh1.GetRow(2).GetCell(0);
Assert.AreEqual("SUM('Testing 47100'!A1:C1)", cell0.CellFormula);
Assert.AreEqual("SUM('Testing 47100'!A1:C1,'To be Renamed'!A1:A5)", cell1.CellFormula);
Assert.AreEqual("sale_2+sale_3+'Testing 47100'!C1", cell2.CellFormula);
Assert.AreEqual(6.0, Evaluator.Evaluate(cell0).NumberValue);
Assert.AreEqual(21.0, Evaluator.Evaluate(cell1).NumberValue);
Assert.AreEqual(6.0, Evaluator.Evaluate(cell2).NumberValue);
wb.SetSheetName(1, "47100 - First");
wb.SetSheetName(2, "47100 - Second");
Assert.AreEqual("sale_2", sale_2.NameName);
Assert.AreEqual("'47100 - First'!$A$1", sale_2.RefersToFormula);
Assert.AreEqual("sale_3", sale_3.NameName);
Assert.AreEqual("'47100 - First'!$B$1", sale_3.RefersToFormula);
Assert.AreEqual("sale_4", sale_4.NameName);
Assert.AreEqual("'47100 - Second'!$A$3", sale_4.RefersToFormula);
Assert.AreEqual("SUM('47100 - First'!A1:C1)", cell0.CellFormula);
Assert.AreEqual("SUM('47100 - First'!A1:C1,'47100 - Second'!A1:A5)", cell1.CellFormula);
Assert.AreEqual("sale_2+sale_3+'47100 - First'!C1", cell2.CellFormula);
Evaluator.ClearAllCachedResultValues();
Assert.AreEqual(6.0, Evaluator.Evaluate(cell0).NumberValue);
Assert.AreEqual(21.0, Evaluator.Evaluate(cell1).NumberValue);
Assert.AreEqual(6.0, Evaluator.Evaluate(cell2).NumberValue);
wb = _testDataProvider.WriteOutAndReadBack(wb);
sh1 = wb.GetSheetAt(0);
sale_2 = wb.GetNameAt(1);
sale_3 = wb.GetNameAt(2);
sale_4 = wb.GetNameAt(3);
cell0 = sh1.GetRow(0).GetCell(0);
cell1 = sh1.GetRow(1).GetCell(0);
cell2 = sh1.GetRow(2).GetCell(0);
Assert.AreEqual("sale_2", sale_2.NameName);
Assert.AreEqual("'47100 - First'!$A$1", sale_2.RefersToFormula);
Assert.AreEqual("sale_3", sale_3.NameName);
Assert.AreEqual("'47100 - First'!$B$1", sale_3.RefersToFormula);
Assert.AreEqual("sale_4", sale_4.NameName);
Assert.AreEqual("'47100 - Second'!$A$3", sale_4.RefersToFormula);
Assert.AreEqual("SUM('47100 - First'!A1:C1)", cell0.CellFormula);
Assert.AreEqual("SUM('47100 - First'!A1:C1,'47100 - Second'!A1:A5)", cell1.CellFormula);
Assert.AreEqual("sale_2+sale_3+'47100 - First'!C1", cell2.CellFormula);
Evaluator = wb.GetCreationHelper(/*getter*/).CreateFormulaEvaluator();
Assert.AreEqual(6.0, Evaluator.Evaluate(cell0).NumberValue);
Assert.AreEqual(21.0, Evaluator.Evaluate(cell1).NumberValue);
Assert.AreEqual(6.0, Evaluator.Evaluate(cell2).NumberValue);
}
public void ChangeSheetNameWithSharedFormulas(String sampleFile)
{
IWorkbook wb = _testDataProvider.OpenSampleWorkbook(sampleFile);
IFormulaEvaluator Evaluator = wb.GetCreationHelper(/*getter*/).CreateFormulaEvaluator();
ISheet sheet = wb.GetSheetAt(0);
for (int rownum = 1; rownum <= 40; rownum++)
{
ICell cellA = sheet.GetRow(1).GetCell(0);
ICell cellB = sheet.GetRow(1).GetCell(1);
Assert.AreEqual(cellB.StringCellValue, Evaluator.Evaluate(cellA).StringValue);
}
wb.SetSheetName(0, "Renamed by POI");
Evaluator.ClearAllCachedResultValues();
for (int rownum = 1; rownum <= 40; rownum++)
{
ICell cellA = sheet.GetRow(1).GetCell(0);
ICell cellB = sheet.GetRow(1).GetCell(1);
Assert.AreEqual(cellB.StringCellValue, Evaluator.Evaluate(cellA).StringValue);
}
}
protected void assertSheetOrder(IWorkbook wb, params String[] sheets)
{
StringBuilder sheetNames = new StringBuilder();
for (int i = 0; i < wb.NumberOfSheets; i++)
{
sheetNames.Append(wb.GetSheetAt(i).SheetName).Append(",");
}
Assert.AreEqual(sheets.Length, wb.NumberOfSheets, "Had: " + sheetNames.ToString());
for (int i = 0; i < wb.NumberOfSheets; i++)
{
Assert.AreEqual(sheets[i], wb.GetSheetAt(i).SheetName, "Had: " + sheetNames.ToString());
}
}
}
}
```
|
```html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "path_to_url">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (1.8.0_121) on Mon Mar 27 10:01:26 CEST 2017 -->
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>Uses of Interface org.activiti.engine.history.HistoricTaskInstance (Flowable - Engine 5.23.0 API)</title>
<meta name="date" content="2017-03-27">
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
<script type="text/javascript" src="../../../../../script.js"></script>
</head>
<body>
<script type="text/javascript"><!--
try {
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="Uses of Interface org.activiti.engine.history.HistoricTaskInstance (Flowable - Engine 5.23.0 API)";
}
}
catch(err) {
}
//-->
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar.top">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.top.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../overview-summary.html">Overview</a></li>
<li><a href="../package-summary.html">Package</a></li>
<li><a href="../../../../../org/activiti/engine/history/HistoricTaskInstance.html" title="interface in org.activiti.engine.history">Class</a></li>
<li class="navBarCell1Rev">Use</li>
<li><a href="../package-tree.html">Tree</a></li>
<li><a href="../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li>Prev</li>
<li>Next</li>
</ul>
<ul class="navList">
<li><a href="../../../../../index.html?org/activiti/engine/history/class-use/HistoricTaskInstance.html" target="_top">Frames</a></li>
<li><a href="HistoricTaskInstance.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_top");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<a name="skip.navbar.top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<div class="header">
<h2 title="Uses of Interface org.activiti.engine.history.HistoricTaskInstance" class="title">Uses of Interface<br>org.activiti.engine.history.HistoricTaskInstance</h2>
</div>
<div class="classUseContainer">No usage of org.activiti.engine.history.HistoricTaskInstance</div>
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar.bottom">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.bottom.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../overview-summary.html">Overview</a></li>
<li><a href="../package-summary.html">Package</a></li>
<li><a href="../../../../../org/activiti/engine/history/HistoricTaskInstance.html" title="interface in org.activiti.engine.history">Class</a></li>
<li class="navBarCell1Rev">Use</li>
<li><a href="../package-tree.html">Tree</a></li>
<li><a href="../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li>Prev</li>
<li>Next</li>
</ul>
<ul class="navList">
<li><a href="../../../../../index.html?org/activiti/engine/history/class-use/HistoricTaskInstance.html" target="_top">Frames</a></li>
<li><a href="HistoricTaskInstance.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_bottom");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<a name="skip.navbar.bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
```
|
```c
/* $OpenBSD: externs.c,v 1.5 2009/10/27 23:59:27 deraadt Exp $ */
/* $NetBSD: externs.c,v 1.3 1995/04/22 10:58:53 cgd Exp $ */
/*
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "trek.h"
/*
** global variable definitions
*/
const struct device Device[NDEV] =
{
{ "warp drive", "Scotty" },
{ "S.R. scanners", "Scotty" },
{ "L.R. scanners", "Scotty" },
{ "phasers", "Sulu" },
{ "photon tubes", "Sulu" },
{ "impulse engines", "Scotty" },
{ "shield control", "Sulu" },
{ "computer", "Spock" },
{ "subspace radio", "Uhura" },
{ "life support", "Scotty" },
{ "navigation system", "Chekov" },
{ "cloaking device", "Scotty" },
{ "transporter", "Scotty" },
{ "shuttlecraft", "Scotty" },
{ "*ERR 14*", "Nobody" },
{ "*ERR 15*", "Nobody" }
};
const char *const Systemname[NINHAB] =
{
"ERROR",
"Talos IV",
"Rigel III",
"Deneb VII",
"Canopus V",
"Icarus I",
"Prometheus II",
"Omega VII",
"Elysium I",
"Scalos IV",
"Procyon IV",
"Arachnid I",
"Argo VIII",
"Triad III",
"Echo IV",
"Nimrod III",
"Nemisis IV",
"Centarurus I",
"Kronos III",
"Spectros V",
"Beta III",
"Gamma Tranguli VI",
"Pyris III",
"Triachus",
"Marcus XII",
"Kaland",
"Ardana",
"Stratos",
"Eden",
"Arrikis",
"Epsilon Eridani IV",
"Exo III"
};
```
|
Esbjerg Municipality (, ) is a kommune in the Region of Southern Denmark on the west coast of the Jutland peninsula in southwest Denmark. Its mayor is Jesper Frost Rasmussen, from the Venstre (Center-Right Party) political party. By 1 January 2007, the old Esbjerg municipality was, as the result of Kommunalreformen ("The Municipal Reform" of 2007), merged with the former Bramming and Ribe and a small part of Helle municipalities to form the new Esbjerg municipality. This municipality has an area of 741 km² (286 sq. miles) and a total population of 115,758 (2023).
Overview
The main town and the site of its municipal council is the city of Esbjerg, the fifth largest city in Denmark.
Neighboring municipalities with land connection are Tønder to the south, Haderslev to the southeast, Vejen to the east, and Varde to the north. The neighboring municipality to the west is Fanø, an island municipality located in Fanø Bay (Fanø Bugt). Beyond the island of Fanø and Fanø Bay is the North Sea.
Locations
Infrastructure
Rail
Esbjerg Municipality has 13 railway stations, which forms a dense network, compared to other municipalities in Denmark, despite its many rural towns.
Politics
Esbjerg's municipal council consists of 31 members, elected every four years. The municipal council has seven political committees.
Municipal council
Below are the municipal councils elected since the Municipal Reform of 2007.
Twin towns – sister cities
Esbjerg is twinned with:
Eskilstuna, Sweden
Fjarðabyggð, Iceland
Jyväskylä, Finland
Qeqqata, Greenland
Stavanger, Norway
Suzhou, China
Szczecin, Poland
Tórshavn, Faroe Islands
References
Municipal statistics: NetBorger Kommunefakta, delivered from KMD aka Kommunedata (Municipal Data)
Municipal mergers and neighbors: Eniro new municipalities map
External links
Esbjerg's official information portal
Esbjerg municipality's official website
The new Esbjerg municipality's official website (Danish only)
Esbjerg Tourism Bureau's website
SDU Esbjerg
AAU Esbjerg
The Peace movement of Esbjerg
Esbjerg
Municipalities of the Region of Southern Denmark
Municipalities of Denmark
Populated places established in 2007
|
```smalltalk
namespace Dopamine.Core.Prism
{
public sealed class RegionNames
{
public const string PlayerTypeRegion = "PlayerTypeRegion";
public const string CollectionRegion = "CollectionRegion";
public const string PlaylistsRegion = "PlaylistsRegion";
public const string SettingsRegion = "SettingsRegion";
public const string InformationRegion = "InformationRegion";
public const string FullPlayerRegion = "FullPlayerRegion";
public const string FullPlayerMenuRegion = "FullPlayerMenuRegion";
public const string NowPlayingSubPageRegion = "NowPlayingSubPageRegion";
}
}
```
|
Giral Lignite Power Plant (GLPL)or Giral Lignite Thermal Power Station (GLTPP) is a wholly owned subsidiary of Rajasthan Rajya Vidyut Utpadan Nigam Limited (RRVUNL). RRVUNL is a state government (Level 2 government in India) owned corporation working in field of power generation
Power plant
The thermal power station has installed capacity of 250 MW. Two identical units of 125 MW each, are built by Senbo Engineering Limited (SEL) on EPC basis with an estimated cost of Rs. 1690 Crores. It is a pit head plant. The fuel is lignite coal, which is procured from the mines just behind the plant. The fuel is supplied by Rajasthan State Mines & Minerals Limited (RSMML). An additive to fuel is limestone, which is added in pulverised form to the lignite, for the purpose of neutralising the sulphur Oxides (SOx), Sulphur Oxides are formed as a byproduct of combustion of lignite containing sulphur as its constituent. Limestonne is also supplied by RSMML. Lignite cost is nearly Rs. 400 per MT.
This is the first plant of the country which is using Lime with lignite to control SOX level.
It was developed in 2 stages.
Installed capacity
See also
Suratgarh Super Thermal Power Plant
Kota Super Thermal Power Plant
Chhabra Thermal Power Plant
References
Coal-fired power stations in Rajasthan
Barmer district
2003 establishments in Rajasthan
Energy infrastructure completed in 2003
|
```c++
//your_sha256_hash-----------//
//
// See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
//
// See path_to_url for more information.
//your_sha256_hash-----------//
#ifndef BOOST_COMPUTE_FUNCTIONAL_IDENTITY_HPP
#define BOOST_COMPUTE_FUNCTIONAL_IDENTITY_HPP
namespace boost {
namespace compute {
namespace detail {
template<class T, class Arg>
struct invoked_identity
{
typedef T result_type;
invoked_identity(const Arg &arg)
: m_arg(arg)
{
}
Arg m_arg;
};
} // end detail namespace
/// Identity function which simply returns its input.
///
/// For example, to directly copy values using the transform() algorithm:
/// \code
/// transform(input.begin(), input.end(), output.begin(), identity<int>(), queue);
/// \endcode
///
/// \see \ref as "as<T>", \ref convert "convert<T>"
template<class T>
class identity
{
public:
/// Identity function result type.
typedef T result_type;
/// Creates a new identity function.
identity()
{
}
/// \internal_
template<class Arg>
detail::invoked_identity<T, Arg> operator()(const Arg &arg) const
{
return detail::invoked_identity<T, Arg>(arg);
}
};
} // end compute namespace
} // end boost namespace
#endif // BOOST_COMPUTE_FUNCTIONAL_IDENTITY_HPP
```
|
```groff
.\" $OpenBSD: pidfile.3,v 1.7 2013/06/05 03:40:26 tedu Exp $
.\" $NetBSD: pidfile.3,v 1.2 2001/04/12 22:34:31 sommerfeld Exp $
.\"
.\" All rights reserved.
.\"
.\" This code is derived from software contributed to The NetBSD Foundation
.\" by Jason R. Thorpe.
.\"
.\" Redistribution and use in source and binary forms, with or without
.\" modification, are permitted provided that the following conditions
.\" are met:
.\" 1. Redistributions of source code must retain the above copyright
.\" notice, this list of conditions and the following disclaimer.
.\" 2. Redistributions in binary form must reproduce the above copyright
.\" notice, this list of conditions and the following disclaimer in the
.\" documentation and/or other materials provided with the distribution.
.\"
.\" THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
.\" ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
.\" TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
.\" PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
.\" BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
.\" CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
.\" SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
.\" INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
.\" CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
.\" ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
.\" POSSIBILITY OF SUCH DAMAGE.
.\"
.Dd $Mdocdate: June 5 2013 $
.Dt PIDFILE 3
.Os
.Sh NAME
.Nm pidfile
.Nd write a daemon pid file
.Sh SYNOPSIS
.In util.h
.Ft int
.Fn pidfile "const char *basename"
.Sh DESCRIPTION
.Fn pidfile
writes a file containing the process ID of the program to the
.Pa /var/run
directory.
The file name has the form
.Pa /var/run/basename.pid .
If the
.Ar basename
argument is NULL,
.Nm
will determine the program name and use that instead.
.Pp
The pid file can be used as a quick reference if
the process needs to be sent a signal.
When the program exits, the pid file will be removed automatically,
unless the program receives a fatal signal.
.Sh RETURN VALUES
.Fn pidfile
returns 0 on success and -1 on failure.
.Sh SEE ALSO
.Xr atexit 3
.Sh HISTORY
The
.Nm
function call appeared in
.Ox 3.0 .
.Sh CAVEATS
If
.Fn pidfile
is called multiple times with different
.Ar basename ,
only the last pidfile will be removed upon exit.
.Pp
.Fn pidfile
uses
.Fn atexit
to ensure the pidfile is unlinked at program exit.
However, programs that use the
.Fn _exit
function (for example, in signal handlers)
will not trigger this behaviour.
```
|
```xml
import { getPermissionsAsync, requestPermissionsAsync } from './utils/isSensorEnabledAsync.web';
declare const _default: {
/**
* Gravity on the planet this module supports (currently just Earth) represented as m/s^2.
*/
readonly Gravity: number;
isAvailableAsync(): Promise<boolean>;
_handleMotion(motion: any): void;
getPermissionsAsync: typeof getPermissionsAsync;
requestPermissionsAsync: typeof requestPermissionsAsync;
startObserving(): void;
stopObserving(): void;
};
export default _default;
//# sourceMappingURL=ExponentDeviceMotion.web.d.ts.map
```
|
```c++
//===- ValueList.cpp - Internal BitcodeReader implementation --------------===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
#include "ValueList.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/IR/Argument.h"
#include "llvm/IR/Constant.h"
#include "llvm/IR/Constants.h"
#include "llvm/IR/GlobalValue.h"
#include "llvm/IR/Instruction.h"
#include "llvm/IR/Type.h"
#include "llvm/IR/User.h"
#include "llvm/IR/Value.h"
#include "llvm/Support/Casting.h"
#include "llvm/Support/Error.h"
#include "llvm/Support/ErrorHandling.h"
#include <cstddef>
using namespace llvm;
Error BitcodeReaderValueList::assignValue(unsigned Idx, Value *V,
unsigned TypeID) {
if (Idx == size()) {
push_back(V, TypeID);
return Error::success();
}
if (Idx >= size())
resize(Idx + 1);
auto &Old = ValuePtrs[Idx];
if (!Old.first) {
Old.first = V;
Old.second = TypeID;
return Error::success();
}
assert(!isa<Constant>(&*Old.first) && "Shouldn't update constant");
// If there was a forward reference to this value, replace it.
Value *PrevVal = Old.first;
if (PrevVal->getType() != V->getType())
return createStringError(
std::errc::illegal_byte_sequence,
"Assigned value does not match type of forward declaration");
Old.first->replaceAllUsesWith(V);
PrevVal->deleteValue();
return Error::success();
}
Value *BitcodeReaderValueList::getValueFwdRef(unsigned Idx, Type *Ty,
unsigned TyID,
BasicBlock *ConstExprInsertBB) {
// Bail out for a clearly invalid value.
if (Idx >= RefsUpperBound)
return nullptr;
if (Idx >= size())
resize(Idx + 1);
if (Value *V = ValuePtrs[Idx].first) {
// If the types don't match, it's invalid.
if (Ty && Ty != V->getType())
return nullptr;
Expected<Value *> MaybeV = MaterializeValueFn(Idx, ConstExprInsertBB);
if (!MaybeV) {
// TODO: We might want to propagate the precise error message here.
consumeError(MaybeV.takeError());
return nullptr;
}
return MaybeV.get();
}
// No type specified, must be invalid reference.
if (!Ty)
return nullptr;
// Create and return a placeholder, which will later be RAUW'd.
Value *V = new Argument(Ty);
ValuePtrs[Idx] = {V, TyID};
return V;
}
```
|
Kilkerley Emmets GFC is a Gaelic Athletic Association (GAA) club that fields gaelic football teams in competitions organised by Louth GAA.
As of 2023, the club competes in the Louth Intermediate Championship and Division 2 of the county football Leagues. Former Louth goalkeeper Seán Connor is the manager of the senior team.
Situated in an area of north Louth that contains several GAA clubs, Kilkerley's local rivals are considered to be Roche Emmets and St Bride's.
History
The club was founded in 1940 and is located in the townland of Tankardsrock in Kilkerley parish, four miles from Dundalk town centre.
The Emmets enjoyed a significant period of success in the late 1970s, winning the Junior 1 League in 1977 and then beating Dreadnots in the final of the 1978 Louth Intermediate Football Championship. The jump from junior to senior football in the space of two years was made possible in no small part by being able to call on the services of county players J.P. O'Kane and the Lennon brothers, Terry and Pat.
More silverware was won in 1980 when Kilkerley defeated Cooley Kickhams 1–09 to 2–05 in the final of the Cardinal O'Donnell Cup to claim their first ever senior trophy. Later that year, forward Pat Lennon was tragically killed in a car accident.
In 1982 the club contested the final of the Louth Senior Football Championship for the first time, but lost to Geraldines by six points.
They returned to the county final in 1986, this time losing narrowly by 3–05 to 2–07, against a strong Newtown Blues team that completed a clean sweep of senior competitions.
The club's third appearance in the county decider in 1999 was a forgettable one, as they succumbed to an eleven-point hammering at the hands of Stabannon Parnells in Haggardstown.
In December 2014, Shane Lennon, full-forward for Louth in the 2010 Leinster Senior Football Championship Final, announced his retirement from inter-county football. He departed as the all-time record goal scorer for his county.
Honours
Cardinal O'Donnell Cup (1): 1980
ACC Cup (1): 1988
Louth Intermediate Football Championship (2): 1978, 2015
Louth Intermediate Football League (1): 2002
Dealgan Milk Products/Paddy Sheelan Shield (1): 1978, 2019
Louth Junior Football Championship (1): 1946
Louth Junior A Football League (1): 1977
Louth Minor Football Championship (1): § 1977
Louth Minor Football League (1): 2019
Louth Minor 'B' Football Championship (1): 2017
Louth Junior 2A Football Championship (1): 1942, 1986
Louth Junior 2A Football League (3): 1942, 1981, 1989
Louth Junior 2 Football League (Division 4B) (1): 2015
Louth Junior 2 Football League (Division 4C) (1): 2013
Dundalk Junior League (4): 1951, 1975, 1983, 1987
Shared with Naomh Malachi
§ Shared with Naomh Malachi and Roche Emmets
Inter-county players
Kilkerley Emmets players who have represented Louth at senior inter-county level include:
Ned McEnteggart
Terry Lennon
Paidín O'Hare
Jim Lynch
J.P. O'Kane
Pat Lennon
Ray Quinn
Peter O'Hare
Vincent Litchfield
Michael Fegan
Peter Kirk
Séamus Quigley
Barry Clarke
Colm McGuinness
Shane Lennon
Cathal Bellew
Tadgh McEneaney
References
Gaelic games clubs in County Louth
Gaelic football clubs in County Louth
|
```c
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
#include "stdlib/strided/napi/smskmap.h"
#include "stdlib/math/base/special/cbrtf.h"
STDLIB_STRIDED_NAPI_MODULE_SMSKMAP( stdlib_base_cbrtf )
```
|
The Ministry of Steel is an executive branch agency of the Government of India that is responsible for formulating all policies regarding steel production, distribution and pricing in India. As of July 2021, the ministry is headed by a Secretary Rank IAS officer, who is its administrative head, while the political head is a minister of cabinet rank, Jyotiraditya Scindia, assisted by a Minister of State, Faggan Singh Kulaste.
Functions of the ministry
Coordination of data from various sources for the growth of the iron and steel industry in India
Formulation of policies in respect of production, pricing, distribution, import and export of iron & steel and ferro alloys
Planning and development of and assistance to the entire iron and steel industry in the country
Development of the input industries relating to iron ore, manganese ore, refractories and others required by the steel industry
Attached/subordinate offices and institutes
Joint Plant Committee (JPC)
A select organisation whose goal is the promotion of steel, coordinating work of the main producers
National Institute of Secondary Steel Technology (NISST)
NISST aims to be a single source for all the requirements of the secondary steel sector
Biju Patnaik National Steel Institute
Situated in Puri, BPNSI is an institute of modern steel technology. It provides education and training, research and development, and consultancy to the steel sector.
Steel Consumers Council
The members of the Steel Consumers Council are nominated by the Minister of Steel. The tenure of the council was initially fixed for two years, and it was re-constituted on 25 February 2010. The term of the present council is up to 29 February 2012.
Central Public Sector Undertakings
Steel Authority of India Limited (SAIL)
National Mineral Development Corporation (NMDC)
Rashtriya Ispat Nigam Limited (RINL)
Kudremukh Iron Ore Company Ltd (KIOCL)
MECON Limited
Manganese Ore Limited (MOIL)
MSTC Limited
Sponge Iron India Limited (SIIL)
Ferro Scrap Nigam Limited (FSNL)
List of ministers
Cabinet Ministers
Note: MoS, I/C Minister of State (Independent Charge)
Key: Died in office
Ministers of State
Deputy Ministers
References
External links
of the Ministry of Steel
Steel
|
```yaml
# UTF-8
# YAML #
# name
name:
# other_names ...
# YAML
# other_names: {"":"", "":"", "":"Tom"}
#
other_names:
# sex M/F /
sex: M
# birth 4 N/A
birth: 1936
# death 4 N/A
death:
# desc YAML
# desc
desc: |
# links YAML list
#
#
links:
```
|
```c
/* cast.c -- plane_cast(struct d3point) to translate the point's coordination
* from the user's coordination to the observation space cast plane.
*/
#include "all.h"
struct d2point plane_cast(struct d3point user3d)
{
/* user3d : a point in the user's space */
/* return the point's cooridation in observation space.*/
struct d3point obv_point;
struct d2point cast_point;
float Xw,Yw,Zw;
float u,v,a,b,c;
a=viewpoint.x;
b=viewpoint.y;
c=viewpoint.z;
u=(float)(sqrt(a*a+b*b+c*c));
v=(float)(sqrt(a*a+b*b));
Xw=user3d.x;
Yw=user3d.y;
Zw=user3d.z;
obv_point.x=-1*b/v*Xw+a/v*Yw;
obv_point.y=-1*a*c/u/v*Xw-b*c/u/v*Yw+v/u*Zw;
obv_point.z=-1*a/u*Xw-b/u*Yw-c/u*Zw+u;
cast_point.x=obv_point.x*distance/obv_point.z;
cast_point.y=obv_point.y*distance/obv_point.z;
return(cast_point);
}
```
|
"Pocket" is Ai Otsuka's 16th (17th overall) single released under the avex trax label. It is her third (fourth) single to be released in 2007. This is her first single to be released after her fourth album, approximately two months after Love Piece. This is Otsuka's first original single since her debut single "Momo no hanabira", which sold 44,822 copies, to sell less than 100,000 copies.
Track listing
Charts
Oricon sales chart (Japan)
References
Ai Otsuka songs
2007 singles
2007 songs
Songs written by Ai Otsuka
Avex Trax singles
|
```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 proc = require( 'process' );
var spawn = require( 'child_process' ).spawn;
// FUNCTIONS //
/**
* Callback invoked upon encountering an error.
*
* @private
* @param {Error} error - error object
*/
function onError( error ) {
proc.exitCode = 1;
console.error( 'Error: %s', error.message ); // eslint-disable-line no-console
}
/**
* Callback invoked upon child process close.
*
* @private
* @param {number} code - exit code
* @returns {void}
*/
function onFinish( code ) {
if ( code !== 0 ) {
proc.exitCode = code;
return console.error( 'Child process exited with code `'+code + '`.' ); // eslint-disable-line no-console
}
}
// MAIN //
/**
* Plugin to list contributors.
*
* @param {string} dir - Makefile directory
* @param {string} cwd - current working directory
* @param {string} subpath - subdirectory path
*/
function plugin( dir, cwd, subpath ) {
var opts;
var args;
var proc;
opts = {};
opts.cwd = dir;
opts.stdio = 'inherit';
args = [];
// Environment variables:
if ( subpath ) {
args.push( 'LIST_DIR_CONTRIBUTORS='+subpath );
}
// Target:
args.push( 'stats-list-dir-contributors' );
proc = spawn( 'make', args, opts );
proc.on( 'error', onError );
proc.on( 'close', onFinish );
}
// EXPORTS //
module.exports = plugin;
```
|
```smalltalk
"
I scan characters
"
Class {
#name : 'RubCharacterScanner',
#superclass : 'Object',
#instVars : [
'destX',
'lastIndex',
'destY',
'stopConditions',
'text',
'textStyle',
'alignment',
'leftMargin',
'rightMargin',
'font',
'line',
'runStopIndex',
'spaceCount',
'spaceWidth',
'emphasisCode',
'kern',
'indentationLevel',
'baselineY',
'firstDestX',
'pendingKernX'
],
#classVars : [
'DefaultStopConditions',
'NilCondition',
'PaddedSpaceCondition',
'SpaceCondition'
],
#pools : [
'TextConstants'
],
#category : 'Rubric-TextScanning',
#package : 'Rubric',
#tag : 'TextScanning'
}
{ #category : 'class initialization' }
RubCharacterScanner class >> initialize [
"
RubCharacterScanner initialize
"
| a |
a := RubTextStopConditions new.
a at: 1 + 1 put: #embeddedObject.
a at: Character tab asciiValue + 1 put: #tab.
a at: Character cr asciiValue + 1 put: #cr.
a at: Character lf asciiValue + 1 put: #cr.
NilCondition := a copy.
DefaultStopConditions := a copy.
PaddedSpaceCondition := a copy.
PaddedSpaceCondition at: Character space asciiValue + 1 put: #paddedSpace.
SpaceCondition := a copy.
SpaceCondition at: Character space asciiValue + 1 put: #space
]
{ #category : 'private' }
RubCharacterScanner >> addEmphasis: code [
"Set the bold-ital-under-strike emphasis."
emphasisCode := emphasisCode bitOr: code
]
{ #category : 'private' }
RubCharacterScanner >> addKern: kernDelta [
"Set the current kern amount."
kern := kern + kernDelta
]
{ #category : 'scanning' }
RubCharacterScanner >> basicScanCharactersFrom: startIndex to: stopIndex in: sourceString rightX: rightX stopConditions: stops kern: kernDelta [
"Primitive. This is the inner loop of text display--but see
scanCharactersFrom: to:rightX: which would get the string,
stopConditions and displaying from the instance. March through source
String from startIndex to stopIndex. If any character is flagged with a
non-nil entry in stops, then return the corresponding value. Determine
width of each character from xTable, indexed by map.
If dextX would exceed rightX, then return stops at: 258.
Advance destX by the width of the character. If stopIndex has been
reached, then return stops at: 257. Optional.
See Object documentation whatIsAPrimitive."
| ascii nextDestX char floatDestX widthAndKernedWidth nextChar atEndOfRun |
lastIndex := startIndex.
floatDestX := destX.
widthAndKernedWidth := Array new: 2.
atEndOfRun := false.
[lastIndex <= stopIndex]
whileTrue: [
char := (sourceString at: lastIndex).
ascii := char asciiValue.
(ascii < stops size and: [(stops at: ascii + 1) isNotNil]) ifTrue: [^ stops at: ascii + 1].
"Note: The following is querying the font about the width
since the primitive may have failed due to a non-trivial
mapping of characters to glyphs or a non-existing xTable."
(self isBreakableAt: lastIndex in: text)
ifTrue: [ self registerBreakableIndex ].
nextChar := (lastIndex + 1 <= stopIndex)
ifTrue:[sourceString at: lastIndex + 1]
ifFalse:[
atEndOfRun := true.
"if there is a next char in sourceString, then get the kern
and store it in pendingKernX"
lastIndex + 1 <= sourceString size
ifTrue:[sourceString at: lastIndex + 1]
ifFalse:[ nil]].
font
widthAndKernedWidthOfLeft: char
right: nextChar
into: widthAndKernedWidth.
nextDestX := floatDestX + ((widthAndKernedWidth at: 1) * self scale).
"note crossing of right component side, unless we would end up on the first position
again (endless loop, if line is to narrow to hold this current character)"
nextDestX > rightX ifTrue: [firstDestX ~= destX ifTrue:[ ^stops crossedX]].
floatDestX := floatDestX + (kernDelta * self scale) + ((widthAndKernedWidth at: 2) * self scale).
atEndOfRun
ifTrue:[
pendingKernX := ((widthAndKernedWidth at: 2) * self scale) - ((widthAndKernedWidth at: 1) * self scale).
floatDestX := floatDestX - pendingKernX].
destX := floatDestX.
lastIndex := lastIndex + 1].
lastIndex := stopIndex.
^ stops endOfRun
]
{ #category : 'scanner methods' }
RubCharacterScanner >> combinableChar: char for: prevEntity [
]
{ #category : 'scanning' }
RubCharacterScanner >> embeddedObject [
| savedIndex |
savedIndex := lastIndex.
text
attributesAt: lastIndex
do: [ :attr |
attr anchoredMorph
ifNotNil: [
"Following may look strange but logic gets reversed.
If the morph fits on this line we're not done (return false for true)
and if the morph won't fit we're done (return true for false)"
(self placeEmbeddedObject: attr anchoredMorph)
ifFalse: [ ^ true ] ] ].
lastIndex := savedIndex + 1. "for multiple(!) embedded morphs"
^ false
]
{ #category : 'scanning' }
RubCharacterScanner >> handleIndentation [
self indentationLevel timesRepeat: [
self plainTab]
]
{ #category : 'scanning' }
RubCharacterScanner >> indentationLevel [
"return the number of tabs that are currently being placed at the beginning of each line"
^indentationLevel ifNil:[0]
]
{ #category : 'scanning' }
RubCharacterScanner >> indentationLevel: anInteger [
"set the number of tabs to put at the beginning of each line"
indentationLevel := anInteger
]
{ #category : 'initialization' }
RubCharacterScanner >> initialize [
super initialize.
destX := destY := leftMargin := 0
]
{ #category : 'scanner methods' }
RubCharacterScanner >> isBreakableAt: index in: sourceString [
| char |
char := sourceString at: index.
char = Character space ifTrue: [^ true].
char = Character cr ifTrue: [^ true].
^ false
]
{ #category : 'text constants' }
RubCharacterScanner >> justified [
^ 3
]
{ #category : 'scanning' }
RubCharacterScanner >> leadingTab [
"return true if only tabs lie to the left"
line first to: lastIndex do:
[:i | (text at: i) == Character tab ifFalse: [^ false]].
^ true
]
{ #category : 'scanning' }
RubCharacterScanner >> nextTabXFrom: anX [
"Tab stops are distances from the left margin. Set the distance into the
argument, anX, normalized for the paragraph's left margin."
| normalizedX tabX mx |
mx := 9999.
normalizedX := anX - leftMargin.
tabX := self tabWidth * self scale.
[ tabX <= normalizedX and: [ tabX < mx ] ] whileTrue: [ tabX := tabX + (self tabWidth * self scale) ].
^ tabX < mx
ifTrue: [ leftMargin + tabX min: rightMargin ]
ifFalse: [ rightMargin ]
]
{ #category : 'scanning' }
RubCharacterScanner >> placeEmbeddedObject: anchoredMorph [
"Place the anchoredMorph or return false if it cannot be placed.
In any event, advance destX by its width."
| w |
"Workaround: The following should really use #textAnchorType"
anchoredMorph relativeTextAnchorPosition ifNotNil:[^true].
destX := destX + (w := anchoredMorph width * self scale).
(destX > rightMargin and: [(leftMargin + w) <= rightMargin])
ifTrue: ["Won't fit, but would on next line"
^ false].
lastIndex := lastIndex + 1.
^ true
]
{ #category : 'scanning' }
RubCharacterScanner >> plainTab [
"This is the basic method of adjusting destX for a tab."
destX := (alignment = self justified and: [self leadingTab not])
ifTrue: "embedded tabs in justified text are weird"
[destX + ((self tabWidth * self scale) - ((line justifiedTabDeltaFor: spaceCount) * self scale)) max: destX]
ifFalse:
[self nextTabXFrom: destX].
pendingKernX := 0.
firstDestX := destX
]
{ #category : 'scanning' }
RubCharacterScanner >> registerBreakableIndex [
"Record left x and character index of the line-wrappable point.
The default implementation here does nothing."
^ false
]
{ #category : 'accessing' }
RubCharacterScanner >> scale [
self subclassResponsibility
]
{ #category : 'scanning' }
RubCharacterScanner >> scanCharactersFrom: startIndex to: stopIndex in: sourceString rightX: rightX stopConditions: stops kern: kernDelta [
sourceString isByteString
ifTrue: [ ^ self
basicScanCharactersFrom: startIndex
to: stopIndex
in: sourceString
rightX: rightX
stopConditions: stops
kern: kernDelta ].
sourceString isWideString ifFalse: [ ^ stops endOfRun ].
startIndex > stopIndex
ifTrue: [
lastIndex := stopIndex.
^ stops endOfRun ].
^ self
scanMultiCharactersFrom: startIndex
to: stopIndex
in: sourceString
rightX: rightX
stopConditions: stops
kern: kernDelta
]
{ #category : 'scanning' }
RubCharacterScanner >> scanMultiCharactersFrom: startIndex to: stopIndex in: sourceString rightX: rightX stopConditions: stops kern: kernDelta [
| ascii nextDestX maxAscii floatDestX widthAndKernedWidth nextChar atEndOfRun |
lastIndex := startIndex.
lastIndex > stopIndex ifTrue: [lastIndex := stopIndex. ^ stops endOfRun].
font ifNil: [font := TextStyle defaultFont fontArray at: 1].
maxAscii := font maxAscii.
floatDestX := destX.
widthAndKernedWidth := Array new: 2.
atEndOfRun := false.
[lastIndex <= stopIndex] whileTrue: [
ascii := (sourceString at: lastIndex) charCode.
ascii > maxAscii ifTrue: [ascii := maxAscii].
(ascii < stops size and: [(stops at: ascii + 1) ~~ nil])
ifTrue: [^ stops at: ascii + 1].
(self isBreakableAt: lastIndex in: sourceString) ifTrue: [
self registerBreakableIndex ].
nextChar := (lastIndex + 1 <= stopIndex)
ifTrue:[sourceString at: lastIndex + 1]
ifFalse:[
atEndOfRun := true.
"if there is a next char in sourceString, then get the kern
and store it in pendingKernX"
lastIndex + 1 <= sourceString size
ifTrue:[sourceString at: lastIndex + 1]
ifFalse:[ nil]].
font
widthAndKernedWidthOfLeft: (sourceString at: lastIndex)
right: nextChar
into: widthAndKernedWidth.
nextDestX := floatDestX + ((widthAndKernedWidth at: 1) * self scale).
nextDestX > rightX ifTrue: [destX ~= firstDestX ifTrue: [^stops crossedX]].
floatDestX := floatDestX + (kernDelta * self scale) + ((widthAndKernedWidth at: 2) * self scale).
atEndOfRun
ifTrue:[
pendingKernX := ((widthAndKernedWidth at: 2) * self scale) - ((widthAndKernedWidth at: 1) * self scale).
floatDestX := floatDestX - pendingKernX].
destX := floatDestX .
lastIndex := lastIndex + 1.
].
lastIndex := stopIndex.
^ stops endOfRun
]
{ #category : 'private' }
RubCharacterScanner >> setActualFont: aFont [
"Set the basal font to an isolated font reference."
font := aFont
]
{ #category : 'private' }
RubCharacterScanner >> setAlignment: style [
alignment := style
]
{ #category : 'private' }
RubCharacterScanner >> setConditionArray: aSymbol [
aSymbol == #paddedSpace ifTrue: [ ^ stopConditions := PaddedSpaceCondition "copy" ].
"aSymbol == #space ifTrue: [^stopConditions := SpaceCondition copy]."
aSymbol ifNil: [ ^ stopConditions := NilCondition "copy" ].
self error: 'undefined stopcondition for space character'
]
{ #category : 'private' }
RubCharacterScanner >> setFont [
| priorFont |
"Set the font and other emphasis."
priorFont := font.
text ifNotNil: [
emphasisCode := 0.
kern := 0.
indentationLevel := 0.
alignment := textStyle alignment.
font := nil.
(text attributesAt: lastIndex forStyle: textStyle) do: [ :att | att emphasizeScanner: self ] ].
font ifNil: [ self setFont: textStyle defaultFontIndex ].
font := font emphasized: emphasisCode.
priorFont ifNotNil: [
font = priorFont ifTrue: [ "font is the same, perhaps the color has changed?
We still want kerning between chars of the same
font, but of different color. So add any pending kern to destX"
destX := destX + (pendingKernX ifNil: [ 0 ]) ].
destX := destX + (priorFont descentKern * self scale) ].
pendingKernX := 0. "clear any pending kern so there is no danger of it being added twice"
destX := destX - (font descentKern * self scale). "NOTE: next statement should be removed when clipping works"
leftMargin ifNotNil: [ destX := destX max: leftMargin ].
kern := kern - font baseKern. "Install various parameters from the font."
spaceWidth := font widthOf: Character space. " map := font characterToGlyphMap."
stopConditions := DefaultStopConditions
]
{ #category : 'private' }
RubCharacterScanner >> setFont: fontNumber [
"Set the font by number from the textStyle."
self setActualFont: (textStyle fontAt: fontNumber)
]
{ #category : 'accessing' }
RubCharacterScanner >> tabWidth [
^ textStyle rubTabWidth
]
{ #category : 'private' }
RubCharacterScanner >> text: t textStyle: ts [
text := t.
textStyle := ts
]
{ #category : 'private' }
RubCharacterScanner >> textColor: ignored [
"Overridden in DisplayScanner"
]
```
|
The 2006 AFC Challenge Cup was held between 1 and 16 April 2006 in Bangladesh. Sixteen teams were split into four groups, the top two in each group qualifying for the quarterfinals, and from then on a straight knockout contest. There was no qualification stage. The cup winner was Tajikistan. The fair play award was won by Sri Lanka and Tajik Ibrahim Rabimov won the most valuable player award.
Selection of teams
The AFC classed seventeen nations as emerging associations, which need time to develop their football. They were selected in August 2005 to take part. Laos, Mongolia, and Timor-Leste were initially selected to participate, but were later replaced by Bangladesh and India of the developing associations class, reducing the number of participating teams to sixteen.
Hosts and stadia
The AFC decided at its annual meeting, that Bangladesh would host the opening ceremony and that Nepal would host the final unless Bangladesh makes it into the last two, in which case it would be held in Dhaka, its capital. It was originally planned that the teams in Groups A and B would play their games in Nepal and that teams in Groups C and D would play in Bangladesh, but due to the political unrest that shook Nepal, it was decided that only Bangladesh would host the tournament. The Challenge Cup was originally scheduled to take place between 26 March to 9 April 2006 but was changed to avoid clashes with Bangladesh's Independence Day on 26 March. The two stadia that were selected to be used during this tournament were: the Bangabandhu Stadium in Dhaka and the MA Aziz Stadium in Chittagong. However, the Bangladesh Army Stadium in Dhaka was later used to make-up the matches that were abandoned due to heavy rain.
Venues
Teams
Some teams did not take part with their 'main' national squad, as noted below:
India decided to field their under-20 team in preparation for the AFC Youth Championship they were later hosting.
Kyrgyzstan took part with a young squad, made up mostly of players from their under-20 team which had qualified for the AFC Youth Championship.
Squads
Group stage
All times are Bangladesh Standard Time (BST) – UTC+6
Tie-breaking criteria
Where two or more teams end the group stage with the same number of points, their ranking is determined by the following criteria:
points earned in the matches between the teams concerned;
goal difference in the matches between the teams concerned;
number of goals scored in the group matches between the teams concerned;
goal difference in all group matches;
number of goals scored in all group matches;
kicks from the penalty mark (if only two teams are level and they are both on the field of play);
fewer yellow and red cards received in the group matches;
drawing of lots by the organising committee.
Group A
Group B
Group C
Group D
Knockout stage
Quarter-finals
Semi-finals
Final
Winner
Awards
Goalscorers
8 goals
Fahed Attal
5 goals
Pradeep Maharjan
4 goals
Dzhomikhon Mukhidinov
Yusuf Rabiev
3 goals
Vimal Pariyar
Khurshed Makhmudov
2 goals
Hafizullah Qadami
Alfaz Ahmed
Zahid Hasan Ameli
Mohamed Abdul Hossain
Chuang Wei-lun
Chan Kin Seng
Basanta Thapa
Muhammad Essa
Ziyad Al-Kord
Ibrahim Al-Sweirki
Ahmed Keshkesh
Alvin Valeroso
Kasun Jayasuriya
Mohamed Izzadeen
Numonjon Hakimov
Ibrahim Rabimov
1 goal
Sayed Maqsood
Mahadi Tapu
Adie Arsham Salleh
Riwandi Wahit
Sok Buntheang
Keo Kosal
Chan Rithy
Kouch Sokumpheak
Liang Chien-wei
Roman Ablakimov
Ruslan Djamshidov
Azamat Ishenbaev
Andrey Krasnov
Tashi Tsering
Adeel Ahmed
Ismail Al-Amour
Francisco Atura
Sanjaya Pradeep Arachchige
Chandradasa Karunaratne
Jeewantha Dhammika Ratnayaka
Odil Irgashev
Rustam Khojaev
Shujoat Nematov
Notes
References
External links
Official site of the AFC Challenge Cup Bangladesh 2006
AFC Challenge Cup 2006 at RSSSF
AFC Challenge Cup 2006 at FutbolPlanet.de
AFC Challenge Cup
Challenge Cup
AFC Challenge Cup
International association football competitions hosted by Bangladesh
|
The 2004 Solihull Metropolitan Borough Council election took place on 10 June 2004 to elect members of Solihull Metropolitan Borough Council in the West Midlands, England.
The whole council was up for election with boundary changes since the last election in 2003. The Conservative Party stayed in overall control of the council.
Campaign
During the lead up to the election the Labour Party suffered 2 defections. Firstly councillor Jim Ryan quit the party to sit as an independent after disagreements over policy. He was then followed in May 2004 by Jeff Potts who defected to join the Conservatives and blamed infighting within the Labour Party for his decision. Both councillors contested the election, Jim Ryan as an independent, and Jeff Potts as a Conservative in Kingshurst and Fordbridge ward.
The election saw the British National Party (BNP) contest 2 seats in Chelmsley Wood and Olton wards, while the National Front contested Silhill ward. The presence of these candidates led the leaders of each of the Conservative, Liberal Democrat and Labour parties on the council to condemn the policies of both the BNP and National Front.
Election result
The results saw the Conservatives stay in control of the council but with their majority cut from 5 to 3 seats. The Conservative dropped by 1 seat, while the Liberal Democrats became the next largest party on the council after gaining 5 seats. Labour dropped by 5 seats, 3 of which could be put down to the boundary changes, while another seat was lost by Labour to the Conservatives in Kingshurst and Fordbridge. The final Labour loss came in Bickenhill where former Labour councillor Jim Ryan was re-elected onto the council as an independent. Overall turnout increased by 10% from 2003 to reach 39%.
This result had the following consequences for the total number of seats on the council after the elections :
Ward results
By-elections between 2004 and 2006
References
2004 English local elections
2004
2000s in the West Midlands (county)
|
Men's super G World Cup 1999/2000
Final point standings
In men's super G World Cup 1999/2000 all results count. Hermann Maier won his third Super G World Cup in a row. Austrian athletes won six races out of seven.
References
fis-ski.com
World Cup
FIS Alpine Ski World Cup men's super-G discipline titles
|
```html+erb
<% add_decidim_page_title(t(".introduce_user_data")) %>
<div class="item_show__header">
<h1 class="item_show__header-title">
<%= t(".introduce_user_data") %>
<%= link_to t(".reject"), pending_authorization_rejection_path(@pending_authorization), method: :post, class: "button button__sm button__secondary alert button--title destroy" %>
</h1>
</div>
<div class="item__edit item__edit-1col">
<div class="item__edit-form">
<%= decidim_form_for(@form, url: pending_authorization_confirmation_path(@pending_authorization),
html: { class: "form form-defaults" }) do |form| %>
<div class="form__wrapper">
<div class="card">
<div class="card-divider"></div>
<div class="card-section">
<div class="row column">
<%= image_tag @pending_authorization.attached_uploader(:verification_attachment).variant_url(:big), class: "thumbnail" %>
</div>
<div class="row column">
<%= form.select :document_type, @form.document_types_for_select, prompt: true, selected: nil %>
</div>
<div class="row column">
<%= form.text_field :document_number, value: nil %>
</div>
<%= form.hidden_field :verification_type, value: :online %>
</div>
</div>
</div>
<div class="item__edit-sticky">
<div class="item__edit-sticky-container">
<%= form.submit t(".verify"), class: "button button__sm button__secondary" %>
</div>
</div>
<% end %>
</div>
</div>
```
|
The S3 is a railway service of RER Vaud that provides hourly service between and in the Swiss canton of Vaud. A limited number of trains continue to . Swiss Federal Railways, the national railway company of Switzerland, operates the service.
Operations
The S3 operates every hour between and , using the western end of the Simplon line. The S3 makes all local stops between Vallorbe and and between and Aigle. The S3 is paired with the S4 between and Aigle, providing half-hourly service. The S4 makes a limited number of stops between Lausanne and Aigle. Both the S3 and S4 provide limited service beyond Aigle to .
History
The "first" S3 was one of the six original lines of the RER Vaud, then called the Vaud Express Network (, REV), when that system was established in December 2004. It ran hourly between Allaman and , on the Simplon line. With the December 2020 timetable change, the S3 was cut back to Lausanne, with the S5 taking over the Lausanne–Villeneuve service.
The RER Vaud lines were substantially reorganized for the December 2022 timetable change. The "new" S3 was a combination of the former S2 and S5, making local stops on the Simplon line between Vallorbe and Aigle, with limited service from Aigle to St-Maurice.
References
External links
2023 timetable: Vallorbe–Lausanne and Lausanne–St-Maurice
RER Vaud lines
Transport in the canton of Vaud
|
```javascript
const { WebGLKernelValueHTMLImage } = require('./html-image');
class WebGLKernelValueHTMLVideo extends WebGLKernelValueHTMLImage {}
module.exports = {
WebGLKernelValueHTMLVideo
};
```
|
```xml
import { FileIconType } from './FileIconType';
import type { FileIconTypeInput } from './FileIconType';
let allFileTypeIconValues: FileIconType | undefined;
function validateFileIconTypeValues(allowedFileTypeIconValues: FileIconTypeInput | undefined): void {
// The purpose of this function is to verify that the below call compiles,
// which may only occur if every enum value matches its key.
}
describe('Validate Icon Type Values', () => {
it('should validate the enum keys and values', () => {
validateFileIconTypeValues(allFileTypeIconValues);
});
});
```
|
```javascript
var ShootingStar = require('../../lib/candlestick/ShootingStar').default;
var assert = require('assert');
var drawCandleStick = require('draw-candlestick');
var fs = require('fs');
var shootingStarData = [
{
name: 'Bearish',
data: {
open: [29.50, 33.10, 36.00, 42.80, 40.90],
high: [35.90, 37.60, 41.80, 48.80, 43.10],
close: [33.10, 36.00, 40.90, 40.90, 38.05],
low: [26.90, 27.70, 28.00, 40.90, 37.50],
},
},
{
name: 'Bullish',
data: {
open: [29.50, 33.10, 36.00, 40.90, 40.90],
high: [35.90, 37.60, 41.80, 48.80, 43.10],
close: [33.10, 36.00, 40.90, 42.80, 38.05],
low: [26.90, 27.70, 28.00, 40.90, 37.50],
},
},
];
describe('Shooting Star : ', function() {
before(function() {
shootingStarData.forEach((patternSet) => {
var imageBuffer = drawCandleStick(patternSet.data);
fs.writeFileSync(`${__dirname}/images/${patternSet.name.replace(' ', '')}ShootingStar.png`,imageBuffer);
});
});
shootingStarData.forEach((patternSet) => {
it(`Check whether the supplied data has Shooting Star: ${patternSet.name}`, function() {
var hangingMan = new ShootingStar();
var result = hangingMan.hasPattern(patternSet.data);
assert.deepEqual(result, true, `Invalid result for Shooting Star: ${patternSet.name}`);
});
});
})
```
|
```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.
// Code generated by applyconfiguration-gen. DO NOT EDIT.
package v1
import (
monitoringv1 "github.com/prometheus-operator/prometheus-operator/pkg/apis/monitoring/v1"
corev1 "k8s.io/api/core/v1"
metav1 "k8s.io/client-go/applyconfigurations/meta/v1"
)
// AlertmanagerSpecApplyConfiguration represents a declarative configuration of the AlertmanagerSpec type for use
// with apply.
type AlertmanagerSpecApplyConfiguration struct {
PodMetadata *EmbeddedObjectMetadataApplyConfiguration `json:"podMetadata,omitempty"`
Image *string `json:"image,omitempty"`
ImagePullPolicy *corev1.PullPolicy `json:"imagePullPolicy,omitempty"`
Version *string `json:"version,omitempty"`
Tag *string `json:"tag,omitempty"`
SHA *string `json:"sha,omitempty"`
BaseImage *string `json:"baseImage,omitempty"`
ImagePullSecrets []corev1.LocalObjectReference `json:"imagePullSecrets,omitempty"`
Secrets []string `json:"secrets,omitempty"`
ConfigMaps []string `json:"configMaps,omitempty"`
ConfigSecret *string `json:"configSecret,omitempty"`
LogLevel *string `json:"logLevel,omitempty"`
LogFormat *string `json:"logFormat,omitempty"`
Replicas *int32 `json:"replicas,omitempty"`
Retention *monitoringv1.GoDuration `json:"retention,omitempty"`
Storage *StorageSpecApplyConfiguration `json:"storage,omitempty"`
Volumes []corev1.Volume `json:"volumes,omitempty"`
VolumeMounts []corev1.VolumeMount `json:"volumeMounts,omitempty"`
ExternalURL *string `json:"externalUrl,omitempty"`
RoutePrefix *string `json:"routePrefix,omitempty"`
Paused *bool `json:"paused,omitempty"`
NodeSelector map[string]string `json:"nodeSelector,omitempty"`
Resources *corev1.ResourceRequirements `json:"resources,omitempty"`
Affinity *corev1.Affinity `json:"affinity,omitempty"`
Tolerations []corev1.Toleration `json:"tolerations,omitempty"`
TopologySpreadConstraints []corev1.TopologySpreadConstraint `json:"topologySpreadConstraints,omitempty"`
SecurityContext *corev1.PodSecurityContext `json:"securityContext,omitempty"`
ServiceAccountName *string `json:"serviceAccountName,omitempty"`
ListenLocal *bool `json:"listenLocal,omitempty"`
Containers []corev1.Container `json:"containers,omitempty"`
InitContainers []corev1.Container `json:"initContainers,omitempty"`
PriorityClassName *string `json:"priorityClassName,omitempty"`
AdditionalPeers []string `json:"additionalPeers,omitempty"`
ClusterAdvertiseAddress *string `json:"clusterAdvertiseAddress,omitempty"`
ClusterGossipInterval *monitoringv1.GoDuration `json:"clusterGossipInterval,omitempty"`
ClusterLabel *string `json:"clusterLabel,omitempty"`
ClusterPushpullInterval *monitoringv1.GoDuration `json:"clusterPushpullInterval,omitempty"`
ClusterPeerTimeout *monitoringv1.GoDuration `json:"clusterPeerTimeout,omitempty"`
PortName *string `json:"portName,omitempty"`
ForceEnableClusterMode *bool `json:"forceEnableClusterMode,omitempty"`
AlertmanagerConfigSelector *metav1.LabelSelectorApplyConfiguration `json:"alertmanagerConfigSelector,omitempty"`
AlertmanagerConfigNamespaceSelector *metav1.LabelSelectorApplyConfiguration `json:"alertmanagerConfigNamespaceSelector,omitempty"`
AlertmanagerConfigMatcherStrategy *AlertmanagerConfigMatcherStrategyApplyConfiguration `json:"alertmanagerConfigMatcherStrategy,omitempty"`
MinReadySeconds *uint32 `json:"minReadySeconds,omitempty"`
HostAliases []HostAliasApplyConfiguration `json:"hostAliases,omitempty"`
Web *AlertmanagerWebSpecApplyConfiguration `json:"web,omitempty"`
AlertmanagerConfiguration *AlertmanagerConfigurationApplyConfiguration `json:"alertmanagerConfiguration,omitempty"`
AutomountServiceAccountToken *bool `json:"automountServiceAccountToken,omitempty"`
EnableFeatures []string `json:"enableFeatures,omitempty"`
}
// AlertmanagerSpecApplyConfiguration constructs a declarative configuration of the AlertmanagerSpec type for use with
// apply.
func AlertmanagerSpec() *AlertmanagerSpecApplyConfiguration {
return &AlertmanagerSpecApplyConfiguration{}
}
// WithPodMetadata sets the PodMetadata field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the PodMetadata field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithPodMetadata(value *EmbeddedObjectMetadataApplyConfiguration) *AlertmanagerSpecApplyConfiguration {
b.PodMetadata = value
return b
}
// WithImage sets the Image field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Image field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithImage(value string) *AlertmanagerSpecApplyConfiguration {
b.Image = &value
return b
}
// WithImagePullPolicy sets the ImagePullPolicy field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ImagePullPolicy field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithImagePullPolicy(value corev1.PullPolicy) *AlertmanagerSpecApplyConfiguration {
b.ImagePullPolicy = &value
return b
}
// WithVersion sets the Version field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Version field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithVersion(value string) *AlertmanagerSpecApplyConfiguration {
b.Version = &value
return b
}
// WithTag sets the Tag field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Tag field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithTag(value string) *AlertmanagerSpecApplyConfiguration {
b.Tag = &value
return b
}
// WithSHA sets the SHA field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the SHA field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithSHA(value string) *AlertmanagerSpecApplyConfiguration {
b.SHA = &value
return b
}
// WithBaseImage sets the BaseImage field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the BaseImage field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithBaseImage(value string) *AlertmanagerSpecApplyConfiguration {
b.BaseImage = &value
return b
}
// WithImagePullSecrets adds the given value to the ImagePullSecrets field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the ImagePullSecrets field.
func (b *AlertmanagerSpecApplyConfiguration) WithImagePullSecrets(values ...corev1.LocalObjectReference) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.ImagePullSecrets = append(b.ImagePullSecrets, values[i])
}
return b
}
// WithSecrets adds the given value to the Secrets field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the Secrets field.
func (b *AlertmanagerSpecApplyConfiguration) WithSecrets(values ...string) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.Secrets = append(b.Secrets, values[i])
}
return b
}
// WithConfigMaps adds the given value to the ConfigMaps field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the ConfigMaps field.
func (b *AlertmanagerSpecApplyConfiguration) WithConfigMaps(values ...string) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.ConfigMaps = append(b.ConfigMaps, values[i])
}
return b
}
// WithConfigSecret sets the ConfigSecret field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ConfigSecret field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithConfigSecret(value string) *AlertmanagerSpecApplyConfiguration {
b.ConfigSecret = &value
return b
}
// WithLogLevel sets the LogLevel field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the LogLevel field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithLogLevel(value string) *AlertmanagerSpecApplyConfiguration {
b.LogLevel = &value
return b
}
// WithLogFormat sets the LogFormat field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the LogFormat field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithLogFormat(value string) *AlertmanagerSpecApplyConfiguration {
b.LogFormat = &value
return b
}
// WithReplicas sets the Replicas field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Replicas field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithReplicas(value int32) *AlertmanagerSpecApplyConfiguration {
b.Replicas = &value
return b
}
// WithRetention sets the Retention field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Retention field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithRetention(value monitoringv1.GoDuration) *AlertmanagerSpecApplyConfiguration {
b.Retention = &value
return b
}
// WithStorage sets the Storage field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Storage field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithStorage(value *StorageSpecApplyConfiguration) *AlertmanagerSpecApplyConfiguration {
b.Storage = value
return b
}
// WithVolumes adds the given value to the Volumes field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the Volumes field.
func (b *AlertmanagerSpecApplyConfiguration) WithVolumes(values ...corev1.Volume) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.Volumes = append(b.Volumes, values[i])
}
return b
}
// WithVolumeMounts adds the given value to the VolumeMounts field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the VolumeMounts field.
func (b *AlertmanagerSpecApplyConfiguration) WithVolumeMounts(values ...corev1.VolumeMount) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.VolumeMounts = append(b.VolumeMounts, values[i])
}
return b
}
// WithExternalURL sets the ExternalURL field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ExternalURL field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithExternalURL(value string) *AlertmanagerSpecApplyConfiguration {
b.ExternalURL = &value
return b
}
// WithRoutePrefix sets the RoutePrefix field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the RoutePrefix field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithRoutePrefix(value string) *AlertmanagerSpecApplyConfiguration {
b.RoutePrefix = &value
return b
}
// WithPaused sets the Paused field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Paused field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithPaused(value bool) *AlertmanagerSpecApplyConfiguration {
b.Paused = &value
return b
}
// WithNodeSelector puts the entries into the NodeSelector field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, the entries provided by each call will be put on the NodeSelector field,
// overwriting an existing map entries in NodeSelector field with the same key.
func (b *AlertmanagerSpecApplyConfiguration) WithNodeSelector(entries map[string]string) *AlertmanagerSpecApplyConfiguration {
if b.NodeSelector == nil && len(entries) > 0 {
b.NodeSelector = make(map[string]string, len(entries))
}
for k, v := range entries {
b.NodeSelector[k] = v
}
return b
}
// WithResources sets the Resources field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Resources field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithResources(value corev1.ResourceRequirements) *AlertmanagerSpecApplyConfiguration {
b.Resources = &value
return b
}
// WithAffinity sets the Affinity field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Affinity field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithAffinity(value corev1.Affinity) *AlertmanagerSpecApplyConfiguration {
b.Affinity = &value
return b
}
// WithTolerations adds the given value to the Tolerations field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the Tolerations field.
func (b *AlertmanagerSpecApplyConfiguration) WithTolerations(values ...corev1.Toleration) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.Tolerations = append(b.Tolerations, values[i])
}
return b
}
// WithTopologySpreadConstraints adds the given value to the TopologySpreadConstraints field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the TopologySpreadConstraints field.
func (b *AlertmanagerSpecApplyConfiguration) WithTopologySpreadConstraints(values ...corev1.TopologySpreadConstraint) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.TopologySpreadConstraints = append(b.TopologySpreadConstraints, values[i])
}
return b
}
// WithSecurityContext sets the SecurityContext field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the SecurityContext field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithSecurityContext(value corev1.PodSecurityContext) *AlertmanagerSpecApplyConfiguration {
b.SecurityContext = &value
return b
}
// WithServiceAccountName sets the ServiceAccountName field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ServiceAccountName field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithServiceAccountName(value string) *AlertmanagerSpecApplyConfiguration {
b.ServiceAccountName = &value
return b
}
// WithListenLocal sets the ListenLocal field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ListenLocal field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithListenLocal(value bool) *AlertmanagerSpecApplyConfiguration {
b.ListenLocal = &value
return b
}
// WithContainers adds the given value to the Containers field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the Containers field.
func (b *AlertmanagerSpecApplyConfiguration) WithContainers(values ...corev1.Container) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.Containers = append(b.Containers, values[i])
}
return b
}
// WithInitContainers adds the given value to the InitContainers field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the InitContainers field.
func (b *AlertmanagerSpecApplyConfiguration) WithInitContainers(values ...corev1.Container) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.InitContainers = append(b.InitContainers, values[i])
}
return b
}
// WithPriorityClassName sets the PriorityClassName field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the PriorityClassName field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithPriorityClassName(value string) *AlertmanagerSpecApplyConfiguration {
b.PriorityClassName = &value
return b
}
// WithAdditionalPeers adds the given value to the AdditionalPeers field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the AdditionalPeers field.
func (b *AlertmanagerSpecApplyConfiguration) WithAdditionalPeers(values ...string) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.AdditionalPeers = append(b.AdditionalPeers, values[i])
}
return b
}
// WithClusterAdvertiseAddress sets the ClusterAdvertiseAddress field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ClusterAdvertiseAddress field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithClusterAdvertiseAddress(value string) *AlertmanagerSpecApplyConfiguration {
b.ClusterAdvertiseAddress = &value
return b
}
// WithClusterGossipInterval sets the ClusterGossipInterval field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ClusterGossipInterval field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithClusterGossipInterval(value monitoringv1.GoDuration) *AlertmanagerSpecApplyConfiguration {
b.ClusterGossipInterval = &value
return b
}
// WithClusterLabel sets the ClusterLabel field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ClusterLabel field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithClusterLabel(value string) *AlertmanagerSpecApplyConfiguration {
b.ClusterLabel = &value
return b
}
// WithClusterPushpullInterval sets the ClusterPushpullInterval field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ClusterPushpullInterval field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithClusterPushpullInterval(value monitoringv1.GoDuration) *AlertmanagerSpecApplyConfiguration {
b.ClusterPushpullInterval = &value
return b
}
// WithClusterPeerTimeout sets the ClusterPeerTimeout field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ClusterPeerTimeout field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithClusterPeerTimeout(value monitoringv1.GoDuration) *AlertmanagerSpecApplyConfiguration {
b.ClusterPeerTimeout = &value
return b
}
// WithPortName sets the PortName field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the PortName field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithPortName(value string) *AlertmanagerSpecApplyConfiguration {
b.PortName = &value
return b
}
// WithForceEnableClusterMode sets the ForceEnableClusterMode field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the ForceEnableClusterMode field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithForceEnableClusterMode(value bool) *AlertmanagerSpecApplyConfiguration {
b.ForceEnableClusterMode = &value
return b
}
// WithAlertmanagerConfigSelector sets the AlertmanagerConfigSelector field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the AlertmanagerConfigSelector field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithAlertmanagerConfigSelector(value *metav1.LabelSelectorApplyConfiguration) *AlertmanagerSpecApplyConfiguration {
b.AlertmanagerConfigSelector = value
return b
}
// WithAlertmanagerConfigNamespaceSelector sets the AlertmanagerConfigNamespaceSelector field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the AlertmanagerConfigNamespaceSelector field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithAlertmanagerConfigNamespaceSelector(value *metav1.LabelSelectorApplyConfiguration) *AlertmanagerSpecApplyConfiguration {
b.AlertmanagerConfigNamespaceSelector = value
return b
}
// WithAlertmanagerConfigMatcherStrategy sets the AlertmanagerConfigMatcherStrategy field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the AlertmanagerConfigMatcherStrategy field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithAlertmanagerConfigMatcherStrategy(value *AlertmanagerConfigMatcherStrategyApplyConfiguration) *AlertmanagerSpecApplyConfiguration {
b.AlertmanagerConfigMatcherStrategy = value
return b
}
// WithMinReadySeconds sets the MinReadySeconds field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the MinReadySeconds field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithMinReadySeconds(value uint32) *AlertmanagerSpecApplyConfiguration {
b.MinReadySeconds = &value
return b
}
// WithHostAliases adds the given value to the HostAliases field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the HostAliases field.
func (b *AlertmanagerSpecApplyConfiguration) WithHostAliases(values ...*HostAliasApplyConfiguration) *AlertmanagerSpecApplyConfiguration {
for i := range values {
if values[i] == nil {
panic("nil value passed to WithHostAliases")
}
b.HostAliases = append(b.HostAliases, *values[i])
}
return b
}
// WithWeb sets the Web field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Web field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithWeb(value *AlertmanagerWebSpecApplyConfiguration) *AlertmanagerSpecApplyConfiguration {
b.Web = value
return b
}
// WithAlertmanagerConfiguration sets the AlertmanagerConfiguration field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the AlertmanagerConfiguration field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithAlertmanagerConfiguration(value *AlertmanagerConfigurationApplyConfiguration) *AlertmanagerSpecApplyConfiguration {
b.AlertmanagerConfiguration = value
return b
}
// WithAutomountServiceAccountToken sets the AutomountServiceAccountToken field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the AutomountServiceAccountToken field is set to the value of the last call.
func (b *AlertmanagerSpecApplyConfiguration) WithAutomountServiceAccountToken(value bool) *AlertmanagerSpecApplyConfiguration {
b.AutomountServiceAccountToken = &value
return b
}
// WithEnableFeatures adds the given value to the EnableFeatures field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the EnableFeatures field.
func (b *AlertmanagerSpecApplyConfiguration) WithEnableFeatures(values ...string) *AlertmanagerSpecApplyConfiguration {
for i := range values {
b.EnableFeatures = append(b.EnableFeatures, values[i])
}
return b
}
```
|
```objective-c
/*********************************************************************
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of Willow Garage nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*********************************************************************/
/* Author: Dave Coleman */
#pragma once
// Qt
class QComboBox;
class QLabel;
class QLineEdit;
class QPushButton;
class QScrollArea;
class QSlider;
class QStackedWidget;
class QTableWidget;
class QVBoxLayout;
// SA
#ifndef Q_MOC_RUN
#include <moveit/setup_assistant/tools/moveit_config_data.h>
#endif
#include "setup_screen_widget.h" // a base class for screens in the setup assistant
namespace moveit_setup_assistant
{
class RobotPosesWidget : public SetupScreenWidget
{
Q_OBJECT
public:
// ******************************************************************************************
// Public Functions
// ******************************************************************************************
RobotPosesWidget(QWidget* parent, const MoveItConfigDataPtr& config_data);
/// Received when this widget is chosen from the navigation menu
void focusGiven() override;
// ******************************************************************************************
// Qt Components
// ******************************************************************************************
QTableWidget* data_table_;
QPushButton* btn_edit_;
QPushButton* btn_delete_;
QPushButton* btn_save_;
QPushButton* btn_cancel_;
QStackedWidget* stacked_widget_;
QScrollArea* scroll_area_;
QVBoxLayout* column2_;
QLineEdit* pose_name_field_;
QComboBox* group_name_field_;
QWidget* joint_list_widget_;
QVBoxLayout* joint_list_layout_;
QWidget* pose_list_widget_;
QWidget* pose_edit_widget_;
QLabel* collision_warning_;
private Q_SLOTS:
// ******************************************************************************************
// Slot Event Functions
// ******************************************************************************************
/// Show edit screen
void showNewScreen();
/// Edit whatever element is selected
void editSelected();
/// Edit the double clicked element
void editDoubleClicked(int row, int column);
/// Preview whatever element is selected
void previewClicked(int row, int column, int previous_row, int previous_column);
/// Delete currently editing ite
void deleteSelected();
/// Save editing changes
void doneEditing();
/// Cancel changes
void cancelEditing();
/// Run this whenever the group is changed
void loadJointSliders(const QString& selected);
/// Show the robot in its default joint positions
void showDefaultPose();
/// Play through the poses
void playPoses();
/**
* Call when one of the sliders has its value changed to store its value in kinematic model
*
* @param name - name of joint being changed
* @param value - value of joint
*/
void updateRobotModel(const std::string& name, double value);
/// Publishes a joint state message based on all the slider locations in a planning group, to rviz
void publishJoints();
private:
// ******************************************************************************************
// Variables
// ******************************************************************************************
/// Contains all the configuration data for the setup assistant
moveit_setup_assistant::MoveItConfigDataPtr config_data_;
/// Pointer to currently edited group state
srdf::Model::GroupState* current_edit_pose_;
/// Remember the publisher for quick publishing later
ros::Publisher pub_robot_state_;
// ******************************************************************************************
// Collision Variables
// ******************************************************************************************
collision_detection::CollisionRequest request;
// ******************************************************************************************
// Private Functions
// ******************************************************************************************
/**
* Find the associated data by name
*
* @param name - name of data to find in datastructure
* @return pointer to data in datastructure
*/
srdf::Model::GroupState* findPoseByName(const std::string& name, const std::string& group);
/**
* Create the main list view of poses for robot
*
* @return the widget
*/
QWidget* createContentsWidget();
/**
* Create the screen for editing poses
*
* @return the widget
*/
QWidget* createEditWidget();
/**
* Load the robot poses into the table
*
*/
void loadDataTable();
/**
* Populate the combo dropdown box with avail group names
*
*/
void loadGroupsComboBox();
/**
* Edit the pose with the input name
*
* @param name name of pose
*/
void edit(int row);
/**
* Show the robot in the current pose
*/
void showPose(srdf::Model::GroupState* pose);
};
// ******************************************************************************************
// ******************************************************************************************
// Slider Widget
// ******************************************************************************************
// ******************************************************************************************
class SliderWidget : public QWidget
{
Q_OBJECT
public:
// ******************************************************************************************
// Public Functions
// ******************************************************************************************
/**
* Constructor
*
* @param parent - parent QWidget
* @param joint_model_ - a ptr reference to the joint this widget represents
*/
SliderWidget(QWidget* parent, const moveit::core::JointModel* joint_model, double init_value);
/**
* Deconstructor
*/
~SliderWidget() override;
// ******************************************************************************************
// Qt Components
// ******************************************************************************************
QLabel* joint_label_;
QSlider* joint_slider_;
QLineEdit* joint_value_;
private Q_SLOTS:
// ******************************************************************************************
// Slot Event Functions
// ******************************************************************************************
/// Called when the joint value slider is changed
void changeJointValue(int value);
/// Called when the joint value box is changed
void changeJointSlider();
Q_SIGNALS:
// ******************************************************************************************
// Emitted Signal Functions
// ******************************************************************************************
/// Indicate joint name and value when slider widget changed
void jointValueChanged(const std::string& name, double value);
private:
// ******************************************************************************************
// Variables
// ******************************************************************************************
// Ptr to the joint's data
const moveit::core::JointModel* joint_model_;
// Max & min position
double max_position_;
double min_position_;
// ******************************************************************************************
// Private Functions
// ******************************************************************************************
};
} // namespace moveit_setup_assistant
// Declare std::string as metatype so we can use it in a signal
Q_DECLARE_METATYPE(std::string)
```
|
```shell
Detect your linux distribution
List currently logged in users
Find out if the system's architecture is 32 or 64 bit
Cancel a system shutdown
Finding Open Files With `lsof`
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.