text
stringlengths
1
22.8M
The Fan can refer to: Places Fan district, a neighborhood in Richmond, Virginia Beijing National Indoor Stadium (nicknamed: The Fan), Beijing, China; a facility built for the 2008 Olympics, and used in the 2022 Olympics/Paralympics Literature The Fan (play), 1763 and 1765 comedy by Carlo Goldoni The Fan (Abrahams novel), a 1995 novel by US author Peter Abrahams The Fan (Randall novel) Films and TV The Fan (1949 film), starring Martita Hunt and directed by Otto Preminger The Fan (1981 film), starring Lauren Bacall, Michael Biehn, Dwight Schultz and Hector Elizondo based on The Fan, a 1977 novel by author Bob Randall Der Fan (1982), starring Désirée Nosbusch and Bodo Steiger The Fan (1996 film), starring Robert De Niro and Wesley Snipes, and directed by Tony Scott La Fan, Mexican telenovela 2017 "The Fan", the fifth episode of the Tenacious D TV series The Fan, a villain from anime Triangle Heart The Fan, 2018 South Korean TV variety, SBS The Fan (rugby league), a Fox League show Radio The Fan, the on-air brand of sport radio stations in Canada owned by Rogers Communications, including CJCL (AM) in Toronto, Ontario and CFAC (AM) in Calgary, Alberta The Fan, the on-air brand of sports radio stations in the United States owned by CBS Radio, most notably WFAN in New York City; the "Fan" branding is also used many radio stations under other owners throughout the United States Other Uses The Fan (card game), another name for La Belle Lucie, a patience game See also Fan (disambiguation)
The cantons of Saint-Denis are administrative divisions of Réunion, an overseas department and region of France. Since the French canton reorganisation which came into effect in March 2015, the city of Saint-Denis is subdivided into 4 cantons. Their seat is in Saint-Denis. Cantons References Cantons of Réunion
```c++ #include "Scanline.h" #include <cstdlib> #include "arithmetics.hpp" namespace msdfgen { static int compareIntersections(const void *a, const void *b) { return sign(reinterpret_cast<const Scanline::Intersection *>(a)->x-reinterpret_cast<const Scanline::Intersection *>(b)->x); } bool interpretFillRule(int intersections, FillRule fillRule) { switch (fillRule) { case FILL_NONZERO: return intersections != 0; case FILL_ODD: return intersections&1; case FILL_POSITIVE: return intersections > 0; case FILL_NEGATIVE: return intersections < 0; } return false; } double Scanline::overlap(const Scanline &a, const Scanline &b, double xFrom, double xTo, FillRule fillRule) { double total = 0; bool aInside = false, bInside = false; int ai = 0, bi = 0; double ax = !a.intersections.empty() ? a.intersections[ai].x : xTo; double bx = !b.intersections.empty() ? b.intersections[bi].x : xTo; while (ax < xFrom || bx < xFrom) { double xNext = min(ax, bx); if (ax == xNext && ai < (int) a.intersections.size()) { aInside = interpretFillRule(a.intersections[ai].direction, fillRule); ax = ++ai < (int) a.intersections.size() ? a.intersections[ai].x : xTo; } if (bx == xNext && bi < (int) b.intersections.size()) { bInside = interpretFillRule(b.intersections[bi].direction, fillRule); bx = ++bi < (int) b.intersections.size() ? b.intersections[bi].x : xTo; } } double x = xFrom; while (ax < xTo || bx < xTo) { double xNext = min(ax, bx); if (aInside == bInside) total += xNext-x; if (ax == xNext && ai < (int) a.intersections.size()) { aInside = interpretFillRule(a.intersections[ai].direction, fillRule); ax = ++ai < (int) a.intersections.size() ? a.intersections[ai].x : xTo; } if (bx == xNext && bi < (int) b.intersections.size()) { bInside = interpretFillRule(b.intersections[bi].direction, fillRule); bx = ++bi < (int) b.intersections.size() ? b.intersections[bi].x : xTo; } x = xNext; } if (aInside == bInside) total += xTo-x; return total; } Scanline::Scanline() : lastIndex(0) { } void Scanline::preprocess() { lastIndex = 0; if (!intersections.empty()) { qsort(&intersections[0], intersections.size(), sizeof(Intersection), compareIntersections); int totalDirection = 0; for (std::vector<Intersection>::iterator intersection = intersections.begin(); intersection != intersections.end(); ++intersection) { totalDirection += intersection->direction; intersection->direction = totalDirection; } } } void Scanline::setIntersections(const std::vector<Intersection> &intersections) { this->intersections = intersections; preprocess(); } #ifdef MSDFGEN_USE_CPP11 void Scanline::setIntersections(std::vector<Intersection> &&intersections) { this->intersections = (std::vector<Intersection> &&) intersections; preprocess(); } #endif int Scanline::moveTo(double x) const { if (intersections.empty()) return -1; int index = lastIndex; if (x < intersections[index].x) { do { if (index == 0) { lastIndex = 0; return -1; } --index; } while (x < intersections[index].x); } else { while (index < (int) intersections.size()-1 && x >= intersections[index+1].x) ++index; } lastIndex = index; return index; } int Scanline::countIntersections(double x) const { return moveTo(x)+1; } int Scanline::sumIntersections(double x) const { int index = moveTo(x); if (index >= 0) return intersections[index].direction; return 0; } bool Scanline::filled(double x, FillRule fillRule) const { return interpretFillRule(sumIntersections(x), fillRule); } } ```
The BBC Big Screens are LED screens with sound systems situated in prominent locations in city centres in the United Kingdom. The project setting up these screens involved the BBC, LOCOG (London Organising Committee of the Olympic Games and Paralympic Games), and local councils. The premise on which the screens are operated is as a platform for all, to provide local information, and to allow filmmakers and other visual artists a platform on which to display their work. There are 21 Big Screens in cities across the UK. Between 2002 and 2013 the BBC operated these screens, but the BBC department to manage the screens centrally closed in 2013 following funding cuts. Since 2013, some of the screens have been decommissioned, and some have been transferred to local authority ownership, where they continue to operate. Locations Belfast Big Screen Belfast is in Donegall Square in the grounds of Belfast City Hall, and was installed in May 2011, the first Big Screen in Northern Ireland. In 2013 ownership of the screen transferred to Belfast City Council, but it was put up for auction in 2017 due to council funding cuts. Birmingham The Big Screen was temporarily installed adjacent to the Birmingham Town Hall during its refurbishment. The Big Screen in Birmingham was removed from Chamberlain Square on 19 September 2007 after the renovation of the Town Hall was completed. It was then erected in Victoria Square in November 2007. Some controversy has existed over the screen in terms of the number of objections to the renewal of its planning permission. Three years after it was due to be switched back on it had finally been fully activated. However, funding was cut by the BBC and the Big Screen was switched off on 10 December 2012, Birmingham City Council have yet to remove the screen due to budget cuts themselves. Bradford Big Screen Bradford is situated in Centenary Square, at the heart of Bradford City Centre. Adjacent to City Hall and the new urban park development. Bristol We The Curious Big Screen is a public screen based in Millennium Square, Bristol on the We The Curious building (formerly At-Bristol). The Big Screen was installed by the London Organising Committee for the London 2012 Olympic and Paralympic Games for the London 2012 Olympics (LOCOG). At the end of 2012, the Screen was gifted to Bristol City Council, who then gifted it to We The Curious. The Big Screen is now a free community resource that provides the people of Bristol with free film screenings, public information, and content, as well as providing local groups and charity organisations the opportunity to showcase their work and message. Cardiff Big Screen Cardiff is located at the Hayes. Coventry Big Screen Coventry is situated at the Coventry Transport Museum, Millennium Place. In 2018 it was revealed that the screen is no longer operational but has not been removed. Derby Big Screen Derby was installed in 2007. The screen was a partnership between the BBC, Derby City Council, the University of Derby and LOCOG and was located in the Market Place next to the Assembly Rooms. In early September 2013, the screen was removed by Derby City Council in a cost-cutting exercise, although its return in some form has not been ruled out. Derry Big Screen Derry was one of the most recent screens to be launched, and the second in Northern Ireland. It was installed in Waterloo Place in November 2011, and was a focal point during both the 2012 Olympics and also Derry's City of Culture celebrations in 2013. In 2017, Derry City Council suggested that it may be removed as the "location has not proved a success". Dover The Dover Big Screen was in Market Square, next to the museum and library. In September 2013, Dover District Council voted to remove it, due to maintenance costs, a lack of available parts and the BBC's decision to no longer provide content or technical support. Edinburgh Big Screen Edinburgh was located in Festival Square, across the road from the cultural trio of Usher Hall, Lyceum and Traverse Theatres. The screen was decommissioned by The City of Edinburgh Council in March 2015. Leeds Big Screen Leeds, launched in late 2005, can be found in Millennium Square. Leicester Big Screen Leicester was unveiled in January 2010 and is located in Humberstone Gate. Manchester Big Screen Manchester was the first Big Screen within the pilot project to be launched in May 2003. The BBC had already explored screens in relation to events such as Proms in the Park, the 2002 World Cup and the Manchester Commonwealth Games. For the Queen's Golden Jubilee ten temporary screens were installed in major cities around the UK. Due to their success, Manchester became the first permanent screen and from this the project has grown. Big Screen Manchester is housed in Exchange Square, a busy public area regenerated after the IRA bomb in 1996. A new Big Screen was installed Spring 2010, replacing the 7-year-old original. Middlesbrough Big Screen Middlesbrough is located in Centre Square. Norwich Big Screen Norwich is situated on Chapelfield Plain which is in the heart of Norwich City Centre. Plymouth Big Screen Plymouth is located in Armada Way on the Piazza. Portsmouth Big Screen Portsmouth is in Guildhall Square, beside the Civic Offices and Portsmouth Guildhall. It is currently operated as a partnership between Portsmouth City Council and University of Portsmouth. Swansea Big Screen Swansea is located in Castle Square, in the heart of the city centre. Swindon Big Screen Swindon is sited within the town's main shopping centre at Wharf Green. The screen was bought for Swindon Borough Council by the New Swindon Company as part of a project to redevelop the Wharf Green area in 2008. Waltham Forest Waltham Forest is an outer London borough situated north east of the city. The Big Screen is located in Walthamstow Town Square, installed in time for the Beijing 2008 Olympics. Woolwich Woolwich, in the Royal Borough of Greenwich, received its Big Screen installation in General Gordon Square in 2009. The Big Screen was temporarily switched off during the redesign of General Gordon Place, 2010–2011. Previous locations Hull Big Screen Hull was launched at the turning on of the city's Christmas lights in November 2004. The screen's erection was surrounded by controversy when it emerged that local councillor Colin Inglis had authorised the purchase of the screen without the matter reaching a council committee. When the five-year contract between Hull City Council, Philips and the BBC ended in 2009, the screen was dismantled and moved into storage. Liverpool Big Screen Liverpool was situated in Clayton Square, in the heart of Liverpool's retail quarter. In May 2015 it was announced that the screen was due to be removed due to unrepairable faults. References External links BBC Big Screens Website London 2012 Live Sites Website Refractive Index An artistic project residing on the Big Screens system BBC
The Glenwood Cluster is a region in the George Washington and Jefferson National Forests recognized by The Wilderness Society for its rich biodiversity, scenery, wildflower displays, cold-water trout streams and horse trails. It offers a unique habitat for rare plants, salamanders and other rare species. The Blue Ridge Parkway and the Appalachian Trail traverse the area, giving ready access with views to the east of the Piedmont region and to the west of the Valley of Virginia. Description The region includes wilderness areas protected by Congressional action, inventoried wilderness, and uninventoried areas recognized by the Wilderness Society as worthy of protection from timbering and roads. A corridor along the Blue Ridge Parkway, managed by the National Park Service, and forest service land in the Glenwood Ranger District act as a buffer for the protected areas. The following areas are in the cluster: James River Face Wilderness Thunder Ridge Wilderness James River Face Wilderness Addition White Oak Ridge-Terrapin Mountain North Creek (conservation area) Wilson Mountain Cove Mountain Location and access Flanking the Blue Ridge Parkway, the region is south and east of the James River where the river turns east to cut through the Blue Ridge Mountains. It is 20 miles northwest of Roanoke, Virginia and about two miles southeast of Glasgow, Virginia. Interstate 81 parallels the area on the west and Va 122 on the east. The section of the Blue Ridge Parkway travelling through the cluster can be accessed from US 501 on the north and VA 43 on the south. Other roads in the area are shown on National Geographic Map 789, Lexington and Blue Ridge Mountains. The Blue Ridge Parkway, completed in 1935, follows the mountain tops at an average elevation of 3000 feet, giving access to scenic overlooks and natural areas along the way. Recreation areas in the Glenwood District include Cave Mountain Lake Recreation Area, a campground 8 miles south of Natural Bridge, Middle Creek Picnic Area, about 7 miles west of Buchanan, North Creek Campground, about seven miles from Buchanan, and the Locher Tract, a primitive picnic area about seven miles east of Natural Bridge. The Glenwood Information Center is in Natural Bridge, Virginia and the ranger’s district office is 1.5 miles south of Natural Bridge. Appalachian Trail The Appalachian Trail extends for 2185 miles from Mount Katahdin in Maine to Springer Mountain in Georgia. A 43 mile section of the trail passes through the cluster from its crossing of the James River on the north to VA 43 on the south. The route is indicated by a red-dashed line on the map of the cluster on this page. A high resolution map of the cluster is obtained by selecting the icon in the lower right of the window, then clicking on the map. The map shows side trails and shelters along the trail. The trail can be broken into the following sections, with a link to access and parking information: James River (US 501) to Petite Gap (USFS 35), 9 miles. Petites Gap (USFS 35) to Parkers Gap Road (USFS 812), 7.3 miles. Parkers Gap Road (USFS 812) to Jennings Creek Road (VA 614), 11.4 miles. Jennings Creek Road (VA 614) to Bearwallow Gap (VA 43), 6.6 miles. Blue Ridge Parkway The Blue Ridge Parkway connects the Skyline Drive on the north with the Great Smoky Mountains National Park on the south. From its low point at the James River with an elevation of 649 feet, it climbs to an elevation of 3950 feet at Apple Orchard Mountain. The road, with no stop-signs or billboards, is a scenic drive connecting overlooks to the west and east. Its construction overcame steep terrain, eroded mountainsides, granite and gneiss bedrock and extreme winter weather. Stonemasons from Italy and Spain built the sturdy walls and bridges still seen today. After legislation authorizing construction was passed in 1936, the highway was finished 51 years later in 1987. The highway, administered by the National Park Service, is closed when snow and ice create driving hazards. To maintain the rural views along the road, the National Park Service works with landowners of adjacent property and coalitions of citizens and state organizations to maintain visual guidelines. Support groups include Friends of the Blue Ridge Parkway and the Blue Ridge Parkway Foundation. Geologic history The geology of the Glenwood Cluster has evolved over hundreds of millions of years. During this time, oceans were formed, each leaving a layer of sediment on its ocean bed. These ocean beds would be layered on top of one another, except for stress in the Earth's crust that created folds pushing the beds on top of one another. The result has left a challenge for geologists to determine the history of rock now found in the area. There is general agreement that the rocks in the Blue Ridge are the oldest rocks in the state, some being formed at least 1.8 billion years ago. The landforms in Virginia are part of five provinces—the Appalachian Plateau, Ridge and Valley, Blue Ridge, Piedmont and Coastal plain. The Glenwood Cluster is located in the Blue Ridge Province, with the Piedmont Province to the east and the Ridge and Valley to the west. The Blue Ridge, the easternmost of the Appalachian Mountains, extends from Georgia to Pennsylvania, with widths ranging from . In some places the province is a single ridge, while in other places it is a complex of closely spaced ridges. Rocks include Precambrian granite, gneiss, and metamorphosed volcanic rock of the late Precambrian. James River One of the major river systems draining Virginia, the James River has formed large fluvial landscapes within the physiographic provinces of the Ridge and Valley Appalachians, the Blue Ridge Mountains, the Piedmont, and the Atlantic coastal plain. Water and sediments, collected from the large watershed of the James, are transported across the grain of the rock-controlled Ridge-and-Valley and Blue-Ridge provinces to downstream valleys now containing the signature of the evolution of the landscape in the river's watershed over millions of years. Beginning at the junction of the Cowpasture and Jackson rivers in the Allegheny Mountains of western Virginia, the James River flows for about to Chesapeake Bay, where it has become wide. The course of the river was formed over hundreds of millions of years as it followed faults in the earth's crust. Over time, it cut through of an ancient ocean's sediment to reach a bedrock of quartzite in the present-day Blue Ridge Mountains, creating a gorge through which the river now flows to reach Chesapeake Bay. Natural history Clusters of wild areas, such as the Glenwood Cluster, are important for the maintenance of biological diversity. A natural landscape contains a blend of ecosystems—mountain slopes, moist areas, soil types, temperatures—over which species can roam in their search for mates, foraging for food, and the avoidance of predators and other stress-inducing hazards. The construction of roads breaks up the landscape into islands which limit the free migration of forest species. Such edge effects have been shown to minimize the diversity required for the maintenance of a rich biological habitat. The bird population is also affected by the division of undisturbed forest into islands with edges defined by roads. Predators of birds, such as raccoons, snakes, skunks, house cats and egg-eating crows and blue jays, are often found at forest edges. And roads provide a pathway for Brown-headed cowbirds in their search for the location of nests of smaller birds, who then destroy the eggs and replace them with their own eggs leaving the unwitting owner to raise the cowbird hatchlings. The Glenwood Cluster is divided by several roads, the largest being the Blue Ridge Parkway that divides the White Oak Ridge-Terrapin Mountain area from the rest of the cluster. The cluster contains pockets of old-growth forests, wild and complex mixtures of different species and ages of trees supporting a great diversity of organisms living in a relationship that has evolved over many centuries. As land is being developed, these forests are becoming rare. There are several pockets of old-growth forest in the cluster—the James River Face Wilderness contains as much as of old-growth forest in a steep, rocky terrain that was difficult to log. Glenwood Ranger District The Glenwood cluster lies within the Glenwood Ranger District of the George Washington and Jefferson National Forest. The district has an area of , with a large part created from the Glenwood Estate lands. Forests in the area were cut and recut to supply charcoal for the production of pig iron. The Glenwood Furnace, in the Arnold Valley, was built in 1849 and last operated in 1876. Historical records indicate that the furnace employed 148 men, women and children in 1864. Old charcoal furnaces are part of the historic sites of the Glenwood Ranger District. Repeated cutting for the furnaces led in part to the successive forests that are present today. The early Glenwood purchase unit was composed of 60–90% American chestnut, a favored slope species by silvicultural techniques in 1914. A blight, discovered in 1912, progressed to the point that by 1922 foresters were salvaging the tree before its destruction by the blight. Pulpwood and extractwood contractors cut about 200,000 cords of wood on the Glenwood land between 1930 and 1950. The district sold almost 75,000 million board feet of chestnut in its first 38 years, and by 1951 only an estimated 4400 million board feet remained in the district. Other clusters Other clusters of the Wilderness Society's "Mountain Treasures" in the Jefferson National Forest (north to south): Craig Creek Cluster Barbours Creek-Shawvers Run Cluster Sinking Creek Valley Cluster Mountain Lake Wilderness Cluster Angels Rest Cluster Walker Mountain Cluster Kimberling Creek Cluster Garden Mountain Cluster Mount Rogers Cluster Clinch Ranger District Cluster References Further reading Stephenson, Steven L., A Natural History of the Central Appalachians, 2013, West Virginia University Press, West Virginia, . Davis, Donald Edward, Where There Are Mountains, An Environmental History of the Southern Appalachians, 2000, University of Georgia Press, Athens, Georgia. . External links George Washington and Jefferson National Forest Appalachian Trail Conference National Park Service, Blue Ridge Parkway Geology of Virginia James River Association Flora at Petite's Gap George Washington and Jefferson National Forests Protected areas of Bedford County, Virginia
```css @charset "UTF-8";/*! Animate.css - path_to_url */.animated{-webkit-animation-duration:1s;animation-duration:1s;-webkit-animation-fill-mode:both;animation-fill-mode:both}.animated.infinite{-webkit-animation-iteration-count:infinite;animation-iteration-count:infinite}.animated.hinge{-webkit-animation-duration:2s;animation-duration:2s}.animated.bounceIn,.animated.bounceOut,.animated.flipOutX,.animated.flipOutY{-webkit-animation-duration:.75s;animation-duration:.75s}@-webkit-keyframes bounce{100%,20%,53%,80%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1);-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}40%,43%{-webkit-animation-timing-function:cubic-bezier(0.755,.050,.855,.060);animation-timing-function:cubic-bezier(0.755,.050,.855,.060);-webkit-transform:translate3d(0,-30px,0);transform:translate3d(0,-30px,0)}70%{-webkit-animation-timing-function:cubic-bezier(0.755,.050,.855,.060);animation-timing-function:cubic-bezier(0.755,.050,.855,.060);-webkit-transform:translate3d(0,-15px,0);transform:translate3d(0,-15px,0)}90%{-webkit-transform:translate3d(0,-4px,0);transform:translate3d(0,-4px,0)}}@keyframes bounce{100%,20%,53%,80%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1);-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}40%,43%{-webkit-animation-timing-function:cubic-bezier(0.755,.050,.855,.060);animation-timing-function:cubic-bezier(0.755,.050,.855,.060);-webkit-transform:translate3d(0,-30px,0);transform:translate3d(0,-30px,0)}70%{-webkit-animation-timing-function:cubic-bezier(0.755,.050,.855,.060);animation-timing-function:cubic-bezier(0.755,.050,.855,.060);-webkit-transform:translate3d(0,-15px,0);transform:translate3d(0,-15px,0)}90%{-webkit-transform:translate3d(0,-4px,0);transform:translate3d(0,-4px,0)}}.bounce{-webkit-animation-name:bounce;animation-name:bounce;-webkit-transform-origin:center bottom;transform-origin:center bottom}@-webkit-keyframes flash{100%,50%,from{opacity:1}25%,75%{opacity:0}}@keyframes flash{100%,50%,from{opacity:1}25%,75%{opacity:0}}.flash{-webkit-animation-name:flash;animation-name:flash}@-webkit-keyframes pulse{from{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}50%{-webkit-transform:scale3d(1.05,1.05,1.05);transform:scale3d(1.05,1.05,1.05)}100%{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}}@keyframes pulse{from{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}50%{-webkit-transform:scale3d(1.05,1.05,1.05);transform:scale3d(1.05,1.05,1.05)}100%{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}}.pulse{-webkit-animation-name:pulse;animation-name:pulse}@-webkit-keyframes rubberBand{from{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}30%{-webkit-transform:scale3d(1.25,.75,1);transform:scale3d(1.25,.75,1)}40%{-webkit-transform:scale3d(0.75,1.25,1);transform:scale3d(0.75,1.25,1)}50%{-webkit-transform:scale3d(1.15,.85,1);transform:scale3d(1.15,.85,1)}65%{-webkit-transform:scale3d(.95,1.05,1);transform:scale3d(.95,1.05,1)}75%{-webkit-transform:scale3d(1.05,.95,1);transform:scale3d(1.05,.95,1)}100%{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}}@keyframes rubberBand{from{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}30%{-webkit-transform:scale3d(1.25,.75,1);transform:scale3d(1.25,.75,1)}40%{-webkit-transform:scale3d(0.75,1.25,1);transform:scale3d(0.75,1.25,1)}50%{-webkit-transform:scale3d(1.15,.85,1);transform:scale3d(1.15,.85,1)}65%{-webkit-transform:scale3d(.95,1.05,1);transform:scale3d(.95,1.05,1)}75%{-webkit-transform:scale3d(1.05,.95,1);transform:scale3d(1.05,.95,1)}100%{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}}.rubberBand{-webkit-animation-name:rubberBand;animation-name:rubberBand}@-webkit-keyframes shake{100%,from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}10%,30%,50%,70%,90%{-webkit-transform:translate3d(-10px,0,0);transform:translate3d(-10px,0,0)}20%,40%,60%,80%{-webkit-transform:translate3d(10px,0,0);transform:translate3d(10px,0,0)}}@keyframes shake{100%,from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}10%,30%,50%,70%,90%{-webkit-transform:translate3d(-10px,0,0);transform:translate3d(-10px,0,0)}20%,40%,60%,80%{-webkit-transform:translate3d(10px,0,0);transform:translate3d(10px,0,0)}}.shake{-webkit-animation-name:shake;animation-name:shake}@-webkit-keyframes swing{20%{-webkit-transform:rotate3d(0,0,1,15deg);transform:rotate3d(0,0,1,15deg)}40%{-webkit-transform:rotate3d(0,0,1,-10deg);transform:rotate3d(0,0,1,-10deg)}60%{-webkit-transform:rotate3d(0,0,1,5deg);transform:rotate3d(0,0,1,5deg)}80%{-webkit-transform:rotate3d(0,0,1,-5deg);transform:rotate3d(0,0,1,-5deg)}100%{-webkit-transform:rotate3d(0,0,1,0deg);transform:rotate3d(0,0,1,0deg)}}@keyframes swing{20%{-webkit-transform:rotate3d(0,0,1,15deg);transform:rotate3d(0,0,1,15deg)}40%{-webkit-transform:rotate3d(0,0,1,-10deg);transform:rotate3d(0,0,1,-10deg)}60%{-webkit-transform:rotate3d(0,0,1,5deg);transform:rotate3d(0,0,1,5deg)}80%{-webkit-transform:rotate3d(0,0,1,-5deg);transform:rotate3d(0,0,1,-5deg)}100%{-webkit-transform:rotate3d(0,0,1,0deg);transform:rotate3d(0,0,1,0deg)}}.swing{-webkit-transform-origin:top center;transform-origin:top center;-webkit-animation-name:swing;animation-name:swing}@-webkit-keyframes tada{from{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}10%,20%{-webkit-transform:scale3d(.9,.9,.9) rotate3d(0,0,1,-3deg);transform:scale3d(.9,.9,.9) rotate3d(0,0,1,-3deg)}30%,50%,70%,90%{-webkit-transform:scale3d(1.1,1.1,1.1) rotate3d(0,0,1,3deg);transform:scale3d(1.1,1.1,1.1) rotate3d(0,0,1,3deg)}40%,60%,80%{-webkit-transform:scale3d(1.1,1.1,1.1) rotate3d(0,0,1,-3deg);transform:scale3d(1.1,1.1,1.1) rotate3d(0,0,1,-3deg)}100%{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}}@keyframes tada{from{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}10%,20%{-webkit-transform:scale3d(.9,.9,.9) rotate3d(0,0,1,-3deg);transform:scale3d(.9,.9,.9) rotate3d(0,0,1,-3deg)}30%,50%,70%,90%{-webkit-transform:scale3d(1.1,1.1,1.1) rotate3d(0,0,1,3deg);transform:scale3d(1.1,1.1,1.1) rotate3d(0,0,1,3deg)}40%,60%,80%{-webkit-transform:scale3d(1.1,1.1,1.1) rotate3d(0,0,1,-3deg);transform:scale3d(1.1,1.1,1.1) rotate3d(0,0,1,-3deg)}100%{-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}}.tada{-webkit-animation-name:tada;animation-name:tada}@-webkit-keyframes wobble{from{-webkit-transform:none;transform:none}15%{-webkit-transform:translate3d(-25%,0,0) rotate3d(0,0,1,-5deg);transform:translate3d(-25%,0,0) rotate3d(0,0,1,-5deg)}30%{-webkit-transform:translate3d(20%,0,0) rotate3d(0,0,1,3deg);transform:translate3d(20%,0,0) rotate3d(0,0,1,3deg)}45%{-webkit-transform:translate3d(-15%,0,0) rotate3d(0,0,1,-3deg);transform:translate3d(-15%,0,0) rotate3d(0,0,1,-3deg)}60%{-webkit-transform:translate3d(10%,0,0) rotate3d(0,0,1,2deg);transform:translate3d(10%,0,0) rotate3d(0,0,1,2deg)}75%{-webkit-transform:translate3d(-5%,0,0) rotate3d(0,0,1,-1deg);transform:translate3d(-5%,0,0) rotate3d(0,0,1,-1deg)}100%{-webkit-transform:none;transform:none}}@keyframes wobble{from{-webkit-transform:none;transform:none}15%{-webkit-transform:translate3d(-25%,0,0) rotate3d(0,0,1,-5deg);transform:translate3d(-25%,0,0) rotate3d(0,0,1,-5deg)}30%{-webkit-transform:translate3d(20%,0,0) rotate3d(0,0,1,3deg);transform:translate3d(20%,0,0) rotate3d(0,0,1,3deg)}45%{-webkit-transform:translate3d(-15%,0,0) rotate3d(0,0,1,-3deg);transform:translate3d(-15%,0,0) rotate3d(0,0,1,-3deg)}60%{-webkit-transform:translate3d(10%,0,0) rotate3d(0,0,1,2deg);transform:translate3d(10%,0,0) rotate3d(0,0,1,2deg)}75%{-webkit-transform:translate3d(-5%,0,0) rotate3d(0,0,1,-1deg);transform:translate3d(-5%,0,0) rotate3d(0,0,1,-1deg)}100%{-webkit-transform:none;transform:none}}.wobble{-webkit-animation-name:wobble;animation-name:wobble}@-webkit-keyframes jello{100%,11.1%,from{-webkit-transform:none;transform:none}22.2%{-webkit-transform:skewX(-12.5deg) skewY(-12.5deg);transform:skewX(-12.5deg) skewY(-12.5deg)}33.3%{-webkit-transform:skewX(6.25deg) skewY(6.25deg);transform:skewX(6.25deg) skewY(6.25deg)}44.4%{-webkit-transform:skewX(-3.125deg) skewY(-3.125deg);transform:skewX(-3.125deg) skewY(-3.125deg)}55.5%{-webkit-transform:skewX(1.5625deg) skewY(1.5625deg);transform:skewX(1.5625deg) skewY(1.5625deg)}66.6%{-webkit-transform:skewX(-.78125deg) skewY(-.78125deg);transform:skewX(-.78125deg) skewY(-.78125deg)}77.7%{-webkit-transform:skewX(0.390625deg) skewY(0.390625deg);transform:skewX(0.390625deg) skewY(0.390625deg)}88.8%{-webkit-transform:skewX(-.1953125deg) skewY(-.1953125deg);transform:skewX(-.1953125deg) skewY(-.1953125deg)}}@keyframes jello{100%,11.1%,from{-webkit-transform:none;transform:none}22.2%{-webkit-transform:skewX(-12.5deg) skewY(-12.5deg);transform:skewX(-12.5deg) skewY(-12.5deg)}33.3%{-webkit-transform:skewX(6.25deg) skewY(6.25deg);transform:skewX(6.25deg) skewY(6.25deg)}44.4%{-webkit-transform:skewX(-3.125deg) skewY(-3.125deg);transform:skewX(-3.125deg) skewY(-3.125deg)}55.5%{-webkit-transform:skewX(1.5625deg) skewY(1.5625deg);transform:skewX(1.5625deg) skewY(1.5625deg)}66.6%{-webkit-transform:skewX(-.78125deg) skewY(-.78125deg);transform:skewX(-.78125deg) skewY(-.78125deg)}77.7%{-webkit-transform:skewX(0.390625deg) skewY(0.390625deg);transform:skewX(0.390625deg) skewY(0.390625deg)}88.8%{-webkit-transform:skewX(-.1953125deg) skewY(-.1953125deg);transform:skewX(-.1953125deg) skewY(-.1953125deg)}}.jello{-webkit-animation-name:jello;animation-name:jello;-webkit-transform-origin:center;transform-origin:center}@-webkit-keyframes bounceIn{100%,20%,40%,60%,80%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}0%{opacity:0;-webkit-transform:scale3d(.3,.3,.3);transform:scale3d(.3,.3,.3)}20%{-webkit-transform:scale3d(1.1,1.1,1.1);transform:scale3d(1.1,1.1,1.1)}40%{-webkit-transform:scale3d(.9,.9,.9);transform:scale3d(.9,.9,.9)}60%{opacity:1;-webkit-transform:scale3d(1.03,1.03,1.03);transform:scale3d(1.03,1.03,1.03)}80%{-webkit-transform:scale3d(.97,.97,.97);transform:scale3d(.97,.97,.97)}100%{opacity:1;-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}}@keyframes bounceIn{100%,20%,40%,60%,80%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}0%{opacity:0;-webkit-transform:scale3d(.3,.3,.3);transform:scale3d(.3,.3,.3)}20%{-webkit-transform:scale3d(1.1,1.1,1.1);transform:scale3d(1.1,1.1,1.1)}40%{-webkit-transform:scale3d(.9,.9,.9);transform:scale3d(.9,.9,.9)}60%{opacity:1;-webkit-transform:scale3d(1.03,1.03,1.03);transform:scale3d(1.03,1.03,1.03)}80%{-webkit-transform:scale3d(.97,.97,.97);transform:scale3d(.97,.97,.97)}100%{opacity:1;-webkit-transform:scale3d(1,1,1);transform:scale3d(1,1,1)}}.bounceIn{-webkit-animation-name:bounceIn;animation-name:bounceIn}@-webkit-keyframes bounceInDown{100%,60%,75%,90%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}0%{opacity:0;-webkit-transform:translate3d(0,-3000px,0);transform:translate3d(0,-3000px,0)}60%{opacity:1;-webkit-transform:translate3d(0,25px,0);transform:translate3d(0,25px,0)}75%{-webkit-transform:translate3d(0,-10px,0);transform:translate3d(0,-10px,0)}90%{-webkit-transform:translate3d(0,5px,0);transform:translate3d(0,5px,0)}100%{-webkit-transform:none;transform:none}}@keyframes bounceInDown{100%,60%,75%,90%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}0%{opacity:0;-webkit-transform:translate3d(0,-3000px,0);transform:translate3d(0,-3000px,0)}60%{opacity:1;-webkit-transform:translate3d(0,25px,0);transform:translate3d(0,25px,0)}75%{-webkit-transform:translate3d(0,-10px,0);transform:translate3d(0,-10px,0)}90%{-webkit-transform:translate3d(0,5px,0);transform:translate3d(0,5px,0)}100%{-webkit-transform:none;transform:none}}.bounceInDown{-webkit-animation-name:bounceInDown;animation-name:bounceInDown}@-webkit-keyframes bounceInLeft{100%,60%,75%,90%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}0%{opacity:0;-webkit-transform:translate3d(-3000px,0,0);transform:translate3d(-3000px,0,0)}60%{opacity:1;-webkit-transform:translate3d(25px,0,0);transform:translate3d(25px,0,0)}75%{-webkit-transform:translate3d(-10px,0,0);transform:translate3d(-10px,0,0)}90%{-webkit-transform:translate3d(5px,0,0);transform:translate3d(5px,0,0)}100%{-webkit-transform:none;transform:none}}@keyframes bounceInLeft{100%,60%,75%,90%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}0%{opacity:0;-webkit-transform:translate3d(-3000px,0,0);transform:translate3d(-3000px,0,0)}60%{opacity:1;-webkit-transform:translate3d(25px,0,0);transform:translate3d(25px,0,0)}75%{-webkit-transform:translate3d(-10px,0,0);transform:translate3d(-10px,0,0)}90%{-webkit-transform:translate3d(5px,0,0);transform:translate3d(5px,0,0)}100%{-webkit-transform:none;transform:none}}.bounceInLeft{-webkit-animation-name:bounceInLeft;animation-name:bounceInLeft}@-webkit-keyframes bounceInRight{100%,60%,75%,90%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}from{opacity:0;-webkit-transform:translate3d(3000px,0,0);transform:translate3d(3000px,0,0)}60%{opacity:1;-webkit-transform:translate3d(-25px,0,0);transform:translate3d(-25px,0,0)}75%{-webkit-transform:translate3d(10px,0,0);transform:translate3d(10px,0,0)}90%{-webkit-transform:translate3d(-5px,0,0);transform:translate3d(-5px,0,0)}100%{-webkit-transform:none;transform:none}}@keyframes bounceInRight{100%,60%,75%,90%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}from{opacity:0;-webkit-transform:translate3d(3000px,0,0);transform:translate3d(3000px,0,0)}60%{opacity:1;-webkit-transform:translate3d(-25px,0,0);transform:translate3d(-25px,0,0)}75%{-webkit-transform:translate3d(10px,0,0);transform:translate3d(10px,0,0)}90%{-webkit-transform:translate3d(-5px,0,0);transform:translate3d(-5px,0,0)}100%{-webkit-transform:none;transform:none}}.bounceInRight{-webkit-animation-name:bounceInRight;animation-name:bounceInRight}@-webkit-keyframes bounceInUp{100%,60%,75%,90%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}from{opacity:0;-webkit-transform:translate3d(0,3000px,0);transform:translate3d(0,3000px,0)}60%{opacity:1;-webkit-transform:translate3d(0,-20px,0);transform:translate3d(0,-20px,0)}75%{-webkit-transform:translate3d(0,10px,0);transform:translate3d(0,10px,0)}90%{-webkit-transform:translate3d(0,-5px,0);transform:translate3d(0,-5px,0)}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}@keyframes bounceInUp{100%,60%,75%,90%,from{-webkit-animation-timing-function:cubic-bezier(0.215,.61,.355,1);animation-timing-function:cubic-bezier(0.215,.61,.355,1)}from{opacity:0;-webkit-transform:translate3d(0,3000px,0);transform:translate3d(0,3000px,0)}60%{opacity:1;-webkit-transform:translate3d(0,-20px,0);transform:translate3d(0,-20px,0)}75%{-webkit-transform:translate3d(0,10px,0);transform:translate3d(0,10px,0)}90%{-webkit-transform:translate3d(0,-5px,0);transform:translate3d(0,-5px,0)}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}.bounceInUp{-webkit-animation-name:bounceInUp;animation-name:bounceInUp}@-webkit-keyframes bounceOut{20%{-webkit-transform:scale3d(.9,.9,.9);transform:scale3d(.9,.9,.9)}50%,55%{opacity:1;-webkit-transform:scale3d(1.1,1.1,1.1);transform:scale3d(1.1,1.1,1.1)}100%{opacity:0;-webkit-transform:scale3d(.3,.3,.3);transform:scale3d(.3,.3,.3)}}@keyframes bounceOut{20%{-webkit-transform:scale3d(.9,.9,.9);transform:scale3d(.9,.9,.9)}50%,55%{opacity:1;-webkit-transform:scale3d(1.1,1.1,1.1);transform:scale3d(1.1,1.1,1.1)}100%{opacity:0;-webkit-transform:scale3d(.3,.3,.3);transform:scale3d(.3,.3,.3)}}.bounceOut{-webkit-animation-name:bounceOut;animation-name:bounceOut}@-webkit-keyframes bounceOutDown{20%{-webkit-transform:translate3d(0,10px,0);transform:translate3d(0,10px,0)}40%,45%{opacity:1;-webkit-transform:translate3d(0,-20px,0);transform:translate3d(0,-20px,0)}100%{opacity:0;-webkit-transform:translate3d(0,2000px,0);transform:translate3d(0,2000px,0)}}@keyframes bounceOutDown{20%{-webkit-transform:translate3d(0,10px,0);transform:translate3d(0,10px,0)}40%,45%{opacity:1;-webkit-transform:translate3d(0,-20px,0);transform:translate3d(0,-20px,0)}100%{opacity:0;-webkit-transform:translate3d(0,2000px,0);transform:translate3d(0,2000px,0)}}.bounceOutDown{-webkit-animation-name:bounceOutDown;animation-name:bounceOutDown}@-webkit-keyframes bounceOutLeft{20%{opacity:1;-webkit-transform:translate3d(20px,0,0);transform:translate3d(20px,0,0)}100%{opacity:0;-webkit-transform:translate3d(-2000px,0,0);transform:translate3d(-2000px,0,0)}}@keyframes bounceOutLeft{20%{opacity:1;-webkit-transform:translate3d(20px,0,0);transform:translate3d(20px,0,0)}100%{opacity:0;-webkit-transform:translate3d(-2000px,0,0);transform:translate3d(-2000px,0,0)}}.bounceOutLeft{-webkit-animation-name:bounceOutLeft;animation-name:bounceOutLeft}@-webkit-keyframes bounceOutRight{20%{opacity:1;-webkit-transform:translate3d(-20px,0,0);transform:translate3d(-20px,0,0)}100%{opacity:0;-webkit-transform:translate3d(2000px,0,0);transform:translate3d(2000px,0,0)}}@keyframes bounceOutRight{20%{opacity:1;-webkit-transform:translate3d(-20px,0,0);transform:translate3d(-20px,0,0)}100%{opacity:0;-webkit-transform:translate3d(2000px,0,0);transform:translate3d(2000px,0,0)}}.bounceOutRight{-webkit-animation-name:bounceOutRight;animation-name:bounceOutRight}@-webkit-keyframes bounceOutUp{20%{-webkit-transform:translate3d(0,-10px,0);transform:translate3d(0,-10px,0)}40%,45%{opacity:1;-webkit-transform:translate3d(0,20px,0);transform:translate3d(0,20px,0)}100%{opacity:0;-webkit-transform:translate3d(0,-2000px,0);transform:translate3d(0,-2000px,0)}}@keyframes bounceOutUp{20%{-webkit-transform:translate3d(0,-10px,0);transform:translate3d(0,-10px,0)}40%,45%{opacity:1;-webkit-transform:translate3d(0,20px,0);transform:translate3d(0,20px,0)}100%{opacity:0;-webkit-transform:translate3d(0,-2000px,0);transform:translate3d(0,-2000px,0)}}.bounceOutUp{-webkit-animation-name:bounceOutUp;animation-name:bounceOutUp}@-webkit-keyframes fadeIn{from{opacity:0}100%{opacity:1}}@keyframes fadeIn{from{opacity:0}100%{opacity:1}}.fadeIn{-webkit-animation-name:fadeIn;animation-name:fadeIn}@-webkit-keyframes fadeInDown{from{opacity:0;-webkit-transform:translate3d(0,-100%,0);transform:translate3d(0,-100%,0)}100%{opacity:1;-webkit-transform:none;transform:none}}@keyframes fadeInDown{from{opacity:0;-webkit-transform:translate3d(0,-100%,0);transform:translate3d(0,-100%,0)}100%{opacity:1;-webkit-transform:none;transform:none}}.fadeInDown{-webkit-animation-name:fadeInDown;animation-name:fadeInDown}@-webkit-keyframes fadeInDownBig{from{opacity:0;-webkit-transform:translate3d(0,-2000px,0);transform:translate3d(0,-2000px,0)}100%{opacity:1;-webkit-transform:none;transform:none}}@keyframes fadeInDownBig{from{opacity:0;-webkit-transform:translate3d(0,-2000px,0);transform:translate3d(0,-2000px,0)}100%{opacity:1;-webkit-transform:none;transform:none}}.fadeInDownBig{-webkit-animation-name:fadeInDownBig;animation-name:fadeInDownBig}@-webkit-keyframes fadeInLeft{from{opacity:0;-webkit-transform:translate3d(-100%,0,0);transform:translate3d(-100%,0,0)}100%{opacity:1;-webkit-transform:none;transform:none}}@keyframes fadeInLeft{from{opacity:0;-webkit-transform:translate3d(-100%,0,0);transform:translate3d(-100%,0,0)}100%{opacity:1;-webkit-transform:none;transform:none}}.fadeInLeft{-webkit-animation-name:fadeInLeft;animation-name:fadeInLeft}@-webkit-keyframes fadeInLeftBig{from{opacity:0;-webkit-transform:translate3d(-2000px,0,0);transform:translate3d(-2000px,0,0)}100%{opacity:1;-webkit-transform:none;transform:none}}@keyframes fadeInLeftBig{from{opacity:0;-webkit-transform:translate3d(-2000px,0,0);transform:translate3d(-2000px,0,0)}100%{opacity:1;-webkit-transform:none;transform:none}}.fadeInLeftBig{-webkit-animation-name:fadeInLeftBig;animation-name:fadeInLeftBig}@-webkit-keyframes fadeInRight{from{opacity:0;-webkit-transform:translate3d(100%,0,0);transform:translate3d(100%,0,0)}100%{opacity:1;-webkit-transform:none;transform:none}}@keyframes fadeInRight{from{opacity:0;-webkit-transform:translate3d(100%,0,0);transform:translate3d(100%,0,0)}100%{opacity:1;-webkit-transform:none;transform:none}}.fadeInRight{-webkit-animation-name:fadeInRight;animation-name:fadeInRight}@-webkit-keyframes fadeInRightBig{from{opacity:0;-webkit-transform:translate3d(2000px,0,0);transform:translate3d(2000px,0,0)}100%{opacity:1;-webkit-transform:none;transform:none}}@keyframes fadeInRightBig{from{opacity:0;-webkit-transform:translate3d(2000px,0,0);transform:translate3d(2000px,0,0)}100%{opacity:1;-webkit-transform:none;transform:none}}.fadeInRightBig{-webkit-animation-name:fadeInRightBig;animation-name:fadeInRightBig}@-webkit-keyframes fadeInUp{from{opacity:0;-webkit-transform:translate3d(0,100%,0);transform:translate3d(0,100%,0)}100%{opacity:1;-webkit-transform:none;transform:none}}@keyframes fadeInUp{from{opacity:0;-webkit-transform:translate3d(0,100%,0);transform:translate3d(0,100%,0)}100%{opacity:1;-webkit-transform:none;transform:none}}.fadeInUp{-webkit-animation-name:fadeInUp;animation-name:fadeInUp}@-webkit-keyframes fadeInUpBig{from{opacity:0;-webkit-transform:translate3d(0,2000px,0);transform:translate3d(0,2000px,0)}100%{opacity:1;-webkit-transform:none;transform:none}}@keyframes fadeInUpBig{from{opacity:0;-webkit-transform:translate3d(0,2000px,0);transform:translate3d(0,2000px,0)}100%{opacity:1;-webkit-transform:none;transform:none}}.fadeInUpBig{-webkit-animation-name:fadeInUpBig;animation-name:fadeInUpBig}@-webkit-keyframes fadeOut{from{opacity:1}100%{opacity:0}}@keyframes fadeOut{from{opacity:1}100%{opacity:0}}.fadeOut{-webkit-animation-name:fadeOut;animation-name:fadeOut}@-webkit-keyframes fadeOutDown{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(0,100%,0);transform:translate3d(0,100%,0)}}@keyframes fadeOutDown{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(0,100%,0);transform:translate3d(0,100%,0)}}.fadeOutDown{-webkit-animation-name:fadeOutDown;animation-name:fadeOutDown}@-webkit-keyframes fadeOutDownBig{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(0,2000px,0);transform:translate3d(0,2000px,0)}}@keyframes fadeOutDownBig{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(0,2000px,0);transform:translate3d(0,2000px,0)}}.fadeOutDownBig{-webkit-animation-name:fadeOutDownBig;animation-name:fadeOutDownBig}@-webkit-keyframes fadeOutLeft{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(-100%,0,0);transform:translate3d(-100%,0,0)}}@keyframes fadeOutLeft{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(-100%,0,0);transform:translate3d(-100%,0,0)}}.fadeOutLeft{-webkit-animation-name:fadeOutLeft;animation-name:fadeOutLeft}@-webkit-keyframes fadeOutLeftBig{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(-2000px,0,0);transform:translate3d(-2000px,0,0)}}@keyframes fadeOutLeftBig{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(-2000px,0,0);transform:translate3d(-2000px,0,0)}}.fadeOutLeftBig{-webkit-animation-name:fadeOutLeftBig;animation-name:fadeOutLeftBig}@-webkit-keyframes fadeOutRight{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(100%,0,0);transform:translate3d(100%,0,0)}}@keyframes fadeOutRight{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(100%,0,0);transform:translate3d(100%,0,0)}}.fadeOutRight{-webkit-animation-name:fadeOutRight;animation-name:fadeOutRight}@-webkit-keyframes fadeOutRightBig{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(2000px,0,0);transform:translate3d(2000px,0,0)}}@keyframes fadeOutRightBig{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(2000px,0,0);transform:translate3d(2000px,0,0)}}.fadeOutRightBig{-webkit-animation-name:fadeOutRightBig;animation-name:fadeOutRightBig}@-webkit-keyframes fadeOutUp{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(0,-100%,0);transform:translate3d(0,-100%,0)}}@keyframes fadeOutUp{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(0,-100%,0);transform:translate3d(0,-100%,0)}}.fadeOutUp{-webkit-animation-name:fadeOutUp;animation-name:fadeOutUp}@-webkit-keyframes fadeOutUpBig{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(0,-2000px,0);transform:translate3d(0,-2000px,0)}}@keyframes fadeOutUpBig{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(0,-2000px,0);transform:translate3d(0,-2000px,0)}}.fadeOutUpBig{-webkit-animation-name:fadeOutUpBig;animation-name:fadeOutUpBig}@-webkit-keyframes flip{from{-webkit-transform:perspective(400px) rotate3d(0,1,0,-360deg);transform:perspective(400px) rotate3d(0,1,0,-360deg);-webkit-animation-timing-function:ease-out;animation-timing-function:ease-out}40%{-webkit-transform:perspective(400px) translate3d(0,0,150px) rotate3d(0,1,0,-190deg);transform:perspective(400px) translate3d(0,0,150px) rotate3d(0,1,0,-190deg);-webkit-animation-timing-function:ease-out;animation-timing-function:ease-out}50%{-webkit-transform:perspective(400px) translate3d(0,0,150px) rotate3d(0,1,0,-170deg);transform:perspective(400px) translate3d(0,0,150px) rotate3d(0,1,0,-170deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}80%{-webkit-transform:perspective(400px) scale3d(.95,.95,.95);transform:perspective(400px) scale3d(.95,.95,.95);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}100%{-webkit-transform:perspective(400px);transform:perspective(400px);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}}@keyframes flip{from{-webkit-transform:perspective(400px) rotate3d(0,1,0,-360deg);transform:perspective(400px) rotate3d(0,1,0,-360deg);-webkit-animation-timing-function:ease-out;animation-timing-function:ease-out}40%{-webkit-transform:perspective(400px) translate3d(0,0,150px) rotate3d(0,1,0,-190deg);transform:perspective(400px) translate3d(0,0,150px) rotate3d(0,1,0,-190deg);-webkit-animation-timing-function:ease-out;animation-timing-function:ease-out}50%{-webkit-transform:perspective(400px) translate3d(0,0,150px) rotate3d(0,1,0,-170deg);transform:perspective(400px) translate3d(0,0,150px) rotate3d(0,1,0,-170deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}80%{-webkit-transform:perspective(400px) scale3d(.95,.95,.95);transform:perspective(400px) scale3d(.95,.95,.95);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}100%{-webkit-transform:perspective(400px);transform:perspective(400px);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}}.animated.flip{-webkit-backface-visibility:visible;backface-visibility:visible;-webkit-animation-name:flip;animation-name:flip}@-webkit-keyframes flipInX{from{-webkit-transform:perspective(400px) rotate3d(1,0,0,90deg);transform:perspective(400px) rotate3d(1,0,0,90deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in;opacity:0}40%{-webkit-transform:perspective(400px) rotate3d(1,0,0,-20deg);transform:perspective(400px) rotate3d(1,0,0,-20deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}60%{-webkit-transform:perspective(400px) rotate3d(1,0,0,10deg);transform:perspective(400px) rotate3d(1,0,0,10deg);opacity:1}80%{-webkit-transform:perspective(400px) rotate3d(1,0,0,-5deg);transform:perspective(400px) rotate3d(1,0,0,-5deg)}100%{-webkit-transform:perspective(400px);transform:perspective(400px)}}@keyframes flipInX{from{-webkit-transform:perspective(400px) rotate3d(1,0,0,90deg);transform:perspective(400px) rotate3d(1,0,0,90deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in;opacity:0}40%{-webkit-transform:perspective(400px) rotate3d(1,0,0,-20deg);transform:perspective(400px) rotate3d(1,0,0,-20deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}60%{-webkit-transform:perspective(400px) rotate3d(1,0,0,10deg);transform:perspective(400px) rotate3d(1,0,0,10deg);opacity:1}80%{-webkit-transform:perspective(400px) rotate3d(1,0,0,-5deg);transform:perspective(400px) rotate3d(1,0,0,-5deg)}100%{-webkit-transform:perspective(400px);transform:perspective(400px)}}.flipInX{-webkit-backface-visibility:visible!important;backface-visibility:visible!important;-webkit-animation-name:flipInX;animation-name:flipInX}@-webkit-keyframes flipInY{from{-webkit-transform:perspective(400px) rotate3d(0,1,0,90deg);transform:perspective(400px) rotate3d(0,1,0,90deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in;opacity:0}40%{-webkit-transform:perspective(400px) rotate3d(0,1,0,-20deg);transform:perspective(400px) rotate3d(0,1,0,-20deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}60%{-webkit-transform:perspective(400px) rotate3d(0,1,0,10deg);transform:perspective(400px) rotate3d(0,1,0,10deg);opacity:1}80%{-webkit-transform:perspective(400px) rotate3d(0,1,0,-5deg);transform:perspective(400px) rotate3d(0,1,0,-5deg)}100%{-webkit-transform:perspective(400px);transform:perspective(400px)}}@keyframes flipInY{from{-webkit-transform:perspective(400px) rotate3d(0,1,0,90deg);transform:perspective(400px) rotate3d(0,1,0,90deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in;opacity:0}40%{-webkit-transform:perspective(400px) rotate3d(0,1,0,-20deg);transform:perspective(400px) rotate3d(0,1,0,-20deg);-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}60%{-webkit-transform:perspective(400px) rotate3d(0,1,0,10deg);transform:perspective(400px) rotate3d(0,1,0,10deg);opacity:1}80%{-webkit-transform:perspective(400px) rotate3d(0,1,0,-5deg);transform:perspective(400px) rotate3d(0,1,0,-5deg)}100%{-webkit-transform:perspective(400px);transform:perspective(400px)}}.flipInY{-webkit-backface-visibility:visible!important;backface-visibility:visible!important;-webkit-animation-name:flipInY;animation-name:flipInY}@-webkit-keyframes flipOutX{from{-webkit-transform:perspective(400px);transform:perspective(400px)}30%{-webkit-transform:perspective(400px) rotate3d(1,0,0,-20deg);transform:perspective(400px) rotate3d(1,0,0,-20deg);opacity:1}100%{-webkit-transform:perspective(400px) rotate3d(1,0,0,90deg);transform:perspective(400px) rotate3d(1,0,0,90deg);opacity:0}}@keyframes flipOutX{from{-webkit-transform:perspective(400px);transform:perspective(400px)}30%{-webkit-transform:perspective(400px) rotate3d(1,0,0,-20deg);transform:perspective(400px) rotate3d(1,0,0,-20deg);opacity:1}100%{-webkit-transform:perspective(400px) rotate3d(1,0,0,90deg);transform:perspective(400px) rotate3d(1,0,0,90deg);opacity:0}}.flipOutX{-webkit-animation-name:flipOutX;animation-name:flipOutX;-webkit-backface-visibility:visible!important;backface-visibility:visible!important}@-webkit-keyframes flipOutY{from{-webkit-transform:perspective(400px);transform:perspective(400px)}30%{-webkit-transform:perspective(400px) rotate3d(0,1,0,-15deg);transform:perspective(400px) rotate3d(0,1,0,-15deg);opacity:1}100%{-webkit-transform:perspective(400px) rotate3d(0,1,0,90deg);transform:perspective(400px) rotate3d(0,1,0,90deg);opacity:0}}@keyframes flipOutY{from{-webkit-transform:perspective(400px);transform:perspective(400px)}30%{-webkit-transform:perspective(400px) rotate3d(0,1,0,-15deg);transform:perspective(400px) rotate3d(0,1,0,-15deg);opacity:1}100%{-webkit-transform:perspective(400px) rotate3d(0,1,0,90deg);transform:perspective(400px) rotate3d(0,1,0,90deg);opacity:0}}.flipOutY{-webkit-backface-visibility:visible!important;backface-visibility:visible!important;-webkit-animation-name:flipOutY;animation-name:flipOutY}@-webkit-keyframes lightSpeedIn{from{-webkit-transform:translate3d(100%,0,0) skewX(-30deg);transform:translate3d(100%,0,0) skewX(-30deg);opacity:0}60%{-webkit-transform:skewX(20deg);transform:skewX(20deg);opacity:1}80%{-webkit-transform:skewX(-5deg);transform:skewX(-5deg);opacity:1}100%{-webkit-transform:none;transform:none;opacity:1}}@keyframes lightSpeedIn{from{-webkit-transform:translate3d(100%,0,0) skewX(-30deg);transform:translate3d(100%,0,0) skewX(-30deg);opacity:0}60%{-webkit-transform:skewX(20deg);transform:skewX(20deg);opacity:1}80%{-webkit-transform:skewX(-5deg);transform:skewX(-5deg);opacity:1}100%{-webkit-transform:none;transform:none;opacity:1}}.lightSpeedIn{-webkit-animation-name:lightSpeedIn;animation-name:lightSpeedIn;-webkit-animation-timing-function:ease-out;animation-timing-function:ease-out}@-webkit-keyframes lightSpeedOut{from{opacity:1}100%{-webkit-transform:translate3d(100%,0,0) skewX(30deg);transform:translate3d(100%,0,0) skewX(30deg);opacity:0}}@keyframes lightSpeedOut{from{opacity:1}100%{-webkit-transform:translate3d(100%,0,0) skewX(30deg);transform:translate3d(100%,0,0) skewX(30deg);opacity:0}}.lightSpeedOut{-webkit-animation-name:lightSpeedOut;animation-name:lightSpeedOut;-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in}@-webkit-keyframes rotateIn{from{-webkit-transform-origin:center;transform-origin:center;-webkit-transform:rotate3d(0,0,1,-200deg);transform:rotate3d(0,0,1,-200deg);opacity:0}100%{-webkit-transform-origin:center;transform-origin:center;-webkit-transform:none;transform:none;opacity:1}}@keyframes rotateIn{from{-webkit-transform-origin:center;transform-origin:center;-webkit-transform:rotate3d(0,0,1,-200deg);transform:rotate3d(0,0,1,-200deg);opacity:0}100%{-webkit-transform-origin:center;transform-origin:center;-webkit-transform:none;transform:none;opacity:1}}.rotateIn{-webkit-animation-name:rotateIn;animation-name:rotateIn}@-webkit-keyframes rotateInDownLeft{from{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:rotate3d(0,0,1,-45deg);transform:rotate3d(0,0,1,-45deg);opacity:0}100%{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:none;transform:none;opacity:1}}@keyframes rotateInDownLeft{from{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:rotate3d(0,0,1,-45deg);transform:rotate3d(0,0,1,-45deg);opacity:0}100%{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:none;transform:none;opacity:1}}.rotateInDownLeft{-webkit-animation-name:rotateInDownLeft;animation-name:rotateInDownLeft}@-webkit-keyframes rotateInDownRight{from{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:rotate3d(0,0,1,45deg);transform:rotate3d(0,0,1,45deg);opacity:0}100%{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:none;transform:none;opacity:1}}@keyframes rotateInDownRight{from{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:rotate3d(0,0,1,45deg);transform:rotate3d(0,0,1,45deg);opacity:0}100%{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:none;transform:none;opacity:1}}.rotateInDownRight{-webkit-animation-name:rotateInDownRight;animation-name:rotateInDownRight}@-webkit-keyframes rotateInUpLeft{from{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:rotate3d(0,0,1,45deg);transform:rotate3d(0,0,1,45deg);opacity:0}100%{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:none;transform:none;opacity:1}}@keyframes rotateInUpLeft{from{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:rotate3d(0,0,1,45deg);transform:rotate3d(0,0,1,45deg);opacity:0}100%{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:none;transform:none;opacity:1}}.rotateInUpLeft{-webkit-animation-name:rotateInUpLeft;animation-name:rotateInUpLeft}@-webkit-keyframes rotateInUpRight{from{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:rotate3d(0,0,1,-90deg);transform:rotate3d(0,0,1,-90deg);opacity:0}100%{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:none;transform:none;opacity:1}}@keyframes rotateInUpRight{from{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:rotate3d(0,0,1,-90deg);transform:rotate3d(0,0,1,-90deg);opacity:0}100%{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:none;transform:none;opacity:1}}.rotateInUpRight{-webkit-animation-name:rotateInUpRight;animation-name:rotateInUpRight}@-webkit-keyframes rotateOut{from{-webkit-transform-origin:center;transform-origin:center;opacity:1}100%{-webkit-transform-origin:center;transform-origin:center;-webkit-transform:rotate3d(0,0,1,200deg);transform:rotate3d(0,0,1,200deg);opacity:0}}@keyframes rotateOut{from{-webkit-transform-origin:center;transform-origin:center;opacity:1}100%{-webkit-transform-origin:center;transform-origin:center;-webkit-transform:rotate3d(0,0,1,200deg);transform:rotate3d(0,0,1,200deg);opacity:0}}.rotateOut{-webkit-animation-name:rotateOut;animation-name:rotateOut}@-webkit-keyframes rotateOutDownLeft{from{-webkit-transform-origin:left bottom;transform-origin:left bottom;opacity:1}100%{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:rotate3d(0,0,1,45deg);transform:rotate3d(0,0,1,45deg);opacity:0}}@keyframes rotateOutDownLeft{from{-webkit-transform-origin:left bottom;transform-origin:left bottom;opacity:1}100%{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:rotate3d(0,0,1,45deg);transform:rotate3d(0,0,1,45deg);opacity:0}}.rotateOutDownLeft{-webkit-animation-name:rotateOutDownLeft;animation-name:rotateOutDownLeft}@-webkit-keyframes rotateOutDownRight{from{-webkit-transform-origin:right bottom;transform-origin:right bottom;opacity:1}100%{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:rotate3d(0,0,1,-45deg);transform:rotate3d(0,0,1,-45deg);opacity:0}}@keyframes rotateOutDownRight{from{-webkit-transform-origin:right bottom;transform-origin:right bottom;opacity:1}100%{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:rotate3d(0,0,1,-45deg);transform:rotate3d(0,0,1,-45deg);opacity:0}}.rotateOutDownRight{-webkit-animation-name:rotateOutDownRight;animation-name:rotateOutDownRight}@-webkit-keyframes rotateOutUpLeft{from{-webkit-transform-origin:left bottom;transform-origin:left bottom;opacity:1}100%{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:rotate3d(0,0,1,-45deg);transform:rotate3d(0,0,1,-45deg);opacity:0}}@keyframes rotateOutUpLeft{from{-webkit-transform-origin:left bottom;transform-origin:left bottom;opacity:1}100%{-webkit-transform-origin:left bottom;transform-origin:left bottom;-webkit-transform:rotate3d(0,0,1,-45deg);transform:rotate3d(0,0,1,-45deg);opacity:0}}.rotateOutUpLeft{-webkit-animation-name:rotateOutUpLeft;animation-name:rotateOutUpLeft}@-webkit-keyframes rotateOutUpRight{from{-webkit-transform-origin:right bottom;transform-origin:right bottom;opacity:1}100%{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:rotate3d(0,0,1,90deg);transform:rotate3d(0,0,1,90deg);opacity:0}}@keyframes rotateOutUpRight{from{-webkit-transform-origin:right bottom;transform-origin:right bottom;opacity:1}100%{-webkit-transform-origin:right bottom;transform-origin:right bottom;-webkit-transform:rotate3d(0,0,1,90deg);transform:rotate3d(0,0,1,90deg);opacity:0}}.rotateOutUpRight{-webkit-animation-name:rotateOutUpRight;animation-name:rotateOutUpRight}@-webkit-keyframes hinge{0%{-webkit-transform-origin:top left;transform-origin:top left;-webkit-animation-timing-function:ease-in-out;animation-timing-function:ease-in-out}20%,60%{-webkit-transform:rotate3d(0,0,1,80deg);transform:rotate3d(0,0,1,80deg);-webkit-transform-origin:top left;transform-origin:top left;-webkit-animation-timing-function:ease-in-out;animation-timing-function:ease-in-out}40%,80%{-webkit-transform:rotate3d(0,0,1,60deg);transform:rotate3d(0,0,1,60deg);-webkit-transform-origin:top left;transform-origin:top left;-webkit-animation-timing-function:ease-in-out;animation-timing-function:ease-in-out;opacity:1}100%{-webkit-transform:translate3d(0,700px,0);transform:translate3d(0,700px,0);opacity:0}}@keyframes hinge{0%{-webkit-transform-origin:top left;transform-origin:top left;-webkit-animation-timing-function:ease-in-out;animation-timing-function:ease-in-out}20%,60%{-webkit-transform:rotate3d(0,0,1,80deg);transform:rotate3d(0,0,1,80deg);-webkit-transform-origin:top left;transform-origin:top left;-webkit-animation-timing-function:ease-in-out;animation-timing-function:ease-in-out}40%,80%{-webkit-transform:rotate3d(0,0,1,60deg);transform:rotate3d(0,0,1,60deg);-webkit-transform-origin:top left;transform-origin:top left;-webkit-animation-timing-function:ease-in-out;animation-timing-function:ease-in-out;opacity:1}100%{-webkit-transform:translate3d(0,700px,0);transform:translate3d(0,700px,0);opacity:0}}.hinge{-webkit-animation-name:hinge;animation-name:hinge}@-webkit-keyframes rollIn{from{opacity:0;-webkit-transform:translate3d(-100%,0,0) rotate3d(0,0,1,-120deg);transform:translate3d(-100%,0,0) rotate3d(0,0,1,-120deg)}100%{opacity:1;-webkit-transform:none;transform:none}}@keyframes rollIn{from{opacity:0;-webkit-transform:translate3d(-100%,0,0) rotate3d(0,0,1,-120deg);transform:translate3d(-100%,0,0) rotate3d(0,0,1,-120deg)}100%{opacity:1;-webkit-transform:none;transform:none}}.rollIn{-webkit-animation-name:rollIn;animation-name:rollIn}@-webkit-keyframes rollOut{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(100%,0,0) rotate3d(0,0,1,120deg);transform:translate3d(100%,0,0) rotate3d(0,0,1,120deg)}}@keyframes rollOut{from{opacity:1}100%{opacity:0;-webkit-transform:translate3d(100%,0,0) rotate3d(0,0,1,120deg);transform:translate3d(100%,0,0) rotate3d(0,0,1,120deg)}}.rollOut{-webkit-animation-name:rollOut;animation-name:rollOut}@-webkit-keyframes zoomIn{from{opacity:0;-webkit-transform:scale3d(.3,.3,.3);transform:scale3d(.3,.3,.3)}50%{opacity:1}}@keyframes zoomIn{from{opacity:0;-webkit-transform:scale3d(.3,.3,.3);transform:scale3d(.3,.3,.3)}50%{opacity:1}}.zoomIn{-webkit-animation-name:zoomIn;animation-name:zoomIn}@-webkit-keyframes zoomInDown{from{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(0,-1000px,0);transform:scale3d(.1,.1,.1) translate3d(0,-1000px,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}60%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(0,60px,0);transform:scale3d(.475,.475,.475) translate3d(0,60px,0);-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}@keyframes zoomInDown{from{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(0,-1000px,0);transform:scale3d(.1,.1,.1) translate3d(0,-1000px,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}60%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(0,60px,0);transform:scale3d(.475,.475,.475) translate3d(0,60px,0);-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}.zoomInDown{-webkit-animation-name:zoomInDown;animation-name:zoomInDown}@-webkit-keyframes zoomInLeft{from{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(-1000px,0,0);transform:scale3d(.1,.1,.1) translate3d(-1000px,0,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}60%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(10px,0,0);transform:scale3d(.475,.475,.475) translate3d(10px,0,0);-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}@keyframes zoomInLeft{from{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(-1000px,0,0);transform:scale3d(.1,.1,.1) translate3d(-1000px,0,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}60%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(10px,0,0);transform:scale3d(.475,.475,.475) translate3d(10px,0,0);-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}.zoomInLeft{-webkit-animation-name:zoomInLeft;animation-name:zoomInLeft}@-webkit-keyframes zoomInRight{from{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(1000px,0,0);transform:scale3d(.1,.1,.1) translate3d(1000px,0,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}60%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(-10px,0,0);transform:scale3d(.475,.475,.475) translate3d(-10px,0,0);-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}@keyframes zoomInRight{from{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(1000px,0,0);transform:scale3d(.1,.1,.1) translate3d(1000px,0,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}60%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(-10px,0,0);transform:scale3d(.475,.475,.475) translate3d(-10px,0,0);-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}.zoomInRight{-webkit-animation-name:zoomInRight;animation-name:zoomInRight}@-webkit-keyframes zoomInUp{from{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(0,1000px,0);transform:scale3d(.1,.1,.1) translate3d(0,1000px,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}60%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(0,-60px,0);transform:scale3d(.475,.475,.475) translate3d(0,-60px,0);-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}@keyframes zoomInUp{from{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(0,1000px,0);transform:scale3d(.1,.1,.1) translate3d(0,1000px,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}60%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(0,-60px,0);transform:scale3d(.475,.475,.475) translate3d(0,-60px,0);-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}.zoomInUp{-webkit-animation-name:zoomInUp;animation-name:zoomInUp}@-webkit-keyframes zoomOut{from{opacity:1}50%{opacity:0;-webkit-transform:scale3d(.3,.3,.3);transform:scale3d(.3,.3,.3)}100%{opacity:0}}@keyframes zoomOut{from{opacity:1}50%{opacity:0;-webkit-transform:scale3d(.3,.3,.3);transform:scale3d(.3,.3,.3)}100%{opacity:0}}.zoomOut{-webkit-animation-name:zoomOut;animation-name:zoomOut}@-webkit-keyframes zoomOutDown{40%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(0,-60px,0);transform:scale3d(.475,.475,.475) translate3d(0,-60px,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}100%{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(0,2000px,0);transform:scale3d(.1,.1,.1) translate3d(0,2000px,0);-webkit-transform-origin:center bottom;transform-origin:center bottom;-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}@keyframes zoomOutDown{40%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(0,-60px,0);transform:scale3d(.475,.475,.475) translate3d(0,-60px,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}100%{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(0,2000px,0);transform:scale3d(.1,.1,.1) translate3d(0,2000px,0);-webkit-transform-origin:center bottom;transform-origin:center bottom;-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}.zoomOutDown{-webkit-animation-name:zoomOutDown;animation-name:zoomOutDown}@-webkit-keyframes zoomOutLeft{40%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(42px,0,0);transform:scale3d(.475,.475,.475) translate3d(42px,0,0)}100%{opacity:0;-webkit-transform:scale(.1) translate3d(-2000px,0,0);transform:scale(.1) translate3d(-2000px,0,0);-webkit-transform-origin:left center;transform-origin:left center}}@keyframes zoomOutLeft{40%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(42px,0,0);transform:scale3d(.475,.475,.475) translate3d(42px,0,0)}100%{opacity:0;-webkit-transform:scale(.1) translate3d(-2000px,0,0);transform:scale(.1) translate3d(-2000px,0,0);-webkit-transform-origin:left center;transform-origin:left center}}.zoomOutLeft{-webkit-animation-name:zoomOutLeft;animation-name:zoomOutLeft}@-webkit-keyframes zoomOutRight{40%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(-42px,0,0);transform:scale3d(.475,.475,.475) translate3d(-42px,0,0)}100%{opacity:0;-webkit-transform:scale(.1) translate3d(2000px,0,0);transform:scale(.1) translate3d(2000px,0,0);-webkit-transform-origin:right center;transform-origin:right center}}@keyframes zoomOutRight{40%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(-42px,0,0);transform:scale3d(.475,.475,.475) translate3d(-42px,0,0)}100%{opacity:0;-webkit-transform:scale(.1) translate3d(2000px,0,0);transform:scale(.1) translate3d(2000px,0,0);-webkit-transform-origin:right center;transform-origin:right center}}.zoomOutRight{-webkit-animation-name:zoomOutRight;animation-name:zoomOutRight}@-webkit-keyframes zoomOutUp{40%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(0,60px,0);transform:scale3d(.475,.475,.475) translate3d(0,60px,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}100%{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(0,-2000px,0);transform:scale3d(.1,.1,.1) translate3d(0,-2000px,0);-webkit-transform-origin:center bottom;transform-origin:center bottom;-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}@keyframes zoomOutUp{40%{opacity:1;-webkit-transform:scale3d(.475,.475,.475) translate3d(0,60px,0);transform:scale3d(.475,.475,.475) translate3d(0,60px,0);-webkit-animation-timing-function:cubic-bezier(0.55,.055,.675,.19);animation-timing-function:cubic-bezier(0.55,.055,.675,.19)}100%{opacity:0;-webkit-transform:scale3d(.1,.1,.1) translate3d(0,-2000px,0);transform:scale3d(.1,.1,.1) translate3d(0,-2000px,0);-webkit-transform-origin:center bottom;transform-origin:center bottom;-webkit-animation-timing-function:cubic-bezier(0.175,.885,.32,1);animation-timing-function:cubic-bezier(0.175,.885,.32,1)}}.zoomOutUp{-webkit-animation-name:zoomOutUp;animation-name:zoomOutUp}@-webkit-keyframes slideInDown{from{-webkit-transform:translate3d(0,-100%,0);transform:translate3d(0,-100%,0);visibility:visible}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}@keyframes slideInDown{from{-webkit-transform:translate3d(0,-100%,0);transform:translate3d(0,-100%,0);visibility:visible}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}.slideInDown{-webkit-animation-name:slideInDown;animation-name:slideInDown}@-webkit-keyframes slideInLeft{from{-webkit-transform:translate3d(-100%,0,0);transform:translate3d(-100%,0,0);visibility:visible}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}@keyframes slideInLeft{from{-webkit-transform:translate3d(-100%,0,0);transform:translate3d(-100%,0,0);visibility:visible}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}.slideInLeft{-webkit-animation-name:slideInLeft;animation-name:slideInLeft}@-webkit-keyframes slideInRight{from{-webkit-transform:translate3d(100%,0,0);transform:translate3d(100%,0,0);visibility:visible}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}@keyframes slideInRight{from{-webkit-transform:translate3d(100%,0,0);transform:translate3d(100%,0,0);visibility:visible}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}.slideInRight{-webkit-animation-name:slideInRight;animation-name:slideInRight}@-webkit-keyframes slideInUp{from{-webkit-transform:translate3d(0,100%,0);transform:translate3d(0,100%,0);visibility:visible}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}@keyframes slideInUp{from{-webkit-transform:translate3d(0,100%,0);transform:translate3d(0,100%,0);visibility:visible}100%{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}}.slideInUp{-webkit-animation-name:slideInUp;animation-name:slideInUp}@-webkit-keyframes slideOutDown{from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}100%{visibility:hidden;-webkit-transform:translate3d(0,100%,0);transform:translate3d(0,100%,0)}}@keyframes slideOutDown{from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}100%{visibility:hidden;-webkit-transform:translate3d(0,100%,0);transform:translate3d(0,100%,0)}}.slideOutDown{-webkit-animation-name:slideOutDown;animation-name:slideOutDown}@-webkit-keyframes slideOutLeft{from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}100%{visibility:hidden;-webkit-transform:translate3d(-100%,0,0);transform:translate3d(-100%,0,0)}}@keyframes slideOutLeft{from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}100%{visibility:hidden;-webkit-transform:translate3d(-100%,0,0);transform:translate3d(-100%,0,0)}}.slideOutLeft{-webkit-animation-name:slideOutLeft;animation-name:slideOutLeft}@-webkit-keyframes slideOutRight{from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}100%{visibility:hidden;-webkit-transform:translate3d(100%,0,0);transform:translate3d(100%,0,0)}}@keyframes slideOutRight{from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}100%{visibility:hidden;-webkit-transform:translate3d(100%,0,0);transform:translate3d(100%,0,0)}}.slideOutRight{-webkit-animation-name:slideOutRight;animation-name:slideOutRight}@-webkit-keyframes slideOutUp{from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}100%{visibility:hidden;-webkit-transform:translate3d(0,-100%,0);transform:translate3d(0,-100%,0)}}@keyframes slideOutUp{from{-webkit-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}100%{visibility:hidden;-webkit-transform:translate3d(0,-100%,0);transform:translate3d(0,-100%,0)}}.slideOutUp{-webkit-animation-name:slideOutUp;animation-name:slideOutUp} ```
The U.S. state of Texas is divided into 254 counties, more than any other U.S. state. While only about 20% of Texas counties are generally located within the Houston—Dallas—San Antonio—Austin areas, they serve a majority of the state's population with approximately 22,000,000 inhabitants. Texas was originally divided into municipalities (municipios in Spanish), a unit of local government under Spanish and Mexican rule. When the Republic of Texas gained its independence in 1836, the 23 municipalities became the original Texas counties. Many of these were later divided into new counties. The last county to be initially created was Kenedy County in 1921, but Loving County is the newest organized county; it was first organized in 1893 in an apparent scheme to defraud, abolished in 1897, then reorganized in 1931. Most of these recent counties, especially near the northwest, were created from Bexar County during the 1870s. Each county is run by a commissioners' court, consisting of four elected commissioners (one from each of four precincts drawn based on population) and a county judge elected from all the voters of the county. In smaller counties, the county judge actually does perform judicial duties, but in larger counties, the county judge functions as the county's chief executive officer. Certain officials, such as the sheriff and tax collector, are elected separately by the voters, but the commissioners' court determines their office budgets, and sets overall county policy. All county elections are partisan; the one exception is the board of trustees of the Dallas County department of education (the Harris County trustees were elected on a nonpartisan basis until 1984). While the counties have eminent domain power and control all unincorporated land within their boundaries, they have neither home-rule authority nor zoning power. The county is responsible for providing essential services (except for fire and ambulance, which are often supplied by volunteer fire departments). Unlike other US states, Texas does not allow for consolidated city-county governments. Cities and counties (as well as other political entities) are permitted to enter "interlocal agreements" to share services (as an example, a city and a school district may enter into agreements with the county whereby the county bills for and collects property taxes for the city and school district; thus, only one tax bill is sent instead of three). School districts are independent of county and city government (with the exception of the Stafford Municipal School District, which is city controlled). The Federal Information Processing Standard (FIPS) code, which is used by the United States government to uniquely identify states and counties, is provided with each entry. Texas' code is 48, which when combined with any county code would be written in the form of 48XXX. The FIPS code for each county in the table links to census data for that county. List |} Defunct counties There have been at least thirty-two counties established by Texas law that no longer exist. These fall into five categories: judicial counties; counties established by the Constitutional Convention of 1868–69; counties never organized which were abolished by legislative act; counties whose territory is no longer considered part of the state; and counties whose names have been changed. Buchel County, formed in 1887 from Presidio County. Annexed in 1897 to Brewster County. Dawson County, formed in 1858 in what is now Kinney County and Uvalde County and abolished in 1866 (not to be confused with the present-day Dawson County). Encinal County, formed in 1856. Abolished in 1899 and annexed to Webb County. Foley County, formed in 1887 from Presidio County. Annexed in 1897 to Brewster County. Greer County, formed in 1860. Separated from Texas by U.S. Supreme Court ruling in United States v. the State of Texas, and is now part of southwestern Oklahoma. Perdido County, formed in 1824 and forgotten during the upheavals of the 1840s. Perdido was reportedly abolished in 1858 and again in 1871. Records of annexation to Dawson County are also inconclusive. Santa Fe County, Texas formed in 1848 from lands claimed by the Republic of Texas and ceded by Mexico. It included a vast area later becoming portions of several states from New Mexico east of the Rio Grande extending northward into south-central Wyoming. Within Texas' modern boundaries, the county included the Trans-Pecos and most of the Panhandle. The county was abolished when Texas ceded its western lands under the Compromise of 1850. Wegefarth County, formed in 1873 in the Texas Panhandle and abolished in 1876. Worth County, formed in 1850 from part of Santa Fe County. Abolished under the Compromise of 1850 and is now part of east-central New Mexico. See also Texas census statistical areas List of Texas county seat name etymologies List of counties in Georgia References Sources - Counties, county seats, county formation, and areas - official sites - official sites - Google Doc External links Maps and lists of Texas regions and counties Texas Counties
```scss span.cart-count { margin-left: 10px; transition: all .5s; animation-duration: 1s; animation-iteration-count: 1; @keyframes animateCart { 0% {color: inherit; font-weight: inherit; font-size: 1rem;} 50% {color: #28a745; font-weight: bold; font-size: 1.4rem;} 100% {color: inherit; font-weight: inherit; font-size: 1rem;} } } ```
```java /* * * This file is part of SchemaSpy. * * SchemaSpy is free software: you can redistribute it and/or modify * (at your option) any later version. * * SchemaSpy 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 SchemaSpy. If not, see <path_to_url */ package org.schemaspy.testing.testcontainers; import com.github.dockerjava.api.command.InspectContainerResponse; import com.github.dockerjava.api.model.ExposedPort; import com.github.dockerjava.api.model.Ports; import org.slf4j.Logger; import org.slf4j.LoggerFactory; import org.testcontainers.containers.GenericContainer; import org.testcontainers.containers.JdbcDatabaseContainer; import org.testcontainers.utility.DockerImageName; import java.lang.invoke.MethodHandles; import java.lang.reflect.Field; import java.util.Collections; import java.util.Set; /** * @author Nils Petzaell */ public class InformixContainer extends JdbcDatabaseContainer<InformixContainer> { private static final Logger LOGGER = LoggerFactory.getLogger(MethodHandles.lookup().lookupClass()); static final String IMAGE = "ibmcom/informix-developer-database"; static final Integer INFORMIX_PORT = 9088; public InformixContainer(){ this(IMAGE + ":12.10.FC9W1DE"); } public InformixContainer(final String dockerImageName) { super(DockerImageName.parse(dockerImageName)); } @Override public String getDriverClassName() { return "com.informix.jdbc.IfxDriver"; } @Override public String getJdbcUrl() { return "jdbc:informix-sqli://"+ getHost() + ":" + getJdbcPort()+ "/sysmaster:INFORMIXSERVER=dev"; } @Override public String getUsername() { return "informix"; } @Override public String getPassword() { return "in4mix"; } public Integer getJdbcPort(){ try { getMappedPort(INFORMIX_PORT); } catch (IllegalArgumentException iae) { updateContainerInfo(dockerClient.inspectContainerCmd(getContainerId()).exec()); } return getMappedPort(INFORMIX_PORT); } @Override protected String getTestQueryString() { return "select count(*) from systables"; } @Override public Set<Integer> getLivenessCheckPortNumbers() { return Collections.singleton(getMappedPort(INFORMIX_PORT)); } @Override protected void configure() { super.configure(); addExposedPort(INFORMIX_PORT); addEnv("LICENSE","accept"); withPrivilegedMode(true); withCreateContainerCmdModifier(c -> { c.withTty(true); c.withPublishAllPorts(false); c.withPortBindings(new Ports(ExposedPort.tcp(9088), Ports.Binding.empty())); }); } @Override protected void waitUntilContainerStarted() { super.waitUntilContainerStarted(); LOGGER.info("Restart container"); dockerClient.restartContainerCmd(getContainerId()).exec(); for(int i = 0; i < 10; i++) { InspectContainerResponse inspectContainerResponse = dockerClient.inspectContainerCmd(getContainerId()).exec(); if (inspectContainerResponse.getNetworkSettings().getPorts().getBindings().containsKey(ExposedPort.tcp(9088))) { updateContainerInfo(inspectContainerResponse); break; } } super.waitUntilContainerStarted(); } private void updateContainerInfo(InspectContainerResponse inspectContainerResponse) { try { Field field = GenericContainer.class.getDeclaredField("containerInfo"); field.setAccessible(true); field.set(this, inspectContainerResponse); field.setAccessible(false); } catch (NoSuchFieldException | IllegalAccessException e) { LOGGER.error("Failed to update container info", e); } } } ```
Fabio Borriello (born 16 December 1985) is an Italian former professional footballer who played as a defender. Career After starting his career with Eccellenza side Cervia, Borriello won a professional contract with Milan in 2005 through a football Reality television show called Campioni, il sogno. He was sent on loan to Serie C2 clubs Lecco and Pro Vasto, but still had limited playing opportunities. On 21 July 2007, he was transferred to Swiss Challenge League side AC Lugano. Personal life Fabio is the brother of fellow Italian footballer Marco, who formerly represented Italy at international level. For a time he was in a relationship with Italian pop singer Emma Marrone; the couple split in September 2014. After retiring from football he became the CEO of the real estate company FB Internazionale SAGL. References External links Profile at MagliaRossonera.it 1985 births Living people Italian men's footballers Italian expatriate men's footballers AC Milan players Vastese Calcio 1902 players FC Lugano players Expatriate men's footballers in Switzerland Italian expatriate sportspeople in Switzerland Men's association football defenders Footballers from Naples
Fergus McAteer is an accountant and former politician in Northern Ireland. The son of Nationalist Party leader Eddie McAteer, Fergus was active in the civil rights movement of the late 1960s. He was arrested during the events of Bloody Sunday and charged with throwing stones, but the charges were later dropped. McAteer always strongly denied these claims. McAteer himself became prominent in the Nationalist Party. In 1973, he was elected to Derry City Council, and he was re-elected in 1977. In October 1977 he merged the Nationalist Party with Unity to form the Irish Independence Party (IIP), becoming joint chair with former Unity leader Frank McManus. He stood for the party in Londonderry at the 1979 general election, but could take only fourth place in the poll. He held his seat on the City Council in 1981, with an increased vote. McAteer narrowly held the seat in 1985 and the IIP overall saw their representation on local councils reduced from 21 members in 1981 to 4 members in 1985 and dissolved before the next local election, and McAteer did not restand in 1989. McAteer started an accountancy firm in 1973, and continued to run the firm as of 2007. References Living people Year of birth missing (living people) Accountants from Northern Ireland Councillors in Derry (city) Leaders of political parties in Northern Ireland
Greek Hits: Giorgos Mazonakis vs. Despina Vandi is the fifth video album by Greek singer Despina Vandi and her only video album in Ukraine, released in 2008 by Odyssey Company in Ukraine. It features videos of Despina Vandi and Giorgos Mazonakis, from the period 2003-2007. Track listing References External links Official site Despina Vandi video albums Greek-language albums Music videos directed by Kostas Kapetanidis 2008 video albums 2008 compilation albums Music video compilation albums
The table below shows a list of every city in the UAE with a population of at least 10,000, listed in descending order. The capitals are shown in bold. The population numbers are of the cities, and not the emirates, often with the same name. There is also an additional list of the rest of the populated settlements in the UAE under 10,000(not listed in descending order). Largest cities Other towns and settlements Gallery References United Arab Emirates, List of cities in the Cities
```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. //go:generate go run generate-base.go package jsonschema import ( "fmt" "io/ioutil" "strconv" "gopkg.in/yaml.v3" ) // This is a global map of all known Schemas. // It is initialized when the first Schema is created and inserted. var schemas map[string]*Schema // NewBaseSchema builds a schema object from an embedded json representation. func NewBaseSchema() (schema *Schema, err error) { b, err := baseSchemaBytes() if err != nil { return nil, err } var node yaml.Node err = yaml.Unmarshal(b, &node) if err != nil { return nil, err } return NewSchemaFromObject(&node), nil } // NewSchemaFromFile reads a schema from a file. // Currently this assumes that schemas are stored in the source distribution of this project. func NewSchemaFromFile(filename string) (schema *Schema, err error) { file, err := ioutil.ReadFile(filename) if err != nil { return nil, err } var node yaml.Node err = yaml.Unmarshal(file, &node) if err != nil { return nil, err } return NewSchemaFromObject(&node), nil } // NewSchemaFromObject constructs a schema from a parsed JSON object. // Due to the complexity of the schema representation, this is a // custom reader and not the standard Go JSON reader (encoding/json). func NewSchemaFromObject(jsonData *yaml.Node) *Schema { switch jsonData.Kind { case yaml.DocumentNode: return NewSchemaFromObject(jsonData.Content[0]) case yaml.MappingNode: schema := &Schema{} for i := 0; i < len(jsonData.Content); i += 2 { k := jsonData.Content[i].Value v := jsonData.Content[i+1] switch k { case "$schema": schema.Schema = schema.stringValue(v) case "id": schema.ID = schema.stringValue(v) case "multipleOf": schema.MultipleOf = schema.numberValue(v) case "maximum": schema.Maximum = schema.numberValue(v) case "exclusiveMaximum": schema.ExclusiveMaximum = schema.boolValue(v) case "minimum": schema.Minimum = schema.numberValue(v) case "exclusiveMinimum": schema.ExclusiveMinimum = schema.boolValue(v) case "maxLength": schema.MaxLength = schema.intValue(v) case "minLength": schema.MinLength = schema.intValue(v) case "pattern": schema.Pattern = schema.stringValue(v) case "additionalItems": schema.AdditionalItems = schema.schemaOrBooleanValue(v) case "items": schema.Items = schema.schemaOrSchemaArrayValue(v) case "maxItems": schema.MaxItems = schema.intValue(v) case "minItems": schema.MinItems = schema.intValue(v) case "uniqueItems": schema.UniqueItems = schema.boolValue(v) case "maxProperties": schema.MaxProperties = schema.intValue(v) case "minProperties": schema.MinProperties = schema.intValue(v) case "required": schema.Required = schema.arrayOfStringsValue(v) case "additionalProperties": schema.AdditionalProperties = schema.schemaOrBooleanValue(v) case "properties": schema.Properties = schema.mapOfSchemasValue(v) case "patternProperties": schema.PatternProperties = schema.mapOfSchemasValue(v) case "dependencies": schema.Dependencies = schema.mapOfSchemasOrStringArraysValue(v) case "enum": schema.Enumeration = schema.arrayOfEnumValuesValue(v) case "type": schema.Type = schema.stringOrStringArrayValue(v) case "allOf": schema.AllOf = schema.arrayOfSchemasValue(v) case "anyOf": schema.AnyOf = schema.arrayOfSchemasValue(v) case "oneOf": schema.OneOf = schema.arrayOfSchemasValue(v) case "not": schema.Not = NewSchemaFromObject(v) case "definitions": schema.Definitions = schema.mapOfSchemasValue(v) case "title": schema.Title = schema.stringValue(v) case "description": schema.Description = schema.stringValue(v) case "default": schema.Default = v case "format": schema.Format = schema.stringValue(v) case "$ref": schema.Ref = schema.stringValue(v) default: fmt.Printf("UNSUPPORTED (%s)\n", k) } } // insert schema in global map if schema.ID != nil { if schemas == nil { schemas = make(map[string]*Schema, 0) } schemas[*(schema.ID)] = schema } return schema default: fmt.Printf("schemaValue: unexpected node %+v\n", jsonData) } return nil } // // BUILDERS // The following methods build elements of Schemas from interface{} values. // Each returns nil if it is unable to build the desired element. // // Gets the string value of an interface{} value if possible. func (schema *Schema) stringValue(v *yaml.Node) *string { switch v.Kind { case yaml.ScalarNode: return &v.Value default: fmt.Printf("stringValue: unexpected node %+v\n", v) } return nil } // Gets the numeric value of an interface{} value if possible. func (schema *Schema) numberValue(v *yaml.Node) *SchemaNumber { number := &SchemaNumber{} switch v.Kind { case yaml.ScalarNode: switch v.Tag { case "!!float": v2, _ := strconv.ParseFloat(v.Value, 64) number.Float = &v2 return number case "!!int": v2, _ := strconv.ParseInt(v.Value, 10, 64) number.Integer = &v2 return number default: fmt.Printf("stringValue: unexpected node %+v\n", v) } default: fmt.Printf("stringValue: unexpected node %+v\n", v) } return nil } // Gets the integer value of an interface{} value if possible. func (schema *Schema) intValue(v *yaml.Node) *int64 { switch v.Kind { case yaml.ScalarNode: switch v.Tag { case "!!float": v2, _ := strconv.ParseFloat(v.Value, 64) v3 := int64(v2) return &v3 case "!!int": v2, _ := strconv.ParseInt(v.Value, 10, 64) return &v2 default: fmt.Printf("intValue: unexpected node %+v\n", v) } default: fmt.Printf("intValue: unexpected node %+v\n", v) } return nil } // Gets the bool value of an interface{} value if possible. func (schema *Schema) boolValue(v *yaml.Node) *bool { switch v.Kind { case yaml.ScalarNode: switch v.Tag { case "!!bool": v2, _ := strconv.ParseBool(v.Value) return &v2 default: fmt.Printf("boolValue: unexpected node %+v\n", v) } default: fmt.Printf("boolValue: unexpected node %+v\n", v) } return nil } // Gets a map of Schemas from an interface{} value if possible. func (schema *Schema) mapOfSchemasValue(v *yaml.Node) *[]*NamedSchema { switch v.Kind { case yaml.MappingNode: m := make([]*NamedSchema, 0) for i := 0; i < len(v.Content); i += 2 { k2 := v.Content[i].Value v2 := v.Content[i+1] pair := &NamedSchema{Name: k2, Value: NewSchemaFromObject(v2)} m = append(m, pair) } return &m default: fmt.Printf("mapOfSchemasValue: unexpected node %+v\n", v) } return nil } // Gets an array of Schemas from an interface{} value if possible. func (schema *Schema) arrayOfSchemasValue(v *yaml.Node) *[]*Schema { switch v.Kind { case yaml.SequenceNode: m := make([]*Schema, 0) for _, v2 := range v.Content { switch v2.Kind { case yaml.MappingNode: s := NewSchemaFromObject(v2) m = append(m, s) default: fmt.Printf("arrayOfSchemasValue: unexpected node %+v\n", v2) } } return &m case yaml.MappingNode: m := make([]*Schema, 0) s := NewSchemaFromObject(v) m = append(m, s) return &m default: fmt.Printf("arrayOfSchemasValue: unexpected node %+v\n", v) } return nil } // Gets a Schema or an array of Schemas from an interface{} value if possible. func (schema *Schema) schemaOrSchemaArrayValue(v *yaml.Node) *SchemaOrSchemaArray { switch v.Kind { case yaml.SequenceNode: m := make([]*Schema, 0) for _, v2 := range v.Content { switch v2.Kind { case yaml.MappingNode: s := NewSchemaFromObject(v2) m = append(m, s) default: fmt.Printf("schemaOrSchemaArrayValue: unexpected node %+v\n", v2) } } return &SchemaOrSchemaArray{SchemaArray: &m} case yaml.MappingNode: s := NewSchemaFromObject(v) return &SchemaOrSchemaArray{Schema: s} default: fmt.Printf("schemaOrSchemaArrayValue: unexpected node %+v\n", v) } return nil } // Gets an array of strings from an interface{} value if possible. func (schema *Schema) arrayOfStringsValue(v *yaml.Node) *[]string { switch v.Kind { case yaml.ScalarNode: a := []string{v.Value} return &a case yaml.SequenceNode: a := make([]string, 0) for _, v2 := range v.Content { switch v2.Kind { case yaml.ScalarNode: a = append(a, v2.Value) default: fmt.Printf("arrayOfStringsValue: unexpected node %+v\n", v2) } } return &a default: fmt.Printf("arrayOfStringsValue: unexpected node %+v\n", v) } return nil } // Gets a string or an array of strings from an interface{} value if possible. func (schema *Schema) stringOrStringArrayValue(v *yaml.Node) *StringOrStringArray { switch v.Kind { case yaml.ScalarNode: s := &StringOrStringArray{} s.String = &v.Value return s case yaml.SequenceNode: a := make([]string, 0) for _, v2 := range v.Content { switch v2.Kind { case yaml.ScalarNode: a = append(a, v2.Value) default: fmt.Printf("arrayOfStringsValue: unexpected node %+v\n", v2) } } s := &StringOrStringArray{} s.StringArray = &a return s default: fmt.Printf("arrayOfStringsValue: unexpected node %+v\n", v) } return nil } // Gets an array of enum values from an interface{} value if possible. func (schema *Schema) arrayOfEnumValuesValue(v *yaml.Node) *[]SchemaEnumValue { a := make([]SchemaEnumValue, 0) switch v.Kind { case yaml.SequenceNode: for _, v2 := range v.Content { switch v2.Kind { case yaml.ScalarNode: switch v2.Tag { case "!!str": a = append(a, SchemaEnumValue{String: &v2.Value}) case "!!bool": v3, _ := strconv.ParseBool(v2.Value) a = append(a, SchemaEnumValue{Bool: &v3}) default: fmt.Printf("arrayOfEnumValuesValue: unexpected type %s\n", v2.Tag) } default: fmt.Printf("arrayOfEnumValuesValue: unexpected node %+v\n", v2) } } default: fmt.Printf("arrayOfEnumValuesValue: unexpected node %+v\n", v) } return &a } // Gets a map of schemas or string arrays from an interface{} value if possible. func (schema *Schema) mapOfSchemasOrStringArraysValue(v *yaml.Node) *[]*NamedSchemaOrStringArray { m := make([]*NamedSchemaOrStringArray, 0) switch v.Kind { case yaml.MappingNode: for i := 0; i < len(v.Content); i += 2 { k2 := v.Content[i].Value v2 := v.Content[i+1] switch v2.Kind { case yaml.SequenceNode: a := make([]string, 0) for _, v3 := range v2.Content { switch v3.Kind { case yaml.ScalarNode: a = append(a, v3.Value) default: fmt.Printf("mapOfSchemasOrStringArraysValue: unexpected node %+v\n", v3) } } s := &SchemaOrStringArray{} s.StringArray = &a pair := &NamedSchemaOrStringArray{Name: k2, Value: s} m = append(m, pair) default: fmt.Printf("mapOfSchemasOrStringArraysValue: unexpected node %+v\n", v2) } } default: fmt.Printf("mapOfSchemasOrStringArraysValue: unexpected node %+v\n", v) } return &m } // Gets a schema or a boolean value from an interface{} value if possible. func (schema *Schema) schemaOrBooleanValue(v *yaml.Node) *SchemaOrBoolean { schemaOrBoolean := &SchemaOrBoolean{} switch v.Kind { case yaml.ScalarNode: v2, _ := strconv.ParseBool(v.Value) schemaOrBoolean.Boolean = &v2 case yaml.MappingNode: schemaOrBoolean.Schema = NewSchemaFromObject(v) default: fmt.Printf("schemaOrBooleanValue: unexpected node %+v\n", v) } return schemaOrBoolean } ```
Eliza Fenwick (; 1 February 1767 – 8 December 1840) was an English author, whose works include Secresy; or The Ruin on the Rock (1795) and several children's books. She was born in Cornwall, married an alcoholic, and had two children by him. She left him and eventually went to live with her children in Barbados, where she ran a school with her daughter. Biography Eliza Jaco was born on 1 February 1767 at Pelynt, Cornwall. Her parents were Peter and Elizabeth Jaco (née Hawkswotorth), and she was baptized Elizabeth on 25 June 1766. She married in the 1780s the writer John Fenwick, who became an alcoholic and fell in debt. They had two children, Eliza and Orlando. She took up tasks such as working as a governess to make family ends meet, but eventually left Fenwick and moved to Ireland as a governess in 1807. By this time, Fenwick's daughter had moved to the West Indies to be an actress, and married William Rutherford, by whom she had four children. Fenwick and her son, Orlando, joined her daughter in Barbados in 1814, but Orlando died of yellow fever in 1816. In 1819, Fenwick's son-in-law left the family, leaving the mother and daughter to bring up the four children. The pair ran a secondary school, which provided income and ensured the children's own education. Fenwick owned several enslaved people who worked in the school and her household. Fenwick's daughter died in 1828, leaving her to raise the children alone. By 1835 she was living in the United states and she died in 1840 in Providence, Rhode Island. Writing Throughout her life Fenwick corresponded with friends who included Mary Hays, Thomas Holcroft, William Godwin, Mary Wollstonecraft, Charlotte Turner Smith, and Charles and Mary Lamb. Much of the correspondence survives. Her epistolary novel Secresy; or The Ruin on the Rock was published as "By a Woman" in 1795. Her subsequent works were written for children, sometimes under the pseudonym Rev. David Blair. Mary and Her Cat (1804) was advertised as being "in words not exceeding two syllables". Visits to the Junior Library (1805, facsimile 1977) tells of a ghastly West Indian family with a slave nurse being "reclaimed by discovering the joys of learning." References Further reading External links 1767 births 1840 deaths 19th-century English women writers British emigrants to Barbados English governesses British slave owners Novelists from Cornwall Schoolteachers from Cornwall British women children's writers English women novelists Pseudonymous women writers People from Pelynt 18th-century English women writers 18th-century pseudonymous writers 19th-century pseudonymous writers Women slave owners 19th-century Barbadian people Immigrants to the British West Indies Colony of Barbados people British emigrants to the British West Indies 19th-century English women educators
The (JPAA), headquartered in Tokyo, Japan, is the only one national, professional bar association of Japanese patent attorneys (Benrishi) with approximately 10,000 members. History The Japanese Patent Attorney System was established on July 1, 1899, fourteen years after the Patent Law System was organized by Korekiyo Takahashi in 1885. In 1899, the number of registered Patent Attorneys was 138. Since then, the number of Patent Attorneys has increased gradually and, in 2012, reached 9300. The organization for Patent Attorneys, namely the Japan Patent Attorneys Association (JPAA), was founded in 1915. Since its founding, the JPAA has played an important role in improving Japan's industrial property rights system. The JPAA has also been a leader in promoting better understanding of various issues relating to intellectual property (IP). For example, the JPAA has hosted a number of seminars and lectures focusing on IP issues on such wide-ranging topics as international treaties, domestic and international laws and new and advanced technologies. Nobuchika Sugimura was the first chairman of the JPAA. Qualification Ordinarily, to become a Patent Attorney, one must pass the examination given annually by the Japan Patent Office. The examination consists of a three-step screening method: first a multiple-choice examination, then an essay writing examination, and finally an oral examination. The examination consists of several mandatory subjects such as industrial property laws and treaties as well as optional subjects such as communication engineering, organic chemistry, and other natural sciences. Registration A person who has passed the examination or who holds another national qualification for becoming a Patent Attorney must register himself or herself with the JPAA to practice as a Patent Attorney. In other words, all Patent Attorneys are required by law to register with the JPAA. The JPAA oversees and regulates the activities of its members, for example by requiring each JPAA member to abide by the code of ethics (which is prescribed by the law) that sets the standard regulating the members' conduct. Organization The president of JPAA is responsible for all matters relating to internal and external affairs of the JPAA. There are eight JPAA vice-presidents who help and support the president. The president and vice-presidents form a Board of Executive Directors that decides on and executes the budget and main projects of the JPAA. In addition to the Board of Executive Directors, the JPAA has a couple of other boards, such as the Audit Board and the Board of Council Members. The JPAA also has five affiliated organizations, such as the International Activities Center and the Education Institute. The JPAA has about forty committees, such as the Patent Committee and the Trademark Committee. In April 2006 the organization of the JPAA will be changed. That is, up to 20 council members will be added to the board of directors and the term of the president will be extended to two years starting from April 2007. The secretariat and his/her staff assist the board of executives in all matters. Currently the Board of Council Members consists of 40 persons elected by JPAA members. This number will increase to 60 in April 2006. The JPAA has a general assembly that is the highest decision making assembly, consisting of all Patent Attorneys. Professional services The Patent Attorney represents both Japanese and foreign clients in the procedures of patent, utility model, design, and trademark applications before the Japan Patent Office. No person except a Patent Attorney or Attorney at Law is permitted to represent clients before the Patent Office in exchange for remuneration. Other than representation before the Patent Office, the Patent Attorney can represent clients in connection with matters related to unfair competition law and the procedures associated with arbitration or settlement regarding IP issues, importation of infringing articles, and IP licensing. The Patent Attorney can represent clients in an administrative proceeding in appealing the Patent Office's decision before the Intellectual Property High Court. The Patent Attorney can appear, present a statement and/or perform an interrogation in court in order to assist a party and its Attorney at Law in connection with matters involving patent, utility model, design, and trademark affairs. The Patent Attorney can prepare expert opinions with respect to patent, utility model, design, and trademark. A Patent Attorney who has passed a special examination after taking 45 hours of courses on IP litigation can represent clients in infringement lawsuits along with an Attorney at Law. Activities Education The JPAA started its educational activities in 1962 and established the Training Institute in 1978. The Training Institute offers a number of training and continuing education courses and programs for new and experienced JPAA members. The training program for new members is divided into two parts, one in spring and the other in autumn, each part consisting of about 20 courses of intensive study covering many topics ranging from patent application procedures and studies of judicial cases to international application procedures. The focus of the training for experienced members is primarily on the substantive patent and trademark laws, as well as PCT, EPC, and U.S. patent procedures and the patent procedures of other countries. It also includes litigation, copyright, unfair competition laws, and a number of other areas in which the role of patent attorneys is expected to expand. JPAA has recently introduced an e-learning system, offering its educational programs to its members via the Internet. International The JPAA is very active internationally. The JPAA hosts regular meetings with the KPAA, the ACPAA, and the AIPLA in order to promote better mutual understanding among respective groups about various IP systems. The JPAA has also had meetings and other exchanges with the CIPA and other patent attorney associations. The JPAA regularly sends its delegates to WIPO sessions to participate in discussions concerning international IP systems. The JPAA has made significant contributions to APIC training courses, which are organized by the Japan Institute of Invention and Innovation and sponsored by the Japan Patent Office. The JPAA regularly sends lecturers for programs provided by the APIC, and the APIC training courses have been attended by more than 1,000 trainees from the APEC and other countries since 1996. JPAA regularly makes available in English such information as revisions of the Japanese IP laws and changes in practice before the Japan Patent Office. Information such as revisions of intellectual property laws and practice, treaties, and Patent Office and court decision in foreign countries is provided in Japanese to JPAA members. Research The JPAA has a research arm – the IP Research Institute – where researchers study and research a wide variety of matters relating to industrial property. The researchers at the Institute include not only patent attorneys but also scholars. In addition, various committees of the JPAA are studying and researching specific topics. Committees include the Patent Committee, Design Committee, Trademark Committee, Computer Software Committee, and Biotechnology Committee. The findings by these committees are published in the magazine "PATENT" and made available to the public. Support and assistance JPAA also runs the IP Assistance and Support Center for the purposes of enlightening and popularizing the IP system by educating the general public about the roles of the IP system in our society. The Patent Attorneys who volunteer their time and resources help give lectures at schools and organize meetings where people can consult about IP issues. The JPAA assists with invention contests and provides financial assistance to small businesses. Arbitration Center JPAA organizes and operates the Arbitration Center for IP rights under joint control with the Japan Federation of Bar Associations. The Arbitration Center is an extrajudicial organization that can resolve disputes very quickly (basically within three months) and privately (in closed sessions, out of court). The arbitrators are selected from Patent Attorneys and Attorneys at Law. The judgment of the arbitrator(s) will constitute the final judgment and no appeal to the court can be made. Arbitration has an advantage over judicial proceeding in that the expenses for arbitration are likely to be considerably less. Public relations JPAA publishes the monthly magazine "PATENT" and the monthly newsletter "JPAA Journal". In addition to these periodical publications, JPAA makes available a guidebook and/or a brochure for people who are not familiar with the IP system and the roles of Patent Attorneys. JPAA has its own web site (http://www.jpaa.or.jp/), which makes available information about the activities of JPAA, topics about the industrial property system, revisions of related laws, judicial precedents, and so forth. JPAA holds monthly meetings with people from the news media and cooperates with broadcast media by providing them with information relating to IP issues and other related topics. References External links History of the Japan Patent Attorneys Association, Japan Patent Attorneys Association Japanese patent law Intellectual property organizations
```scss @charset "UTF-8"; /** * _mask.scss * @author Kayo * @date 2014-11-11 * * .qui_maskWrap * > .qui_mask */ // .qui_maskWrap { position: relative; z-index: $maskWrap_zIndex; } .qui_mask { position: fixed; top: 0; right: 0; bottom: 0; left: 0; z-index: $mask_zIndex; background: $mask_background; opacity: $mask_opacity; filter: alpha(opacity=$mask_opacity * 100); } ```
Steinbach am Glan () is an Ortsgemeinde – a municipality belonging to a Verbandsgemeinde, a kind of collective municipality – in the Kusel district in Rhineland-Palatinate, Germany. It belongs to the Verbandsgemeinde Oberes Glantal. Geography Location The municipality lies about 35 km west of Kaiserslautern on both sides of the Steinbach, which rises in the village's west end and then flows about one kilometre down to the Hodenbach, where the two streams together become the Henschbach. The constituent community of Steinbach lies on the brook's right bank and the constituent community of Frutzweiler on the left. Steinbach therefore does not lie right on the Glan, which makes its name suffix “am Glan” a bit misleading. It actually lies some 7 km upstream from where the local river empties into the Glan. The name suffix simply serves to distinguish Steinbach am Glan from other places named Steinbach. From the bottom of the dale at roughly 260 m above sea level, the land rises steeply on the right bank up to the Schnepfenrech (417 m) and the Steinberg (406 m), while over on the left side, an elevation of 367 m above sea level is reached. Other peaks are the Marbacher Berg with its sporting ground (353 m) and the Neumühler Berg (343 m). Once lying within municipal limits were two coal pits, Steinbach and Maria. Much of the Hodenbachtal (Hodenbach valley), laid out as a recreational area, lies within Steinbach's municipal limits. The municipal area measures 686 ha, of which 123 ha is wooded. Neighbouring municipalities Steinbach am Glan borders in the north on the municipality of Wahnwegen, in the northeast on the municipality of Henschtal, in the southeast on the municipality of Börsborn, in the south on the municipality of Brücken, in the west on the municipality of Ohmbach and in the northwest on the municipality of Herschweiler-Pettersheim. Constituent communities Steinbach am Glan's Ortsteile are Steinbach and Frutzweiler. Also belonging to Steinbach am Glan is the outlying homestead of Naturfreundehaus, actually the “Friends of Nature” House. Municipality’s layout The centre now known as Steinbach am Glan was originally made up of two linear villages (by some definitions, “thorpes”), one on each side of the brook, that eventually met and grew together. The way the built-up area is laid out and the way the houses are built, much of it from the 19th century, still reflect this original configuration to some extent, along Bundesstraße 423 in Steinbach's case and along the old village street (Dorfstraße) in Frutzweiler's. As Steinbach began spreading out to the south towards Börsborn as far back as the early 19th century, the two villages now have the outward appearance of one great clump village, and everywhere sidestreets have been springing up down to the present day. Where the two villages have run up against each other – especially on the Steinbach side – a village centre of sorts has arisen. This is where the old belltower stands, built in 1788 and endowed by the then rulers, the Counts of Leyen, represented in this case by Countess Marianne von der Leyen. Also standing here is the old schoolhouse from 1825, which today houses a kindergarten and the municipal centre. The great limetree standing before the belltower was planted in 1849 as a “Freedom Tree” in the wake of the Revolutions of 1848. Steinbach once had a synagogue from 1725 that likewise stood in this village centre. In 2000, the municipality built the Jewish Museum in this area. The Jewish graveyard from 1825 lies outside the village on the mountain slope towards Henschtal. The general building pattern in the village is characterized by farmhouses, mostly for small holdings. In the village's west lies the now closed Frutzweiler graveyard. The older Steinbach graveyard with its warriors’ memorial lies on Bundesstraße 423. A new graveyard west of the village at the Jungenwald (forest) was opened in 1970 for both villages. At the way out of the village to the south going towards Börsborn is the Catholic church, which was converted in 1936 from what had been a mine hoist house. History While the two former municipalities may have had many commonalities, their territorial histories on the other hand went two quite different ways. Both centres can look back on a more than 650-year-long history. Indeed, the first documentary mention came in 1355. The village's foremost landmark is the belltower mentioned above. Antiquity As far back as prehistoric times there were people in the area that is now Steinbach am Glan, as clearly witnessed by archaeological finds made within municipal limits. As early as the 19th century, stone axes were being found, which have now all gone missing. Also dating from the Stone Age is a barrow in what was once Frutzweiler's municipal area. A row of six untouched barrows from the late Hallstatt culture stretches along the ridge of the Steinberg as far as the municipal limit with Henschtal. Three further barrows stand on the Schnepfenrech in the south of the municipal area, of which one lies within Börsborn's limits. It is unknown to what epoch these barrows belong. The area was also inhabited in Gallo-Roman times. In 1904, a grave within Steinbach's limits was opened, bringing to light grave goods such as four clay vessels containing ashes, four rings and two needles. These finds might have been from Gallo-Roman times. A stone lion found within Steinbach's limits is now kept at the Historisches Museum der Pfalz (Historic Museum of the Palatinate) in Speyer. From the Altenwald (forest) once led a Roman road over to somewhere near Wahnwegen; it supposedly had a breadth of six metres. Middle Ages Because the Steinbach and the Henschbach formed the border between the Remigiusland and the Hornbach Monastery's holdings in the Münchweiler valley, Steinbach's and Frutzweiler's paths through history were utterly unalike. From the Imperial Domain (Reichsland) around Castle Lautern, kings split certain parcels off to donate them to various ecclesiastical and secular lordships. Great parts passed into Salian hands. Count Werner I of this dynasty endowed the Hornbach Monastery in 737, whose first abbot was Saint Pirmin. The Count bestowed a great many estates and landholds upon the monastery, including the Münchweiler valley, where Steinbach lay. As a fief from the Hornbach Monastery with its centre at Glan-Münchweiler, all this area's villages passed first in 1323 to the Raugraves in the Nahegau, and thereafter, in 1344, to the Archbishop of Trier and the Breidenborns in 1388. In connection with the Münchweiler valley, the village of Steinbach and the now vanished village of Frensweiler were both mentioned repeatedly, although the latter was mentioned earlier. A man named Conradus de Vrodenswilre was mentioned as far back as 1313 in the family Mauchenheim's cartulary, while a village named Frinßwiller was named in 1419 in the family Breidenborn's cartulary. In the Weistum from 1456, a one Clais von Frynswillr crops up as a witness, and in a further 1461 Weistum from Glan-Münchweiler, someone who is likely the same man crops up again as Claz von Frinßwiller (a Weistum – cognate with English wisdom – was a legal pronouncement issued by men learned in law in the Middle Ages and early modern times). The Lords of Frenzweiler may have been considered lower nobility in their own time. In 1355, Steinbach had its first documentary mention in a border description of the Remigiusland; it was mentioned again in the 1419 document mentioned above, and then again in a 1541 Weistum (also a border description). The modern spelling was used, although much of the text used spellings that would now be considered archaic; the spelling used for Frensweiler, on the other hand, was Frntzweiler. Through Georg I von der Leyen's marriage to Eva von Mauchenheim in 1456, the House of Leyen came into possession of the Bliesgau and also, by hereditary accession in 1486, of a share in the Blieskastel castle. At the same time, Abbot Ulrich of the Hornbach Monastery granted Jörge von der Leyen, a Burgmann of Castle Lautern, the Münchweiler valley. The Lords of Leyen had their roots in the lower Moselle area, and by the High Middle Ages, they already resided at their castle near Gondorf on the Moselle. They were mostly in the service of the Archbishop of Trier, and Johann von der Leyen-Saffig was even chosen to fill that office in 1556. Alongside the Leyens, their kin, the Mauchenheims took turns being enfeoffed with parts of the monastery's holdings in the Münchweiler valley, but as of 1533, only the Barons – later Counts – of Leyen were fiefholders there. While Steinbach and Frensweiler eventually lay within the landholds granted the Leyens by the monastery, Frutzweiler lay in the Remigiusland, which was held by the Abbey of Saint-Remi in Reims, and which was also given in 1112 to the Counts of Veldenz as a Vogtei. This put the village in the County of Veldenz. Frutzweiler coincidentally had its first documentary mention in the same 1355 border description as Steinbach (see above), and was mentioned again in a 1387 document from the Counts of Sponheim. A man named Baldewin von Frutzweiler stood in the late 15th century as the Burgmann at Lichtenberg Castle. According to a 1391 document, Count Friedrich III of Veldenz enfeoffed this Baldewin with a rental income of 8 pounds in Lichtenberg currency. In 1397, Baldewin still appeared among the Burgmannen at Lichtenberg Castle. In 1402, Count Friedrich confirmed for him that this rental income could be bequeathed to his offspring. Baldewin had two sons, who were likewise mentioned in documents in the years still to come. One was named Tilman and the other Baldwin after his father. Tilman, too, was in the castle's service as a Junker. In 1414, he confirmed that he was entitled to the same rental income of eight Gulden as his now late father. The younger Baldwin, Tilman's brother, now appeared in the record under the name Baldewin von Zweibrücken. He, too, lived as a Junker at Lichtenberg Castle, and according to a 1441 document, received a rental income of 8 pounds in Heller. This younger Baldewin was married to Jutta von Wadenau, whom he granted his Lichtenberg Castle fief in 1441, a deed confirmed by Count Friedrich III. In 1444, the County of Veldenz met its end when Count Friedrich III of Veldenz died without a male heir. His daughter Anna wed King Ruprecht's son Count Palatine Stephan. By uniting his own Palatine holdings with the now otherwise heirless County of Veldenz – his wife had inherited the county, but not her father's title – and by redeeming the hitherto pledged County of Zweibrücken, Stephan founded a new County Palatine, as whose comital residence he chose the town of Zweibrücken: the County Palatine – later Duchy – of Palatinate-Zweibrücken. From 1444 on, Frutzweiler thus lay in this state. Modern times Until the French Revolution, the local lordly relations did not change very much. Steinbach lay in the Leyens’ Münchweiler valley while Trahweiler lay in the Duchy of Palatinate-Zweibrücken. As a matter of principle, there were good ties between Zweibrücken and the Counts of Leyen. According to a church Visitation protocol, there were 48 people living in Frutzweiler in 1609: 10 men, 11 women, 26 children and one manservant. Frutzweiler then already belonged to the parish of Quirnbach. Corresponding figures for Steinbach from that time are unavailable. Both villages were heavily stricken by the events of the Thirty Years' War and the Plague. Only a few survived the war. Repopulation followed. A few years after the Thirty Years' War, the Leyens began to expand their holdings to the rivers Blies, Saar and Glan. The villages of the Münchweiler valley within this widely scattered landhold were grouped together as an Unteramt of the whole lordship. Only in 1773 did the comital couple of Franz Karl von der Leyen and Marianne née Dalberg move the residence from Koblenz to Blieskastel. After Count Franz Karl's death in 1775, his wife Marianne assumed the regency for their young son Philipp. When Blieskastel was occupied by French Revolutionary troops, the Countess managed to flee and, with some support, get herself first to Koblenz and later to Frankfurt. Under Napoleon’s rule, the Leyens were allowed to have their personal holdings back. Both villages, Steinbach and Frutzweiler, at the time of French rule after 1801 belonged to the Department of Sarre, whose capital was at Trier. Steinbach belonged to the Canton of Waldmohr, the Arrondissement of Saarbrücken and the Mairie (“Mayoralty”) of Glan-Münchweiler, while Frutzweiler belonged to the Canton of Kusel, the Arrondissement of Birkenfeld and the Mairie of Quirnbach. Recent times In 1814, the French were driven out from the Rhine's left bank. After a transitional period, the Bavarian Rheinkreis – an exclave of the Kingdom of Bavaria – was founded in 1816. This was later called the Rheinpfalz (“Rhenish Palatinate”). The administrative entities that had come into being during French Revolutionary and later Napoleonic times had to be reorganized. While Frutzweiler remained in the Bürgermeisterei (“Mayoralty”) of Quirnbach and in the Landkommissariat of Kusel, Steinbach now belonged to the Bürgermeisterei of Glan-Münchweiler in the Canton of Waldmohr in the Landkommissariat of Homburg. The homestead of Neumühle in Steinbach's west, originally part of the municipality, was merged with Brücken. A Steinbach inhabitant, Isidor Triefus, brought the craft of diamond cutting to the Western Palatinate in 1888, thereby laying the groundwork for the region's economic upswing in the earlier half of the 20th century. When Homburg was grouped into the autonomous Saar area after the First World War, the Canton of Waldmohr remained with the newly formed Free State of Bavaria – the Kaiser had been overthrown and so had the Bavarian king – and thereby with Weimar Germany. The canton belonged to the Bezirksamt of Kusel with an administrative branch of its own, which it retained until 1940, whereafter the Canton of Waldmohr was administered directly from Kusel. Thus, Steinbach belonged to the Kusel district, but remained part of the Bürgermeisterei of Glan-Münchweiler. On 31 July 1934, the last horse-drawn postal coach in the Palatinate made its last trip, between Glan-Münchweiler and Steinbach. In the late 1920s and early 1930s, the Nazi Party (NSDAP) became quite popular in Steinbach am Glan. In the 1928 Reichstag elections, 1.3% of the local votes went to Adolf Hitler’s party, but by the 1930 Reichstag elections, this had grown to 4.2%. By the time of the 1933 Reichstag elections, after Hitler had already seized power, local support for the Nazis had swollen to 44.3%. Hitler's success in these elections paved the way for his Enabling Act of 1933 (Ermächtigungsgesetz), thus starting the Third Reich in earnest. The last colliery in Rhineland-Palatinate was in Steinbach am Glan; it was closed in 1959. In the course of administrative restructuring in Rhineland-Palatinate, Glan-Münchweiler became the seat of a Verbandsgemeinde in 1972 into which both the municipality's current centres were grouped. Steinbach am Glan had already been newly formed on 7 June 1969 from the municipal areas of Frutzweiler and Steinbach as part of this administrative restructuring. In 2005, a new building area was opened. Jewish history An almost 300-year-old Jewish history permeates the municipality. As early as 1725, the first synagogue in a country municipality was built here. Steinbach was the hub of Jewish life in the south of what is now the Kusel district; in 1848, out of 217 inhabitants in the village, more than one third were Jewish. There is now a small Jewish Museum in Steinbach. Population development As can still be recognized today in the construction technique of the older parts of both Steinbach am Glan's centres, a great number of the villagers in the 19th century made their living from agriculture. There were also, however, many who worked the coal pits in Steinbach and other mines farther afield. In the earlier half of the 20th century, many diamond cutters lived in both villages. Considerable, too, was the Jewish share of the population, many of whom were in trade and crafts, including the diamond cutting. The number of Jewish families shrank in the latter half of the 19th century as many Jews emigrated to the United States. By 1933, only 35 Jews lived in the village, and under the pressure of Adolf Hitler’s Nazi régime, emigration accelerated. Four Jewish residents who had remained were deported to the Gurs internment camp in the south of France in 1940, whence they were later transported to Auschwitz; they did not survive the Holocaust. A sharp rise in the population figures can be noted between 1800 and the middle of the 19th century, with the population doubling. At the turn of the 20th century, there was a drop in population as people emigrated or moved on. The figures, though, began to rise again, even before the First World War, and further rises can be noted down to the present day. Frutzweiler, too, saw particularly strong population growth in the early 19th century. About 1835, the population peaked, only to fall off steadily for many years afterward, rising again only after the Second World War. The Jewish share of the population was not as high in Frutzweiler as it was in Steinbach. Nowadays, no Jews live in either centre anymore. In the course of the 20th century, ever fewer villagers earned their livelihood at agriculture, until now, this endeavour plays only a very minor role in the municipality’s economy. Today’s municipality of Steinbach am Glan is mainly a residential community for commuters. The following tables show population development over the centuries for Steinbach am Glan, with some population counts giving a breakdown by religious affiliation. Steinbach and Frutzweiler are treated separately here up to 1971, whereafter the Steinbach table shows the figures for the now amalgamated municipality: Steinbach Frutzweiler More than 120 United States citizens live in Steinbach am Glan. Municipality’s names The placename ending —bach groups Steinbach into the series of names of countless other places with the same ending that arose on brooks – Bach still means “brook” in German – in the course of the Frankish taking of the land. The other part of the name, Stein—, meaning “stone”, is a reference to stone or pebbles, perhaps those found on the brook bed. The name's pronunciation, going by its appearance in documents, has not changed since 1355. The placename ending —weiler bears witness to Frutzweiler's beginnings as a very small settlement (Weiler is the word for “hamlet” in modern-day German, although it originally meant “homestead”), and the other part of the name, Frutz—, likely means that it was founded by a man named Fruodi. Other forms of the name that have appeared in writing over the ages are: Frutzwilr (1378 and 1391), Frutßwilr (1397), Fritzwilre (1401), Frutschwilr (1402) and Frudeßwilre (1411). Vanished villages A village named Frensweiler (also known in the local speech as Fröschweiler), sometimes confused with Frutzweiler, lay within Steinbach am Glan's limits near the forks of the Hodenbach and Steinbach. It had its first documentary mention in 1313 as Vrodenswilre, later being named in further documents: Flinßwilr (1419), Frinswiller (1461) and Frentzwiler (1477). The last example cropped up in Lichtenberg Castle's revenue register, thus bearing witness to the village's still being inhabited at that time. The same was not so by 1541. A Grenzscheidweistum (a Weistum that describes a border's alignment) explicitly describes the village as a Wüstung, the German word for “abandoned village”. Hence, it is clear that the village was forsaken by its villagers sometime between 1477 and 1541. Frenzweiler had the same —weiler ending as Frutzweiler, and the other part of the name, Frenz—, derives from the Frankish personal name Frudin. Frenzweiler was thus originally “Frudin’s hamlet”. According to local lore, there were once two other villages in the west of the municipal area, named Steinbrück and Schnepfental. These two names, however, do not show up in any old documents, although there is still a rural cadastral name, Schnepfenrech. Religion Steinbach belonged from the Early Middle Ages to the Glan-Münchweiler church, which was consecrated by Saint Pirmin and ministered to all churches in the Münchweiler valley. In the time of the Reformation, Steinbach, along with all the dwellers of the Münchweiler valley, had to adopt on the lord's orders Lutheran beliefs, leaning as the Leyens did mainly towards Palatinate-Zweibrücken's views when it came to religion, at least at first. In 1588, though, when Palatinate-Zweibrücken, then headed by Duke Johannes I, commanded all its subjects to convert to Calvinism, the Counts of Leyen resisted this order within their lordly domain. The valley's Christians kept their Lutheran faith, but were subject to an ecclesiastical administration that was directed from Zweibrücken. After the Thirty Years' War, the law conferred religious freedom, and indeed, among the newcomers to Steinbach, particularly at the time of King Louis XIV's War of the Reunions, were a great many Catholics. At the turn of the 19th century, one third of the Christian population was Catholic, a share that is still similar today. Today's Protestant villagers belong to the Quirnbach church within the Evangelical deaconry of Kusel, while the Catholics belong to the Glan-Münchweiler church within the Catholic deaconry of Kusel. The same is true for Frutzweiler. As a village within the Remigiusland, Frutzweiler belonged from the Early Middle Ages to the Kusel church, but later to the Quirnbach church. In the time of the Reformation, people here had to convert to Lutheranism as well, but unlike people in Steinbach, they obeyed the order from Duke Johannes to convert to Calvinism. Only after the Thirty Years' War did the Duchy of Palatinate-Zweibrücken have to tolerate other faiths. The Swedish kings promoted Lutheranism while the French tried to restore Catholicism to the land. By the turn of the 19th century, almost half Frutzweiler's population was Catholic. By the 20th century, the figures had once again swung the Protestants’ way, and they are to this day about two thirds of the population. After Count Casper von der Leyen allowed Jakob Levi, a Jew, to settle in Steinbach in 1728, a considerable Jewish community grew bit by bit in the village, which laid out its own graveyard and built a synagogue, not only for themselves but for worshippers from the surrounding area, too. It is not known in exactly what year the synagogue was built, but the Jewish Museum's information says that it was 1725. In 1825, Jews made up 29% of Steinbach's population; in Frutzweiler it was 6%. Before 1933, there were no tensions between Jews and Christians, but then came Adolf Hitler and the Nazis. On Kristallnacht (9–10 November 1938), SA thugs came to the village, destroyed the synagogue in Steinbach, ravaged several Jewish houses and devastated the Jewish graveyard. Politics Municipal council The council is made up of 12 council members, who were elected by majority vote at the municipal election held on 7 June 2009, and the honorary mayor as chairman. Mayor Steinbach am Glan's mayor is Jörg Fehrentz (SPD). Coat of arms The municipality's arms might be described thus: Per pale argent on ground a limetree, both vert, and azure a belltower gules with pedestal, roof and quoins Or, on a chief party per pale azure a diamond proper and Or a hammer and pick per saltire sable. The four charges in the arms refer to the municipality's particularities. The diamond on the dexter (armsbearer's right, viewer's left) side of the chief stands for the history of diamond processing in the municipality while the hammer and pick on the sinister (armsbearer's left, viewer's right) side of the chief refer to Steinbach am Glan's history as a coalmining centre. The other two charges below these are municipal landmarks, the great limetree and the belltower before which it stands, endowed by Countess Marianne von der Leyen in 1788. The tower is held to be Steinbach am Glan's foremost landmark. At the time when the two villages were separate, Frutzweiler bore no arms. The arms have been borne since 1986 when they were approved by the now defunct Rheinhessen-Pfalz Regierungsbezirk administration in Neustadt an der Weinstraße. Culture and sightseeing Buildings The following are listed buildings or sites in Rhineland-Palatinate’s Directory of Cultural Monuments: Börsborner Straße 1 – Quereinhaus (a combination residential and commercial house divided for these two purposes down the middle, perpendicularly to the street), 1856; characterizes village’s appearance Lindenstraße 75 – belltower; three-floor plastered building on stone-block pedestal, eight-sided spire, 1788; bell, about 1400, ascribed to Otto von Speyer (see picture at head of article) Jewish graveyard (monumental zone) – 1824-1938; area ringed by quarrystone wall with 232 gravestones Natural monuments Standing before Countess Marianne von der Leyen’s belltower is a great limetree. Sport and leisure The Friends of Nature house Am Haselrech on the heights between Steinbach and Börsborn is a popular hiking destination. Beginning there are three Nordic walking trails of various difficulty levels belonging to the Haselrech Nature Fitness Park, which was laid out by the Kusel district in 2006. There is a farm lane leading to the Hodenbachtal local recreation and leisure area. On the way out of the village going towards Börsborn is a hydrotherapeutic wading basin based on Father Sebastian Kneipp’s model. Regular events Steinbach am Glan holds the following yearly events: Kirchweih – kermis (church consecration festival), celebrated by both centres on the last weekend in July Dorffest – village festival (every second year) Weihnachtsmarkt – Christmas Market Clubs The following clubs are active in Steinbach am Glan: E. L. C. (Eisenbahn-Landschaft-Club) – model railways Feuerwehrverein – fire brigade association Gymnastikverein – gymnastics Landfrauenverein – Countrywomen’s Club Motorrad Club MC – Motorsport Club Naturfreunde – Nature Club Obst- und Gartenbauverein – fruitgrowing and gardening Pensionärsverein – Pensioners’ Club Sportverein TUS – Sport club Verein evangelischer Frauen – Association of Evangelical Women Verein katholischer Frauen – Association of Catholic Women Volkschor Steinbach-Frutzweiler (founded in 1867 as Männerchor Steinbach-Frutzweiler, a men's singing club) – “People’s Choir”, and municipality's oldest club Museums Steinbach am Glan houses a museum devoted to the former Jewish presence in the municipality. Economy and infrastructure Economic structure Even in an economic sense, Steinbach forms together with Frutzweiler a unit today. Already by the 18th century, agriculture could no longer claim to be the only, nor even the most important, income earner in the municipality, for it was then that in Steinbach, as in so many nearby places, too, that exploitation of the underlying coal seams began. These are part of the Breitenbacher Flöz (Flöz means “seam” or “lode”). Several collieries sprang up in the municipal area. Perhaps the best known was the Maria pit in the east. During the time of French rule after 1800, Theobald Roth ran the Steinbach pits. He paid a fee of 54.89 francs on the collieries’ yield each year. In the course of the 19th century, coalmining in Steinbach was eventually shut down, for it could not compete with the more productive pits in the nearby Saar. Steinbach collieries, however, did undergo a revival in Weimar times because the Saar had been politically and economically separated from Germany by the Treaty of Versailles. This revival, though, ended with the onset of the Second World War. In the late 19th century, diamond processing (cutting and polishing) grew into a particularly important branch of industry, which can be traced back mainly to a Steinbach native, Isidor Trifuß. This industry rooted itself not only in Steinbach, but also in several neighbouring villages as well. After Trifuß had founded a diamond-cutting workshop at the Neumühle (“New Mill”) between Brücken and Ohmbach in 1888, by and by competing businesses sprang up in Brücken itself, and in neighbouring villages. The first in Steinbach opened in 1912. Later the village had 12 diamond-cutting workshops with roughly 80 employees. Just after the Second World War, there were even as many as 100 employees in this field. Beginning about 1960, though, the industry found itself on a downswing due to, more than anything else, competition from countries with lower wages, but also to some extent to the international diamond trade's requirements. In 1960, there were still seven diamond-cutting businesses in Steinbach, but by 1970, only four. Since then, all have closed. The groundwork for tourism has been laid and will be expanded in the future. Steinbach today is otherwise above all a residential centre for families whose breadwinners must commute elsewhere. Education It is certain that in the time before the French Revolution, there was hardly any commonality in schooling between the then two separate villages of Steinbach and Frutzweiler. Quite likely, neither village had its own schoolhouse, and classes were taught at private houses, with the school in Frutzweiler being a Catholic one also attended by children from villages that lay rather far away. In the Kingdom of Bavaria, the authorities strove from the beginning to bring unity to schooling for both villages, even though the two schools stood in two different Landkommissariate (districts). In 1825, a schoolhouse with two classrooms was opened for the Christian schoolchildren. In 1838, the Jewish schoolhouse opened, even if it was a bit cramped. In 1842, the Jewish school was moved to a new building in which a mikveh had been built. In 1857, a Catholic schoolhouse was built. The Jewish school was dissolved during the First World War. In 1928, both villages decided to build a common schoolhouse, although at first Frutzweiler village councillors refused to pay the share that was demanded of them. A new school came into being in 1932 in Steinbach for both the Christian denominations and for the Jews. The municipality sold the old schoolhouses off in 1938. Transport Running through Steinbach is Bundesstraße 423, leading to Altenglan, Glan-Münchweiler, Homburg and the French border. A Landesstraße branches off and leads to neighbouring Börsborn. To the northeast lies the Autobahn A 62 (Kaiserslautern–Trier). The nearest interchange is at Glan-Münchweiler, some 7 km away. Serving Glan-Münchweiler, some 6 km away, is Glan-Münchweiler station on the Landstuhl–Kusel railway. There are hourly trains at this station throughout the day, namely Regionalbahn service RB 67 between Kaiserslautern and Kusel, named Glantalbahn after a former railway line that shared a stretch of its tracks with the Landstuhl–Kusel railway, including the former junction at Glan-Münchweiler. Famous people Sons and daughters of the town Isidor Trifuß (b. 1840 in Steinbach; d. 1919 in Kaiserslautern) Trifuß opened a diamond-cutting shop at the Neumühle (“New Mill”) near Brücken in 1888, thus founding the West Palatine tradition of diamond cutting. References External links Municipality’s official webpage Steinbach am Glan Jewish Museum Municipalities in Rhineland-Palatinate Kusel (district) Holocaust locations in Germany
Ham-Mihan () was a reformist daily newspaper in Tehran, Iran. It was in circulation between 2000 and 2009. History and profile In January 2000 Gholamhossein Karbaschi, former mayor of Tehran, established Ham Mihan after he was released from prison. He also ran the paper and was its managing editor. The chief editor of Ham-Mihan was Mohammad Ghouchani. Mohammad Atrianfar served as the policy director of the paper which was based in Tehran. The paper backed Akbar Hashemi Rafsanjani in the presidential elections held in 2005. It was temporarily closed in May 2000 and in July 2007 by a court in Tehran. The paper was relaunched in 2009, but was suspended in July 2009. In September 2013, Karbaschi petitioned the Ministry of Culture and Islamic Guidance to lift the ban on publication and his request was accepted. However, the publication license was not granted. See also List of newspapers in Iran References 2000 establishments in Iran 2009 disestablishments in Iran Censorship in Iran Defunct newspapers published in Iran Newspapers published in Tehran Persian-language newspapers Newspapers established in 2000 Publications disestablished in 2009
Beilschmiedia berteroana (southern acorn tree, belloto del sur in Spanish) is a threatened evergreen tree in the family Lauraceae native to Chile at 35 to 37°S. Description It can measure 30 m in height and one metre in diameter. The trunk is straight and branched, and the bark is gray with longitudinal fissures. Leaves are opposite and subopposite, elliptical to aovate-elliptical, and they have entire margins; they are glossy green above and glaucous below. The apex is rounded or slightly emarginated and the base is lightly wedge-shaped. The leaves are about 3–7.5 cm long and 2–4 cm wide, with pubescent petioles 2–5 mm long. The hermaphrodite flowers are arranged in inflorescences about 5–6 cm long. The pedicellate flowers are 4–6 mm and greenish-yellow in color. The edible fruit is a green, globose drupe with a single seed, 1.5–2 cm in diameter, with a point at the apex. Ecology It grows at altitudes up to 1800 m above sea level, and it has an acceptable frost tolerance within this mostly tropical genus. A specific example of occurrence is in the La Campana National Park of central Chile and amid the adjoining Cerro La Campana; in that location it is associated with the endangered Chilean wine palm, a tree with a much wider prehistoric distribution than at present. Uses and cultivation Edible fruit, with a sweet taste; of local consumption, with fruit potential. The bark of B. berteroana is useful for tanning leather. It is often used as an ornamental tree in Chile. It blooms between July and August (Southern Hemisphere). The flowers are used by introduced European bees for producing a very delicious honey. The wood is very beautiful and hard. Can grow up to USDA zone 9b. The tree has been planted and acclimatized in Spain, but is rarely seen there. See also Gomortega keule Cryptocarya alba Peumus boldus References P. Hechenleitner, M. Gardner, P. Thomas, C. Echeverría, B. Escobar, P. Brownless y C. Martínez. 2005. Plantas Amenazadas del Centro-Sur de Chile. Distribución, Conservación y Propagación. Primera Edición. Universidad Austral de Chile y Real Jardín Botánico de Edimburgo, Valdivia. 188p. C. Michael Hogan (2008) Chilean Wine Palm: Jubaea chilensis, GlobalTwitcher.com, ed. N. Stromberg R. Rodríguez, y M. Quezada. 2001. Laurales. En C. Marticorena y R. Rodríguez [eds.], Flora de Chile Vol. 2, pp 10–19. Universidad de Concepción, Concepción. Line notes External links Beilschmiedia berteroana in Enciclopedia de la Flora Chilena Trees of Chile berteroana Trees of Mediterranean climate Ornamental trees Flora of the Chilean Matorral Fruits originating in South America
```c++ // This is an open source non-commercial project. Dear PVS-Studio, please check it. // PVS-Studio Static Code Analyzer for C, C++ and C#: path_to_url #include "Version.h" #include "CxbxVersion.h" #include <string> /*! version string dependent on trace flag */ #ifndef _DEBUG_TRACE const char* CxbxVersionStr = _GIT_VERSION " (" __DATE__ ")"; const char *CxbxrHashBuild = _GIT_VERSION; #else const char* CxbxVersionStr = _GIT_VERSION "-Trace (" __DATE__ ")"; const char *CxbxrHashBuild = _GIT_VERSION "-Trace"; #endif static constexpr const char *GitVersionStr = _GIT_VERSION; static constexpr size_t GitVersionLength = std::char_traits<char>::length(GitVersionStr); static_assert(GitVersionLength < GitVersionMaxLength); const char *const GetGitVersionStr() { return GitVersionStr; } const size_t GetGitVersionLength() { return GitVersionLength; } ```
```objective-c //==- CanonicalizeFreezeInLoop.h - Canonicalize freezes in a loop-*- C++ -*-==// // // See path_to_url for license information. // //===your_sha256_hash------===// // // This file canonicalizes freeze instructions in a loop. // //===your_sha256_hash------===// #ifndef LLVM_TRANSFORMS_UTILS_CANONICALIZEFREEZEINLOOPS_H #define LLVM_TRANSFORMS_UTILS_CANONICALIZEFREEZEINLOOPS_H #include "llvm/Analysis/LoopAnalysisManager.h" #include "llvm/IR/PassManager.h" namespace llvm { class Loop; class LPMUpdater; /// A pass that canonicalizes freeze instructions in a loop. class CanonicalizeFreezeInLoopsPass : public PassInfoMixin<CanonicalizeFreezeInLoopsPass> { public: PreservedAnalyses run(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &U); }; } // end namespace llvm #endif // LLVM_TRANSFORMS_UTILS_CANONICALIZEFREEZEINLOOPS_H ```
```objective-c // -*- C++ -*- forwarding header. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // Free Software Foundation; either version 2, or (at your option) // any later version. // 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 // with this library; see the file COPYING. If not, write to the Free // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, // USA. // As a special exception, you may use this file as part of a free software // library without restriction. Specifically, if other files instantiate // templates or use macros or inline functions from this file, or you compile // this file and link it with other files to produce an executable, this // file does not by itself cause the resulting executable to be covered by // invalidate any other reasons why the executable file might be covered by // // ISO C++ 14882: 18.2.2 Implementation properties: C library // #ifndef _GLIBCXX_CLOCALE #define _GLIBCXX_CLOCALE 1 #pragma GCC system_header #include_next <locale.h> #endif ```
Deh-e Mir Qasem (, also Romanized as Deh-e Mīr Qāsem; also known as Mīr Qāsem) is a village in Hendudur Rural District, Sarband District, Shazand County, Markazi Province, Iran. At the 2006 census, its population was 81, in 19 families. References Populated places in Shazand County
Tang-e Sheykh (; also known as Chamrān and Chamrānābād) is a village in Howmeh Rural District, in the Central District of Behbahan County, Khuzestan Province, Iran. At the 2006 census, its population was 157, in 28 families. References Populated places in Behbahan County
```objective-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. */ #ifndef STDLIB_BLAS_BASE_SHARED_MACROS_H #define STDLIB_BLAS_BASE_SHARED_MACROS_H /* * If C++, prevent name mangling so that the compiler emits a binary file having undecorated names, thus mirroring the behavior of a C compiler. */ #ifdef __cplusplus extern "C" { #endif /** * Macro for converting a stride to an index offset. * * @param N number of indexed elements * @param stride index increment * * @example * #include <stdint.h> * * int64_t offset = STDLIB_BLAS_BASE_STRIDE2OFFSET( 10, -10 ); * // returns 90 */ #define STDLIB_BLAS_BASE_STRIDE2OFFSET( N, stride ) ( ( (stride) > 0 ) ? 0 : ( 1-(N) ) * (stride) ) #ifdef __cplusplus } #endif #endif // !STDLIB_BLAS_BASE_SHARED_MACROS_H ```
```php <?php /** * Tailor Tabs element class. * * @package Tailor * @subpackage Elements * @since 1.0.0 */ defined( 'ABSPATH' ) or die(); if ( class_exists( 'Tailor_Element' ) && ! class_exists( 'Tailor_Tabs_Element' ) ) { /** * Tailor Tabs element class. * * @since 1.0.0 */ class Tailor_Tabs_Element extends Tailor_Element { /** * Registers element settings, sections and controls. * * @since 1.0.0 * @access protected */ protected function register_controls() { $this->add_section( 'general', array( 'title' => __( 'General', 'tailor' ), 'priority' => 10, ) ); $this->add_section( 'colors', array( 'title' => __( 'Colors', 'tailor' ), 'priority' => 20, ) ); $this->add_section( 'attributes', array( 'title' => __( 'Attributes', 'tailor' ), 'priority' => 30, ) ); $priority = 0; $this->add_setting( 'position', array( 'sanitize_callback' => 'tailor_sanitize_text', 'default' => 'top', ) ); $this->add_control( 'position', array( 'label' => __( 'Tabs position', 'tailor' ), 'type' => 'select', 'choices' => array( 'top' => __( 'Top', 'tailor' ), 'left' => __( 'Left', 'tailor' ), 'right' => __( 'Right', 'tailor' ), ), 'priority' => $priority += 10, 'section' => 'general', ) ); $general_control_types = array(); $general_control_arguments = array(); tailor_control_presets( $this, $general_control_types, $general_control_arguments, $priority ); $priority = 0; $color_control_types = array( 'color', 'link_color', 'link_color_hover', 'heading_color', 'background_color', 'border_color', ); $color_control_arguments = array(); $priority = tailor_control_presets( $this, $color_control_types, $color_control_arguments, $priority ); $priority = 0; $attribute_control_types = array( 'class', 'padding', 'padding_tablet', 'padding_mobile', 'margin', 'margin_tablet', 'margin_mobile', 'border_style', 'border_width', 'border_width_tablet', 'border_width_mobile', 'shadow', 'background_image', 'background_repeat', 'background_position', 'background_size', 'background_attachment', ); $attribute_control_arguments = array( 'border_style' => array( 'control' => array( 'choices' => array( '' => __( 'Default', 'tailor' ), 'solid' => __( 'Solid', 'tailor' ), 'dashed' => __( 'Dashed', 'tailor' ), 'dotted' => __( 'Dotted', 'tailor' ), 'none' => __( 'None', 'tailor' ), ), ), ), 'border_width' => array( 'setting' => array( 'refresh' => '', ), 'control' => array( 'type' => 'text', ), ), 'border_width_tablet' => array( 'setting' => array( 'refresh' => '', ), ), 'border_width_mobile' => array( 'setting' => array( 'refresh' => '', ), ), ); tailor_control_presets( $this, $attribute_control_types, $attribute_control_arguments, $priority ); } /** * Returns custom CSS rules for the element. * * @since 1.0.0 * * @param $atts * @return array */ public function generate_css( $atts = array() ) { $css_rules = array(); $excluded_control_types = array( 'border_style', 'border_width', 'border_radius', 'shadow', ); $css_rules = tailor_css_presets( $css_rules, $atts, $excluded_control_types ); if ( ! empty( $atts['border_style'] ) ) { $css_rules[] = array( 'selectors' => array( '.tailor-tabs__navigation-item', '.tailor-tab' ), 'declarations' => array( 'border-style' => esc_attr( $atts['border_style'] ), ), ); if ( ! empty( $atts['position'] ) ) { switch ( $atts['position'] ) { case 'top': $css_rules[] = array( 'media' => 'tablet-up', 'selectors' => array( '.tailor-tabs__navigation-item' ), 'declarations' => array( 'border-bottom' => 'none', ), ); break; case 'left': $css_rules[] = array( 'media' => 'tablet-up', 'selectors' => array( '.tailor-tabs__navigation-item' ), 'declarations' => array( 'border-right' => 'none', ), ); break; case 'right': $css_rules[] = array( 'media' => 'tablet-up', 'selectors' => array( '.tailor-tabs__navigation-item' ), 'declarations' => array( 'border-left' => 'none', ), ); break; } } if ( 'none' !== $atts['border_style'] ) { if ( ! empty( $atts['border_width'] ) ) { $css_rules[] = array( 'selectors' => array( '.tailor-tabs__navigation-item', '.tailor-tab' ), 'declarations' => array( 'border-width' => esc_attr( $atts['border_width'] ), ), ); $css_rules[] = array( 'media' => 'tablet-up', 'selectors' => array( '&.tailor-tabs--top .tailor-tabs__navigation-item:not( :last-child )' ), 'declarations' => array( 'margin-right' => esc_attr( '-' . $atts['border_width'] ), ), ); $css_rules[] = array( 'selectors' => array( '&.tailor-tabs--top .tailor-tab' ), 'declarations' => array( 'margin-top' => esc_attr( '-' . $atts['border_width'] ), ), ); $css_rules[] = array( 'selectors' => array( '&.tailor-tabs--left .tailor-tabs__navigation' ), 'declarations' => array( 'margin-right' => esc_attr( '-' . $atts['border_width'] ), ), ); $css_rules[] = array( 'media' => 'tablet-up', 'selectors' => array( '&.tailor-tabs--right .tailor-tabs__navigation' ), 'declarations' => array( 'margin-left' => esc_attr( '-' . $atts['border_width'] ), ), ); $css_rules[] = array( 'media' => 'tablet-up', 'setting' => 'border_color', 'selectors' => array( '&.tailor-tabs--left .tailor-tabs__navigation-item:not( :first-child )', '&.tailor-tabs--right .tailor-tabs__navigation-item:not( :first-child )' ), 'declarations' => array( 'margin-top' => esc_attr( '-' . $atts['border_width'] ), ), ); } if ( ! empty( $atts['border_color'] ) ) { $css_rules[] = array( 'setting' => 'border_color', 'selectors' => array( '.tailor-tabs__navigation-item', '.tailor-tab' ), 'declarations' => array( 'border-color' => esc_attr( $atts['border_color'] ), ), ); } if ( ! empty( $atts['shadow'] ) ) { $css_rules[] = array( 'setting' => 'shadow', 'selectors' => array( '.tailor-tab' ), 'declarations' => array( 'box-shadow' => '0 2px 6px rgba(0, 0, 0, 0.1)', ), ); } } } return $css_rules; } } } ```
```c++ /*************************************************************************** * * * * * The full license is in the file LICENSE, distributed with this software. * ****************************************************************************/ #include <numeric> #include "xtensor/xstorage.hpp" #include "xtensor/xtensor_config.hpp" #include "test_common_macros.hpp" namespace xt { using vector_type = uvector<double, XTENSOR_DEFAULT_ALLOCATOR(double)>; /*********** * uvector * ***********/ TEST(uvector, constructor) { vector_type a; EXPECT_EQ(size_t(0), a.size()); vector_type b(10); EXPECT_EQ(size_t(10), b.size()); vector_type c(10, 2.5); EXPECT_EQ(size_t(10), c.size()); EXPECT_EQ(2.5, c[2]); std::vector<double> src(10, 1.5); vector_type d(src.cbegin(), src.cend()); EXPECT_EQ(size_t(10), d.size()); EXPECT_EQ(1.5, d[2]); } TEST(uvector, resize) { vector_type a; for (size_t i = 1; i < 11; ++i) { size_t size1 = i * 10; a.resize(size1); EXPECT_EQ(size1, a.size()); size_t size2 = size1 - 5; a.resize(size2); EXPECT_EQ(size2, a.size()); } } TEST(uvector, access) { vector_type a(10); a[0] = 1.0; EXPECT_EQ(1.0, a[0]); a[3] = 3.2; EXPECT_EQ(3.2, a[3]); a[5] = 2.7; EXPECT_EQ(2.7, a[5]); a.front() = 0.0; EXPECT_EQ(0.0, a[0]); a.back() = 1.0; EXPECT_EQ(1.0, a[9]); EXPECT_EQ(a.at(5), 2.7); XT_EXPECT_ANY_THROW(a.at(12)); } TEST(uvector, iterator) { vector_type a(10); std::iota(a.begin(), a.end(), 0.); for (size_t i = 0; i < a.size(); ++i) { EXPECT_EQ(double(i), a[i]); } } /*********** * svector * ***********/ using svector_type = svector<std::size_t, 4>; TEST(svector, behavior) { svector_type s = {1, 2, 3, 4}; svector_type s2 = s; std::vector<std::size_t> v(s.begin(), s.end()); std::vector<std::size_t> v2 = {1, 2, 3, 4}; EXPECT_TRUE(std::equal(s.begin(), s.end(), v.begin())); EXPECT_TRUE(std::equal(s2.begin(), s2.end(), v2.begin())); s.erase(s.begin(), s.begin() + 2); v.erase(v.begin(), v.begin() + 2); EXPECT_TRUE(std::equal(s.begin(), s.end(), v.begin())); s2.erase(s2.begin() + 1, s2.end()); v2.erase(v2.begin() + 1, v2.end()); EXPECT_TRUE(std::equal(s2.begin(), s2.end(), v2.begin())); std::size_t i1 = 50; std::size_t i2 = 50; EXPECT_TRUE(s2.on_stack()); s2.push_back(10); s2.push_back(20); s2.push_back(30); s2.push_back(40); s2.push_back(i1); s2.push_back(std::move(i1)); v2.push_back(10); v2.push_back(20); v2.push_back(30); v2.push_back(40); v2.push_back(i2); v2.push_back(std::move(i2)); EXPECT_FALSE(s2.on_stack()); EXPECT_TRUE(std::equal(s2.begin(), s2.end(), v2.begin())); } TEST(svector, insert) { svector_type s = {1, 2, 3, 4}; svector_type s2 = s; std::vector<std::size_t> v(s.begin(), s.end()); std::vector<std::size_t> v2 = {1, 2, 3, 4}; s.insert(s.begin(), std::size_t(55)); s.insert(s.begin() + 2, std::size_t(123)); v.insert(v.begin(), std::size_t(55)); v.insert(v.begin() + 2, std::size_t(123)); std::size_t nr = 12321; s.insert(s.end(), nr); v.insert(v.end(), nr); EXPECT_TRUE(std::equal(s.begin(), s.end(), v.begin())); } TEST(svector, insert_range) { svector_type s0 = {1, 2, 3, 4}; svector_type s1 = s0; svector_type s2 = s0; std::vector<std::size_t> v0(s0.begin(), s0.end()); std::vector<std::size_t> v1(v0); std::vector<std::size_t> v2(v0); std::vector<std::size_t> ins = {1, 4}; s0.insert(s0.begin(), ins.cbegin(), ins.cend()); v0.insert(v0.begin(), ins.cbegin(), ins.cend()); s1.insert(s1.begin() + 2, ins.cbegin(), ins.cend()); v1.insert(v1.begin() + 2, ins.cbegin(), ins.cend()); s2.insert(s2.begin() + 4, ins.cbegin(), ins.cend()); v2.insert(v2.begin() + 4, ins.cbegin(), ins.cend()); EXPECT_TRUE(std::equal(s0.begin(), s0.end(), v0.begin())); EXPECT_TRUE(std::equal(s1.begin(), s1.end(), v1.begin())); EXPECT_TRUE(std::equal(s2.begin(), s2.end(), v2.begin())); } TEST(svector, insert_initializer_list) { svector_type s0 = {1, 2, 3, 4}; svector_type s1 = s0; svector_type s2 = s0; std::vector<std::size_t> v0(s0.begin(), s0.end()); std::vector<std::size_t> v1(v0); std::vector<std::size_t> v2(v0); s0.insert(s0.begin(), {1u, 4u}); v0.insert(v0.begin(), {1u, 4u}); s1.insert(s1.begin() + 2, {1u, 4u}); v1.insert(v1.begin() + 2, {1u, 4u}); s2.insert(s2.begin() + 4, {1u, 4u}); v2.insert(v2.begin() + 4, {1u, 4u}); EXPECT_TRUE(std::equal(s0.begin(), s0.end(), v0.begin())); EXPECT_TRUE(std::equal(s1.begin(), s1.end(), v1.begin())); EXPECT_TRUE(std::equal(s2.begin(), s2.end(), v2.begin())); } TEST(svector, constructor) { svector_type a; EXPECT_EQ(size_t(0), a.size()); svector_type b(10); EXPECT_EQ(size_t(10), b.size()); svector_type c(10, 2); EXPECT_EQ(size_t(10), c.size()); EXPECT_EQ(size_t(2), c[2]); std::vector<std::size_t> src(10, std::size_t(1)); svector_type d(src.cbegin(), src.cend()); EXPECT_EQ(size_t(10), d.size()); EXPECT_EQ(size_t(1), d[2]); svector_type e(src); EXPECT_EQ(size_t(10), d.size()); EXPECT_EQ(size_t(1), d[2]); svector_type f = {1, 2, 3, 4}; EXPECT_EQ(size_t(4), f.size()); EXPECT_EQ(size_t(3), f[2]); svector<std::size_t, 8> ov = {1, 2, 3, 4, 5, 6, 7, 8}; svector_type g(ov); EXPECT_EQ(size_t(8), g.size()); EXPECT_EQ(size_t(3), g[2]); } TEST(svector, assign) { svector_type a = {1, 2, 3, 4}; svector_type src1(10, 2); a = src1; EXPECT_EQ(size_t(10), a.size()); EXPECT_EQ(size_t(2), a[2]); std::vector<size_t> src2(5, 1); a = src2; EXPECT_EQ(size_t(5), a.size()); EXPECT_EQ(size_t(1), a[2]); a = {1, 2, 3, 4}; EXPECT_EQ(size_t(4), a.size()); EXPECT_EQ(size_t(3), a[2]); svector<std::size_t, 4> src3(10, 1); a = src3; EXPECT_EQ(size_t(10), a.size()); EXPECT_EQ(size_t(1), a[2]); } TEST(svector, resize) { svector_type a; for (size_t i = 1; i < 11; ++i) { size_t size1 = i * 10; a.resize(size1); EXPECT_EQ(size1, a.size()); size_t size2 = size1 - 5; a.resize(size2); EXPECT_EQ(size2, a.size()); } svector_type b = {1, 3, 4}; b.resize(6); EXPECT_EQ(b[0], 1u); EXPECT_EQ(b[1], 3u); EXPECT_EQ(b[2], 4u); } TEST(svector, swap) { using std::swap; { svector_type a = {1, 3, 4, 6, 7}; svector_type b = {}; svector_type abu = a; svector_type bbu = b; swap(a, b); EXPECT_EQ(a, bbu); EXPECT_EQ(b, abu); } { svector_type a = {1, 3, 4}; svector_type b = {2, 1, 5, 3, 9, 12}; svector_type abu = a; svector_type bbu = b; swap(a, b); EXPECT_EQ(a, bbu); EXPECT_EQ(b, abu); } { svector_type a = {10, 13, 14}; svector_type b = {12, 15, 17}; svector_type abu = a; svector_type bbu = b; swap(a, b); EXPECT_EQ(a, bbu); EXPECT_EQ(b, abu); } } TEST(svector, access) { svector_type a(10); a[0] = size_t(1); EXPECT_EQ(size_t(1), a[0]); a[3] = size_t(3); EXPECT_EQ(size_t(3), a[3]); a[5] = size_t(2); EXPECT_EQ(size_t(2), a[5]); a.front() = size_t(0); EXPECT_EQ(size_t(0), a[0]); a.back() = size_t(1); EXPECT_EQ(size_t(1), a[9]); EXPECT_EQ(a.at(5), size_t(2)); XT_EXPECT_ANY_THROW(a.at(12)); } TEST(svector, iterator) { svector_type a(10); std::iota(a.begin(), a.end(), std::size_t(0)); for (size_t i = 0; i < a.size(); ++i) { EXPECT_EQ(i, a[i]); } } TEST(fixed_shape, fixed_shape) { fixed_shape<3, 4, 5> af; using cast_type = typename fixed_shape<3, 4, 5>::cast_type; cast_type a = af; EXPECT_EQ(a[0], size_t(3)); EXPECT_EQ(a[2], size_t(5)); EXPECT_EQ(a.back(), size_t(5)); EXPECT_EQ(a.front(), size_t(3)); EXPECT_EQ(a.size(), size_t(3)); } } ```
```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. */ // Note: keep project includes in alphabetical order... #include <stdlib.h> #include <stdint.h> #include <string.h> #include <math.h> #include "stdlib/random/base/shared.h" /** * Frees a PRNG's allocated memory. * * @param obj PRNG object */ void stdlib_base_prng_free( struct BasePRNGObject *obj ) { if ( obj == NULL ) { return; } obj->prng->free( obj ); } /** * Returns a pseudorandom integer. * * ## Notes * * - The function returns `0` if provided a `NULL` pointer. * * @param obj PRNG object * @return pseudorandom integer */ uint64_t stdlib_base_prng_next( struct BasePRNGObject *obj ) { if ( obj == NULL ) { return 0; } uint64_t v; obj->prng->next( obj, &v ); return v; } /** * Returns a pseudorandom double-precision floating-point number on the interval `[0,1)`. * * ## Notes * * - The function returns `NAN` if provided a `NULL` pointer. * * @param obj PRNG object * @return pseudorandom number */ double stdlib_base_prng_normalized( struct BasePRNGObject *obj ) { if ( obj == NULL ) { return NAN; } double v; obj->prng->normalized( obj, &v ); return v; } /** * Returns a PRNG name. * * @param obj PRNG object * @return PRNG name */ const char * stdlib_base_prng_name( const struct BasePRNGObject *obj ) { return obj->prng->name; } /** * Returns the minimum possible integer value generated by a provided PRNG. * * @param obj PRNG object * @return minimum possible integer value */ uint64_t stdlib_base_prng_min( const struct BasePRNGObject *obj ) { return (uint64_t)( obj->prng->min ); } /** * Returns the maximum possible integer value generated by a provided PRNG. * * @param obj PRNG object * @return maximum possible integer value */ uint64_t stdlib_base_prng_max( const struct BasePRNGObject *obj ) { return (uint64_t)( obj->prng->max ); } /** * Returns the minimum possible double-precision floating-point number generated by a provided PRNG. * * @param obj PRNG object * @return minimum possible double */ double stdlib_base_prng_normalized_min( const struct BasePRNGObject *obj ) { return (double)( obj->prng->normalized_min ); } /** * Returns the maximum possible double-precision floating-point number generated by a provided PRNG. * * @param obj PRNG object * @return maximum possible double */ double stdlib_base_prng_normalized_max( const struct BasePRNGObject *obj ) { return (double)( obj->prng->normalized_max ); } /** * Returns the size of a provided PRNG's internal state. * * @param obj PRNG object * @return state size */ size_t stdlib_base_prng_state_size( const struct BasePRNGObject *obj ) { return (size_t)( obj->prng->state_size ); } /** * Returns a copy of a PRNG's internal state. * * ## Notes * * - The user is responsible for freeing the allocated memory. * * @param obj PRNG object * @return pointer to a copy of a PRNG's internal state or, if unable to allocate memory, a null pointer */ void * stdlib_base_prng_state( const struct BasePRNGObject *obj ) { if ( obj == NULL ) { return NULL; } void *state = malloc( obj->prng->state_size ); if ( state == NULL ) { return NULL; } memcpy( state, obj->state, obj->prng->state_size ); return state; } /** * Sets a PRNG's state. * * ## Notes * * - The function returns `-1` if unable to set a PRNG state and `0` otherwise. * * @param obj PRNG object * @param state state * @return status code */ int8_t stdlib_base_prng_set( struct BasePRNGObject *obj, const void *vstate ) { if ( obj == NULL || vstate == NULL ) { return -1; } memcpy( obj->state, vstate, obj->prng->state_size ); return 0; } /** * Copies a PRNG. * * @param src source PRNG object * @return pointer to a dynamically allocated PRNG or, if unable to allocate memory, a null pointer */ struct BasePRNGObject * stdlib_base_prng_copy( const struct BasePRNGObject *src ) { struct BasePRNGObject *out = (struct BasePRNGObject *)malloc( sizeof( struct BasePRNGObject ) ); if ( out == NULL ) { return NULL; } // Allocate memory for the PRNG state... out->state = malloc( src->prng->state_size ); if ( out->state == NULL ) { free( out ); // prevent memory leaks return NULL; } // Set the PRNG (includes PRNG properties and methods): out->prng = src->prng; // Copy the current source PRNG state: memcpy( out->state, src->state, src->prng->state_size ); return out; } /** * Copies a PRNG state from a source PRNG to a destination PRNG of the same kind. * * ## Notes * * - The function returns `-1` if unable to copy a PRNG's state and `0` otherwise. * * @param dest destination PRNG object * @param src source PRNG object * @return status code */ int8_t stdlib_base_prng_copy_state( struct BasePRNGObject *dest, const struct BasePRNGObject *src ) { // We can only copy state between compatible PRNGs... if ( dest->prng != src->prng ) { return -1; } // Copy the current source PRNG state: memcpy( dest->state, src->state, src->prng->state_size ); return 0; } ```
```ocaml (*===-- llvm_irreader.mli - LLVM OCaml Interface --------------*- OCaml -*-===* * * See path_to_url for license information. * *===your_sha256_hash------===*) (** IR reader. This interface provides an OCaml API for the LLVM assembly reader, the classes in the IRReader library. *) exception Error of string (** [parse_ir context mb] parses the IR for a new module [m] from the memory buffer [mb] in the context [context]. Returns [m] if successful, or raises [Error msg] otherwise, where [msg] is a description of the error encountered. See the function [llvm::ParseIR]. *) val parse_ir : Llvm.llcontext -> Llvm.llmemorybuffer -> Llvm.llmodule ```
Ženski nogometni klub MB Tabor or simply ŽNK MB Tabor is a Slovenian women's football team from Maribor. History Founded in 2005 as ŽNK Maribor, the club began competing in the Slovenian Women's League in the 2006–07 season. The team ranked last and second to last in its first two seasons, but then finished third in 2009. In the next three seasons they finished in sixth place. Nina Kovačič (2007), Monika Žunkovič (2008 and 2011) and Urška Pavlec (2009 and 2010) have been the team's top scorers in its first five seasons. In February 2019, the club merged with the men's football club NK Maribor Tabor. After the 2020–21 season, the club withdrew from the league. References External links Official website Association football clubs established in 2005 Women's football clubs in Slovenia Sport in Maribor 2005 establishments in Slovenia
```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 mutation import ( "context" "encoding/json" "net/http" sc "github.com/kubernetes-sigs/service-catalog/pkg/apis/servicecatalog/v1beta1" "github.com/kubernetes-sigs/service-catalog/pkg/util" webhookutil "github.com/kubernetes-sigs/service-catalog/pkg/webhookutil" admissionTypes "k8s.io/api/admission/v1beta1" "sigs.k8s.io/controller-runtime/pkg/webhook/admission" ) // CreateUpdateHandler handles ClusterServiceClass type CreateUpdateHandler struct { decoder *admission.Decoder } var _ admission.Handler = &CreateUpdateHandler{} var _ admission.DecoderInjector = &CreateUpdateHandler{} // Handle handles admission requests. func (h *CreateUpdateHandler) Handle(ctx context.Context, req admission.Request) admission.Response { traced := webhookutil.NewTracedLogger(req.UID) traced.Infof("Start handling mutation operation: %s for %s: %q", req.Operation, req.Kind.Kind, req.Name) cb := &sc.ClusterServiceClass{} if err := webhookutil.MatchKinds(cb, req.Kind); err != nil { traced.Errorf("Error matching kinds: %v", err) return admission.Errored(http.StatusBadRequest, err) } if err := h.decoder.Decode(req, cb); err != nil { traced.Errorf("Could not decode request object: %v", err) return admission.Errored(http.StatusBadRequest, err) } mutated := cb.DeepCopy() switch req.Operation { case admissionTypes.Create: h.mutateOnCreate(ctx, mutated) case admissionTypes.Update: oldObj := &sc.ClusterServiceClass{} if err := h.decoder.DecodeRaw(req.OldObject, oldObj); err != nil { traced.Errorf("Could not decode request old object: %v", err) return admission.Errored(http.StatusBadRequest, err) } h.mutateOnUpdate(ctx, oldObj, mutated) default: traced.Infof("ClusterServiceClass mutation wehbook does not support action %q", req.Operation) return admission.Allowed("action not taken") } h.SyncLabels(mutated) rawMutated, err := json.Marshal(mutated) if err != nil { traced.Errorf("Error marshaling mutated object: %v", err) return admission.Errored(http.StatusInternalServerError, err) } traced.Infof("Completed successfully mutation operation: %s for %s: %q", req.Operation, req.Kind.Kind, req.Name) return admission.PatchResponseFromRaw(req.Object.Raw, rawMutated) } // InjectDecoder injects the decoder func (h *CreateUpdateHandler) InjectDecoder(d *admission.Decoder) error { h.decoder = d return nil } func (h *CreateUpdateHandler) mutateOnCreate(ctx context.Context, csc *sc.ClusterServiceClass) { } func (h *CreateUpdateHandler) mutateOnUpdate(ctx context.Context, oldClusterServiceClass, newClusterServiceClass *sc.ClusterServiceClass) { newClusterServiceClass.Spec.ClusterServiceBrokerName = oldClusterServiceClass.Spec.ClusterServiceBrokerName } // SyncLabels fills ClusterServiceClass with labels // exported for integration tests func (h *CreateUpdateHandler) SyncLabels(obj *sc.ClusterServiceClass) { if obj.Labels == nil { obj.Labels = make(map[string]string) } obj.Labels[sc.GroupName+"/"+sc.FilterSpecExternalID] = util.GenerateSHA(obj.Spec.ExternalID) obj.Labels[sc.GroupName+"/"+sc.FilterSpecExternalName] = util.GenerateSHA(obj.Spec.ExternalName) obj.Labels[sc.GroupName+"/"+sc.FilterSpecClusterServiceBrokerName] = util.GenerateSHA(obj.Spec.ClusterServiceBrokerName) } ```
```objective-c /**************************************************************************** * * fttrigon.h * * FreeType trigonometric functions (specification). * * David Turner, Robert Wilhelm, and Werner Lemberg. * * This file is part of the FreeType project, and may only be used, * modified, and distributed under the terms of the FreeType project * license, LICENSE.TXT. By continuing to use, modify, or distribute * this file you indicate that you have read the license and * understand and accept it fully. * */ #ifndef FTTRIGON_H_ #define FTTRIGON_H_ #include <freetype/freetype.h> #ifdef FREETYPE_H #error "freetype.h of FreeType 1 has been loaded!" #error "Please fix the directory search order for header files" #error "so that freetype.h of FreeType 2 is found first." #endif FT_BEGIN_HEADER /************************************************************************** * * @section: * computations * */ /************************************************************************** * * @type: * FT_Angle * * @description: * This type is used to model angle values in FreeType. Note that the * angle is a 16.16 fixed-point value expressed in degrees. * */ typedef FT_Fixed FT_Angle; /************************************************************************** * * @macro: * FT_ANGLE_PI * * @description: * The angle pi expressed in @FT_Angle units. * */ #define FT_ANGLE_PI ( 180L << 16 ) /************************************************************************** * * @macro: * FT_ANGLE_2PI * * @description: * The angle 2*pi expressed in @FT_Angle units. * */ #define FT_ANGLE_2PI ( FT_ANGLE_PI * 2 ) /************************************************************************** * * @macro: * FT_ANGLE_PI2 * * @description: * The angle pi/2 expressed in @FT_Angle units. * */ #define FT_ANGLE_PI2 ( FT_ANGLE_PI / 2 ) /************************************************************************** * * @macro: * FT_ANGLE_PI4 * * @description: * The angle pi/4 expressed in @FT_Angle units. * */ #define FT_ANGLE_PI4 ( FT_ANGLE_PI / 4 ) /************************************************************************** * * @function: * FT_Sin * * @description: * Return the sinus of a given angle in fixed-point format. * * @input: * angle :: * The input angle. * * @return: * The sinus value. * * @note: * If you need both the sinus and cosinus for a given angle, use the * function @FT_Vector_Unit. * */ FT_EXPORT( FT_Fixed ) FT_Sin( FT_Angle angle ); /************************************************************************** * * @function: * FT_Cos * * @description: * Return the cosinus of a given angle in fixed-point format. * * @input: * angle :: * The input angle. * * @return: * The cosinus value. * * @note: * If you need both the sinus and cosinus for a given angle, use the * function @FT_Vector_Unit. * */ FT_EXPORT( FT_Fixed ) FT_Cos( FT_Angle angle ); /************************************************************************** * * @function: * FT_Tan * * @description: * Return the tangent of a given angle in fixed-point format. * * @input: * angle :: * The input angle. * * @return: * The tangent value. * */ FT_EXPORT( FT_Fixed ) FT_Tan( FT_Angle angle ); /************************************************************************** * * @function: * FT_Atan2 * * @description: * Return the arc-tangent corresponding to a given vector (x,y) in the 2d * plane. * * @input: * x :: * The horizontal vector coordinate. * * y :: * The vertical vector coordinate. * * @return: * The arc-tangent value (i.e. angle). * */ FT_EXPORT( FT_Angle ) FT_Atan2( FT_Fixed x, FT_Fixed y ); /************************************************************************** * * @function: * FT_Angle_Diff * * @description: * Return the difference between two angles. The result is always * constrained to the ]-PI..PI] interval. * * @input: * angle1 :: * First angle. * * angle2 :: * Second angle. * * @return: * Constrained value of `angle2-angle1`. * */ FT_EXPORT( FT_Angle ) FT_Angle_Diff( FT_Angle angle1, FT_Angle angle2 ); /************************************************************************** * * @function: * FT_Vector_Unit * * @description: * Return the unit vector corresponding to a given angle. After the * call, the value of `vec.x` will be `cos(angle)`, and the value of * `vec.y` will be `sin(angle)`. * * This function is useful to retrieve both the sinus and cosinus of a * given angle quickly. * * @output: * vec :: * The address of target vector. * * @input: * angle :: * The input angle. * */ FT_EXPORT( void ) FT_Vector_Unit( FT_Vector* vec, FT_Angle angle ); /************************************************************************** * * @function: * FT_Vector_Rotate * * @description: * Rotate a vector by a given angle. * * @inout: * vec :: * The address of target vector. * * @input: * angle :: * The input angle. * */ FT_EXPORT( void ) FT_Vector_Rotate( FT_Vector* vec, FT_Angle angle ); /************************************************************************** * * @function: * FT_Vector_Length * * @description: * Return the length of a given vector. * * @input: * vec :: * The address of target vector. * * @return: * The vector length, expressed in the same units that the original * vector coordinates. * */ FT_EXPORT( FT_Fixed ) FT_Vector_Length( FT_Vector* vec ); /************************************************************************** * * @function: * FT_Vector_Polarize * * @description: * Compute both the length and angle of a given vector. * * @input: * vec :: * The address of source vector. * * @output: * length :: * The vector length. * * angle :: * The vector angle. * */ FT_EXPORT( void ) FT_Vector_Polarize( FT_Vector* vec, FT_Fixed *length, FT_Angle *angle ); /************************************************************************** * * @function: * FT_Vector_From_Polar * * @description: * Compute vector coordinates from a length and angle. * * @output: * vec :: * The address of source vector. * * @input: * length :: * The vector length. * * angle :: * The vector angle. * */ FT_EXPORT( void ) FT_Vector_From_Polar( FT_Vector* vec, FT_Fixed length, FT_Angle angle ); /* */ FT_END_HEADER #endif /* FTTRIGON_H_ */ /* END */ ```
Debra Todd (born October 15, 1957) is the chief justice of the Supreme Court of Pennsylvania. Prior to her election to the Supreme Court in 2007, she served as a judge on the Superior Court of Pennsylvania from 2000 through 2007. She is a member of the Democratic Party. Formative years and family Born in Ellwood City, Pennsylvania, on October 15, 1957, as Debra McCloskey, Debra Todd is a daughter of Harry and Blanche McCloskey. She and her sisters, Mary and Nancy, were reared in that Wayne Township borough, which is located in Lawrence County. Their father was a steelworker. She is married to Stephen K. Todd, a former attorney for the United States Army who retired from the U.S. Army Reserve at the rank of colonel, and who had been an attorney for U.S. Steel for thirty-one years before retiring in 2007 as vice president of law and environmental affairs. Education A 1975 graduate of Lincoln High School in Ellwood City, Todd was awarded a Bachelor of Arts degree with honors from Chatham College in 1979, served on the Law Review in 1982 at the University of Pittsburgh School of Law in Pittsburgh, Pennsylvania, where she earned her Juris Doctor that same year, and was then awarded a Master of Laws from the University of Virginia School of Law in 2004. Legal career Todd worked in private practice from 1982 to 1999. During the fall of 1999, she ran for, and was elected to the position of, judge on the Superior Court of Pennsylvania, serving from January 17, 2000, to December 31, 2007. She was elected to the Supreme Court of Pennsylvania in 2007. On May 19, 2017, Todd delivered the Charles Widger School of Law’s 2017 Commencement Address at Villanova University, and was also awarded the Villanova Law Medallion Award in recognition of her achievements. On October 1, 2022, she became the first female chief justice of the state Supreme Court, replacing Max Baer who died a day earlier. Roughly three weeks later, she issued her first major letter to Pennsylvania attorneys, in which she urged them to support pro bono legal work across the Commonwealth of Pennsylvania. Publications Todd's list of publications includes: Report and Recommendations of the Pennsylvania Supreme Court Elder Law Task Force (Chair), 2014 “Sentencing of Adult Offenders in Crimes Involving the Sexual Abuse of Children, Too Little, Too Late? A View from the Pennsylvania Bench.” 109 Penn State Law Review 487, 2004 Awards and honors Todd has been the recipient of the following awards: Susan B. Anthony Award for promoting equality in the legal profession, Women’s Bar Association of Western Pennsylvania, 2017 Visionary Award in recognition of an individual who has made a significant impact in the lives of survivors of sexual violence, Pittsburgh Action Against Rape, 2016 Judge Robert E. Dauer Award for Judicial Leadership and Excellence, Amen Corner, 2015 225th Anniversary Medallion recognizing alumni who have built better lives through their life’s work, University of Pittsburgh, 2013 Marjorie Matson Woman of the Year Award, Women's Association, University of Pittsburgh School of Law, 2013 Tribute to Women Leadership Award in Business & Professional Services, Greater Pittsburgh YWCA, 2013 Distinguished Alumni Award, University of Pittsburgh Law Alumni Association, 2012 Philip Werner Amram Award for Professional Excellence, Allegheny County Bar Association, 2010 Cornerstone Award for Law, Chatham University, 2009 Honorary Doctorate in Public Service, Chatham University, 2008 Celebrate & Share Women of Achievement Award, 2008 Woman of the Year Award, The Legal Intelligencer Women in the Profession, 2007-2008 Woman of the Year, Pennsylvania Federation of Democratic Women, 2007 References External links Superior Court Profile Debra Todd Project Vote Smart Profile Debra Todd Smart Voter Profile 1957 births 20th-century American lawyers 21st-century American judges 21st-century American lawyers 21st-century American women judges Chatham University alumni Chief Justices of Pennsylvania Living people Judges of the Superior Court of Pennsylvania Justices of the Supreme Court of Pennsylvania Pennsylvania Democrats People from Ellwood City, Pennsylvania University of Pittsburgh School of Law alumni University of Virginia School of Law alumni Women chief justices of state supreme courts in the United States
Charles Mark Relyea (April 23, 1863 – 1932) was an American illustrator whose work appeared in magazines and popular novels in the late 19th and early 20th centuries. Life and career Relyea was a native of Albany, New York, and spent most of his early years in Rochester. He studied art under Thomas Eakins at the Pennsylvania Academy of the Fine Arts and under Frank Vincent DuMond at the Art Students League in New York City before completing his training in Paris. After returning to the United States, he made his home in New Rochelle, New York. His illustrations appeared in the children's magazine St. Nicholas, as well as magazines for broader audiences, such as Munsey's. In 1897, a publishing house chose Relyea to illustrate The Rubáiyát of Doc Sifers, Hoosier poet James Whitcomb Riley's poem satirizing The Rubaiyat of Omar Khayyam. Because Relyea was not from Indiana, Riley insisted that he visit the state before making his drawings, to ensure that he would not misrepresent Indiana or caricature its residents. Personal life Relyea was married in 1892. His wife Eloise divorced him in 1920, winning alimony of $25 per week. After the marriage collapsed, she remained in New Rochelle and he was reported to be living in his studio in the Bronx. Selected works Books with illustrations by Charles M. Relyea include: The Rubáiyát of Doc Sifers (James Whitcomb Riley, 1897) Standard First Reader (1902), published by Funk & Wagnalls Children of the Tenements (Jacob A. Riis, 1903) A Defective Santa Claus (James Whitcomb Riley, 1904) Her Brother's Letters (Anonymous, 1906) Just Patty (1911) Left Tackle Thayer (Ralph Henry Barbour, 1915), Dodd, Mead & Company The Slipper Point Mystery (1921) References External links 1863 births 1932 deaths American illustrators Art Students League of New York alumni Artists from Albany, New York Artists from New Rochelle, New York Pennsylvania Academy of the Fine Arts alumni Students of Thomas Eakins
This is the progression of world record improvements of the 200 metres W40 division of Masters athletics. Key References Masters Athletics 200 m list Masters athletics world record progressions
```c++ #include <string> #include "envoy/extensions/filters/http/cdn_loop/v3/cdn_loop.pb.h" #include "test/integration/http_protocol_integration.h" #include "test/test_common/utility.h" #include "gtest/gtest.h" namespace Envoy { namespace Extensions { namespace HttpFilters { namespace CdnLoop { namespace { const std::string MaxDefaultConfig = R"EOF( name: envoy.filters.http.cdn_loop typed_config: "@type": type.googleapis.com/envoy.extensions.filters.http.cdn_loop.v3.CdnLoopConfig cdn_id: cdn )EOF"; const std::string MaxOf2Config = R"EOF( name: envoy.filters.http.cdn_loop typed_config: "@type": type.googleapis.com/envoy.extensions.filters.http.cdn_loop.v3.CdnLoopConfig cdn_id: cdn max_allowed_occurrences: 2 )EOF"; class CdnLoopFilterIntegrationTest : public HttpProtocolIntegrationTest {}; TEST_P(CdnLoopFilterIntegrationTest, NoCdnLoopHeader) { config_helper_.prependFilter(MaxDefaultConfig); initialize(); codec_client_ = makeHttpConnection(makeClientConnection(lookupPort("http"))); Http::TestRequestHeaderMapImpl request_headers{ {":method", "GET"}, {":path", "/"}, {":scheme", "http"}, {":authority", "host"}}; auto response = sendRequestAndWaitForResponse(request_headers, 0, default_response_headers_, 0); const auto payload_entry = upstream_request_->headers().get(Http::LowerCaseString("CDN-Loop")); ASSERT_FALSE(payload_entry.empty()); EXPECT_EQ(payload_entry[0]->value().getStringView(), "cdn"); ASSERT_TRUE(response->complete()); EXPECT_EQ("200", response->headers().getStatusValue()); } TEST_P(CdnLoopFilterIntegrationTest, CdnLoopHeaderWithOtherCdns) { config_helper_.prependFilter(MaxDefaultConfig); initialize(); codec_client_ = makeHttpConnection(makeClientConnection(lookupPort("http"))); Http::TestRequestHeaderMapImpl request_headers{{":method", "GET"}, {":path", "/"}, {":scheme", "http"}, {":authority", "host"}, {"CDN-Loop", "cdn1,cdn2"}}; auto response = sendRequestAndWaitForResponse(request_headers, 0, default_response_headers_, 0); const auto payload_entry = upstream_request_->headers().get(Http::LowerCaseString("CDN-Loop")); ASSERT_FALSE(payload_entry.empty()); EXPECT_EQ(payload_entry[0]->value().getStringView(), "cdn1,cdn2,cdn"); ASSERT_TRUE(response->complete()); EXPECT_EQ("200", response->headers().getStatusValue()); } TEST_P(CdnLoopFilterIntegrationTest, MultipleCdnLoopHeaders) { config_helper_.prependFilter(MaxDefaultConfig); initialize(); codec_client_ = makeHttpConnection(makeClientConnection(lookupPort("http"))); Http::TestRequestHeaderMapImpl request_headers{{":method", "GET"}, {":path", "/"}, {":scheme", "http"}, {":authority", "host"}, {"CDN-Loop", "cdn1"}, {"CDN-Loop", "cdn2"}}; auto response = sendRequestAndWaitForResponse(request_headers, 0, default_response_headers_, 0); const auto payload_entry = upstream_request_->headers().get(Http::LowerCaseString("CDN-Loop")); ASSERT_FALSE(payload_entry.empty()); EXPECT_EQ(payload_entry[0]->value().getStringView(), "cdn1,cdn2,cdn"); ASSERT_TRUE(response->complete()); EXPECT_EQ("200", response->headers().getStatusValue()); } TEST_P(CdnLoopFilterIntegrationTest, CdnLoop0Allowed1Seen) { config_helper_.prependFilter(MaxDefaultConfig); initialize(); codec_client_ = makeHttpConnection(makeClientConnection(lookupPort("http"))); Http::TestRequestHeaderMapImpl request_headers{{":method", "GET"}, {":path", "/"}, {":scheme", "http"}, {":authority", "host"}, {"CDN-Loop", "cdn"}}; auto response = codec_client_->makeHeaderOnlyRequest(request_headers); ASSERT_TRUE(response->waitForEndStream()); ASSERT_TRUE(response->complete()); EXPECT_EQ("502", response->headers().getStatusValue()); } TEST_P(CdnLoopFilterIntegrationTest, UnparseableHeader) { config_helper_.prependFilter(MaxDefaultConfig); initialize(); codec_client_ = makeHttpConnection(makeClientConnection(lookupPort("http"))); Http::TestRequestHeaderMapImpl request_headers{{":method", "GET"}, {":path", "/"}, {":scheme", "http"}, {":authority", "host"}, {"CDN-Loop", "[bad-header"}}; auto response = codec_client_->makeHeaderOnlyRequest(request_headers); ASSERT_TRUE(response->waitForEndStream()); ASSERT_TRUE(response->complete()); EXPECT_EQ("400", response->headers().getStatusValue()); } TEST_P(CdnLoopFilterIntegrationTest, CdnLoop2Allowed1Seen) { config_helper_.prependFilter(MaxOf2Config); initialize(); codec_client_ = makeHttpConnection(makeClientConnection(lookupPort("http"))); Http::TestRequestHeaderMapImpl request_headers{{":method", "GET"}, {":path", "/"}, {":scheme", "http"}, {":authority", "host"}, {"CDN-Loop", "cdn"}}; auto response = sendRequestAndWaitForResponse(request_headers, 0, default_response_headers_, 0); const auto payload_entry = upstream_request_->headers().get(Http::LowerCaseString("CDN-Loop")); ASSERT_FALSE(payload_entry.empty()); EXPECT_EQ(payload_entry[0]->value().getStringView(), "cdn,cdn"); ASSERT_TRUE(response->complete()); EXPECT_EQ("200", response->headers().getStatusValue()); } TEST_P(CdnLoopFilterIntegrationTest, CdnLoop2Allowed2Seen) { config_helper_.prependFilter(MaxOf2Config); initialize(); codec_client_ = makeHttpConnection(makeClientConnection(lookupPort("http"))); Http::TestRequestHeaderMapImpl request_headers{{":method", "GET"}, {":path", "/"}, {":scheme", "http"}, {":authority", "host"}, {"CDN-Loop", "cdn, cdn"}}; auto response = sendRequestAndWaitForResponse(request_headers, 0, default_response_headers_, 0); const auto payload_entry = upstream_request_->headers().get(Http::LowerCaseString("CDN-Loop")); ASSERT_FALSE(payload_entry.empty()); EXPECT_EQ(payload_entry[0]->value().getStringView(), "cdn, cdn,cdn"); ASSERT_TRUE(response->complete()); EXPECT_EQ("200", response->headers().getStatusValue()); } TEST_P(CdnLoopFilterIntegrationTest, CdnLoop2Allowed3Seen) { config_helper_.prependFilter(MaxOf2Config); initialize(); codec_client_ = makeHttpConnection(makeClientConnection(lookupPort("http"))); Http::TestRequestHeaderMapImpl request_headers{{":method", "GET"}, {":path", "/"}, {":scheme", "http"}, {":authority", "host"}, {"CDN-Loop", "cdn, cdn, cdn"}}; auto response = codec_client_->makeHeaderOnlyRequest(request_headers); ASSERT_TRUE(response->waitForEndStream()); ASSERT_TRUE(response->complete()); EXPECT_EQ("502", response->headers().getStatusValue()); } INSTANTIATE_TEST_SUITE_P(Protocols, CdnLoopFilterIntegrationTest, testing::ValuesIn(HttpProtocolIntegrationTest::getProtocolTestParams( {Http::CodecType::HTTP1, Http::CodecType::HTTP2}, // Upstream doesn't matter, so by testing only 1, // the test is twice as fast. {Http::CodecType::HTTP1})), HttpProtocolIntegrationTest::protocolTestParamsToString); } // namespace } // namespace CdnLoop } // namespace HttpFilters } // namespace Extensions } // namespace Envoy ```
St. Aloysius of Gonzaga Church is a Roman Catholic church in Nashua, New Hampshire, United States. The church is part of the Roman Catholic Diocese of Manchester, New Hampshire. History The parish was founded in 1871 by the French-Canadian population that was growing in the area. It is located at 50 West Hollis Street. The original church of 1873 was built in the American Gothic Revival style with a chancel terminated by a polygonal apse. The structure was dedicated on June 8, 1873. St Louis, as it is more commonly known, is the oldest remaining Catholic parish in Nashua. In 1920 the parish completed a renovation and expanded the church to include a transept. The extended chancel terminated with a straight wall punctuated with a perpendicular style stained glass window. In the early morning hours of July 20, 1976, a fire consumed the roof of the old church. The parish decided to raze the building except for one of two steeples. The shorter of the two steeples remains as a memorial to the original structure. The new structure was dedicated in 1979. The interior of the church has many items save from the previous building, including the stained glass windows from 1887, doors, sanctuary seating, sanctuary light and other items. The parish is home to the former parishioners of the now-closed St. Stanislaus and St. Francis Xavier churches, also in Nashua. St. Stanislaus Parish served the Polish-speaking population of Nashua and was suppressed in 2002 and became part of St Louis parish. The church was called Corpus Christi Chapel and used for Eucharistic Adoration. In 2016 the church became a personal use parish for the Latin Mass St Stanislaus and entrusted to the Priestly Fraternity of Saint Peter. The former St. Francis Xavier Catholic church served a French-speaking population. The church building is now home to St. Mary and Archangel Michael Church Coptic Orthodox Church. References External links St Aloysius of Gonzaga French-Canadian culture in New Hampshire French-Canadian American history Churches in the Roman Catholic Diocese of Manchester Buildings and structures in Nashua, New Hampshire Churches in Hillsborough County, New Hampshire 1871 establishments in New Hampshire
```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 flags implements command-line flag parsing. package flags import ( "flag" "fmt" "net/url" "os" "strings" "github.com/coreos/etcd/Godeps/_workspace/src/github.com/coreos/pkg/capnslog" "github.com/coreos/etcd/pkg/transport" ) var ( plog = capnslog.NewPackageLogger("github.com/coreos/etcd/pkg", "flags") ) // DeprecatedFlag encapsulates a flag that may have been previously valid but // is now deprecated. If a DeprecatedFlag is set, an error occurs. type DeprecatedFlag struct { Name string } func (f *DeprecatedFlag) Set(_ string) error { return fmt.Errorf(`flag "-%s" is no longer supported.`, f.Name) } func (f *DeprecatedFlag) String() string { return "" } // IgnoredFlag encapsulates a flag that may have been previously valid but is // now ignored. If an IgnoredFlag is set, a warning is printed and // operation continues. type IgnoredFlag struct { Name string } // IsBoolFlag is defined to allow the flag to be defined without an argument func (f *IgnoredFlag) IsBoolFlag() bool { return true } func (f *IgnoredFlag) Set(s string) error { plog.Warningf(`flag "-%s" is no longer supported - ignoring.`, f.Name) return nil } func (f *IgnoredFlag) String() string { return "" } // SetFlagsFromEnv parses all registered flags in the given flagset, // and if they are not already set it attempts to set their values from // environment variables. Environment variables take the name of the flag but // are UPPERCASE, have the prefix "ETCD_", and any dashes are replaced by // underscores - for example: some-flag => ETCD_SOME_FLAG func SetFlagsFromEnv(fs *flag.FlagSet) error { var err error alreadySet := make(map[string]bool) fs.Visit(func(f *flag.Flag) { alreadySet[flagToEnv(f.Name)] = true }) usedEnvKey := make(map[string]bool) fs.VisitAll(func(f *flag.Flag) { key := flagToEnv(f.Name) if !alreadySet[key] { val := os.Getenv(key) if val != "" { usedEnvKey[key] = true if serr := fs.Set(f.Name, val); serr != nil { err = fmt.Errorf("invalid value %q for %s: %v", val, key, serr) } plog.Infof("recognized and used environment variable %s=%s", key, val) } } }) for _, env := range os.Environ() { kv := strings.SplitN(env, "=", 2) if len(kv) != 2 { plog.Warningf("found invalid env %s", env) } if usedEnvKey[kv[0]] { continue } if alreadySet[kv[0]] { plog.Infof("recognized environment variable %s, but unused: shadowed by corresponding flag ", kv[0]) continue } if strings.HasPrefix(env, "ETCD_") { plog.Warningf("unrecognized environment variable %s", env) } } return err } func flagToEnv(name string) string { return "ETCD_" + strings.ToUpper(strings.Replace(name, "-", "_", -1)) } // SetBindAddrFromAddr sets the value of bindAddr flag from the value // of addr flag. Both flags' Value must be of type IPAddressPort. If the // bindAddr flag is set and the addr flag is unset, it will set bindAddr to // [::]:port of addr. Otherwise, it keeps the original values. func SetBindAddrFromAddr(fs *flag.FlagSet, bindAddrFlagName, addrFlagName string) { if IsSet(fs, bindAddrFlagName) || !IsSet(fs, addrFlagName) { return } addr := *fs.Lookup(addrFlagName).Value.(*IPAddressPort) addr.IP = "::" if err := fs.Set(bindAddrFlagName, addr.String()); err != nil { plog.Panicf("unexpected flags set error: %v", err) } } // URLsFromFlags decides what URLs should be using two different flags // as datasources. The first flag's Value must be of type URLs, while // the second must be of type IPAddressPort. If both of these flags // are set, an error will be returned. If only the first flag is set, // the underlying url.URL objects will be returned unmodified. If the // second flag happens to be set, the underlying IPAddressPort will be // converted to a url.URL and returned. The Scheme of the returned // url.URL will be http unless the provided TLSInfo object is non-empty. // If neither of the flags have been explicitly set, the default value // of the first flag will be returned unmodified. func URLsFromFlags(fs *flag.FlagSet, urlsFlagName string, addrFlagName string, tlsInfo transport.TLSInfo) ([]url.URL, error) { visited := make(map[string]struct{}) fs.Visit(func(f *flag.Flag) { visited[f.Name] = struct{}{} }) _, urlsFlagIsSet := visited[urlsFlagName] _, addrFlagIsSet := visited[addrFlagName] if addrFlagIsSet { if urlsFlagIsSet { return nil, fmt.Errorf("Set only one of flags -%s and -%s", urlsFlagName, addrFlagName) } addr := *fs.Lookup(addrFlagName).Value.(*IPAddressPort) addrURL := url.URL{Scheme: "http", Host: addr.String()} if !tlsInfo.Empty() { addrURL.Scheme = "https" } return []url.URL{addrURL}, nil } return []url.URL(*fs.Lookup(urlsFlagName).Value.(*URLsValue)), nil } func IsSet(fs *flag.FlagSet, name string) bool { set := false fs.Visit(func(f *flag.Flag) { if f.Name == name { set = true } }) return set } ```
is a small village and former civil parish in the old commote of Eifionydd and Cantref Dunoding in the Welsh county of Gwynedd. The parish was abolished in 1934 and incorporated into Llanystumdwy. The village lies north east of Pwllheli and is close to the village of Llangybi, a holy well and the mountain of Carn Pentrych. A well-preserved 15th-century manor house at Penarth Fawr is maintained by Cadw, and another ancient monument Plas Du (Welsh: Black Place) is a well-preserved, substantial sub-medieval gentry house. It also has important historical associations; it was known as the centre of the Roman Catholic faith in the region and was the home of Thomas Owen, High Sheriff of Caernarfonshire from 1569, who was imprisoned for sheltering missionary priests in the house in 1571. "The village is pleasantly situated in a fertile plain, and the neighbour-hood partakes of the pleasing scenery which prevails in this part of the country. The living is a rectory not in charge, annexed to that of Llangybi, in the archdeaconry of Merioneth, and diocese of Bangor, and in the patronage of the Bishop of Bangor. The church, dedicated to Saint Garmon, is an ancient and spacious structure in good repair : some additional windows have lately been inserted, previously to which alteration the interior was very dark." Samuel Lewis, Topographical Dictionary of Wales (1833) References Villages in Gwynedd Llanystumdwy
```go package daemon // import "github.com/docker/docker/daemon" import ( "fmt" "io/ioutil" "path/filepath" "runtime" "strings" containertypes "github.com/docker/docker/api/types/container" "github.com/docker/docker/container" "github.com/docker/docker/oci" "github.com/docker/docker/pkg/sysinfo" "github.com/docker/docker/pkg/system" "github.com/opencontainers/runtime-spec/specs-go" "github.com/pkg/errors" "golang.org/x/sys/windows" "golang.org/x/sys/windows/registry" ) const ( credentialSpecRegistryLocation = `SOFTWARE\Microsoft\Windows NT\CurrentVersion\Virtualization\Containers\CredentialSpecs` credentialSpecFileLocation = "CredentialSpecs" ) func (daemon *Daemon) createSpec(c *container.Container) (*specs.Spec, error) { img, err := daemon.imageService.GetImage(string(c.ImageID)) if err != nil { return nil, err } s := oci.DefaultOSSpec(img.OS) linkedEnv, err := daemon.setupLinkedContainers(c) if err != nil { return nil, err } // Note, unlike Unix, we do NOT call into SetupWorkingDirectory as // this is done in VMCompute. Further, we couldn't do it for Hyper-V // containers anyway. // In base spec s.Hostname = c.FullHostname() if err := daemon.setupSecretDir(c); err != nil { return nil, err } if err := daemon.setupConfigDir(c); err != nil { return nil, err } // In s.Mounts mounts, err := daemon.setupMounts(c) if err != nil { return nil, err } var isHyperV bool if c.HostConfig.Isolation.IsDefault() { // Container using default isolation, so take the default from the daemon configuration isHyperV = daemon.defaultIsolation.IsHyperV() } else { // Container may be requesting an explicit isolation mode. isHyperV = c.HostConfig.Isolation.IsHyperV() } if isHyperV { s.Windows.HyperV = &specs.WindowsHyperV{} } // If the container has not been started, and has configs or secrets // secrets, create symlinks to each config and secret. If it has been // started before, the symlinks should have already been created. Also, it // is important to not mount a Hyper-V container that has been started // before, to protect the host from the container; for example, from // malicious mutation of NTFS data structures. if !c.HasBeenStartedBefore && (len(c.SecretReferences) > 0 || len(c.ConfigReferences) > 0) { // The container file system is mounted before this function is called, // except for Hyper-V containers, so mount it here in that case. if isHyperV { if err := daemon.Mount(c); err != nil { return nil, err } defer daemon.Unmount(c) } if err := c.CreateSecretSymlinks(); err != nil { return nil, err } if err := c.CreateConfigSymlinks(); err != nil { return nil, err } } secretMounts, err := c.SecretMounts() if err != nil { return nil, err } if secretMounts != nil { mounts = append(mounts, secretMounts...) } configMounts := c.ConfigMounts() if configMounts != nil { mounts = append(mounts, configMounts...) } for _, mount := range mounts { m := specs.Mount{ Source: mount.Source, Destination: mount.Destination, } if !mount.Writable { m.Options = append(m.Options, "ro") } if img.OS != runtime.GOOS { m.Type = "bind" m.Options = append(m.Options, "rbind") m.Options = append(m.Options, fmt.Sprintf("uvmpath=/tmp/gcs/%s/binds", c.ID)) } s.Mounts = append(s.Mounts, m) } // In s.Process s.Process.Args = append([]string{c.Path}, c.Args...) if !c.Config.ArgsEscaped && img.OS == "windows" { s.Process.Args = escapeArgs(s.Process.Args) } s.Process.Cwd = c.Config.WorkingDir s.Process.Env = c.CreateDaemonEnvironment(c.Config.Tty, linkedEnv) if c.Config.Tty { s.Process.Terminal = c.Config.Tty s.Process.ConsoleSize = &specs.Box{ Height: c.HostConfig.ConsoleSize[0], Width: c.HostConfig.ConsoleSize[1], } } s.Process.User.Username = c.Config.User s.Windows.LayerFolders, err = daemon.imageService.GetLayerFolders(img, c.RWLayer) if err != nil { return nil, errors.Wrapf(err, "container %s", c.ID) } dnsSearch := daemon.getDNSSearchSettings(c) // Get endpoints for the libnetwork allocated networks to the container var epList []string AllowUnqualifiedDNSQuery := false gwHNSID := "" if c.NetworkSettings != nil { for n := range c.NetworkSettings.Networks { sn, err := daemon.FindNetwork(n) if err != nil { continue } ep, err := getEndpointInNetwork(c.Name, sn) if err != nil { continue } data, err := ep.DriverInfo() if err != nil { continue } if data["GW_INFO"] != nil { gwInfo := data["GW_INFO"].(map[string]interface{}) if gwInfo["hnsid"] != nil { gwHNSID = gwInfo["hnsid"].(string) } } if data["hnsid"] != nil { epList = append(epList, data["hnsid"].(string)) } if data["AllowUnqualifiedDNSQuery"] != nil { AllowUnqualifiedDNSQuery = true } } } var networkSharedContainerID string if c.HostConfig.NetworkMode.IsContainer() { networkSharedContainerID = c.NetworkSharedContainerID for _, ep := range c.SharedEndpointList { epList = append(epList, ep) } } if gwHNSID != "" { epList = append(epList, gwHNSID) } s.Windows.Network = &specs.WindowsNetwork{ AllowUnqualifiedDNSQuery: AllowUnqualifiedDNSQuery, DNSSearchList: dnsSearch, EndpointList: epList, NetworkSharedContainerName: networkSharedContainerID, } switch img.OS { case "windows": if err := daemon.createSpecWindowsFields(c, &s, isHyperV); err != nil { return nil, err } case "linux": if !system.LCOWSupported() { return nil, fmt.Errorf("Linux containers on Windows are not supported") } if err := daemon.createSpecLinuxFields(c, &s); err != nil { return nil, err } default: return nil, fmt.Errorf("Unsupported platform %q", img.OS) } return (*specs.Spec)(&s), nil } // Sets the Windows-specific fields of the OCI spec func (daemon *Daemon) createSpecWindowsFields(c *container.Container, s *specs.Spec, isHyperV bool) error { if len(s.Process.Cwd) == 0 { // We default to C:\ to workaround the oddity of the case that the // default directory for cmd running as LocalSystem (or // ContainerAdministrator) is c:\windows\system32. Hence docker run // <image> cmd will by default end in c:\windows\system32, rather // than 'root' (/) on Linux. The oddity is that if you have a dockerfile // which has no WORKDIR and has a COPY file ., . will be interpreted // as c:\. Hence, setting it to default of c:\ makes for consistency. s.Process.Cwd = `C:\` } s.Root.Readonly = false // Windows does not support a read-only root filesystem if !isHyperV { if c.BaseFS == nil { return errors.New("createSpecWindowsFields: BaseFS of container " + c.ID + " is unexpectedly nil") } s.Root.Path = c.BaseFS.Path() // This is not set for Hyper-V containers if !strings.HasSuffix(s.Root.Path, `\`) { s.Root.Path = s.Root.Path + `\` // Ensure a correctly formatted volume GUID path \\?\Volume{GUID}\ } } // First boot optimization s.Windows.IgnoreFlushesDuringBoot = !c.HasBeenStartedBefore // In s.Windows.Resources cpuShares := uint16(c.HostConfig.CPUShares) cpuMaximum := uint16(c.HostConfig.CPUPercent) * 100 cpuCount := uint64(c.HostConfig.CPUCount) if c.HostConfig.NanoCPUs > 0 { if isHyperV { cpuCount = uint64(c.HostConfig.NanoCPUs / 1e9) leftoverNanoCPUs := c.HostConfig.NanoCPUs % 1e9 if leftoverNanoCPUs != 0 { cpuCount++ cpuMaximum = uint16(c.HostConfig.NanoCPUs / int64(cpuCount) / (1e9 / 10000)) if cpuMaximum < 1 { // The requested NanoCPUs is so small that we rounded to 0, use 1 instead cpuMaximum = 1 } } } else { cpuMaximum = uint16(c.HostConfig.NanoCPUs / int64(sysinfo.NumCPU()) / (1e9 / 10000)) if cpuMaximum < 1 { // The requested NanoCPUs is so small that we rounded to 0, use 1 instead cpuMaximum = 1 } } } memoryLimit := uint64(c.HostConfig.Memory) s.Windows.Resources = &specs.WindowsResources{ CPU: &specs.WindowsCPUResources{ Maximum: &cpuMaximum, Shares: &cpuShares, Count: &cpuCount, }, Memory: &specs.WindowsMemoryResources{ Limit: &memoryLimit, }, Storage: &specs.WindowsStorageResources{ Bps: &c.HostConfig.IOMaximumBandwidth, Iops: &c.HostConfig.IOMaximumIOps, }, } // Read and add credentials from the security options if a credential spec has been provided. if c.HostConfig.SecurityOpt != nil { cs := "" for _, sOpt := range c.HostConfig.SecurityOpt { sOpt = strings.ToLower(sOpt) if !strings.Contains(sOpt, "=") { return fmt.Errorf("invalid security option: no equals sign in supplied value %s", sOpt) } var splitsOpt []string splitsOpt = strings.SplitN(sOpt, "=", 2) if len(splitsOpt) != 2 { return fmt.Errorf("invalid security option: %s", sOpt) } if splitsOpt[0] != "credentialspec" { return fmt.Errorf("security option not supported: %s", splitsOpt[0]) } var ( match bool csValue string err error ) if match, csValue = getCredentialSpec("file://", splitsOpt[1]); match { if csValue == "" { return fmt.Errorf("no value supplied for file:// credential spec security option") } if cs, err = readCredentialSpecFile(c.ID, daemon.root, filepath.Clean(csValue)); err != nil { return err } } else if match, csValue = getCredentialSpec("registry://", splitsOpt[1]); match { if csValue == "" { return fmt.Errorf("no value supplied for registry:// credential spec security option") } if cs, err = readCredentialSpecRegistry(c.ID, csValue); err != nil { return err } } else { return fmt.Errorf("invalid credential spec security option - value must be prefixed file:// or registry:// followed by a value") } } s.Windows.CredentialSpec = cs } return nil } // Sets the Linux-specific fields of the OCI spec // TODO: @jhowardmsft LCOW Support. We need to do a lot more pulling in what can // be pulled in from oci_linux.go. func (daemon *Daemon) createSpecLinuxFields(c *container.Container, s *specs.Spec) error { if len(s.Process.Cwd) == 0 { s.Process.Cwd = `/` } s.Root.Path = "rootfs" s.Root.Readonly = c.HostConfig.ReadonlyRootfs if err := setCapabilities(s, c); err != nil { return fmt.Errorf("linux spec capabilities: %v", err) } devPermissions, err := appendDevicePermissionsFromCgroupRules(nil, c.HostConfig.DeviceCgroupRules) if err != nil { return fmt.Errorf("linux runtime spec devices: %v", err) } s.Linux.Resources.Devices = devPermissions return nil } func escapeArgs(args []string) []string { escapedArgs := make([]string, len(args)) for i, a := range args { escapedArgs[i] = windows.EscapeArg(a) } return escapedArgs } // mergeUlimits merge the Ulimits from HostConfig with daemon defaults, and update HostConfig // It will do nothing on non-Linux platform func (daemon *Daemon) mergeUlimits(c *containertypes.HostConfig) { return } // getCredentialSpec is a helper function to get the value of a credential spec supplied // on the CLI, stripping the prefix func getCredentialSpec(prefix, value string) (bool, string) { if strings.HasPrefix(value, prefix) { return true, strings.TrimPrefix(value, prefix) } return false, "" } // readCredentialSpecRegistry is a helper function to read a credential spec from // the registry. If not found, we return an empty string and warn in the log. // This allows for staging on machines which do not have the necessary components. func readCredentialSpecRegistry(id, name string) (string, error) { var ( k registry.Key err error val string ) if k, err = registry.OpenKey(registry.LOCAL_MACHINE, credentialSpecRegistryLocation, registry.QUERY_VALUE); err != nil { return "", fmt.Errorf("failed handling spec %q for container %s - %s could not be opened", name, id, credentialSpecRegistryLocation) } if val, _, err = k.GetStringValue(name); err != nil { if err == registry.ErrNotExist { return "", fmt.Errorf("credential spec %q for container %s as it was not found", name, id) } return "", fmt.Errorf("error %v reading credential spec %q from registry for container %s", err, name, id) } return val, nil } // readCredentialSpecFile is a helper function to read a credential spec from // a file. If not found, we return an empty string and warn in the log. // This allows for staging on machines which do not have the necessary components. func readCredentialSpecFile(id, root, location string) (string, error) { if filepath.IsAbs(location) { return "", fmt.Errorf("invalid credential spec - file:// path cannot be absolute") } base := filepath.Join(root, credentialSpecFileLocation) full := filepath.Join(base, location) if !strings.HasPrefix(full, base) { return "", fmt.Errorf("invalid credential spec - file:// path must be under %s", base) } bcontents, err := ioutil.ReadFile(full) if err != nil { return "", fmt.Errorf("credential spec '%s' for container %s as the file could not be read: %q", full, id, err) } return string(bcontents[:]), nil } ```
```smalltalk using Microsoft.AspNetCore.Components.WebAssembly.Hosting; using ComponentThirteen; var builder = WebAssemblyHostBuilder.CreateDefault(args); builder.RootComponents.Add<App>("app"); var app = builder.Build(); await app.RunAsync(); ```
```rust #![feature(future_join)] #![feature(min_specialization)] use std::path::Path; use anyhow::{Context, Result}; use clap::Parser; use tracing_subscriber::{layer::SubscriberExt, util::SubscriberInitExt, EnvFilter, Registry}; use turbo_tasks_malloc::TurboMalloc; use turbopack_cli::{arguments::Arguments, register}; use turbopack_trace_utils::{ exit::ExitHandler, raw_trace::RawTraceLayer, trace_writer::TraceWriter, tracing_presets::{ TRACING_OVERVIEW_TARGETS, TRACING_TURBOPACK_TARGETS, TRACING_TURBO_TASKS_TARGETS, }, }; #[global_allocator] static ALLOC: TurboMalloc = TurboMalloc; fn main() { let args = Arguments::parse(); tokio::runtime::Builder::new_multi_thread() .enable_all() .on_thread_stop(|| { TurboMalloc::thread_stop(); }) .build() .unwrap() .block_on(main_inner(args)) .unwrap(); } async fn main_inner(args: Arguments) -> Result<()> { let exit_handler = ExitHandler::listen(); let trace = std::env::var("TURBOPACK_TRACING").ok(); if let Some(mut trace) = trace { // Trace presets match trace.as_str() { "overview" => { trace = TRACING_OVERVIEW_TARGETS.join(","); } "turbopack" => { trace = TRACING_TURBOPACK_TARGETS.join(","); } "turbo-tasks" => { trace = TRACING_TURBO_TASKS_TARGETS.join(","); } _ => {} } let subscriber = Registry::default(); let subscriber = subscriber.with(EnvFilter::builder().parse(trace).unwrap()); let internal_dir = args .dir() .unwrap_or_else(|| Path::new(".")) .join(".turbopack"); std::fs::create_dir_all(&internal_dir) .context("Unable to create .turbopack directory") .unwrap(); let trace_file = internal_dir.join("trace.log"); let trace_writer = std::fs::File::create(trace_file).unwrap(); let (trace_writer, guard) = TraceWriter::new(trace_writer); let subscriber = subscriber.with(RawTraceLayer::new(trace_writer)); exit_handler .on_exit(async move { tokio::task::spawn_blocking(|| drop(guard)).await.unwrap() }); subscriber.init(); } register(); match args { Arguments::Build(args) => turbopack_cli::build::build(&args).await, Arguments::Dev(args) => turbopack_cli::dev::start_server(&args).await, } } ```
Kwon Jung Ho (), also stylised as kwonjungho and Kwon Jungho, is a Korean artist, sculptor, and educator based in Daegu, South Korea. Kwon was influenced by Abstract Expressionism, Neo-Expressionism, and Post-Modernism movements. A majority of artworks in the oeuvre take the shape of the skeleton that reflects the artist's interest in the subject matters of life and death inspired by his physician father from a childhood memory. The pivotal artworks consist of monochrome paintings, dot series, sound series, skeleton series that embrace flat painting and installation, and conception and abstraction. Life and Education The son of a physician, Kwon Jung Ho was born in Chilgok, located in Gyeongsangbuk-do Province, on April 28, 1944. Kwon, born on the verge of the Korea's liberation, grew up in times of social turmoil. In 1950, he enrolled at Suchang Elementary School, but the same year, he fled to Miryang (Yeonjeong) for refuge to escape the Korean War. After graduating from Jongno National School in 1956, from 1959 to 1963, he attended Gyeseong High School where he learned photography from the photography class taught by Kim Tae Han and Her Jong Jeong; nevertheless, Kwon did not aspire to become an artist at that time. After being rejected by a medical college, he entered the Civil and Architecture department at Chunggu University in 1964 for its high value on socially useful work. However, in 1965, Kwon transferred to the Arts and Crafts department at Keimyung University to pursue studies as an art student. He attended lectures by sculptor Nam Chul, craftsman Kim Gwang-Hyun, and painter Seo Seok Gyu. In 1972, Kwon became an apprentice of Professor Jung Joem Sik and calligrapher Seo Dong Gyun who greatly influenced his early works, and the same year, Kwon graduated from the university. In 1975, he married his current wife and had one child. After completing the master's degree in Art Education at Keimyung University from 1973 to 1982, he moved to New York to further his studies in Fine Art at the Pratt Institute, where he obtained a master's degree under the tutelage of Professor Corinne Robbins and Kelvin Albert from 1983 to 1986. Career In 1972, Kwon embarked on his career as an art educator at Gyeongan Middle School in Andong, Oseong High School in Daegu, and Gyeongmyeong Girls' Middle School. With his career background as a lecturer at Hyosung Women's University, Keimyung College, Hansa Technical College, and Shinil College, in 1982, Kwon was appointed as a professor at Daegu University where he worked until 2009. From 1996 to 1999, he served as the president of the Korean Art Association of Daegu Metropolitan City, the vice-president of the Korean Art Association, and the national branch president. In 1997, Kwon and 24 other members who endorsed the local art, academia, press, and cultural community reinforced the Daegu Art Museum construction committee's establishment by implementing a petition and fundraising exhibition to support the museum establishment. From 2002 to 2006, he served as the president of the Korea Federation of Art and Culture Association of Daegu Metropolitan. To this day, Kwon continues to work as a prominent arts administrator and artist. Art From the 1970s to 1980s After completing his military service in 1969, Kwon returned to school with a great interest in abstract art. In the early 1970s, he started his career as an artist at the Cungmok-Hoe founded in 1971, Ijjip-Hoe, and Sinjo-Hoe. Influenced by his mentor Professor Jung Jeon Sik and sculptor Nam Gwan, Kwon mostly created abstract works consist of characters and dots. During this period, he was exposed to artworks by popular foreign artists such as Duchamp and Jasper Jones in Japanese and American magazines and books brought in by the USIS. Amidst the tumultuous years of the inflow of new culture, Kwon also endeavored to discover the essence of art. He created the dots series by drawing and attaching dots in the shapes of holes on changhoji, traditional Korean paper used for doors and windows. In the later period, Kwon stated that his life and culture inspired the dots in his early works. During earlier periods, his interest in Informal abstraction shifted to characters for form and then dots, lines, and planes. In the 1980s, he attempted a conceptual approach towards his artistic practice. As the first attempt, Kwon created 'A Fool's Plastering' in 1981 that embodies the criticism for the absence of history and conceptual meaning in the Korean contemporary art in which the Western art trends prevalently influenced the minimal and monochrome painting styles. From the 1980s to 1990s When Neo-Expressionism and Post-Modernism emerged in the 1980s as powerful movements after Abstract Expressionism, Kwon explored his cultural background and sought the legitimacy of his work. He developed the research on the connection of visceral expression with the oriental spirit rather than a meticulous depiction. Inspired by a discarded speaker on the street, he created sound series that encompassed his reality, and restless and exhausted modern people expressed through the speaker-formed object, quick brushstrokes, and vivid primary colors. In the late 1980s, his work extended from the sound to the skeleton, which was initially used to reveal repugnance toward social inhibition. Kwon created works deeply infused with social malaise and agony in the ordeals of a tumultuous period during the war and transitional society based on the subjects matters of 'incident,' 'night,' 'anger,' 'fear,' and 'death.' In the 1990s, he developed his style of expression by employing bold colors and intense lines. From the 1990s to 2000s In the 1990s, Kwon began to use lines as a distinct expression measure in his works. During this time, the skeleton was depicted with disassembled lines that capture the stream of emotion, consciousness, and energy. The line series Kwon created in the mid-1990s consisted of dynamic streams of lines and a remarkable brushstroke of the line stretched beyond its mere appearance as a line. The lines in his later works demonstrated his attempt to recognize and express cultural identity. In the 2000s, Kwon often used lines that engage objective expressions like figures, everyday scenes, still life, and landscape. From the 2000s to 2010s The real-life events influenced Kwon's works in the 2000s. His concern for social issues since his time abroad profoundly enriched and manifested onto the canvas upon the 'Sangin gas explosion' in Daegu in 1995. During this time, he created simple and abstract lines that involve the narratives of the solitude of everyday life infused in public places like the train station, airport, and central city in Daegu, where people gather to take a trip. Kwon himself was utterly devastated when he lost friends and his disciples from the '2.18 Daegu subway accident' in 2003. He was determined to create 'subway series' to keep a social testimony and record of the incident through his work. In the series, Kwon recorded the disastrous accident scene, infuriated the public, responsible people, the protest, and religion in memorial. He devised and incorporated the paper to contemplate the true image of the accident. Through his careful observation and empathy, Kwon envisioned revealing the reality of society and convey consolation to the local community in distress. Later, he expanded his concerns to social problems such as a rise in the unemployment rate and overflowing individualism. In the extension of these concerns, <Gate through the future> was presented in 2013 and Hong Soon Whan, director of Kunstdoc Gallery, described the work as such: "Kwon has made more than 2300 Dakpaper skulls. Repetition of formation based on handcraft has important meaning that it reminds of process and cycle of death. It is repeated endlessly, but it is just describing the form of death related to the world as an image, not trying to explain the death itself or to supplement the loss of subject. It repeats existential questions repeatedly. So this process of making skulls through complicate process creates skull as an image of death, but the image itself is not a goal but just a kind of carrying out of consideration on existence." Exhibitions 2019 Kwon Jeong-ho retrospect Exhibition(1971-2018), Art &culture Center,no.1.2, Daegu 1985 NY, Artcenter of Bongsan, Daegu Kwon Jeong-ho, Shirota gallery, Tokyo, Japan 2017 Kwon Jeong-ho, Koskun "The noble space and noble flow", Suseong Artpia, Daegu 2015 KWON JUNG-HO "GokSin", O'sGallery, Wanjoo 2014 KWON JUNG-HO Photo Show "Shifted Time",DAEGU PHOTO BIENNALE, SPACE129, Daegu 2013 KWON JUNG-HO "The Mirror of Death Shining on a Life", Cyan Museum, Youngchun Invited show of KWON JUNG-HO, Gallery KUNSTDOC, Seoul Invited show of KWON JUNG-HO, Gallery SOHEON,CONTEMPORARY, Daegu 2020 Made in Daegu II, Daegu Art Museum, Daegu Summon Memorry, Suseoung Artpia, Daegu 2019 Mediacity, Yangpyeong Museum of Art, Yangpyeong Start-up, Suseuong Artpia, Daegu 2018 Fire Art Festival 2018 Pyeongchang Culture Olympics, Korea Culture and Arts Committee, Gangneung Daegu self-portrait of contemporary art (21st anniversary since 1997), midsummer night party, Daegu Culture and Arts Center, Daegu The 34th South Korea International Contemporary Art Festival - From Agglomeration to Momentum, Gallery Joy, Busan Daegu Catholic Artists Rotate, De Mans Gallery, Daegu 2017 Sea Art Festival, Busan Biennale, Busan Daegu's body, Daegu Culture and Arts Center, Daegu Looking at the flow of contemporary art, Yeosu Expo Art Gallery, Yeosu Barcode, Yangpyeong Art Museum, Yangpyeong 2016 Daegu contemporary art, Daegu art & cultural center, Daegu Life Painting Artist, Daegu art & cultural center, Daegu O, DokBulZangGun, Ujong Museum of art, Bosung 2015 ICAPU "Between"_ Empty house project, Ulsan Cultural Street, Ulsan 2014 Daegu Contempory Art Festival-"From Kyungshanggamyeung To Jongno", Daegu Cultural Art Center Museum, Daegu CMCP_Collective Memory Collective Power, Bongsan Art Center, Daegu 2013 Daegu Contempory Art Festival, Power Plant of Creation, Daegu Fashion with Pattern, 63Sky Art Museum, Seoul 2012 Daegu Culture Award- Invitation Exhibit of Prizewinner, Daegu Culture & Art Center, Daegu 2011 KIAF/11-Mirror of time& The gate through Future, Gallery Soheon, COEX, Seoul Light and Spirit of Daegu Art-Now in Daegu, Daegu Invited show of KANG, IK JOONG KWON, JUNG HO JHEON SOO CHEON, Soosung Artphia, Gallery Hoban, Media Holl, Daegu Daegu Art Museum Opening 2nd Tema Exhibition(Life & Culture), Daegu Art Museum, Daegu 2010 Korean Doyen Artists Invitation Exhibit-Korea Art Festival 2010, KINTEX, Ilsan Daegu Art Fair 2010, Daegu EXCO, Daegu Collections In Korea Busan Museum of Art, Busan Bulgwangsa, Seoul Chuncheon Animation Museum, Chuncheon College of Health Sciences, Daegu Cyan Museum of Art, Yongcheon Daegu Art Museum, Daegu Daegu City Hall, Daegu Daegu Culture and Arts Center, Daegu Daegu Opera House, Daegu Daegu Plaza Department Store, Daegu Daegu University Museum, Daegu E-gallery, Wanjoo Kim Daegun Cathedral, Daegu O's gallery, Wanjoo National Museum of Contemporary Art, Seoul Museum of Korean Buddhist Art, Seoul Overseas Murray State University, Murray, USA Shanghai City Hall, Shanghai, China References External links Kwon Jung Ho YouTube : Kwon Jung Ho Abstract expressionist artists Neo-expressionist artists South Korean contemporary artists South Korean painters South Korean sculptors Living people 1944 births
Pleurosoma is a genus in the moth subfamily Arctiinae described by Orfila in 1935. Species Pleurosoma angustata (Möschler, 1878) Guatemala, Panama, Suriname and Venezuela. Pleurosoma perconstrictum (Zerny, 1912) Brazil References Arctiinae Monotypic moth genera
Claire-Louise Bennett is a British writer, living in Galway in Ireland. She has written Pond (2015), which was shortlisted for the Dylan Thomas Prize; and Checkout 19 (2021), which was shortlisted for the Goldsmiths Prize. Biography Bennett grew up in a working-class family in Wiltshire. She studied literature and drama at the University of Roehampton in London. She emigrated from the UK to Galway in Ireland around the turn of the millennium. Publications Novels Short fiction Collections Stories Non-fiction Awards 2013: Winner, The White Review Short Story Prize for "The Lady of the House" 2016: Shortlisted, Dylan Thomas Prize for Pond 2021: Shortlisted, Goldsmiths Prize for Checkout 19 Notes References Living people 21st-century English women writers 21st-century English writers Alumni of the University of Roehampton The New Yorker people Writers from Wiltshire Place of birth missing (living people) Year of birth missing (living people)
```kotlin package com.apollographql.apollo.tooling import com.apollographql.apollo.api.Adapter import com.apollographql.apollo.api.CustomScalarAdapters import com.apollographql.apollo.api.json.JsonReader import com.apollographql.apollo.api.json.JsonWriter internal object VoidAdapter : Adapter<Unit> { override fun fromJson(reader: JsonReader, customScalarAdapters: CustomScalarAdapters): Unit { return Unit } override fun toJson(writer: JsonWriter, customScalarAdapters: CustomScalarAdapters, value: Unit) { writer.nullValue() } } ```
Stefano Gaudenzi (born 27 September 1941) was a former tennis player, mainly specialized in doubles. Biography He won three bronze medals in doubles at the Summer Universiade from 1961 to 1967. He is the uncle of tennis player Andrea Gaudenzi. Achievements References External links 1941 births Living people Italian male tennis players Universiade medalists in tennis Universiade bronze medalists for Italy Medalists at the 1961 Summer Universiade Medalists at the 1963 Summer Universiade Medalists at the 1967 Summer Universiade 20th-century Italian people Sportspeople from Faenza
```go package group // import "github.com/docker/infrakit/pkg/controller/group" import ( "errors" "fmt" "reflect" "sync" "time" "github.com/docker/infrakit/pkg/spi/group" "github.com/docker/infrakit/pkg/spi/instance" ) // TODO(wfarner): Converge this implementation with scaler.go, they share a lot of behavior. type quorum struct { id group.ID scaled Scaled LogicalIDs []instance.LogicalID pollInterval time.Duration stop chan bool } // NewQuorum creates a supervisor for a group of instances operating in a quorum. func NewQuorum(id group.ID, scaled Scaled, logicalIDs []instance.LogicalID, pollInterval time.Duration) Supervisor { return &quorum{ id: id, scaled: scaled, LogicalIDs: logicalIDs, pollInterval: pollInterval, stop: make(chan bool), } } func (q *quorum) PlanUpdate(scaled Scaled, settings groupSettings, newSettings groupSettings) (updatePlan, error) { if !reflect.DeepEqual(settings.config.Allocation.LogicalIDs, newSettings.config.Allocation.LogicalIDs) { return nil, errors.New("Logical ID changes to a quorum is not currently supported") } // Determine how many instances are not at the desired instance configuration instances, err := labelAndList(q.scaled) if err != nil { return nil, err } _, undesired := desiredAndUndesiredInstances(instances, newSettings) if len(undesired) == 0 { // This is a no-op update because the instance configuration is unchanged return &noopUpdate{}, nil } return &rollingupdate{ desc: fmt.Sprintf( "Performing a rolling update on %d instances", len(undesired)), scaled: scaled, updatingFrom: settings, updatingTo: newSettings, stop: make(chan bool), }, nil } func (q *quorum) Stop() { close(q.stop) } func (q *quorum) Run() { ticker := time.NewTicker(q.pollInterval) q.converge() for { select { case <-ticker.C: q.converge() case <-q.stop: ticker.Stop() return } } } func (q *quorum) ID() group.ID { return q.id } func (q *quorum) Size() uint { return uint(len(q.LogicalIDs)) } func (q *quorum) converge() { descriptions, err := labelAndList(q.scaled) if err != nil { log.Error("Failed to check to group", "err", err) return } log.Debug("Found existing instances", "groupID", q.ID(), "descriptions", descriptions, "V", debugV) unknownIPs := []instance.Description{} for _, description := range descriptions { if description.LogicalID == nil { log.Warn("No logical ID", "description", description, "id", description.ID) continue } matched := false for _, expectedID := range q.LogicalIDs { if expectedID == *description.LogicalID { matched = true } } if !matched { unknownIPs = append(unknownIPs, description) } } grp := sync.WaitGroup{} for _, ip := range unknownIPs { unknownInstance := ip log.Warn("Destroying instances with unknown IP address", "instance", unknownInstance) grp.Add(1) go func() { defer grp.Done() q.scaled.Destroy(unknownInstance, instance.Termination) }() } missingIDs := []instance.LogicalID{} for _, expectedID := range q.LogicalIDs { matched := false for _, description := range descriptions { if description.LogicalID == nil { continue } if expectedID == *description.LogicalID { matched = true } } if !matched { missingIDs = append(missingIDs, expectedID) } } for _, missingID := range missingIDs { log.Info("Logical ID is missing, provisioning new instance", "instance", missingID) id := missingID grp.Add(1) go func() { defer grp.Done() q.scaled.CreateOne(&id) }() } grp.Wait() } ```
Viking is a Viking ship replica. It is an exact replica of the Gokstad ship recovered from Gokstadhaugen, a Viking Era burial mound in Sandefjord, Norway in 1880. Viking was featured at the World's Columbian Exposition at Chicago in 1893. History The ship was built at the Rødsverven shipyard in Sandefjord, Norway. The construction was undertaken by Norwegian shipyard and ship-owner Christen Christensen together with Ole Wegger (1859-1936) director of Framnæs Mekaniske Værksted. The ship was christened Viking. The ship was sailed by Captain Magnus Andersen (1857-1938) and a crew of 11 from Bergen, Norway. Viking sailed to North America, via Newfoundland and New York, up the Hudson River, through the Erie Canal and into the Great Lakes to Chicago, where the World's Columbian Exposition was taking place in 1893 to commemorate the discovery of America by Columbus. Carter Harrison, Sr., Chicago's four-term mayor, boarded and took command for the last leg of the voyage, arriving at Jackson Park on Wednesday, July 12, 1893 to much fanfare. After the 1893 Exposition, Viking sailed down the Mississippi to New Orleans and wintered there. On her return to Chicago, Viking was first located beside the Field Columbian Museum (now the Museum of Science and Industry) in Chicago, then placed in Lincoln Park under a fenced-in, wooden shelter, where it was neglected and covered in pigeon guano for decades. In 1920, the ship was restored by the Federation of Norwegian Women's Societies. In 1925, to publicize and promote the Norse-American Centennial in St. Paul, Minnesota, a set of United States Postage Stamps were issued. The event honored the 100th anniversary of Norwegian immigration to the United States. One of the stamps featured a picture of Viking based upon a photograph taken in 1893. The engravers included the American flag waving from the bow. Current display In 1994, Viking was moved from its location to make room for expansion of the Lincoln Park Zoo. With funds raised from the Scandinavian-American community, the ship was moved into a warehouse in West Chicago, and then to Good Templar Park in Geneva, Illinois, and secured under a canopy. The head and tail of Viking were placed in storage at the Chicago Museum of Science and Industry. In 2007, Landmarks Illinois listed the ship as one of the 10 most endangered landmarks in Illinois. In 2008, Preservation Partners of the Fox Valley was recognized by Landmarks Illinois and the Richard H. Driehaus Foundation for fund raising efforts resulting in stabilization of the ship. That same year, funds for preservation were awarded by American Express in partnership with the National Trust for Historic Preservation. In 2012, trusteeship of Viking was transferred from the Chicago Park District to Friends of the Viking Ship, which had been established to further the preservation effort. Docent-led tours are offered on scheduled dates during the months of April through October. In 2013 and 2014, stabilization efforts and exhibit improvements were made. Additional keel supports were installed in 2014. A further step in the stabilization effort will be to clean, treat, and seal all of Vikings thousands of rivets. Images See also Íslendingur: a later Viking replica ship to travel across the Atlantic 'Viking (replica Viking longship): Also on display at the World's Columbian Exposition References External links Friends of the Viking Ship website Landmarks Illinois - Statewide Endangered Archive 2007 American Express - Partners In Preservation Geneva, Illinois Buildings and structures in Kane County, Illinois Replicas of Viking ships Ships built in Sandefjord Ships of Norway Norwegian-American culture Historic preservation in the United States World's Columbian Exposition
Tot Island () is a small island lying just north of the northeast end of Lahille Island, off the west coast of Graham Land. First charted by the British Graham Land Expedition (BGLE) under Rymill, 1934–37. So named by the United Kingdom Antarctic Place-Names Committee (UK-APC) in 1959 because the island is very small. See also List of Antarctic and sub-Antarctic islands Islands of Graham Land Graham Coast
```python # # QR Code generator Distutils script (Python) # # path_to_url # # 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. # import setuptools setuptools.setup( name = "qrcodegen", description = "High quality QR Code generator library for Python", version = "1.8.0", platforms = "OS Independent", python_requires = '>=3', author = "Project Nayuki", author_email = "me@nayuki.io", url = "path_to_url", classifiers = [ "Development Status :: 5 - Production/Stable", "Intended Audience :: Developers", "Intended Audience :: Information Technology", "Operating System :: OS Independent", "Programming Language :: Python", "Programming Language :: Python :: 3", "Topic :: Multimedia :: Graphics", "Topic :: Software Development :: Libraries :: Python Modules", ], long_description = """========================= QR Code generator library ========================= Introduction ------------ This project aims to be the best, clearest QR Code generator library. The primary goals are flexible options and absolute correctness. Secondary goals are compact implementation size and good documentation comments. Home page with live JavaScript demo, extensive descriptions, and competitor comparisons: path_to_url Features -------- Core features: * Significantly shorter code but more documentation comments compared to competing libraries * Supports encoding all 40 versions (sizes) and all 4 error correction levels, as per the QR Code Model 2 standard * Output format: Raw modules/pixels of the QR symbol * Detects finder-like penalty patterns more accurately than other implementations * Encodes numeric and special-alphanumeric text in less space than general text Manual parameters: * User can specify minimum and maximum version numbers allowed, then library will automatically choose smallest version in the range that fits the data * User can specify mask pattern manually, otherwise library will automatically evaluate all 8 masks and select the optimal one * User can specify absolute error correction level, or allow the library to boost it if it doesn't increase the version number * User can create a list of data segments manually and add ECI segments More information about QR Code technology and this library's design can be found on the project home page. Examples -------- :: from qrcodegen import * # Simple operation qr0 = QrCode.encode_text("Hello, world!", QrCode.Ecc.MEDIUM) svg = to_svg_str(qr0, 4) # See qrcodegen-demo # Manual operation segs = QrSegment.make_segments("3141592653589793238462643383") qr1 = QrCode.encode_segments(segs, QrCode.Ecc.HIGH, 5, 5, 2, False) for y in range(qr1.get_size()): for x in range(qr1.get_size()): (... paint qr1.get_module(x, y) ...) More complete set of examples: path_to_url .""", py_modules = ["qrcodegen"], ) ```
```xml import React, { FunctionComponent } from "react"; import { HorizontalGutter } from "coral-ui/components/v2"; import styles from "./FlagDetailsCategory.css"; interface Props { category: React.ReactNode; children?: React.ReactNode; } const FlagDetailsCategory: FunctionComponent<Props> = ({ category, children, }) => { return ( <HorizontalGutter size="half"> <p className={styles.category}>{category}</p> <HorizontalGutter size="half">{children}</HorizontalGutter> </HorizontalGutter> ); }; export default FlagDetailsCategory; ```
```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 deltatracker import ( "fmt" "reflect" "github.com/sirupsen/logrus" ) // DeltaTracker (conceptually) tracks the differences between two key/value maps // the "desired" map contains the KV-pairs that we _want_ to be in the // dataplane; the "dataplane" map contains the KV-pairs that we think are // _actually_ in the dataplane. The name "dataplane" map is intended to hint at // its use but(!) this is a pure in-memory datastructure; it doesn't actually // interact with the dataplane directly. // // The desired and dataplane maps are exposed via the Desired() and Dataplane() // methods, which each return a similar map API featuring Set(...) Get(...) // Delete() and Iter(...). The dataplane map view has an additional // ReplaceAllIter method, which allows for the whole contents of the // dataplane map to be replaced via an iterator; this is more efficient than // doing an external iteration and Set/Delete calls. // // In addition to the desired and dataplane maps, the differences between them // are continuously tracked in two other maps: the "pending updates" map and // the "pending deletions" map. "Pending updates" contains all keys that are // in the "desired" map but not in the dataplane map (or that have a different // value in the desired map vs the dataplane map). "Pending deletions" contains // keys that are in the dataplane map but not in the desired map. The // pending maps are exposed via the IterPendingUpdates and IterPendingDeletions // methods. // // Note: it is not safe to mutate keys/values that are stored in a DeltaTracker // because it would corrupt the internal state. Surprisingly(!), it is also // unsafe to delete a key, modify the value and then re-insert the value! This // is because (as an occupancy optimisation) the DeltaTracker aliases the // Desired and Dataplane values if they happen to be equal. So, to safely // mutate a value, you must take a copy, mutate the copy and re-insert the // copy. type DeltaTracker[K comparable, V any] struct { // To reduce occupancy, we treat the set of KVs in the dataplane and in the // desired state like a Venn diagram, and we only store each region once // (with the caveat below[1]). // // Desired In-dataplane // ____ ____ // / \ / \ // / X \ // / / \ \ // | o | o | o---- inDataplaneNotDesired // \ | \ X / // \ | X \ / // \_|__/ \_\__/ // / \ // desiredUpdates inDataplaneAndDesired // // We can then reconstruct the desired and dataplane states as follows: // // desired state = inDataplaneAndDesired + desiredUpdates // actual state of dataplane = inDataplaneAndDesired + inDataplaneNotDesired // // When we're told about an update to the dataplane (for example during a resync), // we may need to shuffle KVs between the different sets. // // [1] A key can only appear in one of the inDataplaneXXX maps at a time. // However, the desiredUpdates map may contain a key that also exists in one // of the other maps if and only if the value in desiredUpdates differs from // that in the other map. This means that the KV is in the dataplane, but it // has the wrong value, and it needs to be updated. inDataplaneAndDesired map[K]V inDataplaneNotDesired map[K]V desiredUpdates map[K]V desiredLen int // valuesEqual is the comparison function for the value type, it defaults to // reflect.DeepEqual. valuesEqual func(a, b V) bool logCtx *logrus.Entry } type Option[K comparable, V any] func(tracker *DeltaTracker[K, V]) func WithValuesEqualFn[K comparable, V any](f func(a, b V) bool) Option[K, V] { return func(tracker *DeltaTracker[K, V]) { tracker.valuesEqual = f } } func WithLogCtx[K comparable, V any](lc *logrus.Entry) Option[K, V] { return func(tracker *DeltaTracker[K, V]) { tracker.logCtx = lc } } func New[K comparable, V any](opts ...Option[K, V]) *DeltaTracker[K, V] { var valueZero V valType := reflect.TypeOf(valueZero) if valType != nil && valType.Kind() == reflect.Map { // Storing a map as the value is particularly confusing. Even if // the caller does Desired().Delete(k) to remove the mapping, we may // keep hold of the same map in the inDataplaneNotDesired map resulting // in aliasing. logrus.Panic("Map values should not be used in a DeltaTracker.") } cm := &DeltaTracker[K, V]{ inDataplaneAndDesired: make(map[K]V), inDataplaneNotDesired: make(map[K]V), desiredUpdates: make(map[K]V), valuesEqual: func(a, b V) bool { return reflect.DeepEqual(a, b) }, logCtx: logrus.WithFields(nil), } for _, o := range opts { o(cm) } return cm } type DesiredView[K comparable, V any] DeltaTracker[K, V] func (c *DeltaTracker[K, V]) Desired() *DesiredView[K, V] { return (*DesiredView[K, V])(c) } // Set sets the desired state of the given key to the given value. If the value differs from what // the dataplane cache records as being in the dataplane, the update is added to the pending updates set. // Removes the key from the pending deletions set. func (c *DesiredView[K, V]) Set(k K, v V) { if logrus.GetLevel() >= logrus.DebugLevel { c.logCtx.WithFields(logrus.Fields{"k": k, "v": v}).Debug("Set") } currentVal, presentInDP := c.inDataplaneNotDesired[k] if presentInDP { // Key was present in dataplane, but, previously it wasn't desired; move the dataplane KV from // the "not desired" map to the "desired map". c.inDataplaneAndDesired[k] = currentVal delete(c.inDataplaneNotDesired, k) c.desiredLen++ } else { // Didn't find the key in the "not-desired" map, check the "desired" map. currentVal, presentInDP = c.inDataplaneAndDesired[k] } // Check if we think we need to update the dataplane as a result. if !presentInDP { if _, presentInDesired := c.desiredUpdates[k]; !presentInDesired { // New key, increment our count. c.desiredLen++ } } else if c.valuesEqual(currentVal, v) { // Dataplane already agrees with the new value so clear any pending update. c.logCtx.Debug("Set: Key in dataplane already, ignoring.") delete(c.desiredUpdates, k) return } // Either key is not in the dataplane, or the value associated with it is not as desired. // Queue up an update. c.desiredUpdates[k] = v } // Get gets a single value from the desired map. func (c *DesiredView[K, V]) Get(k K) (V, bool) { if v, ok := c.desiredUpdates[k]; ok { return v, ok } v, ok := c.inDataplaneAndDesired[k] return v, ok } // Delete deletes the given key from the desired state of the dataplane. If the KV is in the dataplane // cache, it is added to the pending deletions set. Removes the key from the pending updates set. func (c *DesiredView[K, V]) Delete(k K) { if logrus.GetLevel() >= logrus.DebugLevel { c.logCtx.WithFields(logrus.Fields{"k": k}).Debug("Delete (desired)") } _, presentInDesired := c.desiredUpdates[k] if presentInDesired { // Key was present. delete(c.desiredUpdates, k) } // Check if we need to update the dataplane. currentVal, presentInDPDesired := c.inDataplaneAndDesired[k] if presentInDPDesired { // Value is in dataplane, move it to pending deletions. c.inDataplaneNotDesired[k] = currentVal delete(c.inDataplaneAndDesired, k) } if presentInDesired || presentInDPDesired { // Key was present, decrement the count. c.desiredLen-- } } // DeleteAll deletes all entries from the in-memory desired state, updating pending updates/deletions // accordingly. func (c *DesiredView[K, V]) DeleteAll() { c.logCtx.Debug("DeleteAll") c.Iter(func(k K, v V) { c.Delete(k) }) } // Iter iterates over the desired KVs. func (c *DesiredView[K, V]) Iter(f func(k K, v V)) { for k, v := range c.desiredUpdates { f(k, v) } for k, v := range c.inDataplaneAndDesired { if _, ok := c.desiredUpdates[k]; ok { continue } f(k, v) } } func (c *DesiredView[K, V]) Len() int { return c.desiredLen } type DataplaneView[K comparable, V any] DeltaTracker[K, V] func (c *DeltaTracker[K, V]) Dataplane() *DataplaneView[K, V] { return (*DataplaneView[K, V])(c) } // ReplaceAllMap replaces the state of the dataplane map with the KVs from // dpKVs; the input map is not modified or retained. The pending update and deletion // tracking is updated accordingly. func (c *DataplaneView[K, V]) ReplaceAllMap(dpKVs map[K]V) { err := c.ReplaceAllIter(func(f func(k K, v V)) error { for k, v := range dpKVs { f(k, v) } return nil }) if err != nil { // Should be impossible to hit because ReplaceAllIter only returns errors // from the iterator. c.logCtx.WithError(err).Panic("Unexpected error from ReplaceAllIter") } } // ReplaceAllIter clears the dataplane cache and replaces its contents with the KVs returned // by the iterator. The pending update and deletion tracking is updated accordingly. // // Only returns an error if the iterator returns an error. In case of error, the dataplane state is // partially updated with the keys that have already been seen. func (c *DataplaneView[K, V]) ReplaceAllIter(iter func(func(k K, v V)) error) error { c.logCtx.Debug("Loading cache of dataplane state.") // To reduce occupancy and to do the update in one pass, we use the old maps as scratch space. // As we iterate over the new values, we add them to the newXXX maps and delete them from the old. // Then, at the end, the oldXXX maps will contain only the values that are now missing from the // dataplane, we then handle those at the bottom. oldInDPDesired := c.inDataplaneAndDesired newInDPDesired := make(map[K]V) oldInDPNotDesired := c.inDataplaneNotDesired newInDPNotDesired := make(map[K]V) err := iter(func(k K, v V) { // Figure out if we _want_ it to exist and tee up update/deletion accordingly. if desiredV, desired := c.asDesiredView().Get(k); desired { // Record that this key exists in the new copy of the cache. newInDPDesired[k] = v // Check if the value is correct, if c.valuesEqual(desiredV, v) { // Value in dataplane is correct, clean up any pending update. delete(c.desiredUpdates, k) } else { // Value in dataplane is incorrect. Queue up an update (if there isn't one already). c.desiredUpdates[k] = desiredV } } else { // We don't want this key, but it's in the dataplane. Queue up deletion. newInDPNotDesired[k] = v } // Remove the key from the old cache, we'll then scan the old cache to find keys that are missing. delete(oldInDPDesired, k) delete(oldInDPNotDesired, k) }) if err != nil { // We may have failed mid-iteration, if we just returned an error here, we'd leave our internal // state broken because we've removed all the keys that we've seen from oldInDPDesired and // oldInDPNotDesired, and updated c.desiredUpdates to match the new KV's from the iterator. // Fix that up by applying the new keys to the old in-DP maps: for k, v := range newInDPDesired { oldInDPDesired[k] = v } for k, v := range newInDPNotDesired { oldInDPNotDesired[k] = v } return fmt.Errorf("failed to iterate over dataplane state: %w", err) } // oldInDPDesired now only contains KVs that we _thought_ were in the dataplane but are now gone. for k := range oldInDPDesired { if desiredV, desired := c.asDesiredView().Get(k); desired { // We want this key, but it's missing, queue up an add. c.desiredUpdates[k] = desiredV } // else we don't want it, and it's gone; nothing to do. delete(oldInDPDesired, k) } // Now done with oldInDPDesired, replace it. c.inDataplaneAndDesired = newInDPDesired c.inDataplaneNotDesired = newInDPNotDesired c.logCtx.WithFields(logrus.Fields{ "totalNumInDP": len(c.inDataplaneAndDesired), "desiredUpdates": len(c.desiredUpdates), "inDataplaneNotDesired": len(c.inDataplaneNotDesired), }).Debug("Updated dataplane state.") return nil } // Set updates a key in the dataplane cache. I.e. it tells this tracker that the dataplane // has the given KV. Updated the pending update/deletion set if the new KV differs from what is // desired. func (c *DataplaneView[K, V]) Set(k K, v V) { desiredV, desired := c.asDesiredView().Get(k) if desired { // Dataplane key has a corresponding desired key. Check if the values match. c.inDataplaneAndDesired[k] = v if !c.valuesEqual(desiredV, v) { // Desired value is different, queue up an update. c.desiredUpdates[k] = desiredV } else { delete(c.desiredUpdates, k) } } else { // Dataplane key has no corresponding desired key, queue up a deletion. c.inDataplaneNotDesired[k] = v } } // Delete deletes a key from the dataplane cache. I.e. it tells this tracker that the key // no longer exists in the dataplane. func (c *DataplaneView[K, V]) Delete(k K) { desiredV, desired := c.asDesiredView().Get(k) delete(c.inDataplaneAndDesired, k) delete(c.inDataplaneNotDesired, k) if desired { // We've now been told this KV is not in the dataplane but the desired state says it should be there. c.desiredUpdates[k] = desiredV } } func (c *DataplaneView[K, V]) DeleteAll() { c.ReplaceAllMap(nil) } // Iter iterates over the cache of the dataplane. func (c *DataplaneView[K, V]) Iter(f func(k K, v V)) { for k, v := range c.inDataplaneAndDesired { f(k, v) } for k, v := range c.inDataplaneNotDesired { f(k, v) } } func (c *DataplaneView[K, V]) Len() int { return len(c.inDataplaneNotDesired) + len(c.inDataplaneAndDesired) } // Get gets a single value from the cache of the dataplane. The cache must have previously been // loaded with a successful call to LoadCacheFromDataplane() or one of the ApplyXXX methods. func (c *DataplaneView[K, V]) Get(k K) (V, bool) { v, ok := c.inDataplaneAndDesired[k] if !ok { v, ok = c.inDataplaneNotDesired[k] } return v, ok } func (c *DataplaneView[K, V]) asDesiredView() *DesiredView[K, V] { return (*DesiredView[K, V])(c) } type IterAction int const ( IterActionNoOp IterAction = iota IterActionUpdateDataplane IterActionNoOpStopIteration ) type PendingUpdatesView[K comparable, V any] DeltaTracker[K, V] func (c *DeltaTracker[K, V]) PendingUpdates() *PendingUpdatesView[K, V] { return (*PendingUpdatesView[K, V])(c) } func (c *PendingUpdatesView[K, V]) Get(k K) (V, bool) { v, ok := c.desiredUpdates[k] return v, ok } // Iter iterates over the pending updates. If the passed in function returns // IterActionUpdateDataplane then the pending update is cleared, and, the KV is applied // to the dataplane cache (as if the function had called Dataplane().Set(k, v)). func (c *PendingUpdatesView[K, V]) Iter(f func(k K, v V) IterAction) { for k, v := range c.desiredUpdates { updateDataplane := f(k, v) switch updateDataplane { case IterActionNoOp: // Ignore. case IterActionUpdateDataplane: delete(c.desiredUpdates, k) c.inDataplaneAndDesired[k] = v case IterActionNoOpStopIteration: break } } } func (c *PendingUpdatesView[K, V]) Len() int { return len(c.desiredUpdates) } func (c *DeltaTracker[K, V]) InSync() bool { return c.PendingDeletions().Len() == 0 && c.PendingUpdates().Len() == 0 } type PendingDeletionsView[K comparable, V any] DeltaTracker[K, V] func (c *DeltaTracker[K, V]) PendingDeletions() *PendingDeletionsView[K, V] { return (*PendingDeletionsView[K, V])(c) } func (c *PendingDeletionsView[K, V]) Get(k K) (V, bool) { v, ok := c.inDataplaneNotDesired[k] return v, ok } // Iter iterates over the pending deletion set. If the passed in function returns // IterActionUpdateDataplane then the pending deletion is cleared, and, the KV is applied // to the dataplane cache (as if the function had called Dataplane().Delete(k)). func (c *PendingDeletionsView[K, V]) Iter(f func(k K) IterAction) { for k := range c.inDataplaneNotDesired { updateDataplane := f(k) switch updateDataplane { case IterActionNoOp: // Ignore. case IterActionUpdateDataplane: delete(c.inDataplaneNotDesired, k) case IterActionNoOpStopIteration: break } } } func (c *PendingDeletionsView[K, V]) Len() int { return len(c.inDataplaneNotDesired) } ```
White Stone may refer to: White Stone (ski store), a British sports retailer White Stone, South Carolina, an unincorporated community in Spartanburg County White Stone, Virginia, a town in Lancaster County White Stone Lake, a lake in Chisago County, Minnesota See also Whitestone (disambiguation) White Stones, a 1997 album by Secret Garden
Drozdowo () is a village in the administrative district of Gmina Rymań, within Kołobrzeg County, West Pomeranian Voivodeship, in north-western Poland. It lies approximately north of Rymań, south of Kołobrzeg, and north-east of the regional capital Szczecin. For the history of the region, see History of Pomerania. The village has a population of 551. References Villages in Kołobrzeg County
Jordaan may refer to: Places Jordaan, a neighbourhood in the city of Amsterdam, Netherlands, part of the borough of Amsterdam-Centrum Johnny Jordaan Square (Johnny Jordaanplein) a square in the city of Amsterdam Persons Given name Jordaan Brown (born 1992), Jamaican football player Jordaan Clarke, part of a key case Clarke v. Oregon Health & Sciences University Surname Andrew Jordaan, South African cricketer Arno Jordaan, South African Afrikaans singer and songwriter Danny Jordaan (born 1951), president of the South African Football Association (SAFA), lecturer, politician and anti-apartheid activist Henno Jordaan (born 1988), South African cricketer Johnny Jordaan, artistic name for Johannes Hendricus van Musscher (1924–1989), Dutch singer of popular music, in particular the genre known as levenslied Paul Jordaan (born 1992), South African rugby union player Theuns Jordaan (1971–2021), South African singer and songwriter Zandré Jordaan (born 1987), South African rugby union player Others Jordaan v Verwey, an important case in the South African law of lease See also Jordan (disambiguation)
```go package main import ( "bytes" "encoding/binary" "encoding/gob" "encoding/json" "flag" "fmt" "log" "os" "os/signal" "runtime/pprof" "time" "github.com/uber-common/cpustat/lib" "github.com/uber/tchannel-go" "github.com/uber/tchannel-go/raw" ) func main() { var fetchCount = flag.Int("c", 300, "number of samples to summarize") var hostPort = flag.String("host", "127.0.0.1:1971", "hostport to fetch samples from") var cpuprofile = flag.String("cpuprofile", "", "write cpu profile to file") var memprofile = flag.String("memprofile", "", "write memory profile to this file") flag.Parse() if *cpuprofile != "" { f, err := os.Create(*cpuprofile) if err != nil { log.Fatal(err) } if err = pprof.StartCPUProfile(f); err != nil { log.Fatal(err) } } sigChan := make(chan os.Signal, 1) signal.Notify(sigChan, os.Interrupt) go func() { <-sigChan if *cpuprofile != "" { pprof.StopCPUProfile() } if *memprofile != "" { f, err := os.Create(*memprofile) if err != nil { log.Fatal(err) } pprof.WriteHeapProfile(f) f.Close() } os.Exit(0) }() ch, err := tchannel.NewChannel("cpustat", nil) if err != nil { log.Fatalf("NewChannel failed: %v", err) } ctx, cancel := tchannel.NewContext(5 * time.Second) defer cancel() sendCount := make([]byte, 4) binary.LittleEndian.PutUint32(sendCount, uint32(*fetchCount)) _, arg3, _, err := raw.Call(ctx, ch, *hostPort, "cpustat", "readSamples", nil, sendCount) if err != nil { panic(err) } buf := bytes.NewBuffer(arg3) dec := gob.NewDecoder(buf) var when time.Time err = dec.Decode(&when) var infoMap cpustat.ProcInfoMap err = dec.Decode(&infoMap) var interval uint32 err = dec.Decode(&interval) var recvCount uint32 err = dec.Decode(&recvCount) procSum := newProcSum(interval, infoMap) for i := uint32(0); i < recvCount; i++ { var procList []cpustat.ProcSample var sys cpustat.SystemStats err = dec.Decode(&procList) err = dec.Decode(&sys) procSum.update(procList, &sys) } procSum.summarize() if *cpuprofile != "" { pprof.StopCPUProfile() } } type procSummary struct { infoMap cpustat.ProcInfoMap procCur []cpustat.ProcSample procPrev []cpustat.ProcSample procSum cpustat.ProcSampleMap procDelta cpustat.ProcSampleMap procHist cpustat.ProcStatsHistMap taskHist cpustat.TaskStatsHistMap sysCur *cpustat.SystemStats sysPrev *cpustat.SystemStats sysSum *cpustat.SystemStats sysDelta *cpustat.SystemStats sysHist *cpustat.SystemStatsHist Interval uint32 Samples uint32 } func newProcSum(interval uint32, infoMap cpustat.ProcInfoMap) *procSummary { ret := procSummary{} ret.infoMap = infoMap ret.procSum = make(cpustat.ProcSampleMap) ret.procDelta = make(cpustat.ProcSampleMap) ret.procHist = make(cpustat.ProcStatsHistMap) ret.taskHist = make(cpustat.TaskStatsHistMap) ret.sysCur = &cpustat.SystemStats{} ret.sysPrev = &cpustat.SystemStats{} ret.sysSum = &cpustat.SystemStats{} ret.sysDelta = &cpustat.SystemStats{} ret.sysHist = cpustat.NewSysStatsHist() ret.Interval = interval return &ret } func (p *procSummary) update(procSamples []cpustat.ProcSample, sys *cpustat.SystemStats) { if p.Samples == 0 { p.procPrev = procSamples p.sysPrev = sys } else { p.procCur = procSamples cur := cpustat.ProcSampleList{p.procCur, uint32(len(p.procCur))} prev := cpustat.ProcSampleList{p.procPrev, uint32(len(p.procPrev))} cpustat.ProcStatsRecord(p.Interval, cur, prev, p.procSum, p.procDelta) cpustat.TaskStatsRecord(p.Interval, cur, prev, p.procSum, p.procDelta) cpustat.UpdateProcStatsHist(p.procHist, p.procDelta) cpustat.UpdateTaskStatsHist(p.taskHist, p.procDelta) p.procPrev = p.procCur p.sysCur = sys p.sysDelta = cpustat.SystemStatsRecord(p.Interval, p.sysCur, p.sysPrev, p.sysSum) cpustat.UpdateSysStatsHist(p.sysHist, p.sysDelta) p.sysPrev = p.sysCur } p.Samples++ } type sysJSON struct { Samples uint64 UsrMin float64 UsrMax float64 UsrAvg float64 UsrP95 float64 NiceMin float64 NiceMax float64 NiceAvg float64 NiceP95 float64 SysMin float64 SysMax float64 SysAvg float64 SysP95 float64 IdleMin float64 IdleMax float64 IdleAvg float64 IdleP95 float64 IowaitMin float64 IowaitMax float64 IowaitAvg float64 IowaitP95 float64 ProcsTotalMin float64 ProcsTotalMax float64 ProcsTotalAvg float64 ProcsTotalP95 float64 ProcsRunningMin float64 ProcsRunningMax float64 ProcsRunningAvg float64 ProcsRunningP95 float64 ProcsBlockedMin float64 ProcsBlockedMax float64 ProcsBlockedAvg float64 ProcsBlockedP95 float64 } type procJSONEntry struct { Samples uint64 Pid uint64 Ppid uint64 Nice int64 Comm string Cmdline []string Numthreads uint64 RSS uint64 UsrMin float64 UsrMax float64 UsrAvg float64 UsrP95 float64 SysMin float64 SysMax float64 SysAvg float64 SysP95 float64 CUSMin float64 CUSMax float64 CUSAvg float64 CUSP95 float64 RunQAvg float64 RunQCount uint64 IOWAvg float64 IOWCount uint64 SwapAvg float64 SwapCount uint64 Vcsw uint64 Ivcsw uint64 } type sumJSON struct { Sys sysJSON Proc []procJSONEntry } func (p *procSummary) summarize() { out := sumJSON{} out.Sys.Samples = uint64(p.sysHist.Usr.TotalCount()) out.Sys.UsrMin = float64(p.sysHist.Usr.Min()) out.Sys.UsrMax = float64(p.sysHist.Usr.Max()) out.Sys.UsrAvg = p.sysHist.Usr.Mean() out.Sys.UsrP95 = float64(p.sysHist.Usr.ValueAtQuantile(95)) out.Sys.NiceMin = float64(p.sysHist.Nice.Min()) out.Sys.NiceMax = float64(p.sysHist.Nice.Max()) out.Sys.NiceAvg = p.sysHist.Nice.Mean() out.Sys.NiceP95 = float64(p.sysHist.Nice.ValueAtQuantile(95)) out.Sys.SysMin = float64(p.sysHist.Sys.Min()) out.Sys.SysMax = float64(p.sysHist.Sys.Max()) out.Sys.SysAvg = p.sysHist.Sys.Mean() out.Sys.SysP95 = float64(p.sysHist.Sys.ValueAtQuantile(95)) out.Sys.IdleMin = float64(p.sysHist.Idle.Min()) out.Sys.IdleMax = float64(p.sysHist.Idle.Max()) out.Sys.IdleAvg = p.sysHist.Idle.Mean() out.Sys.IdleP95 = float64(p.sysHist.Idle.ValueAtQuantile(95)) out.Sys.IowaitMin = float64(p.sysHist.Iowait.Min()) out.Sys.IowaitMax = float64(p.sysHist.Iowait.Max()) out.Sys.IowaitAvg = p.sysHist.Iowait.Mean() out.Sys.IowaitP95 = float64(p.sysHist.Iowait.ValueAtQuantile(95)) out.Sys.ProcsTotalMin = float64(p.sysHist.ProcsTotal.Min()) out.Sys.ProcsTotalMax = float64(p.sysHist.ProcsTotal.Max()) out.Sys.ProcsTotalAvg = p.sysHist.ProcsTotal.Mean() out.Sys.ProcsTotalP95 = float64(p.sysHist.ProcsTotal.ValueAtQuantile(95)) out.Sys.ProcsRunningMin = float64(p.sysHist.ProcsRunning.Min()) out.Sys.ProcsRunningMax = float64(p.sysHist.ProcsRunning.Max()) out.Sys.ProcsRunningAvg = p.sysHist.ProcsRunning.Mean() out.Sys.ProcsRunningP95 = float64(p.sysHist.ProcsRunning.ValueAtQuantile(95)) out.Sys.ProcsBlockedMin = float64(p.sysHist.ProcsBlocked.Min()) out.Sys.ProcsBlockedMax = float64(p.sysHist.ProcsBlocked.Max()) out.Sys.ProcsBlockedAvg = p.sysHist.ProcsBlocked.Mean() out.Sys.ProcsBlockedP95 = float64(p.sysHist.ProcsBlocked.ValueAtQuantile(95)) out.Proc = make([]procJSONEntry, 0, len(p.procSum)) for pid, sum := range p.procSum { info, ok := p.infoMap[pid] if ok == false { panic(fmt.Sprint("missing procInfo for", pid)) } hist, ok := p.procHist[pid] if ok == false { panic(fmt.Sprint("missing procHist for", pid)) } entry := procJSONEntry{} entry.Pid = info.Pid entry.Comm = info.Comm entry.Ppid = info.Ppid entry.Nice = info.Nice entry.Cmdline = info.Cmdline entry.RSS = sum.Proc.Rss entry.Numthreads = sum.Proc.Numthreads entry.Samples = uint64(hist.Ustime.TotalCount()) entry.UsrMin = float64(hist.Utime.Min()) entry.UsrMax = float64(hist.Utime.Max()) entry.UsrAvg = hist.Utime.Mean() entry.UsrP95 = float64(hist.Utime.ValueAtQuantile(95)) entry.SysMin = float64(hist.Stime.Min()) entry.SysMax = float64(hist.Stime.Max()) entry.SysAvg = hist.Stime.Mean() entry.SysP95 = float64(hist.Stime.ValueAtQuantile(95)) entry.CUSMin = float64(hist.Ustime.Min()) entry.CUSMax = float64(hist.Ustime.Max()) entry.CUSAvg = hist.Ustime.Mean() entry.CUSP95 = float64(hist.Ustime.ValueAtQuantile(95)) entry.RunQAvg = float64(sum.Task.Cpudelaytotal) entry.RunQCount = sum.Task.Cpudelaycount entry.IOWAvg = float64(sum.Task.Blkiodelaytotal) entry.IOWCount = sum.Task.Blkiodelaycount entry.SwapAvg = float64(sum.Task.Swapindelaytotal) entry.SwapCount = sum.Task.Swapindelaycount out.Proc = append(out.Proc, entry) } b, err := json.Marshal(out) if err != nil { panic(err) } fmt.Println(string(b)) } func summarizeSys(allSamples []cpustat.SystemStats) { sum := cpustat.SystemStats{} hist := cpustat.NewSysStatsHist() for pos := len(allSamples) - 1; pos >= 1; pos-- { delta := cpustat.SystemStatsRecord(200, &allSamples[pos-1], &allSamples[pos], &sum) cpustat.UpdateSysStatsHist(hist, delta) } fmt.Println("Idle: ", hist.Idle.Min(), hist.Idle.Max(), hist.Idle.Mean(), hist.Idle.ValueAtQuantile(50), hist.Idle.ValueAtQuantile(90), hist.Idle.ValueAtQuantile(99)) fmt.Println("Usr: ", hist.Usr.Min(), hist.Usr.Max(), hist.Usr.Mean(), hist.Usr.ValueAtQuantile(50), hist.Usr.ValueAtQuantile(90), hist.Usr.ValueAtQuantile(99)) fmt.Println("Sys: ", hist.Sys.Min(), hist.Sys.Max(), hist.Sys.Mean(), hist.Sys.ValueAtQuantile(50), hist.Sys.ValueAtQuantile(90), hist.Sys.ValueAtQuantile(99)) fmt.Println("Nice: ", hist.Nice.Min(), hist.Nice.Max(), hist.Nice.Mean(), hist.Nice.ValueAtQuantile(50), hist.Nice.ValueAtQuantile(90), hist.Nice.ValueAtQuantile(99)) fmt.Println("IOWait: ", hist.Iowait.Min(), hist.Iowait.Max(), hist.Iowait.Mean(), hist.Iowait.ValueAtQuantile(50), hist.Iowait.ValueAtQuantile(90), hist.Iowait.ValueAtQuantile(99)) } func fetchSamples(hostPort string, count int) { ch, err := tchannel.NewChannel("cpustat", nil) if err != nil { log.Fatalf("NewChannel failed: %v", err) } ctx, cancel := tchannel.NewContext(100 * time.Millisecond) defer cancel() sendCount := make([]byte, 4) binary.LittleEndian.PutUint32(sendCount, 10) _, arg3, _, err := raw.Call(ctx, ch, hostPort, "cpustat", "readSamples", nil, sendCount) if err != nil { panic(err) } buf := bytes.NewBuffer(arg3) dec := gob.NewDecoder(buf) var when time.Time err = dec.Decode(&when) var infoMap cpustat.ProcInfoMap err = dec.Decode(&infoMap) fmt.Println("pidlist", infoMap, err) var recvCount uint32 err = dec.Decode(&recvCount) for i := uint32(0); i < recvCount; i++ { var procs cpustat.ProcStatsMap var tasks cpustat.TaskStatsMap var sys cpustat.SystemStats err = dec.Decode(&procs) err = dec.Decode(&tasks) err = dec.Decode(&sys) } } ```
```xml <?xml version="1.0" encoding="UTF-8"?> <definitions xmlns="path_to_url" xmlns:xsi="path_to_url" xmlns:xsd="path_to_url" xmlns:flowable="path_to_url" xmlns:bpmndi="path_to_url" xmlns:omgdc="path_to_url" xmlns:omgdi="path_to_url" typeLanguage="path_to_url" expressionLanguage="path_to_url" targetNamespace="path_to_url"> <process id="simpleProcess" name="Simple Process" isExecutable="true"> <startEvent id="startEvent1" flowable:formFieldValidation="true"/> <serviceTask id="externalWorker" flowable:type="external-worker" flowable:topic="customer"/> <endEvent id="end"/> <sequenceFlow id="flow1" sourceRef="startEvent1" targetRef="externalWorker"/> <sequenceFlow id="flow2" sourceRef="externalWorker" targetRef="end"/> </process> <bpmndi:BPMNDiagram id="BPMNDiagram_simpleProcess"> <bpmndi:BPMNPlane bpmnElement="simpleProcess" id="BPMNPlane_simpleProcess"> <bpmndi:BPMNShape bpmnElement="startEvent1" id="BPMNShape_startEvent1"> <omgdc:Bounds height="30.0" width="30.0" x="100.0" y="163.0"/> </bpmndi:BPMNShape> <bpmndi:BPMNShape bpmnElement="externalWorker" id="BPMNShape_externalWorker"> <omgdc:Bounds height="80.0" width="100.0" x="240.0" y="138.0"/> </bpmndi:BPMNShape> <bpmndi:BPMNShape bpmnElement="end" id="BPMNShape_end"> <omgdc:Bounds height="28.0" width="28.0" x="540.0" y="164.0"/> </bpmndi:BPMNShape> <bpmndi:BPMNEdge bpmnElement="flow1" id="BPMNEdge_flow1"> <omgdi:waypoint x="129.94999940317362" y="178.0"/> <omgdi:waypoint x="239.99999999993753" y="178.0"/> </bpmndi:BPMNEdge> <bpmndi:BPMNEdge bpmnElement="flow2" id="BPMNEdge_flow2"> <omgdi:waypoint x="290.0" y="217.95000000000002"/> <omgdi:waypoint x="290.0" y="253.0"/> <omgdi:waypoint x="554.0" y="253.0"/> <omgdi:waypoint x="554.0" y="191.94994181072911"/> </bpmndi:BPMNEdge> </bpmndi:BPMNPlane> </bpmndi:BPMNDiagram> </definitions> ```
Cities Development Initiative for Asia (CDIA) is a multi-donor trust fund managed by the Asian Development Bank. As a project preparation facility, we help secondary cities develop bankable and sustainable infrastructure projects. History On February 5–6, 2007, more than 190 representatives from national and local governments of 23 countries, as well as civil society, private sector, international organizations, and donors attended the International Conference on "Investing in Asia's Urban Future" in Manila, Philippines to determine how new approaches can be used to better the lives of 1.6 billion people in Asian cities. From this event, the Cities Development Initiative for Asia (CDIA) was co-founded initially as a partnership between the Asian Development Bank (ADB) and the German Federal Ministry for Economic Cooperation and Development (BMZ) in October 2007. Since that time, the program has welcomed the participation of others as funding members: 2008 - The Government of Sweden 2009 - The Government of Switzerland 2011 - The Government of Austria 2011 - The Shanghai Municipal Government Members Asian Development Bank (ADB) French Development Agency (AFD) European Union German Federal Ministry for Economic Cooperation and Development (BMZ) Swedish International Development Cooperation Agency Ministry of Finance, Austria The Government of Spain State Secretariat for Economic Affairs (Switzerland) The Shanghai Municipal Government Partners United Nations Economic and Social Commission for Asia and the Pacific Ministry of Foreign Affairs (Singapore) United Nations Human Settlements Programme ICLEI References External links Official website: http://www.cdia.asia Cities in Asia Urban planning Organizations based in Manila
Anming Hu is a Chinese-Canadian academic who worked as an associate professor in the Department of Mechanical, Aerospace and Biomedical Engineering at the University of Tennessee, Knoxville (UTK) from 2013 to February 2020 when he was charged with fraud, after which UT suspended him. He was arrested on February 27, 2020, and charged with fraud under a 2011 law the Donald Trump administration used to target professors and researchers working at American universities as part of the "China Initiative" on combating economic espionage. Hu was accused of not disclosing his association with a Chinese university; on September 9, 2021, the trial resulted in acquittal, thus Hu was cleared of all charges. On February 1, 2022, he returned to his lab at UTK. Hu was the first target of the China Initiative to stand trial. He was represented by Knoxville attorney Phil Lomonaco. Hu was charged with three counts of wire fraud and three counts of making false statements after 21 months of FBI surveillance failed to turn up evidence of espionage. The first trial of Hu's case ended in a mistrial due to a hung jury on June 16, 2021. The trial generated controversy due to the FBI's conduct, which included knowingly building a case based on false evidence, obtaining Hu's university documents without warrant, spying on Hu and his family, and attempting to coerce Hu to spy on China for the United States. Following the mistrial, Hu was again prosecuted by the United States Department of Justice, which resulted in a second defeat for the Justice Department when Hu was acquitted. First trial FBI testimony In June 2021, FBI agent Kujtim Sadiku admitted in a testimony that he falsely accused Hu of being a spy, baselessly implicated him as a Chinese military agent to UTK, and used false information to put him on the Federal No Fly List. The agent also stated he attempted to have Hu spy for the United States. Hu refused, leading to FBI agents stalking and harassing him for more than two years. According to Sadiku, he got a tip that Hu might be a spy but cannot remember where he got that information. He did a Google search of Hu in March 2018, which turned up a couple of press releases in Chinese with one including a photograph of Hu. Sadiku then proceeded to use Google translation to do further research. The app made an error in translating Hu's forename in the photo caption. The translation of two documents described Hu obtaining a 2012 "short term" award to teach at Beijing University for 20 hours annually through China's Long-Term Thousand Talents Program. Sadiku investigated him based on his involvement in the program, which he described as benefiting the Chinese military. He opened up an economic espionage case because the US government believes the program aims at acquiring information and technology from the US. When Sadiku confronted Hu, Hu said that those who agreed to spy for China were "cheaters," and that he was not involved in any espionage. Sadiku offered Hu to spy for the US using his part-time work at Beijing University as cover, but Hu refused, stating that he was too afraid. Hu then sent Sadiku an email informing him that he would not go to China. Despite no longer believing Hu was a spy, Sadiku ordered a surveillance team to spy on Hu and his son, then a freshman at UT, for the next 21 months. A group of six or seven agents followed him to work, to school, to the grocery, and even went through his trash. They found no evidence of espionage, but the FBI persisted in building up a case against Hu, resulting in the fraud charges. Sadiku called it Operation Chelsea Dagger. Fraud charges The charges against Anming Hu were based on the Wolf Amendment, a 2011 defense spending bill that prevents NASA funds from being used for collaboration with "China or Chinese-owned companies." Hu was charged with three counts of wire fraud and three counts of making false statements in connection with a NASA grant he received through the University of Tennessee. Hu denied being a member of Long-Term Thousand Talents Program but admitted he had ties to the Beijing University of Technology and that he was working on a NASA grant. Hu had been upfront with his ties to a university in Beijing and followed UT administrative advice when preparing documents for the grant. As far as he knew, nothing criminal was involved in his summer work in China, which the University of Tennessee permitted. Hu had repeatedly disclosed his involvement in the Beijing university to UT, and a UT grant administrator even assured him via email that the NASA China restriction did not apply to faculty. He was told by UT that he only had to disclose income from lectures in China exceeding $10,000. He earned $3,000 from his lectures in China. Despite the lack of espionage charges, one of the prosecutors stated during the trial that one of the reasons for prosecuting scientists and professors was "to teach these Chinese spies a lesson." The case against Hu depended on him knowing the government's new and expansive interpretation of research funding rules and hiding his affiliations with Beijing University of Technology. The indictment against Hu stated:NASA defined "China or any Chinese-owned company" to include Chinese universities ... Through his fraudulent representations and omissions to UTK about his affiliation with BJUT, HU knowingly and willfully caused UTK to falsely certify to NASA and to NASA contractors that UTK was in compliance with NASA's China Funding Restriction The definition was not published in NASA's Grants and Cooperative Agreements Manual (GCAM) but instead was circulated internally within NASA in the 2012 Grant Information Circular (GIC) 12-01A. According to NASA, the Information Circular "is used for internal dissemination ..., is temporary in nature or episodic and ... should be used very carefully and their duration shall not exceed one year" (NASA NFS Section 1801.272). As of 2016, NASA GIC 12-01A was no longer active. The U.S. used the same NASA Circular in 2020 as the basis for criminal charges against Texas A&M University professor Zhengdong Cheng. Mistrial Hu's trial for fraud ended on June 16, 2021, in a mistrial when the jury could not reach a verdict. Afterward, Wendy Chandler, who was Juror 44 and one of the four female jurors in an all-white jury, stated that she kept looking for a big reveal but ultimately characterized the trial as "the most ridiculous case" and the charges against Hu as "a series of plausible errors, a lack of support from UT, and ruthless ambition on behalf of the FBI." The day after the end of the trial, Democratic Representatives Ted Lieu, Mondaire Jones, and Pramila Jayapal voiced concerns about Hu's prosecution and called on Justice Department Inspector General Michael E. Horowitz to investigate allegations of FBI misconduct. Retrial On July 30, 2021, the federal government announced that they would retry Anming Hu. On September 9, 2021, Anming Hu was acquitted of fraud charges by a federal judge. According to U.S. District Judge Thomas A. Varlan: "[E]ven viewing all the evidence in the light most favorable to the government, no rational jury could conclude that defendant acted with a scheme to defraud NASA." Varlan cited testimony from NASA OIG special agent Lee Gibson:Agent Gibson of the NASA Office of Inspector General testified that the NASA grant money that defendant helped obtain went to UTK ... Further, Agent Gibson testified that he had no evidence that defendant “took any money to China or had anybody in China working on” the NASA grants. But according to NASA, "It is acceptable as long as you keep your NASA projects and your PRC related projects separate, i.e., don't use any NASA funds for projects with the PRC". Varlan further wrote, "In fact, Agent Gibson specifically testified that he was not sure whether BJUT was incorporated under  the laws of the People’s Republic of China." Although Gibson speculated that NASA considered BJUT to be a Chinese-owned company NASA Senior Analyst Chris Murguia stated that 'a state-owned university [such as BJUT] would be considered “China”', whereas a private university is a "Chinese-owned company". Aftermath University of Tennessee It was revealed during the trial that the University of Tennessee aided the FBI in their investigation by handing over Hu's university documents without a warrant, concealing the investigation from him, misleading NASA, and firing him the moment he was arrested. Meetings were set up between Hu's bosses and the FBI but it is unclear who authorized these meetings. The FBI did not have any proof of wrongdoing by Hu when they entered UT and did not have the legal authority to take records from his personnel files. The university suspended Hu without pay and the federal government revoked his work authorization. According to the faculty handbook, the faculty senate president should be consulted when the administration is considering suspending a tenured faculty member, which did not happen. The then-president was only informed of the case. After being acquitted of wrongdoing, UT Provost and Senior Vice Chancellor John Zomchick said the university was willing to undo Hu's termination if he could verify U.S. authorization to work in the next year. According to Mary McAlpin, the president of the UT chapter of the American Association of University Professors, regaining his work visa would require sponsorship from UT. Subsequently, in October 2021 the university offered to reinstate Hu with some back pay, research funding, and university support to regain his work visa. His reinstatement was finalized effective February 1, 2022. Casey Arrowood The prosecution of Anming Hu was led by Assistant U.S. Attorney Casey Arrowood. Arrowood was nominated in 2022 by President Biden for U.S. Attorney of the Eastern District of Tennessee. Asian American civil rights groups called on supporters to oppose the nomination, which they called an "affront to the Asian American, immigrant, and scientific communities." Hu said that instead of being punished, Arrowood is being rewarded, encouraging future cases such as his to happen again. Accusations of racial profiling The OCA-Asian Pacific American Advocates denounced the government's decision to retry Anming Hu. OCA National president Linda Ng accused law enforcement of rampant anti-Asian sentiment and "systemic efforts to strip Asian Americans and Asian immigrants of their civil liberties." Nearly 100 members of Congress led by Representative Ted Lieu sent a letter to Attorney General Merrick Garland calling for an investigation into the "wrongful targeting of individuals of Asian descent." US Congressperson Judy Chu accused the FBI of racial profiling in a Congressional Asian Pacific American Caucus (CAPAC) statement, pointing out that Hu's case is only the most glaring of many FBI cases that had been flawed from the start, "evident in the number of cases that have been dropped without any explanation." References Asian-American-related controversies China–United States relations 2021 controversies in the United States
```c++ // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. // This file has been auto-generated by code_generator_v8.py. DO NOT MODIFY! #include "config.h" #include "V8SVGSymbolElement.h" #include "bindings/core/v8/ExceptionState.h" #include "bindings/core/v8/V8DOMConfiguration.h" #include "bindings/core/v8/V8ObjectConstructor.h" #include "bindings/core/v8/V8SVGAnimatedPreserveAspectRatio.h" #include "bindings/core/v8/V8SVGAnimatedRect.h" #include "core/dom/ContextFeatures.h" #include "core/dom/Document.h" #include "core/frame/UseCounter.h" #include "platform/RuntimeEnabledFeatures.h" #include "platform/TraceEvent.h" #include "wtf/GetPtr.h" #include "wtf/RefPtr.h" namespace blink { // Suppress warning: global constructors, because struct WrapperTypeInfo is trivial // and does not depend on another global objects. #if defined(COMPONENT_BUILD) && defined(WIN32) && COMPILER(CLANG) #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wglobal-constructors" #endif const WrapperTypeInfo V8SVGSymbolElement::wrapperTypeInfo = { gin::kEmbedderBlink, V8SVGSymbolElement::domTemplate, V8SVGSymbolElement::refObject, V8SVGSymbolElement::derefObject, V8SVGSymbolElement::trace, 0, 0, V8SVGSymbolElement::preparePrototypeObject, V8SVGSymbolElement::installConditionallyEnabledProperties, "SVGSymbolElement", &V8SVGElement::wrapperTypeInfo, WrapperTypeInfo::WrapperTypeObjectPrototype, WrapperTypeInfo::NodeClassId, WrapperTypeInfo::InheritFromEventTarget, WrapperTypeInfo::Dependent, WrapperTypeInfo::WillBeGarbageCollectedObject }; #if defined(COMPONENT_BUILD) && defined(WIN32) && COMPILER(CLANG) #pragma clang diagnostic pop #endif // This static member must be declared by DEFINE_WRAPPERTYPEINFO in SVGSymbolElement.h. // For details, see the comment of DEFINE_WRAPPERTYPEINFO in // bindings/core/v8/ScriptWrappable.h. const WrapperTypeInfo& SVGSymbolElement::s_wrapperTypeInfo = V8SVGSymbolElement::wrapperTypeInfo; namespace SVGSymbolElementV8Internal { static void viewBoxAttributeGetter(const v8::FunctionCallbackInfo<v8::Value>& info) { v8::Local<v8::Object> holder = info.Holder(); SVGSymbolElement* impl = V8SVGSymbolElement::toImpl(holder); v8SetReturnValueFast(info, WTF::getPtr(impl->viewBox()), impl); } static void viewBoxAttributeGetterCallback(const v8::FunctionCallbackInfo<v8::Value>& info) { TRACE_EVENT_SET_SAMPLING_STATE("blink", "DOMGetter"); UseCounter::countIfNotPrivateScript(info.GetIsolate(), callingExecutionContext(info.GetIsolate()), UseCounter::SVG1DOM); SVGSymbolElementV8Internal::viewBoxAttributeGetter(info); TRACE_EVENT_SET_SAMPLING_STATE("v8", "V8Execution"); } static void preserveAspectRatioAttributeGetter(const v8::FunctionCallbackInfo<v8::Value>& info) { v8::Local<v8::Object> holder = info.Holder(); SVGSymbolElement* impl = V8SVGSymbolElement::toImpl(holder); v8SetReturnValueFast(info, WTF::getPtr(impl->preserveAspectRatio()), impl); } static void preserveAspectRatioAttributeGetterCallback(const v8::FunctionCallbackInfo<v8::Value>& info) { TRACE_EVENT_SET_SAMPLING_STATE("blink", "DOMGetter"); UseCounter::countIfNotPrivateScript(info.GetIsolate(), callingExecutionContext(info.GetIsolate()), UseCounter::SVG1DOM); SVGSymbolElementV8Internal::preserveAspectRatioAttributeGetter(info); TRACE_EVENT_SET_SAMPLING_STATE("v8", "V8Execution"); } } // namespace SVGSymbolElementV8Internal static void installV8SVGSymbolElementTemplate(v8::Local<v8::FunctionTemplate> functionTemplate, v8::Isolate* isolate) { functionTemplate->ReadOnlyPrototype(); v8::Local<v8::Signature> defaultSignature; defaultSignature = V8DOMConfiguration::installDOMClassTemplate(isolate, functionTemplate, "SVGSymbolElement", V8SVGElement::domTemplate(isolate), V8SVGSymbolElement::internalFieldCount, 0, 0, 0, 0, 0, 0); v8::Local<v8::ObjectTemplate> instanceTemplate = functionTemplate->InstanceTemplate(); ALLOW_UNUSED_LOCAL(instanceTemplate); v8::Local<v8::ObjectTemplate> prototypeTemplate = functionTemplate->PrototypeTemplate(); ALLOW_UNUSED_LOCAL(prototypeTemplate); if (RuntimeEnabledFeatures::svg1DOMEnabled()) { static const V8DOMConfiguration::AccessorConfiguration accessorConfiguration =\ {"viewBox", SVGSymbolElementV8Internal::viewBoxAttributeGetterCallback, 0, 0, 0, 0, static_cast<v8::AccessControl>(v8::DEFAULT), static_cast<v8::PropertyAttribute>(v8::None), V8DOMConfiguration::ExposedToAllScripts, V8DOMConfiguration::OnPrototype, V8DOMConfiguration::CheckHolder}; V8DOMConfiguration::installAccessor(isolate, instanceTemplate, prototypeTemplate, functionTemplate, defaultSignature, accessorConfiguration); } if (RuntimeEnabledFeatures::svg1DOMEnabled()) { static const V8DOMConfiguration::AccessorConfiguration accessorConfiguration =\ {"preserveAspectRatio", SVGSymbolElementV8Internal::preserveAspectRatioAttributeGetterCallback, 0, 0, 0, 0, static_cast<v8::AccessControl>(v8::DEFAULT), static_cast<v8::PropertyAttribute>(v8::None), V8DOMConfiguration::ExposedToAllScripts, V8DOMConfiguration::OnPrototype, V8DOMConfiguration::CheckHolder}; V8DOMConfiguration::installAccessor(isolate, instanceTemplate, prototypeTemplate, functionTemplate, defaultSignature, accessorConfiguration); } // Custom toString template #if V8_MAJOR_VERSION < 7 functionTemplate->Set(v8AtomicString(isolate, "toString"), V8PerIsolateData::from(isolate)->toStringTemplate()); #endif } v8::Local<v8::FunctionTemplate> V8SVGSymbolElement::domTemplate(v8::Isolate* isolate) { return V8DOMConfiguration::domClassTemplate(isolate, const_cast<WrapperTypeInfo*>(&wrapperTypeInfo), installV8SVGSymbolElementTemplate); } bool V8SVGSymbolElement::hasInstance(v8::Local<v8::Value> v8Value, v8::Isolate* isolate) { return V8PerIsolateData::from(isolate)->hasInstance(&wrapperTypeInfo, v8Value); } v8::Local<v8::Object> V8SVGSymbolElement::findInstanceInPrototypeChain(v8::Local<v8::Value> v8Value, v8::Isolate* isolate) { return V8PerIsolateData::from(isolate)->findInstanceInPrototypeChain(&wrapperTypeInfo, v8Value); } SVGSymbolElement* V8SVGSymbolElement::toImplWithTypeCheck(v8::Isolate* isolate, v8::Local<v8::Value> value) { return hasInstance(value, isolate) ? toImpl(v8::Local<v8::Object>::Cast(value)) : 0; } void V8SVGSymbolElement::refObject(ScriptWrappable* scriptWrappable) { #if !ENABLE(OILPAN) scriptWrappable->toImpl<SVGSymbolElement>()->ref(); #endif } void V8SVGSymbolElement::derefObject(ScriptWrappable* scriptWrappable) { #if !ENABLE(OILPAN) scriptWrappable->toImpl<SVGSymbolElement>()->deref(); #endif } } // namespace blink ```
Farrah Storr (born 8 November 1978) is a British journalist, and the editor of the UK edition of Elle. She previously worked on several UK magazines, winning a PPA Award and a BSME Award in 2018 as editor-in-chief of Cosmopolitan. Storr wrote The Discomfort Zone in 2018. Career Storr's first job was working on Women and Home, at age 23. She moved onto Good Housekeeping, then Eve and then Glamour. Storr has been features editor of Marie Claire and deputy editor of Top Santé. Storr launched the UK edition of Women's Health. A 2017 report by The Guardian and Operation Black Vote listed Storr as one of the 1000 most powerful people in the United Kingdom, making her one of seven BAME (black, Asian and minority ethnic) women to be included on the list. Storr became editor of the UK edition of Cosmopolitan in July 2015. Storr sparked controversy by choosing plus-size model Tess Holliday for the front cover of the magazine, with some people viewing the move as glorification of obesity, and Piers Morgan calling it "dangerous and misguided". Storr appeared on Good Morning Britain, which Morgan co-hosts, and argued that Holliday was chosen to "explain that there is a different way to look" in "a culture which venerates being thin". For her work in editing Cosmopolitan, Storr won 2018 Editor of the Year categories in the Professional Publishers Association (PPA) Awards and the British Society of Magazine Editors (BSME) Awards. She was also nominated for the Editors' Editor of the Year Award in the 2018 BSME Awards. In 2018, Storr wrote The Discomfort Zone: How To Get What You Want by Living Fearlessly. The book includes personal memoirs, interviews and scientific content, linked by the theme of achieving personal growth by spending time in the "discomfort zone". It was published by Piatkus. In April 2019, it was announced that Storr would be moving from Cosmpolitan to its sister magazine Elle, where she held the same role of editor-in-chief. Personal life Storr's father Javed Iqbal Butt is Pakistani, and was born in Amritsar, India. Storr grew up in Manchester, and has three siblings. Storr was educated at Bury Grammar School (Girls) and graduated with a BA in English and French Literature from King's College London. She is married to fellow journalist Will Storr. References 1978 births Living people Alumni of King's College London British magazine editors Women magazine editors
The Boulder Hills, el. , is a set of foothills north of Boulder, Montana in Jefferson County, Montana. See also List of mountain ranges in Montana Notes Mountain ranges of Montana Landforms of Jefferson County, Montana
Guadalupe Mountains National Park is an American national park in the Guadalupe Mountains, east of El Paso, Texas. The mountain range includes Guadalupe Peak, the highest point in Texas at , and El Capitan used as a landmark by travelers on the route later followed by the Butterfield Overland Mail stagecoach line. The ruins of a stagecoach station stand near the Pine Springs visitor center. The restored Frijole Ranch contains a small museum of local history and is the trailhead for Smith Spring. The park covers in the same mountain range as Carlsbad Caverns National Park, about to the north in New Mexico. The Guadalupe Peak Trail winds through pinyon pine and Douglas-fir forests as it ascends over to the summit of Guadalupe Peak, with views of El Capitan and the Chihuahuan Desert. The McKittrick Canyon trail leads to a stone cabin built in the early 1930s as the vacation home of Wallace Pratt, a petroleum geologist who donated the land. Dog Canyon, on the northern park boundary at the Texas-New Mexico State line, is accessed via Carlsbad, New Mexico or Dell City, Texas. Camping is available at the Pine Springs campground and at Dog Canyon. A public corral for livestock is available by reservation. The park observes Mountain Time. The Gypsum sand dunes lie on the west side of the park near Dell City. A rough four-wheel drive road leads to the Williams Ranch. Park purpose As stated in the foundation document: History The Guadalupe Mountains give their name to the Guadalupian series in the Permian period. The International Commission on Stratigraphy estimates the mountain range's age at 272–260 Mya. The mountains have had a tumultuous history for thousands of years. Archaeological evidence shows that people have lived there for over 10,000 years in and among the many caves and alcoves. Hunter-gatherers followed large game and collected edible vegetation, as evidenced by the discovery of projectile points, baskets, pottery and rock art. The first Europeans to arrive in the area were the Spanish in the 16th century, but they did not make serious attempts to settle in the area. The Spanish introduced horses; nomadic indigenous tribes like the Apaches soon found them an asset for hunting and migrating. Mescalero Apaches followed game and harvested the agave (or mescal) for food and fiber (Mescalero is Spanish for mescal-maker). Agave roasting pits and other artifacts of Mescalero culture can be found in the park. The Mescalero Apaches occupied the mountains through the mid-19th century, but were challenged by an American transportation route at the end of the American Civil War. During the 1840s and 1850s, many immigrants travelled west crossed the area. In 1858, Pinery Station was constructed near Pine Springs for the Butterfield Overland Mail. The Butterfield Overland Mail crossed Guadalupe Pass, located at above sea level. The 9th Cavalry Regiment was ordered to the area to stop Indian raids on settlements and the mail stage route. During the winter of 1869, Lt. H.B. Cushing led his troops into the Guadalupe Mountains and destroyed two Mescalero Apache camps. They were eventually driven out of the area and into US reservations. Felix McKittrick was one of the first European settlers in the Guadalupe Mountains; he worked cattle during the 1870s. McKittrick Canyon is thought to be named after him. Frijole Ranch was the first permanent ranch house, constructed in 1876 by the Rader brothers. It became the only major building in the region and served as a community center and regional post office from 1916 to 1942. Today, it has been restored and serves as a cultural museum. In 1908 Williams Ranch House was built, and it was named after one of its inhabitants, James Adolphus Williams. Judge J.C. Hunter from Van Horn, Texas consolidated most of the smaller ranches in the area into the Guadalupe Mountain Ranch. In 1921, Wallace Pratt, a geologist for Humble Oil and Refining Company, was impressed by the beauty of McKittrick Canyon and bought the land to build two houses there. Both were used as summer homes by Pratt and his family up until 1960. Wallace Pratt donated about of McKittrick Canyon which became part of Guadalupe Mountains National Park, which was dedicated and formally opened to the public in September 1972. In 1978, the United States Congress designated 46,850 acres (190 km2) of the park as a wilderness area. Geography The Guadalupe Mountains reach their highest point at Guadalupe Peak, the highest point in Texas, with an elevation of . The range lies southeast of the Sacramento Mountains and east of the Brokeoff Mountains. The mountain range extends north-northwest and northeast from Guadalupe Peak in Texas into New Mexico. The northeastern extension ends about southwest of Carlsbad, near Carlsbad Caverns National Park; the southwest tip ends with El Capitan about east of El Paso. The mountains rise more than above the arid floor of the Chihuahuan Desert. The Guadalupe Mountains are surrounded by the South Plains to the east and north, Delaware Mountains to the south, and Sacramento Mountains to the west. The northwestern extension, bounded by a dramatic escarpment known as "The Rim", extends much further into New Mexico, approaching close to the Sacramento Mountains. The range is bordered on the north by Four Mile Canyon; on the east by the valley of the Pecos River; and on the west by Piñon Creek, Big Dog Canyon, Valley Canyon, Middle Dog Canyon and West Dog Canyon. Much of the range is built from the ancient Capitán Reef, formed at the margins of a shallow sea during the Permian Period. As the range is built up almost entirely of limestone, upland areas have little or no surface water. The only significant surface water is McKittrick Creek, in McKittrick Canyon, which emerges from the eastern side of the massif, just south of the New Mexico border. Elevations at the base of the range vary from above sea level on the western side to on the east. Several peaks on the southern end exceed . Climate According to the Köppen climate classification system, Guadalupe Mountains National Park has a cold semi-arid climate (BSk). The plant hardiness zone on Guadalupe Peak is 7b with an average annual extreme minimum temperature of 6.1 °F (-14.4 °C). The Guadalupe Mountains experience relatively hot summers, calm, mild autumn weather, and cool to cold weather in winter and early spring. Snow storms, sleet storms, freezing rain, or fog may occur in winter or early spring. Frequent high wind warnings are issued during winter through spring. Late summer monsoons produce thunderstorms. Nights are cool, even in summer. Ecology Three major ecosystems are contained within the park. The Chihuahuan Desert exhibits salt flats, creosote bushes, and honey mesquite on the western side of the park, with low elevations on the eastern side covered with grassland, pinyon pine, and junipers. The canyon interiors, including McKittrick, Bear, and Pine Springs Canyon, exhibit bigtooth maple, velvet ash, chinkapin oak, and other deciduous trees that are fed by springs recharged by mountain streams. Finally, alpine areas more than above sea level contain forests of ponderosa pine, Arizona pine, southwestern white pine, Rocky Mountain Douglas-fir, alligator juniper, and small stands of quaking aspen. The range contains many large cave systems, including Carlsbad Caverns and Lechuguilla Cave. The history of the range includes occupation by ancient Pueblo and Mogollon peoples, and by the Apache and various outlaws in the 19th century. Flora The park is home to over 1000 species of plants, some of which include cacti, succulents, wildflowers, grasses and shrubs. Viola guadalupensis, the Guadalupe Mountains violet, is a rare plant that is endemic to the park. Fauna Mammals that inhabit this national park include elk, javelina, gray fox, American black bear, coyote, bobcat, striped and hog-nosed skunk, badger, sixteen species of bat, mule deer, and mountain lion. Birds of this park include great horned owl, chickadee, sparrow, woodpecker, turkey vulture, greater roadrunner, hummingbird, peregrine falcon, golden eagle, wren, and grosbeak. See also List of national parks of the United States List of birds of Guadalupe Mountains National Park References External links of the National Park Service The entry for Guadalupe Mountains National Park in the Handbook of Texas Online. Current weather forecast - National Weather Service Visit Carlsbad - Guadalupe Mountains National Park Film footage of the Guadalupe Mountains National Park in Texas: Land of Contrast (1966) from the Texas Archive of the Moving Image National parks in Texas Archaeological sites in Texas Protected areas of Culberson County, Texas Protected areas of Hudspeth County, Texas Protected areas established in 1966
The Reliance is a Chesapeake Bay skipjack, built in 1904 at Fishing Creek, Maryland. She is a two-sail bateau, or "V"-bottomed deadrise type of centerboard sloop. Her beam is and her draft is . She one of the 35 surviving traditional Chesapeake Bay skipjacks and a member of the last commercial sailing fleet in the United States. She is located at Tilghman, Talbot County, Maryland. She was listed on the National Register of Historic Places in 1976. References External links , including photo in 1975, at Maryland Historical Trust Ships in Talbot County, Maryland Skipjacks Ships on the National Register of Historic Places in Maryland 1904 ships National Register of Historic Places in Talbot County, Maryland
```clojure (ns legacy.status-im.ui.components.chat-icon.styles (:require [legacy.status-im.ui.components.colors :as colors] [legacy.status-im.ui.components.emoji-thumbnail.utils :as emoji-utils])) (defn default-chat-icon [color] {:margin 0 :width 40 :height 40 :align-items :center :justify-content :center :border-radius 20 :background-color color}) (defn default-chat-icon-redesign [color size] {:margin 0 :width size :height size :align-items :center :justify-content :center :border-radius (/ size 2) :background-color color}) (defn default-chat-icon-chat-list [color] (merge (default-chat-icon color) {:width 40 :height 40 :border-radius 20})) (defn default-list-chat-icon-redesign [color size] (merge (default-chat-icon-redesign color size) {:width size :height size :border-radius (/ size 2)})) (defn default-community-icon-chat-list [color] (merge (default-chat-icon color) {:width 48 :height 48 :border-radius 48})) (defn default-token-icon-chat-list [color] (merge (default-chat-icon color) {:width 20 :height 20 :border-radius 20})) (defn default-chat-icon-chat-toolbar [color size] (merge (default-chat-icon color) {:width size :height size :border-radius size})) (defn default-chat-icon-profile [color size] (merge (default-chat-icon color) {:width size :height size :border-radius (/ size 2)})) (defn default-chat-icon-text [size] {:color colors/white-transparent-70-persist :font-weight "700" :font-size (/ size 2) :line-height size}) (defn emoji-chat-icon-text [size] {:font-size (emoji-utils/emoji-font-size size) :line-height size :margin-top (emoji-utils/emoji-top-margin-for-vertical-alignment size)}) ;; Required for vertical alignment bug - Check function defination for more info (def chat-icon {:margin 4 :border-radius 20 :width 40 :height 40}) (defn chat-icon-redesign [size] {:margin 4 :border-radius (/ size 2) :width size :height size}) (def chat-icon-chat-list (merge chat-icon {:width 40 :height 40 :margin 0})) (defn community-status-icon [size] {:margin 4 :border-radius 10 :width size :height size}) (def community-icon-chat-list (merge chat-icon {:width 48 :height 48 :margin 0})) (defn community-icon-chat-list-redesign [size] (merge (chat-icon size) {:width size :height size :margin 0})) (defn community-status-chat-list-icon [size] (merge (community-status-icon size) {:width size :height size :margin 0})) (def token-icon-chat-list (merge chat-icon {:width 20 :height 20 :margin 0})) (defn chat-icon-chat-toolbar [size] (merge chat-icon {:width size :height size :margin 0})) (defn custom-size-icon [size] (merge chat-icon {:width size :height size :margin 0})) (def chat-icon-profile (merge chat-icon {:width 64 :height 64 :border-radius 32})) (def container-chat-list {:width 40 :height 40}) (def token-icon-container-chat-list {:width 20 :height 20}) (def community-icon-container-chat-list {:width 48 :height 48}) (defn container-list-size [size] {:width size :height size}) (defn container-chat-toolbar [size] {:width size :height size}) (defn chat-icon-profile-edit [] {:width 24 :height 24 :border-radius 12 :border-width 1 :border-color colors/white-persist :background-color colors/blue :justify-content :center :align-items :center :position :absolute :bottom -2 :right -2}) ```
Kukutin is a settlement in Kiribati. It is located on the Orona atoll; the nearest locations, to the west, are Noriti and Ritiati, both about away. this is an abandoned settlement and the atoll the settlement was once on is now part of the Phoenix Islands laying halfway between Hawaii and Australia See also Arariki References Populated places in Kiribati
```sqlpl /* * The contents of this file are subject to the Interbase Public * * "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, either express * * The Original Code was created by Inprise Corporation * and its predecessors. Portions created by Inprise Corporation are * * All Rights Reserved. * Contributor(s): ______________________________________. */ alter index CUSTNAMEX active; alter index CUSTREGION active; alter index BUDGETX active; alter index NAMEX active; alter index MAXSALX active; alter index MINSALX active; alter index PRODTYPEX active; alter index CHANGEX active; alter index UPDATERX active; alter index NEEDX active; alter index QTYX active; alter index SALESTATX active; ALTER TRIGGER set_emp_no ACTIVE; ALTER TRIGGER set_cust_no ACTIVE; ALTER TRIGGER post_new_order ACTIVE; ```
The women's 100 metres event at the 1990 Commonwealth Games was held on 27 and 28 January at the Mount Smart Stadium in Auckland. Medalists Results Heats Qualification: First 5 of each heat (Q) and the next 3 fastest (q) qualified for the semifinals. Wind:Heat 1: +3.3 m/s, Heat 2: -0.3 m/s, Heat 3: +0.8 m/s Semifinals Qualification: First 4 of each heat (Q) and the next 1 fastest (q) qualified for the final. Wind:Heat 1: +1.6 m/s, Heat 2: +1.6 m/s Final Wind: +4.4 m/s References 100 1990 1990 in women's athletics
Mount Meager may refer to: Mount Meager massif, a group of mountains in British Columbia, Canada Mount Meager (British Columbia), a mountain of the above massif See also Meager (disambiguation)
```c++ #include "Viscosity_Peer2016.h" #include "SPlisHSPlasH/TimeManager.h" #include "Utilities/Timing.h" #include "Utilities/Counting.h" #include "../Simulation.h" #include "SPlisHSPlasH/BoundaryModel_Akinci2012.h" #include "SPlisHSPlasH/BoundaryModel_Koschier2017.h" #include "SPlisHSPlasH/BoundaryModel_Bender2019.h" using namespace SPH; using namespace GenParam; int Viscosity_Peer2016::ITERATIONS_V = -1; int Viscosity_Peer2016::ITERATIONS_OMEGA = -1; int Viscosity_Peer2016::MAX_ITERATIONS_V = -1; int Viscosity_Peer2016::MAX_ERROR_V = -1; int Viscosity_Peer2016::MAX_ITERATIONS_OMEGA = -1; int Viscosity_Peer2016::MAX_ERROR_OMEGA = -1; Viscosity_Peer2016::Viscosity_Peer2016(FluidModel *model) : ViscosityBase(model) { m_density.resize(model->numParticles(), 0.0); m_targetNablaV.resize(model->numParticles(), Matrix3r::Zero()); m_omega.resize(model->numParticles(), Vector3r::Zero()); m_iterationsV = 0; m_iterationsOmega = 0; m_maxIterV = 50; m_maxErrorV = 0.01; m_maxIterOmega = 50; m_maxErrorOmega = 0.01; model->addField({ "target nablaV", FieldType::Matrix3, [&](const unsigned int i) -> Real* { return &m_targetNablaV[i](0,0); } }); model->addField({ "omega (visco)", FieldType::Vector3, [&](const unsigned int i) -> Real* { return &m_omega[i][0]; } }); } Viscosity_Peer2016::~Viscosity_Peer2016(void) { m_model->removeFieldByName("target nablaV"); m_model->removeFieldByName("omega (visco)"); m_density.clear(); m_targetNablaV.clear(); m_omega.clear(); } void Viscosity_Peer2016::initParameters() { ViscosityBase::initParameters(); ITERATIONS_V = createNumericParameter("viscoIterationsV", "Iterations (velocity field)", &m_iterationsV); setGroup(ITERATIONS_V, "Fluid Model|Viscosity"); setDescription(ITERATIONS_V, "Iterations required by the viscosity solver."); getParameter(ITERATIONS_V)->setReadOnly(true); ITERATIONS_OMEGA = createNumericParameter("viscoIterationsOmega", "Iterations (vorticity diffusion)", &m_iterationsOmega); setGroup(ITERATIONS_OMEGA, "Fluid Model|Viscosity"); setDescription(ITERATIONS_OMEGA, "Iterations required by the viscosity solver."); getParameter(ITERATIONS_OMEGA)->setReadOnly(true); MAX_ITERATIONS_V = createNumericParameter("viscoMaxIter", "Max. iterations", &m_maxIterV); setGroup(MAX_ITERATIONS_V, "Fluid Model|Viscosity"); setDescription(MAX_ITERATIONS_V, "Max. iterations of the viscosity solver."); static_cast<NumericParameter<unsigned int>*>(getParameter(MAX_ITERATIONS_V))->setMinValue(1); MAX_ERROR_V = createNumericParameter("viscoMaxError", "Max. error", &m_maxErrorV); setGroup(MAX_ERROR_V, "Fluid Model|Viscosity"); setDescription(MAX_ERROR_V, "Max. error of the viscosity solver."); RealParameter* rparam = static_cast<RealParameter*>(getParameter(MAX_ERROR_V)); rparam->setMinValue(1e-6); MAX_ITERATIONS_OMEGA = createNumericParameter("viscoMaxIterOmega", "Max. iterations (vorticity diffusion)", &m_maxIterOmega); setGroup(MAX_ITERATIONS_OMEGA, "Fluid Model|Viscosity"); setDescription(MAX_ITERATIONS_OMEGA, "Max. iterations of the vorticity diffusion solver."); static_cast<NumericParameter<unsigned int>*>(getParameter(MAX_ITERATIONS_OMEGA))->setMinValue(1); MAX_ERROR_OMEGA = createNumericParameter("viscoMaxErrorOmega", "Max. vorticity diffusion error", &m_maxErrorOmega); setGroup(MAX_ERROR_OMEGA, "Fluid Model|Viscosity"); setDescription(MAX_ERROR_OMEGA, "Max. error of the vorticity diffusion solver."); rparam = static_cast<RealParameter*>(getParameter(MAX_ERROR_OMEGA)); rparam->setMinValue(1e-6); } void Viscosity_Peer2016::computeDensities() { Simulation* sim = Simulation::getCurrent(); FluidModel* model = m_model; const unsigned int fluidModelIndex = model->getPointSetIndex(); const Real density0 = model->getDensity0(); const unsigned int numParticles = model->numActiveParticles(); const unsigned int nFluids = sim->numberOfFluidModels(); const unsigned int nBoundaries = sim->numberOfBoundaryModels(); #pragma omp parallel default(shared) { #pragma omp for schedule(static) for (int i = 0; i < (int)numParticles; i++) { Real& density = m_density[i]; // Compute current density for particle i density = model->getVolume(i) * sim->W_zero(); const Vector3r& xi = model->getPosition(i); ////////////////////////////////////////////////////////////////////////// // Fluid ////////////////////////////////////////////////////////////////////////// forall_fluid_neighbors( density += fm_neighbor->getVolume(neighborIndex) * sim->W(xi - xj); ); ////////////////////////////////////////////////////////////////////////// // Boundary ////////////////////////////////////////////////////////////////////////// if (sim->getBoundaryHandlingMethod() == BoundaryHandlingMethods::Akinci2012) { forall_boundary_neighbors( // Boundary: Akinci2012 density += bm_neighbor->getVolume(neighborIndex) * sim->W(xi - xj); ); } else if (sim->getBoundaryHandlingMethod() == BoundaryHandlingMethods::Koschier2017) { forall_density_maps( density += rho; ); } else // Bender2019 { forall_volume_maps( density += Vj * sim->W(xi - xj); ); } density *= density0; } } } void Viscosity_Peer2016::matrixVecProdV(const Real* vec, Real *result, void *userData) { Simulation *sim = Simulation::getCurrent(); Viscosity_Peer2016* visco = (Viscosity_Peer2016*)userData; FluidModel* model = visco->getModel(); const unsigned int numParticles = model->numActiveParticles(); if (numParticles == 0) return; const unsigned int fluidModelIndex = model->getPointSetIndex(); const unsigned int nFluids = sim->numberOfFluidModels(); #pragma omp parallel default(shared) { #pragma omp for schedule(static) for (int i = 0; i < (int)numParticles; i++) { // Diagonal element const Vector3r &xi = model->getPosition(i); result[i] = (visco->m_density[i] - model->getMass(i) * sim->W_zero()) * vec[i]; ////////////////////////////////////////////////////////////////////////// // Fluid ////////////////////////////////////////////////////////////////////////// forall_fluid_neighbors_in_same_phase( result[i] -= model->getMass(neighborIndex) * sim->W(xi - xj) * vec[neighborIndex]; ) } } } void Viscosity_Peer2016::diagonalMatrixElementV(const unsigned int i, Real &result, void *userData) { // Diagonal element Viscosity_Peer2016* visco = (Viscosity_Peer2016*)userData; FluidModel* model = visco->getModel(); Simulation *sim = Simulation::getCurrent(); result = visco->m_density[i] - model->getMass(i) * sim->W_zero(); } void Viscosity_Peer2016::matrixVecProdOmega(const Real* vec, Real *result, void *userData) { Simulation *sim = Simulation::getCurrent(); FluidModel *model = (FluidModel*)userData; const unsigned int numParticles = model->numActiveParticles(); if (numParticles == 0) return; const unsigned int fluidModelIndex = model->getPointSetIndex(); const unsigned int nFluids = sim->numberOfFluidModels(); #pragma omp parallel default(shared) { #pragma omp for schedule(static) for (int i = 0; i < (int)numParticles; i++) { // Diagonal element const Vector3r &xi = model->getPosition(i); // Compute current fluid density for particle i Real density_i = model->getMass(i) * sim->W_zero(); ////////////////////////////////////////////////////////////////////////// // Fluid ////////////////////////////////////////////////////////////////////////// forall_fluid_neighbors_in_same_phase( density_i += model->getMass(neighborIndex) * sim->W(xi - xj); ) result[i] = (density_i - model->getMass(i) * sim->W_zero()) * vec[i]; ////////////////////////////////////////////////////////////////////////// // Fluid ////////////////////////////////////////////////////////////////////////// forall_fluid_neighbors_in_same_phase( result[i] -= model->getMass(neighborIndex) * sim->W(xi - xj) * vec[neighborIndex]; ) } } } void Viscosity_Peer2016::diagonalMatrixElementOmega(const unsigned int i, Real &result, void *userData) { // Diagonal element Simulation *sim = Simulation::getCurrent(); FluidModel *model = (FluidModel*)userData; const unsigned int fluidModelIndex = model->getPointSetIndex(); const unsigned int nFluids = sim->numberOfFluidModels(); const Vector3r &xi = model->getPosition(i); // Compute current fluid density for particle i Real density_i = model->getMass(i) * sim->W_zero(); ////////////////////////////////////////////////////////////////////////// // Fluid ////////////////////////////////////////////////////////////////////////// forall_fluid_neighbors_in_same_phase( density_i += model->getMass(neighborIndex) * sim->W(xi - xj); ) result = density_i - model->getMass(i) * sim->W_zero(); } void Viscosity_Peer2016::step() { Simulation *sim = Simulation::getCurrent(); const int numParticles = (int) m_model->numActiveParticles(); if (numParticles == 0) return; const Real viscosity = static_cast<Real>(1.0) - m_viscosity; const Real density0 = m_model->getDensity0(); const unsigned int fluidModelIndex = m_model->getPointSetIndex(); const unsigned int nFluids = sim->numberOfFluidModels(); FluidModel *model = m_model; const Real h = TimeManager::getCurrent()->getTimeStepSize(); ////////////////////////////////////////////////////////////////////////// // Init linear system solver and preconditioner ////////////////////////////////////////////////////////////////////////// MatrixReplacement A(m_model->numActiveParticles(), matrixVecProdV, (void*)this); m_solverV.preconditioner().init(m_model->numActiveParticles(), diagonalMatrixElementV, (void*)this); m_solverV.setTolerance(m_maxErrorV); m_solverV.setMaxIterations(m_maxIterV); m_solverV.compute(A); MatrixReplacement A2(m_model->numActiveParticles(), matrixVecProdOmega, (void*)m_model); m_solverOmega.preconditioner().init(m_model->numActiveParticles(), diagonalMatrixElementOmega, (void*)m_model); m_solverOmega.setTolerance(m_maxErrorOmega); m_solverOmega.setMaxIterations(m_maxIterOmega); m_solverOmega.compute(A2); VectorXr b0(numParticles); VectorXr b1(numParticles); VectorXr b2(numParticles); VectorXr x0(numParticles); VectorXr x1(numParticles); VectorXr x2(numParticles); VectorXr g0(numParticles); VectorXr g1(numParticles); VectorXr g2(numParticles); // this method computes its own density values since // it is very sensitive to small deviations (like they // appear when using AVX) computeDensities(); #pragma omp parallel default(shared) { #pragma omp for schedule(static) nowait for (int i = 0; i < numParticles; i++) { const Vector3r &xi = m_model->getPosition(i); const Vector3r &vi = m_model->getVelocity(i); const Real density_i = m_model->getDensity(i); ////////////////////////////////////////////////////////////////////////// // compute nabla v ////////////////////////////////////////////////////////////////////////// Matrix3r nablaV; nablaV.setZero(); ////////////////////////////////////////////////////////////////////////// // Fluid ////////////////////////////////////////////////////////////////////////// forall_fluid_neighbors_in_same_phase( const Vector3r &vj = m_model->getVelocity(neighborIndex); const Vector3r gradW = sim->gradW(xi - xj); Matrix3r dyad = (vj - vi) * gradW.transpose(); nablaV += (1.0 / density_i) * m_model->getMass(neighborIndex) * dyad; ) ////////////////////////////////////////////////////////////////////////// // decomposition of velocity gradient ////////////////////////////////////////////////////////////////////////// Matrix3r &target = getTargetNablaV(i); Matrix3r R = 0.5 * (nablaV - nablaV.transpose()); const Real divergence = nablaV(0, 0) + nablaV(1, 1) + nablaV(2, 2); const Matrix3r V = (1.0 / 3.0) * divergence * Matrix3r::Identity(); const Matrix3r S = 0.5 * (nablaV + nablaV.transpose()) - V; ////////////////////////////////////////////////////////////////////////// // extract omega ////////////////////////////////////////////////////////////////////////// Vector3r &omega = getOmega(i); omega[0] = static_cast<Real>(2.0) * R(2, 1); omega[1] = static_cast<Real>(2.0) * R(0, 2); omega[2] = static_cast<Real>(2.0) * R(1, 0); ////////////////////////////////////////////////////////////////////////// // compute target nabla v without spin tensor ////////////////////////////////////////////////////////////////////////// if (density_i >= density0) { target = V + viscosity * S; } else { if (-divergence < 0.0) target = V + viscosity * S; else target = viscosity * S; } } } ////////////////////////////////////////////////////////////////////////// // Compute RHS of vorticity diffusion system ////////////////////////////////////////////////////////////////////////// #pragma omp parallel default(shared) { #pragma omp for schedule(static) nowait for (int i = 0; i < (int)numParticles; i++) { const Vector3r &xi = m_model->getPosition(i); Vector3r rhs; rhs.setZero(); ////////////////////////////////////////////////////////////////////////// // Fluid ////////////////////////////////////////////////////////////////////////// forall_fluid_neighbors_in_same_phase( const Real m = m_model->getMass(neighborIndex); const Vector3r xij = xi - xj; const Real W = sim->W(xij); rhs += m *(m_omega[i] - m_omega[neighborIndex]) * W; ) const Vector3r &omegai = getOmega(i); g0[i] = omegai[0]; g1[i] = omegai[1]; g2[i] = omegai[2]; b0[i] = viscosity * rhs[0]; b1[i] = viscosity * rhs[1]; b2[i] = viscosity * rhs[2]; } } ////////////////////////////////////////////////////////////////////////// // Solve linear system ////////////////////////////////////////////////////////////////////////// START_TIMING("CG solve omega"); m_iterationsOmega = 0; x0 = m_solverOmega.solveWithGuess(b0, g0); //x0 = m_solverOmega.solve(b0); if (m_solverOmega.iterations() == 0) x0 = g0; m_iterationsOmega += (int)m_solverOmega.iterations(); x1 = m_solverOmega.solveWithGuess(b1, g1); //x1 = m_solverOmega.solve(b1); if (m_solverOmega.iterations() == 0) x1 = g1; m_iterationsOmega += (int)m_solverOmega.iterations(); x2 = m_solverOmega.solveWithGuess(b2, g2); //x2 = m_solverOmega.solve(b2); if (m_solverOmega.iterations() == 0) x2 = g2; m_iterationsOmega += (int)m_solverOmega.iterations(); STOP_TIMING_AVG; INCREASE_COUNTER("Visco iterations - Omega", static_cast<Real>(m_iterationsOmega)); ////////////////////////////////////////////////////////////////////////// // Determine new spin tensor and add it to target nabla v ////////////////////////////////////////////////////////////////////////// #pragma omp parallel default(shared) { #pragma omp for schedule(static) nowait for (int i = 0; i < (int)numParticles; i++) { Matrix3r R; R << static_cast<Real>(0.0), -static_cast<Real>(0.5)*x2[i], static_cast<Real>(0.5)*x1[i], static_cast<Real>(0.5)*x2[i], 0.0, -static_cast<Real>(0.5)*x0[i], -static_cast<Real>(0.5)*x1[i], static_cast<Real>(0.5)*x0[i], static_cast<Real>(0.0); Matrix3r &target = getTargetNablaV(i); target += R; } } ////////////////////////////////////////////////////////////////////////// // Compute RHS ////////////////////////////////////////////////////////////////////////// #pragma omp parallel default(shared) { #pragma omp for schedule(static) nowait for (int i = 0; i < (int)numParticles; i++) { const Vector3r &xi = m_model->getPosition(i); Vector3r rhs; rhs.setZero(); ////////////////////////////////////////////////////////////////////////// // Fluid ////////////////////////////////////////////////////////////////////////// forall_fluid_neighbors_in_same_phase( const Real m = m_model->getMass(neighborIndex); const Vector3r xij = xi - xj; const Real W = sim->W(xij); rhs += m * 0.5 * (getTargetNablaV(i) + getTargetNablaV(neighborIndex)) * xij * W; ) const Vector3r &vi = m_model->getVelocity(i); g0[i] = vi[0]; g1[i] = vi[1]; g2[i] = vi[2]; b0[i] = rhs[0]; b1[i] = rhs[1]; b2[i] = rhs[2]; } } ////////////////////////////////////////////////////////////////////////// // Solve linear system ////////////////////////////////////////////////////////////////////////// START_TIMING("CG solve"); m_iterationsV = 0; x0 = m_solverV.solveWithGuess(b0, g0); if (m_solverV.iterations() == 0) x0 = g0; m_iterationsV += (int)m_solverV.iterations(); x1 = m_solverV.solveWithGuess(b1, g1); if (m_solverV.iterations() == 0) x1 = g1; m_iterationsV += (int)m_solverV.iterations(); x2 = m_solverV.solveWithGuess(b2, g2); if (m_solverV.iterations() == 0) x2 = g2; m_iterationsV += (int)m_solverV.iterations(); STOP_TIMING_AVG; INCREASE_COUNTER("Visco iterations - V", static_cast<Real>(m_iterationsV)); #pragma omp parallel default(shared) { #pragma omp for schedule(static) nowait for (int i = 0; i < (int)numParticles; i++) { Vector3r &vi = m_model->getVelocity(i); vi[0] = x0[i]; vi[1] = x1[i]; vi[2] = x2[i]; } } } void Viscosity_Peer2016::reset() { } void Viscosity_Peer2016::performNeighborhoodSearchSort() { } ```
Edward Stirling (April 1809 – c. September 1894) was an English stage manager, actor and dramatist. He published around 200 works for the stage, many being adaptations of works by popular authors, notably Charles Dickens, Walter Scott and Harrison Ainsworth, often within days of the novel's publication. He married Mary Anne Stirling (1815–1895), an actress who went on to a long and illustrious career as Mrs Stirling. History Stirling was born Edward Stirling Lambert in Thame, Oxfordshire, and started working life as a banker's clerk. Around age 20 he began his stage career first as an actor in the provinces, then as actor/stage manager at the Adelphi, London for Frederick Henry Yates, later took on production at other theatres, finally at Drury Lane. Writing His first successful work for the stage was Sadak and Kalasrade, a spectacular drama. Apart from his original plays he "adapted" the latest novels of Dickens and other authors for the stage. His adaptation of The Cricket on the Hearth played at the Adelphi for over 90 performances. Among his numerous titles were: The Thirst for Gold, or the Sea of Ice T. W. Robertson produced another version. The Ragpicker of Paris and the Dressmaker of St Antoine Aline, the Rose of Killarney (1843) adaptation of Gaetano Rossi's Linda di Chamounix. C. Z. Barnett adapted the same libretto for his Linda, the Pearl of Savoy. The Bohemians; or, After Dark in Paris Margaret Catchpole became the film The Romantic Story of Margaret Catchpole Other titles include Above and Below The Anchor of Hope; or the Seaman's Star Bachelors Buttons Barnaby Rudge (Dickens) The Battle of Life (Dickens) The Bluejackets; or, Her Majesty's Service The Bohemians; or, The Rogues of Paris The Bould Soger Boy The Cabin Boy Captain Charlotte The Children in the Wood; or, Harlequin Nobody A Christmas Carol; or, Past, Present, and Future (Dickens) Clarisse; or, The Merchant's Daughter The Cricket on the Hearth; or, A Fairy Tale of Home (Dickens) T. W. Robertson produced another version. The Fortunes of Smike; or, A Sequel to Nicholas Nickleby (Dickens) The Giant of Palestine Grace Darling; or, The Wreck at Sea The Hand of Cards Harlequin Blue Beard; or, The Fairy of the Silver Crescent Industry and Indolence; or, The Orphan's Legacy Jane Lomax; or, A Mother's Curse The Jockey Club Knight of the Dragon and the Queen of Beauty Lestelle The Little Back Parlour The Love Gift; or, The Trials of Poverty A Lucky Hit The Miser's Daughter (Harrison Ainsworth) Nicholas Nickleby; or, Doings at Do-the-Boys Hall (Dickens) Norah Creina The Old Curiosity Shop; or, One Hour from Humphrey's Clock (Dickens) Oliver Twist; or, The Parish Boy's Progress (Dickens) On the Tiles Popping In and Out Rifle Volunteers; or, Riflemen! Riflemen! Riflemen! Form! The Rose of Corbeil; or the Forest of Senart The Serpent of the Nile; or, The Battle of Actium The Tower of London; or, Og, Gog, and Magog (Harrison Ainsworth) Ulrica; or, The Prisoner of State Wanted a Wife; or, London, Liverpool and Bristol The Wreck at Sea; or, The Fern Light Yankee Notes for English Circulation (Dickens) In 1881 he published a memoir: Old Drury Lane – Fifty Years' Recollections in 2 volumes, which at least one critic enjoyed but another found worthless as a history. Marriage Stirling married the actress Miss Fanny Clifton (1815-1895) in 1832 Born Mary Ann Hehl, she was a daughter of Captain Hehl, a military secretary at the War Office. Her career blossomed when she took Helen Faucit's part in the role of Clara in Lytton’s play Money. Their daughter, Miss Fanny Stirling, made her appearance on the stage about 1860, and gained some reputation as an actress. (Elsewhere her name is given as Pamela Stirling.) Mrs. Stirling retired from the stage in 1886, her last appearance being at The Lyceum as Martha in Faust in 1890. In 1894, six weeks after Stirling's death, she married Lieut-Colonel Sir Charles Hutton Gregory, a well-known civil and military engineer. She was 79 years of age and he was 78. The wedding was covered sympathetically by all the newspapers, whereas Stirling's death received no mention at the time, and later only in reference to this marriage, and in the most unflattering terms. Notes and references 1809 births 1894 deaths 19th-century English dramatists and playwrights Plays based on works by Charles Dickens
```objective-c /* * Wireshark - Network traffic analyzer * By Gerald Combs <gerald@wireshark.org> * * * This program is free software; you can redistribute it and/or * as published by the Free Software Foundation; either version 2 * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #ifndef STTYPE_SET_H #define STTYPE_SET_H #include <glib.h> void sttype_set_replace_element(stnode_t *node, stnode_t *oldnode, stnode_t *newnode); void set_nodelist_free(GSList *params); #endif ```
Sergio Guerri (25 December 1905 – 15 March 1992) was an Italian Cardinal of the Roman Catholic Church who served as personal theologian to five popes from 1955 to 1989, and was elevated to the cardinalate in 1969. Biography Guerri was born in Tarquinia, and studied at the inter-diocesan Seminary of Montefiascone, Seminary of Viterbo, Pontifical Roman Seminary, Pontifical Lateran University, and the Pontifical Roman Athenaeum S. Apollinare. Ordained to the priesthood on 30 March 1929, he finished his studies in 1931, when he began pastoral work in Tarquinia. Guerri then served as Administrator of the Pontifical Urbaniana University from 1937 to 1941. He was raised to the rank of a Privy Chamberlain of His Holiness on 11 April 1940, and later a Domestic Prelate of His Holiness 19 June 1949. He was also an official (1941–1946) and substitute secretary (1946–1948) of the Institute for Works of Religion in the Roman Curia. On 9 March 1948, Guerri was named Pro-Secretary of the Administration of the Patrimony of the Holy See, becoming its full Secretary on 1 January 1951. He was later made a canon of St. Peter's Basilica on 25 April 1952. Named Secretary of the Central Preparatory Commission on 22 June 1960, Guerri was administrative secretary of the Second Vatican Council from 1960 to 1965. He was made Secretary of the Administration of the Patrimony of Holy See (7 May 1968) before becoming Pro-President of the Pontifical Commission for Vatican City State on 6 November 1968. A close friend of Paolo Bertoli and Umberto Mozzoni, he remained in this post until he was succeeded in 1969 by Giuseppe Caprio. On 11 April 1969, in advance of his cardinalatial promotion, Guerri was appointed Titular Archbishop of Trebia. He received his episcopal consecration on the following 27 April from Cardinal Amleto Giovanni Cicognani, with Bishops Joseph Mark McShea and Plinio Pascoli, serving as co-consecrators, in the chapel of the Lateran Seminary. Shortly afterwards, Pope Paul VI created him Cardinal-Deacon of SS. Nome di Maria al Foro Troiano in the consistory of 28 April 1969. Cardinal Guerri was one of the cardinal electors who participated in the conclaves of August and October 1978, which selected Popes John Paul I and John Paul II respectively. After ten-years' standing as a Cardinal Deacon, he opted to become a Cardinal Priest, with the same titular church, on 30 June 1979. He resigned as Pro-President of Vatican City State on 26 September 1981, following almost fourteen years of service. Cardinal Guerri died in Vatican City, at age 86. He is buried in his family's chapel at the cemetery of Tarquinia. References External links Cardinals of the Holy Roman Church Catholic-Hierarchy 1905 births 1992 deaths 20th-century Italian cardinals Participants in the Second Vatican Council Economic history of the Holy See Cardinals created by Pope Paul VI Pontifical Lateran University alumni Pontifical Roman Seminary alumni
Imani Francesca Coppola (born April 6, 1978) is an American singer-songwriter and violinist. Her debut single "Legend of a Cowgirl" reached the top 40 on the Billboard Hot 100 and the UK Singles Chart in 1997. Her debut album, Chupacabra, released by Columbia Records, was praised by critics and appeared on the US Heatseekers Albums chart. In 2001, Coppola appeared as a guest artist on the Baha Men single "You All Dat", which broke the top 10 in Australia and gave Coppola her second entry on the Billboard Hot 100 to date. Coppola released several independently recorded albums in the early 2000s as well as starring in the musical film The Singing Biologist, where she wrote the music for the movie. In 2007, she was signed to Ipecac Records, and the same year released The Black & White Album, which received favorable reviews from music critics and marked a comeback for Coppola. The following year, she formed the pop/R&B duo Little Jackie with programmer Adam Pallin. Their debut single, "The World Should Revolve Around Me", reached the top 40 in the United Kingdom and Ireland, was used as the theme for the VH1 reality TV series New York Goes to Hollywood, and peaked at number 90 on the Billboard Pop 100 airplay chart. The duo's debut album, The Stoop, was released by S-Curve in 2008, but peaked outside of the top 100 in the United Kingdom, and the duo were dropped from the label. Following The Stoop, Coppola released two more solo records: The Glass Wall, in 2012, and Hypocrites, in 2017. In addition to her solo work, Coppola has recorded two further albums as part of Little Jackie: Made4TV, in 2011, and Queen of Prospect Park, in 2014. Early life and education Coppola grew up as the second-youngest of five children in Long Island, New York. Coppola's lower-income family, headed by an African-American mother and Italian father, did not fit in, and she and her family were picked on. Her circumstances encouraged her independence and also her creativity, as her family, who received welfare, had little money to pay for entertainment. Her mother, a teacher, was the primary income earner, while her carpenter father was often out of work and refused to earn an income from his art. Coppola grew up surrounded by music, as her father is a jazz musician, her mother plays bass, and all of her siblings are musicians as well. She recalled, in an interview with Amplifier magazine, that her first musical memory is of her father, who was her biggest musical influence, playing the song "Bessie's Blues" "on a severely out of tune piano". She began playing violin at the age of six, eventually studying studio composition at the State University of New York at Purchase. She was not happy and left after one year. Career 1997–1999: Early success During her time at college, Coppola made some demos and played them to music publisher Ross Elliot, the boyfriend of her older sister Maya. Elliot connected Coppola with producer Michael Mangini, known for his work with Digable Planets. While still in college, Coppola cut three demo tracks with Digable Planets that resulted in a bidding war for the artist among other labels. Coppola accepted a recording contract with Columbia Records in 1997. In 1997, Coppola released her debut single, "Legend of a Cowgirl". The song entered the top 40 on the Billboard Hot 100 within weeks of its release, eventually peaking at number 36 and spending a total of 20 weeks in the top 100. The single also achieved some success internationally, peaking within the top 40 in New Zealand and the United Kingdom and also charting in Belgium, Germany, and the Netherlands. The song's accompanying music video became a hit as well, going into rotation on MTV and earning a nomination at the 1998 Billboard Music Video Awards, in the category of Best New Artist Clip: Pop. (The video eventually lost to Natalie Imbrulia's "Torn".) Coppola's debut album, Chupacabra, was released in October 1997. The album elicited rave reviews from music critics, who favorably compared Coppola's music to that of De La Soul and Neneh Cherry. The album achieved a peak of number 47 on the Billboard Heatseekers Albums chart dated January 17, 1998, three months after the album's release. it spent a total of one week on the chart. The album also charted in the UK, where it peaked at number 138 on the UK Albums Chart. The album spawned a second single, "I'm a Tree", which samples The Doors' "Soul Kitchen". The song was unsuccessful, peaking only in Australia, where it reached number 201. That year, Coppola played Lilith Fair, although she was vocal about her opinion of Lilith founder Sarah McLachlan before the tour, indicating that she felt McLachlan was "boring to watch live". Coppola remarked that "I think she's a good songwriter, at times, and singer. She's boring to watch live, though." 2000–2006: Independent career Columbia Records dropped her in 2000, subsequently shelving her second studio album, Come and Get Me... What?! Coppola had been frustrated that the label wanted her to sample other artists when she wanted to compose her music entirely by herself. Then 22, Coppola felt she needed to learn considerably more about music and art. Never having performed beyond high school musical theater, Coppola felt she had achieved success too easily, without truly working for it. In 2001, she was featured on a single by the Baha Men, titled "You All Dat". The song, which was produced by Michael Mangini (who had previously produced Coppola's debut album), was successful upon its release, becoming a top 10 hit in Australia, where it peaked at number 8, giving Coppola her first top 10 hit in that region; it achieved a peak of 21 in New Zealand. In the United States, the song entered the Billboard Hot 100, where it peaked at number 94. It became Coppola's last US chart entry as a solo artist. The single also achieved success throughout Europe: it became a top 40 hit on the UK Singles Chart, where it achieved a peak of number 14, and on the Irish Singles Chart, on which it peaked at number 26. The song also charted in Austria, Germany, Sweden, and Switzerland. Without a major label behind her, Coppola started recording music at home in 2001; that same year, Coppola was part of the band supporting Sandra Bernhard in her off-Broadway production of The Love Machine. During this time, Coppola also starred in a movie, The Singing Biologist, playing Rose, the titular character. In 2004, Coppola released Afrodite, a neo-funk record that Vibe retrospectively deemed "excellent." By 2004, Coppola was playing acoustic guitar in small clubs like Forum in New York City with her drummer Alex Elana, in the Two Shadow Posse. These performances were not well-attended, and Coppola hated performing them. During this time period, Coppola fell into poverty and was forced to move to Staten Island. In 2005, she launched her own website and opened an online music store where she sold her independent albums; she decorated and packaged each copy of the album by hand. In that year, she also co-wrote the title track on Maia Sharp's Fine Upstanding Citizen, which Out Magazine deemed the album's strongest track. The following year, she contributed a song, titled "Woodstock", to American vocalist Alice Russell's debut album, For Lovers, Dreamers, and Me. In May of that year, Coppola performed with Peeping Tom on Late Night with Conan O'Brien. Subsequently, she went on tour with the band. In an interview with Erin Broadley in November 2007, Coppola indicated that she had enjoyed the experience of working with Patton and other artists, which she found artistically open. 2007–2009: The Black & White Album In 2007, Coppola was signed to Ipecac Recordings, which was started by Faith No More frontman Mike Patton. In November of that year, the label released Coppola's eighth studio album, The Black & White Album, her first "easily available release" since her debut album, released a decade before, according to AllMusic. Upon its release, the album received favorable reviews from music critics, earning a score of 75 out of 100 on review aggregate site Album of the Year. The album spawned two singles: "Raindrops from the Sun (Hey, Hey, Hey)", which appeared in an episode of Grey's Anatomy (titled "Kung Fu Fighting"), and "Woke Up White", which Spin included on their list of "Songs You Need to Download Now!" in their October 2007 issue. In November 2007, Coppola said in interview that she was unsure if she was going to tour to support The Black & White Album, citing financial concerns. She said, "I don't even have a car. I don't know, I would love to put together at least one banging show together for this album. Definitely, it deserves that." 2010–2016: The Glass Wall and collaborations Coppola took a break from her solo work to focus on Little Jackie; in 2010, Coppola released a new EP via Reverbnation, titled Imani's Magic Chicken Soup EP. It included one single - "Over It", which had an accompanying music video. In 2012, Coppola released her ninth solo studio album, The Glass Wall, via Bandcamp. The album is named for the New York City studio at which it was recorded. That year, she also contributed "Celebrate", recorded with Tim Myers, to the soundtrack for Butter. Two years later, in 2014, Coppola recorded a song titled "Perfect Days", which was written by Tarka Cordell. The song was featured on a charity compilation honoring the songwriter; other contributors included Lily Allen, Alice Temple, and Alice Smith. The following year, in 2015, Coppola collaborated with Blackalicious on "The Sun", performing the song's chorus. Regarding the collaboration, Chief Xcel told Hip Hop DX that "she’s just a genius, Imani Coppola. She’s one of the most brilliant writers I’ve ever worked with [...] We’d done quite a few versions actually of that, and all were really, really dope. But when Imani heard it and she put her thing on it, I was like, 'That was it...'" In 2015, Coppola traveled to West Hollywood to work on her singing career. In 2016, Coppola co-wrote and co-produced Hailey Knox's debut single, "Geeks", which was praised by Meghan Trainor; Coppola also wrote another of Knox's songs, "Awkward", with Michael Mangini, whom she had previously worked with on her debut album and in Little Jackie. 2017–present Hypocrites On July 21, 2017, Coppola premiered a new single, "Just Feels Good", via Yahoo! Music. Coppola had originally written the song with Rachel Platten in mind, but after Platten passed on it, Coppola decided to record it herself. The music video was shot at Coney Island's annual Mermaid Parade. Hypocrites, Coppola's twelfth studio album, which was crowdfunded using PledgeMusic, was released on the same day as the release of "Just Feels Good". Coppola produced the album, along with co-producer Josh Valleau. On September 25, 2017, Coppola released the album's second single, "Mixed Nut". Coppola stated that the song "poke(s) fun at some current social trends, such as speaking in a manner that makes it sound like you’re always asking a question when you’re actually making a statement. The term for it is ‘up speak,’ and I find it to be incredibly irritating even though I am sometimes guilty of doing it. Another pet peeve of the zeitgeist is this fixation people have with claiming not to be ‘one to judge.’ Please, if you are a human being, you judge." The accompanying music video filmed and edited by Vonesper Studios was shot in her apartment using her artwork as backdrops and premiered on Yahoo!Music. Little Jackie In 2007, Coppola was signed to S-Curve Records as part of the duo Little Jackie, with whom she collaborated with producer and multi-instrumentalist Adam Pallin. Coppola sees Little Jackie as an opportunity to get back into pop and also to generate the income she needs to follow her dream of developing artists herself. She indicates that "genre-bending acts" like Gnarls Barkley enabled her to return to the music industry. Speaking in July 2008 to noted UK R&B writer Pete Lewis of Blues & Soul, Coppola stated: "Whereas, in my opinion, Imani Coppola is a REAL artist, Little Jackie represents my 'POPULAR artist' side [...] And to me this is probably my last attempt at becoming a superstar! If it blows up — WONDERFUL! If I become a superstar — FANTASTIC!... And if I don't, I guess I'll stay very happy just being a crazy-lady artist — making art every day and having that be my food!" The duo has released three albums. Their first, The Stoop, was released in July 2008 by S-Curve Records. The album's lead single, "The World Should Revolve Around Me", became a top 20 hit in the United Kingdom and was featured as the theme song for the VH1 reality TV series New York Goes to Hollywood, in which Little Jackie make a guest appearance. The album received generally favorable reviews from music critics, earning a score of 64 out of 100 on review aggregate site Album of the Year. The album peaked at number 138 on the UK Albums Chart. In 2011, Little Jackie released their second album MADE4TV independently on their own Plush Moon Records. Their third album, Queen of Prospect Park, was released on 30 September 2014. It featured two songs that appeared in I Don't Know How She Does It—"We Got It" and "Move to the Beat"—and "Lose It", which was featured in an episode of Grey's Anatomy. Musical style Coppola says her songwriting is fused through a "pop sensibility". She indicates that her tastes and musical influences are diverse, including classical, which she acknowledges can be a problem in an industry that wants its artists to be clearly defined. Coppola decided to write in whatever genre she wanted. She describes her focus on The Black and White Album as "more experimental, more punk, more rock". Coppola uses a different process when she is songwriting for herself from when she is songwriting for another artist or writing on speculation. She says, "My brain changes, my thought processes, my body language changes, the way I work changes....; When you do work for other artists, it’s definitely more of a job and it requires a lot of tools." Coppola commented, "When I saw the Spice Girls come out, I was like: I could do anything! I think that might be the most honest thing I've ever said in my life. They were the only people rapping and singing in a group that had all different varieties of things. I think I am a result of the Spice Girls." Other musical endeavors Adept at co-writing songs, Coppola has been part of a number of song writing retreats including The Castle in the South of France where she wrote with Bon Jovi, and Fools Banquet, hosted by Hanson where she has written songs with the likes of Miles Zuniga, Taylor Hanson and Pedro Yanowitz. When Coppola isn't working on her own albums, she’s a prolific songwriter for TV, film and advertising, handcrafting songs for specific visual scenes and brands. Her music can be hear in commercials for the likes of Revlon, Gillette and Target. Coppola penned 'Move To The Beat" for the film I Don't Know How She Does It, and has had several songs on Grey’s Anatomy over the years. Coppola was chosen as a ghost writer for Cyndi Laupers' musical, Kinky Boots during its development stage. She has also performed as a violinist in the stage band for Lauper. Personal life Coppola lives in Bedford-Stuyvesant with her cat. She records out of her own home studio, but at one time shared a rehearsal space with Bob Dylan who commented that her practice was disturbing him. She has commented that she struggles with the modern demands for accessibility in the music world, such as online interviews and video blogs. In making choices in her own life, she has stated that she is torn between respect and resentment at the legacy left by her parents, explaining, "My parents are both artists and we starved, we went through a lot of difficulty growing up because of their choices in life [...] When it comes down to making important decisions about my life and my foundation, you know, their artistic side haunts me. Like maybe I should just do what they did." Coppola is also a talented painter and commented that her visual art brought in more income than her music in 2018. Imani means 'faith', and Coppola deeply connects to spirituality including tarot reading and witchcraft. Discography Solo Albums Singles Little Jackie Albums Singles References External links Afrodite at CD Baby 1978 births Living people 20th-century African-American women singers Alternative hip hop musicians American alternative rock musicians American people of Italian descent American punk rock singers Hip hop violinists Women punk rock singers American women rappers African-American women rappers American hip hop singers State University of New York at Purchase alumni Ipecac Recordings artists 21st-century American women singers 21st-century American rappers 21st-century American violinists 21st-century American singers 21st-century African-American women singers 21st-century women rappers
```c++ // Use, modification and distribution are subject to the // LICENSE_1_0.txt or copy at path_to_url // // This tests that cpp_dec_float_50 meets our // conceptual requirements when used with Boost.Math. // #ifdef _MSC_VER # define _SCL_SECURE_NO_WARNINGS # pragma warning(disable:4800) # pragma warning(disable:4512) # pragma warning(disable:4127) # pragma warning(disable:4512) # pragma warning(disable:4503) // decorated name length exceeded, name was truncated #endif #include <libs/math/test/compile_test/poison.hpp> #if !defined(TEST_MPF_50) && !defined(TEST_BACKEND) && !defined(TEST_MPZ) \ && !defined(TEST_CPP_DEC_FLOAT) && !defined(TEST_MPFR_50)\ && !defined(TEST_MPFR_6) && !defined(TEST_MPFR_15) && !defined(TEST_MPFR_17) \ && !defined(TEST_MPFR_30) && !defined(TEST_CPP_DEC_FLOAT_NO_ET) && !defined(TEST_LOGGED_ADAPTER)\ && !defined(TEST_CPP_BIN_FLOAT) # define TEST_MPF_50 # define TEST_BACKEND # define TEST_MPZ # define TEST_MPFR_50 # define TEST_MPFR_6 # define TEST_MPFR_15 # define TEST_MPFR_17 # define TEST_MPFR_30 # define TEST_CPP_DEC_FLOAT # define TEST_CPP_DEC_FLOAT_NO_ET # define TEST_LOGGED_ADAPTER # define TEST_CPP_BIN_FLOAT #ifdef _MSC_VER #pragma message("CAUTION!!: No backend type specified so testing everything.... this will take some time!!") #endif #ifdef __GNUC__ #pragma warning "CAUTION!!: No backend type specified so testing everything.... this will take some time!!" #endif #endif #if defined(TEST_MPF_50) || defined(TEST_MPZ) #include <boost/multiprecision/gmp.hpp> #endif #ifdef TEST_BACKEND #include <boost/multiprecision/concepts/mp_number_archetypes.hpp> #endif #if defined(TEST_CPP_DEC_FLOAT) || defined(TEST_CPP_DEC_FLOAT_NO_ET) || defined(TEST_LOGGED_ADAPTER) #include <boost/multiprecision/cpp_dec_float.hpp> #endif #if defined(TEST_MPFR_50) || defined(TEST_MPFR_6) || defined(TEST_MPFR_15) || defined(TEST_MPFR_17) || defined(TEST_MPFR_30) #include <boost/multiprecision/mpfr.hpp> #endif #if defined(TEST_CPP_BIN_FLOAT) #include <boost/multiprecision/cpp_bin_float.hpp> #endif #ifdef TEST_LOGGED_ADAPTER #include <boost/multiprecision/logged_adaptor.hpp> #endif #include <boost/math/special_functions.hpp> template <class T> void test_extra(T) { T v1, v2, v3; int i; boost::math::beta(v1, v2); boost::math::beta(v1, v2, v3); boost::math::betac(v1, v2, v3); boost::math::ibeta(v1, v2, v3); boost::math::ibetac(v1, v2, v3); boost::math::ibeta_derivative(v1, v2, v3); } void foo() { #ifdef TEST_BACKEND test_extra(boost::multiprecision::concepts::mp_number_float_architype()); #endif #ifdef TEST_MPF_50 test_extra(boost::multiprecision::mpf_float_50()); #endif #ifdef TEST_MPFR_50 test_extra(boost::multiprecision::mpfr_float_50()); #endif #ifdef TEST_MPFR_6 test_extra(boost::multiprecision::number<boost::multiprecision::mpfr_float_backend<6> >()); #endif #ifdef TEST_MPFR_15 test_extra(boost::multiprecision::number<boost::multiprecision::mpfr_float_backend<15> >()); #endif #ifdef TEST_MPFR_17 test_extra(boost::multiprecision::number<boost::multiprecision::mpfr_float_backend<17> >()); #endif #ifdef TEST_MPFR_30 test_extra(boost::multiprecision::number<boost::multiprecision::mpfr_float_backend<30> >()); #endif #ifdef TEST_CPP_DEC_FLOAT test_extra(boost::multiprecision::cpp_dec_float_50()); #endif #ifdef TEST_CPP_BIN_FLOAT test_extra(boost::multiprecision::cpp_bin_float_50()); #endif #ifdef TEST_CPP_DEC_FLOAT_NO_ET test_extra(boost::multiprecision::number<boost::multiprecision::cpp_dec_float<100>, boost::multiprecision::et_off>()); #endif #ifdef TEST_LOGGED_ADAPTER typedef boost::multiprecision::number<boost::multiprecision::logged_adaptor<boost::multiprecision::cpp_dec_float<50> > > num_t; test_extra(num_t()); #endif } int main() { foo(); } ```
```shell #!/bin/bash set -e VERSION="0.4.0" PROTECTED_MODE="no" export GO15VENDOREXPERIMENT=1 cd $(dirname "${BASH_SOURCE[0]}")/../ OD="$(pwd)" # temp directory for storing isolated environment. TMP="$(mktemp -d -t sdb.XXXX)" function rmtemp { rm -rf "$TMP" } trap rmtemp EXIT if [ "$NOCOPY" != "1" ]; then # copy all files to an isloated directory. WD="$TMP/src/github.com/tidwall/summitdb" export GOPATH="$TMP" for file in `find . -type f`; do # TODO: use .gitignore to ignore, or possibly just use git to determine the file list. if [[ "$file" != "." && "$file" != ./.git* && "$file" != ./data* && "$file" != ./summitdb-* ]]; then mkdir -p "$WD/$(dirname "${file}")" cp -P "$file" "$WD/$(dirname "${file}")" fi done cd $WD fi package(){ echo Packaging $1 Binary bdir=summitdb-${VERSION}-$2-$3 rm -rf packages/$bdir && mkdir -p packages/$bdir GOOS=$2 GOARCH=$3 ${BASH_SOURCE[0]} # ./build.sh if [ "$2" == "windows" ]; then mv summitdb-server packages/$bdir/summitdb-server.exe else mv summitdb-server packages/$bdir fi cp README.md LICENSE CHANGELOG.md packages/$bdir cd packages if [ "$2" == "linux" ]; then tar -zcf $bdir.tar.gz $bdir else zip -r -q $bdir.zip $bdir fi rm -rf $bdir cd .. } if [ "$1" == "package" ]; then rm -rf packages/ package "Windows" "windows" "amd64" package "Mac" "darwin" "amd64" package "Linux" "linux" "amd64" package "ARM" "linux" "arm" package "FreeBSD" "freebsd" "amd64" exit fi # build and store objects into original directory. go build -ldflags "-X main.version=$VERSION" -o "$OD/summitdb-server" cmd/summitdb-server/*.go ```
Saskia de Brauw (born 19 April 1981) is a Dutch artist and model. She began modeling at sixteen but quit after one year to attend art school in Amsterdam. Returning to modeling at the age of 29, she quickly became a successful fashion model. Notable appearances include Carine Roitfeld's final cover for French Vogue (2011) and a starring role in David Bowie's 2013 music video The Stars (Are Out Tonight). Her photographs of found objects have been exhibited at the National Museum of Scotland. She and her husband, photographer and filmmaker Vincent van de Wijngaard, collaborate on multimedia projects that include his photographs and her writing. Career After an early start in the fashion world, de Brauw left modeling at 16 to pursue her interest in art, studying the subject at the Gerrit Rietveld Academie in her home town of Amsterdam. Returning to modeling at age 29, she appeared in fashion shows for Balenciaga and Givenchy and became a "new face" for Chanel; photographed by Mert and Marcus for Carine Roitfeld's final cover of Vogue Paris in March 2011; and the same month featuring on the cover of Vogue Italia, photographed by Steven Meisel. She has appeared in editorials for Italian, American, French, British, German, Russian, Japanese, Korean, and Chinese Vogue, Harper's Bazaar, W, i-D, LOVE, V, Numéro, Dazed, and Interview. She has appeared on the covers of Italian, French, German, Dutch, Russian, Japanese, and Korean Vogue, Dutch Elle, Numéro, V, i-D, and Dazed. She has walked the runways for Lanvin, Céline, Marc Jacobs, Bottega Veneta, Versace, Thierry Mugler, Prada, Giles Deacon, Hugo Boss, Balmain, Jean Paul Gaultier, Stella McCartney, Donna Karan, Fendi, Emilio Pucci, Jason Wu, Diane Von Furstenberg, Altuzarra, Givenchy, Max Mara, Chanel, Louis Vuitton, Isabel Marant, Yves Saint Laurent, Loewe, Sonia Rykiel, Armani Privé, Hermés, Balenciaga, Rick Owens, Tom Ford, Roberto Cavalli, Anna Sui, Derek Lam, Dolce & Gabbana, Narciso Rodriguez, and Miu Miu. De Brauw has appeared in advertising campaigns for GIADA, Moschino, Chanel, Giorgio Armani, Loewe, Max Mara, Calvin Klein, Fendi, Prada, Lanvin, Karl Lagerfeld, Yves Saint Laurent, Givenchy, Moncler, Zara, Missoni, Louis Vuitton, DSquared2, Paul Smith, Bottega Veneta, Versace, H&M, Fossil, Bergdorf Goodman, and Barneys New York. . In 2023 Saskia became the face of Roberto Cavalli Spring collection campaign. In 2013, she appeared alongside Andreja Pejić, Tilda Swinton, Iselin Steiro and David Bowie for Bowie's 2013 single "The Stars (Are Out Tonight)" as one of the "stars". In her art, De Brauw explores the relationship between the physical body and its surroundings. Her work encompasses both photography and installation, as well as written verse and prose. During the 2014 Edinburgh International Fashion Festiva, de Brauw's enlarged photographs of discarded objects became the basis for an exhibition The Accidental Fold at the National Museum of Scotland. In 2016, she published a book based on that exhibition. In 2015, de Brauw began a collaboration with her husband, photographer and filmmaker Vincent van de Wijngaard, that included a film of De Brauw walking a north–south route through Manhattan from 225th Street to Battery Park, during a single day in May. This work resulted in 2018 in a multimedia exhibition Ghosts Don’t Walk in Straight Lines. De Brauw and de Wijngaard live in upstate New York, where they continue to collaborate on multimedia projects. References External links Blog Official website 1981 births Living people Dutch artists Dutch female models Artists from Amsterdam Place of birth missing (living people)
```shell Execute a command without saving it in history Clear bash history Find any Unix / Linux command Quick `bash` shortcuts `else` statements using the `||` operator ```
```go package matchers import ( "bytes" "fmt" "github.com/google/go-cmp/cmp" "github.com/onsi/gomega/format" ) type BeComparableToMatcher struct { Expected interface{} Options cmp.Options } func (matcher *BeComparableToMatcher) Match(actual interface{}) (success bool, matchErr error) { if actual == nil && matcher.Expected == nil { return false, fmt.Errorf("Refusing to compare <nil> to <nil>.\nBe explicit and use BeNil() instead. This is to avoid mistakes where both sides of an assertion are erroneously uninitialized.") } // Shortcut for byte slices. // Comparing long byte slices with reflect.DeepEqual is very slow, // so use bytes.Equal if actual and expected are both byte slices. if actualByteSlice, ok := actual.([]byte); ok { if expectedByteSlice, ok := matcher.Expected.([]byte); ok { return bytes.Equal(actualByteSlice, expectedByteSlice), nil } } defer func() { if r := recover(); r != nil { success = false if err, ok := r.(error); ok { matchErr = err } else if errMsg, ok := r.(string); ok { matchErr = fmt.Errorf(errMsg) } } }() return cmp.Equal(actual, matcher.Expected, matcher.Options...), nil } func (matcher *BeComparableToMatcher) FailureMessage(actual interface{}) (message string) { return fmt.Sprint("Expected object to be comparable, diff: ", cmp.Diff(actual, matcher.Expected, matcher.Options...)) } func (matcher *BeComparableToMatcher) NegatedFailureMessage(actual interface{}) (message string) { return format.Message(actual, "not to be comparable to", matcher.Expected) } ```
Henderson East is a suburb of Honiara, Solomon Islands and is located East of Honiara International Airport. References Populated places in Guadalcanal Province Suburbs of Honiara
Marcos "Barrão" DaSilva (born 1961) is a Brazilian capoeira mestre (master) and founder of Grupo Axé Capoeira, which has schools worldwide. He began Grupo Axé officially in 1982 in Vancouver and since has had schools established around the world. First Mestre: Mestre Pirajá Marcos "Barrão" DaSilva was born in Recife in 1961 into a state of poverty. He displayed an early talent for the drums, with which he earned his keep as a lad. At the age of 13, Mestre Pirajá (who was taught by his brother, a student of Mestre Bimba) took young Marcos under his wing and started to teach him Capoeira. An academy capoeirista by trade, Mestre Pirajá taught Barrão the discipline and techniques of Capoeira. Legacy Mestre Barrão began to enter tournaments and became the Brazilian Champion in the National Capoeira Championships in Rio de Janeiro. He opened his school, Grupo Axé Capoeira, in 1982. In 1987, he was given the rank of 1st Degree Mestre by Pirajá. He then moved to Vancouver and opened an academy there. In 2007, he launched an academy in his hometown of Recife and he currently resides there. Mestre Barrão has been invited to teach and conduct workshops and batizados all over the world. He is the recipient of many awards. He was instrumental in re-introducing a dance known as Coco de Roda. He continues to contribute to the development of Capoeira and passes on his philosophy to all 20,000 members of his school. References Axé Capoeira Vancouver https://web.archive.org/web/20120309143426/http://www.axecapoeira-az.com/about-grupo-axe-capoeira/ External links Mestre Barrão, Axé Capoeira Vancouver axecapoeira.com 1961 births Living people Capoeira mestres Brazilian capoeira practitioners
The 2018 AIHL season was the 19th season of the Australian Ice Hockey League (AIHL). It ran from 21 April 2018 until 26 August 2018, with the Goodall Cup finals following on 1 and 2 September 2018. The CBR Brave won both the H Newman Reid Trophy after finishing the regular season with the most points in league history, and the Goodall Cup for the first time by defeating the Sydney Bears in the final. Teams In 2018 the AIHL had 8 teams competing in the league. League business In December 2017 the Sydney Ice Dogs released their logo for the 2018 season. The design was an adjusted version of the 15th anniversary logo, replacing the "XV" with a shield. A few days later the Sydney Bears unveiled their new logo featuring a re-designed Bear. Following the release of their new logo the Bears released their new jerseys which included a black home, white away and a red alternate version. In February 2018 the Bears signed All About Caring as a major sponsor for the season. The same month the Melbourne Mustangs signed with The Kodiak Group to be their new naming rights sponsor for the next two seasons. The Kodiak Group replace The James Hotel who held the rights in 2017. In March 2018 the Melbourne Ice signed partnerships with the charity 300 Blankets and not-for-profit Kids Under Cover. Both organisations focus on helping the homeless and part of deal with 300 Blankets will see the Ice selling blankets at their home games. In April the Adelaide Adrenaline signed with Complete Podiatry to be a sponsor and the club's official podiatry clinic. Also in April the Mustangs announced that they had signed with restaurant Billy's District to be their post-game venue, replacing The James Hotel which had been their venue since May 2016. On 8 April the Newcastle Northstars that Warners at the Bay had signed with the club as their official post-game venue for 2018. The Melbourne Ice announced on 10 April that they had signed with Tempur Australia to be their naming rights sponsor for the next three years. The deal also included captain Lliam Webster being appointed as a brand ambassador for Tempur. The Brave announced that The Signal Co. Wireless and Maliganis Edwards Johnson had signed on as major sponsors and Ace High Eatery & Bar, Care Traffic, Coffey, Compass Wealth Group and T C Air & Electric had signed on as business sponsors for 2018. The Brave also switched their post game venue to the Hellenic Club of Canberra's Fillos Taverna + Bar, replacing The Woden Tradies & Quality Hotel which had been their venue since June 2017. In April the Sydney Ice Dogs signed with the Holiday Inn Express Sydney Macquarie Park to be a major sponsor for the 2018 season. They also announced that they would partner with Cheapskate Hockey to create an alternative jersey as well as produce a line of merchandise. The alternate jersey will feature a redesigned bulldog logo. On 20 April the Sydney Ice Dogs announced that The Ranch Hotel would be their post game venue for 2018, replacing TGI Fridays Macquarie Centre which was their venue for the previous season. Exhibition games In January 2018 the Perth Thunder announced that they would hold a three-game exhibition series against an All-Stars team from the China Ice Hockey League. The games were held on 15, 17 and 17 February at the Perth Ice Arena. The Thunder lost the opening game 1–3 but tied the series with a 4–1 in game two. The All-Stars won the series with a 2–1 win in game three. On 7 April the Melbourne Ice and Melbourne Mustangs held their annual exhibition match at the O'Brien Group Arena. The Ice defeated the Mustangs 3–2. The following week the Melbourne Ice hosted the Hockey Festival at the O'Brien Group Arena. The festival ran over 14 and 15 April and included the Ice, Adelaide Adrenaline, CBR Brave and Melbourne Mustangs. Day one of the festival saw each team compete in a round-robin competition in order to determine the playoff spots on day two. The Mustangs finished the round-robin at the top of the standings, one point ahead of the Ice, the Adrenaline finished in third and the Brave in last place. Day two included two games, a final between first and second and a placement game for third place. The Ice defeated the Mustangs 3–2 in the final to claim the Warrior Cup, while the Adrenaline beat the Brave 4–2 to finish in third place. Personnel changes On 15 October the Newcastle Northstars announced that Andrew Petrie had stepped down from the position of head coach following a mutual decision with the club. A month later the Sydney Ice Dogs announced the signing of Petrie as their head coach. Petrie replaced Christopher Blagg who moved into the position of club president. Petrie previously coached the Ice Dogs in 2014. On 14 November the Melbourne Mustangs' announced that head coach Michael Flaherty would not be returning for the 2018 season. Flaherty was replaced two weeks later by Maxime Langelier-Parent, a former import for the club who had served as an assistant coach in 2017. On 10 February the Ice Dogs announced Jason Juba had stepped down from his positions of general manager and vice president in order to focus on family and business. Also in February the CBR Brave announced that they had signed Mike Sargeant and Gordon Cockell as assistant coaches for the 2018 seasons. In April the Adelaide Adrenaline announced that Sami Mantere had stepped down from the position of head coach in order to return full time as a player for the club. Mantere was also signed on as an assistant coach. Mantere was replaced in the position of head coach by Jim Fuyarchuk. On 17 April the Brave announced that they had signed Johan Steenberg as Director of Player Development and Player Personnel. Steenberg was previously at the Melbourne Ice from 2014 to 2017 as their goaltending coach. On 19 April Northstars announced that Joey Theriault, Ray Sheffield and Garry Doré will share the coaching duties for the 2018 season, replacing Andrew Petrie who left in October 2017. Just prior to the start of the season the Melbourne Ice announced the signing of Peter Ekroth to the position of head coach. Ekroth replaced Charles Franzén who has moved into the position of Director of Coaching and Player Development. Player transfers Interclub transfers Retirements New signings Players lost Regular season The regular season began on 21 April 2018 and will run through to 26 August 2018 before the top four teams advance to compete in the Goodall Cup playoff series. April May June July August Standings Source Statistics Scoring leaders List shows the ten top skaters sorted by points, then goals. Current as of 23 September 2018 Leading goaltenders Only the top five goaltenders, based on save percentage with a minimum 40% of the team's ice time. Current as of 23 September 2018 Season awards Below lists the 2018 AIHL regular season award winners. Source pt1 Source pt2 Goodall Cup playoffs The 2018 playoffs was scheduled for 1 September with the Goodall Cup final held on 2 September. Following the end of the regular season the top four teams advanced to the playoff series which was held at O'Brien Group Arena in the Docklands precinct of Melbourne, Victoria. The series was a single game elimination with the two winning semi-finalists advancing to the Goodall Cup final. The Goodall Cup was won by the CBR Brave (first title) who defeated the Sydney Bears 4-3 in overtime after the two sides finished regulation time locked at 3-3. The Brave’s Canadian import forward, Trevor Gerling, was named the finals most valuable player (MVP) after he scored the winning goal in overtime. All times are UTC+10:00 Semi-finals Final All-Star weekend The 2018 AIHL All-Star Weekend was held at the Adelaide Ice Arena, Adelaide on 2 and 3 June 2018. The format of the weekend was unchanged from 2017 with a skills competition on 2 June and an all-stars game on 3 June. Adelaide Adrenaline's Josef Rezek and David Huxley were initially announced as the captains of the two teams replacing Jamie Bourke and Lliam Webster from 2016. Huxley was later replaced by the Adrenaline's Zachary Boyle due to Huxley's retirement prior to the 2018 season. The Adrenaline's head coach Jim Fuyarchuk and assistant coach Sami Mantere were named as the coaches of Team Boyle and Team Rezek respectively. APA Group re-signed as sponsor of the weekend after sponsoring the previous three events. The skills competition saw the Adelaide Adrenaline and Sydney Bears take out two of the seven events each, while the Newcastle Northstars, Perth Thunder and Sydney Ice Dogs all picked up one each. On 3 June Team Rezek defeated Team Boyle 13-8 in the All-Star Game to claim the Mick McCormack Cup. Skills competition Breakaway Challenge: Josef Rezek (Adelaide Adrenaline) Elimination Shootout: Sebastian Andersson (Adelaide Adrenaline) Fastest Skater: Jamie Woodman (Perth Thunder) – 12.53 seconds Goaltender Race: Anthony Kimlin (Sydney Bears) Hardest Shot: Nathan Chiarlitti (Sydney Ice Dogs) – 154 km/h Shooting Accuracy: Nick Rivait (Newcastle Northstars) – 12.65 seconds Stickhandling: Charlie Adams (Sydney Bears) – 18.15 seconds All-star game References External links The Australian Ice Hockey League 2018 in ice hockey 2018 in Australian sport 2018
Danny Schofield, known professionally as DannyBoyStyles (and previously known as Styles), is an American Grammy award-winning record producer, engineer, songwriter, and composer. He produced all ten tracks on the Weeknd's album Kiss Land and won a Grammy for his work on the Weeknd's follow-up, Beauty Behind the Madness. Early life and career Schofield was born and raised in Miami, Florida. His first hit as a producer was "This Is Why I'm Hot" for Mims in 2007, which would go on to peak at #1 on the Billboard Hot 100. He also produced most of the other songs on Mims' Music Is My Savior album as part of DJ Blackout's Blackout Movement. A few years later, he was introduced to Amir "Cash" Esmailian and Tony Sal, co-managers to the Weeknd and Canadian rapper Belly. He would go on to produce all 10 tracks on the Weeknd's debut studio album Kiss Land which was released in September 2013. He won his first Grammy for his work on the Weeknd's Beauty Behind the Madness which included production and songwriting work on "Often", "Acquainted", and "Angel." In October 2013, he joined Ben Billions and Belly to co-write "6 Inch" for Beyoncé featuring the Weeknd. The song would eventually appear on Lemonade which was nominated for Album of the Year at the 2017 Grammy Awards and won for Best Urban Contemporary Album. DannyBoyStyles is also a frequent collaborator with The Weeknd and Belly and has produced or written songs for a variety of artists including French Montana, NAV, and Juicy J. Songwriting and production discography Albums Songs References External links Songwriters from Florida Record producers from Florida Year of birth missing (living people) Living people
```yaml description: Synopsys DesignWare Ethernet compatible: "snps,designware-ethernet" include: ethernet-controller.yaml properties: reg: required: true interrupts: required: true ```
```html <!DOCTYPE html> <html> <head> <link rel="stylesheet" href="/global.css"> </head> <body> <a href="/">&larr; Examples index</a> <div id="app"></div> <script src="/__build__/basic-render.js"></script> </body> </html> ```
```javascript /** * A JavaScript primitive. * * @typedef {(number|string|boolean|null|undefined)} primitive */ ```
```smalltalk Package { #name : 'FreeType-Tests' } ```
Martin Kosleck (born Nicolaie Yoshkin, March 24, 1904 – January 15, 1994) was a German film actor. Like many other German actors, he fled when the Nazis came to power. Inspired by his deep hatred of Adolf Hitler and the Nazis, Kosleck made a career in Hollywood playing villainous Nazis in films. While in the United States, he appeared in more than 80 films and television shows in a 46-year span. His icy demeanor and piercing stare on screen made him a popular choice to play Nazi villains. He portrayed Joseph Goebbels, Adolf Hitler's propaganda minister, five times, and also appeared as an SS trooper and a concentration camp officer. Early life Kosleck was born in Barkotzen in Pomerania, Germany, the son of a forester. His family was "German-Russian". He became interested in acting at an early age. He spent six years in the Max Reinhardt Dramatic School, particularly excelling in Shakespearian roles, and working in revues and musicals in Berlin. At the age of 23, he appeared in his first film, a silent movie directed by Johannes Brandt called Der Fahnenträger von Sedan. Two years later, he appeared in Lupu Pick's Napoleon at Saint Helena. Kosleck appeared in two more films in Germany in 1930, the science-fiction thriller Alraune (his first sound film) and The Singing City. Hollywood In the early 1930s, Hitler and the Nazi Party were growing in power. Kosleck spoke out against both and decided to leave Germany in 1931 for Britain. The following year, he arrived in New York City and then traveled west to Hollywood. In 1933, when Hitler and the Nazi Party came to power, because of his opposition to the Nazis, Kosleck was placed on the Gestapo list of "undesirables". He appeared in his first American film Fashions of 1934 starring Bette Davis. However, he found little work in Hollywood, so he returned to New York and the stage. While Kosleck was acting in The Merchant of Venice on Broadway, Anatole Litvak invited him to Hollywood for a role in a Warner Bros. film. The highly controversial Confessions of a Nazi Spy, starring Edward G. Robinson, Francis Lederer, Paul Lukas, and George Sanders, was based on The Nazi Spy Conspiracy in America, a book by Leon Turron, an FBI agent who had uncovered the network of Nazi organizations throughout the United States. Kosleck, in a small role playing Nazi Propaganda Minister Joseph Goebbels, revealed a sinister streak of evil that was sought after in wartime movies to come. Many other German actors at the time resented being typecast as Nazis; Kosleck, though, reveled in it as a way to get back at the Nazis. He appeared in numerous anti-Nazi films of the early 1940s: Nurse Edith Cavell, Espionage Agent, Underground, Berlin Correspondent, Bomber's Moon, and Chetniks! The Fighting Guerrillas. However, it was his impression of Goebbels that will remain in the memories of moviegoers, especially in Paramount's 1944 pseudo-documentary The Hitler Gang. With the end of the Second World War, roles as Nazis declined. Kosleck then moved into horror B movies, such as The Frozen Ghost and The Mummy's Curse (both starring Lon Chaney Jr., whom Kosleck disliked intensely), House of Horrors, and She-Wolf of London, starring June Lockhart. The House of Horrors gave him his best-remembered role beyond Goebbels, as an insane sculptor, Marcel De Lange, who saves a monster from drowning and gets revenge by having the monster kill his critics. Television With fewer film opportunities presenting themselves, Kosleck returned to New York City with his wife, the German-born actress Eleonore von Mendelssohn, a great x3 grand daughter of Moses Mendelssohn. Kosleck appeared on Broadway in The Madwoman of Chaillot in the late 1940s and early 1950s. He also appeared on television in episodes of numerous shows. In 1951, he appeared in the "I Lift Up My Lamp" episode of Hallmark Hall of Fame, a television anthology of plays and books, and episodes of The Motorola Television Hour, where he played Goebbels again, Studio One, Thriller, The Rifleman, Voyage to the Bottom of the Sea, The Outer Limits, Get Smart, Batman (playing Professor Avery Evans Charm), The Man from U.N.C.L.E., The F.B.I., The Wild Wild West, Mission: Impossible, It Takes a Thief, and Sanford and Son. In 1970, Kosleck played (Gestapo) General Mueller in the television comedy Hogan's Heroes, episode: "The Gestapo Takeover". He suffered from a heart attack in the 1970s, and thereafter worked only occasionally, mostly in television. During this time, he appeared in Love, American Style; Banacek; and Sanford and Son. In 1980, he appeared in his last film, The Man with Bogart's Face. Aside from acting, Kosleck was an accomplished painter who supported himself through his work as a portrait artist while waiting for a movie role. An impressionist-style portrait-painter, he painted both Bette Davis and Marlene Dietrich. Personal life Kosleck was in a relationship with fellow actor and German emigrant Hans Heinrich von Twardowski from the early 1930s until Twardowski's death in 1958. Their sometimes turbulent relationship is discussed in many letters between Twardowski and his close friend Marlene Dietrich. In 1947, Kosleck married in an unexpected act the German actress Eleonora von Mendelssohn (her only film is Black Hand, 1950), who committed suicide in 1951. Kosleck died at age 89, following abdominal surgery, in a Santa Monica convalescent home. Filmography Der Fahnenträger von Sedan (1927) Napoleon at Saint Helena (1929) Alraune (1929) - Wolfgang Petersen The Singing City (1930) - Bobby Bertling - Claires Verehrer Fashions of 1934 (1934) - Dance Director (uncredited) Confessions of a Nazi Spy (1939) - Joseph Goebbels (uncredited) Nurse Edith Cavell (1939) - Pierre Espionage Agent (1939) - Karl Mullen Nick Carter, Master Detective (1939) - Otto King Calling Philo Vance (1940) - Gamble Foreign Correspondent (1940) - Tramp The Mad Doctor (1941) - Maurice Gretz Underground (1941) - Heller International Lady (1941) - Bruner The Devil Pays Off (1941) - Grebb, Henchman All Through the Night (1942) - Steindorff Fly-by-Night (1942) - George Taylor Nazi Agent (1942) - Kurt Richten Berlin Correspondent (1942) - Captain von Rau Divide and Conquer (1942) - German Officer (uncredited) Manila Calling (1942) - Heller Chetniks! The Fighting Guerrillas (1943) - Col. Wilhelm Brockner Bomber's Moon (1943) - Luftwaffe Maj. von Streicher The North Star (1943) - Dr. Richter The Great Alaskan Mystery (1944, Serial) - Dr. Hauss The Hitler Gang (1944) - Joseph Goebbels Secrets of Scotland Yard (1944) - Josef The Mummy's Curse (1944) - Ragheb Strange Holiday (1945) - Examiner The Frozen Ghost (1945) - Rudi Poldan Gangs of the Waterfront (1945) - Anjo Ferreati Pursuit to Algiers (1945) - Mirko The Spider (1945) - Mihail Barak Crime of the Century (1946) - Paul Just Before Dawn (1946) - Karl Ganss House of Horrors (1946) - Marcel De Lange The Wife of Monte Cristo (1946) - Edmund Dantes, Count of Monte Cristo She-Wolf of London (1946) - Dwight Severn The Beginning or the End (1947) - Dr. O.E. Frisch (uncredited) Half Past Midnight (1948) - Cortez Assigned to Danger (1948) - Louie Volkes Smugglers' Cove (1948) - Count Boris Petrov Spion für Deutschland (1956) - Griffins Something Wild (1961) - Landlord Hitler (1962) - Joseph Goebbels The Flesh Eaters (1964) - Prof. Peter Bartell 36 Hours (1965) - Kraatz Morituri (1965) - Wilke Agent for H.A.R.M. (1966) - Basil Malko Wake Me When the War Is Over (1969, TV Movie) - Butler Which Way to the Front? (1970) - Captain Schmidt (uncredited) Longstreet (1971, TV Movie) - Von Marks The Man with Bogart's Face (1980) - Horst Borsht (final film role) References External links 1904 births 1994 deaths People from Bytów County Actors from the Province of Pomerania German male film actors German male television actors German male stage actors 20th-century German male actors Emigrants from Nazi Germany to the United States American male film actors American people of Russian descent 20th-century American male actors
```c++ // sol2 // 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. #ifndef SOL_TESTS_COMMON_CLASSES_HPP #define SOL_TESTS_COMMON_CLASSES_HPP #include <iostream> struct woof { int var; int func(int x) { return var + x; } double func2(int x, int y) { return var + x + y + 0.5; } std::string func2s(int x, std::string y) { return y + " " + std::to_string(x); } }; struct thing { int v = 100; thing() { } thing(int x) : v(x) { } }; struct non_copyable { non_copyable() = default; non_copyable(non_copyable&& other) noexcept = default; non_copyable& operator=(non_copyable&& other) noexcept = default; non_copyable(const non_copyable& other) noexcept = delete; non_copyable& operator=(const non_copyable& other) noexcept = delete; }; struct vars { vars() { } int boop = 0; ~vars() { } }; struct fuser { int x; fuser() : x(0) { } fuser(int x) : x(x) { } int add(int y) { return x + y; } int add2(int y) { return x + y + 2; } }; namespace crapola { struct fuser { int x; fuser() : x(0) { } fuser(int x) : x(x) { } fuser(int x, int x2) : x(x * x2) { } int add(int y) { return x + y; } int add2(int y) { return x + y + 2; } }; } // namespace crapola class Base { public: Base(int a_num) : m_num(a_num) { } int get_num() { return m_num; } protected: int m_num; }; class Derived : public Base { public: Derived(int a_num) : Base(a_num) { } int get_num_10() { return 10 * m_num; } }; class abstract_A { public: virtual void a() = 0; virtual ~abstract_A() { } }; class abstract_B : public abstract_A { public: virtual void a() override { std::cout << "overridden a() in B : public A - BARK" << std::endl; } }; struct Vec { float x, y, z; Vec(float x, float y, float z) : x { x }, y { y }, z { z } { } float length() { return sqrtf(x * x + y * y + z * z); } Vec normalized() { float invS = 1 / length(); return { x * invS, y * invS, z * invS }; } }; struct giver { int a = 0; giver() { } void gief() { a = 1; } static int stuff() { std::cout << "stuff" << std::endl; return 97; } static void gief_stuff(giver& t, int a) { t.a = a; } ~giver() { } }; struct lua_object { #define MAX_INFO_STRING 64 char info[MAX_INFO_STRING]; const char stuck_info[MAX_INFO_STRING]; lua_object() : info("blah"), stuck_info("solid") { } }; #endif // SOL_TESTS_COMMON_CLASSES_HPP ```
```python #!/usr/bin/env python # -*- coding: utf-8 -*- # see license path_to_url#license-and-copyright """ Describe the GitHub repo version tags and commit hash for the `pytextrank` library. """ from os.path import dirname, abspath import pathlib import typing from git import Repo # pylint: disable=E0401 # type: ignore ## use the local Git info for version info, if available REPO_HASH: str = "xxxxxxxxx" # default/placeholder REPO_TAGS: str = "refs/tags/v1.0.0" # default/placeholder try: repo_path: pathlib.Path = pathlib.Path(dirname(abspath(__file__))) repo: Repo = Repo(repo_path.parents[0]) REPO_HASH = str(repo.head.commit) REPO_TAGS = repo.tags except Exception as ex: # pylint: disable=W0703 print(ex) # cast version string into a float try: v_seq: typing.List[ str ] = str(REPO_TAGS[-1]).replace("v", "").split(".")[:3] __version__ = ".".join(v_seq) # this is the OpenAPI documentation version __version_major__ = int(v_seq[0]) __version_minor__ = int(v_seq[1]) __version_patch__ = int(v_seq[2]) except IndexError: # the code above may fail in Github Actions workflow __version__ = "0.0+test" __version_major__ = 0 __version_minor__ = 0 __version_patch__ = 0 def get_repo_version ( ) -> typing.Tuple[ str, str ]: """ Access the Git repository information and return items to identify the version/commit running in production. returns: version tag and commit hash """ return __version__, REPO_HASH ```
Sir Roger Owen Douglas (born 5 December 1937) is a retired New Zealand politician who served as a minister in two Labour governments. He became arguably best known for his prominent role in New Zealand's radical economic restructuring in the 1980s, when the Fourth Labour Government's economic policy became known as "Rogernomics". Douglas served as a Labour Member of Parliament from 1969 to 1990. During his time as Minister of Finance (1984 to 1988), the government floated the New Zealand dollar, introduced corporate practices to state services, sold off state assets, and removed a swathe of regulations and subsidies. Some Labour Party supporters regarded Douglas's economic policies as a betrayal of Labour's left-wing policy-platform, and the moves became deeply unpopular with the public and with ordinary party members. His supporters defended the reforms as necessary to revive the economy, which had been tightly regulated under National's Muldoon (Minister of Finance from 1975 to 1984). As a result of his flat tax proposal, Douglas came into conflict with Prime Minister David Lange, and he eventually resigned as Finance Minister; when Douglas was re-elected to Cabinet in 1989 Lange himself resigned as Prime Minister, signalling the demise of the Labour government. In 1993 Douglas and Derek Quigley founded the Association of Consumers and Taxpayers (the forerunner of the ACT New Zealand party) as a means to further his policy ideas. Douglas returned to Parliament as an ACT backbencher in 2008 before retiring in 2011. Early life and background Douglas was born on 5 December 1937. His family had strong ties with the trade-union movement, and actively engaged in politics. His grandfather, William Theophilus "Bill" Anderton, (1891–1966), was a left-wing Methodist local preacher and small business owner in Birmingham, England, who migrated to New Zealand with his wife in 1921. Anderton served as MP for Eden from 1935–1946, then as MP for from 1946–1960. He was Minister of Internal Affairs in the 1957–1960 Second Labour Government, establishing the Arts Council. Roger Douglas's father, Norman Vazey Douglas, (1910–1985), a former trade union secretary, served as MP for from 1960–1975, and as opposition spokesman for labour, education, and social security from 1967–1972. Roger's brother Malcolm Douglas was briefly Labour MP for 1978–1979. Douglas grew up in a state house in Ewenson Avenue, One Tree Hill, Auckland. He attended Ellerslie Primary School, excelling in arithmetic and sports. Douglas attended Auckland Grammar School between 1950 and 1955, where he was a prefect and an avid cricket and rugby player. Douglas had a summer job at the Auckland accounting firm Mabee, Halstead and Kiddle, accepting a job there at the end of 1952. He gained a degree in accountancy from Auckland University College in 1957. Afterwards, he was hired by Bremworth Carpets in South Auckland as company secretary. He married Glenis June Anderson and moved to Mangere in 1961, becoming President of the Manukau Labour Electorate Committee. He began to run the Bremworth division individually after the company's sale to UEB in the mid-1960s. He also served as campaign manager for successful Labour candidate Colin Moyle in 1963. Political career After some experience in local body politics as a member of the Manukau City Council between 1965 and 1969, where he had been instrumental in the plans to purchase the land where the Manukau City Centre now stands, Douglas began his career in national politics in 1969 when he won election to parliament as the Labour Member of Parliament for Manukau. He gave his maiden speech in the Address-in-Reply debate on 7 April 1970. He devoted the greater part of his speech to the case against foreign investment in the domestic economy. His case for external protection of the domestic economy and government involvement in investment was characteristic of the Labour Party of the time. Douglas became involved in the party's policies on industry and economics. He served as the MP for Manukau from 1969 to 1978, and then for Manurewa from 1978 to 1990. Cabinet Minister (1972–1975) Labour under Norman Kirk won the 1972 election, and the Labour parliamentary caucus elevated Douglas, then aged 34, to Cabinet rank. Thus, Douglas became the youngest Cabinet minister in 50 years. His father, and parliamentary colleague, Norman Douglas, then 62, failed to win a place in the ballot for Cabinet, and did not hide his bitter disappointment. On the day of the ballot, Kirk was so concerned by the extremity of Norman Douglas's reaction, and its effects on his son, that he called Douglas's mother to enlist her help. Kirk told his secretary, "It should have been the best day of Roger's life but instead it was the worst". During the Third Labour Government, Douglas served as Postmaster-General and Minister of Broadcasting until the unexpected death of Kirk in 1974. Kirk's successor Bill Rowling appointed Douglas Minister of Housing. He remained Minister of Broadcasting until 1975, when the portfolio was disestablished. Douglas was Minister of Housing and Minister of Customs until Labour's defeat by the National Party under Robert Muldoon in the 1975 election. Douglas was the most junior member of Cabinet, but soon earned a reputation for hard work and competence. His appointment as Minister of Housing in 1974 marked him publicly as a talent in the Cabinet. It was a significant and, in political terms, a sensitive portfolio. As Minister of Broadcasting, Douglas devised an administrative framework to allow for the introduction of a second television channel. It replaced the monopoly New Zealand Broadcasting Corporation with two competing publicly owned television channels, Television One, and Television Two (later called South Pacific Television) a corporation to manage public radio, Radio New Zealand, and a new Broadcasting Council. After public consultation, the scheme was implemented on 1 April 1975. However, the government of Muldoon merged the three broadcasters into a single Broadcasting Corporation of New Zealand in 1977, with the two television channels being merged into Television New Zealand in 1980. Douglas was an early and enthusiastic promoter of the government's plans for a compulsory contributory superannuation scheme that would supplement the old age pension. In 1972, while still in opposition, he introduced a private member's bill that provided for a form of compulsory superannuation. In Cabinet, Rowling, who was then Minister of Finance, and Douglas were largely responsible for a 1973 White Paper setting out the government's proposals for superannuation. As well as augmenting individual provision for retirement, the scheme was intended to be a source of capital for investment in the domestic economy. The scheme became law in the form of the New Zealand Superannuation Act 1974. Douglas was among the designers of the Dependent Minders' Allowance, which was part of Labour's platform in the 1975 election. Originally intended as a means of compensating women whose absence from the workforce reduced their superannuation contributions, the scheme offered a cash payment to women on the birth of their first and second children, or the first two children born after the election. It was immediately dubbed the "baby bonus" by Muldoon. Margaret Hayward, who was Norman Kirk's private secretary, notes that during the Third Labour Government, Conversely, Douglas did not attempt radical reform of his other ministerial responsibility, the Post Office, except for an attempt to make the Post Office 'market' two of its businesses – the Philatelic Bureau and the yellow pages. However, he had little opportunity to do anything else as he was elevated into the role of Minister of Housing after the death of Norman Kirk in 1974. Opposition (1975–1984) Douglas was critical of Labour's performance in government between 1972 and 1975. Labour's defeat in the 1975 election was the greatest electoral reversal since 1928. A Labour majority of 23 seats in a Parliament of 87 members became a National majority of the same number. The Third Labour Government attempted to cushion economic contraction by borrowing abroad, but while it held unemployment to the level it had inherited, the rate of inflation trebled to an annual rate of 15 per cent and a surplus in the balance of payments became a deficit. Labour lost credibility as an economic manager by 1975. A series of scandals and misadventures, incompetence among some ministers, and Rowling's inability to counter Muldoon's populism contributed to the defeat. The nature of the defeat widened a division that already existed between the older and younger members of the Labour caucus. In opposition after 1975, Douglas became successively Labour's spokesperson on housing, special projects, consumer affairs and transport. In 1980, he published a series of proposals for future economic development under the title an "Alternative Budget". The proposals were not Labour policy and their publication was seen by the party leader Rowling as a challenge to his authority. Rowling demoted Douglas from the parliamentary front bench and he lost his responsibility for transport. In 1981, he became spokesperson for trade and industry. Douglas argued that the Labour Party's approach to economic policy was fragmented and based on unrealistic promises. He also believed that the party leadership should be revitalised, and supported David Lange's unsuccessful bid for the leadership in 1980. In informal Labour caucus politics, Douglas became a member of the so-called "Fish and Chip Brigade", which included Rowling's leading caucus opponents. He identified his closest colleagues as Richard Prebble, Mike Moore, and Michael Bassett. The failure of Lange's leadership bid, continuing dissatisfaction with Labour's approach to economic policy, and his difficult relationship with leading figures in the party led Douglas to declare his intention to retire from Parliament at the 1981 general election. Lange was among those who persuaded him to reconsider. Lange believed that Douglas was a moderniser. He saw Douglas as sometimes obstinate and limited, but in Lange's view he had drive, and the ability to break from the traditions that had kept Labour so long in opposition. In March 1983, after Lange became leader of the Labour Party, he made Douglas the Labour spokesperson for finance. At the time of his appointment, Douglas had a reputation as a radical but his thinking on economic issues remained within the boundaries of Labour's Keynesian approach to economic management. By the end of 1983, his thinking had shifted markedly to the economic right. In late 1983, Labour's Caucus Economic Committee adopted a paper that Douglas named the economic policy package. The committee's support was not unanimous. The Douglas paper polarised opinion in the caucus. Several members of the caucus presented an alternative draft economic policy to the Labour Party's Policy Council. The Policy Council was divided. Its members could not agree on the party's economic platform. When disagreement became increasingly a matter of public knowledge, and the 1984 general election drew closer, the party's deputy leader Geoffrey Palmer drafted a compromise proposal that combined elements of both sides of the argument. Lange doubted that Palmer's paper satisfied either side. When Muldoon unexpectedly called an early election, the Palmer document became part of Labour's election policy platform. A critical element of Douglas's economic policy package, but not the Labour Party's policy document, was a 20 per cent devaluation of the New Zealand dollar. This was a sensitive subject. If it was widely known that an incoming government would devalue the dollar, dealers would seek profit by selling the dollar at its higher price before the election, and buying it back at its lower price afterwards. The difference, which might amount to hundreds of millions of dollars if there was a run on the currency, would be met by the taxpayer. Soon after Muldoon called the election, Douglas held a public meeting in his electorate and distributed copies of his economic policy package, which made the case for a 20 per cent devaluation. Muldoon obtained a copy and released it to the news media, intending to embarrass the Labour Party. Douglas acknowledged that devaluation was not part of Labour policy and accepted responsibility for the mistake. Although Lange believed that the error cast doubt on Douglas's judgement, he did not accept Douglas's resignation because he did not wish to appoint a new finance spokesperson so close to the election. Minister of Finance (1984–1988) Labour returned to power in the election of 1984 and formed the Fourth Labour Government. Lange became Prime Minister and Douglas became Minister of Finance. At Douglas's request, Lange appointed two senior ministers as associate finance ministers: David Caygill, who was also Minister of Trade and Industry, and Richard Prebble, who was also Minister of Transport. Douglas and his associate ministers became known as the "Treasury Troika" or the "Troika". Soon after the election, the outgoing government carried out the devaluation that Douglas supported. The heads of Treasury and the Reserve Bank advised that devaluation was the only way to stop the currency crisis that followed the announcement of an early election. The unsettled political climate around the early election and the currency crisis gave Douglas a powerful position in the Cabinet. Lange said in 1986 that the economic and political climate in 1984 gave Douglas influence he would not have had if the government had been elected in November 1984 and presented its first budget in June 1985. "When the crisis hit in July 1984, it was Roger Douglas who, above all, had thought through the economic issues – so when the Cabinet needed to fall back on an economic philosophy, it was Douglas who had one." Labour promised during the election campaign to "open the books", largely as a challenge to Muldoon's supposedly secretive and ad hoc approach to economic management. Douglas responded by agreeing to the publication of Treasury's briefing to the incoming government, which appeared under the title Economic Management. Douglas took a limited part in the Economic Summit Conference that began on 11 September 1984 because he was already at work on his first budget. He saw the summit as preparing the country to accept change, but noted the possibility that it might heighten expectations of continued consensus and involvement. He later stated that he had taken up the finance portfolio with a plan for economic restructuring already in mind, and described the budget he delivered in November 1984 as "an amalgam of what I had originally envisaged and fresh options presented in briefing papers and in debate with fellow ministers and Treasury officials." Douglas's insistence that economic policy was the product of a plan conceived by him as early as 1980 and not a response to crisis left the government open to charges of bad faith. The 1984 budget was a radical departure from Labour's established approach to economic management. Douglas answered criticism that the government's intentions had not been made clear to the electorate by saying that he had spelled out his whole programme to the Policy Council, which, he said, had understood and endorsed his intentions. He maintained that the detail was not made available to the public because it did not have the capacity to absorb it in the short time available. The budget owed almost nothing to Labour's manifesto. Its content closely matched the Treasury view set out in Economic Management. Douglas's identification with Treasury was complete by 1985. Treasury initiatives adopted by the government that were not signalled before the 1984 election included the introduction of a comprehensive tax on consumption (GST), the floating of the dollar (which Douglas opposed until 1984) and the corporatisation of the government's trading activities, announced at the end of 1985. Treasury's view of economic policy was neoclassical and monetarist, and used commercial criteria as the basis for decision-making. Douglas did not concede that his advocacy of these views placed him on the right of the political spectrum. He maintained that the government's social goals were the same as those of the First Labour Government and that changed circumstances required Labour to use different economic means to achieve its ends. He defended Treasury from the charge that its advice was at odds with Labour policy by arguing that its role was to give advice based on the interests of the nation as a whole. In his view, Treasury had no duty to help a government implement its manifesto because its responsibility was to advise its minister in a way that was free of party politics or ideology. The coinage "Rogernomics" was used from at least 1985 onwards as shorthand for the Fourth Labour Government's economic reform policies. Douglas's public profile rose, and he built wide support for the government among the business community. Douglas was reappointed to the finance portfolio after Labour's victory in the 1987 general election and remained finance minister until December 1988. His second term in office was marked by conflict with the prime minister Lange. Lange and Douglas (1984–1989) The conflict between Lange and Douglas mirrored the inconsistency at the heart of the government. Lange's talk of consensus and inclusiveness during the 1984 general election campaign echoed Labour's social-democratic history. Douglas personified radical change. Lange strongly supported the 1984 budget, and promoted it to party and public. Douglas and Lange were a formidable political combination, both in Cabinet and in public, where Lange's humour and rhetoric complemented the determination and single-mindedness embodied in Douglas's commitment to economic restructuring. Lange valued Douglas's doggedness in the government's first term of office, when "urgency was needed and boldness was at a premium", but believed he was limited by an inability to accept or understand interests that were not in tune with his. In 1986, the two took opposing sides in Cabinet debates about the establishment of a royal commission on social policy, which Lange saw as an intellectual counterweight to Treasury. At the beginning of 1987, relations between the Douglas and Lange offices were strained when Douglas and his ally Richard Prebble persuaded Cabinet to reject Lange's wish to accept the resignation of the Minister of Māori Affairs, Koro Wētere, following the Māori loan affair. Douglas shocked Lange in April 1987 by telling him that his preferred option for the 1987 budget included a rise in GST from a rate of 10% to 15%, the extension of user charges in public health and education and the sale of most government assets, and the eventual achievement of a flat rate of income tax at 15 per cent. Lange wrote that "it was an unaccustomed addition to the burdens of office to have the finance minister take leave of his senses". After discussions with Lange and senior colleagues, Douglas did not pursue his proposals. In the 1987 election campaign, Douglas underlined the need for continuing radical reform, while Lange said that radical economic reform was largely complete. Douglas's appeal to commercial interests was reflected in the large amounts of money (including $250,000 given by Auckland businessman Alan Hawkins) he collected for the campaign from the business community. He did not convey the money he raised to the Labour Party organisation, but chose to manage it himself, allocating funds for purposes like television advertising. Lange's campaign was lacklustre, and Douglas appeared to have contributed more to Labour's victory in 1987. Mike Moore, then a senior member of Cabinet, said that Lange had won the 1984 election, but Douglas won in 1987. Labour increased its parliamentary majority. Votes swung to Labour in National's safest seats and swung to National in seats that traditionally voted Labour. Immediately after the election, Lange reshuffled the Cabinet without consulting Douglas. He wrote later that he no longer trusted Douglas and wished to use the reallocation of portfolios to put some restraints on him. Douglas continued to work on the radical proposals he signaled earlier in 1987. A worldwide fall in share markets in October 1987 gave his work greater urgency. In December 1987, the Cabinet agreed, in spite of Lange's reservations, to a statement of principle that supported a flat rate of income tax and a new form of income assistance called guaranteed minimum family income (GMFI). GMFI was a Douglas initiative and for reasons of urgency he did not inform colleagues of Treasury advice that the proposals were a fiscal risk. The announcement on 17 December 1987 of the government's intention to introduce GMFI and a flat rate of income tax marked the high tide of Rogernomics but did nothing to settle growing tension between Douglas and Lange. Douglas refused to accept Lange's contention that his proposals were unworkable. Douglas was in Europe in January 1988 when Lange told a press conference that officials had been unable to resolve the practical difficulties of the flat tax/GMFI proposals and that the government would have to reconsider them. Douglas, believing that he had the support of a majority of Cabinet, immediately returned from Europe, and the rift between prime minister and finance minister became a matter of public knowledge. Although Cabinet abandoned GMFI and reached a compromise about tax scales, the government's standing did not recover from the division between Douglas and Lange, which worsened and became more open as the year went on. Lange believed that David Caygill was Douglas's only tenable successor as finance minister, but Caygill refused to serve if Lange sacked Douglas. In December 1988, Douglas wrote to Lange to tell him that he intended to tell the Labour caucus he could no longer serve in a government led by him. Lange construed this letter as a resignation and replaced Douglas with Caygill. In August and September 1988, some Labour Party members founded the Backbone club, a ginger group within the party that support Douglas in his financial reforms. Douglas himself continued his campaign against Lange through public statements, the unauthorised release of cabinet papers and on 21 December 1988 an unsuccessful challenge against Lange's leadership in the Labour caucus. In June 1989 his supporters in caucus moved a motion of no-confidence in Lange, which Lange only narrowly won. On 3 August 1989, the Labour caucus voted to return Douglas to Cabinet. Lange, who saw the vote as a choice between him and Douglas, resigned his office almost immediately afterwards. Lange insisted that policy differences were behind his disagreement with Douglas, telling a press conference following his resignation that "Now is the time for the principle to replace the personality". He was critical of Douglas's conduct: "But with Roger his resolution, and his particular absolutely relentless pursuit of what he conceived to be an agenda worth pursuing, overrode all considerations of loyalty and in the end all manifestations of friendship." Douglas did not accept that there were any philosophical differences at issue, and attributed other motives to Lange: "In my mind he created the division that in my mind was never there. We had separate roles. I understood what my role was. I felt he should have understood what his role was." Lange's successor Geoffrey Palmer did not restore Douglas to the finance portfolio, then held by David Caygill, but appointed him Minister of Police and Minister of Immigration. Douglas did not stand for Parliament at the 1990 election, which Labour lost. His policies, however, continued under the aegis of Ruth Richardson, the Minister of Finance in the new Fourth National Government of New Zealand (in a style that became known as "Ruthanasia"). ACT New Zealand In 1993, Douglas co-founded the Association of Consumers and Taxpayers with Derek Quigley. Douglas and Quigley intended the Association to serve as a pressure-group promoting the Douglas economic policies. Shortly afterwards, in 1996, the country switched to using the MMP electoral system. MMP gave smaller parties a much better chance of entering Parliament, and encouraged the Association to establish the ACT New Zealand Party. The nascent party's manifesto was based upon a book written by Douglas entitled Unfinished Business. Douglas served as ACT's first leader, but soon stood aside for Richard Prebble (his old ally from their days in the Labour caucus). Douglas remained a strong supporter of ACT, although he became somewhat unhappy with the party's alleged lack of focus on pure economic policy. In particular, Douglas criticised what he saw as populism within the party, claiming that some of its MPs seemed more committed to grabbing headlines than to developing policy. When in April 2004 Prebble announced his decision to retire, Douglas spoke out in favour of Stephen Franks and Ken Shirley as possible successors – the other main contender in the leadership race, Rodney Hide, had a reputation for advocating the style that Douglas condemned. Hide won the leadership and headed ACT until his resignation in April 2011. On 2 December 2004, both Douglas and Quigley announced that they would step down as patrons of ACT. They stated as the reason that they wished to have more freedom to disagree with the party publicly. On 21 February 2008, Douglas renewed his involvement with ACT by signing a letter inviting supporters to the 2008 ACT conference, and appearing in television and newspaper interviews endorsing ACT for the 2008 general election. At ACT's 2008 annual conference in Auckland, Douglas announced his intention to stand for Parliament again, as an ACT candidate. The announcement that he would run in the newly created electorate of came on 8 June 2008. ACT assigned Douglas the number three slot on its party list. Douglas finished a distant third in Hunua, taking only 9.6 percent of the vote. However, ACT leader Rodney Hide was reelected as the member for Epsom, allowing ACT to enter Parliament under MMP. A party that falls below the five-percent threshold can still qualify for MMP if it wins at least one electorate seat. ACT's 3.65 percent of the party vote entitled it to five seats, allowing Douglas to re-enter Parliament as a list MP. ACT gave confidence and supply to National. Prime Minister-elect John Key had previously said that he would not give Douglas a Cabinet position, but Douglas indicated a wish for a review of this stance. As a government backbencher, Douglas had three member's bills drawn from the ballot in 2010. The first, the Minimum Wage (Mitigation of Youth Unemployment) Amendment Bill, which would reintroduce a separate minimum wage for 16- and 17-year-olds was drawn from the member's ballot in February, and was defeated at its first reading 117–5. The second, the Tariff Act 1988 Repeal Bill, which would repeal all tariffs on goods imported into New Zealand, was drawn in April, and was also defeated at its first reading 116–5 The third, the Education (Board of Trustee Freedom) Amendment Bill, which would make school teachers' pay in all state and state integrated schools the responsibility of Boards of Trustees rather than the Ministry of Education was drawn in June, and was defeated on its first reading 111–10. On 18 February 2011, Douglas announced that he would retire at the end of the 49th New Zealand Parliament. On 29 September, he delivered his valedictory speech in Parliament. Career outside politics In early 1992, Douglas gave a schedule of speeches on economics in Russia, which was transitioning from a command economy to free-market capitalism, as part of a privatisation advisory committee organised by the World Bank. Later in 1992, Douglas was appointed to the inaugural board of the Auckland Warriors by the Auckland Rugby League. He later served as chairman before being replaced in 1996. During his absence from national politics, Douglas held senior positions at a number of prominent companies, such as Ron Brierley's BIL, which he briefly served as Executive Chairman. He also served as the managing director of Roger Douglas Associates, an international consulting firm. Honours and awards In 1977, Douglas was awarded the Queen Elizabeth II Silver Jubilee Medal, and in 1990 he received the New Zealand 1990 Commemoration Medal. In the 1991 New Year Honours, he was appointed a Knight Bachelor, for public services. Legacy In 1997, in a back-handed compliment, the founders of the annual award for "The Worst Transnational Corporation operating in New Zealand", as voted by "four or five eminent judges – academics, community leaders, artists, even sportspeople", named it the "Roger Award" after Douglas. Douglas and his policies were and remain controversial and polarising. His supporters contend that he was responsible for rejuvenating the New Zealand economy while his opponents argue that Rogernomics was responsible for a vast increase in inequality between rich and poor, among other things. Helen Clark, a later Labour Prime Minister, denounced Rogernomics as "a ghastly period" and led Labour back into power by abandoning its legacy. However, political analysts suggest that she did not significantly alter the paradigm created by Rogernomics. By and large, governments since the 1980s have retained or reinforced the policies promoted by Douglas in the years 1984 to 1987, including low levels of import-protection, "credible" monetary and fiscal policies, deregulated financial markets and limited subsidies and other interventions in the economy. See also Politics of New Zealand Economy of New Zealand Notes References Further reading External links Interview with Roger Douglas, by Asher Emanuel in Salient Photo of the Fish and Chip Brigade in 1980 in Douglas' office; Bassett, Douglas, Lange and Moore |- |- |- |- |- |- |- |- 1937 births Living people ACT New Zealand leaders New Zealand finance ministers Ministers of Housing (New Zealand) New Zealand Labour Party MPs ACT New Zealand MPs New Zealand list MPs Members of the New Zealand House of Representatives Manukau City Councillors New Zealand Knights Bachelor University of Auckland alumni People educated at Auckland Grammar School New Zealand accountants New Zealand rugby league administrators New Zealand Warriors chairmen and investors New Zealand rugby league chairmen and investors 21st-century New Zealand politicians Member of the Mont Pelerin Society
The Inhuman () is a Canadian psychological thriller film, directed by Jason Brennan and released in 2021. Based on the Algonquin legend of the wendigo, the film stars Samian as Mathieu, a successful but troubled neurosurgeon whose life is falling apart, who confronts a wendigo when he returns to his childhood home of Kitigan Zibi for the first time in decades following his father's death. The cast also includes Véronique Beaudet, Jeanne Roux-Côté, Sonia Vigneault, Julie Barbeau, Creed Commando, Phil Macho Commando, Andrew Dewache, Karl Farah, Lili Gagnon, Louis Gallant, Caroline Gelinas, Chloé Germentier, Richard Jutras, Neil Kroetsch, Pierre-Michel Le Breton, Brittany LeBorgne and Angela McIlroy-Wagar. According to Brennan, the film was meant to explore the idea, present in some but not all versions of wendigo mythology, that the wendigo is not so much a supernatural being as a personification of a person's own inner demons. The film premiered on October 31, 2021, at the Abitibi-Témiscamingue International Film Festival, before going into commercial release in April 2022. Awards The film was screened at the 2022 American Indian Film Festival, where Samian won the award for Best Actor and Brennan won the award for Best Director. References External links 2021 films 2021 thriller films Canadian thriller films Films shot in Quebec Films set in Quebec Quebec films First Nations films French-language Canadian films 2020s Canadian films Wendigos in popular culture
```objective-c /* * OWL - OCaml Scientific Computing */ #ifndef OWL_OMP_PARAMETERS_H #define OWL_OMP_PARAMETERS_H #include "owl_core_engine.h" /* FUN4 */ #define OMP_THRESHOLD_float32_reci OWL_OMP_THRESHOLD_RECI #define OMP_THRESHOLD_float64_reci OWL_OMP_THRESHOLD_RECI #define OMP_THRESHOLD_complex32_reci OWL_OMP_THRESHOLD_RECI #define OMP_THRESHOLD_complex64_reci OWL_OMP_THRESHOLD_RECI #define OMP_THRESHOLD_float32_abs OWL_OMP_THRESHOLD_ABS #define OMP_THRESHOLD_float64_abs OWL_OMP_THRESHOLD_ABS #define OMP_THRESHOLD_complex32_abs OWL_OMP_THRESHOLD_ABS #define OMP_THRESHOLD_complex64_abs OWL_OMP_THRESHOLD_ABS #define OMP_THRESHOLD_float32_abs2 OWL_OMP_THRESHOLD_ABS2 #define OMP_THRESHOLD_float64_abs2 OWL_OMP_THRESHOLD_ABS2 #define OMP_THRESHOLD_complex32_abs2 OWL_OMP_THRESHOLD_ABS2 #define OMP_THRESHOLD_complex64_abs2 OWL_OMP_THRESHOLD_ABS2 #define OMP_THRESHOLD_float32_signum OWL_OMP_THRESHOLD_SIGNUM #define OMP_THRESHOLD_float64_signum OWL_OMP_THRESHOLD_SIGNUM #define OMP_THRESHOLD_complex32_signum OWL_OMP_THRESHOLD_SIGNUM #define OMP_THRESHOLD_complex64_signum OWL_OMP_THRESHOLD_SIGNUM #define OMP_THRESHOLD_float32_sqr OWL_OMP_THRESHOLD_SQR #define OMP_THRESHOLD_float64_sqr OWL_OMP_THRESHOLD_SQR #define OMP_THRESHOLD_complex32_sqr OWL_OMP_THRESHOLD_SQR #define OMP_THRESHOLD_complex64_sqr OWL_OMP_THRESHOLD_SQR #define OMP_THRESHOLD_float32_sqrt OWL_OMP_THRESHOLD_SQRT #define OMP_THRESHOLD_float64_sqrt OWL_OMP_THRESHOLD_SQRT #define OMP_THRESHOLD_complex32_sqrt OWL_OMP_THRESHOLD_SQRT #define OMP_THRESHOLD_complex64_sqrt OWL_OMP_THRESHOLD_SQRT #define OMP_THRESHOLD_float32_cbrt OWL_OMP_THRESHOLD_CBRT #define OMP_THRESHOLD_float64_cbrt OWL_OMP_THRESHOLD_CBRT #define OMP_THRESHOLD_complex32_cbrt OWL_OMP_THRESHOLD_CBRT #define OMP_THRESHOLD_complex64_cbrt OWL_OMP_THRESHOLD_CBRT #define OMP_THRESHOLD_float32_exp OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_float64_exp OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_complex32_exp OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_complex64_exp OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_float32_exp2 OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_float64_exp2 OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_complex32_exp2 OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_complex64_exp2 OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_float32_exp10 OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_float64_exp10 OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_complex32_exp10 OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_complex64_exp10 OWL_OMP_THRESHOLD_EXP #define OMP_THRESHOLD_float32_expm1 OWL_OMP_THRESHOLD_EXPM1 #define OMP_THRESHOLD_float64_expm1 OWL_OMP_THRESHOLD_EXPM1 #define OMP_THRESHOLD_complex32_expm1 OWL_OMP_THRESHOLD_EXPM1 #define OMP_THRESHOLD_complex64_expm1 OWL_OMP_THRESHOLD_EXPM1 #define OMP_THRESHOLD_float32_log OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_float64_log OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_complex32_log OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_complex64_log OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_float32_log2 OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_float64_log2 OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_complex32_log2 OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_complex64_log2 OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_float32_log10 OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_float64_log10 OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_complex32_log10 OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_complex64_log10 OWL_OMP_THRESHOLD_LOG #define OMP_THRESHOLD_float32_log1p OWL_OMP_THRESHOLD_LOG1P #define OMP_THRESHOLD_float64_log1p OWL_OMP_THRESHOLD_LOG1P #define OMP_THRESHOLD_complex32_log1p OWL_OMP_THRESHOLD_LOG1P #define OMP_THRESHOLD_complex64_log1p OWL_OMP_THRESHOLD_LOG1P #define OMP_THRESHOLD_float32_sin OWL_OMP_THRESHOLD_SIN #define OMP_THRESHOLD_float64_sin OWL_OMP_THRESHOLD_SIN #define OMP_THRESHOLD_complex32_sin OWL_OMP_THRESHOLD_SIN #define OMP_THRESHOLD_complex64_sin OWL_OMP_THRESHOLD_SIN #define OMP_THRESHOLD_float32_cos OWL_OMP_THRESHOLD_COS #define OMP_THRESHOLD_float64_cos OWL_OMP_THRESHOLD_COS #define OMP_THRESHOLD_complex32_cos OWL_OMP_THRESHOLD_COS #define OMP_THRESHOLD_complex64_cos OWL_OMP_THRESHOLD_COS #define OMP_THRESHOLD_float32_tan OWL_OMP_THRESHOLD_TAN #define OMP_THRESHOLD_float64_tan OWL_OMP_THRESHOLD_TAN #define OMP_THRESHOLD_complex32_tan OWL_OMP_THRESHOLD_TAN #define OMP_THRESHOLD_complex64_tan OWL_OMP_THRESHOLD_TAN #define OMP_THRESHOLD_float32_asin OWL_OMP_THRESHOLD_ASIN #define OMP_THRESHOLD_float64_asin OWL_OMP_THRESHOLD_ASIN #define OMP_THRESHOLD_complex32_asin OWL_OMP_THRESHOLD_ASIN #define OMP_THRESHOLD_complex64_asin OWL_OMP_THRESHOLD_ASIN #define OMP_THRESHOLD_float32_acos OWL_OMP_THRESHOLD_ACOS #define OMP_THRESHOLD_float64_acos OWL_OMP_THRESHOLD_ACOS #define OMP_THRESHOLD_complex32_acos OWL_OMP_THRESHOLD_ACOS #define OMP_THRESHOLD_complex64_acos OWL_OMP_THRESHOLD_ACOS #define OMP_THRESHOLD_float32_atan OWL_OMP_THRESHOLD_ATAN #define OMP_THRESHOLD_float64_atan OWL_OMP_THRESHOLD_ATAN #define OMP_THRESHOLD_complex32_atan OWL_OMP_THRESHOLD_ATAN #define OMP_THRESHOLD_complex64_atan OWL_OMP_THRESHOLD_ATAN #define OMP_THRESHOLD_float32_sinh OWL_OMP_THRESHOLD_SINH #define OMP_THRESHOLD_float64_sinh OWL_OMP_THRESHOLD_SINH #define OMP_THRESHOLD_complex32_sinh OWL_OMP_THRESHOLD_SINH #define OMP_THRESHOLD_complex64_sinh OWL_OMP_THRESHOLD_SINH #define OMP_THRESHOLD_float32_cosh OWL_OMP_THRESHOLD_COSH #define OMP_THRESHOLD_float64_cosh OWL_OMP_THRESHOLD_COSH #define OMP_THRESHOLD_complex32_cosh OWL_OMP_THRESHOLD_COSH #define OMP_THRESHOLD_complex64_cosh OWL_OMP_THRESHOLD_COSH #define OMP_THRESHOLD_float32_tanh OWL_OMP_THRESHOLD_TANH #define OMP_THRESHOLD_float64_tanh OWL_OMP_THRESHOLD_TANH #define OMP_THRESHOLD_complex32_tanh OWL_OMP_THRESHOLD_TANH #define OMP_THRESHOLD_complex64_tanh OWL_OMP_THRESHOLD_TANH #define OMP_THRESHOLD_float32_asinh OWL_OMP_THRESHOLD_ASINH #define OMP_THRESHOLD_float64_asinh OWL_OMP_THRESHOLD_ASINH #define OMP_THRESHOLD_complex32_asinh OWL_OMP_THRESHOLD_ASINH #define OMP_THRESHOLD_complex64_asinh OWL_OMP_THRESHOLD_ASINH #define OMP_THRESHOLD_float32_acosh OWL_OMP_THRESHOLD_ACOSH #define OMP_THRESHOLD_float64_acosh OWL_OMP_THRESHOLD_ACOSH #define OMP_THRESHOLD_complex32_acosh OWL_OMP_THRESHOLD_ACOSH #define OMP_THRESHOLD_complex64_acosh OWL_OMP_THRESHOLD_ACOSH #define OMP_THRESHOLD_float32_atanh OWL_OMP_THRESHOLD_ATANH #define OMP_THRESHOLD_float64_atanh OWL_OMP_THRESHOLD_ATANH #define OMP_THRESHOLD_complex32_atanh OWL_OMP_THRESHOLD_ATANH #define OMP_THRESHOLD_complex64_atanh OWL_OMP_THRESHOLD_ATANH #define OMP_THRESHOLD_float32_erf OWL_OMP_THRESHOLD_ERF #define OMP_THRESHOLD_float64_erf OWL_OMP_THRESHOLD_ERF #define OMP_THRESHOLD_float32_erfc OWL_OMP_THRESHOLD_ERFC #define OMP_THRESHOLD_float64_erfc OWL_OMP_THRESHOLD_ERFC #define OMP_THRESHOLD_float32_logistic OWL_OMP_THRESHOLD_LOGISTIC #define OMP_THRESHOLD_float64_logistic OWL_OMP_THRESHOLD_LOGISTIC #define OMP_THRESHOLD_float32_relu OWL_OMP_THRESHOLD_RELU #define OMP_THRESHOLD_float64_relu OWL_OMP_THRESHOLD_RELU #define OMP_THRESHOLD_float32_softplus OWL_OMP_THRESHOLD_SOFTPLUS #define OMP_THRESHOLD_float64_softplus OWL_OMP_THRESHOLD_SOFTPLUS #define OMP_THRESHOLD_float32_softsign OWL_OMP_THRESHOLD_SOFTSIGN #define OMP_THRESHOLD_float64_softsign OWL_OMP_THRESHOLD_SOFTSIGN #define OMP_THRESHOLD_float32_sigmoid OWL_OMP_THRESHOLD_SIGMOID #define OMP_THRESHOLD_float64_sigmoid OWL_OMP_THRESHOLD_SIGMOID #define OMP_THRESHOLD_complex32_angle OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_complex64_angle OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_complex32_proj OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_complex64_proj OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_lgamma OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_lgamma OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_dawsn OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_dawsn OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_i0 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_i0 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_i0e OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_i0e OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_i1 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_i1 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_i1e OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_i1e OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_j0 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_j0 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_j1 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_j1 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_k0 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_k0 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_k0e OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_k0e OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_k1 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_k1 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_k1e OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_k1e OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_y0 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_y0 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_y1 OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_y1 OWL_OMP_THRESHOLD_DEFAULT /* FUN5 */ #define OMP_THRESHOLD_float32_l1norm OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_l1norm OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_complex32_l1norm OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_complex64_l1norm OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_l2norm_sqr OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float64_l2norm_sqr OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_complex32_l2norm_sqr OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_complex64_l2norm_sqr OWL_OMP_THRESHOLD_DEFAULT #define OMP_THRESHOLD_float32_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_float64_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_complex32_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_complex64_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_int8_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_uint8_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_int16_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_uint16_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_int32_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_int64_sum OWL_OMP_THRESHOLD_SUM #define OMP_THRESHOLD_float32_prod OWL_OMP_THRESHOLD_PROD #define OMP_THRESHOLD_float64_prod OWL_OMP_THRESHOLD_PROD #define OMP_THRESHOLD_complex32_prod OWL_OMP_THRESHOLD_PROD #define OMP_THRESHOLD_complex64_prod OWL_OMP_THRESHOLD_PROD #define OMP_THRESHOLD_int8_prod OWL_OMP_THRESHOLD_PROD #define OMP_THRESHOLD_uint8_prod OWL_OMP_THRESHOLD_PROD #define OMP_THRESHOLD_int16_prod OWL_OMP_THRESHOLD_PROD #define OMP_THRESHOLD_uint16_prod OWL_OMP_THRESHOLD_PROD #define OMP_THRESHOLD_int32_prod OWL_OMP_THRESHOLD_PROD #define OMP_THRESHOLD_int64_prod OWL_OMP_THRESHOLD_PROD #endif ```
```objective-c //===--- Printable.h - Print function helpers -------------------*- C++ -*-===// // // See path_to_url for license information. // //===your_sha256_hash------===// // // This file defines the Printable struct. // //===your_sha256_hash------===// #ifndef LLVM_SUPPORT_PRINTABLE_H #define LLVM_SUPPORT_PRINTABLE_H #include <functional> namespace llvm { class raw_ostream; /// Simple wrapper around std::function<void(raw_ostream&)>. /// This class is useful to construct print helpers for raw_ostream. /// /// Example: /// Printable PrintRegister(unsigned Register) { /// return Printable([Register](raw_ostream &OS) { /// OS << getRegisterName(Register); /// } /// } /// ... OS << PrintRegister(Register); ... /// /// Implementation note: Ideally this would just be a typedef, but doing so /// leads to operator << being ambiguous as function has matching constructors /// in some STL versions. I have seen the problem on gcc 4.6 libstdc++ and /// microsoft STL. class Printable { public: std::function<void(raw_ostream &OS)> Print; Printable(std::function<void(raw_ostream &OS)> Print) : Print(std::move(Print)) {} }; inline raw_ostream &operator<<(raw_ostream &OS, const Printable &P) { P.Print(OS); return OS; } } #endif ```
"If You Were The Only Girl In The World" is the seventh episode of the fourth series of the period drama Upstairs, Downstairs. It first aired on 26 October 1974 on ITV. Background If You Were The Only Girl In The World was filmed in the studio on 3 and 18 June 1974, with the location footage being filmed on 12 and 13 June 1974. The rowing scenes were filmed at Frensham Ponds in Surrey and the French château scenes were filmed at Waddesdon Manor in Buckinghamshire. The episode was set in the summer of 1916. Cast Gordon Jackson - Hudson Jean Marsh - Rose Meg Wynn Owen - Hazel Bellamy Joan Benham - Lady Prudence Fairfax Joyce Heron - Lady Berkhamstead Lesley-Anne Down - Georgina Worsley Simon Williams - James Bellamy Jacqueline Tong - Daisy Mel Churcher - Angela Barclay Celia Imrie - Jenny Patricia MacRae - Sister Menzies Neville Hughes - Lt. Cmdr. Rupert Machin Richard Ownes - Lt. Bowman Venetia Maxwell - Mrs Vowles Sarah Twist - Lucy Brian Nolan - Man Kenneth MacDonald - Soldier William Ashley - Patron Andrew Ray - Lt. Jack Dyson RFC Plot The tea party that was arranged by Hazel and Lady Prudence in Home Fires takes place in the Morning Room of 165, Eaton Place, and only three officers are there, along with Lady Berkhamstead and Mrs Vowles. Hazel befriends a shy, young airman called Jack Dyson, who like her has risen from the middle class. Lt. Jack Dyson MC and Hazel Bellamy soon start going out with each other. They go boating, see a show and go dancing, where they kiss passionately. The day before he goes back to the Front, Dyson goes to Eaton Place to say goodbye, but Hazel is out at the canteen. He then writes her a note, calling her his "only girl in the World". Meanwhile, Georgina is now a nurse in France, along with her friend Angela Barclay and Jenny. James is now a Major, and when he arrives at Georgina's hospital, they spend the day together. When they separate at the end of the day, they kiss. References General Richard Marson, "Inside UpDown - The Story of Upstairs, Downstairs", Kaleidoscope Publishing, 2005 Updown.org.uk - Upstairs, Downstairs Fansite Upstairs, Downstairs (series 4) episodes 1974 British television episodes Fiction set in 1916
The Samareitikon (Greek: τὸ Σαμαρειτικὸν) is the name given to the Greek translation of the Samaritan Pentateuch. The Samareitikon is obtained only from marginal notes in other manuscripts and quotations in Origen. As Samuel Kohn has shown, these passages show dependencies on the Samaritan Targum. According to Emanuel Tov, however, it is only an early revision of the Septuagint text, which could also be a Samaritan version of the Septuagint. This thesis may be supported by the text version of an inscription found in Thessaloniki with the Aaronic blessing Book of Numbers 6,22-27 in a building in the 4th century Samaritan synagogue. References Further reading Frankel, Zacharias ‘Über den Einfluss der palälastinischen Exegese auf die alexandrinische Hermeneutik‘ p. 127. Leipzig, 1831. Field, Frederick. Origenis Hexaplorum quae supersunt sive veterum interpretum graecorum in totum Vetus Testamentum fragmenta. Oxford 1875 [Neudruck 1964]. Glaue, Paul; Rahlfs, Alfred. Fragmente einer griechischen Übersetzung des samaritanischen Pentateuchs. Mitteilungen des Septuaginta-Unternehmens 1,2. Berlin 1911. Tov, Emanuel. Pap. Gießen 13, 19, 22, 26. A Revision of the LXX? In: Revue Biblique 78 (1971), S. 355–383. Tov, Emanuel. ‘Pap. Giessen 13, 19, 22, 26: A Revision of the Septuagint?’ Pages 439-475 in The Greek and Hebrew Bible: Collected Essays on the Septuagint. Leiden: Brill, 1999. Bülow-Jacobsen, A and Strange, J. ‘P. Carlsberg 49: Fragment of an Unknown Greek Translation of the Old Testament (Exod. 3,2-6. 12-13. 16-19). Same Codex as H 16 (Strasb. inv. 748)’ Archiv für Papyrusforschung und verwandte Gebiete 32 (1986): 15-21. Geiger, Abraham. ‘Einleitung in die biblischen Schriften.’ Pages 1-279 in Nachgelassene Schriften. Vol 4. Edited by Ludwig Geiger. Berlin: Louis Gershel Verlagsbuchhandlung, 1876. Joosten, Jan. ‘The Samareitikon and the Samaritan Tradition’ Pages 346-59 in Die Septuaginta - Text, Wirkung, Rezeption. Edited by Kraus von Wolfgang and Siegfried Kreuzer. Tübingen : Mohr Siebeck, 2014. Joosten, Jan. ‘Septuagint and Samareitikon.’ Pages 1-15 in Author to Copyist: Essays on the Composition, Redaction, and Transmission of the Hebrew Bible in Honor of Zipi Talshir. Edited by Cana Werman. Winona Lake, IN: Eisenbrauns, 2015. Kohn, Samuel. ‘Samareitikon und Septuaginta’. Monatsschrift für Geschichte und Wissenschaft des Judentums 38 (1894), 1-7, 49-67. Pummer, Reinhard. ‘The Greek Bible and the Samaritans’. Revue des Études Juives 157/3-4 (1998): 269-358. Marsh, Bradley J. ‘The Samareitikon, Carl 49, and the κατα Σαμαρειτων Marginalia in CODEX M‘. SBL, (2016). Crown, Alan David. ‘Samaritan Scribes and Manuscripts‘, pp. 15-17. Mohr Siebeck, 2001. Waaserstein, Jacob. ‘Samareitikon‘ CSS, 209-210 Noja, S. ‘The Samareitikon‘, TS, 408-412 Waltke, B.K. ‘Prolegomena to the Samaritan Pentateuch‘, HTR, 57 (1965): 463/464. Idem, ‘Prolegomena to the Samaritan Pentateuch‘, (Harvard University Ph.D thesis), (University Microfilms, 1965). Marcos, Natalio (2000). The Septuagint in Context: Introduction to the Greek Version of the Bible. Brill. pp. 167-169. Schenker, A. ”Textgeschichtliches zum Samaritanischen Pentateuch und Samareitikon,” in Samaritans: Past and Present: Current Studies, Studia Samaritana 5 (eds. M. Mor und F. V. Reiterer; Berlin und New York: De Gruyter, 2000), pp. 105-121. External links The Gießen fragments P.B.U.G. inv. 13, P.B.U.G. inv. 19, 22 und 26 Samaritan texts Septuagint Torah Translations into Greek
Gülçin Santırcıoğlu (born July 25, 1977) is a Turkish actress. Biography She was born on 25 July 1977 in İzmir. She took opera lessons at Dokuz Eylül University Conservatory School of Performing Arts. Aside from her acting career, she worked as a soloist for various bands and taught singing courses at Ruhi Su Culture and Arts Foundation. The first movie she appeared in was Türev. Released in 2005, it won the Best Film award at the Antalya Golden Orange Film Festival. With her role as Süreyya in this movie, she was awarded as the Most Promising Actress at the 13th ÇASOD Awards. Her breakthrough came through her role in the hit period series Elveda Rumeli, in which she portrayed the character of Hatice. In 2007, she was cast alongside Nejat İşler, Saadet Aksoy and Ufuk Bayraktar in Yumurta, the first installment of a trilogy directed by Semih Kaplanoğlu which later won many national and international awards. In 2008, she shared the leading role with Kaan Keskin in the movie İki Çizgi, which was screened at 30 national and international film festivals, including the 65th Venice Film Festival and the 45th Antalya Golden Orange Film Festival. Santırcıoğlu then continued her career by appearing in various TV productions. In 2012, she voiced the song "Ala Gözlerini Sevdiğim Dilber" for Badem band's studio album Badem ve Konukları. In 2013, she was among the judging panel of the Rotterdam Golden Tulip Film Festival. She was cast in surreal period comedy "Osmanlı Tokadı". In recent years, Santırcıoğlu has been mainly known for her roles in series such as Kara Ekmek, Oyunbozan and Hercai. Filmography Film Television Awards 2006: 13th ÇASOD "Best Actors" Awards - Most Promising Actress (Türev) References External links 1977 births Turkish television actresses Turkish film actresses Actresses from İzmir Living people
The Famatina chinchilla rat (Abrocoma famatina) is a species of chinchilla rats in the family Abrocomidae found only in Argentina. References Abrocoma Mammals of Argentina Mammals described in 1920 Taxa named by Oldfield Thomas