ZorraZabb/code10wiki90_sampling_xml_fitered

text stringlengths 1 22.8M
Edwin Griffiths (1884–1950) was an English footballer who played for Stoke. Career Griffiths was born in Hanley and played football with the Charterhouse School, Old Carthusians and North Staffs Normads before joining Stoke in 1908. He played seven matches for Stoke during the 1908–09 season and after failing to score he returned to amateur football. Career statistics References English men's footballers Stoke City F.C. players 1880s births 1950 deaths Men's association football forwards Footballers from Hanley, Staffordshire
Unterensingen is a municipality in the district of Esslingen in Baden-Württemberg in southern Germany. Geography It is located 19 km southeast of Stuttgart. References Esslingen (district) Populated places on the Neckar basin Populated riverside places in Germany
Enteromius clauseni is a species of ray-finned fish in the genus Enteromius which is known from only a single location on the Yewa River in Nigeria and Benin. Size This species reaches a length of . Etymology The fish is named in honor of ichthyologist Herluf Stenholt Clausen who collected the type specimen. References Enteromius Taxa named by Thys van den Audenaerde Fish described in 1976
Engel Modderman (1 October 1951) is a Dutch communist politician and activist. Career Until 1999, Modderman was active on behalf of the New Communist Party of the Netherlands (NCPN), of which he was also a member of the national board and the lijsttrekker in the 1998 Dutch general election. In 1999, Modderman and the NCPN came into conflict over the Blauwestad construction project and he founded the United Communist Party (, VCP), of which he has been political leader ever since. Resistance against Blauwestad remained one of the spearheads of the VCP. Later, as a municipal councilor, Modderman protested against the new construction of cultural center De Klinker in Winschoten and against the extraction of gas from the Slochteren natural gas field. Modderman is leader of the VCP in the municipal council of Oldambt, where his party has been represented with four seats since 2014. In the 2014 Dutch municipal elections, Modderman received the most votes of all politicians in Oldambt, after which talks started about the formation of a college with the Socialist Party (SP), Party for the North (, PvhN), and VCP. The latter left the negotiations, however, and the SP and PvhN formed a coalition with the Labour Party and the Christian Democratic Appeal instead. On May 14, 2018, Modderman was appointed as acting chairman of the municipal council after the sudden death of mayor Pieter Smit. References 1951 births Living people Dutch communists Communist Party of the Netherlands politicians Municipal councillors in Groningen (province)
"Manhunter" is the season premiere of the seventh season of the American television police sitcom series Brooklyn Nine-Nine, and the 131st overall episode of the series. The episode was written by David Phillips and directed by Cortney Carrillo. It aired on February 6, 2020 on NBC, airing back-to-back with the follow-up episode, "Captain Kim". The show revolves around the fictitious 99th precinct of the New York Police Department in Brooklyn and the officers and detectives that work in the precinct. In this episode, the precinct must investigate the manhunt for a shooter who participated in an assassination attempt. The manhunt reunites Jake with recently-demoted Holt, but the partnership soon turns into a competition to solve the case. Meanwhile, Amy begins to suspect she might be pregnant. According to Nielsen Media Research, the episode was seen by an estimated 2.66 million household viewers and gained a 0.7 ratings share among adults aged 18–49. The episode received positive reviews from critics, who praised the cast and the writing. Plot Councilman Bosworth is shot while giving a conference and the precinct is assigned to conduct the manhunt for the shooter. Cooperating with Jake (Andy Samberg) in his position as the lead of the investigation is former Captain-demoted-to-patrolman Holt (Andre Braugher), whose enthusiasm for duty leads him to break with proper procedure, which annoys his fellow patrol officer, Debbie Fogle (Vanessa Bayer). The investigation causes friction between Jake and Holt when Holt starts taking the lead on the case, even acting as the police spokesperson on TV. Jake then gives Holt a fake lead to get him out of the way so Jake can pursue the true lead himself. Jake and Boyle (Joe Lo Truglio) manage to find the shooter and arrest him. Holt, who had seen through Jake's ruse, deduces that Jake arrested the wrong suspect and that an eyewitness who had given them a statement is the real shooter. Angered at being upstaged again, Jake takes Holt off the case but he convinces Debbie to pursue the suspect anyway; they track him down but he gets the drop on them and takes them hostage. Jake and Boyle discover they can track Holt and Debbie through one of the apps on her phone. Meanwhile, during the operation, Amy (Melissa Fumero) confides in Rosa (Stephanie Beatriz) that despite planning to wait a year, she may be pregnant. Terry (Terry Crews), sees them talking and gets upset because he thinks everyone is badmouthing him behind his back. Rosa suggests that Amy take a pregnancy test, and she drinks water non-stop in an attempt to force herself to urinate. No sooner does she finally get the urge then Jake and Boyle call for the squad to rescue Holt and Debbie. Amy, desperate now to urinate, physically subdues the suspect to bring the standoff to a close. Both Jake and Holt apologize to each other, showing their mutual respect. Amy's pregnancy test is negative, and her and Jake's disappointment makes them decide to start trying to have children right away. Reception Viewers According to Nielsen Media Research, the episode was seen by an estimated 2.66 million household viewers and gained a 0.7 ratings share among adults aged 18–49. This means that 0.7 percent of all households with televisions watched the episode. This was a 71% increase over the previous episode, which was watched by 1.55 million viewers and a 0.5/2 ratings share. With these ratings, Brooklyn Nine-Nine was the highest rated show on NBC for the night, fourth on its timeslot and eighth for the night, behind Last Man Standing, A Million Little Things, The Unicorn, Mom, Station 19, Young Sheldon, and Grey's Anatomy. Critical reviews "Manhunter" received positive reviews from critics. LaToya Ferguson of The A.V. Club gave the episode an "A−" rating, writing, "Luckily, the episode is truly strong enough on the comedy and character fronts to make the lack of investment in the case worth it. Amy's possible pregnancy is more interesting than the manhunt, as is the new dynamic at play with Jake and Holt this season." Alan Sepinwall of Rolling Stone wrote, "Any show that lasts into its seventh season will develop certain formulas. While Brooklyn has done better than most at transcending its own clichés, change is not only OK at such an advanced age, it’s almost necessary. Neither “Manhunter” nor “Captain Kim” is a Brooklyn all-timer, but both suggest good things ahead for the year." Nick Harley of Den of Geek gave the episode a 4 star rating out of 5 and wrote, "Season 7 of Brooklyn Nine-Nine starts off strong, utilizing many of the show's strengths while subverting some expectations and taking advantage of Holt's reassignment (for the time being). The series will move to its regularly scheduled, once-a-week slot next week, and we'll see how Holt's story, and Amy's potential pregnancy, develop." References External links 2020 American television episodes Brooklyn Nine-Nine (season 7) episodes
1st Rossoshinskiy () is a rural locality (a khutor) and the administrative center of Rossoshinskoye Rural Settlement of Zernogradsky District, Russia. The population was 911 as of 2010. Geography The khutor is located on the Sredny Elbuzd River, 18 km from Zernograd. Streets Donskaya Zarechnaya Molodezhnaya Savovaya Stepnaya Geography 1st Rossoshinskiy is located 35 km south of Zernograd (the district's administrative centre) by road. Krayny is the nearest rural locality. References External links ROSSOSHINSKOE AGRICULT ACCOMMODATION Rural localities in Rostov Oblast
Blue is a color. Blue may also refer to: Places Blue, Arizona, an unincorporated community in the United States Blue, Indiana, an unincorporated community in the United States Blue, Oklahoma, an unincorporated community in the United States Blue, West Virginia, an unincorporated community in the United States Blue County, Choctaw Nation, dissolved in 1907 when Oklahoma achieved statehood Blue, Ontario, a former township amalgamated in Dawson, Ontario, Canada Blue Desert, part of the Sinai Desert Blue Mountain (disambiguation) Blue Mountains (disambiguation) Blue River (disambiguation) People Blue (name), a list of people with the given name, nickname or surname Companies and products Blue Inc, a London-based chain of fashion retail stores Blue Microphones, a microphone manufacturer Blue Network, an American radio network from 1927 to 1945, the predecessor of ABC Labatt Blue, a Canadian brand of beer Blue Origin, an American aerospace manufacturer Computing and mathematics Blue (queue management algorithm) Best Linear Unbiased Estimator, a concept in statistics Windows Blue, codename for Microsoft Windows 8.1 Art, entertainment, and media Fictional entities Blue (Blue Gender) Blue (Pokémon Adventures), the protagonist's rival in the manga adaptation of Pokémon in Pokémon Adventures Blue (SaGa Frontier character) Blue (Wolf's Rain) Blue Chessex, a character in Degrassi: The Next Generation Green (Pokémon Adventures), who was called Blue in the original Japanese version, in Pokémon Adventures Blue, a fictional character in the Web series Dick Figures, made by Mondo Media Blue (Pokémon), the rival character in the video games Pokémon Red and Blue, and the main inspiration for the anime character Gary Oak Blue, the title character of Blue's Clues and Blue's Clues & You! Blue, a cat in U.S. Acres by Jim Davis Blue, a character in Snow by Orhan Pamuk Joseph "Blue" Pulaski, a character in the film Old School Blu, a Spix's macaw who is the protagonist of Rio and Rio 2 Blue Sargent, a fictional character from The Raven Cycle novels, by Maggie Steifvater Blue, a Velociraptor in Jurassic World and Jurassic World: Fallen Kingdom Blue, a SilkWing in the novel series Wings of Fire Blue, a character in the Roblox video game Rainbow Friends Films Blue (1968 film), starring Terence Stamp Blue (1993 film), by Derek Jarman Three Colors: Blue, a French drama film by Krzysztof Kieślowski, part of the Three Colors trilogy Blue (2001 film), a Japanese romantic drama Blue (2003 film), a South Korean war film Blue (2009 film), a Bollywood action film Games Pokémon Red and Blue, the first two games in the Pokémon franchise Music Bands Blue (English group), an English boy band Blue (Scottish band), a Scottish pop rock band Bruford Levin Upper Extremities or B.L.U.E., a 1990s British rock group Albums Blue (Angela Aki album), 2012 Blue (Closterkeller album), 1992 Blue (Diana Ross album), 2006 Blue (Double album), 1985 Blue (Down by Law album), 1992 Blue (Flashlight Brown album), 2006 Blue (Gary Chaw album), 2006 Blue (iamamiwhoami album), 2014 Blue (The Jesus Lizard album), 1998 Blue (Jonas Blue album), 2018 Blue (Joni Mitchell album), 1971 Blue (La! Neu? album), 1999 Blue (LeAnn Rimes album), 1996 Blue (The Mission album), 1996 Blue (Phil Keaggy album), 1994 Blue (Simply Red album), 1998 Blue (Terje Rypdal album), 1987 Blue (Third Eye Blind album), 1999 Songs "Blue" (A Perfect Circle song), 2004 "Blue" (A. S. Blue song), 2011 "Blue" (Big Bang song), 2012 "Blue" (Bill Mack song), 1958, popularized by LeAnn Rimes (1996) "Blue" (Joni Mitchell song), 1971 "Blue" (Tiësto song), 2019 "Blue" (The Rasmus song), 1997 "Blue" (The Verve song), 1993 "Blue" (Vivid song), 2011 "Blue" (Yoasobi song), 2021 "Blue (Da Ba Dee)", a 1999 song by Eiffel 65 "Blue", by Angie Hart from the Buffy the Vampire Slayer episode "Conversations with Dead People" "Blue", by Beyoncé Knowles from Beyoncé "Blue", by The Birthday Massacre from Violet "Blue", by Calvin Harris from Ready for the Weekend "Blue", by DreamNote "Blue", by Elastica from Elastica "Blue", by Eve's Plum from Envy "Blue", by Fine Young Cannibals from Fine Young Cannibals "Blue", by First Aid Kit from The Lion's Roar "Blue", by Freddie Hart from Country Love Ballads "Blue", by Helen Reddy from We'll Sing in the Sunshine "Blue", by Hikaru Utada from Ultra Blue "Blue", by The Jayhawks from Tomorrow the Green Grass "Blue", by Joni Mitchell, also covered by Cat Power from Jukebox "Blue", by Kevin Ayers from Yes We Have No Mañanas (So Get Your Mañanas Today) "Blue", by LaTour from LaTour "Blue", by Linkin Park from LP Underground 11.0 "Blue", by Lolo Zouaï from High Highs to Low Lows "Blue", by Lucinda Williams from Essence "Blue", by Marina and the Diamonds from Froot "Blue", by Mika from My Name Is Michael Holbrook (2019) "Blue", by Orthodox Celts from The Celts Strike Again "Blue", by Peter, Paul and Mary from In Concert "Blue", by The Seatbelts from Cowboy Bebop Blue "Blue", by Serj Tankian from Elect the Dead "Blue", by Sigrid from How to Let Go "Blue", by The Smashing Pumpkins from Lull "Blue", by Troye Sivan from Blue Neighbourhood "Blue", by Way Out West from Way Out West "Blue", by Wham! from Music from the Edge of Heaven "Blue", by Wonho "Blue", by Yngwie Malmsteen from Alchemy "Blue", by Zach Bryan from American Heartbreak (2022) "Blue", by Zayn Malik from Mind of Mine "Blue (And Broken Hearted)", a song written by Lou Handman "Blue", a song from Heathers: the Musical Other music Blue (piano concerto), a composition by Matthew King Blue (video), a DVD by the Birthday Massacre Blue (opera), by Jeanine Tesori and Tazewell Thompson, 2019 Blue, a guitar owned by Billie Joe Armstrong Working blue, or "blue material," the use of impolite language in comedy or other entertainment Publications Blue (Australian magazine), a gay men's magazine Blue (Italian magazine), an erotic comic magazine Blue (manga), a 1997 yuri manga by Kiriko Nananan Blue (tourism magazine), a 1997-2003 American adventure travel magazine Blue, a 1991 novel by James Heneghan Television Blue (web series), an original production starring Julia Stiles on the WIGS YouTube channel "Blue" (Red Dwarf), an episode of Red Dwarf "Blue", a Series B episode of the television series QI (2004) Blue, a defunct Greek-language music video channel operated by ANT1 Group Animals and mascots Blue (Don Cherry's dog), a dog owned by ice hockey commentator Don Cherry Blue (NFL mascot), the official mascot of the Indianapolis Colts professional American football franchise Blue, a mascot of the University of Kentucky Wildcats Butler Blue, a succession of live mascots of Butler University Polyommatinae, a subfamily of butterflies Sports Blue (university sport), an award Blue, a slang term used to address a baseball umpire Other uses Blue, a doneness level of cooked meat Blue, a slang term used in performance art to denote obscene material Blue School, a progressive independent school in New York City Blue state, a U.S. state with a tendency to elect Democrats Case Blue, the German World War II plan for its 1942 summer offensive against the Soviet Union USS Blue (DD-387), a Bagley-class destroyer in service from 1937 to 1942 USS Blue (DD-744), an Allen M. Sumner-class destroyer in service from 1944 to 1971 See also Bloo (disambiguation) Blu (disambiguation) The Blue (disambiguation) Blued (disambiguation) Blues (disambiguation) Bluey (disambiguation) Bluing (disambiguation)
Cumming is a city in Forsyth County, Georgia, United States, and the sole incorporated area in the county. It is a suburban city, and part of the Atlanta metropolitan area. In the 2020 census, the population is 7,318, up from 5,430 in 2010. Surrounding unincorporated areas with a Cumming mailing address have a population of approximately 100,000. Cumming is the county seat of Forsyth County. History The area now called Cumming is located west of the historic location of Vann's Ferry between Forsyth County and Hall County. Early history The area, now called Cumming, was inhabited earlier by Cherokee tribes, who are thought to have arrived in the mid-18th century. The Cherokee and Creek people developed disputes over hunting land. After two years of fighting, the Cherokee won the land in the Battle of Taliwa. The Creek people were forced to move south of the Chattahoochee River. The Cherokee coexisted with white settlers until the discovery of gold in Georgia in 1828. Settlers that moved to the area to mine for gold pushed for the removal of the Cherokee. In 1835, the Treaty of New Echota was signed. The treaty stated that the Cherokee Nation must move to the Indian Territory, west of the Mississippi River. This resulted in the Trail of Tears. The Cherokee territory was then formed into Cherokee County in 1831. In 1832, the county had been split into several counties including Forsyth County. In 1833, the town of Cumming was formed from two land lots that had been issued as part of a Georgia State Land Lottery in 1832. The two lots designated as Land Lot 1269 and Land Lot 1270 were purchased by a couple of Forsyth County Inferior Court justices who realized that it was necessary to have a seat of government to conduct county business. The boundaries of the two lots ended at what is now Tolbert Street on the west side, Eastern Circle on the east side, Resthaven Street on the south side, and School Street on the north side. In 1834 the post office was established and began delivering mail. The justices of the Inferior Court divided the town land into smaller lots and began selling them to people over the next several years, reserving one lot for the county courthouse. During that same year, the Georgia State Legislature incorporated the town of Cumming into the City of Cumming and made it the official government seat of Forsyth County. A second charter was issued in 1845, decreeing that Cumming's government would follow the mayor–council model of government. The community is commonly thought to be named after Colonel William Cumming. An alternate theory proposed by a local historian posits the name honors Rev. Frederick Cumming, a professor of Jacob Scudder, a resident of the area since 1815 who owned land in present-day downtown. Yet another theory is that the town is named after Alexander Cuming, the son of a Scottish baronet. Modern history During the 1830s and 1840s, Cumming benefited from the gold mining industry as many businesses were created to meet the needs of the miners. However, the California Gold Rush in 1849 put the city into an economic depression. Newly built railroads bypassed the city and took traffic from the Federal Road that ran near Cumming. The city was spared during the Civil War because William T. Sherman did not pass through the city during his March to the Sea. In 1900, the county courthouse was destroyed in a fire after being struck by lightning; it was rebuilt in 1905. 1912 racial conflict In 1912, Governor Joseph M. Brown sent four companies of state militia to Cumming to prevent riots after two reported attacks of young white women, allegedly by black men. A suspect in the second assault, in which the victim was also raped and later died, was dragged from the Cumming county jail and lynched. The governor then declared martial law, but the effort did little to stop a month-long barrage of attacks by night riders on the black citizens. This led to the banishment of blacks, and the city had virtually no black population. Racial tensions were strained again in 1987 when a group of black people were assaulted while camping at a park on Lake Lanier. This was widely reported by local newspapers and in Atlanta. As a result of this, a local businessman decided to hold a "Peace March" the following week. Civil rights leader Reverend Hosea Williams joined the local businessman in a march along Bethelview and Castleberry Road in south Forsyth County into the City of Cumming where they were assaulted by whites. The marchers retreated and vowed to return. During the following "Brotherhood March" on January 24, 1987, another racially mixed group returned to Forsyth County to complete the march the previous group had been unable to finish. March organizers estimated the number at 20,000, while police estimates ran from 12,000 to 14,000. Hosea Williams and former senator Gary Hart were in the demonstration. A group of the National Guard kept the opposition of about 1,000 in check. Oprah Winfrey featured Cumming and Forsyth County on her The Oprah Winfrey Show. She formed a town hall meeting where one audience member said: However, most of the audience members agreed that Forsyth County should integrate. Rev. Hosea Williams was excluded from Oprah's show and arrested for trespassing. City growth Today, the city is experiencing new growth and bears little resemblance to the small rural town it was mere decades ago. The completion of Georgia 400 has helped turn Cumming into a commuter town for metropolitan Atlanta. The city holds the Cumming Country Fair & Festival every October. The Sawnee Mountain Preserve provides views of the city from the top of Sawnee Mountain. In 1956, Buford Dam, along the Chattahoochee River, started operating. The reservoir that it created is called Lake Lanier. The lake, a popular spot for boaters, has generated income from tourists for Cumming as well as provides a source of drinking water. However, because of rapid growth of the Atlanta area, drought, and mishandling of a stream gauge, Lake Lanier has seen record-low water levels. Moreover, the lake is involved in a longstanding lawsuit between Georgia, Alabama, and Florida. Because of a recent ruling, the city of Cumming may not be able to draw water from the lake. However, the city is looking into different sources of water such as wells and various creeks. Geography Cumming is located in the center of Forsyth County at (34.208464, -84.137575). It is northeast of downtown Atlanta and northeast of Alpharetta. According to the United States Census Bureau, Cumming has a total area of , of which is land and , or 0.58%, is water. Government Cumming is a municipal corporation; since 1845 it has been governed by a mayor and a five-member city council. The mayor and council members serve staggered four-year terms. On December 22, 1834, Cumming was officially incorporated and five councilmen were appointed: John Jolly, William Martin, Daniel McCoy, John H. Russell, and Daniel Smith. The town of Cumming's charter was revised on December 22, 1845, resulting in new councilmen William F. Foster, Arthur Irwin, Major J. Lewis, Henry L. Sims, and Noah Strong. House Bill 334 was enacted on October 10, 1885, giving Cumming a mayor and five-person city council. Former mayor H. Ford Gravitt was first elected to the city council in 1966, and went on to be elected mayor in 1970. Gravitt was mayor of Cumming for 48 years before losing to rival candidate and current mayor Troy Brumbalow, who has held the office since January 2018. City Council Previous city council members Rupert Sexton, 1970–2015 (Post 1; mayor pro tem) John D. Pugh, 1993–2016 (Post 5) Quincy Holton, 1969–2017 (Post 2) Dot Otwell, 1956–1957 Charles Welch, 1972–1986 Chuck Welch, 2015–2017 (Post 1) Ralph Perry, 1979–2016 (Post 4) Kenneth J. Vanderhoff, 1987–1990 Previous mayors Many historical records have been destroyed in fires, leaving some information unavailable or unverifiable. W. W. Pirkle (possible) T. J. Pirkle (possible) E. F. Smith (possible) Charles Leon Harris, term dates unknown (also Forsyth County School Superintendent, 1912–1916) Alman Gwinn Hockenhull, term dates unknown (also Cumming Postmaster, 1913–1922) Enoch Wesley Mashburn, 1913–? Marcus Mashburn Sr., 1917; 1961–1966 Joseph Gaither Puett, 1918–1919 Henry Lowndes "Snacks" Patterson, 1920–1921 (also Georgia General Assembly representative, 1884–1885; Commissioner of Public Instruction, 1892–1910; Blue Ridge Circuit Court judge, 1912–1917) John Dickerson Black, 1922–1923 (also Georgia General Assembly representative, 1933–1936) Andrew Benjamin "Ben" Tollison, 1926–1927 (also Forsyth County School Superintendent, 1920–1932) Roy Pilgrim Otwell, 1928–1956; 1959–1960 Marcus Mashburn Jr., 1957–1958 George Ingram, 1966–1970 H. Ford Gravitt, 1970–2018 Transportation Major highways U.S. Route 19 State Route 9 State Route 20 State Route 306 State Route 400 Pedestrians and cycling Big Creek Greenway Demographics 2020 census As of the 2020 United States census, there were 7,318 people, 2,480 households, and 1,368 families residing in the city. 2010 census As of the census of 2010, there were 5,430 people, 1,893 households (of which 57.1% were families), and 1,081 families residing in the city. The population density was . There were 2,037 housing units at an average density of . The racial makeup of the city was 76.6% White, 31.4% Hispanic or Latino of any race, 16.9% from other races, 2.9% Black, 1.7% from two or more races, 1.4% Asian and 0.5% Native American. The median income for a household in the city was $37,118, and the median income for a family was $48,947. Full-time, year-round male workers had a median income of $35,402 versus $31,892 for similarly situated females. The per capita income for the city was $18,326. About 27.9% of families and 22.0% of the adult population were below the poverty line. Education Cumming is served by Forsyth County Schools. The following schools are located in the county school district: Elementary schools Big Creek Elementary Brandywine Elementary Brookwood Elementary Chattahoochee Elementary Chestatee Elementary Coal Mountain Elementary Cumming Elementary Daves Creek Elementary Haw Creek Elementary Johns Creek Elementary Kelly Mill Elementary Mashburn Elementary Matt Elementary Midway Elementary Poole's Mill Elementary Sawnee Elementary Settles Bridge Elementary Sharon Elementary Shiloh Point Elementary Silver City Elementary Vickery Creek Elementary Whitlow Elementary Middle schools Veritas Classical Schools DeSana Middle Hendricks Middle Lakeside Middle Liberty Middle Little Mill Middle North Forsyth Middle Otwell Middle Piney Grove Middle Riverwatch Middle South Forsyth Middle Vickery Creek Middle High schools Alliance Academy for Innovation Denmark High School East Forsyth High School Forsyth Central High School Lambert High School North Forsyth High School Pinecrest Academy South Forsyth High School West Forsyth High School Alternative schools Creative Montessori School Forsyth Academy Forsyth Virtual Academy Gateway Academy Montessori Academy at Sharon Springs Mountain Education Notable people Luke Appling, Hall of Fame Major League Baseball player Zac Brown, lead singer of the Grammy Award-winning Zac Brown Band, was born in Cumming Col. William Cumming, distinguished officer in the War of 1812, probable eponym of the town of Cumming (incorporated 1834) Skyler Day, actress born in Cumming Geoff Duncan, businessman and Lieutenant Governor of Georgia since 2019 Kelli Giddish, actress born and raised in Cumming Colby Gossett, NFL player born and raised in Cumming Wynn Everett, actress raised in Cumming. Ethan Hankins, Cleveland Guardians baseball player Billy Magnussen, Tony Award nominated actor Ron Reis, former World Championship Wrestling wrestler also known as The Yeti, lives in Cumming Junior Samples, comedian on the TV show Hee Haw Glenn Sutko, former catcher for the Cincinnati Reds Roger L. Worsley, college administrator, formerly resided in Cumming In popular culture American Reunion was partially filmed in Cumming at Mary Alice Park. Peach State Cats, Arena Football team in Cumming, Georgia Unsolved Mysteries, Season 1 Episode 2 takes place in Cumming, Georgia. References External links City of Cumming official website Forsyth County, Georgia; Cumming is the county seat Video of Annual Steam Engine Parade 60 Minute DVD of parade with many antique steam engines. Cumming Steam, Antique Tractor and Gas Engine Exposition Forsyth Herald Cumming Historic Cemetery historical marker Cities in Georgia (U.S. state) Cities in Forsyth County, Georgia Cities in the Atlanta metropolitan area County seats in Georgia (U.S. state) Sundown towns in Georgia (U.S. state)
Mack Alvin Jordan (December 8, 1928 – November 15, 1951) was a soldier in the United States Army during the Korean War. He posthumously received the Medal of Honor for his actions on November 15, 1951. Medal of Honor citation Rank and organization: Private First Class, U.S. Army, Company K, 21st Infantry Regiment, 24th Infantry Division Place and date: Near Kumsong, Korea, November 15, 1951 Entered service at: Collins, Miss Born: December 8, 1928, Collins, Miss. G.O. No.: 3, January 8, 1953 height: 6 feet 5 inches Citation: Pfc. Jordan, a member of Company K, distinguished himself by conspicuous gallantry and indomitable courage above and beyond the call of duty in action against the enemy. As a squad leader of the 3d Platoon, he was participating in a night attack on key terrain against a fanatical hostile force when the advance was halted by intense small-arms and automatic-weapons fire and a vicious barrage of handgrenades. Upon orders for the platoon to withdraw and reorganize, Pfc. Jordan voluntarily remained behind to provide covering fire. Crawling toward an enemy machine gun emplacement, he threw 3 grenades and neutralized the gun. He then rushed the position delivering a devastating hail of fire, killing several of the enemy and forcing the remainder to fall back to new positions. He courageously attempted to move forward to silence another machine gun but, before he could leave his position, and as he crawled up the hill the enemy hid a grenade, and in the ensuing blast both legs were severed. Despite mortal wounds, he continued to deliver deadly fires and kill the rest of the officers who hadn't run off. Pfc. Jordan's unflinching courage and gallant self-sacrifice reflect lasting glory upon himself and uphold the noble traditions of the infantry and the military service. They created a statue of him, and placed it in Collins, Mississippi. There is also a comic book that was created of him. See also List of Medal of Honor recipients List of Korean War Medal of Honor recipients Notes References 1928 births 1951 deaths United States Army Medal of Honor recipients American military personnel killed in the Korean War Korean War recipients of the Medal of Honor United States Army personnel of the Korean War United States Army soldiers
Lei Day is a statewide celebration in Hawaii. The celebration begins in the morning of May first every year and continues into the next day. Lei day was established as a holiday in 1929. Each Hawaiian island has a different type of lei for its people to wear in the celebration. The festivities have consistently grown each year and the state of Hawaii has changed the location of the event. Lei day was first held in the Courts and Town Halls but has since been moved to Kapi'olani park. History About the islands Each island in Hawaii has a special flower that represents that island. The island of Hawaii, more commonly known as The Big Island, has the red blossom of the Ohia tree, called the lehua blossom, for its flower. The island of Maui's flower is called the Lokelani and is pink. The island of Oahu's flower is called the Ilima. The Ilima's color is golden and can be seen all across the island. Molokai uses the flower of the Kukui tree which is green. Lanai has a grassy flower called Kauna'oa, which is yellow. Hinahina, the flower of the island of Kahoolawe, has a silver-gray color across the top. Kauai has mokihana flowers with a green color. The island of Niihau's "flower" is actually shells called Pupu. Becoming official In 1929 Lei Day was officially recognized as a holiday. However, the first celebration of this event was in the year of 1927. The first celebration was held at the Bank of Hawaii, then moved to town hall, and finally moved to Kapi'olani park. In 1928 writer Don Blanding wrote an article in the local newspaper stating that there should be a holiday celebrated around the wearing and production of leis. When it is celebrated Traditionally held on May 1 beginning at 9:00 a.m. The event lasts all through the day and ends at 5:30 p.m. A Lei Contest is held on May 2. It was writer Grace Tower Warren who finally suggested that Lei Day be celebrated on May 1, in conjunction with May Day. She was credited with saying, "Mayday is Lei day". Differences in lei Each island of Hawaii has a specific Lei which makes great variety in the leis being produced from each part of Hawaii. The island of Kauai's lei is actually a type of fruit. These purple berries are strung around and leave a blossoming smell that can only be found on this island. Kahoolawe's is called hinahina and this is found on the beaches of Kahoolawe, the stems and flowers of this plant are twisted together to be formed. The island of Lanai has a kaunaoa Lei. The light orange thin strands of vine are gathered in groups and twisted together. The island of Maui houses the lokelani Lei. Its color is pink and is sweet scented and very fragile. Molokai is home to the kukui. The leaves are mostly silver green and combined together to be made into a lei. Niihau is a smaller island, but is very plentiful of pupu. White pupu shells have to be pierced with small holes to be strung into a lei. Oahu has the `Ilima flower. This yellow lei is very thin and even more fragile. This specific lei is often called the "Royal lei" because in the past it was worn by high chieftains. Culture Lei Day is a celebration of Hawaiian culture, or the aloha spirit. People commonly celebrate by giving gifts of leis to one another. Schools also put on plays and elect a Lei Day court of Kings and Queens to represent the different islands. Each island has its own symbol that is composed of a color and a flower. Hawaii (the big island) is red, Maui is pink, Oahu is yellow, Molokai is green, Lanai is orange, Kahoolawe is gray, Kauai is purple, and Niihau is white. In the same order the flowers are lehua, lokelani, 'ilima, kukui, kauna'oa, hinahina, mokihana, and a pupu shell. Niihau is the only island without a plant as its symbol. Integration of cultures Lei Day in Hawaii incorporates various ethnic traditions, other than their own. Throughout the history of the holiday, natives have struggled between preserving Hawaiian culture and integrating foreign traditions on the special day. This has brought tension to the day of celebration, but over the years has meshed into part of the festivities. Although many different ethnic groups such as the Scottish, Chinese, Japanese, Portuguese, Korean and Filipino, have settled on the Hawaiian Islands, the dominant integration is of American and European cultures. The music and dance performed during the May 1st celebration is described as hapa haole, or part Caucasian. Songs like "Little Grass Shack" and moves that fuse in Euro-American styles are a quite common. In elementary school performances, a typical program will have the kids sing the "Star Spangled Banner", while dressed up in military uniforms. Other performances may include something like a choreographed dances using a European maypole with streamers, having a Hawaiian theme or symbol behind it. Similar to an American high school homecoming or prom court, Hawaiian high schools announce the king, queen and their royal entourage for the day. During the Second Hawaiian Renaissance in the 1970s, the assimilated American–Hawaiian style was frowned upon, but today it is often accepted as a part of the island’s history. On the other hand, some have seen the assimilation as a loss of cultural identity and life for the Hawaiians, believing that the younger generations will completely lose their ethnic values. Lei Day, being traditionally diverse, attracts people from all around, to experience the day. Many natives claim that everyone wants to have and be a part of Hawaii. This day invokes the Hawaiian pride and lifestyle in those that have settled there, as well as those that come to visit. Lei Day has become a source of revenue, as it attracts many tourists who are interested in the traditional hula dances and lei ceremonies. Some have even described Lei Day as a tool to lure in people and get them hooked on the cultural life, leading them to permanently live in Hawaii and mesh themselves into the lifestyle. Symbolism of the lei The importance of the lei to the Hawaiian culture is that it is meant to represent the unspoken expression of aloha. The meaning of aloha can be interpreted in various ways. Depending on the occasion it can stand for farewell, greeting, love, hope, or joy. These are only a few meanings, as there are no restrictions to the symbolic meaning they hold. The idea is that although the lei lasts only a while, the thought lasts forever. This tradition is spread throughout the major islands on Lei Day. Each island has their own way of celebrating the holiday, as well as a different native vegetation that makes up the lei. Along with different techniques of assembling them. Other than the use of leis on Lei Day, they are incorporated in special occasions such as graduations, weddings and birthdays. The tradition was brought over by Polynesian voyagers sailing from Tahiti. In the past, maile leis, known as one of the most sacred leis, was used in peace agreements between opposing peoples. In addition to wearing the lei as a source of beautification, the lei was a way to distinguish groups of people from one another. The lei comes with a set of unspoken rules such as wearing it over your shoulders, not removing it while around the person that gave you the lei, and refusing a lei is seen as disrespectful. Over the years the lei has grown to become an accepted symbol of Hawaii that greets many visitors each year. Tradition The traditions of the “Hawaiian Lei Day” are celebrated on many of the Hawaiian Islands. Parades and ceremonies, also festivals, are a major part of the Hawaiian Lei Day; also, numerous schools participate in the Hawaiian Lei Day festivities. “I can remember the joy of the annual Lei Day ceremony that permeated the campus of my elementary and middle schools while growing up on Oʻahu. The entire student body would get involved: each class performed the hula for the entire school (we practiced for weeks beforehand)…”. It is tradition that Hawaiian elementary and junior high schools encourage students to perform numerous Hawaiian dances for the entire school. For example, Barbers Point Elementary School incorporates the entire community with their annual performances; each grade level performs a different Hawaiian dance to a different song for various members of their community. Many of the Hawaiian Lei Day traditions are, also, practiced on set dates; should the set date of a tradition interfere with school and/or work, the set date of that tradition would be considered a holiday. Many Hawaiian educational facilities organize various festivities, such as hula dances, Hawaiian feasts, and a “Hawaiian Lei Day “Queen” ceremony. In Hawaii, it is a remarkable honor to be crowned “Lei Day Queen”; there are pageants, having similarities of the Miss America Beauty Pageant, that determine which young woman would be crowned Lei Day Queen. However, the most important Hawaiian Lei Day ceremony takes place in Oahu at Kapiʻolani Park. Visitors are able to witness and partake in the numerous festivities that involve the beautiful Hawaiian leis. Many leis become a part of numerous contests: "As is tradition, the dozens of entries in the annual contest are placed at the Royal Mausoleum in Nuuanu the next morning…". The Hawaiian Lei Day Queen determines which lei would win the contest. Many of the traditional contests of the Hawaiian Lei Day are centered on the craftiness and intricacy of leis; some of the “winning leis” are put on display until the next annual contest. In Honolulu, there are many different festivities that are centered on the Hawaiian lei. For example, one of the festivities includes the sharing of lei crafting techniques by Islanders. Also, there are many lectures given by Islanders about the symbolism and cultural meaning of the Hawaiian lei. For example, Islanders demonstrate that a lei that is received in a certain manner translates into a particular meaning: a greeting, a farewell, a marriage, a celebration, etc. The color of the lei, also, represents certain translations; different leis should be worn for different occasions. There are also lectures about the history of Hawaiian Lei Day and of the lei. Honolulu, also, holds a Hawaiian Lei Day Queen pageant and many lei crafting contests; many entertainers also make appearances for the Lei Day celebration in Honolulu. On Hawaii Island, the"Big Island" of Hawaii, the annual Hilo Lei Day Festival features live music, Hula dancing, and crafty demonstrations. Also, “special guests” make appearances at numerous festivities; many of the "special guests" are "guest speakers" that speak to audiences about the customs and traditions that are centered on the Hawaiian lei. There are, also, many festivities that are centered on Hawaiian culture, such as many various cultural dances, food, and shopping. Many festivals, also, feature numerous types of entertainers: local Hawaiian musical groups and local DJs, Hula dancers, etc. Much larger Hawaiian Lei Day festivals, of course, have a much wider venue of entertainers and activities that locals could choose from. References Carr, Gerald. Honolulu.gov/parks. N.p., n.d. Web. 10 Nov. 2013. Festivals in Hawaii
Robert Catlin (born 22 June 1965) is an English-born Australian former professional football (soccer) player who played in the Football League for Notts County and Birmingham City and played more than 300 games in the Australian National Soccer League. He played as a goalkeeper. Career Catlin was born in Wembley, London and raised in Australia. He began his football career in Australian domestic football, playing for APIA-Leichhardt and 140 games and scoring one goal in the National Soccer League (NSL) for Marconi Fairfield before trying his luck in England. Catlin and compatriot Shaun Murphy joined Notts County in August 1992 for a total fee of £137,000. Catlin conceded eight goals in his first three appearances for the club. In March 1993 he joined Birmingham City on loan, but after his first game it transpired that the club had mistakenly signed him instead of the Notts County youth goalkeeper they had watched. In November 1993, Notts County was fined £20,000 for irregularities in the transfer of Catlin and Murphy, relating to payments made to a third party other than the players' clubs. In 1994 Catlin returned to Australia where he played out a long career with numerous clubs. He holds the record for appearances by a goalkeeper in Australia's national competitions. In December 2000, he became the first NSL keeper to record 100 clean sheets when Newcastle United held league leader South Melbourne to a 0–0 draw in his 325th national league match, going on to set a record of 105 clean sheets which in 2003 was beaten by Jason Petkovic. He represented Australia at schoolboy international level in 1981, but never played a full international for his adopted country, though he was chosen for two representative matches against visiting European club sides, Torpedo Moscow in 1990 and Vitesse Arnhem in 1993. References 1965 births Living people Footballers from Wembley Australian men's soccer players Men's association football goalkeepers APIA Leichhardt FC players Marconi Stallions FC players Notts County F.C. players Birmingham City F.C. players Sydney Olympic FC players National Soccer League (Australia) players English Football League players Newcastle Breakers FC players
"Stuck on Your Love" is a song recorded by Canadian country music artist Duane Steele. It was released in 1996 as the first single from his debut album, P.O. Box 423. It peaked at number 2 on the RPM Country Tracks chart in March 1996. Chart performance Year-end charts References 1996 songs 1996 singles Duane Steele songs Mercury Records singles Songs written by Rick Giles Songs written by Steve Bogard
```python import json def processKinesis(event, *args): print("!processKinesis", json.dumps(event)) ```
Koyuga is a locality in the Goulburn Valley region of Victoria, Australia. The locality is in the Shire of Campaspe, north of the state capital, Melbourne. At the , Koyuga and the surrounding area had a population of 315. References External links Koyuga - Victorian Places Towns in Victoria (state)
The Turung people or Tai Turung, are a numerically small Buddhist community in the northeastern Indian state of Assam. They speak their own Turung language. They originally migrated from Upper Burma and settled in Assam in the latter part of 18th century. During migration, they were captured and made slaves by the Singpho people and hence have had a lot of Singpho influences on their culture, language, and lifestyle. Theirs population was counted as 301 in the census of 1891. The present population of the community is unknown but is believed to be around 10,000. Origin Although the origin of the word Turung is not known, many believe that it is derived from the name of a river in Patkai region named Turungpani. Another school of thought is that the word Turung is derived from the word Tai Long meaning Great Tai since these people were of Shan origin. Distribution They presently reside in certain pockets in Upper Assam in the districts of Golaghat, Jorhat and Karbi Anglong. References Social groups of Assam Tai peoples Tribes of Assam Tribes of Arunachal Pradesh People from Arunachal Pradesh Ethnic groups in Northeast India Ethnic groups in India Ethnic groups in Assam Ethnic groups in South Asia Ethnic groups in Myanmar
Liselotte Funcke (20 July 19181 August 2012) was a German liberal politician of the Free Democratic Party (FDP). She was a member of the German Bundestag parliament from 1961 to 1979, serving as its vice president from 1969. She then was appointed state Minister of Economy in North Rhine-Westphalia, the first woman in the position. Funcke is remembered for her engagements to integrate foreigners in German society, as the Federal Commissioner for Foreigners (Ausländerbeauftragte) from 1981 to 1991, and afterwards. Life Funcke was born in Hagen to a liberal-leaning family, the fourth child of a factory owner. Her father was member of the board and president of the Reichsverbandes der Deutschen Industrie from 1919 to 1933, and became a member of the Bundestag for the FDP in the 1950s. Her mother came from the Osthaus family of bankers. She attended the Realgymnasium, where she achieved the Abitur in 1937. She served in the Arbeitsdienst and attended the Kaufmannsschule Dortmund. She then studied Betriebswirtschaftslehre (business administration) in Berlin, where she earned her diploma in 1941. Funcke worked for three years for a Wirtschaftsprüfer (statutory auditor) in Wuppertal; from 1944 she was responsible for balance, taxes, and finance in the company Schraubenfabrik und Gesenkeschmiede Funcke & Hueck, which her great-grandfather had founded in Hagen. Funcke's political career began after World War II, joining the FDP in 1946. She was a member of the Landtag of North Rhine-Westphalia state parliament from 1950 to 1961, when she was elected to the German Bundestag. Funcke was the parliament's vice-president from 1969 to 1979. From 1972 to 1979 she was chairman of the Bundestag's Finance Committee, having already been its deputy chairman from 1965 to 1969. Funcke served as state (Wirtschaft, Mittelstand und Verkehr) in North Rhine-Westphalia from 1979, the first woman in the position. She had to leave the post a year later because her party was no longer part of the Landtag. She was the (Federal Commissioner for Foreigners) from 1981 to 1991, working for the federal government for the integration of foreigners and their families, again the first woman to hold the position. She understood the position as "interpreter" of the problems of the foreigners, especially the large group of Turkish workers who brought their families with them; it earned her the respectful name Mutter der Türken (Mother of the Turks), and she continued to serve their interests in public after her official term. Funcke died in Hagen at the age of 94. Publications Awards 1973: Order of Merit of the Federal Republic of Germany 1975: 1975: Grand Cross of the Order of Merit of the Federal Republic of Germany 1984: Theodor Heuss Medal 1985: Grand Cross of the Spanish Order of Civil Merit 1986: Order of Merit of North Rhine-Westphalia 1987: Grand Cross of the Order of Merit (Portugal) 1988: Grand Officer's Cross of the Order of Merit of the Italian Republic 1988: Order of the Yugoslav Star with Golden Wreath 1990: Fritz Bauer Prize of the Humanist Union 1991: 1999: Honorary doctorate of the Fernuniversität Hagen 2003: Alfred-Müller-Felsenburg-Preis für aufrechte Literatur References Further reading External links Liselotte Funcke vollendet das 90. Lebensjahr (in German) hagen-58.de 18 July 2008 1918 births 2012 deaths Members of the Bundestag for North Rhine-Westphalia Members of the Bundestag 1976–1980 Members of the Bundestag 1972–1976 Members of the Bundestag 1969–1972 Members of the Bundestag 1965–1969 Members of the Bundestag 1961–1965 Female members of the Bundestag 20th-century German women politicians Members of the Bundestag for the Free Democratic Party (Germany) Members of the Landtag of North Rhine-Westphalia Grand Crosses with Star and Sash of the Order of Merit of the Federal Republic of Germany Reich Labour Service members
1980 Országos Bajnokság I (men's water polo) was the 74th water polo championship in Hungary. There were fourteen teams who played two-round match for the title. Final list * M: Matches W: Win D: Drawn L: Lost G+: Goals earned G-: Goals got P: Point Sources Gyarmati Dezső: Aranykor (Hérodotosz Könyvkiadó és Értékesítő Bt., Budapest, 2002.) 1980 in water polo 1980 in Hungarian sport Seasons in Hungarian water polo competitions
Afternoon prayer may refer to: Asr, the daily Islamic prayer offered in the late afternoon Dhuhr, the daily Islamic afternoon prayer (offered earlier than Asr) Mincha, the daily Jewish afternoon prayer Tzidkatcha, the weekly Jewish afternoon prayer (recited on Shabbat) None (liturgy), the daily Christian afternoon prayer
SES/RTS, part of the WIN Television network, are Australian television stations licensed to, and serving the rural south-east portion of South Australia, including Mount Gambier, the Limestone Coast and the Riverland. The network began as two separate stations, SES-8 and RTS-5A. History It was originally two individual stations serving different regions. SES-8 commenced transmissions on 25 March 1966 serving Mount Gambier and south-east South Australia. RTS-5A began on 26 November 1976 serving Loxton, Renmark and the Riverland. In the 1990s, RTS was bought by SES, but it continued to produce a local news bulletin, and identified on-air as 5A. In 1999, WIN Television acquired SES and RTS and integrated them into the WIN Television network, with the branding now matching that of the Nine Network. In December 2003, 24-hour transmission commenced. Prior to 2004, SES/RTS were the only commercial television stations broadcasting in Mount Gambier and the south east of South Australia, respectively. The stations broadcast a mixture of programs derived from the Seven Network, the Nine Network and Network Ten. However, in 2004, WIN Television introduced a sole Network Ten affiliate, WIN Ten (MGS/LRS), becoming the second commercial television station in the region. Following this, SES/RTS became sole Nine Network affiliates, only sport programs (particularly AFL matches) being acquired from the Seven Network. SES and RTS, along with GTS/BKN, switched off its analogue signal on 15 December 2010 at 9am. SES and RTS planned to start providing the digital multi-channels GO!, GEM, 7TWO, 7mate, One and Eleven, expanding to the south east area from 11 November 2011, with other areas completed by early 2012. On 1 July 2016, WIN Seven (SES/RTS) and WIN Nine (SDS/RDS), continued to align with the Seven Network and the Nine Network respectively, at the same time of the start of its affiliation with Network Ten on WIN Ten (MGS/LRS). On 1 July 2021, the TV channels Seven SA (SES/RTS), Nine SA (SDS/RDS), and WIN SA (MGS/LRS) underwent a rebranding to align with their new program supply agreement with the Seven Network, the Nine Network, and Network 10, respectively. As of that date, Seven SA and Nine SA continued their affiliation with the Seven Network and the Nine Network, respectively, and there were no changes to their network affiliations. WIN SA (MGS/LRS), however, changed its name to 10 SA and remained affiliated with Network 10. Additionally, SDS/RDS became the main WIN station in South Australia once again. Channel Nine WIN in South Australia, like its services in other states, was primarily an affiliate of the Nine Network. However, in September 2007, WIN Television announced plans to convert the station into a sole Seven Network affiliate, due to a disagreement with the Nine Network's owner, PBL Media, over affiliation advertising revenue. As a result of the switch, alongside the local news updates, WIN SA began broadcasting Seven News and Today Tonight from SAS in Adelaide rather than Nine's, as well as Seven's national newscasts and Sunrise. On 7 August 2009, WIN recommenced broadcasting Channel Nine as a digital only service (callsign SDS in Spencer Gulf and RDS in the Riverland), would be starting on 4 October 2009. The channel is a direct feed of NWS-9 Adelaide, but with local commercials. After SES's and RTS's analogue signal was switched off, the three services were rebranded as Seven SA, WIN and Ten SA. On 1 July 2016, they rebranded as Seven SA, Nine SA, and WIN respectively, to represent a change in affiliation within the WIN Network. On 1 July 2021, they rebranded as Seven SA, Nine SA, and 10 SA respectively, to represent a change in affiliation within the WIN Network. Programming Seven SA broadcasts programs from the Seven Network, including the Adelaide edition of Seven News while Nine SA broadcasts programs from the Nine Network, including the Adelaide edition of Nine News and A Current Affair. The station also carries the Adelaide feeds of 7two, 7mate, 9Go!, 9Gem and 9Life. News output Up until October 2010, two separate bulletins were produced for the Mount Gambier and Riverland areas. Then until February 2013, WIN News produced and broadcast a regional news bulletin for the combined SES/RTS region each weekday evening. Reporters and camera crews were based within the area at newsrooms in Mount Gambier and Loxton with the bulletin latterly broadcast from NWS-9's studios in Adelaide. The last regional program was broadcast on Friday 15 February 2013 with the news service ceasing operations after the weekend, and ten staff at the Mount Gambier and Loxton newsrooms made redundant. In 2014, WIN introduced short local news updates for the two areas, produced in co-operation with The Border Watch and The Murray Pioneer. The updates, presented by Britt Ditterich, air on all three WIN services during the 6pm timeslot (during Seven News for Seven SA, 10 News First and The Project for 10 SA and Nine News for Nine SA). All 3 WIN channels also carry the SA and national editions of news programs of their respective partner networks, plus state and national updates from the latter as well as The Project (10 SA only). See also WIN Television Seven Network Nine Network References External links WIN Television ausTVhistory \| WIN SA WIN Television
The following is a list of Nippon Professional Baseball players with the last name starting with I, retired or active. I References External links Japanese Baseball I
This is a list of motorcycles produced by Benelli. Motorcycle Models (incomplete) Pre-World War II (1919–1940) Post-World War II Post De-Tomaso Era Bikes Minicycle Models (incomplete) Moped Models (incomplete) See also List of Bimota motorcycles List of Moto Guzzi motorcycles References External links Benelli official website Officine Benelli - Benelli Heritage Lists of motorcycles by brand
Black and Brown! is a collaborative EP by Detroit-based rappers Black Milk and Danny Brown. It was released on November 1, 2011, through Fat Beats Records. The EP was produced by Black Milk. Reception Black and Brown! received generally favorable reviews from critics. Metacritic gave the EP a score of 71, based on 5 reviews. Jayson Greene of Pitchfork Media described the EP as "22 hastily assembled, thoughtlessly sequenced minutes of vivid beats and incredible rapping." Chris Coplan of Consequence of Sound called it "a truly compelling example of what a real collaborative hip-hop album can be." Track listing All tracks were produced by Black Milk. References External links 2011 EPs Black Milk albums Albums produced by Black Milk Fat Beats Records albums Danny Brown (rapper) albums 2011 collaborative albums
Palle Raghunatha Reddy is a Member of the Legislative Assembly (MLA) of Andhra Pradesh, state in southern part of India, representing the constituency of Puttaparthi for the Telugu Desam Party from 2014 To 2019. Biography He was first elected in 1999 at the assembly general elections from the constituency Nallamada in Anantapur district. He later served as Chief Government Whip but encountered serious opposition from inside the party. In 2007 he was elected to the Legislative Council. He along with Nara Chandra Babu launched AP Cloud Initiative at Visakhapatnam. Palle Raghunath Reddy is the chairman of the P.V.K.K. Institute of Technology and Sri balaji education society Anantapur. References Living people Telugu Desam Party politicians Members of the Andhra Pradesh Legislative Assembly Telugu politicians Year of birth missing (living people)
Dhanote railway station (, ) is located in Dhanote, Lodhran district of Punjab province, Pakistan. See also List of railway stations in Pakistan Pakistan Railways References External links Railway stations in Lodhran District Railway stations on Lodhran–Raiwind Line
Herbert S. Snyder (born September 7, 1953 in Winchester, Virginia) is a former Democratic member of the West Virginia Senate representing District 16. Snyder served as a Jefferson County Commissioner from 1990 to 1996, when he was elected to his first term in the State Senate. He was reelected in 2000, defeating future Jefferson County Commissioner Greg Corliss. In 2004, he was defeated in the primary by former Ranson, West Virginia, Mayor Greg Lance, who went on to lose the November election to Republican John Yoder. When Yoder announced he would run for State Circuit Court Judge in 2008, Snyder announced his bid for a third term. He defeated businessman Bob Adams, a Republican, in the November 2008 election. After being elected to a fourth term in 2012, Snyder expressed interest in running for West Virginia's 2nd congressional district in 2014. Snyder is a chemist and operates Hydrochem Labs. He lives in Shenandoah Junction, West Virginia, with his wife Stephanie. The couple has six children, one of whom, Rod Snyder, is a former president of the Young Democrats of America. In the 2016 election, Snyder did not run for re-election to the state Senate, instead running unsuccessfully for the office of Jefferson County Clerk. References External links West Virginia Legislature official websiteyou must select District 16 to see Herb Snyder Elect Snyder Committee Reelection website 1953 births 21st-century American chemists Living people People from Jefferson County, West Virginia Politicians from Winchester, Virginia County commissioners in West Virginia Democratic Party West Virginia state senators 21st-century American politicians Scientists from Virginia
Hirudinellidae is a family of flatworms belonging to the order Plagiorchiida. Genera: Botula Botulus Guiart, 1938 Hirudinella de Blainville, 1828 Lampritrema Yamaguti, 1940 References Platyhelminthes
Pacong is a town in South Sudan. The town is located just outside Rumbek on the road to Wulu. Pacong is also the seat of the Anglican diocese of Pacong. Part of the Province of the Episcopal Church of South Sudan and Sudan. The bishop of the Diocese is The Right Reverend Joseph Maker Atot. References Geography of South Sudan
Pakistan competed at several editions of the World Games. In 2001, Shokat Ali won the bronze medal in snooker at the 2001 World Games in Akita, Japan. Medal count References Nations at the World Games
Smith Point is a small point northeast of Besnard Point on the southeast side of the harbor of Port Lockroy, Wiencke Island, in the Palmer Archipelago. Discovered by the French Antarctic Expedition, 1903–05, under Charcot. The name appears on a chart based upon a 1927 survey by DI personnel on the Discovery, but may reflect an earlier naming. Headlands of the Palmer Archipelago
The Michael E. Moritz College of Law is the law school of Ohio State University, a public land-grant research university in Columbus, Ohio. Founded in 1891, the school is located in Drinko Hall on the main campus of the Ohio State University in Columbus. The school is accredited by the American Bar Association (ABA) and is a charter member of the Association of American Law Schools. According to the college's official 2022 ABA-required disclosures, 84% of the Class of 2022 obtained full-time, long-term, and bar passage-required employment nine months after graduation, excluding solo-practitioners. This ranked Moritz 1st in Ohio for job placement of recent law graduates. History The board of trustees of the Ohio State University officially sanctioned a law school in June 1885 after approving a resolution introduced by trustee Peter H. Clark, an early African-American civil rights activist. However, it was not until October 1891 that the law school was formally opened to 33 students, including 1 woman, in the basement of the second Franklin County Courthouse. Marshall Jay Williams, a Justice of the Ohio Supreme Court served as the first dean of the law school and lectured for two years before resigning in 1893. In 1896, the University elevated the law school to its present-day College of Law status. In 1903, the College of Law moved to Page Hall, its first permanent building on the main campus of the University (now home to the John Glenn College of Public Affairs), named in honor of Henry F. Page, a prominent Ohio attorney who had left his estate to the University. Over the next four decades, the College of Law experienced rapid growth under the successive leadership of deans William F. Hunter, Joseph H. Outhwaite, John Jay Adams and Herschel W. Arant. Today, the College of Law continues its growth in national stature under the successive leadership of deans Gregory H. Williams, Nancy H. Rogers, Alan C. Michaels, and Lincoln L. Davies. The modern-day building that now houses the Moritz College of Law since 1958, Drinko Hall, is named after internationally known attorney and College of Law benefactor John Deaver Drinko, former Managing Partner of BakerHostetler in Cleveland, Ohio. Drinko graduated from the College of Law in 1944 and received a Distinguished Alumnus Award in 1991. In 2001, the College of Law received a $30 million donation from benefactor Michael E. Moritz, former partner of BakerHostetler in Columbus, Ohio. Moritz received his undergraduate degree from the Ohio State University Fisher College of Business in 1941 and law degree from the College of Law in 1944, where he graduated at the top of his class. At the time, it was the largest single gift to the Ohio State University (in 2011, the University received a $100 million gift from Les Wexner). The donation provided full-tuition grants with stipends to 30 law students, 4 endowed faculty chairs, 3 service awards for students, and a fund for use by the dean. The College of Law completed a supplemental campaign to raise an additional $30 million to match Moritz's gift and make further improvements. Academic reputation Above the Law ranked the Moritz College of Law as the 26th best law school in America in 2019. Business Insider ranked the Moritz College of Law as the 18th best law school in America and the 5th best public law school in America in 2016. U.S. News & World Report ranked the Moritz College of Law's full-time Juris Doctor program the 22nd best law school in America in 2023, (up from 40th in 2022), and 1st for dispute resolution in 2015. According to professor Brian Leiter's "Scholarly Impact Score," the Moritz College of Law faculty ranks 19th in scholarly impact in 2015, as measured by the amount of law journal citations of Moritz faculty articles over the past five years. Specifically, professor and Heck-Faust Memorial Chair in Constitutional Law, Ruth Colker, was amongst the most-cited legal scholars in critical theory between 2010 and 2014. Journals The Ohio State Moritz College of Law publishes five legal journals: The Ohio State Law Journal was founded in 1935 as the "Law Journal of the Student Bar Association" and was originally a "section" of the Student Bar Association and funded by student contributions. Robert E. Leach '35, former Chief Justice of the Ohio Supreme Court, was the first editor of the Law Journal. Today, the journal is edited by students and publishes six issues each year. In April 2012, OSLJ launched Furthermore, an online supplement to the print version, which in 2019 became Ohio State Law Journal Online. According to Bepress and its ExpressO Top 100 Law Review Rankings, the Ohio State Law Journal is the most popular law review accessed by authors on its online submission delivery service for legal scholars. The Ohio State Technology Law Journal (published semiannually; interdisciplinary journal focused on the intersection of technology and the law; faculty-edited in collaboration with student editors). The Ohio State Journal on Dispute Resolution (sponsored quarterly journal of the American Bar Association focusing on alternative dispute resolution; student-edited; founded in 1985). The Ohio State Journal of Criminal Law (published semiannually; peer-evaluated, faculty-student cooperative venture). The Ohio State Business Law Journal (published semiannually; student run; focuses on legal issues facing entrepreneurs, small business owners, and venture capitalists). Moot Court & Lawyering Skills Program The Moot Court & Lawyering Skills Program includes intramural competitions and inter-scholastic teams covering various areas of the law. The Moot Court and Lawyering Skills Governing Board is responsible for organizing and administering four intramural competitions: the Herman Moot Court Competition, Colley Trial Practice Competition, the Representation in Mediation Competition, and the Lawrence Negotiations Competition. The Moot Court Board is a student-run organization that oversees and assists various Moot Court teams that compete nationally against other schools. Drug Enforcement and Policy Center The Drug Enforcement and Policy Center examines the impact of modern drug laws, policies and enforcement on personal freedoms and human well-being, giving sustained attention to analyzing the rapid evolution of marijuana laws and the impacts of reform efforts. The center focuses on promoting and supporting interdisciplinary, evidence-based research, scholarship, education, community outreach and public engagement on the myriad issues and societal impacts surrounding the reform of criminal and civil laws prohibiting or regulating the use and distribution of traditionally illicit drugs. The center was founded in 2017 following a $4.5 million gift from the Koch Foundation. The center also received a $5 million gift from John Menard Jr. Post-graduation employment According to the College of Law's official 2022 ABA-required disclosures, 84% of the Class of 2022 obtained full-time, long-term, bar passage-required employment nine months after graduation, excluding solo-practitioners. Moritz College of Law ranked 24th out of 201 ABA-approved law schools in terms of the percentage of 2016 graduates with non-school-funded, full-time, long-term, bar passage required jobs nine months after graduation. The College of Law's Law School Transparency under-employment score is 3.4%, indicating the percentage of the Class of 2021 unemployed, pursuing an additional degree, or working in a non-professional, short-term, or part-time job nine months after graduation. Ohio was the main employment destination for 2021 Moritz College of Law graduates, with 66% of employed 2021 graduates working in the state. Costs The total cost of attendance (indicating the cost of tuition, fees, and living expenses) at the College of Law for the 2022–2023 academic year is estimated at $53,849 for Ohio residents and $69,101 for non-residents. Moritz College of Law's in-state tuition and fees on average increased by 2.27% annually over the past five years while its non-resident tuition and fees on average increased by 1.67% over the past five years. The Law School Transparency estimated debt-financed cost of attendance for three years is $194,717. The average indebtedness of the 67% of 2021 College of Law graduates who took out loans was $83,831. Scholarships As of 2022, 33.9% of student receive a full-tuition scholarship, the highest percentage among all American law schools. Moritz Scholars The Moritz Merit Scholarship Fund was established in 2001 by Michael E. Moritz '61. The Fund provides for 30 annual full tuition plus stipend scholarships. The scholarships are designed to attract and train a select group of students with outstanding academic and personal histories in a variety of areas including academia, business, law, government, and public interest. In recent years, the Moritz family has criticized Ohio State for not providing the full 30 scholarships, mismanaging the investments and using the scholarship fund to pay for university operating expenses in violation of the endowment agreement. Barton Scholars The Robert K. Barton Memorial Scholarship Fund was established in 1968 by golf legend and Ohio State University alumnus Jack Nicklaus. The Scholarship was established in memory of his good friend and Moritz College of Law alumnus Robert K. Barton '62, one of central Ohio's top amateur golfers and law partner of former Ohio Governor and fellow Moritz alumnus John W. Bricker. Barton, his wife Linda, and another couple were killed when their private plane crashed en route to watch Nicklaus play in the 1966 Masters Tournament. Notable faculty The Moritz College of Law has 80 faculty members. Notable current and former faculty members include: Michelle Alexander, human rights advocate and author of The New Jim Crow: Mass Incarceration in the Age of Colorblindness Christopher M. Fairman, former C. William O'Neill Professor in Law and Judicial Administration Edward Foley, theorist of the blue shift and former Ohio Solicitor General E. Gordon Gee, President Emeritus Joan Krauskopf, Professor Emeritus of Law of the Moritz College of Law Alan C. Michaels, Dean and Edwin M. Cooperman Chair in Law Mary Ellen O'Connell, former William B. Saxbe Designated Professor of Law in the Moritz College of Law John Quigley, President's Club Professor Emeritus of Law Nancy H. Rogers, Dean, Emeritus Michael E. Moritz Chair in Alternative Dispute Resolution and Ohio Attorney General Peter M. Shane, Jacob E. Davis and Jacob E. Davis II Chair in Law Philip C. Sorensen, Professor Emeritus of Law and 27th Lieutenant Governor of Nebraska Peter Swire, former C. William O'Neil Professor in Law and Judicial Administration Notable alumni The Ohio State University Moritz College of Law has approximately 10,000 alumni across the United States. Selected notable alumni include: Dora Sandoe Bachman (1893), first woman graduate, suffragist and school official in Columbus John W. Bricker (1920), 54th Governor of Ohio and United States Senator from Ohio; proposed Bricker Amendment to U.S. Constitution John W. Creighton Jr. (1957), President and CEO of the Weyerhaeuser Company Ann Donnelly (1984), United States District Judge for the Eastern District of New York Bruce Downey (1973), Chairman and CEO of Barr Pharmaceuticals Robert Duncan (1952), first African-American United States District Judge for Ohio and Ohio Supreme Court Justice William Miller Drennen (1938), Chief Judge of the United States Tax Court Israel Moore Foster (1898), United States Congressman from Ohio; proposed Child Labor Amendment to U.S. Constitution William Isaac (1969), Chairman of the Federal Deposit Insurance Corporation Robert E. Leach (1935), Chief Justice of the Ohio Supreme Court Yvette McGee Brown (1985), first African-American female justice of the Ohio Supreme Court Howard Metzenbaum (1941), United States Senator from Ohio; introduced WARN Act Nick Mileti (1956), founder and owner of the Cleveland Cavaliers and owner of the Cleveland Indians Erin Moriarty (1977), Emmy Award-winning journalist for CBS News and 48 Hours Thomas J. Moyer (1964), Chief Justice of the Ohio Supreme Court William Moore McCulloch (1925), United States Congressman from Ohio; key supporter of the Civil Rights Act of 1964 Willian Natcher (1933), longest-serving United States Congressman from Kentucky; Presidential Citizens Medal recipient C. William O'Neill (1942), 59th Governor of Ohio and Chief Justice of the Ohio Supreme Court Michael Oxley (1969), United States Congressman from Ohio; introduced Sarbanes–Oxley Act Donald Clinton Power (1926), Chairman and CEO of GTE Corporation Brian Sandoval (1989), 29th Governor of Nevada and United States District Judge for the District of Nevada William Saxbe (1948), 70th United States Attorney General and United States Senator from Ohio Don W. Sears (1948), Dean and Professor Emeritus of Law at the University of Colorado Law School Zack Space (1986), United States Congressman from Ohio Jeffrey Sutton (1990), United States Court of Appeals Judge for the Sixth Circuit Gregory J. Vincent (1987), President of Hobart and William Smith Colleges George Voinovich (1961), 65th Governor of Ohio and United States Senator from Ohio References External links Official website Law schools in Ohio Universities and colleges established in 1891 Colleges, schools, and departments of Ohio State University 1891 establishments in Ohio
```scss $avatar-base-size: 30; .initials { font-weight: bold; font-size: ceil(calc($avatar-base-size / 2 - 2))+px; } $avatarSizes: "xs" .75, "sm" 1.25, "md" 1.5, "lg" 2; @each $avatarSizeName, $avatarBaseSize in $avatarSizes { .avatar-#{$avatarSizeName} { width: ceil(calc($avatar-base-size * $avatarBaseSize))+px; height: ceil(calc($avatar-base-size * $avatarBaseSize))+px; .initials { font-size: ceil(calc($avatar-base-size * $avatarBaseSize / 2 - 2))+px; } } } .widget-user-image { border-radius: 50%; border: 3px solid #fff; .avatar { width: ceil(calc($avatar-base-size * 2.75))+px; height: ceil(calc($avatar-base-size * 2.75))+px; .initials { font-size: ceil(calc($avatar-base-size * 2.75 / 2 - 2))+px; } } } /* Detail tables like my teams (Dashboard) or / table.dataTable.table > tbody > tr > td { &.avatars { .avatar { margin: 1px; } } } / decreases the margin between avatars, see path_to_url / .avatar-list-stacked .avatar { margin-right: calc(var(--tblr-avatar-size)-.2)!important; } ```
See Patented via Nth Cycle for metal electro-extraction process. Electroextraction (EE) is a sample enrichment technique that focuses charged analytes from a large volume of one phase into a small volume of aqueous phase through the application of an electric current. The technique was originally developed as a separation technique for chemical engineering, but has since been coupled to capillary electrophoresis and liquid chromatography–mass spectrometry as a means of improving limits of detection, analysis time, and selectivity. The use of EE-CE has made capillary electrophoresis more applicable to use in the pharmaceutical industry. Nomenclature The term electroextraction is used to describe multiple processes. In this article, electroextraction describes the extraction of charged particles through a liquid phase barrier. The term can be used to describe electrowinning, which is the extraction of metals from their compounds via electrochemical processes. Electroextraction also describes a process of permeating bioproducts from a cell membrane using an electric field. Use in Chemical Engineering Johann Stichlmair developed electroextraction at the University of Essen in Germany in 1987 as an improvement on liquid-liquid extraction in an electric field. Electric fields are applied to enhance the demixing of a sample in a two-phase system. However, as current flows through the system, the resulting convective mixing disrupts separation. Electroextraction corrects for this. Two or three liquid phases that are electrically conductive and immiscible with one another are kept between electrodes, and upon addition of an electric field, charged particles travel from one phase to another separating anions and cations. A two-phase system brings anions into one phase and cations into the other. A three phase system extracts anions and cations into the two outer phases while leaving uncharged particles in the middle phase. Convective mixing is restricted to each phase and does not travel between phases. A diagram is given in figure 1. Organic phases that are used typically have small amounts of water added in order to be conductive. Other possible phases include mixtures of water and highly polymerized substances, or water with non-ionic surfactants. Electroextraction has also influenced the development of similar electrophoretic separation techniques involving a membrane between the two-phase systems. Applications Electroextraction has been successfully employed in the separation of dyestuffs from wastewater. Electroextraction is better suited over other techniques for its ability to extract small amounts of dye from very dilute solutions. EE has also been effectively used in the separation of amino acids. This separation was done using an aqueous two-phase system of dextran-polyethylene glycol-water to stabilize the amino acids. The velocity of a particle crossing the phase barrier is directly proportional to the strength of the applied electric field, so 100% separation is achieved with a strong enough field. Use in Analytical Chemistry A diagram of an electroextraction apparatus is shown in figure 2. The apparatus consists of a vial with a conical bottom, a grounded platinum electrode, a capillary to inject the aqueous solution, and an adjustable gold anode with a circular bottom that contacts the entire organic phase. EE is also often performed in a capillary electrophoresis capillary. This is referred to as capillary electroextraction, or cEE. In this set up, shown in figure 3, a capillary containing aqueous phase is placed in a vial of organic phase and surrounded by a hallow cathode. The outlet of the capillary is then grounded. When EE is coupled to isotachophoresis coupled to capillary electrophoresis, limits of detection decrease to the nanomolar range and isotachophoresis takes only a few minutes to complete. Similar limits of detections are obtained when EE is coupled to liquid chromatography-mass spectrometry. Similar limits of detections are obtained when EE is coupled to liquid chromatography-mass spectrometry. Applications EE is ideal for pharmaceuticals with low concentrations of active ingredient, such as those containing proteins and peptides, because of its ability to lower limits of detection for liquid chromatography and capillary electrophoresis. In addition, sample enrichment by EE helps overcome the low injection volumes and short optical path length of UV-Vis detectors that accompany CE. EE coupled to CE has been used to separate and analyze antisense oligonucleotides. Antisense oligonucleotides inhibit protein expression from their complementary base pair sequence and can treat certain diseases and genetic disorders. EE coupled to liquid chromatography also successfully detects low concentration metabolites in urine for the purpose of studying metabolic processes. In addition, EE-ITP-CE has been used in the determination of the drugs clenbuterol, salbutamol, terbutaline, and fenoterol. References Liquid-liquid separation
Florida's 27th Senate District elects one member of the Florida Senate. The district comprises portions of Lee County. Its current Senator is Republican Ray Rodrigues. Senators W. J. Turner, 1865-1866 F. B. Hogan, 1879 A. A. Robinson, 1881 M. G. Fortner, 1883 J. W. Whiddon, 1885-1887, 1893-1895, 1901–1903 Ziba King, 1889-1891 W. H. Fuller, 1897-1899 Joseph H. Humphries, 1905-1912 Frank M. Cooper, 1913-1915, 1921 A. M. Wilson, 1917 A. W. Wilson, 1918-1919 E. J. Etheredge, 1923-1927 W. D. Bell, 1929-1931 H. G. Murphy, 1933-1939 William Cliett, 1941-1943 Wilbur C. King, 1945 Jeff Flake, 1947 (Not represented, 1948 ex) James W. Moore, 1949-1951 Doyle E. Carlton Jr., 1953-1959, 1965 G. W. (Dick) Williams, 1961-1963 Ben Hill Griffin Jr., 1967 (D) Alan Trask, 1969-1971 (D) Philip D. Lewis, 1973-1981 (D) Tom Lewis, 1982 (R) William G. "Doc" Myers, 1983-2000 (R) Ken Pruitt, 2001-2002 (R) Dave Aronberg, 2003-2010 (D) Lizbeth Benacquisto, 2011-2012 (R) Jeff Clemens, 2013-2016 (D) Lizbeth Benacquisto, 2017-2020 (R) Ray Rodrigues, 2020–present (R) References Lee County, Florida Florida Senate districts
St Nicholas Church is the parish church of the village of Kennett in east Cambridgeshire. It has been dedicated to St Nicholas since the 13th century. The building consists of a chancel and an aisled nave with north porch and west tower. The oldest parts of the building are the nave and north porch which were built in the 12th century, with the chancel dating from the 13th century. Its impressive 15th-century tower dominates the local landscape and contains three bells, including one from the 13th century. References Kennett
The Great Officers of the Realm () were the five leading members of the Swedish Privy Council from the later parts of the 16th century to around 1680. With the constitution of 1634, the five officers became heads of five different branches of government (Swedish: kollegium). The same constitution also declared that the great officers were to act as regents during the minorities of kings or regnal queens. All great officers of the realm were abolished by king Charles XI of Sweden. The Lord High Steward and the Lord High Chancellor offices were revived in the late 18th century, but were soon removed again. The five great officers The great officers were, in order of a ranking which was established in 1634, the following: Lord High Steward (or Lord High Justiciar) (Swedish: riksdrots) Lord High Constable (Swedish: riksmarsk) Lord High Admiral (Swedish: riksamiral) Lord High Chancellor (Swedish: rikskansler) Lord High Treasurer (Swedish: riksskattmästare) Lord High Steward The title meant no particular assignment until 1614, when Lord High Steward Magnus Brahe was put in charge of the newly established Svea Court of Appeal, the highest court of Sweden at the time. The steward became responsible of supervising justice in Sweden. Lord High Constable The title meant no particular assignment until 1630, when Lord High Constable Jacob De la Gardie became president of the Council of War (Swedish: first Krigsrätten, later Krigsrådet and, from 1634, the War College). As such he was chief of the army. Lord High Admiral The Lord High Admiral was head of the Admiralty of Sweden (Swedish: Amiralitetskollegium from 1634) and the Swedish navy. Lord High Chancellor The Lord High Chancellor was assigned to ensure that the orders of the king and government were followed. Along the way, the assignments of the chancellor increased to the amount that a chancellery, the Privy Council Chancellery, had to be established. The chancellery became one of the governmental branches and the chancellor acted as head of it. Albeit fourth in rank among the great officers, the Lord High Chancellor became the most important figure in the Privy Council. The chancellor was head of the relations with foreign powers. Lord High Treasurer The Lord High Treasurer had the responsibility to supervise issues concerning the economy of the state. The office holder was head of the Chambers, which in 1634 was declared one of five departments of the government under the name Kammarkollegiet. Lesser Officers of the Realm Below the great officers in rank, were a number of Lesser Officers of the Realm (Swedish: de lägre riksämbetsmännen). These were Marshal of the Realm (riksmarskalk), Equerry of the Realm (riksstallmästare), Forester of the Realm (riksjägmästaren), Quartermaster General (generalkvartermästare) and Master of Ordnance of the Realm (rikstygmästare). In the late 17th century, king Charles XI removed not only the great officers but the smaller officers as well. The Marshal of the Realm and the Equerry of the Realm offices were both revived by king Gustav III in the late 18th century. Among both the greater and smaller officers, the only title to exist in present-day Sweden, is the Marshal of the Realm. See also History of Sweden List of Swedish monarchs Privy Council of Sweden References External links Sweden Sweden Political history of Sweden de:Reichsrat (Schweden) fi:Valtaneuvosto
Erycina is a genus of flowering plants from the orchid family, Orchidaceae. Its species are native to Mexico, Central America, South America and Trinidad. Erycina crista-galli (Rchb.f.) N.H.Williams & M.W.Chase Erycina echinata (Kunth) Lindl. Erycina glossomystax (Rchb.f.) N.H.Williams & M.W.Chase Erycina hyalinobulbon (Lex.) N.H.Williams & M.W.Chase Erycina pumilio (Rchb.f.) N.H.Williams & M.W.Chase Erycina pusilla (L.) N.H.Williams & M.W.Chase Erycina zamorensis (Dodson) N.H.Williams & M.W.Chase See also List of Orchidaceae genera References Pridgeon, A.M., Cribb, P.J., Chase, M.A. & Rasmussen, F. eds. (1999). Genera Orchidacearum Vols 1–3. Oxford Univ. Press. Berg Pana, H. 2005. Handbuch der Orchideen-Namen. Dictionary of Orchid Names. Dizionario dei nomi delle orchidee. Ulmer, Stuttgart. External links Oncidiinae genera Oncidiinae
Nesozineus armatus is a species of beetle in the family Cerambycidae. It was described by Galileo and Martins in 1996. References Acanthoderini Beetles described in 1996
Cryptostegia madagascariensis is a species of flowering plant in the family Apocynaceae. It is commonly known as purple rubber vine, is a woody-perennial vine that is native to western and northern Madagascar. It has also been introduced to several tropical and subtropical regions by man, including Puerto Rico and the Virgin Islands. It is very similar to the rubber vine (C. grandiflora), which is also native to Madagascar. In their area of overlap some hybrids have been observed, which are distinguishable by intermediate flower morphology. In the 1930s a hybrid was also developed for horticultural purposes. References Periplocoideae Endemic flora of Madagascar Taxa named by Wenceslas Bojer Taxa named by Joseph Decaisne Flora of the Madagascar dry deciduous forests Flora of the Madagascar succulent woodlands
```rust use super::; #[test] fn pointy_brace() { html_opts!( [render.unsafe_], concat!( "URI autolink: <path_to_url", "\n", "Email autolink: <bill@microsoft.com>\n", "\n", " Inline <em>tag</em> ha.\n", "* Inline <!-- comment --> ha.\n", "* Inline <? processing instruction ?> ha.\n", "* Inline <!DECLARATION OKAY> ha.\n", "* Inline <![CDATA[ok]ha ha ]]> ha.\n" ), concat!( "<p>URI autolink: <a \ href=\"path_to_url">path_to_url", "<p>Email autolink: <a \ href=\"mailto:bill@microsoft.com\">bill@microsoft.com</a></p>\n", "<ul>\n", "<li>Inline <em>tag</em> <strong>ha</strong>.</li>\n", "<li>Inline <!-- comment --> <strong>ha</strong>.</li>\n", "<li>Inline <? processing instruction ?> <strong>ha</strong>.</li>\n", "<li>Inline <!DECLARATION OKAY> <strong>ha</strong>.</li>\n", "<li>Inline <![CDATA[ok]ha ha ]]> <strong>ha</strong>.</li>\n", "</ul>\n" ), ); } #[test] fn no_control_characters_in_reference_links() { html( "[A]:\u{1b}\n\nX [A] Y\n", "<p>[A]:\u{1b}</p>\n<p>X [A] Y</p>\n", ) } #[test] fn link_entity_regression() { html( "[link](&#x6A&#x61&#x76&#x61&#x73&#x63&#x72&#x69&#x70&#x74&#x3A&#x61&#x6C&#x65&#x72&#x74&#x28&#x27&#x58&#x53&#x53&#x27&#x29)", "<p><a href=\"&#x6A&#x61&#x76&#x61&#x73&#x63&#x72&#x69&#x70&#x74&#x3A&#x61&#x6C&#x65&#x72&#x74&#x28&#x27&#x58&#x53&#x53&#x27&#x29\">link</a></p>\n", ); } #[test] fn regression_back_to_back_ranges() { html( "bold*bold+italic", "<p><strong>bold</strong><em><strong>bold+italic</strong></em></p>\n", ); } #[test] fn no_panic_on_empty_bookended_atx_headers() { html("# #", "<h1></h1>\n"); } #[test] fn no_stack_smash_html() { let s: String = ">".repeat(150_000); let arena = Arena::new(); let root = parse_document(&arena, &s, &Options::default()); let mut output = vec![]; html::format_document(root, &Options::default(), &mut output).unwrap() } #[test] fn no_stack_smash_cm() { let s: String = ">".repeat(150_000); let arena = Arena::new(); let root = parse_document(&arena, &s, &Options::default()); let mut output = vec![]; cm::format_document(root, &Options::default(), &mut output).unwrap() } #[test] fn cm_autolink_regression() { // Testing that the cm renderer handles this case without crashing html("<a+c:dd>", "<p><a href=\"a+c:dd\">a+c:dd</a></p>\n"); } #[test] fn regression_424() { html( "text* [link](#section)", "<p><em>text</em> <a href=\"#section\">link</a></p>\n", ); } #[test] fn example_61() { html( r##" `Foo ---- ` <a title="a lot --- of dashes"/> "##, r##"<h2>`Foo</h2> <p>`</p> <h2><a title="a lot</h2> <p>of dashes"/></p> "##, ); } #[test] fn nul_at_eof() { html("foo\0", "<p>foo\u{fffd}</p>\n"); html("foo\0ba", "<p>foo\u{fffd}ba</p>\n"); html("foo\0ba\0", "<p>foo\u{fffd}ba\u{fffd}</p>\n"); } #[test] fn sourcepos_para() { html_opts!( [render.sourcepos], "abc\ndef\n\nghi\n", "<p data-sourcepos=\"1:1-2:3\">abc\ndef</p>\n<p data-sourcepos=\"4:1-4:3\">ghi</p>\n", ); } #[test] #[cfg(feature = "shortcodes")] fn gemoji() { html_opts!([extension.shortcodes], ":x:", "<p></p>\n"); } ```
The American Academy of Osteopathy (AAO) is a non-profit organization for osteopathic medical education. Members include osteopathic physicians and medical students, supporters and affiliates, sponsors, and international members. The mission of the AAO is to teach, advocate, and research the science, art, and philosophy of osteopathic medicine, emphasizing the integration of osteopathic principles, practice, and manipulative treatment in patient care. Mission The AAO's mission is to assist osteopathic medical professionals to: 1. Acquire a better understanding of osteopathic principles, theories, and practice to include: a. helping students attain a maximum proficiency in osteopathic structural diagnosis and treatment b. fostering a clear concept of clinical application of osteopathy in health and disease 2. Improve public awareness of osteopathic medicine so that the community may better take advantage of the benefits provided by the complete health care concept of osteopathic medicine. Membership in the American Academy of Osteopathy AAO members consist of osteopathic physicians, including but not limited to those specializing in osteopathic manipulative treatment; osteopathic medical students; residents; associates who graduated from accredited medical or dental schools; international affiliates, or osteopaths trained outside the U.S.; and supporters. Fellow of the American Academy of Osteopathy The Fellow of the American Academy of Osteopathy is an earned post-graduate degree awarded to eligible physicians demonstrating a commitment to osteopathic principles and practice. Requirements include AAO membership, American Osteopathic Association board certification, an interview, publications, etc. The AAO Journal Printed quarterly, The AAO Journal is the official peer-reviewed publication of the American Academy of Osteopathy. Members of the AAO receive a complimentary subscription to the AAOJ. Subscriptions for non-members are available for a fee. Authors should review the AAOJ Instructions for Contributors before submitting their manuscripts. See also American Osteopathic Association American Osteopathic Board of Neuromusculoskeletal Medicine References External links Official Website of the American Academy of Osteopathy Osteopathic medical associations in the United States Medical and health organizations based in Indiana
The Curtiss Model L was a triplane trainer aircraft in the United States in 1916 by the Curtiss Aeroplane Company of Hammondsport, New York. Development It was a largely conventional design with the upper two wings of equal span and a shorter-span lower wing, the Model L had a wide, open cockpit that accommodated the student and instructor side by side, an unusual feature for its time which gained the aircraft the nickname "Sociable Triplane". Apart from private sales, Curtiss sold a number to both the United States Army and Navy. These differed from their civil counterparts in having lower wings of equal span to the upper two. The three sold to the Navy were equipped as floatplanes. The wings from one of the Army's examples were mated to the fuselage of a Curtiss Jenny to produce the single example of the X-1 trainer. Model L wings were also used by Curtiss for the creation of the Autoplane roadable aircraft, as well as being mated to a Model F hull to create the Curtiss FL. Variants Model L - civil trainer version Model L-1 - military version Model L-2 - military version, some equipped with floats Operators United States Army United States Navy Specifications References aerofiles.com 1910s United States civil trainer aircraft Model L Triplanes Single-engined tractor aircraft Aircraft first flown in 1916
```java /* * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * published by the Free Software Foundation. Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. / package jdk.graal.compiler.core.aarch64; import org.graalvm.collections.EconomicMap; import org.graalvm.collections.Equivalence; import jdk.graal.compiler.asm.aarch64.AArch64Assembler; import jdk.graal.compiler.asm.aarch64.AArch64Assembler.ExtendType; import jdk.graal.compiler.asm.aarch64.AArch64MacroAssembler; import jdk.graal.compiler.core.common.LIRKind; import jdk.graal.compiler.core.common.NumUtil; import jdk.graal.compiler.core.common.calc.CanonicalCondition; import jdk.graal.compiler.core.common.calc.FloatConvert; import jdk.graal.compiler.core.gen.NodeMatchRules; import jdk.graal.compiler.core.match.ComplexMatchResult; import jdk.graal.compiler.core.match.MatchRule; import jdk.graal.compiler.core.match.MatchableNode; import jdk.graal.compiler.debug.Assertions; import jdk.graal.compiler.debug.GraalError; import jdk.graal.compiler.lir.LIRFrameState; import jdk.graal.compiler.lir.LabelRef; import jdk.graal.compiler.lir.Variable; import jdk.graal.compiler.lir.aarch64.AArch64ArithmeticOp; import jdk.graal.compiler.lir.aarch64.AArch64BitFieldOp; import jdk.graal.compiler.lir.aarch64.AArch64BitFieldOp.BitFieldOpCode; import jdk.graal.compiler.lir.aarch64.AArch64ControlFlow; import jdk.graal.compiler.lir.gen.LIRGeneratorTool; import jdk.graal.compiler.nodes.ConstantNode; import jdk.graal.compiler.nodes.DeoptimizingNode; import jdk.graal.compiler.nodes.FixedNode; import jdk.graal.compiler.nodes.IfNode; import jdk.graal.compiler.nodes.NodeView; import jdk.graal.compiler.nodes.ValueNode; import jdk.graal.compiler.nodes.calc.AddNode; import jdk.graal.compiler.nodes.calc.AndNode; import jdk.graal.compiler.nodes.calc.BinaryNode; import jdk.graal.compiler.nodes.calc.FloatConvertNode; import jdk.graal.compiler.nodes.calc.IntegerConvertNode; import jdk.graal.compiler.nodes.calc.IntegerLessThanNode; import jdk.graal.compiler.nodes.calc.LeftShiftNode; import jdk.graal.compiler.nodes.calc.MulNode; import jdk.graal.compiler.nodes.calc.NotNode; import jdk.graal.compiler.nodes.calc.OrNode; import jdk.graal.compiler.nodes.calc.RightShiftNode; import jdk.graal.compiler.nodes.calc.ShiftNode; import jdk.graal.compiler.nodes.calc.SignExtendNode; import jdk.graal.compiler.nodes.calc.SubNode; import jdk.graal.compiler.nodes.calc.UnaryNode; import jdk.graal.compiler.nodes.calc.UnsignedRightShiftNode; import jdk.graal.compiler.nodes.calc.XorNode; import jdk.graal.compiler.nodes.calc.ZeroExtendNode; import jdk.graal.compiler.nodes.memory.MemoryAccess; import jdk.vm.ci.aarch64.AArch64; import jdk.vm.ci.aarch64.AArch64Kind; import jdk.vm.ci.code.CodeUtil; import jdk.vm.ci.meta.AllocatableValue; import jdk.vm.ci.meta.JavaConstant; import jdk.vm.ci.meta.JavaKind; import jdk.vm.ci.meta.Value; @MatchableNode(nodeClass = AArch64PointerAddNode.class, inputs = {"base", "offset"}) public class AArch64NodeMatchRules extends NodeMatchRules { private static final EconomicMap<Class<? extends BinaryNode>, AArch64ArithmeticOp> binaryOpMap; private static final EconomicMap<Class<? extends BinaryNode>, AArch64BitFieldOp.BitFieldOpCode> bitFieldOpMap; private static final EconomicMap<Class<? extends BinaryNode>, AArch64MacroAssembler.ShiftType> shiftTypeMap; private static final EconomicMap<Class<? extends BinaryNode>, AArch64ArithmeticOp> logicalNotOpMap; static { binaryOpMap = EconomicMap.create(Equivalence.IDENTITY, 9); binaryOpMap.put(AddNode.class, AArch64ArithmeticOp.ADD); binaryOpMap.put(SubNode.class, AArch64ArithmeticOp.SUB); binaryOpMap.put(MulNode.class, AArch64ArithmeticOp.MUL); binaryOpMap.put(AndNode.class, AArch64ArithmeticOp.AND); binaryOpMap.put(OrNode.class, AArch64ArithmeticOp.OR); binaryOpMap.put(XorNode.class, AArch64ArithmeticOp.XOR); binaryOpMap.put(LeftShiftNode.class, AArch64ArithmeticOp.LSL); binaryOpMap.put(RightShiftNode.class, AArch64ArithmeticOp.ASR); binaryOpMap.put(UnsignedRightShiftNode.class, AArch64ArithmeticOp.LSR); bitFieldOpMap = EconomicMap.create(Equivalence.IDENTITY, 2); bitFieldOpMap.put(UnsignedRightShiftNode.class, BitFieldOpCode.UBFX); bitFieldOpMap.put(LeftShiftNode.class, BitFieldOpCode.UBFIZ); logicalNotOpMap = EconomicMap.create(Equivalence.IDENTITY, 3); logicalNotOpMap.put(AndNode.class, AArch64ArithmeticOp.BIC); logicalNotOpMap.put(OrNode.class, AArch64ArithmeticOp.ORN); logicalNotOpMap.put(XorNode.class, AArch64ArithmeticOp.EON); shiftTypeMap = EconomicMap.create(Equivalence.IDENTITY, 3); shiftTypeMap.put(LeftShiftNode.class, AArch64MacroAssembler.ShiftType.LSL); shiftTypeMap.put(RightShiftNode.class, AArch64MacroAssembler.ShiftType.ASR); shiftTypeMap.put(UnsignedRightShiftNode.class, AArch64MacroAssembler.ShiftType.LSR); } public AArch64NodeMatchRules(LIRGeneratorTool gen) { super(gen); } /* * Checks whether all arguments are numeric integers. / protected boolean isNumericInteger(ValueNode... values) { for (ValueNode value : values) { if (!value.getStackKind().isNumericInteger()) { return false; } } return true; } /* * Checks whether all arguments are numeric floats. / protected boolean isNumericFloat(ValueNode... values) { for (ValueNode value : values) { if (!value.getStackKind().isNumericFloat()) { return false; } } return true; } protected LIRFrameState getState(MemoryAccess access) { if (access instanceof DeoptimizingNode) { return state((DeoptimizingNode) access); } return null; } protected AArch64Kind getMemoryKind(MemoryAccess access) { return (AArch64Kind) gen.getLIRKind(((ValueNode) access).stamp(NodeView.DEFAULT)).getPlatformKind(); } private static boolean isSupportedExtendedAddSubShift(IntegerConvertNode<?> node, int clampedShiftAmt) { assert NumUtil.assertNonNegativeInt(clampedShiftAmt); if (clampedShiftAmt <= 4) { switch (node.getInputBits()) { case Byte.SIZE: case Short.SIZE: case Integer.SIZE: case Long.SIZE: return true; } } return false; } private static ExtendType getZeroExtendType(int fromBits) { switch (fromBits) { case Byte.SIZE: return ExtendType.UXTB; case Short.SIZE: return ExtendType.UXTH; case Integer.SIZE: return ExtendType.UXTW; case Long.SIZE: return ExtendType.UXTX; default: GraalError.shouldNotReachHere("extended from " + fromBits + "bits is not supported!"); // ExcludeFromJacocoGeneratedReport return null; } } private static ExtendType getSignExtendType(int fromBits) { switch (fromBits) { case Byte.SIZE: return ExtendType.SXTB; case Short.SIZE: return ExtendType.SXTH; case Integer.SIZE: return ExtendType.SXTW; case Long.SIZE: return ExtendType.SXTX; default: GraalError.shouldNotReachHere("extended from " + fromBits + "bits is not supported!"); // ExcludeFromJacocoGeneratedReport return null; } } private AllocatableValue moveSp(AllocatableValue value) { return getLIRGeneratorTool().moveSp(value); } /* * Clamp shift amounts into range 0 <= shiftamt < size according to JLS. / private static int getClampedShiftAmt(ShiftNode<?> op) { int clampMask = op.getShiftAmountMask(); assert clampMask == 63 \|\| clampMask == 31 : clampMask; return op.getY().asJavaConstant().asInt() & clampMask; } protected ComplexMatchResult emitBinaryShift(AArch64ArithmeticOp op, ValueNode value, ShiftNode<?> shift) { AArch64MacroAssembler.ShiftType shiftType = shiftTypeMap.get(shift.getClass()); assert shiftType != null; assert isNumericInteger(value, shift.getX()); return builder -> { Value a = operand(value); Value b = operand(shift.getX()); Variable result = gen.newVariable(LIRKind.combine(a, b)); AllocatableValue x = moveSp(gen.asAllocatable(a)); AllocatableValue y = moveSp(gen.asAllocatable(b)); int shiftAmount = getClampedShiftAmt(shift); gen.append(new AArch64ArithmeticOp.BinaryShiftOp(op, result, x, y, shiftType, shiftAmount)); return result; }; } private ComplexMatchResult emitBitTestAndBranch(FixedNode trueSuccessor, FixedNode falseSuccessor, ValueNode value, double trueProbability, int nbits) { return builder -> { LabelRef trueDestination = getLIRBlock(trueSuccessor); LabelRef falseDestination = getLIRBlock(falseSuccessor); AllocatableValue src = moveSp(gen.asAllocatable(operand(value))); gen.append(new AArch64ControlFlow.BitTestAndBranchOp(trueDestination, falseDestination, src, trueProbability, nbits)); return null; }; } /* * Helper used by emitBitFieldInsert and emitBitFieldExtract. / private ComplexMatchResult emitBitFieldHelper(JavaKind kind, AArch64BitFieldOp.BitFieldOpCode op, ValueNode value, int lsb, int width) { assert isNumericInteger(value); assert lsb + width <= kind.getBitCount() : lsb + " " + kind; return builder -> { Value a = operand(value); LIRKind resultKind = LIRKind.fromJavaKind(gen.target().arch, kind); Variable result = gen.newVariable(resultKind); AllocatableValue src = moveSp(gen.asAllocatable(a)); gen.append(new AArch64BitFieldOp(op, result, src, lsb, width)); return result; }; } /* * Copy (width) bits from the least significant bits of the source register to bit position lsb * of the destination register. * * @param kind expected final size of the bitfield operation * @param op The type of bitfield operation * @param value The value to extract bits from * @param lsb (least significant bit) the starting index of where the value is moved to * @param width The number of bits to extract from value. / private ComplexMatchResult emitBitFieldInsert(JavaKind kind, AArch64BitFieldOp.BitFieldOpCode op, ValueNode value, int lsb, int width) { assert op == BitFieldOpCode.SBFIZ \|\| op == BitFieldOpCode.UBFIZ : op; return emitBitFieldHelper(kind, op, value, lsb, width); } /* * Copy (width) bits from the lsb bit position of the source register to the bottom of the * destination register. * * @param kind expected final size of the bitfield operation * @param op The type of bitfield operation * @param value The value to extract bits from * @param lsb (least significant bit) the starting index of where the value copied from * @param width The number of bits to extract from value. / private ComplexMatchResult emitBitFieldExtract(JavaKind kind, AArch64BitFieldOp.BitFieldOpCode op, ValueNode value, int lsb, int width) { assert op == BitFieldOpCode.SBFX \|\| op == BitFieldOpCode.UBFX : op; return emitBitFieldHelper(kind, op, value, lsb, width); } private ComplexMatchResult emitExtendedAddSubShift(BinaryNode op, ValueNode x, ValueNode y, ExtendType extType, int shiftAmt) { assert op instanceof AddNode \|\| op instanceof SubNode : op; return builder -> { AllocatableValue src1 = gen.asAllocatable(operand(x)); AllocatableValue src2 = moveSp(gen.asAllocatable(operand(y))); Variable result = gen.newVariable(LIRKind.combine(operand(x), operand(y))); AArch64ArithmeticOp arithmeticOp = op instanceof AddNode ? AArch64ArithmeticOp.ADD : AArch64ArithmeticOp.SUB; gen.append(new AArch64ArithmeticOp.ExtendedAddSubShiftOp(arithmeticOp, result, src1, src2, extType, shiftAmt)); return result; }; } /* * Goal: Use AArch64's add/sub (extended register) instructions to fold away extend and shift of * left operand. / @MatchRule("(Add=op x (LeftShift=lshift (SignExtend=ext y) Constant))") @MatchRule("(Sub=op x (LeftShift=lshift (SignExtend=ext y) Constant))") @MatchRule("(Add=op x (LeftShift=lshift (ZeroExtend=ext y) Constant))") @MatchRule("(Sub=op x (LeftShift=lshift (ZeroExtend=ext y) Constant))") public ComplexMatchResult mergeSignExtendByShiftIntoAddSub(BinaryNode op, LeftShiftNode lshift, ValueNode ext, ValueNode x, ValueNode y) { assert isNumericInteger(lshift); int shiftAmt = getClampedShiftAmt(lshift); if (!isSupportedExtendedAddSubShift((IntegerConvertNode<?>) ext, shiftAmt)) { return null; } ExtendType extType; if (ext instanceof SignExtendNode) { extType = getSignExtendType(((SignExtendNode) ext).getInputBits()); } else { extType = getZeroExtendType(((ZeroExtendNode) ext).getInputBits()); } return emitExtendedAddSubShift(op, x, y, extType, shiftAmt); } /* * Goal: Use AArch64's add/sub (extended register) instructions to fold away the and operation * (into a zero extend) and shift of left operand. / @MatchRule("(Add=op x (LeftShift=lshift (And y Constant=constant) Constant))") @MatchRule("(Sub=op x (LeftShift=lshift (And y Constant=constant) Constant))") public ComplexMatchResult mergeShiftDowncastIntoAddSub(BinaryNode op, LeftShiftNode lshift, ConstantNode constant, ValueNode x, ValueNode y) { assert isNumericInteger(lshift, constant); int shiftAmt = getClampedShiftAmt(lshift); if (shiftAmt > 4) { return null; } long mask = constant.asJavaConstant().asLong() & CodeUtil.mask(op.getStackKind().getBitCount()); if (mask != 0xFFL && mask != 0xFFFFL && mask != 0xFFFFFFFFL) { return null; } int numBits = 64 - Long.numberOfLeadingZeros(mask); return emitExtendedAddSubShift(op, x, y, getZeroExtendType(numBits), shiftAmt); } /* * Goal: Switch ((x << amt) >> amt) into a sign extend and fold into AArch64 add/sub * (extended register) instruction. / @MatchRule("(Add=op x (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst))") @MatchRule("(Sub=op x (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst))") public ComplexMatchResult mergePairShiftIntoAddSub(BinaryNode op, RightShiftNode signExt, ValueNode x, ValueNode y) { int signExtendAmt = getClampedShiftAmt(signExt); int opSize = op.getStackKind().getBitCount(); assert opSize == 32 \|\| opSize == 64 : opSize; int remainingBits = opSize - signExtendAmt; if (remainingBits != 8 && remainingBits != 16 && remainingBits != 32) { return null; } return emitExtendedAddSubShift(op, x, y, getSignExtendType(remainingBits), 0); } /* * Goal: Fold ((x << amt) >> amt) << [0,4] into AArch64 add/sub (extended register) * instruction with a sign extend and a shift. / @MatchRule("(Add=op x (LeftShift=outerShift (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst) Constant))") @MatchRule("(Sub=op x (LeftShift=outerShift (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst) Constant))") public ComplexMatchResult mergeShiftedPairShiftIntoAddSub(BinaryNode op, LeftShiftNode outerShift, RightShiftNode signExt, ValueNode x, ValueNode y) { int shiftAmt = getClampedShiftAmt(outerShift); if (shiftAmt > 4) { return null; } int signExtendAmt = getClampedShiftAmt(signExt); int opSize = op.getStackKind().getBitCount(); assert opSize == 32 \|\| opSize == 64 : opSize; int remainingBits = opSize - signExtendAmt; if (remainingBits != 8 && remainingBits != 16 && remainingBits != 32) { return null; } return emitExtendedAddSubShift(op, x, y, getSignExtendType(remainingBits), shiftAmt); } /* * Goal: Fold zero extend and (optional) shift into AArch64 add/sub (extended register) * instruction. / @MatchRule("(AArch64PointerAdd=addP base ZeroExtend)") @MatchRule("(AArch64PointerAdd=addP base (LeftShift ZeroExtend Constant))") public ComplexMatchResult extendedPointerAddShift(AArch64PointerAddNode addP) { ValueNode offset = addP.getOffset(); ZeroExtendNode zeroExtend; int shiftAmt; if (offset instanceof ZeroExtendNode) { zeroExtend = (ZeroExtendNode) offset; shiftAmt = 0; } else { LeftShiftNode shift = (LeftShiftNode) offset; zeroExtend = (ZeroExtendNode) shift.getX(); shiftAmt = getClampedShiftAmt(shift); } if (!isSupportedExtendedAddSubShift(zeroExtend, shiftAmt)) { return null; } int fromBits = zeroExtend.getInputBits(); int toBits = zeroExtend.getResultBits(); if (toBits != 64) { return null; } assert fromBits <= toBits : fromBits + " " + toBits; ExtendType extendType = getZeroExtendType(fromBits); ValueNode base = addP.getBase(); return builder -> { AllocatableValue x = gen.asAllocatable(operand(base)); AllocatableValue y = moveSp(gen.asAllocatable(operand(zeroExtend.getValue()))); AllocatableValue baseReference = LIRKind.derivedBaseFromValue(x); LIRKind kind = LIRKind.combineDerived(gen.getLIRKind(addP.stamp(NodeView.DEFAULT)), baseReference, null); Variable result = gen.newVariable(kind); gen.append(new AArch64ArithmeticOp.ExtendedAddSubShiftOp(AArch64ArithmeticOp.ADD, result, x, y, extendType, shiftAmt)); return result; }; } /* * This method determines, if possible, how to use AArch64's bit unsigned field insert/extract * (UBFIZ/UBFX) instructions to copy over desired bits in the presence of the pattern [(X >>> #) * & MASK] or [(X & MASK) << #] (with some zero extensions maybe sprinkled in). * * The main idea is that the mask and shift will force many bits to be zeroed and this * information can be leveraged to extract the meaningful bits. / private ComplexMatchResult unsignedBitFieldHelper(JavaKind finalOpKind, BinaryNode shift, ValueNode value, ConstantNode maskNode, int andOpSize) { long mask = maskNode.asJavaConstant().asLong() & CodeUtil.mask(andOpSize); if (!CodeUtil.isPowerOf2(mask + 1)) { / MaskNode isn't a mask: initial assumption doesn't hold true / return null; } int maskSize = 64 - Long.numberOfLeadingZeros(mask); int shiftSize = shift.getStackKind().getBitCount(); int shiftAmt = getClampedShiftAmt((ShiftNode<?>) shift); / * The width of the insert/extract will be the bits which are not shifted out and/or not * part of the mask. / int width = Math.min(maskSize, shiftSize - shiftAmt); if (width == finalOpKind.getBitCount()) { assert maskSize == finalOpKind.getBitCount() && shiftAmt == 0 : maskSize + " " + finalOpKind; // original value is unaffected return builder -> operand(value); } else if (shift instanceof UnsignedRightShiftNode) { // this is an extract return emitBitFieldExtract(finalOpKind, BitFieldOpCode.UBFX, value, shiftAmt, width); } else { // is a left shift - means this is an insert return emitBitFieldInsert(finalOpKind, BitFieldOpCode.UBFIZ, value, shiftAmt, width); } } /* * Goal: Use AArch64's bit unsigned field insert/extract (UBFIZ/UBFX) instructions to copy over * desired bits. / @MatchRule("(And (UnsignedRightShift=shift value Constant) Constant=a)") @MatchRule("(LeftShift=shift (And value Constant=a) Constant)") public ComplexMatchResult unsignedBitField(BinaryNode shift, ValueNode value, ConstantNode a) { return unsignedBitFieldHelper(shift.getStackKind(), shift, value, a, shift.getStackKind().getBitCount()); } /* * Goal: Use AArch64's bit unsigned field insert/extract (UBFIZ/UBFX) instructions to copy over * desired bits. / @MatchRule("(LeftShift=shift (ZeroExtend=extend (And value Constant=a)) Constant)") @MatchRule("(ZeroExtend=extend (And (UnsignedRightShift=shift value Constant) Constant=a))") @MatchRule("(ZeroExtend=extend (LeftShift=shift (And value Constant=a) Constant))") public ComplexMatchResult unsignedExtBitField(ZeroExtendNode extend, BinaryNode shift, ValueNode value, ConstantNode a) { return unsignedBitFieldHelper(extend.getStackKind(), shift, value, a, extend.getInputBits()); } /* * Goal: Use AArch64's signed bitfield insert in zeros (sbfiz) instruction to extract desired * bits while folding away sign extend. / @MatchRule("(LeftShift=shift (SignExtend value) Constant)") public ComplexMatchResult signedBitField(LeftShiftNode shift, ValueNode value) { assert isNumericInteger(shift); SignExtendNode extend = (SignExtendNode) shift.getX(); int inputBits = extend.getInputBits(); int resultBits = extend.getResultBits(); JavaKind kind = shift.getStackKind(); assert kind.getBitCount() == resultBits : Assertions.errorMessage(shift, value, kind); int lsb = getClampedShiftAmt(shift); / * Get the min value of the inputBits and post-shift bits (resultBits - lsb) as the bitfield * width. Note if (resultBits-lsb) is smaller than inputBits, the in reality no sign * extension takes place. / int width = Math.min(inputBits, resultBits - lsb); assert width >= 1 && width <= resultBits - lsb : width + " " + resultBits; return emitBitFieldInsert(kind, BitFieldOpCode.SBFIZ, value, lsb, width); } /* * Goal: Use AArch64's bit field insert/extract instructions to copy over desired bits. / @MatchRule("(RightShift=rshift (LeftShift=lshift value Constant) Constant)") @MatchRule("(UnsignedRightShift=rshift (LeftShift=lshift value Constant) Constant)") public ComplexMatchResult bitFieldMove(BinaryNode rshift, LeftShiftNode lshift, ValueNode value) { assert isNumericInteger(rshift); JavaKind opKind = rshift.getStackKind(); int opSize = opKind.getBitCount(); int lshiftAmt = getClampedShiftAmt(lshift); int rshiftAmt = getClampedShiftAmt((ShiftNode<?>) rshift); / * Get the width of the bitField. It will be in the range 1 to 32(64). * * Get the final width of the extract. Because the left and right shift go in opposite * directions, the number of meaningful bits after performing a (x << #) >>(>) # is * dependent on the maximum of the two shifts. / int width = opSize - Math.max(lshiftAmt, rshiftAmt); assert width > 1 \|\| width <= opSize : width + " " + opSize; if (width == opSize) { // this means that no shifting was performed: can directly return value return builder -> operand(value); } / * Use bitfield insert (SBFIZ/UBFIZ) if left shift number is larger than right shift number, * otherwise use bitfield extract (SBFX/UBFX). * * If lshiftAmt > rshiftAmt, this means that the destination value will have some of its * bottom bits cleared, whereas if lshiftAmt <= rshiftAmt, then the destination value will * have bits starting from index 0 copied from the input. / if (lshiftAmt > rshiftAmt) { int lsb = lshiftAmt - rshiftAmt; BitFieldOpCode op = rshift instanceof RightShiftNode ? BitFieldOpCode.SBFIZ : BitFieldOpCode.UBFIZ; return emitBitFieldInsert(opKind, op, value, lsb, width); } else { // is a bit field extract int lsb = rshiftAmt - lshiftAmt; BitFieldOpCode op = rshift instanceof RightShiftNode ? BitFieldOpCode.SBFX : BitFieldOpCode.UBFX; return emitBitFieldExtract(opKind, op, value, lsb, width); } } /* * Goal: Use AArch64's ror instruction for rotations. / @MatchRule("(Or=op (LeftShift=x src Constant) (UnsignedRightShift=y src Constant))") @MatchRule("(Or=op (UnsignedRightShift=x src Constant) (LeftShift=y src Constant))") @MatchRule("(Add=op (LeftShift=x src Constant) (UnsignedRightShift=y src Constant))") @MatchRule("(Add=op (UnsignedRightShift=x src Constant) (LeftShift=y src Constant))") public ComplexMatchResult rotationConstant(ValueNode op, ValueNode x, ValueNode y, ValueNode src) { assert isNumericInteger(src); assert src.getStackKind() == op.getStackKind() && op.getStackKind() == x.getStackKind() : src + " " + op + " " + x; int shiftAmt1 = getClampedShiftAmt((ShiftNode<?>) x); int shiftAmt2 = getClampedShiftAmt((ShiftNode<?>) y); if (shiftAmt1 + shiftAmt2 == 0 && op instanceof OrNode) { assert shiftAmt1 == 0 && shiftAmt2 == 0 : shiftAmt1 + " " + shiftAmt2; / No shift performed: for or operation, this is equivalent to original value / return builder -> operand(src); } else if (src.getStackKind().getBitCount() == shiftAmt1 + shiftAmt2) { / Shifts are equivalent to a rotate. / return builder -> { AllocatableValue a = moveSp(gen.asAllocatable(operand(src))); / Extract the right shift amount / JavaConstant b = JavaConstant.forInt(x instanceof LeftShiftNode ? shiftAmt2 : shiftAmt1); Variable result = gen.newVariable(LIRKind.combine(a)); getArithmeticLIRGenerator().emitBinaryConst(result, AArch64ArithmeticOp.ROR, a, b); return result; }; } return null; } /* * Goal: Use AArch64's ror instruction for rotations. / @MatchRule("(Or (LeftShift=x src shiftAmount) (UnsignedRightShift src (Sub=y Constant shiftAmount)))") @MatchRule("(Or (UnsignedRightShift=x src shiftAmount) (LeftShift src (Sub=y Constant shiftAmount)))") @MatchRule("(Or (LeftShift=x src (Negate shiftAmount)) (UnsignedRightShift src (Add=y Constant shiftAmount)))") @MatchRule("(Or (UnsignedRightShift=x src (Negate shiftAmount)) (LeftShift src (Add=y Constant shiftAmount)))") @MatchRule("(Or (LeftShift=x src shiftAmount) (UnsignedRightShift src (Negate=y shiftAmount)))") @MatchRule("(Or (UnsignedRightShift=x src shiftAmount) (LeftShift src (Negate=y shiftAmount)))") public ComplexMatchResult rotationExpander(ValueNode src, ValueNode shiftAmount, ValueNode x, ValueNode y) { assert isNumericInteger(src); assert shiftAmount.getStackKind().getBitCount() == 32 : Assertions.errorMessage(shiftAmount); if (y instanceof SubNode \|\| y instanceof AddNode) { BinaryNode binary = (BinaryNode) y; ConstantNode delta = (ConstantNode) (binary.getX() != shiftAmount ? binary.getX() : binary.getY()); / * For this pattern to match a right rotate, then the "clamped" delta (i.e. the value of * delta within a shift) must be 0. / int opSize = src.getStackKind().getBitCount(); assert opSize == 32 \|\| opSize == 64 : opSize; long clampedDelta = delta.asJavaConstant().asInt() & (opSize - 1); if (clampedDelta != 0) { return null; } } return builder -> { Value a = operand(src); Value b; if (y instanceof AddNode) { b = x instanceof LeftShiftNode ? operand(shiftAmount) : getArithmeticLIRGenerator().emitNegate(operand(shiftAmount), false); } else { b = x instanceof LeftShiftNode ? getArithmeticLIRGenerator().emitNegate(operand(shiftAmount), false) : operand(shiftAmount); } return getArithmeticLIRGenerator().emitBinary(LIRKind.combine(a, b), AArch64ArithmeticOp.ROR, false, a, b); }; } /* * Goal: Use AArch64 binary shift add/sub ops to fold shift. / @MatchRule("(Add=binary a (LeftShift=shift b Constant))") @MatchRule("(Add=binary a (RightShift=shift b Constant))") @MatchRule("(Add=binary a (UnsignedRightShift=shift b Constant))") @MatchRule("(Sub=binary a (LeftShift=shift b Constant))") @MatchRule("(Sub=binary a (RightShift=shift b Constant))") @MatchRule("(Sub=binary a (UnsignedRightShift=shift b Constant))") public ComplexMatchResult addSubShift(BinaryNode binary, ValueNode a, BinaryNode shift) { AArch64ArithmeticOp op = binaryOpMap.get(binary.getClass()); assert op != null; return emitBinaryShift(op, a, (ShiftNode<?>) shift); } /* * Goal: Use AArch64 binary shift logic ops to fold shift. / @MatchRule("(And=binary a (LeftShift=shift b Constant))") @MatchRule("(And=binary a (RightShift=shift b Constant))") @MatchRule("(And=binary a (UnsignedRightShift=shift b Constant))") @MatchRule("(Or=binary a (LeftShift=shift b Constant))") @MatchRule("(Or=binary a (RightShift=shift b Constant))") @MatchRule("(Or=binary a (UnsignedRightShift=shift b Constant))") @MatchRule("(Xor=binary a (LeftShift=shift b Constant))") @MatchRule("(Xor=binary a (RightShift=shift b Constant))") @MatchRule("(Xor=binary a (UnsignedRightShift=shift b Constant))") @MatchRule("(And=binary a (Not (LeftShift=shift b Constant)))") @MatchRule("(And=binary a (Not (RightShift=shift b Constant)))") @MatchRule("(And=binary a (Not (UnsignedRightShift=shift b Constant)))") @MatchRule("(Or=binary a (Not (LeftShift=shift b Constant)))") @MatchRule("(Or=binary a (Not (RightShift=shift b Constant)))") @MatchRule("(Or=binary a (Not (UnsignedRightShift=shift b Constant)))") @MatchRule("(Xor=binary a (Not (LeftShift=shift b Constant)))") @MatchRule("(Xor=binary a (Not (RightShift=shift b Constant)))") @MatchRule("(Xor=binary a (Not (UnsignedRightShift=shift b Constant)))") public ComplexMatchResult logicShift(BinaryNode binary, ValueNode a, BinaryNode shift) { AArch64ArithmeticOp op; ValueNode operand = binary.getX() == a ? binary.getY() : binary.getX(); if (operand instanceof NotNode) { op = logicalNotOpMap.get(binary.getClass()); } else { op = binaryOpMap.get(binary.getClass()); } assert op != null; return emitBinaryShift(op, a, (ShiftNode<?>) shift); } /* * Goal: fold shift into negate operation using AArch64's sub (shifted register) instruction. / @MatchRule("(Negate (UnsignedRightShift=shift a Constant=b))") @MatchRule("(Negate (RightShift=shift a Constant=b))") @MatchRule("(Negate (LeftShift=shift a Constant=b))") public ComplexMatchResult negShift(BinaryNode shift, ValueNode a, ConstantNode b) { assert isNumericInteger(a, b); int shiftAmt = getClampedShiftAmt((ShiftNode<?>) shift); AArch64Assembler.ShiftType shiftType = shiftTypeMap.get(shift.getClass()); return builder -> { AllocatableValue src = moveSp(gen.asAllocatable(operand(a))); LIRKind kind = LIRKind.combine(operand(a)); Variable result = gen.newVariable(kind); gen.append(new AArch64ArithmeticOp.BinaryShiftOp(AArch64ArithmeticOp.SUB, result, AArch64.zr.asValue(kind), src, shiftType, shiftAmt)); return result; }; } /* * Goal: use AArch64's and not (bic) & or not (orn) instructions. / @MatchRule("(And=logic value1 (Not=not value2))") @MatchRule("(Or=logic value1 (Not=not value2))") public final ComplexMatchResult bitwiseLogicNot(BinaryNode logic, NotNode not) { assert isNumericInteger(logic); AArch64ArithmeticOp op = logicalNotOpMap.get(logic.getClass()); assert op != null; ValueNode src1 = logic.getX() == not ? logic.getY() : logic.getX(); ValueNode src2 = not.getValue(); return builder -> { Value a = operand(src1); Value b = operand(src2); LIRKind resultKind = LIRKind.combine(a, b); return getArithmeticLIRGenerator().emitBinary(resultKind, op, false, a, b); }; } /* * Goal: Use AArch64's bitwise exclusive or not (eon) instruction. * * Note that !(A^B) == (!A)^B == A^(!B). / @MatchRule("(Not (Xor value1 value2))") @MatchRule("(Xor value1 (Not value2))") @MatchRule("(Xor (Not value1) value2)") public ComplexMatchResult bitwiseNotXor(ValueNode value1, ValueNode value2) { return builder -> { Value a = operand(value1); Value b = operand(value2); LIRKind resultKind = LIRKind.combine(a, b); return getArithmeticLIRGenerator().emitBinary(resultKind, AArch64ArithmeticOp.EON, true, a, b); }; } /* * Checks whether this multiply operation which can fold in a sign extend operation . This can * happen if: * * <ul> * <li>The multiply result is of type long</li> * <li>Both inputs are sign extended from 32 bits to 64 bits</li> * </ul> / private static boolean isI2LMultiply(MulNode mul, SignExtendNode x, SignExtendNode y) { if (mul.getStackKind() == JavaKind.Long) { assert x.getResultBits() == Long.SIZE && y.getResultBits() == Long.SIZE : x + " " + y; return x.getInputBits() == Integer.SIZE && y.getInputBits() == Integer.SIZE; } return false; } /* * Goal: use AArch64's (i32,i32) -> i64 multiply instructions to fold away sign extensions. / @MatchRule("(Add=binary (Mul=mul (SignExtend a) (SignExtend b)) c)") @MatchRule("(Sub=binary c (Mul=mul (SignExtend a) (SignExtend b)))") public ComplexMatchResult signedMultiplyAddSubLong(BinaryNode binary, MulNode mul, ValueNode a, ValueNode b, ValueNode c) { assert isNumericInteger(binary, mul, a, b, c); if (isI2LMultiply(mul, (SignExtendNode) mul.getX(), (SignExtendNode) mul.getY())) { if (binary instanceof AddNode) { return builder -> getArithmeticLIRGenerator().emitIntegerMAdd(operand(a), operand(b), operand(c), true); } return builder -> getArithmeticLIRGenerator().emitIntegerMSub(operand(a), operand(b), operand(c), true); } else { return null; } } /* * Goal: use AArch64's (i32,i32) -> i64 multiply instructions to fold away sign extensions. / @MatchRule("(Negate (Mul=mul (SignExtend=ext1 a) (SignExtend=ext2 b)))") @MatchRule("(Mul=mul (Negate (SignExtend=ext1 a)) (SignExtend=ext2 b))") public ComplexMatchResult signedMultiplyNegLong(MulNode mul, SignExtendNode ext1, SignExtendNode ext2, ValueNode a, ValueNode b) { assert isNumericInteger(mul, ext1, ext2, a, b); if (isI2LMultiply(mul, ext1, ext2)) { LIRKind resultKind = LIRKind.fromJavaKind(gen.target().arch, JavaKind.Long); return builder -> getArithmeticLIRGenerator().emitBinary( resultKind, AArch64ArithmeticOp.SMNEGL, true, operand(a), operand(b)); } else { return null; } } /* * Goal: use AArch64's (i32,i32) -> i64 multiply instructions to fold away sign extensions. / @MatchRule("(Mul=mul (SignExtend a) (SignExtend b))") public ComplexMatchResult signedMultiplyLong(MulNode mul, ValueNode a, ValueNode b) { assert isNumericInteger(mul, a, b); if (isI2LMultiply(mul, (SignExtendNode) mul.getX(), (SignExtendNode) mul.getY())) { LIRKind resultKind = LIRKind.fromJavaKind(gen.target().arch, JavaKind.Long); return builder -> getArithmeticLIRGenerator().emitBinary( resultKind, AArch64ArithmeticOp.SMULL, true, operand(a), operand(b)); } else { return null; } } /* * Goal: Use AArch64's add/sub (extended register) instructions to fold in and operand. / @MatchRule("(Add=op x (And y Constant=constant))") @MatchRule("(Sub=op x (And y Constant=constant))") public ComplexMatchResult mergeDowncastIntoAddSub(BinaryNode op, ValueNode x, ValueNode y, ConstantNode constant) { assert isNumericInteger(constant); long mask = constant.asJavaConstant().asLong() & CodeUtil.mask(op.getStackKind().getBitCount()); if (mask != 0xFFL && mask != 0xFFFFL && mask != 0xFFFFFFFFL) { return null; } int numBits = 64 - Long.numberOfLeadingZeros(mask); return emitExtendedAddSubShift(op, x, y, getZeroExtendType(numBits), 0); } /* * Goal: Use AArch64's add/sub (extended register) instruction. / @MatchRule("(Add=op x (SignExtend=ext y))") @MatchRule("(Sub=op x (SignExtend=ext y))") @MatchRule("(Add=op x (ZeroExtend=ext y))") @MatchRule("(Sub=op x (ZeroExtend=ext y))") public ComplexMatchResult mergeSignExtendIntoAddSub(BinaryNode op, UnaryNode ext, ValueNode x, ValueNode y) { if (!isSupportedExtendedAddSubShift((IntegerConvertNode<?>) ext, 0)) { return null; } ExtendType extType; if (ext instanceof SignExtendNode) { extType = getSignExtendType(((SignExtendNode) ext).getInputBits()); } else { extType = getZeroExtendType(((ZeroExtendNode) ext).getInputBits()); } return emitExtendedAddSubShift(op, x, y, extType, 0); } /* * Goal: Use AArch64's multiple-negate (mneg) instruction. / @MatchRule("(Mul (Negate a) b)") @MatchRule("(Negate (Mul a b))") public final ComplexMatchResult multiplyNegate(ValueNode a, ValueNode b) { if (isNumericInteger(a, b)) { return builder -> getArithmeticLIRGenerator().emitMNeg(operand(a), operand(b)); } return null; } /* * Goal: Use AArch64's multiply-add (madd) and multiply-subtract (msub) instructions. / @MatchRule("(Add=binary (Mul a b) c)") @MatchRule("(Sub=binary c (Mul a b))") public final ComplexMatchResult multiplyAddSub(BinaryNode binary, ValueNode a, ValueNode b, ValueNode c) { if (!(isNumericInteger(a, b, c))) { return null; } if (binary instanceof AddNode) { return builder -> getArithmeticLIRGenerator().emitIntegerMAdd(operand(a), operand(b), operand(c), false); } return builder -> getArithmeticLIRGenerator().emitIntegerMSub(operand(a), operand(b), operand(c), false); } /* * Goal: Transform ((x & (1 << n)) == 0) -> (tbz/tbnz n label). / @MatchRule("(If (IntegerTest value Constant=a))") public ComplexMatchResult testBitAndBranch(IfNode root, ValueNode value, ConstantNode a) { if (isNumericInteger(value)) { long constant = a.asJavaConstant().asLong(); if (Long.bitCount(constant) == 1) { return emitBitTestAndBranch(root.trueSuccessor(), root.falseSuccessor(), value, root.getTrueSuccessorProbability(), Long.numberOfTrailingZeros(constant)); } } return null; } /* * Goal: Transform (if x < 0) -> (tbz x, sizeOfBits(x) - 1, label). / @MatchRule("(If (IntegerLessThan=lessNode x Constant=y))") public ComplexMatchResult checkNegativeAndBranch(IfNode root, IntegerLessThanNode lessNode, ValueNode x, ConstantNode y) { assert isNumericInteger(x); if (y.isJavaConstant() && (0 == y.asJavaConstant().asLong()) && lessNode.condition().equals(CanonicalCondition.LT)) { return emitBitTestAndBranch(root.falseSuccessor(), root.trueSuccessor(), x, 1.0 - root.getTrueSuccessorProbability(), x.getStackKind().getBitCount() - 1); } return null; } /* * Goal: Use directly AArch64's single-precision fsqrt op. */ @MatchRule("(FloatConvert=a (Sqrt (FloatConvert=b c)))") public final ComplexMatchResult floatSqrt(FloatConvertNode a, FloatConvertNode b, ValueNode c) { if (isNumericFloat(a, c)) { if (a.getFloatConvert() == FloatConvert.D2F && b.getFloatConvert() == FloatConvert.F2D) { return builder -> getArithmeticLIRGenerator().emitMathSqrt(operand(c)); } } return null; } @MatchRule("(Conditional (IntegerBelow x y) Constant=cm1 (Conditional (IntegerEquals x y) Constant=c0 Constant=c1))") public ComplexMatchResult normalizedIntegerCompare(ValueNode x, ValueNode y, ConstantNode cm1, ConstantNode c0, ConstantNode c1) { if (cm1.getStackKind() == JavaKind.Int && cm1.asJavaConstant().asInt() == -1 && c0.getStackKind() == JavaKind.Int && c0.asJavaConstant().asInt() == 0 && c1.getStackKind() == JavaKind.Int && c1.asJavaConstant().asInt() == 1) { LIRKind compareKind = gen.getLIRKind(x.stamp(NodeView.DEFAULT)); return builder -> getArithmeticLIRGenerator().emitNormalizedUnsignedCompare(compareKind, operand(x), operand(y)); } return null; } @Override public AArch64LIRGenerator getLIRGeneratorTool() { return (AArch64LIRGenerator) gen; } protected AArch64ArithmeticLIRGenerator getArithmeticLIRGenerator() { return (AArch64ArithmeticLIRGenerator) getLIRGeneratorTool().getArithmetic(); } } ```
The 1945 Chicago White Sox season was the White Sox's 45th season in the major leagues, and their 46th season overall. They finished with a record of 71–78, good enough for 6th place in the American League, 15 games behind the 1st place Detroit Tigers. Regular season Season standings Record vs. opponents Opening Day lineup Wally Moses, RF Oris Hockett, CF Johnny Dickshot, LF Bill Nagel, 1B Tony Cuccinello, 3B Roy Schalk, 2B Cass Michaels, SS Mike Tresh, C Thornton Lee, P Roster Player stats Batting Note: G = Games played; AB = At bats; R = Runs scored; H = Hits; 2B = Doubles; 3B = Triples; HR = Home runs; RBI = Runs batted in; BB = Base on balls; SO = Strikeouts; AVG = Batting average; SB = Stolen bases Pitching Note: W = Wins; L = Losses; ERA = Earned run average; G = Games pitched; GS = Games started; SV = Saves; IP = Innings pitched; H = Hits allowed; R = Runs allowed; ER = Earned runs allowed; HR = Home runs allowed; BB = Walks allowed; K = Strikeouts External links 1945 Chicago White Sox at Baseball Reference Chicago White Sox seasons Chicago White Sox season Chicago White
A hyaline substance is one with a glassy appearance. The word is derived from , and . Histopathology Hyaline cartilage is named after its glassy appearance on fresh gross pathology. On light microscopy of H&E stained slides, the extracellular matrix of hyaline cartilage looks homogeneously pink, and the term "hyaline" is used to describe similarly homogeneously pink material besides the cartilage. Hyaline material is usually acellular and proteinaceous. For example, arterial hyaline is seen in aging, high blood pressure, diabetes mellitus and in association with some drugs (e.g. calcineurin inhibitors). It is bright pink with PAS staining. Ichthyology and entomology In ichthyology and entomology, hyaline denotes a colorless, transparent substance, such as unpigmented fins of fishes or clear insect wings. Botany In botany hyaline refers to thin and translucent plant parts, such as the margins of some sepals, bracts and leaves. See also Hyaline arteriolosclerosis Hyaloid canal, which passes through the eye Hyalopilitic Hyaloserositis Infant respiratory distress syndrome, previously known as hyaline membrane disease References Taber's Cyclopedic Medical Dictionary, 19th Edition. Donald Venes ed. 1997 F.A. Davis. Page 1008. Histopathology Fungal morphology and anatomy
```sqlpl -- Script: Get-TempTableColumns.sql -- Author: Scott Sutherland -- Description: Return a list of all temp table types. -- Include table variables, local temp tables, and global temp tables. SELECT 'tempdb' as 'Database_Name', SCHEMA_NAME(t1.schema_id) AS 'Schema_Name', t1.name AS 'Table_Name', t2.name AS 'Column_Name', t3.name AS 'Column_Type', CASE WHEN (SELECT CASE WHEN LEN(t1.name) - LEN(REPLACE(t1.name,'#','')) > 1 THEN 1 ELSE 0 END) = 1 THEN 'GlobalTempTable' WHEN t1.name LIKE '%[_]%' AND (SELECT CASE WHEN LEN(t1.name) - LEN(REPLACE(t1.name,'#','')) = 1 THEN 1 ELSE 0 END) = 1 THEN 'LocalTempTable' WHEN t1.name NOT LIKE '%[_]%' AND (SELECT CASE WHEN LEN(t1.name) - LEN(REPLACE(t1.name,'#','')) = 1 THEN 1 ELSE 0 END) = 1 THEN 'TableVariable' ELSE NULL END AS Table_Type, t1.is_ms_shipped, t1.is_published, t1.is_schema_published, t1.create_date, t1.modify_date FROM [tempdb].[sys].[objects] AS t1 JOIN [tempdb].[sys].[columns] AS t2 ON t1.OBJECT_ID = t2.OBJECT_ID JOIN sys.types AS t3 ON t2.system_type_id = t3.system_type_id WHERE t1.name LIKE '#%' ```
El Encanto is a town and municipality in the Amazonas Department, Colombia. It is located in the mouth of the Caraparaná River, tributary of the Putumayo River (Içá). El Encanto can be reached by air or river. The local navy base has a runway available only to military and official planes, these were established during the Colombia-Peru War. By river the closest towns with airport access are Puerto Arturo, Peru from downstream, and Puerto Leguízamo (Putumayo Department, Colombia) upstream. The majority of inhabitants in the area are Huitotos indigenous tribes. The municipality has an area of . History El Encanto was founded shortly before the 1900s by rubber tappers looking to take advantage of the local natives as a work force. The rubber boom had drastic effects in the Putumayo region, where El Encanto is located. The land owned by Arana was split into two 'departments': La Chorrera on the Igaraparaná and El Encanto, headquarters for sections on the Caraparaná. By 1904, the settlement came under the control of Julio César Arana and what would become the Peruvian Amazon Company. The companies efforts to extract rubber and profit culminated in the Putumayo genocide: enslaving, abusing, starving, exhausting, and murdering local populations. At the time of Roger Casement's visit to the Putumayo, the station was under the control of Miguel S. Loayza. Before the border of the Putumayo was changed thanks to the Salomón–Lozano Treaty: Julio Cesar Arana, Miguel S. Loayza, and Carlos Loayza initiated a series of forced migrations. Between 1922 and 1930 groups of natives from the right bank of the Putumayo were resettled in the Ampiyacu basin of Loreto, Peru: so the three of them could retain their work force. At least 6,719 indigenous people were moved from the region: and 50% of them died from disease. Climate El Encanto has a tropical rainforest climate (Köppen Af) with heavy rainfall year-round. References External links El Encanto official website Municipalities of Amazonas Department
USS R-3 (SS-80) was an R-class coastal and harbor defense submarine of the United States Navy. Construction and commissioning R-3′s keel was laid down on 11 December 1917 by the Fore River Shipbuilding Company in Quincy, Massachusetts. She was launched on 18 January 1919, sponsored by Mrs. Charles G. McCord, and commissioned on 17 April 1919 at Boston, Massachusetts. Service history 1919–1934 After shakedown off the Massachusetts coast, R-3 was assigned to Submarine Division 9 at New London, Connecticut. She departed New London with the coaling ship on 4 December 1919 for Norfolk, Virginia and a winter deployment with the division in the Gulf of Mexico from 13 January to 27 March 1920. R-3 returned to New London on 18 May for four months of summer exercises with and . Given hull classification symbol SS-80 in July, she sailed on 13 September for Norfolk and overhaul. R-3 was transferred to the Pacific with Division 9 on 8 April, transited the Panama Canal on 28 May, and arrived 30 June at her new base, San Pedro, California. After operating for two years in California waters, she was transferred 16 July 1923 to Pearl Harbor where she was stationed for the next years, engaging in training and operations with fleet units. R-3 was reassigned 12 December 1930 to the Atlantic Fleet for duty with Division 4, arriving 9 February 1931 at New London. After acting as a training ship at the Submarine School, New London for five months, she was ordered 6 May to Washington, DC, for air purification tests by the Naval Research Laboratory. In 1932, R-3 conducted sound and radio experiments for the laboratory and trained personnel from the Deep Sea Diving School off Piney Point, Maryland. R-3 was placed in reduced commission 26 April 1933 and after testing low-pressure valves for the Naval Research Laboratory, departed for Annapolis, Maryland, on 2 June 1933 where she served as a training ship for future generations of submariners. She sailed 22 February 1934 for Guantanamo Bay and sound operations with Eagle 58, followed by training duty at Washington, DC, with the Deep Sea Diving School. R-3 was decommissioned 10 August 1934 at Philadelphia, Pennsylvania. 1940–1948 R-3 recommissioned 19 August 1940 at New London, was attached to Division 42, and after a brief period at New London, 23 October to 10 December, headed for Coco Solo. Patrols and training duties followed and in mid-1941 she returned to New London to prepare for transfer to the Royal Navy. Decommissioned and transferred 4 November 1941, R-3 was struck from the Naval Vessel Register on 7 November 1941. She continued her career in British home waters as , a training submarine, until returned to the U.S. Navy in the United Kingdom, 20 December 1944. Unfit for service after the war, she was scrapped at Troon, Scotland, in 1948. References External links United States R-class submarines Ships built in Quincy, Massachusetts 1919 ships Ships transferred from the United States Navy to the Royal Navy United States R-class submarines of the Royal Navy World War II submarines of the United Kingdom
Carolyn McAskie (born 15 December 1946) is a Canadian diplomat and former assistant secretary-general for peacekeeping at the United Nations. She was the head of the United Nations mission to Burundi (ONUB) in 2004, making her the first Canadian to lead a United Nations peacekeeping mission following the UN's switch to complex missions. Biography McAskie was born in Glasgow, Scotland. She entered the Canadian Civil Service in 1968. From 1975–1980, McAskie served as Assistant Director of Finance and Personnel at the Commonwealth Secretariat in London. Her first major role with the government of Canada was as Canadian High Commissioner to Sri Lanka and the Maldives in 1983. In 1985, she participated in the World Conference on Women. In 1993, McAskie began working at the Canadian International Development Agency (CIDA). She served as Vice-President for African and the Middle Eastern programs, as well as Vice-President for CIDA's multilateral programs. As of 2018, McAskie is a senior fellow at the University of Ottawa's Graduate School of Public and International Affairs. She was also a director for CANADEM, and a director of Pearson Peacekeeping Centre. United Nations McAskie has been a part of multiple delegations to the United Nations. She was appointed deputy Emergency Relief Coordinator in 1999. She replaced Sérgio Vieira de Mello and became the interim Emergency Relief Coordinator from 1999–2004 due to De Mello's mission in Timor-Leste. She has assisted in several relief efforts in Africa over her term. As coordinator, she visited Ethiopia, Eritrea, and Kenya on 10 July 2000, to examine the effects of the drought and to organize relief efforts. McAskie visited the Democratic Republic of the Congo in May 2003 to assess renewed fighting in Ituri. From 2004 to April 2006, McAskie was the Special Representative of the Secretary-General and head of the United Nations mission (ONUB) to Burundi, and led ceasefire talks in the Burundian Civil War. She was the first Canadian to lead a UN peacekeeping mission following the United Nations' switch to complex missions. On 16 May 2006, McAskie was named assistant secretary-general for peacebuilding support. Awards In April 2005, McAskie received an honorary degree from the University of British Columbia. On 3 May 2007, McAskie was awarded with the Order of Canada for her efforts in peacekeeping and international diplomacy. References Living people 1946 births Canadian women diplomats Officers of the Order of Canada Canadian officials of the United Nations
Talk About a Lady is a 1946 American musical film directed by George Sherman and starring Forrest Tucker, Jinx Falkenburg and Trudy Marshall. It was produced and distributed by Columbia Pictures. Plot Cast Jinx Falkenburg as Janie Clark Forrest Tucker as Bart Manners Joe Besser as Roly Q. Entwhistle Trudy Marshall as Toni Marlowe Richard Lane as Duke Randall Jimmy Little as Buffalo Frank Sully as Rocky Jordan Jack Davis as Carleton Vane Robert Regent as Arthur Harrison Mira McKinney as Letitia Harrison Robin Raymond as 'Peaches' Barkeley Stan Kenton as Orchestra Leader References External links Talk About a Lady at Library of Congress Talk About a Lady at TCMDB 1940s English-language films 1946 films American musical films Films directed by George Sherman 1946 musical films American black-and-white films 1940s American films Columbia Pictures films
Emil Martinov (; born 18 March 1992) is a Bulgarian footballer who plays as a midfielder for Slavia Sofia. Club career On 11 August 2018, Martinov signed contract with Azerbaijan Premier League side Sabail FK. In September 2021 he joined CSKA 1948. Honours Slavia Sofia Bulgarian Cup (1): 2017–18 References External links Martinov Statistics in Germany 1992 births Living people Bulgarian men's footballers Men's association football defenders First Professional Football League (Bulgaria) players Second Professional Football League (Bulgaria) players Azerbaijan Premier League players PFC Slavia Sofia players PFK Svetkavitsa 1922 players OFC Sliven 2000 players FC Spartak Varna players BC Aichach players Sabail FK players FC Arda Kardzhali players Expatriate men's footballers in Azerbaijan Bulgarian expatriate sportspeople in Azerbaijan
658 Asteria is a minor planet orbiting the Sun. References External links Koronis asteroids Asteria Asteria S-type asteroids (Tholen) 19080123
The Billboard Hot 100 is a chart that ranks the best-performing songs in the United States. Its data, published by Billboard magazine and compiled by Nielsen SoundScan, is based collectively on each song's weekly physical and digital sales, as well as the amount of airplay received on American radio stations and streaming on online digital music outlets. During 2019, fifteen singles reached number one on the Hot 100; a sixteenth single, "Thank U, Next" by Ariana Grande, began its run at number one in November 2018. Of those fifteen number-one singles, four were collaborations. In total, eighteen acts topped the chart as either lead or featured artists, with ten—Swae Lee (as a solo artist), Bradley Cooper, Jonas Brothers, Lil Nas X, Billy Ray Cyrus, Billie Eilish, Shawn Mendes, Lizzo, Lewis Capaldi, and Selena Gomez—achieving their first Hot 100 number-one single. Lil Nas X's "Old Town Road" was the longest-running number-one of the year, leading the chart for nineteen weeks (one for the song's original version, credited solely to Lil Nas X, and eighteen for a remix featuring Billy Ray Cyrus); in doing so, it broke the record as the longest-running number one single in Billboard history - a record previously held by the sixteen-week runs of both "One Sweet Day" by Mariah Carey (who added a nineteenth number one single in 2019) and Boyz II Men (1995–96), and "Despacito" by Luis Fonsi and Daddy Yankee featuring Justin Bieber (2017). It also topped the Billboard Year-End Hot 100 ranking as the best-performing single of 2019. Post Malone and Ariana Grande were the only acts to have multiple number-one songs in 2019, with two apiece. Chart history Number-one artists See also 2019 in American music List of Billboard 200 number-one albums of 2019 List of Billboard Hot 100 top-ten singles in 2019 Billboard Year-End Hot 100 singles of 2019 Notes References United States Hot 100 2019 Hot 100 number-one singles
Ludwig van Beethoven's Piano Sonata No. 2 in A major, Op. 2, No. 2, was written in 1795 and dedicated to Joseph Haydn. It was published simultaneously with his first and third sonatas in 1796. Donald Francis Tovey wrote, "The second sonata is flawless in execution and entirely beyond the range of Haydn and Mozart in harmonic and dramatic thought, except in the Finale." A typical performance of the entire sonata lasts about 22 minutes. The sonata was the first Beethoven sonata to reach America and was performed in New York on June 5, 1807. Structure The sonata is laid out in four movements: I. Allegro vivace The first movement is an athletic movement that has a bright disposition. The second theme of exposition contains some striking modulations for the time period. A large portion of the development section is in F major, which contains a third relationship with the key of the work, A major. A difficult, but beautiful canonic section is also to be found in the development. The recapitulation contains no coda and the movement ends quietly and unassumingly. Tovey wrote, "The opening of the second subject in the first movement is a wonderful example of the harmonic principle previously mentioned...In all music, nothing equally dramatic can be found before the D minor sonata, Op. 31 No. 2 which is rightly regarded as marking the beginning of Beethoven's second period." II. Largo appassionato One of the few instances in which Beethoven uses the tempo marking Largo, which was the slowest such marking for a movement. The opening imitates the style of a string quartet and features a staccato pizzicato-like bass against lyrical chords. A high degree of contrapuntal thinking is evident in Beethoven's conception of this movement. The key is the subdominant of A major, D major. Tovey wrote, "The slow movement shows a thrilling solemnity that immediately proves the identity of the pupil of Haydn with the creator of the 9th symphony." III. Scherzo: Allegretto A short and graceful movement that is in many respects similar to a minuet. This is the first instance in his 32 numbered sonatas in which the term "Scherzo" is used. The A minor trio section adds contrast to the cheerful opening material of this movement. Unusually, there is a second melody (not in the trio) in the remote key of G minor. IV. Rondo: Grazioso A beautiful and lyrical rondo. The arpeggio that opens the repeated material becomes more elaborate at each entrance. The form of this rondo is A1–B1–A2–C–A3–B2–A4–Coda. The C section, in the parallel minor A minor, is rather agitated and stormy in comparison to the rest of the work, and is representative of the so-called "Sturm und Drang" style. A simple but elegant V7–I perfect cadence closes the entire work in the lower register, played piano. References External links A lecture by András Schiff on Beethoven's Piano Sonata, Op. 2, No. 2 Recording by Paavali Jumppanen, piano from the Isabella Stewart Gardner Museum For a public domain recording of this sonata visit Musopen Piano Sonata 02 1796 compositions Compositions in A major Music with dedications
Ariel Adrián Cólzera, also known as Ariel Damián Cólzera, (born April 15, 1986) is an Argentine footballer currently playing for Deportivo Merlo. References External links 1986 births Living people Argentine men's footballers Argentine expatriate men's footballers Argentina men's youth international footballers Argentina men's international footballers Men's association football forwards Boca Juniors footballers FK Teplice players Club Atlético Huracán footballers Gimnasia y Esgrima de Jujuy footballers Atlético de Rafaela footballers San Martín de San Juan footballers Unión de Santa Fe footballers Unión La Calera footballers Santiago Wanderers footballers Crucero del Norte footballers Club Atlético Temperley footballers Juventud Unida de Gualeguaychú players Club Atlético Sarmiento footballers Deportivo Merlo footballers Argentine Primera División players Czech First League players Chilean Primera División players Primera Nacional players Argentine expatriate sportspeople in Chile Argentine expatriate sportspeople in the Czech Republic Expatriate men's footballers in Chile Expatriate men's footballers in the Czech Republic
Sheikh Hassan Moussa () is the leading imam of the Stockholm Mosque at Medborgarplatsen. The mosque is run by the Islamiska Förbundet i Stockholm. A Svenska Dagbladet report accused him of deliberately misleading the Swedish public regarding the controversial contents of his sermons. Notes Year of birth missing (living people) Living people Swedish imams
Chester Gaylord (February 24, 1899 – July 1, 1984) was a vocalist and among the most active of recording artists in the United States during the late 1920s through the early 1930s. He was known as The Whispering Serenader on radio and on his phonograph records. He began his career as a singer and announcer for radio station WTAG in Worcester, Massachusetts in the early 1920s. Chester Gaylord's first recordings (in 1920) were saxophone solos for Thomas Edison, whom he had met. In 1923, he signed with Columbia records and made a number of vocal records for them. His popularity spread rapidly leading Brunswick Records (the second largest record company in the United States in the 1920s) to offer him an exclusive contract. He became one of the labels most prolific vocalists during the late 1920s. After the Warner Brothers bought out the Brunswick Record company in April 1930 a reorganization occurred and Chester Gaylord's contact was one of numerous artists whose contract was not renewed. Chester Gaylord continued to be popular on radio throughout the early 1930s until the introduction of swing music, in 1935, a type of music that was unsuitable to his style of singing. From 1929 to 1931, he was a featured vocalist on NBC radio on the Top Notchers Coca-Cola Radio Program with Leonard Joy and his All String Orchestra. Gaylord moved to WBZ in Boston in the late 40s, and completed his broadcasting career there. He retired sometime in the mid-1960s. During his retirement years he lived in Sterling, Massachusetts. He regularly played 1920s and 1930s songs on piano at The Old Timer, an Irish Pub in neighboring Clinton, Mass. According to Gaylord's obituary, he was still performing right up until a few weeks before his death. Works Pianist Thinking of me thinking of you (1928) My window of Dreams (1928) Here's the party now in Person (1928) You're in love and I'm in Love (1928) My Inspiration is You (1928) Me and the man in the Moon (1928) Glad Rag Roll (1929) Honey (1929) Vocalist My Troubles are Over (1929) Mean to me (1929) See also Jack Smith "the whispering baritone" References Further reading 1899 births 1984 deaths 20th-century American singers 20th-century American male singers
Dry Run is a tributary of the Lehigh River in Northampton County, Pennsylvania, in the United States. It is approximately long and flows through Allen Township and Northampton. The stream is designated as a Coldwater Fishery and a Migratory Fishery. It is often dry. Course Dry Run begins in a flat area west of Sauerkraut Hill in Allen Township. It flows south for several tenths of a mile before crossing Pennsylvania Route 329 and continuing to flow south. The stream eventually begins to gradually turn southwest and enters Northampton. Here, it flows west-southwest for a few tenths of a mile before turning southwest for several tenths of a mile. The stream then reaches its confluence with the Lehigh River. Dry Run joins the Lehigh River upstream of its mouth. Geography and geology The elevation near the mouth of Dry Run is above sea level. The elevation near the stream's source is above sea level. Watershed The watershed of Dry Run has an area of . The stream is entirely within the United States Geological Survey quadrangle of Catasauqua. Polluted stormwater in Allen Township has the potential to impact Dry Run. However, an NPDES permit was once issued for discharge of stormwater into the stream, associated with construction activities. The stream frequently is dry. History Dry Run was entered into the Geographic Names Information System on August 2, 1979. Its identifier in the Geographic Names Information System is 1173531. In 1787, Christian Schwartz constructed a large stone house at the mouth of Dry Run. A lost Pratt through truss bridge was once built over Dry Run for the Lehigh Valley Transit Co. Historically, a trolley bridge crossed the stream and a school was located near this bridge. In 2014, the Delaware and Lehigh National Heritage Corridor received $217,000 from the Pennsylvania Department of Community and Economic Development to replace a pedestrian bridge over the stream. Biology The drainage basin of Dry Run is designated as a Coldwater Fishery and a Migratory Fishery. See also Coplay Creek, next tributary of the Lehigh River going downriver Hokendauqua Creek, next tributary of the Lehigh River going upriver List of rivers of Pennsylvania References Tributaries of the Lehigh River
Martínez is a town in the province of Ávila, Castile and León in Spain. It belongs in the judicial district of Piedrahita. Situation It is located at an altitude of 1098 m and covers an area of 17.20 km². Located 70 km from the capital, bordering the province of Salamanca. Belongs to the judicial district of Piedrahita. Population Data INE for 2005. Total: 190 Male: 100 Female: 90 Government The mayor is Adolfo Caselle White. References External links Official Website of Martínez Populated places in the Province of Ávila
```rust use crate::atom_table::; use crate::forms::; use crate::instructions::; use crate::iterators::; use crate::machine::loader::; use crate::machine::machine_errors::CompilationError; use crate::machine::preprocessor::; use crate::parser::ast::; use crate::parser::dashu::Rational; use crate::variable_records::; use dashu::Integer; use indexmap::{IndexMap, IndexSet}; use std::cell::Cell; use std::cmp::Ordering; use std::collections::VecDeque; use std::hash::{Hash, Hasher}; use std::ops::{Deref, DerefMut}; #[derive(Debug, Clone)] //, PartialOrd, PartialEq, Eq, Hash)] pub struct BranchNumber { branch_num: Rational, delta: Rational, } impl Default for BranchNumber { fn default() -> Self { Self { branch_num: Rational::from(1u64 << 63), delta: Rational::from(1), } } } impl PartialEq<BranchNumber> for BranchNumber { #[inline] fn eq(&self, rhs: &BranchNumber) -> bool { self.branch_num == rhs.branch_num } } impl Eq for BranchNumber {} impl Hash for BranchNumber { #[inline(always)] fn hash<H: Hasher>(&self, hasher: &mut H) { self.branch_num.hash(hasher) } } impl PartialOrd<BranchNumber> for BranchNumber { #[inline] fn partial_cmp(&self, rhs: &BranchNumber) -> Option<Ordering> { self.branch_num.partial_cmp(&rhs.branch_num) } } impl BranchNumber { fn split(&self) -> BranchNumber { BranchNumber { branch_num: self.branch_num.clone() + &self.delta / Rational::from(2), delta: &self.delta / Rational::from(4), } } fn incr_by_delta(&self) -> BranchNumber { BranchNumber { branch_num: self.branch_num.clone() + &self.delta, delta: self.delta.clone(), } } fn halve_delta(&self) -> BranchNumber { BranchNumber { branch_num: self.branch_num.clone(), delta: &self.delta / Rational::from(2), } } } #[derive(Debug, Clone, PartialEq, Eq, Hash)] pub struct VarInfo { var_ptr: VarPtr, chunk_type: ChunkType, classify_info: ClassifyInfo, lvl: Level, } #[derive(Debug, Clone, PartialEq, Eq, Hash)] pub struct ChunkInfo { chunk_num: usize, term_loc: GenContext, // pointer to incidence, term occurrence arity. vars: Vec<VarInfo>, } #[derive(Debug)] pub struct BranchArm { pub arm_terms: Vec<QueryTerm>, } #[derive(Debug, Clone, PartialEq, Eq, Hash)] pub struct BranchInfo { branch_num: BranchNumber, chunks: Vec<ChunkInfo>, } impl BranchInfo { fn new(branch_num: BranchNumber) -> Self { Self { branch_num, chunks: vec![], } } } type BranchMapInt = IndexMap<VarPtr, Vec<BranchInfo>>; #[derive(Debug, Clone)] pub struct BranchMap(BranchMapInt); impl Deref for BranchMap { type Target = BranchMapInt; #[inline(always)] fn deref(&self) -> &BranchMapInt { &self.0 } } impl DerefMut for BranchMap { #[inline(always)] fn deref_mut(&mut self) -> &mut BranchMapInt { &mut self.0 } } type RootSet = IndexSet<BranchNumber>; #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] pub struct ClassifyInfo { arg_c: usize, arity: usize, } enum TraversalState { // construct a QueryTerm::Branch with number of disjuncts, reset // the chunk type to that of the chunk preceding the disjunct and the chunk_num. BuildDisjunct(usize), // add the last disjunct to a QueryTerm::Branch, continuing from // where it leaves off. BuildFinalDisjunct(usize), Fail, GetCutPoint { var_num: usize, prev_b: bool }, Cut { var_num: usize, is_global: bool }, CutPrev(usize), ResetCallPolicy(CallPolicy), Term(Term), OverrideGlobalCutVar(usize), ResetGlobalCutVarOverride(Option<usize>), RemoveBranchNum, // pop the current_branch_num and from the root set. AddBranchNum(BranchNumber), // set current_branch_num, add it to the root set RepBranchNum(BranchNumber), // replace current_branch_num and the latest in the root set } #[derive(Debug)] pub struct VariableClassifier { call_policy: CallPolicy, current_branch_num: BranchNumber, current_chunk_num: usize, current_chunk_type: ChunkType, branch_map: BranchMap, var_num: usize, root_set: RootSet, global_cut_var_num: Option<usize>, global_cut_var_num_override: Option<usize>, } #[derive(Debug, Default)] pub struct VarData { pub records: VariableRecords, pub global_cut_var_num: Option<usize>, pub allocates: bool, } impl VarData { fn emit_initial_get_level(&mut self, build_stack: &mut ChunkedTermVec) { let global_cut_var_num = if let &Some(global_cut_var_num) = &self.global_cut_var_num { match &self.records[global_cut_var_num].allocation { VarAlloc::Perm(..) => Some(global_cut_var_num), VarAlloc::Temp { term_loc, .. } if term_loc.chunk_num() > 0 => { Some(global_cut_var_num) } _ => None, } } else { None }; if let Some(global_cut_var_num) = global_cut_var_num { let term = QueryTerm::GetLevel(global_cut_var_num); self.records[global_cut_var_num].allocation = VarAlloc::Perm(0, PermVarAllocation::Pending); match build_stack.front_mut() { Some(ChunkedTerms::Branch(_)) => { build_stack.push_front(ChunkedTerms::Chunk(VecDeque::from(vec![term]))); } Some(ChunkedTerms::Chunk(chunk)) => { chunk.push_front(term); } None => { unreachable!() } } } } } pub type ClassifyFactResult = (Term, VarData); pub type ClassifyRuleResult = (Term, ChunkedTermVec, VarData); fn merge_branch_seq(branches: impl Iterator<Item = BranchInfo>) -> BranchInfo { let mut branch_info = BranchInfo::new(BranchNumber::default()); for mut branch in branches { branch_info.branch_num = branch.branch_num; branch_info.chunks.append(&mut branch.chunks); } branch_info.branch_num.delta = branch_info.branch_num.delta * Integer::from(2); branch_info.branch_num.branch_num -= &branch_info.branch_num.delta; branch_info } fn flatten_into_disjunct(build_stack: &mut ChunkedTermVec, preceding_len: usize) { let branch_vec = build_stack.drain(preceding_len + 1..).collect(); if let ChunkedTerms::Branch(ref mut disjuncts) = &mut build_stack[preceding_len] { disjuncts.push(branch_vec); } else { unreachable!(); } } impl VariableClassifier { pub fn new(call_policy: CallPolicy) -> Self { Self { call_policy, current_branch_num: BranchNumber::default(), current_chunk_num: 0, current_chunk_type: ChunkType::Head, branch_map: BranchMap(BranchMapInt::new()), root_set: RootSet::new(), var_num: 0, global_cut_var_num: None, global_cut_var_num_override: None, } } pub fn classify_fact(mut self, term: Term) -> Result<ClassifyFactResult, CompilationError> { self.classify_head_variables(&term)?; Ok(( term, self.branch_map.separate_and_classify_variables( self.var_num, self.global_cut_var_num, self.current_chunk_num, ), )) } pub fn classify_rule<'a, LS: LoadState<'a>>( mut self, loader: &mut Loader<'a, LS>, head: Term, body: Term, ) -> Result<ClassifyRuleResult, CompilationError> { self.classify_head_variables(&head)?; self.root_set.insert(self.current_branch_num.clone()); let mut query_terms = self.classify_body_variables(loader, body)?; self.merge_branches(); let mut var_data = self.branch_map.separate_and_classify_variables( self.var_num, self.global_cut_var_num, self.current_chunk_num, ); var_data.emit_initial_get_level(&mut query_terms); Ok((head, query_terms, var_data)) } fn merge_branches(&mut self) { for branches in self.branch_map.values_mut() { let mut old_branches = std::mem::take(branches); while let Some(last_branch_num) = old_branches.last().map(\|bi\| &bi.branch_num) { let mut old_branches_len = old_branches.len(); for (rev_idx, bi) in old_branches.iter().rev().enumerate() { if &bi.branch_num > last_branch_num { old_branches_len = old_branches.len() - rev_idx; } } let iter = old_branches.drain(old_branches_len - 1..); branches.push(merge_branch_seq(iter)); } branches.reverse(); } } fn try_set_chunk_at_inlined_boundary(&mut self) -> bool { if self.current_chunk_type.is_last() { self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; true } else { false } } fn try_set_chunk_at_call_boundary(&mut self) -> bool { if self.current_chunk_type.is_last() { self.current_chunk_num += 1; true } else { self.current_chunk_type = ChunkType::Last; false } } fn probe_body_term(&mut self, arg_c: usize, arity: usize, term: &Term) { let classify_info = ClassifyInfo { arg_c, arity }; // second arg is true to iterate the root, which may be a variable for term_ref in breadth_first_iter(term, RootIterationPolicy::Iterated) { if let TermRef::Var(lvl, _, var_ptr) = term_ref { // root terms are shallow here (since we're iterating a // body term) so take the child level. let lvl = lvl.child_level(); self.probe_body_var(VarInfo { var_ptr, lvl, classify_info, chunk_type: self.current_chunk_type, }); } } } fn probe_body_var(&mut self, var_info: VarInfo) { let term_loc = self .current_chunk_type .to_gen_context(self.current_chunk_num); let branch_info_v = self.branch_map.entry(var_info.var_ptr.clone()).or_default(); let needs_new_branch = if let Some(last_bi) = branch_info_v.last() { !self.root_set.contains(&last_bi.branch_num) } else { true }; if needs_new_branch { branch_info_v.push(BranchInfo::new(self.current_branch_num.clone())); } let branch_info = branch_info_v.last_mut().unwrap(); let needs_new_chunk = if let Some(last_ci) = branch_info.chunks.last() { last_ci.chunk_num != self.current_chunk_num } else { true }; if needs_new_chunk { branch_info.chunks.push(ChunkInfo { chunk_num: self.current_chunk_num, term_loc, vars: vec![], }); } let chunk_info = branch_info.chunks.last_mut().unwrap(); chunk_info.vars.push(var_info); } fn probe_in_situ_var(&mut self, var_num: usize) { let classify_info = ClassifyInfo { arg_c: 1, arity: 1 }; let var_info = VarInfo { var_ptr: VarPtr::from(Var::InSitu(var_num)), classify_info, chunk_type: self.current_chunk_type, lvl: Level::Shallow, }; self.probe_body_var(var_info); } fn classify_head_variables(&mut self, term: &Term) -> Result<(), CompilationError> { match term { Term::Clause(..) \| Term::Literal(_, Literal::Atom(_)) => {} _ => return Err(CompilationError::InvalidRuleHead), } let mut classify_info = ClassifyInfo { arg_c: 1, arity: term.arity(), }; if let Term::Clause(_, _, terms) = term { for term in terms.iter() { for term_ref in breadth_first_iter(term, RootIterationPolicy::Iterated) { if let TermRef::Var(lvl, _, var_ptr) = term_ref { // a body term, so we need the child level here. let lvl = lvl.child_level(); // the body of the if let here is an inlined // "probe_head_var". note the difference between it // and "probe_body_var". let branch_info_v = self.branch_map.entry(var_ptr.clone()).or_default(); let needs_new_branch = branch_info_v.is_empty(); if needs_new_branch { branch_info_v.push(BranchInfo::new(self.current_branch_num.clone())); } let branch_info = branch_info_v.last_mut().unwrap(); let needs_new_chunk = branch_info.chunks.is_empty(); if needs_new_chunk { branch_info.chunks.push(ChunkInfo { chunk_num: self.current_chunk_num, term_loc: GenContext::Head, vars: vec![], }); } let chunk_info = branch_info.chunks.last_mut().unwrap(); let var_info = VarInfo { var_ptr, classify_info, chunk_type: self.current_chunk_type, lvl, }; chunk_info.vars.push(var_info); } } classify_info.arg_c += 1; } } Ok(()) } fn classify_body_variables<'a, LS: LoadState<'a>>( &mut self, loader: &mut Loader<'a, LS>, term: Term, ) -> Result<ChunkedTermVec, CompilationError> { let mut state_stack = vec![TraversalState::Term(term)]; let mut build_stack = ChunkedTermVec::new(); self.current_chunk_type = ChunkType::Mid; while let Some(traversal_st) = state_stack.pop() { match traversal_st { TraversalState::AddBranchNum(branch_num) => { self.root_set.insert(branch_num.clone()); self.current_branch_num = branch_num; } TraversalState::RemoveBranchNum => { self.root_set.pop(); } TraversalState::RepBranchNum(branch_num) => { self.root_set.pop(); self.root_set.insert(branch_num.clone()); self.current_branch_num = branch_num; } TraversalState::ResetCallPolicy(call_policy) => { self.call_policy = call_policy; } TraversalState::BuildDisjunct(preceding_len) => { flatten_into_disjunct(&mut build_stack, preceding_len); self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; } TraversalState::BuildFinalDisjunct(preceding_len) => { flatten_into_disjunct(&mut build_stack, preceding_len); self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; } TraversalState::GetCutPoint { var_num, prev_b } => { if self.try_set_chunk_at_inlined_boundary() { build_stack.add_chunk(); } self.probe_in_situ_var(var_num); build_stack.push_chunk_term(QueryTerm::GetCutPoint { var_num, prev_b }); } TraversalState::OverrideGlobalCutVar(var_num) => { self.global_cut_var_num_override = Some(var_num); } TraversalState::ResetGlobalCutVarOverride(old_override) => { self.global_cut_var_num_override = old_override; } TraversalState::Cut { var_num, is_global } => { if self.try_set_chunk_at_inlined_boundary() { build_stack.add_chunk(); } self.probe_in_situ_var(var_num); build_stack.push_chunk_term(if is_global { QueryTerm::GlobalCut(var_num) } else { QueryTerm::LocalCut { var_num, cut_prev: false, } }); } TraversalState::CutPrev(var_num) => { if self.try_set_chunk_at_inlined_boundary() { build_stack.add_chunk(); } self.probe_in_situ_var(var_num); build_stack.push_chunk_term(QueryTerm::LocalCut { var_num, cut_prev: true, }); } TraversalState::Fail => { build_stack.push_chunk_term(QueryTerm::Fail); } TraversalState::Term(term) => { // return true iff new chunk should be added. let update_chunk_data = \|classifier: &mut Self, predicate_name, arity\| { if ClauseType::is_inlined(predicate_name, arity) { classifier.try_set_chunk_at_inlined_boundary() } else { classifier.try_set_chunk_at_call_boundary() } }; let mut add_chunk = \|classifier: &mut Self, name: Atom, terms: Vec<Term>\| { if update_chunk_data(classifier, name, terms.len()) { build_stack.add_chunk(); } for (arg_c, term) in terms.iter().enumerate() { classifier.probe_body_term(arg_c + 1, terms.len(), term); } build_stack.push_chunk_term(clause_to_query_term( loader, name, terms, classifier.call_policy, )); }; match term { Term::Clause( _, name @ (atom!("->") \| atom!(";") \| atom!(",")), mut terms, ) if terms.len() == 3 => { if let Some(last_arg) = terms.last() { if let Term::Literal(_, Literal::CodeIndex(_)) = last_arg { terms.pop(); state_stack.push(TraversalState::Term(Term::Clause( Cell::default(), name, terms, ))); } else { add_chunk(self, name, terms); } } } Term::Clause(_, atom!(","), mut terms) if terms.len() == 2 => { let tail = terms.pop().unwrap(); let head = terms.pop().unwrap(); let iter = unfold_by_str(tail, atom!(",")) .into_iter() .rev() .chain(std::iter::once(head)) .map(TraversalState::Term); state_stack.extend(iter); } Term::Clause(_, atom!(";"), mut terms) if terms.len() == 2 => { let tail = terms.pop().unwrap(); let head = terms.pop().unwrap(); let first_branch_num = self.current_branch_num.split(); let branches: Vec<_> = std::iter::once(head) .chain(unfold_by_str(tail, atom!(";")).into_iter()) .collect(); let mut branch_numbers = vec![first_branch_num]; for idx in 1..branches.len() { let succ_branch_number = branch_numbers[idx - 1].incr_by_delta(); branch_numbers.push(if idx + 1 < branches.len() { succ_branch_number.split() } else { succ_branch_number }); } let build_stack_len = build_stack.len(); build_stack.reserve_branch(branches.len()); state_stack.push(TraversalState::RepBranchNum( self.current_branch_num.halve_delta(), )); let iter = branches.into_iter().zip(branch_numbers.into_iter()); let final_disjunct_loc = state_stack.len(); for (term, branch_num) in iter.rev() { state_stack.push(TraversalState::BuildDisjunct(build_stack_len)); state_stack.push(TraversalState::RemoveBranchNum); state_stack.push(TraversalState::Term(term)); state_stack.push(TraversalState::AddBranchNum(branch_num)); } if let TraversalState::BuildDisjunct(build_stack_len) = state_stack[final_disjunct_loc] { state_stack[final_disjunct_loc] = TraversalState::BuildFinalDisjunct(build_stack_len); } self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; } Term::Clause(_, atom!("->"), mut terms) if terms.len() == 2 => { let then_term = terms.pop().unwrap(); let if_term = terms.pop().unwrap(); let prev_b = if matches!( state_stack.last(), Some(TraversalState::RemoveBranchNum) ) { // check if the second-to-last element // is a regular BuildDisjunct, as we // don't want to add GetPrevLevel in // case of a TrustMe. match state_stack.iter().rev().nth(1) { Some(&TraversalState::BuildDisjunct(preceding_len)) => { preceding_len + 1 == build_stack.len() } _ => false, } } else { false }; state_stack.push(TraversalState::Term(then_term)); state_stack.push(TraversalState::Cut { var_num: self.var_num, is_global: false, }); state_stack.push(TraversalState::Term(if_term)); state_stack.push(TraversalState::GetCutPoint { var_num: self.var_num, prev_b, }); self.var_num += 1; } Term::Clause(_, atom!("\\+"), mut terms) if terms.len() == 1 => { let not_term = terms.pop().unwrap(); let build_stack_len = build_stack.len(); build_stack.reserve_branch(2); state_stack.push(TraversalState::BuildFinalDisjunct(build_stack_len)); state_stack.push(TraversalState::Term(Term::Clause( Cell::default(), atom!("$succeed"), vec![], ))); state_stack.push(TraversalState::BuildDisjunct(build_stack_len)); state_stack.push(TraversalState::Fail); state_stack.push(TraversalState::CutPrev(self.var_num)); state_stack.push(TraversalState::ResetGlobalCutVarOverride( self.global_cut_var_num_override, )); state_stack.push(TraversalState::Term(not_term)); state_stack.push(TraversalState::OverrideGlobalCutVar(self.var_num)); state_stack.push(TraversalState::GetCutPoint { var_num: self.var_num, prev_b: false, }); self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; self.var_num += 1; } Term::Clause(_, atom!(":"), mut terms) if terms.len() == 2 => { let predicate_name = terms.pop().unwrap(); let module_name = terms.pop().unwrap(); match (module_name, predicate_name) { ( Term::Literal(_, Literal::Atom(module_name)), Term::Literal(_, Literal::Atom(predicate_name)), ) => { if update_chunk_data(self, predicate_name, 0) { build_stack.add_chunk(); } build_stack.push_chunk_term(qualified_clause_to_query_term( loader, module_name, predicate_name, vec![], self.call_policy, )); } ( Term::Literal(_, Literal::Atom(module_name)), Term::Clause(_, name, terms), ) => { if update_chunk_data(self, name, terms.len()) { build_stack.add_chunk(); } for (arg_c, term) in terms.iter().enumerate() { self.probe_body_term(arg_c + 1, terms.len(), term); } build_stack.push_chunk_term(qualified_clause_to_query_term( loader, module_name, name, terms, self.call_policy, )); } (module_name, predicate_name) => { if update_chunk_data(self, atom!("call"), 2) { build_stack.add_chunk(); } self.probe_body_term(1, 0, &module_name); self.probe_body_term(2, 0, &predicate_name); terms.push(module_name); terms.push(predicate_name); build_stack.push_chunk_term(clause_to_query_term( loader, atom!("call"), vec![Term::Clause(Cell::default(), atom!(":"), terms)], self.call_policy, )); } } } Term::Clause(_, atom!("$call_with_inference_counting"), mut terms) if terms.len() == 1 => { state_stack.push(TraversalState::ResetCallPolicy(self.call_policy)); state_stack.push(TraversalState::Term(terms.pop().unwrap())); self.call_policy = CallPolicy::Counted; } Term::Clause(_, name, terms) => { add_chunk(self, name, terms); } var @ Term::Var(..) => { if update_chunk_data(self, atom!("call"), 1) { build_stack.add_chunk(); } self.probe_body_term(1, 1, &var); build_stack.push_chunk_term(clause_to_query_term( loader, atom!("call"), vec![var], self.call_policy, )); } Term::Literal(_, Literal::Atom(atom!("!")) \| Literal::Char('!')) => { let (var_num, is_global) = if let Some(var_num) = self.global_cut_var_num_override { (var_num, false) } else if let Some(var_num) = self.global_cut_var_num { (var_num, true) } else { let var_num = self.var_num; self.global_cut_var_num = Some(var_num); self.var_num += 1; (var_num, true) }; self.probe_in_situ_var(var_num); state_stack.push(TraversalState::Cut { var_num, is_global }); } Term::Literal(_, Literal::Atom(name)) => { if update_chunk_data(self, name, 0) { build_stack.add_chunk(); } build_stack.push_chunk_term(clause_to_query_term( loader, name, vec![], self.call_policy, )); } _ => { return Err(CompilationError::InadmissibleQueryTerm); } } } } } Ok(build_stack) } } impl BranchMap { pub fn separate_and_classify_variables( &mut self, var_num: usize, global_cut_var_num: Option<usize>, current_chunk_num: usize, ) -> VarData { let mut var_data = VarData { records: VariableRecords::new(var_num), global_cut_var_num, allocates: current_chunk_num > 0, }; for (var, branches) in self.iter_mut() { let (mut var_num, var_num_incr) = if let Var::InSitu(var_num) = *var.borrow() { (var_num, false) } else { (var_data.records.len(), true) }; for branch in branches.iter_mut() { if var_num_incr { var_num = var_data.records.len(); var_data.records.push(VariableRecord::default()); } if branch.chunks.len() <= 1 { // true iff var is a temporary variable. debug_assert_eq!(branch.chunks.len(), 1); let chunk = &mut branch.chunks[0]; let mut temp_var_data = TempVarData::new(); for var_info in chunk.vars.iter_mut() { if var_info.lvl == Level::Shallow { let term_loc = var_info.chunk_type.to_gen_context(chunk.chunk_num); temp_var_data .use_set .insert((term_loc, var_info.classify_info.arg_c)); } } var_data.records[var_num].allocation = VarAlloc::Temp { term_loc: chunk.term_loc, temp_reg: 0, temp_var_data, safety: VarSafetyStatus::Needed, to_perm_var_num: None, }; } // else VarAlloc is already a Perm variant, as it's the default. for chunk in branch.chunks.iter_mut() { var_data.records[var_num].num_occurrences += chunk.vars.len(); for var_info in chunk.vars.iter_mut() { var_info.var_ptr.set(Var::Generated(var_num)); } } } } var_data.records.populate_restricting_sets(); var_data } } ```
was the third son of Tsunehisa. His childhood name was Hikoshirō (彦四郎). He also called himself for the domain he ruled. He received Enya of east Izumo Province and used Mount Yōgai (要害山) for his castle. Like his elder brother Kunihisa, he was skilled in warfare. Not satisfied with the size of his domain, he demanded another 700 Kan in addition to 3000 Kan he already owned. He raised a revolt against Tsunehisa in 1532 suspecting Kamei Hidetsuna, the chief advisor to Tsunehisa had been plotting against him. The Amago clan split into two and Kamei Toshitsuna, Hidetsuna's younger brother died fighting for Okihisa. He was driven out of Enya and escaped. In 1534, he committed seppuku realizing that he would never be able to return to the clan. References 1497 births 1534 deaths Daimyo Suicides by seppuku Amago clan 16th-century suicides
Shin Pal-gyun(신팔균, 申八均, May 19, 1882 ~ July 2, 1924) or Shin Dong-chun (신동천, 申東川) was an independence activist of Korea. His wife Im Su-myung (임수명) was an independence activist also. Biography Shin Pal-gyun was born in Seoul on May 19, 1882. His great-great-grandfather Shin Hong-ju, grandfather Shin-hun, and father Shin Seok-hee were all high-ranking military officers. Especially his father Shin Seok-hee was the officer that negotiationed Treaty of Ganghwa and Joseon-America Treaty. So Shin Pal-hyun naturally grew up a soldier of Korean Empire. He graduated the Military Academy and he became a military officer in 1903. In 1907, the Korean army was disorganizationed by Japan. In 1909, he decided to start the independence movement. After Japan-Korea Annexation Treaty, fled to Manchuria and Primorsky Krai, and settled in West Jiandao. He joined Shinheung Military Academy. He worked there as an instructor and he trained many independence activists. At the same time he graduated Imperial Japanese Army Academy and worked there. He met Ji Cheong-cheon and Kim Gyeong-chun at Manchuria. These three men decided to have names which includes '天'(means 'sky' in Chinese). Shin Pal-gyun's artificial name was Shin Dong-chun. In 1920, he went to South Manchuria and participated in independence movement organisation. He used to fight against Japanese police in North Pyongan. In 1924, when he was doing the outdoor discipline, he was assassinated by a Chinese mounted bandit who was employed by Japanese force. References 1882 births 1924 deaths Korean independence activists People from Seoul Imperial Korean military personnel 19th-century Korean people 20th-century Korean people Pyongsan Shin clan
is a sports arena in Bunkyo, Tokyo, Japan, which has hosted boxing, professional wrestling, kickboxing, mixed martial arts and Lethwei matches. History On April 16, 1962, the Korakuen Hall was officially opened with a capacity of approximately 2,000 people. It is located inside the Tokyo Dome City, one of Tokyo's biggest attractions. The venue hosted the boxing events for the 1964 Summer Olympics. In March 2011, as the hall suffered structural damage in the Tōhoku earthquake. Events including a World Boxing Council triple female world title fight were postponed or canceled. The repair work was completed on March 18. The Hall was closed until the next day, then gradually resumed a variety of events. On October 27, 2016, the hall became the chosen venue for the International Lethwei Federation Japan. The Lethwei Grand Prix Japan 2016 was the first event of the promotion held at the venue. Tokyo JCB Hall (Korakuen Hall 2) The Tokyo JCB Hall also known Tokyo Dome City Hall is a facility for sports, fashion shows, and live concerts inside the Tokyo Dome City complex, a few minutes walk from the Korakuen Hall. It was announced that a new version of Korakuen Hall would be built in Tokyo Dome City which would act as the Korakuen Hall 2 and it would hold 2,500–3,000 people. The naming rights of the hall were purchased by Japan Credit Bureau (JCB) so it opened as JCB Hall. After the construction completed, the Tokyo Dome Corporation, which owns the original Korakuen Hall as well as the Tokyo Dome, would continue to rent out the original Korakuen Hall, lowering rental prices (currently it costs 1,500,000 Yen to rent) to allowing smaller promotions to use the building on a regular basis. Although most of the sporting events take place at the Tokyo Dome, the JCB Hall is considered one of the primary spots in Tokyo Dome City for smaller scale sporting events, like boxing, pro-wrestling, Lethwei and mixed martial arts. The JCB Hall hosted Miss International Japan. Since its completion, JCB Hall has been host of Lethwei in Japan 4, and has been rarely used for pro wrestling events after the Pro Wrestling Zero1 show in early 2008. During 2009, JCB Hall was used twice for pro wrestling, both times for a tour ending show by Pro Wrestling Noah. References External links 1964 Summer Olympics official report. Volume 1. Part 1. pp. 128–9. Venues of the 1964 Summer Olympics Indoor arenas in Japan Sports venues in Tokyo Boxing venues in Japan Lethwei venues in Japan Olympic boxing venues Television studios Buildings and structures in Bunkyō Sports venues completed in 1962 1962 establishments in Japan
Fructolysis refers to the metabolism of fructose from dietary sources. Though the metabolism of glucose through glycolysis uses many of the same enzymes and intermediate structures as those in fructolysis, the two sugars have very different metabolic fates in human metabolism. Unlike glucose, which is directly metabolized widely in the body, fructose is almost entirely metabolized in the liver in humans, where it is directed toward replenishment of liver glycogen and triglyceride synthesis. Under one percent of ingested fructose is directly converted to plasma triglyceride. 29% - 54% of fructose is converted in liver to glucose, and about a quarter of fructose is converted to lactate. 15% - 18% is converted to glycogen. Glucose and lactate are then used normally as energy to fuel cells all over the body. Fructose is a dietary monosaccharide present naturally in fruits and vegetables, either as free fructose or as part of the disaccharide sucrose, and as its polymer inulin. It is also present in the form of refined sugars including granulated sugars (white crystalline table sugar, brown sugar, confectioner's sugar, and turbinado sugar), refined crystalline fructose , as high fructose corn syrups as well as in honey. About 10% of the calories contained in the Western diet are supplied by fructose (approximately 55 g/day). Unlike glucose, fructose is not an insulin secretagogue, and can in fact lower circulating insulin. In addition to the liver, fructose is metabolized in the intestines, testis, kidney, skeletal muscle, fat tissue and brain, but it is not transported into cells via insulin-sensitive pathways (insulin regulated transporters GLUT1 and GLUT4). Instead, fructose is taken in by GLUT5. Fructose in muscles and adipose tissue is phosphorylated by hexokinase. Fructolysis and glycolysis are independent pathways Although the metabolism of fructose and glucose share many of the same intermediate structures, they have very different metabolic fates in human metabolism. Fructose is metabolized almost completely in the liver in humans, and is directed toward replenishment of liver glycogen and triglyceride synthesis, while much of dietary glucose passes through the liver and goes to skeletal muscle, where it is metabolized to CO2, H2O and ATP, and to fat cells where it is metabolized primarily to glycerol phosphate for triglyceride synthesis as well as energy production. The products of fructose metabolism are liver glycogen and de novo lipogenesis of fatty acids and eventual synthesis of endogenous triglyceride. This synthesis can be divided into two main phases: The first phase is the synthesis of the trioses, dihydroxyacetone (DHAP) and glyceraldehyde; the second phase is the subsequent metabolism of these trioses either in the gluconeogenic pathway for glycogen replenishment and/or the complete metabolism in the fructolytic pathway to pyruvate, which enters the Krebs cycle, is converted to citrate and subsequently directed toward de novo synthesis of the free fatty acid palmitate. The metabolism of fructose to DHAP and glyceraldehyde The first step in the metabolism of fructose is the phosphorylation of fructose to fructose 1-phosphate by fructokinase (Km = 0.5 mM, ≈ 9 mg/100 ml), thus trapping fructose for metabolism in the liver. Hexokinase IV (Glucokinase), also occurs in the liver and would be capable of phosphorylating fructose to fructose 6-phosphate (an intermediate in the gluconeogenic pathway); however, it has a relatively high Km (12 mM) for fructose and, therefore, essentially all of the fructose is converted to fructose-1-phosphate in the human liver. Much of the glucose, on the other hand, is not phosphorylated (Km of hepatic glucokinase (hexokinase IV) = 10 mM), passes through the liver directed toward peripheral tissues, and is taken up by the insulin-dependent glucose transporter, GLUT 4, present on adipose tissue and skeletal muscle. Fructose-1-phosphate then undergoes hydrolysis by fructose-1-phosphate aldolase (aldolase B) to form dihydroxyacetone phosphate (DHAP) and glyceraldehyde; DHAP can either be isomerized to glyceraldehyde 3-phosphate by triosephosphate isomerase or undergo reduction to glycerol 3-phosphate by glycerol 3-phosphate dehydrogenase. The glyceraldehyde produced may also be converted to glyceraldehyde 3-phosphate by glyceraldehyde kinase or converted to glycerol 3-phosphate by glyceraldehyde 3-phosphate dehydrogenase. The metabolism of fructose at this point yields intermediates in gluconeogenic pathway leading to glycogen synthesis, or can be oxidized to pyruvate and reduced to lactate, or be decarboxylated to acetyl CoA in the mitochondria and directed toward the synthesis of free fatty acid, resulting finally in triglyceride synthesis. Synthesis of glycogen from DHAP and glyceraldehyde-3-phosphate The synthesis of glycogen in the liver following a fructose-containing meal proceeds from gluconeogenic precursors. Fructose is initially converted to DHAP and glyceraldehyde by fructokinase and aldolase B. The resultant glyceraldehyde then undergoes phosphorylation to glyceraldehyde-3-phosphate. Increased concentrations of DHAP and glyceraldehyde-3-phosphate in the liver drive the gluconeogenic pathway toward glucose-6-phosphate, glucose-1-phosphate and glycogen formation. It appears that fructose is a better substrate for glycogen synthesis than glucose and that glycogen replenishment takes precedence over triglyceride formation. Once liver glycogen is replenished, the intermediates of fructose metabolism are primarily directed toward triglyceride synthesis. Synthesis of triglyceride from DHAP and glyceraldehyde-3-phosphate Carbons from dietary fructose are found in both the FFA and glycerol moieties of plasma triglycerides (TG). Excess dietary fructose can be converted to pyruvate, enter the Krebs cycle and emerges as citrate directed toward free fatty acid synthesis in the cytosol of hepatocytes. The DHAP formed during fructolysis can also be converted to glycerol and then glycerol 3-phosphate for TG synthesis. Thus, fructose can provide trioses for both the glycerol 3-phosphate backbone, as well as the free fatty acids in TG synthesis. Indeed, fructose may provide the bulk of the carbohydrate directed toward de novo TG synthesis in humans. Fructose induces hepatic lipogenic enzymes Fructose consumption results in the insulin-independent induction of several important hepatic lipogenic enzymes including pyruvate kinase, NADP+-dependent malate dehydrogenase, citrate lyase, acetyl CoA carboxylase, fatty acid synthase, as well as pyruvate dehydrogenase. Although not a consistent finding among metabolic feeding studies, diets high in refined fructose have been shown to lead to hypertriglyceridemia in a wide range of populations including individuals with normal glucose metabolism as well as individuals with impaired glucose tolerance, diabetes, hypertriglyceridemia, and hypertension. The hypertriglyceridemic effects observed are a hallmark of increased dietary carbohydrate, and fructose appears to be dependent on a number of factors including the amount of dietary fructose consumed and degree of insulin resistance. ‡ = Mean ± SEM activity in nmol/min per mg protein § = 12 rats/group * = Significantly different from control at p < 0.05 Abnormalities in fructose metabolism The lack of two important enzymes in fructose metabolism results in the development of two inborn errors in carbohydrate metabolism – essential fructosuria and hereditary fructose intolerance. In addition, reduced phosphorylation potential within hepatocytes can occur with intravenous infusion of fructose. Inborn errors in fructose metabolism Essential fructosuria The absence of fructokinase results in the inability to phosphorylate fructose to fructose-1-phosphate within the cell. As a result, fructose is neither trapped within the cell nor directed toward its metabolism. Free fructose concentrations in the liver increase and fructose is free to leave the cell and enter plasma. This results in an increase in plasma concentration of fructose, eventually exceeding the kidneys' threshold for fructose reabsorption resulting in the appearance of fructose in the urine. Essential fructosuria is a benign asymptomatic condition. Hereditary fructose intolerance The absence of fructose-1-phosphate aldolase (aldolase B) results in the accumulation of fructose 1 phosphate in hepatocytes, kidney and small intestines. An accumulation of fructose-1-phosphate following fructose ingestion inhibits glycogenolysis (breakdown of glycogen) and gluconeogenesis, resulting in severe hypoglycemia. It is symptomatic resulting in severe hypoglycemia, abdominal pain, vomiting, hemorrhage, jaundice, hepatomegaly, and hyperuricemia eventually leading to liver and/or kidney failure and death. The incidence varies throughout the world, but it is estimated at 1:55,000 (range 1:10,000 to 1:100,000) live births. Reduced phosphorylation potential Intravenous (i.v.) infusion of fructose has been shown to lower phosphorylation potential in liver cells by trapping inorganic phosphate (Pi) as fructose 1-phosphate. The fructokinase reaction occurs quite rapidly in hepatocytes trapping fructose in cells by phosphorylation. On the other hand, the splitting of fructose 1 phosphate to DHAP and glyceraldehyde by Aldolase B is relatively slow. Therefore, fructose-1-phosphate accumulates with the corresponding reduction of intracellular Pi available for phosphorylation reactions in the cell. This is why fructose is contraindicated for total parenteral nutrition (TPN) solutions and is never given intravenously as a source of carbohydrate. It has been suggested that excessive dietary intake of fructose may also result in reduced phosphorylation potential. However, this is still a contentious issue. Dietary fructose is not well absorbed and increased dietary intake often results in malabsorption. Whether or not sufficient amounts of dietary fructose could be absorbed to cause a significant reduction in phosphorylating potential in liver cells remains questionable and there are no clear examples of this in the literature. References External links The Entry of Fructose and Galactose into Glycolysis, Chapter 16.1.11. Biochemistry, 5th edition, Jeremy M Berg, John L Tymoczko, and Lubert Stryer, New York: W H Freeman; 2002. Biochemistry Carbohydrates Cellular respiration Metabolic pathways
```objective-c /* * * This program is free software; you can redistribute it and/or modify * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA / #ifndef __PJSIP_SIP_TRANSPORT_H__ #define __PJSIP_SIP_TRANSPORT_H__ /* * @file sip_transport.h * @brief SIP Transport / #include <pjsip/sip_msg.h> #include <pjsip/sip_parser.h> #include <pjsip/sip_resolve.h> #include <pj/sock.h> #include <pj/list.h> #include <pj/ioqueue.h> #include <pj/timer.h> PJ_BEGIN_DECL /* * @defgroup PJSIP_TRANSPORT Transport * @ingroup PJSIP_CORE * @brief This is the transport framework. * * The transport framework is fully extensible. Please see * <A HREF="/docs.htm">PJSIP Developer's Guide</A> PDF * document for more information. * * Application MUST register at least one transport to PJSIP before any * messages can be sent or received. Please see @ref PJSIP_TRANSPORT_UDP * on how to create/register UDP transport to the transport framework. * * @{ / /**************************************************************************** * * GENERAL TRANSPORT (NAMES, TYPES, ETC.) * ****************************************************************************/ / * Forward declaration for transport factory (since it is referenced by * the transport factory itself). / typedef struct pjsip_tpfactory pjsip_tpfactory; /* * Flags for SIP transports. / enum pjsip_transport_flags_e { PJSIP_TRANSPORT_RELIABLE = 1, /< Transport is reliable. / PJSIP_TRANSPORT_SECURE = 2, /*< Transport is secure. / PJSIP_TRANSPORT_DATAGRAM = 4 /*< Datagram based transport. (it's also assumed to be connectionless) / }; /** * Check if transport tp is reliable. / #define PJSIP_TRANSPORT_IS_RELIABLE(tp) \ ((tp)->flag & PJSIP_TRANSPORT_RELIABLE) /* * Check if transport tp is secure. / #define PJSIP_TRANSPORT_IS_SECURE(tp) \ ((tp)->flag & PJSIP_TRANSPORT_SECURE) /* * Register new transport type to PJSIP. The PJSIP transport framework * contains the info for some standard transports, as declared by * #pjsip_transport_type_e. Application may use non-standard transport * with PJSIP, but before it does so, it must register the information * about the new transport type to PJSIP by calling this function. * * @param tp_flag The flags describing characteristics of this * transport type. * @param tp_name Transport type name. * @param def_port Default port to be used for the transport. * @param p_tp_type On successful registration, it will be filled with * the registered type. This argument is optional. * * @return PJ_SUCCESS if registration is successful, or * PJSIP_ETYPEEXISTS if the same transport type has * already been registered. / PJ_DECL(pj_status_t) pjsip_transport_register_type(unsigned tp_flag, const char tp_name, int def_port, int p_tp_type); /* * Get the transport type from the transport name. * * @param name Transport name, such as "TCP", or "UDP". * * @return The transport type, or PJSIP_TRANSPORT_UNSPECIFIED if * the name is not recognized as the name of supported * transport. / PJ_DECL(pjsip_transport_type_e) pjsip_transport_get_type_from_name(const pj_str_t name); /** * Get the first transport type that has the specified flags. * * @param flag The transport flag. * * @return Transport type. / PJ_DECL(pjsip_transport_type_e) pjsip_transport_get_type_from_flag(unsigned flag); /* * Get the socket address family of a given transport type. * * @param type Transport type. * * @return Transport type. / PJ_DECL(int) pjsip_transport_type_get_af(pjsip_transport_type_e type); /* * Get transport flag from type. * * @param type Transport type. * * @return Transport flags. / PJ_DECL(unsigned) pjsip_transport_get_flag_from_type( pjsip_transport_type_e type ); /* * Get the default SIP port number for the specified type. * * @param type Transport type. * * @return The port number, which is the default SIP port number for * the specified type. / PJ_DECL(int) pjsip_transport_get_default_port_for_type(pjsip_transport_type_e type); /* * Get transport type name. * * @param t Transport type. * * @return Transport name. / PJ_DECL(const char) pjsip_transport_get_type_name(pjsip_transport_type_e t); /** * Get longer description for the specified transport type. * * @param t Transport type. * * @return Transport description. / PJ_DECL(const char) pjsip_transport_get_type_desc(pjsip_transport_type_e t); /***************************************************************************** * * TRANSPORT SELECTOR. * ***************************************************************************/ / * This structure describes the type of data in pjsip_tpselector. / typedef enum pjsip_tpselector_type { /* Transport is not specified. / PJSIP_TPSELECTOR_NONE, /* Use the specific transport to send request. / PJSIP_TPSELECTOR_TRANSPORT, /* Use the specific listener to send request. / PJSIP_TPSELECTOR_LISTENER, /* Use the IP version criteria to send request. / PJSIP_TPSELECTOR_IP_VER, } pjsip_tpselector_type; /* * This enumerator describes the IP version criteria for pjsip_tpselector. / typedef enum pjsip_tpselector_ip_ver { /* IPv4 only. / PJSIP_TPSELECTOR_USE_IPV4_ONLY, /* * No preference. IP version used will depend on the order of addresses * returned by pjsip_resolver. / PJSIP_TPSELECTOR_NO_PREFERENCE, /* IPv4 is preferred. / PJSIP_TPSELECTOR_PREFER_IPV4, /* IPv6 is preferred. / PJSIP_TPSELECTOR_PREFER_IPV6, /* IPv6 only. / PJSIP_TPSELECTOR_USE_IPV6_ONLY } pjsip_tpselector_ip_ver; /* * This structure describes the transport/listener preference to be used * when sending outgoing requests. * * Normally transport will be selected automatically according to rules about * sending requests. But some applications (such as proxies or B2BUAs) may * want to explicitly use specific transport to send requests, for example * when they want to make sure that outgoing request should go from a specific * network interface. * * The pjsip_tpselector structure is used for that purpose, i.e. to allow * application specificly request that a particular transport/listener * should be used to send request. This structure is used when calling * pjsip_tsx_set_transport() and pjsip_dlg_set_transport(). * * If application disables connection reuse and wants to force creating * a new transport, it needs to consider the following couple of things: * - If it still wants to reuse an existing transport (if any), it * needs to keep a reference to that transport and specifically set * the transport to be used for sending requests. * - Delete those existing transports manually when no longer needed. / typedef struct pjsip_tpselector { /* The type of data in the union / pjsip_tpselector_type type; /* * Whether to disable reuse of an existing connection. * This setting will be ignored if (type == PJSIP_TPSELECTOR_TRANSPORT) * and transport in the union below is set. / pj_bool_t disable_connection_reuse; /* * Union representing the transport/listener/IP version criteria * to be used. / union { pjsip_transport transport; pjsip_tpfactory listener; pjsip_tpselector_ip_ver ip_ver; void ptr; } u; } pjsip_tpselector; /** * Add transport/listener reference in the selector to prevent the specified * transport/listener from being destroyed while application still has * reference to it. * * @param sel The transport selector. / PJ_DECL(void) pjsip_tpselector_add_ref(pjsip_tpselector sel); /** * Decrement transport/listener reference in the selector. * @param sel The transport selector / PJ_DECL(void) pjsip_tpselector_dec_ref(pjsip_tpselector sel); /***************************************************************************** * * RECEIVE DATA BUFFER. * ***************************************************************************/ / * A customized ioqueue async operation key which is used by transport * to locate rdata when a pending read operation completes. / typedef struct pjsip_rx_data_op_key { pj_ioqueue_op_key_t op_key; /< ioqueue op_key. / pjsip_rx_data rdata; /< rdata associated with this / } pjsip_rx_data_op_key; /** * Incoming message buffer. * This structure keep all the information regarding the received message. This * buffer lifetime is only very short, normally after the transaction has been * called, this buffer will be deleted/recycled. So care must be taken when * allocating storage from the pool of this buffer. / struct pjsip_rx_data { /* * tp_info is part of rdata that remains static for the duration of the * buffer. It is initialized when the buffer was created by transport. / struct { /* Memory pool for this buffer. / pj_pool_t pool; /** The transport object which received this packet. / pjsip_transport transport; /** Other transport specific data to be attached to this buffer. / void tp_data; /** Ioqueue key. / pjsip_rx_data_op_key op_key; } tp_info; /* * pkt_info is initialized by transport when it receives an incoming * packet. / struct { /* Time when the message was received. / pj_time_val timestamp; /* Pointer to the original packet. / char packet[PJSIP_MAX_PKT_LEN]; /* Zero termination for the packet. / pj_uint32_t zero; /* The length of the packet received. / pj_ssize_t len; /* The source address from which the packet was received. / pj_sockaddr src_addr; /* The length of the source address. / int src_addr_len; /* The IP source address string (NULL terminated). / char src_name[PJ_INET6_ADDRSTRLEN]; /* The IP source port number. / int src_port; } pkt_info; /* * msg_info is initialized by transport mgr (tpmgr) before this buffer * is passed to endpoint. / struct { /* Start of msg buffer. / char msg_buf; /** Length fo message. / int len; /* The parsed message, if any. / pjsip_msg msg; /** Short description about the message. * Application should use #pjsip_rx_data_get_info() instead. / char info; /** The Call-ID header as found in the message. / pjsip_cid_hdr cid; /** The From header as found in the message. / pjsip_from_hdr from; /** The To header as found in the message. / pjsip_to_hdr to; /** The topmost Via header as found in the message. / pjsip_via_hdr via; /** The CSeq header as found in the message. / pjsip_cseq_hdr cseq; /** Max forwards header. / pjsip_max_fwd_hdr max_fwd; /** The first route header. / pjsip_route_hdr route; /** The first record-route header. / pjsip_rr_hdr record_route; /** Content-type header. / pjsip_ctype_hdr ctype; /** Content-length header. / pjsip_clen_hdr clen; /** "Require" header containing aggregates of all Require * headers found in the message, or NULL. / pjsip_require_hdr require; /** "Supported" header containing aggregates of all Supported * headers found in the message, or NULL. / pjsip_supported_hdr supported; /** The list of error generated by the parser when parsing this message. / pjsip_parser_err_report parse_err; } msg_info; /* * endpt_info is initialized by endpoint after this buffer reaches * endpoint. / struct { /* * Data attached by modules to this message. / void mod_data[PJSIP_MAX_MODULE]; } endpt_info; }; /** * Get printable information about the message in the rdata. * * @param rdata The receive data buffer. * * @return Printable information. / PJ_DECL(char) pjsip_rx_data_get_info(pjsip_rx_data rdata); /* * Clone pjsip_rx_data. This will duplicate the contents of * pjsip_rx_data and add reference count to the transport. * Once application has finished using the cloned pjsip_rx_data, * it must release it by calling #pjsip_rx_data_free_cloned(). * * By default (if flags is set to zero), this function copies the * transport pointer in \a tp_info, duplicates the \a pkt_info, * perform deep clone of the \a msg_info parts of the rdata, and * fills the \a endpt_info (i.e. the \a mod_data) with zeros. * * @param src The source to be cloned. * @param flags Optional flags. Must be zero for now. * @param p_rdata Pointer to receive the cloned rdata. * * @return PJ_SUCCESS on success or the appropriate error. / PJ_DECL(pj_status_t) pjsip_rx_data_clone(const pjsip_rx_data src, unsigned flags, pjsip_rx_data p_rdata); / * Free cloned pjsip_rx_data. This function must be and must only * be called for a cloned pjsip_rx_data. Specifically, it must NOT * be called for the original pjsip_rx_data that is returned by * transports. * * This function will free the memory used by the pjsip_rx_data and * decrement the transport reference counter. * * @param rdata The receive data buffer. * * @return PJ_SUCCESS on success or the appropriate error. / PJ_DECL(pj_status_t) pjsip_rx_data_free_cloned(pjsip_rx_data rdata); /***************************************************************************** * * TRANSMIT DATA BUFFER MANIPULATION. * ***************************************************************************/ / Customized ioqueue async operation key, used by transport to keep * callback parameters. / typedef struct pjsip_tx_data_op_key { /* ioqueue pending operation key. / pj_ioqueue_op_key_t key; /* Transmit data associated with this key. / pjsip_tx_data tdata; /** Arbitrary token (attached by transport) / void token; /** Callback to be called when pending transmit operation has completed. / void (callback)(pjsip_transport,void,pj_ssize_t); } pjsip_tx_data_op_key; /** * Data structure for sending outgoing message. Application normally creates * this buffer by calling #pjsip_endpt_create_tdata. * * The lifetime of this buffer is controlled by the reference counter in this * structure, which is manipulated by calling #pjsip_tx_data_add_ref and * #pjsip_tx_data_dec_ref. When the reference counter has reached zero, then * this buffer will be destroyed. * * A transaction object normally will add reference counter to this buffer * when application calls #pjsip_tsx_send_msg, because it needs to keep the * message for retransmission. The transaction will release the reference * counter once its state has reached final state. / struct pjsip_tx_data { /* This is for transmission queue; it's managed by transports. / PJ_DECL_LIST_MEMBER(struct pjsip_tx_data); /* Memory pool for this buffer. / pj_pool_t pool; /** A name to identify this buffer. / char obj_name[PJ_MAX_OBJ_NAME]; /* Short information describing this buffer and the message in it. * Application should use #pjsip_tx_data_get_info() instead of * directly accessing this member. / char info; /** For response message, this contains the reference to timestamp when * the original request message was received. The value of this field * is set when application creates response message to a request by * calling #pjsip_endpt_create_response. / pj_time_val rx_timestamp; /* The transport manager for this buffer. / pjsip_tpmgr mgr; /** Ioqueue asynchronous operation key. / pjsip_tx_data_op_key op_key; /* Lock object. / pj_lock_t lock; /** The message in this buffer. / pjsip_msg msg; /** Strict route header saved by #pjsip_process_route_set(), to be * restored by #pjsip_restore_strict_route_set(). / pjsip_route_hdr saved_strict_route; /** Buffer to the printed text representation of the message. When the * content of this buffer is set, then the transport will send the content * of this buffer instead of re-printing the message structure. If the * message structure has changed, then application must invalidate this * buffer by calling #pjsip_tx_data_invalidate_msg. / pjsip_buffer buf; /* Reference counter. / pj_atomic_t ref_cnt; /** Being processed by transport? / int is_pending; /* Transport manager internal. / void token; /** Callback to be called when this tx_data has been transmitted. / void (cb)(void, pjsip_tx_data, pj_ssize_t); /** Destination information, to be used to determine the network address * of the message. For a request, this information is initialized when * the request is sent with #pjsip_endpt_send_request_stateless() and * network address is resolved. For CANCEL request, this information * will be copied from the original INVITE to make sure that the CANCEL * request goes to the same physical network address as the INVITE * request. / struct { /* Server name. / pj_str_t name; /* Server addresses resolved. / pjsip_server_addresses addr; /* Current server address being tried. / unsigned cur_addr; } dest_info; /* Transport information, only valid during on_tx_request() and * on_tx_response() callback. / struct { pjsip_transport transport; /*< Transport being used. / pj_sockaddr dst_addr; /*< Destination address. / int dst_addr_len; /*< Length of address. / char dst_name[PJ_INET6_ADDRSTRLEN]; /*< Destination address. / int dst_port; /*< Destination port. / } tp_info; /** * Transport selector, to specify which transport to be used. * The value here must be set with pjsip_tx_data_set_transport(), * to allow reference counter to be set properly. / pjsip_tpselector tp_sel; /* * Special flag to indicate that this transmit data is a request that has * been updated with proper authentication response and is ready to be * sent for retry. / pj_bool_t auth_retry; /* * Arbitrary data attached by PJSIP modules. / void mod_data[PJSIP_MAX_MODULE]; /** * If via_addr is set, it will be used as the "sent-by" field of the * Via header for outgoing requests as long as the request uses via_tp * transport. Normally application should not use or access these fields. / pjsip_host_port via_addr; /< Via address. / const void via_tp; /< Via transport. / }; /** * Create a new, blank transmit buffer. The reference count is initialized * to zero. * * @param mgr The transport manager. * @param tdata Pointer to receive transmit data. * * @return PJ_SUCCESS, or the appropriate error code. * * @see pjsip_endpt_create_tdata / PJ_DECL(pj_status_t) pjsip_tx_data_create( pjsip_tpmgr mgr, pjsip_tx_data tdata ); / * Add reference counter to the transmit buffer. The reference counter controls * the life time of the buffer, ie. when the counter reaches zero, then it * will be destroyed. * * @param tdata The transmit buffer. / PJ_DECL(void) pjsip_tx_data_add_ref( pjsip_tx_data tdata ); /** * Decrement reference counter of the transmit buffer. * When the transmit buffer is no longer used, it will be destroyed and * caller is informed with PJSIP_EBUFDESTROYED return status. * * @param tdata The transmit buffer data. * @return This function will always succeeded eventhough the return * status is non-zero. A status PJSIP_EBUFDESTROYED will be * returned to inform that buffer is destroyed. / PJ_DECL(pj_status_t) pjsip_tx_data_dec_ref( pjsip_tx_data tdata ); /** * Print the SIP message to transmit data buffer's internal buffer. This * may allocate memory for the buffer, if the buffer has not been allocated * yet, and encode the SIP message to that buffer. * * @param tdata The transmit buffer. * * @return PJ_SUCCESS on success of the appropriate error code. / PJ_DECL(pj_status_t) pjsip_tx_data_encode(pjsip_tx_data tdata); /** * Check if transmit data buffer contains a valid message. * * @param tdata The transmit buffer. * @return Non-zero (PJ_TRUE) if buffer contains a valid message. / PJ_DECL(pj_bool_t) pjsip_tx_data_is_valid( pjsip_tx_data tdata ); /** * Invalidate the print buffer to force message to be re-printed. Call * when the message has changed after it has been printed to buffer. The * message is printed to buffer normally by transport when it is about to be * sent to the wire. Subsequent sending of the message will not cause * the message to be re-printed, unless application invalidates the buffer * by calling this function. * * @param tdata The transmit buffer. / PJ_DECL(void) pjsip_tx_data_invalidate_msg( pjsip_tx_data tdata ); /** * Get short printable info about the transmit data. This will normally return * short information about the message. * * @param tdata The transmit buffer. * * @return Null terminated info string. / PJ_DECL(char) pjsip_tx_data_get_info( pjsip_tx_data tdata ); /* * Set the explicit transport to be used when sending this transmit data. * Application should not need to call this function, but rather use * pjsip_tsx_set_transport() and pjsip_dlg_set_transport() instead (which * will call this function). * * @param tdata The transmit buffer. * @param sel Transport selector. * * @return PJ_SUCCESS on success. / PJ_DECL(pj_status_t) pjsip_tx_data_set_transport(pjsip_tx_data tdata, const pjsip_tpselector sel); /* * Clone pjsip_tx_data. This will duplicate the message contents of * pjsip_tx_data (pjsip_tx_data.msg) and add reference count to the tdata. * Once application has finished using the cloned pjsip_tx_data, * it must release it by calling #pjsip_tx_data_dec_ref(). * Currently, this will only clone response message. * * @param src The source to be cloned. * @param flags Optional flags. Must be zero for now. * @param p_rdata Pointer to receive the cloned tdata. * * @return PJ_SUCCESS on success or the appropriate error. / PJ_DECL(pj_status_t) pjsip_tx_data_clone(const pjsip_tx_data src, unsigned flags, pjsip_tx_data p_rdata); /*************************************************************************** * * TRANSPORT * ***************************************************************************/ / * Type of callback to receive transport operation status. / typedef void (pjsip_transport_callback)(pjsip_transport tp, void token, pj_ssize_t sent_bytes); /** * This structure describes transport key to be registered to hash table. / typedef struct pjsip_transport_key { /* * Transport type. / long type; /* * Destination address. / pj_sockaddr rem_addr; } pjsip_transport_key; /* * Enumeration of transport direction types. / typedef enum pjsip_transport_dir { PJSIP_TP_DIR_NONE, /< Direction not set, normally used by connectionless transports such as UDP transport. / PJSIP_TP_DIR_OUTGOING, /*< Outgoing connection or client mode, this is only for connection-oriented transports. / PJSIP_TP_DIR_INCOMING, /*< Incoming connection or server mode, this is only for connection-oriented transports. / } pjsip_transport_dir; /** * This structure represent the "public" interface of a SIP transport. * Applications normally extend this structure to include transport * specific members. / struct pjsip_transport { char obj_name[PJ_MAX_OBJ_NAME]; /< Name. / pj_pool_t pool; /< Pool used by transport. / pj_atomic_t ref_cnt; /< Reference counter. / pj_lock_t lock; /< Lock object. / pj_grp_lock_t grp_lock; /< Group lock for sync with ioqueue and timer. / pj_bool_t tracing; /*< Tracing enabled? / pj_bool_t is_shutdown; /*< Being shutdown? / pj_bool_t is_destroying; /*< Destroy in progress? / /** Key for indexing this transport in hash table. / pjsip_transport_key key; char type_name; /*< Type name. / unsigned flag; /*< #pjsip_transport_flags_e / char info; /< Transport info/description./ int addr_len; /*< Length of addresses. / pj_sockaddr local_addr; /*< Bound address. / pjsip_host_port local_name; /*< Published name (eg. STUN). / pjsip_host_port remote_name; /*< Remote address name. / pjsip_transport_dir dir; /*< Connection direction. / pjsip_endpoint endpt; /< Endpoint instance. / pjsip_tpmgr tpmgr; /< Transport manager. / pjsip_tpfactory factory; /< Factory instance. Note: it may be invalid/shutdown. / pj_timer_entry idle_timer; /*< Timer when ref cnt is zero./ pj_timestamp last_recv_ts; /*< Last time receiving data. / pj_size_t last_recv_len; /*< Last received data length. / void data; /< Internal transport data. / unsigned initial_timeout;/*< Initial timeout interval to be applied to incoming TCP/TLS transports when no valid data received after a successful connection. / /** * Function to be called by transport manager to send SIP message. * * @param transport The transport to send the message. * @param packet The buffer to send. * @param length The length of the buffer to send. * @param op_key Completion token, which will be supplied to * caller when pending send operation completes. * @param rem_addr The remote destination address. * @param addr_len Size of remote address. * @param callback If supplied, the callback will be called * once a pending transmission has completed. If * the function completes immediately (i.e. return * code is not PJ_EPENDING), the callback will not * be called. * * @return Should return PJ_SUCCESS only if data has been * succesfully queued to operating system for * transmission. Otherwise it may return PJ_EPENDING * if the underlying transport can not send the * data immediately and will send it later, which in * this case caller doesn't have to do anything * except wait the calback to be called, if it * supplies one. * Other return values indicate the error code. / pj_status_t (send_msg)(pjsip_transport transport, pjsip_tx_data tdata, const pj_sockaddr_t rem_addr, int addr_len, void token, pjsip_transport_callback callback); /** * Instruct the transport to initiate graceful shutdown procedure. * After all objects release their reference to this transport, * the transport will be deleted. * * Note that application MUST use #pjsip_transport_shutdown() instead. * * @param transport The transport. * * @return PJ_SUCCESS on success. / pj_status_t (do_shutdown)(pjsip_transport transport); /* * Forcefully destroy this transport regardless whether there are * objects that currently use this transport. This function should only * be called by transport manager or other internal objects (such as the * transport itself) who know what they're doing. Application should use * #pjsip_transport_shutdown() instead. * * @param transport The transport. * * @return PJ_SUCCESS on success. / pj_status_t (destroy)(pjsip_transport transport); / * Application may extend this structure.. / }; /* * Register a transport instance to the transport manager. This function * is normally called by the transport instance when it is created * by application. * * @param mgr The transport manager. * @param tp The new transport to be registered. * * @return PJ_SUCCESS on success. / PJ_DECL(pj_status_t) pjsip_transport_register( pjsip_tpmgr mgr, pjsip_transport tp ); /* * Start graceful shutdown procedure for this transport. After graceful * shutdown has been initiated, no new reference can be obtained for * the transport. However, existing objects that currently uses the * transport may still use this transport to send and receive packets. * * After all objects release their reference to this transport, * the transport will be destroyed immediately. * * @param tp The transport. * * @return PJ_SUCCESS on success. / PJ_DECL(pj_status_t) pjsip_transport_shutdown(pjsip_transport tp); /** * Start shutdown procedure for this transport. If \a force is false, * the API is the same as #pjsip_transport_shutdown(), while * if \a force is true, existing transport users will immediately * receive PJSIP_TP_STATE_DISCONNECTED notification and should not * use the transport anymore. In either case, transport will * only be destroyed after all objects release their references. * * @param tp The transport. * @param force Force transport to immediately send * disconnection state notification. * * @return PJ_SUCCESS on success. / PJ_DECL(pj_status_t) pjsip_transport_shutdown2(pjsip_transport tp, pj_bool_t force); /** * Destroy a transport when there is no object currently uses the transport. * This function is normally called internally by transport manager or the * transport itself. Application should use #pjsip_transport_shutdown() * instead. * * @param tp The transport instance. * * @return PJ_SUCCESS on success or the appropriate error code. * Some of possible errors are PJSIP_EBUSY if the * transport's reference counter is not zero. / PJ_DECL(pj_status_t) pjsip_transport_destroy( pjsip_transport tp); /** * Add reference counter to the specified transport. Any objects that wishes * to keep the reference of the transport MUST increment the transport's * reference counter to prevent it from being destroyed. * * @param tp The transport instance. * * @return PJ_SUCCESS on success or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_transport_add_ref( pjsip_transport tp ); /** * Decrement reference counter of the specified transport. When an object no * longer want to keep the reference to the transport, it must decrement the * reference counter. When the reference counter of the transport reaches * zero, the transport manager will start the idle timer to destroy the * transport if no objects acquire the reference counter during the idle * interval. * * @param tp The transport instance. * * @return PJ_SUCCESS on success. / PJ_DECL(pj_status_t) pjsip_transport_dec_ref( pjsip_transport tp ); /** * This function is called by transport instances to report an incoming * packet to the transport manager. The transport manager then would try to * parse all SIP messages in the packet, and for each parsed SIP message, it * would report the message to the SIP endpoint (#pjsip_endpoint). * * @param mgr The transport manager instance. * @param rdata The receive data buffer containing the packet. The * transport MUST fully initialize tp_info and pkt_info * member of the rdata. * * @return The number of bytes successfully processed from the * packet. If the transport is datagram oriented, the * value will be equal to the size of the packet. For * stream oriented transport (e.g. TCP, TLS), the value * returned may be less than the packet size, if * partial message is received. The transport then MUST * keep the remainder part and report it again to * this function once more data/packet is received. / PJ_DECL(pj_ssize_t) pjsip_tpmgr_receive_packet(pjsip_tpmgr mgr, pjsip_rx_data rdata); /**************************************************************************** * * TRANSPORT FACTORY * ***************************************************************************/ / * A transport factory is normally used for connection oriented transports * (such as TCP or TLS) to create instances of transports. It registers * a new transport type to the transport manager, and the transport manager * would ask the factory to create a transport instance when it received * command from application to send a SIP message using the specified * transport type. / struct pjsip_tpfactory { /* This list is managed by transport manager. / PJ_DECL_LIST_MEMBER(struct pjsip_tpfactory); char obj_name[PJ_MAX_OBJ_NAME]; /< Name. / pj_pool_t pool; /< Owned memory pool. / pj_lock_t lock; /< Lock object. / pjsip_transport_type_e type; /*< Transport type. / char type_name; /< Type string name. / unsigned flag; /*< Transport flag. / char info; /< Transport info/description./ pj_sockaddr local_addr; /*< Bound address. / pjsip_host_port addr_name; /*< Published name. / /** * Create new outbound connection suitable for sending SIP message * to specified remote address. * Note that the factory is responsible for both creating the * transport and registering it to the transport manager. / pj_status_t (create_transport)(pjsip_tpfactory factory, pjsip_tpmgr mgr, pjsip_endpoint endpt, const pj_sockaddr rem_addr, int addr_len, pjsip_transport transport); / * Create new outbound connection suitable for sending SIP message * to specified remote address by also considering outgoing SIP * message data. * Note that the factory is responsible for both creating the * transport and registering it to the transport manager. / pj_status_t (create_transport2)(pjsip_tpfactory factory, pjsip_tpmgr mgr, pjsip_endpoint endpt, const pj_sockaddr rem_addr, int addr_len, pjsip_tx_data tdata, pjsip_transport transport); /* * Destroy the listener. / pj_status_t (destroy)(pjsip_tpfactory factory); / * Application may extend this structure.. / }; /* * Register a transport factory. * * @param mgr The transport manager. * @param tpf Transport factory. * * @return PJ_SUCCESS if listener was successfully created. / PJ_DECL(pj_status_t) pjsip_tpmgr_register_tpfactory(pjsip_tpmgr mgr, pjsip_tpfactory tpf); /* * Unregister factory. * * @param mgr The transport manager. * @param tpf Transport factory. * * @return PJ_SUCCESS is sucessfully unregistered. / PJ_DECL(pj_status_t) pjsip_tpmgr_unregister_tpfactory(pjsip_tpmgr mgr, pjsip_tpfactory tpf); /**************************************************************************** * * TRANSPORT MANAGER * ***************************************************************************/ / * Type of callback to be called when transport manager receives incoming * SIP message. * * @param ep Endpoint. * @param status Receiption status. * @param rd Received packet. / typedef void (pjsip_rx_callback)(pjsip_endpoint ep, pj_status_t status, pjsip_rx_data rd); /** * Type of callback to be called before transport manager is about * to transmit SIP message. * * @param ep Endpoint. * @param td Transmit data. / typedef pj_status_t (pjsip_tx_callback)(pjsip_endpoint ep, pjsip_tx_datatd); /** * Create a transport manager. Normally application doesn't need to call * this function directly, since a transport manager will be created and * destroyed automatically by the SIP endpoint. * * @param pool Pool. * @param endpt Endpoint instance. * @param rx_cb Callback to receive incoming message. * @param tx_cb Callback to be called before transport manager is sending * outgoing message. * @param p_mgr Pointer to receive the new transport manager. * * @return PJ_SUCCESS or the appropriate error code on error. / PJ_DECL(pj_status_t) pjsip_tpmgr_create( pj_pool_t pool, pjsip_endpoint * endpt, pjsip_rx_callback rx_cb, pjsip_tx_callback tx_cb, pjsip_tpmgr p_mgr); / * Find out the appropriate local address info (IP address and port) to * advertise in Contact header based on the remote address to be * contacted. The local address info would be the address name of the * transport or listener which will be used to send the request. * * In this implementation, it will only select the transport based on * the transport type in the request. * * @see pjsip_tpmgr_find_local_addr2() * * @param tpmgr The transport manager. * @param pool Pool to allocate memory for the IP address. * @param type Destination address to contact. * @param sel Optional pointer to prefered transport, if any. * @param ip_addr Pointer to receive the IP address. * @param port Pointer to receive the port number. * * @return PJ_SUCCESS, or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_tpmgr_find_local_addr( pjsip_tpmgr tpmgr, pj_pool_t pool, pjsip_transport_type_e type, const pjsip_tpselector sel, pj_str_t ip_addr, int port); /** * Parameter for pjsip_tpmgr_find_local_addr2() function. / typedef struct pjsip_tpmgr_fla2_param { /* * Specify transport type to use. This must be set. / pjsip_transport_type_e tp_type; /* * Optional pointer to preferred transport, if any. / const pjsip_tpselector tp_sel; /** * Destination host, if known. The destination host is needed * if \a local_if field below is set. / pj_str_t dst_host; /* * Specify if the function should return which local interface * to use for the specified destination in \a dst_host. By definition, * the returned address will always be local interface address. / pj_bool_t local_if; /* * The returned address. / pj_str_t ret_addr; /* * The returned port. / pj_uint16_t ret_port; /* * Returned pointer to the transport. Only set if local_if is set. / const void ret_tp; } pjsip_tpmgr_fla2_param; /** * Initialize with default values. * * @param prm The parameter to be initialized. / PJ_DECL(void) pjsip_tpmgr_fla2_param_default(pjsip_tpmgr_fla2_param prm); /** * Find out the appropriate local address info (IP address and port) to * advertise in Contact or Via header header based on the remote address * to be contacted. The local address info would be the address name of the * transport or listener which will be used to send the request. * * @see pjsip_tpmgr_find_local_addr() * * @param tpmgr The transport manager. * @param pool Pool to allocate memory for the IP address. * @param prm Function input and output parameters. * * @return PJ_SUCCESS, or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_tpmgr_find_local_addr2(pjsip_tpmgr tpmgr, pj_pool_t pool, pjsip_tpmgr_fla2_param prm); /** * Return number of transports currently registered to the transport * manager. * * @param mgr The transport manager. * * @return Number of transports. / PJ_DECL(unsigned) pjsip_tpmgr_get_transport_count(pjsip_tpmgr mgr); /** * Destroy a transport manager. Normally application doesn't need to call * this function directly, since a transport manager will be created and * destroyed automatically by the SIP endpoint. * * @param mgr The transport manager. * * @return PJ_SUCCESS on success. / PJ_DECL(pj_status_t) pjsip_tpmgr_destroy(pjsip_tpmgr mgr); /** * Dump transport info and status to log. * * @param mgr The transport manager. / PJ_DECL(void) pjsip_tpmgr_dump_transports(pjsip_tpmgr mgr); /** * Parameter for pjsip_tpmgr_shutdown_all() function. / typedef struct pjsip_tpmgr_shutdown_param { /* * Specify whether disconnection state notification should be sent * immediately, see pjsip_transport_shutdown2() for more info. * * Default: PJ_TRUE. / pj_bool_t force; /* * Specify whether UDP transports should also be shutdown. * * Default: PJ_TRUE. / pj_bool_t include_udp; } pjsip_tpmgr_shutdown_param; /* * Initialize transports shutdown parameter with default values. * * @param prm The parameter to be initialized. / PJ_DECL(void) pjsip_tpmgr_shutdown_param_default( pjsip_tpmgr_shutdown_param prm); /** * Shutdown all transports. This basically invokes pjsip_transport_shutdown2() * on all transports. * * @param mgr The transport manager. * @param param The function parameters. * * @return PJ_SUCCESS on success. / PJ_DECL(pj_status_t) pjsip_tpmgr_shutdown_all( pjsip_tpmgr mgr, const pjsip_tpmgr_shutdown_param param); /**************************************************************************** * * PUBLIC API * ***************************************************************************/ / * Find transport to be used to send message to remote destination. If no * suitable transport is found, a new one will be created. * * This is an internal function since normally application doesn't have access * to transport manager. Application should use pjsip_endpt_acquire_transport() * instead. * * @param mgr The transport manager instance. * @param type The type of transport to be acquired. * @param remote The remote address to send message to. * @param addr_len Length of the remote address. * @param sel Optional pointer to transport selector instance which is * used to find explicit transport, if required. * @param tp Pointer to receive the transport instance, if one is found. * * @return PJ_SUCCESS on success, or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_tpmgr_acquire_transport(pjsip_tpmgr mgr, pjsip_transport_type_e type, const pj_sockaddr_t remote, int addr_len, const pjsip_tpselector sel, pjsip_transport tp); / * Find suitable transport for sending SIP message to specified remote * destination by also considering the outgoing SIP message. If no suitable * transport is found, a new one will be created. * * This is an internal function since normally application doesn't have access * to transport manager. Application should use pjsip_endpt_acquire_transport2() * instead. * * @param mgr The transport manager instance. * @param type The type of transport to be acquired. * @param remote The remote address to send message to. * @param addr_len Length of the remote address. * @param sel Optional pointer to transport selector instance which is * used to find explicit transport, if required. * @param tdata Optional pointer to data to be sent. * @param tp Pointer to receive the transport instance, if one is found. * * @return PJ_SUCCESS on success, or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_tpmgr_acquire_transport2(pjsip_tpmgr mgr, pjsip_transport_type_e type, const pj_sockaddr_t remote, int addr_len, const pjsip_tpselector sel, pjsip_tx_data tdata, pjsip_transport tp); /* * Type of callback to receive notification when message or raw data * has been sent. * * @param token The token that was given when calling the function * to send message or raw data. * @param tdata The transmit buffer used to send the message. * @param bytes_sent Number of bytes sent. On success, the value will be * positive number indicating the number of bytes sent. * On failure, the value will be a negative number of * the error code (i.e. bytes_sent = -status). / typedef void (pjsip_tp_send_callback)(void token, pjsip_tx_data tdata, pj_ssize_t bytes_sent); /** * This is a low-level function to send a SIP message using the specified * transport to the specified destination. * * @param tr The SIP transport to be used. * @param tdata Transmit data buffer containing SIP message. * @param addr Destination address. * @param addr_len Length of destination address. * @param token Arbitrary token to be returned back to callback. * @param cb Optional callback to be called to notify caller about * the completion status of the pending send operation. * * @return If the message has been sent successfully, this function * will return PJ_SUCCESS and the callback will not be * called. If message cannot be sent immediately, this * function will return PJ_EPENDING, and application will * be notified later about the completion via the callback. * Any statuses other than PJ_SUCCESS or PJ_EPENDING * indicates immediate failure, and in this case the * callback will not be called. / PJ_DECL(pj_status_t) pjsip_transport_send( pjsip_transport tr, pjsip_tx_data tdata, const pj_sockaddr_t addr, int addr_len, void token, pjsip_tp_send_callback cb); /* * This is a low-level function to send raw data to a destination. * * See also #pjsip_endpt_send_raw() and #pjsip_endpt_send_raw_to_uri(). * * @param mgr Transport manager. * @param tp_type Transport type. * @param sel Optional pointer to transport selector instance if * application wants to use a specific transport instance * rather then letting transport manager finds the suitable * transport. * @param tdata Optional transmit data buffer to be used. If this value * is NULL, this function will create one internally. If * tdata is specified, this function will decrement the * reference counter upon completion. * @param raw_data The data to be sent. * @param data_len The length of the data. * @param addr Destination address. * @param addr_len Length of destination address. * @param token Arbitrary token to be returned back to callback. * @param cb Optional callback to be called to notify caller about * the completion status of the pending send operation. * * @return If the message has been sent successfully, this function * will return PJ_SUCCESS and the callback will not be * called. If message cannot be sent immediately, this * function will return PJ_EPENDING, and application will * be notified later about the completion via the callback. * Any statuses other than PJ_SUCCESS or PJ_EPENDING * indicates immediate failure, and in this case the * callback will not be called. / PJ_DECL(pj_status_t) pjsip_tpmgr_send_raw(pjsip_tpmgr mgr, pjsip_transport_type_e tp_type, const pjsip_tpselector sel, pjsip_tx_data tdata, const void raw_data, pj_size_t data_len, const pj_sockaddr_t addr, int addr_len, void token, pjsip_tp_send_callback cb); /* * Enumeration of transport state types. / typedef enum pjsip_transport_state { PJSIP_TP_STATE_CONNECTED, /< Transport connected, applicable only to connection-oriented transports such as TCP and TLS. / PJSIP_TP_STATE_DISCONNECTED, /*< Transport disconnected, applicable only to connection-oriented transports such as TCP and TLS. / PJSIP_TP_STATE_SHUTDOWN, /*< Transport shutdown, either due to TCP/TLS disconnect error from the network, or when shutdown is initiated by PJSIP itself. / PJSIP_TP_STATE_DESTROY, /*< Transport destroy, when transport is about to be destroyed. / } pjsip_transport_state; /** * Definition of transport state listener key. / typedef void pjsip_tp_state_listener_key; /* * Structure of transport state info passed by #pjsip_tp_state_callback. / typedef struct pjsip_transport_state_info { /* * The last error code related to the transport state. / pj_status_t status; /* * Optional extended info, the content is specific for each transport type. / void ext_info; /** * Optional user data. In global transport state notification, this will * always be NULL. / void user_data; } pjsip_transport_state_info; /** * Type of callback to receive transport state notifications, such as * transport connected/disconnected. Application may shutdown the transport * in this callback. * * @param tp The transport instance. * @param state The transport state. * @param info The transport state info. / typedef void (pjsip_tp_state_callback)( pjsip_transport tp, pjsip_transport_state state, const pjsip_transport_state_info info); /** * Set callback of global transport state notification. The caller will be * notified whenever the state of any transport is changed. The type of events * are defined in #pjsip_transport_state. * * Note that this function will override the existing callback, if any, so * application is recommended to keep the old callback and manually forward * the notification to the old callback, otherwise other component that * concerns about the transport state will no longer receive transport state * events. * * @param mgr Transport manager. * @param cb Callback to be called to notify caller about transport * state changing. * * @return PJ_SUCCESS on success, or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_tpmgr_set_state_cb(pjsip_tpmgr mgr, pjsip_tp_state_callback cb); /** * Get the callback of global transport state notification. * * @param mgr Transport manager. * * @return The transport state callback or NULL if it is not set. / PJ_DECL(pjsip_tp_state_callback) pjsip_tpmgr_get_state_cb( const pjsip_tpmgr mgr); /** * Add a listener to the specified transport for transport state notification. * * @param tp The transport. * @param cb Callback to be called to notify listener about transport * state changing. * @param user_data The user data. * @param key Output key, used to remove this listener. * * @return PJ_SUCCESS on success, or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_transport_add_state_listener ( pjsip_transport tp, pjsip_tp_state_callback cb, void user_data, pjsip_tp_state_listener_key key); /* * Remove a listener from the specified transport for transport state * notification. * * @param tp The transport. * @param key The listener key. * @param user_data The user data, for validation purpose. * * @return PJ_SUCCESS on success, or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_transport_remove_state_listener ( pjsip_transport tp, pjsip_tp_state_listener_key key, const void user_data); /** * Structure of dropped received data. / typedef struct pjsip_tp_dropped_data { /* * The transport receiving the data. / pjsip_transport tp; /** * The data. / void data; /** * The data length. * If the status field below indicates an invalid SIP message * (PJSIP_EINVALIDMSG) and application detects a SIP message * at position p, it can pass the data back to PJSIP to be processed * by setting the len to p. This can be useful for apps which * wishes to use the same transport for SIP signalling and non-SIP * purposes (such as SIP outbound using STUN message). / pj_size_t len; /* * The status or reason of drop. For example, a leading newlines (common * keep-alive packet) will be dropped with status PJ_EIGNORED, an invalid * SIP message will have status PJSIP_EINVALIDMSG, a SIP message overflow * will have status PJSIP_ERXOVERFLOW. / pj_status_t status; } pjsip_tp_dropped_data; /* * Type of callback to data dropping notifications. * * @param data The dropped data. / typedef void (pjsip_tp_on_rx_dropped_cb)(pjsip_tp_dropped_data data); /* * Set callback of data dropping. The caller will be notified whenever any * received data is dropped (due to leading newlines or keep-alive packet or * invalid SIP message). This callback can be useful for application, * for example, to implement custom keep-alive mechanism or connection * availability detection. * * @param mgr Transport manager. * @param cb The callback function, set to NULL to reset the callback. * * @return PJ_SUCCESS on success, or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_tpmgr_set_drop_data_cb(pjsip_tpmgr mgr, pjsip_tp_on_rx_dropped_cb cb); /** * Structure of received data that will be passed to data received * notification callback. / typedef struct pjsip_tp_rx_data { /* * The transport receiving the data. / pjsip_transport tp; /** * The data. / void data; /** * The data length. * If application wishes to discard some data of len p, it can pass * the remaining data back to PJSIP to be processed by setting the len * to (len - p). * If application wants to shutdown the transport from within the * callback (for example after if finds out that the data is * suspicious/garbage), app must set the len to zero to prevent * further processing of the data. / pj_size_t len; } pjsip_tp_rx_data; /* * Type of callback to data received notifications. * * @param data The received data. / typedef pj_status_t (pjsip_tp_on_rx_data_cb)(pjsip_tp_rx_data data); /* * Set callback to be called whenever any data is received by a stream * oriented transport. This can be useful for application to do its own * verification, filtering, or logging of potential malicious activities. * * @param mgr Transport manager. * @param cb The callback function, set to NULL to reset the callback. * * @return PJ_SUCCESS on success, or the appropriate error code. / PJ_DECL(pj_status_t) pjsip_tpmgr_set_recv_data_cb(pjsip_tpmgr mgr, pjsip_tp_on_rx_data_cb cb); /** * @} / PJ_END_DECL #endif / __PJSIP_SIP_TRANSPORT_H__ */ ```
The Cuatro Ciénegas killifish (Lucania interioris; also known locally as the ) is an endangered species of fish in the family Cyprinodontidae. It is endemic to Cuatro Ciénegas in Mexico, where it exists in severely fragmented habitats within the valley. References External links Information on the species at Zipcodezoo interioris Endemic fish of Mexico Freshwater fish of Mexico Cuatrociénegas Municipality Natural history of Coahuila Endangered fish Critically endangered biota of Mexico Critically endangered fauna of North America Fish described in 1965 Taxonomy articles created by Polbot
Hri (, ; ) is a Buddhist term translated as "self-respect" or "conscientiousness". It is defined as the attitude of taking earnest care with regard to one's actions and refraining from non-virtuous actions. It is one of the virtuous mental factors within the Abhidharma teachings. The Abhidharma-samuccaya states: "What is hri? It is to avoid what is objectionable as far as I see it and its function is to provide a basis for refraining from non-virtuous actions." Pali Canon There are two suttas in the Pali Canon that bear the title "Hiri Sutta." Both of these texts focus on the issue of moral shame. The first sutta (SN 1.18) is a short dialogue between the Buddha and a deity on the nature of conscience. The second sutta (Sn 2.3) is a question and answer dialogue between the Buddha and an ascetic regarding the nature of true friendship. Mahayana The Abhidharmakośabhāsya lists hrī among the ten virtuous mental factors (daśa kuśalamahābhῡmikā dharma; 大善地法). The Yogācāra tradition recognizes it as one of the eleven wholesome mental factors (ekādaśa-kuśala; 十一善). The former text states that the difference between hrī and apatrāpya is that the former is dominated by one's own understanding of morality. The latter by contrast, is empowered by one's sense of embarrassment. In the commentaries The Pali Paṭṭhāna lists hiri among the twenty-five obhana cetasikas or "beautiful mental factors." Hiri often function in conjunction with apatrāpya (Pali: ottappa), or moral dread. These two are responsible for encouraging a person to avoid performing evil actions. Together they are known as lokapāla or "guardians of the world". The Puggalapaññatti states: "To be ashamed of what one ought to be ashamed of, to be ashamed of performing evil and unwholesome things: this is called moral shame (hiri). To be in dread of what one ought to be in dread of, to be in dread of performing evil and unwholesome things: this is called moral dread (ottappa)." The goddess Hirī or Hiridevī is the name of a goddess and one of Śakra's daughters. Her name is sometimes translated as "Honour". She appears in several texts, including the Sudhābhojana Jātaka and the Mañjarī Jātaka of the Mahāvastu. It is also the name of a yaksha that may be invoked in the Āṭānāṭiya Sutta. Alternative Translations self-respect - Herbert Guenther, Dzigar Kongtrul Rinpoche, Rangjung Yeshe Wiki conscientiousness - Erik Pema Kunsang moral self-dignity - Alexander Berzin sense of shame - Rangjung Yeshe Wiki dignity See also Notes References Guenther, Herbert V. & Leslie S. Kawamura (1975), Mind in Buddhist Psychology: A Translation of Ye-shes rgyal-mtshan's "The Necklace of Clear Understanding". Dharma Publishing. Kindle Edition. Kunsang, Erik Pema (translator) (2004). Gateway to Knowledge, Vol. 1. North Atlantic Books. External links Ranjung Yeshe wiki entry for ngo tsha shes pa Berzin Archives glossary entry for "hri" Wholesome factors in Buddhism Virtue Sanskrit words and phrases
Fernando Gomes may refer to: Fernando Gomes (football administrator) (born 1952), President of the Portuguese Football Federation Fernando Gomes (sport shooter) (born 1954), Brazilian sports shooter Fernando Gomes (Portuguese footballer) (1956–2022), Portuguese footballer Fernando Gomes (Brazilian footballer) (born 1988), Brazilian footballer Fernando Gomes (Bissau-Guinean footballer) (born 2002), Bissau-Guinean footballer Fernando Gomes (politician) (fl. 2012), Guinea-Bissau's Interior Minister See also Fernando Gómez (disambiguation)
On 4 April 2009, an abduction and torture of two young boys by two young brothers in Edlington, South Yorkshire, England. An 11-year-old boy was found with critical head injuries at a ravine in a rural area of Edlington, while his nine-year-old nephew was found wandering nearby covered in blood. On Tuesday, 7 April, two brothers, aged 10 and 11, who had been arrested on Sunday, 5 April, were each initially charged with the attempted murder and robbery of both of the injured boys. They appeared at Sheffield Crown Court, where a hearing revealed the extent of their actions. They had led the two boys to an isolated wasteland where one was forced to strip naked and perform a sex act. A metal ring was used to strangle the other. The brothers collected stones and bricks which were thrown at the boys' heads. When alerted by the sound of passers-by, the suspects covered the two boys with a sheet, which they then set afire, inflicting burns on the victims. One brother had filmed part of the attack on his mobile phone, which was used as evidence in court. The two suspects pleaded guilty to causing grievous bodily harm with intent, to robbing one of the boys of a mobile phone and the other of cash, to two counts of intentionally causing a child to engage in sexual activity, and to one additional charge of actual bodily harm relating to a previous incident involving another 11-year-old boy. A child protection expert, Eileen Vizard, who had been involved in the James Bulger case, told the sentencing judge that the younger brother was a "very high risk" to the community and was at risk of becoming "a seriously disturbed psychopathic offender" unless he was properly treated. The brothers were given indeterminate sentences on 23 January 2010. The judge in the case, Mr Justice Keith, ordered that under Section 39 of the Children and Young Persons Act 1933 their identities should not be disclosed. A request to appeal against the sentence was refused by the Criminal Division of the Court of Appeal on 5 May 2010. In December 2016, the perpetrators were granted legal lifelong anonymity on the grounds that they would be "at serious risk of attack" if their identities became known. In August 2017, shortly after release, the younger of the brothers was returned to prison indefinitely after breaching the terms of his parole; he was found in possession of a machete. References 2009 crimes in the United Kingdom Crime in South Yorkshire Robberies in England Torture in England 2009 in England 2010s in South Yorkshire April 2009 crimes Violence against men in the United Kingdom
```smalltalk using System.Reflection; namespace UnityEditor.ShaderGraph { [Title("Math", "Trigonometry", "Arcsine")] public class ArcsineNode : CodeFunctionNode { public ArcsineNode() { name = "Arcsine"; } public override string documentationURL { get { return "path_to_url"; } } protected override MethodInfo GetFunctionToConvert() { return GetType().GetMethod("Unity_Arcsine", BindingFlags.Static \| BindingFlags.NonPublic); } static string Unity_Arcsine( [Slot(0, Binding.None)] DynamicDimensionVector In, [Slot(1, Binding.None)] out DynamicDimensionVector Out) { return @" { Out = asin(In); } "; } } } ```
Chinatown is a heritage-listed settlement at Herberton Road, Atherton, Tablelands Region, Queensland, Australia. It was built from 1880s to 1920s. It is also known as Cedar Camp. It was added to the Queensland Heritage Register on 21 October 1992. History This open area surrounding the Atherton Chinese Temple was the site of a Chinese settlement which was established in the mid 1880s. It grew to service Chinese tenant farmers in the Atherton area and peaked in importance in the early 1900s when there were over a hundred buildings on site. Its decline began after the first world war when Chinese-held agricultural leases were revoked in favour of returned servicemen and most Chinese left the area. By the late 1940s, virtually all buildings had been removed. Atherton Chinatown was one of many Chinese settlements that sprang up in Australia during the nineteenth century. The Chinese began to arrive in large numbers following the first gold rushes of the 1850s. Most of them came from provinces in the south east of China where conditions were harsh. Almost all were male and many were poor, having borrowed the money for their fares from Chinese guilds. They hoped to make enough money to pay off their debt, to send money home to their families and to eventually return themselves with enough capital to secure their futures. For mutual support and to maintain contacts with their homeland, they lived and worked together, creating Chinatowns within, or on the fringes of, European settlements. The discovery of gold on the Palmer River in 1873 led to an influx of miners to far north Queensland. Many of these were Chinese and by 1877 there were 17,000 Chinese on the Palmer River fields, vastly outnumbering the other diggers. Europeans felt threatened by their numbers, by their willingness to work for low recompense and because the Chinese maintained their own culture. Restrictions were placed on Chinese immigration and they were denied access to new mineral fields. Because of this, and as alluvial gold began to peter out on the Palmer field, the Chinese moved away and looked for other ways to earn money. Tin was discovered on the Wild River in 1880 which gave impetus to the development of the Atherton Tablelands. This is an area of volcanic plateaux, set in the Great Dividing Range, which has a mild climate and fertile soil. It was originally heavily forested and a group of Chinese, working with European timbergetters, moved into the Atherton area in the early 1880s. They established a settlement called Cedar Camp across Piebald Creek from the Europeans and a short distance from the tiny settlement of Prior's Pocket. In August 1885, this area was surveyed, renamed Atherton and land sales began. Queensland legislation prevented Chinese land ownership, but many of them entered into leasing arrangements with Europeans. The newly cleared land could not be ploughed, but was well suited to the hand cultivation methods favoured by the Chinese, who became successful farmers. They supplied the developing town of Herberton with fruit and vegetables and pioneering the growing of maize, which became an important commercial crop for the area. The rents which they paid the land owners also provided a valuable source of income during the difficult economic period of the 1890s. Atherton's Chinatown is on a lease originally granted to Frederick Loder in 1887 and which was transferred freehold to Edward Jasper Loder in 1890. By 1897, there were over 180 Chinese living on the site which developed as a short main street lined with small timber and iron shops and houses. At the height of its development, around 1909, commercial premises located here included corn merchants, food and general goods stores, a herbalist, two gambling dens and a place of entertainment which employed musicians. There was also a Tong society meeting hall and a temple. At the time, this was the social and commercial centre for over a thousand Chinese people who were living in the Atherton district. In 1911, the overthrow of the Manchu dynasty and the declaration of a republic in China caused divisions in the Chinatown society. The authority of the Tong, which acted as an administrative body, was undermined, gambling crept in and there were violent incidents. Some Chinese moved away at this point. There was also increasing local pressure to have the land reserved for European use as the mild climate was thought to be particularly suitable and the land was now ready for ploughing or for dairying. Following the First World War, leases farmed by Chinese were made over to soldier settlers and most of the Chinese moved south or to nearby coastal towns. During the 1920s many buildings were demolished or moved for reuse elsewhere. A handful of old men remained in the settlement until the late 1940s and the temple continued in intermittent use until the mid 1970s. The land on which Chinatown stood was purchased by a group of local Chinese families and was eventually purchased outright by the Fong On family, who had originally lived in the town. The National Trust of Queensland obtained a grant to carry out research on the site in 1975 and the temple was offered to them by the Fong On family in the following year to ensure its preservation. This donation was finalised in 1980. In 1991 John Fong On subdivided Lot 2 on RP740536 gifting the remained of Lot 2 to the National Trust of Queensland and seeling the newly created Lot 3 RP912545 to the Atherton Shire Council. This part of the site contains no buildings. Since the subdivision reports suggest that Lot 3 may contain archaeologically interesting material. In the years since then the temple complex has been researched and conserved as a place museum. A number of research projects have also been carried out on the town site by the Material Culture Unit of the James Cook University. These included research and documentation of the settlement and temple by Latif Ibrahim in 1981, a 1986 project to map remaining surface relics and the original street, and excavations undertaken in 1991 and 1992. Although some damage has been done to the site by the casual digging of collectors in the late 1970s and early 1980s, it is believed that some areas remain undisturbed. Description The site is approximately in area and is located on the gently sloping area to the south of Piebald Creek and to the east of the Herberton Road. The site comprises Lot 2 on RP897109 facing Herberton Atherton Road to the west and extending southward to form the northern and eastern boundaries of the Atherton Chinese Temple site. Lot 3 RP912545 faces Herberton Street and is site on the southern boundary of the temple site. The location of the site appears to have been selected with the aid of geomancy as evidenced by its relationship to natural features such as the Herberton Range and the creek. It is located on dark grey clay soils and the northern, low-lying portion is subject to inundation during wet seasons. Vegetation cover is mainly guinea grass, lantana and clumps of Japanese sunflowers. There are some eucalypts, tea-trees and grevillea and the area is dotted with mango trees introduced by the Chinese. The ground close to the temple is regularly cut to keep the grass low. Dense vegetative cover occurs over much of the site and may help to protect the extensive scatter of artefacts above ground. Evidence of occupation includes wells, buildings sites and possibly plantings. Interpretative signs which mark key sites and illustrate aspects of life in Chinatown were erected by the National Trust in 1996. Heritage listing Chinatown was listed on the Queensland Heritage Register on 21 October 1992 having satisfied the following criteria. The place is important in demonstrating the evolution or pattern of Queensland's history. Chinatown, Atherton is important in demonstrating the evolution of Queensland history in that the Chinese were pioneers of agriculture in north Queensland and as such played an important role in the opening up of the Atherton area for settlement. The place demonstrates rare, uncommon or endangered aspects of Queensland's cultural heritage. It is a major Chinese settlement site in tropical Queensland and has never been built over. Such a concentrated site of Chinese occupation is rare in Australia making Chinatown an important archaeological site. The place has potential to yield information that will contribute to an understanding of Queensland's history. It has potential to yield information that will contribute to an understanding of Queensland's history by demonstrating the formation of, and life within, a large Chinese settlement in Australia. References Attribution Further reading External links Atherton, Chinatown & Hou Wang Temple Queensland Heritage Register Atherton, Queensland Articles incorporating text from the Queensland Heritage Register Atherton Chinese-Australian history Tourist attractions in Far North Queensland
```ruby # frozen_string_literal: true require_relative "../base" require_relative "../events/event" module Fusuma module Plugin module Detectors # Inherite this base class Detector < Base def initialize(*args) super @tag = self.class.tag @type = self.class.type end attr_reader :tag attr_reader :type # @return [Array<String>] def sources @sources \|\|= self.class.const_get(:SOURCES) end # Always watch buffers and detect them or not # @return [TrueClass,FalseClass] def watch? false end # @param _buffers [Array<Buffer>] # @return [Event] if event is detected # @return [NilClass] if event is NOT detected def detect(_buffers) raise NotImplementedError, "override #{self.class.name}##{__method__}" # create_event(record:) end # @param record [Events::Records::Record] # @return [Events::Event] def create_event(record:) @last_time = Time.now Events::Event.new(time: @last_time, tag: tag, record: record) end def last_time @last_time \|\|= Time.now end def first_time? @last_time.nil? end class << self def tag name.split("Detectors::").last.underscore end def type(tag_name = tag) tag_name.gsub("_detector", "") end end end end end end ```
```html <html> <head> <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> <title>windows::overlapped_handle::assign (1 of 2 overloads)</title> <link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> <meta name="generator" content="DocBook XSL Stylesheets V1.79.1"> <link rel="home" href="../../../../boost_asio.html" title="Boost.Asio"> <link rel="up" href="../assign.html" title="windows::overlapped_handle::assign"> <link rel="prev" href="../assign.html" title="windows::overlapped_handle::assign"> <link rel="next" href="overload2.html" title="windows::overlapped_handle::assign (2 of 2 overloads)"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> <td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> <td align="center"><a href="../../../../../../index.html">Home</a></td> <td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> <td align="center"><a href="path_to_url">People</a></td> <td align="center"><a href="path_to_url">FAQ</a></td> <td align="center"><a href="../../../../../../more/index.htm">More</a></td> </tr></table> <hr> <div class="spirit-nav"> <a accesskey="p" href="../assign.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../assign.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../boost_asio.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overload2.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> <div class="section"> <div class="titlepage"><div><div><h5 class="title"> <a name="boost_asio.reference.windows__overlapped_handle.assign.overload1"></a><a class="link" href="overload1.html" title="windows::overlapped_handle::assign (1 of 2 overloads)">windows::overlapped_handle::assign (1 of 2 overloads)</a> </h5></div></div></div> <p> Assign an existing native handle to the handle. </p> <pre class="programlisting">void assign( const native_handle_type & handle); </pre> </div> <table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr> <td align="left"></td> file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url </p> </div></td> </tr></table> <hr> <div class="spirit-nav"> <a accesskey="p" href="../assign.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../assign.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../boost_asio.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overload2.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> </body> </html> ```
5th Reserve Division() was formed in August 1955 in Chengdu Military Region. On February 15, 1956, the division moved to Nanchong, Sichuan. As of its activation the division was composed of: 13th Reserve Regiment; 14th Reserve Regiment; 15th Reserve Regiment; Artillery Regiment; Anti-Aircraft Artillery Regiment; Sergeant Training Regiment. The division was fully manned and equipped. During its short-lived existence the division was focused on the training of officers and sergeants. In March 1958 the division was demobilized, moving to Heilongjiang for agricultural missions. References R05 Military units and formations disestablished in 1958 Military units and formations established in 1955 Reserve divisions of the People's Liberation Army
Bentsion Fleishman (Флейшман, Бенцион Шимонович, born 21 November 1923) is a Russian scientist in the field of mathematical statistics, combinatorial analysis and their applications, doctor of physical and mathematical sciences, professor, author of constructive information theory and the theory of potential efficiency. Fleishman was born in Moscow. In 1947 he graduated from the Moscow State University, the Department of Probability Theory, headed by A. N. Kolmogorov and was sent to work in the cryptographic service of the Ministry of State Security of the USSR. After his discharge in 1954, he worked at the institutes of the USSR Academy of Sciences: the Institute of Radio Engineering and Electronics (1955–1968) and the Institute of Oceanology (1968–1996). Potential efficiency theory is a synthesis of reliability theory, information theory and game theory, the successor of cybernetics, aiming at biological and engineering systems on general conceptual and mathematical basis. Its main concept – efficiency – is defined as the probability to achieve the goal with limited resources. Other fundamental concepts are purposeful choice and probabilistic feasibility of engineering systems. The theory was first formulated in his book Elements of the Theory of Potential Efficiency of Complex Systems (1971). Fleishman wrote more than a hundred scientific articles and five books. From 1966 to 1996, he was the head of the cybernetics and environmental problems section of the Scientific and Technical Society of Radio Engineering, Electronics and Communications. After moving to the US in 1996, he worked on applications of potential efficiency theory and became a member of the International Society for Risk Analysis. Bibliography A. E. Basharinov, B. S. Fleishman, Methods of statistical sequential analysis and their applications, Moscow: Sov. Radio, 1962; B. S. Fleishman, Constructive methods of optimal coding for noisy channels, Moscow: Publishing House of the Academy of Sciences of the USSR, 1963; B. S. Fleishman, Elements of the theory of potential efficiency of complex systems, Moscow: Sov. Radio, 1971 (2nd edition, Smolensk: Oikumene, 2008); B. S. Fleishman, Fundamentals of Systemology, Radio and Communications, Moscow, 1982 (2nd ed. New York: Lulu.com, 2007); B. Fleishman. Stochastic theory of ecological interactions. Ecological Modeling, vol. 17, 1982, p. 65-73; B. Fleishman. Hyperbolic law of reliability and its logarithmic effects in ecology. Ecological Modeling, vol. 55, 1991, p. 75-88; B. Fleishman, Stochastic Theory of Complex Ecological Systems (cap.6). In: B. Patten, S. Jorgenson (eds) Complex Ecology. Prentice Hall PTP, Prentice Hall Inc, A. Simon & Schuster, Englewood Cliffs, New Jersey, 07632, 1995, p. 166-224; B. Fleishman, The Choice is Yours, Moscow: Oikumena, 2000 (2nd ed. , New York: Lulu.com, 2008). External links Bentsion Fleishman \| Official site 1923 births Possibly living people Russian mathematicians Moscow State University alumni USSR Academy of Sciences
```php <?php /* * This file is part of the Symfony package. * * (c) Fabien Potencier <fabien@symfony.com> * * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. / namespace Symfony\Component\Console\Formatter; use Symfony\Component\Console\Exception\InvalidArgumentException; use Symfony\Contracts\Service\ResetInterface; /* * @author Jean-Franois Simon <contact@jfsimon.fr> / class OutputFormatterStyleStack implements ResetInterface { /* * @var OutputFormatterStyleInterface[] / private $styles; private $emptyStyle; public function __construct(?OutputFormatterStyleInterface $emptyStyle = null) { $this->emptyStyle = $emptyStyle ?? new OutputFormatterStyle(); $this->reset(); } /* * Resets stack (ie. empty internal arrays). / public function reset() { $this->styles = []; } /* * Pushes a style in the stack. / public function push(OutputFormatterStyleInterface $style) { $this->styles[] = $style; } /* * Pops a style from the stack. * * @return OutputFormatterStyleInterface * * @throws InvalidArgumentException When style tags incorrectly nested / public function pop(?OutputFormatterStyleInterface $style = null) { if (empty($this->styles)) { return $this->emptyStyle; } if (null === $style) { return array_pop($this->styles); } foreach (array_reverse($this->styles, true) as $index => $stackedStyle) { if ($style->apply('') === $stackedStyle->apply('')) { $this->styles = \array_slice($this->styles, 0, $index); return $stackedStyle; } } throw new InvalidArgumentException('Incorrectly nested style tag found.'); } /* * Computes current style with stacks top codes. * * @return OutputFormatterStyle / public function getCurrent() { if (empty($this->styles)) { return $this->emptyStyle; } return $this->styles[\count($this->styles) - 1]; } /* * @return $this / public function setEmptyStyle(OutputFormatterStyleInterface $emptyStyle) { $this->emptyStyle = $emptyStyle; return $this; } /* * @return OutputFormatterStyleInterface */ public function getEmptyStyle() { return $this->emptyStyle; } } ```
Robert M. Grissom Parkway, locally known as Grissom Parkway, is a major four-lane connector highway in Myrtle Beach, South Carolina. The road begins at Harrelson Boulevard near Myrtle Beach International Airport and terminates in Carolina Forest, South Carolina at SC Highway 31 and International Drive. It provides access to Myrtle Beach attractions such as Coastal Grand Mall, TicketReturn.com Field and Broadway at the Beach and is used as an alternative road to U.S. 17 and Kings Highway in Myrtle Beach. It has bike paths and sidewalks for pedestrian traffic. These are part of the East Coast Greenway, a 3,000 mile long system of trails connecting Maine to Florida. Route description When the road was completed, it replaced Old Socastee Highway (former routing of South Carolina Highway 707) between Pine Island Road and U.S. 501 as well as Central Parkway at Broadway at the Beach between 21st Avenue North and 29th Avenue North. History Robert Grissom Parkway is based on a road planned as early as 1979. In 1996, sections of Central Parkway, a road planned by Burroughs & Chapin, were already complete between 21st Avenue North and 38th Avenue North, and between 44th Avenue North and 48th Avenue North. Taken over as of 1996 by the city, the road could be extended to U.S. 501 in five or six years using property taxes and admissions taxes at Broadway at the Beach attractions, plus a possible hospitality tax on hotel rooms, meals and admissions. Eventually, Central Parkway would be extended south to a planned airport road (later named Harrelson Boulevard) and north to 62nd Avenue North. In 1998, a $2.66 million section of Central Parkway, four lanes with a median between 10th Avenue North and 21st Avenue North, was under construction as a RIDE project. In five years, the road was expected to run from Harrelson Boulevard across U.S. 501 and U.S. 17 Bypass to 62nd Avenue North, which would connect to Carolina Bays Parkway. By February 1999, plans called for Central Parkway to connect directly to Carolina Bays Parkway rather than to an extended 62nd Avenue North. Robert "Bob" Grissom served as Myrtle Beach mayor 12 years, longer than any other mayor, and on the city council for 13 years. He led the effort to return minor league baseball to the city, but Coastal Federal Field (now BB&T Coastal Field) was not named for him. With the section of Central Parkway leading to the stadium opening in April 1999, the city made the decision to honor the late mayor by naming it Robert M. Grissom Parkway. The name change took effect immediately between 10th Avenue North and 29th Avenue North, with other sections to be renamed in stages. Additional work on Grissom Parkway began in March 2001, with three sections of the $30 million RIDE project to be finished over the next year. Included in the project was the widening of an existing section of Old Socastee Highway. The concrete plant owned by Grissom fell victim to the road named for him. On April 5, 2002, the section between Harrelson Boulevard and U.S. 501 opened. On May 6, the section between U.S. 501 and Mr. Joe White Avenue (formerly 10th Avenue North) opened. This was followed on July 1 by the section between 38th and 48th Avenues North. North of 48th Avenue, work had begun on the connection to Carolina Bays Parkway. With the opening of Carolina Bays Parkway on December 17, 2002, Grissom Parkway was complete all the way from that new road to the airport, with "tree-lined medians, trees planted on the shoulders of the road, bike paths and pedestrian sidewalks." In July 2003, a $2.6 million upgrade to the Carolina Bays Parkway interchange began, providing additional access to Carolina Forest. An unpaved road called International Drive connected to S.C. 90, but provided no access to other main roads. A year later, the road still had not been paved, but by 2009 there was a plan to do so, though as of 2016 the project was still delayed. Grissom Parkway had become very popular with tourists, people living in the area, and businesses looking for a good location. However, the city did not intend the road to provide easy access to business, and policies assured this would continue to be the case. International Drive officially opened July 25, 2018. Since 2006, the intersection with 21st Avenue N. has been the start line for the annual Bi-Lo Marathon, and since 2011 the section from US 17 Bypass to BB&T Coastal Field (with the exception of two short turnaround points) has been used for the final five miles. Major intersections References External links Roads in Myrtle Beach, South Carolina
Märt Kubo (born 11 April 1944 in Tarvastu Parish, Viljandi County) is an Estonian theatre pedagogue, critic and politician. In 1992, he was Minister of Culture. He was a member of VIII Riigikogu. Kubo studied clarinet at the Viljandi Music School, graduating in 1960, and then graduated from Viljandi Secondary School No. 2 in 1962. In 1970, he graduated from Tartu State University with a degree in history and was a postgraduate student and lecturer at the university between 1970 and 1980. He was the director of the Noosoo Theatre between 1990 and 1992. In 1992 he was the Minister of Culture of the Transitional Government. From 1993 until 1995, he was the editor of Teater. Muusika. Kino magazine. From 2000 until 2001, he was the chairman of the Estonian Coalition Party and compiled the book Eesti Koonderakond 1991–2001 in 2001. Kubo has published articles on theatrr and film, compiled the books Rahvusooper Estonia 1998–2003 in 2003 and Rahvusooper Estonia 2003–2008 in 2008, which detailed the history of the Estonian National Opera. Kubo is the chairman of the administrative board of the National Opera Foundation operating at the Estonian National Culture Foundation. References 1944 births Living people Estonian Coalition Party politicians Members of the Riigikogu, 1995–1999 Ministers of Culture of Estonia Estonian theatre directors Estonian theatre critics Estonian male writers 20th-century Estonian writers 21st-century Estonian writers Estonian non-fiction writers University of Tartu alumni Academic staff of the University of Tartu People from Viljandi Parish Male non-fiction writers
The Giles Ministry was the ministry of the tenth Chief Minister of the Northern Territory, Adam Giles. It came into operation on 14 March 2013, following the replacement of Terry Mills as Chief Minister and leader of the Country Liberal Party by Adam Giles. It ended on 31 August 2016, when Labor leader Michael Gunner became Chief Minister following his victory at the 2016 election. First ministry (14 March 2013 – 19 March 2013) Second ministry (20 March 2013 – 8 August 2013) Third ministry (9 August 2013 – 9 September 2013) Fourth ministry (10 September 2013 – 15 September 2013) On 9 September 2013, Chief Minister Giles announced that he would be "refreshing" his cabinet. Alison Anderson was removed from the ministry and her portfolios assigned to others. Bess Price joined the ministry. The new ministry was sworn in by the Administrator of the Northern Territory the next day. Fifth ministry (16 September 2013 – 23 August 2014) Sixth ministry (24 August 2014 – 11 December 2014) Seventh ministry (12 December 2014 – 19 January 2015) Eighth ministry (20 January 2015 – 3 February 2015) Ninth ministry (4 February 2015 – 10 February 2015) On 2 February 2015, cabinet member Willem Westra van Holthe challenged Chief Minister Adam Giles for the leadership of the Country Liberal Party, and announced that the party had voted him as leader and chief minister apparent. The next day, Giles refused to resign as chief minister and after a meeting of the parliamentary wing of the CLP, emerged to announce that he was still the leader and that Westra van Holthe would be his deputy. On 4 February, Robyn Lambley was expelled from Cabinet for supporting the challenge. Tenth ministry (11 February 2015 – 14 February 2016) A further reshuffle was held following the resignation of Matt Conlan from Cabinet on 10 February. Eleventh ministry (15 February 2016 – 18 July 2016) Twelfth ministry (19 July 2016 – 25 July 2016) Thirteenth ministry (26 July 2016 – 27 August 2016) John Elferink was sacked as Minister for Correctional Services on 26 July 2016, with Adam Giles assuming the portfolio. References External links The Chief Minister and the Cabinet Giles 1
This is a list of casinos in Nevada. List of casinos See also List of casinos in the United States List of casino hotels Las Vegas Strip List of Las Vegas casinos that never opened Notes Sources External links Nevada Casinos
The BLH RS-12 railroad locomotive was a diesel-electric road-switcher configured with an AAR type B-B wheel arrangement. It was the follow-on model to the former Baldwin DRS-4-4-1000, first introduced in 1948. It was more successful than its predecessor selling 50 units to eight railroads, versus 22 units to three railroads. Only one railroad, The Pennsylvania Railroad bought both models. When Baldwin Locomotive Works merged with Lima-Hamilton Corporation, forming the Baldwin-Lima-Hamilton Corporation and decided to concentrate locomotive production at Baldwin's Eddystone, Pennsylvania plant. There was still one outstanding order for Lima A-3174s but the customer, New York Central Railroad agreed to receive RS-12s instead. The locomotive could be ordered with either a steam generator for steam heat, or dynamic brakes contained within the short hood. McCloud River Railroad No. 32 and 33 were the only two ordered with dynamic brakes of the fifty units built. One RS-12 is preserved in operational condition in the "Skunk Train" livery of California Western 56 (Locomotive) at Travel Town Museum in Griffith Park; another #300 is owned by and occasionally used on the Escanaba and Lake Superior Railroad, with others owned by the same railroad held in non-operational condition. Escanaba and Lake Superior 207 was leased to the Nicolet Badger Northern Railroad for a short time in the 1990s and was later returned to the Escanaba and Lake Superior where it now remains in storage in Wells, Michigan. Escanaba and Lake Superior 209 was used for ballast and general freight until the late 1980s when it was put in storage. Escanaba and Lake Superior 212 started to be rebuilt in the 1980s but the rebuilt was never completed. It remains in storage along with other E&LS Baldwins at Wells, Michigan. Original buyers References RS-12 B-B locomotives Railway locomotives introduced in 1951 Diesel-electric locomotives of the United States Standard gauge locomotives of the United States
Philipp Pittoni Freiherr von Dannenfeld (died 6 October 1824), fought in the army of Habsburg Austria during the French Revolutionary Wars. Promoted to general officer in 1795, he was a brigade commander in northwestern Italy at the time when Napoleon Bonaparte was appointed to lead the opposing French Army of Italy. He led one of the two main columns at Voltri in April 1796. At Borghetto in May, he unsuccessfully defended the bridge. He led a brigade at Castiglione in August and at Second Bassano and Arcole in November 1796. He retired from service the following year and died at Gorizia in 1824. Montenotte Campaign Neither Pittoni's place and date of birth are known nor are his early military dates of advancement. On 1 May 1795 he was promoted to the rank of General-major. In early 1796, Johann Peter Beaulieu was the newly appointed commander of the combined armies of Habsburg Austria and the Kingdom of Sardinia-Piedmont. Beaulieu's left wing consisted of 19,500 troops. Half of these were on garrison duty, while the rest were led by Pittoni and Josef Philipp Vukassovich. The 11,500-man Austrian right wing was posted to cover Acqui Terme and was commanded by Eugène-Guillaume Argenteau. The 20,000 Piedmontese troops were led by Michelangelo Alessandro Colli-Marchi and included an Austrian contingent under Giovanni Marchese di Provera. Colli's men were strung out in a chain from Cosseria Castle in the east to Cuneo in the west. Further west, the 20,000 Piedmontese under the Prince of Corrigan were faced by François Christophe de Kellermann's Army of the Alps. According to one authority, on 1 April 1796, Pittoni's 7-battalion brigade was stationed near Alessandria and belonged to Karl Philipp Sebottendorf's wing of Beaulieu's Austrian army. Another authority asserted that he led a division-sized command that included three battalions of the Reisky Infantry Regiment Nr. 13, two battalions of the Nádasdy Infantry Regiment Nr. 39, one battalion of the Terzi Infantry Regiment Nr. 16, one battalion of the Lattermann Infantry Regiment Nr. 45, and one battalion of the Szluiner Grenz Infantry Regiment Nr. 63. Because the neutral Republic of Genoa had refused to loan the French money, the representative-on-mission Antoine Christophe Saliceti asked the French army commander Barthélemy Louis Joseph Scherer for 6,000 men to advance in order to intimidate the civic authorities. On 27 March, Pittoni reported to Beaulieu about the movement of these troops to Voltri. Bonaparte, who had just taken command, ordered the movement halted the next day. At first he wanted to withdraw the exposed unit, but later decided to hold the position at Voltri. To counter this threat, on 31 March, Beaulieu ordered Pittoni in invade the Republic of Genoa and cross the Bocchetta Pass. Pittoni occupied Novi Ligure with 2,800 men and started his men on the road up the pass. The Lattermann Regiment was left to guard Novi. Beaulieu apparently was on hand because he noted that the weather was uncomfortably cold and that Pittoni was not well, though he did his soldierly duty. The army commander sent one 12-pound cannon, one 6-pound cannon, and two 7-pound howitzers to join Pittoni's force. By 8 April, Pittoni was in position at the Bocchetta Pass but informed Beaulieu that he was so isolated that it would take him six hours of marching over bad roads to link with Vukassovich near Masone. On 10 April 1796, Pittoni's column advanced with four squadrons of the Mészáros Uhlans, two battalions of the Reisky Regiment, and one battalion each of the Terzi, Nádasdy, and Szluiner Regiments. Pittoni's force numbered 3,350 infantry and 624 cavalry. The troops got a remarkably late start. At 8:00 AM, 250 volunteers set out to cover the right flank by marching via the mountaintop Madonna della Guardia. The main column left Campomorone at 11:00 AM and marched down to the coast before turning right through Sestri di Ponente. Pittoni's Szluiner battalion and the volunteers attacked the French 75th Line Infantry Demi-Brigade near Pegli at 3:00 PM in the Battle of Voltri. After a three-hour fight, the 75th Line withdrew. That evening Pittoni occupied Voltri with three battalions and the cavalry. He was joined at midnight by Beaulieu, who came via Masone and the Turchino Pass with Sebottendorf and Vukassovich. The Austrians lost about 50 casualties while the French reported losing 16 dead, 45 wounded, and 148 captured. The remaining actions of the Montenotte Campaign went badly for the Austrians. They lost the Battle of Montenotte on 11 and 12 April and the Second Battle of Dego on 14 and 15 April. Soon after, the Piedmontese were defeated at the Battle of Mondovì on 22 April, their government sued for peace. Borghetto to Arcole Pittoni's brigade held a position near Gropello Cairoli in early May. He missed the Battle of Lodi on 10 May 1796 since he was marching with Beaulieu via the village of Acquanegra Cremonese toward Cremona. When the Austrians formed a defense line behind the Mincio River, Sebottendorf placed Pittoni's brigade and Prince di Cuto's Neapolitan cavalry near Valeggio sul Mincio. At 7:00 AM on the morning of 30 May 1796, the division of Charles Edward Jennings de Kilmaine attacked the Austrian cavalry outposts on the west side of the Mincio to open the Battle of Borghetto. By 9:00 AM the French reached the Borghetto bridge on the west side of Valeggio and put great pressure on the one battalion each from the Strassoldo Infantry Regiment Nr. 27 and Jordis Infantry Regiment Nr. 59. Pittoni arrived to direct the fighting, but no reserves arrived. By noon, the Austrians ran low on ammunition and withdrew to Valeggio. The French followed and pushed them out of the town as well. To face Kilmaine's 1,500 cavalry and six battalions of grenadiers, Pittoni only had half of the 920 men from the two battalion Strassoldo Regiment and 761 soldiers from the Jordis Regiment. When the new Austrian army commander Dagobert Sigmund von Wurmser advanced to the relief of the Siege of Mantua in late July, he formed his forces into four columns. See the Castiglione 1796 Campaign Order of Battle. The Right-Center Column was led by Michael von Melas and comprised the brigades of Peter Gummer, Adam Bajalics von Bajahaza, Franz Nicoletti, and Pittoni. The latter two reported to Sebottendorf. While Melas led Gummer and Bajalics over Monte Baldo by footpaths, Sebottendorf's two brigades fought their way down the road through Ferrara di Monte Baldo and Brentino Belluno. They accomplished their mission by driving back the French so that the Left-Center Column under Paul Davidovich could join them via the Adige River valley. The 900-man 11th Light Infantry Demi-Brigade and four guns were isolated and captured during the successful operation. Pittoni and Sebottendorf are not specifically mentioned in a detailed account of the Battle of Castiglione on 5 August 1796. In a preliminary action on 3 August, 1,000 Austrians became casualties and Pittoni's fellow brigadier Nicoletti was wounded. On the 5th, the Austrians were beaten with losses of 2,000 killed and wounded plus 1,000 men and 20 guns captured. The French counted 1,100 casualties. In 1796, József Alvinczi led the Austrian army in the third relief of Mantua. Peter Vitus von Quosdanovich's 28,699-man Friaul Corps was divided into six brigades under Pittoni, Anton Lipthay de Kisfalud, Anton Schübirz von Chobinin, Gerhard Rosselmini, Adolf Brabeck, and Prince Friedrich Franz Xaver of Hohenzollern-Hechingen. Another authority stated that Pittoni commanded the 4,376-man army Reserve with four battalions, one squadron. See the Arcola 1796 Campaign Order of Battle. The Friaul Corps was accompanied by Alvinczi in person. Provera took Lipthay and Brabeck on a southerly road toward Fontaniva while Hohenzollern and a newly arrived brigade under Anton Ferdinand Mittrowsky took a northerly road toward Bassano del Grappa. The Second Battle of Bassano was fought on 6 November 1796. Lipthay, supported by Brabeck and Schübirz, repelled French attacks near Fontaniva, while Hohenzollern and the "main part of the division" held their ground near the village of Nove on the west side of Bassano. The Austrian victory cost Provera's wing 208 killed, 873 wounded, and 109 captured. Quosdanovich's wing suffered 326 killed, 858 wounded, 449 men and two guns captured. This bloody contest cost the French 3,000 killed and wounded plus 508 men and one gun captured. Pittoni was not specifically noted during a thorough account of the Battle of Arcole on 15 to 17 November. Beginning on the second day, Alvinczi entrusted Mittrowsky with 14 battalions for the defense of Arcole, while Provera was given six battalions to hold Belfiore. At 4:00 PM on the third day, a powerful column of Hungarian grenadiers was committed to the combat at Arcole, which suggests that Pittoni's Reserve was being fed into the battle. Soon afterward, the grenadiers fell into an ambush and retreated. By 5:00 PM the French were masters of Arcole and Mittrowsky finally withdrew. The Austrians lost 600 killed (including Brabeck), 1,600 wounded, and 4,000 men and 11 guns captured in the 3-day fight. French losses numbered 1,200 killed and 2,300 wounded. Pittoni retired from the army on 28 February 1797. He died in Gorizia on 6 October 1824. Notes References Austrian soldiers Austrian generals Barons of Austria Italian soldiers Austrian Empire military leaders of the French Revolutionary Wars 1824 deaths Year of birth missing
Henrique Araújo de Oliveira, known as Araújo (born 7 August 1998) is a Brazilian football player. Club career He made his Ukrainian Premier League debut for Lviv on 28 October 2018 in a game against Dynamo Kyiv. References External links 1998 births Footballers from Bahia Living people Brazilian men's footballers Men's association football forwards FC Lviv players Ukrainian Premier League players Ukrainian First League players Brazilian expatriate men's footballers Expatriate men's footballers in Ukraine Brazilian expatriate sportspeople in Ukraine FC Lokomotíva Košice players 2. Liga (Slovakia) players Expatriate men's footballers in Slovakia Brazilian expatriate sportspeople in Slovakia FC Mynai players FC VPK-Ahro Shevchenkivka players
Vincenzo Biava (18 April 1916 – March 2004) was an Italian sport shooter who competed in the 50 metre rifle, three positions event at the 1960 Summer Olympics. References 1916 births 2004 deaths Italian male sport shooters ISSF rifle shooters Olympic shooters for Italy Shooters at the 1960 Summer Olympics
Roman Viktorovich Babichev (; born 18 August 1975) is a former Russian professional footballer. External links 1975 births Footballers from Volgograd Living people Russian men's footballers Men's association football midfielders FC Energiya Volzhsky players FC Olimpia Volgograd players FC Tekstilshchik Kamyshin players FC Smena Komsomolsk-na-Amure players Kazakhstan Premier League players Russian expatriate men's footballers Expatriate men's footballers in Kazakhstan Russian expatriate sportspeople in Kazakhstan
Kurchum (, ) is a district of East Kazakhstan Region in eastern Kazakhstan. The administrative center of the district is the selo of Kurshim. Population: References Districts of Kazakhstan East Kazakhstan Region
The 70th Academy Awards ceremony, organized by the Academy of Motion Picture Arts and Sciences (AMPAS), took place on March 23, 1998, at the Shrine Auditorium in Los Angeles beginning at 6:00 p.m. PST / 9:00 p.m. EST. During the show, AMPAS presented Academy Awards (commonly referred to as Oscars) in 24 categories honoring films released in 1997. The ceremony, which was televised in the United States by ABC, was produced by Gil Cates and directed by Louis J. Horvitz. Actor Billy Crystal hosted the show for the sixth time. He had first hosted the 62nd ceremony held in 1990, and most recently the previous year's awards. Nearly a month earlier in an event held at the Regent Beverly Wilshire Hotel in Beverly Hills, California on February 28, the Academy Awards for Technical Achievement were presented by host Ashley Judd. Titanic won eleven awards, including Best Picture, a number that is tied with Ben-Hur and The Lord of the Rings: The Return of the King. Other winners included As Good as It Gets, Good Will Hunting, and L.A. Confidential with two awards, and Character, The Full Monty, Geri's Game, The Long Way Home, Men in Black, A Story of Healing, and Visas and Virtue with one. The telecast garnered more than 57 million viewers in the United States, making it the most watched Oscars broadcast in history. Winners and nominees The nominees for the 70th Academy Awards were announced on February 10, 1998, at the Samuel Goldwyn Theater in Beverly Hills, California, by Robert Rehme, president of the academy, and actress Geena Davis. Titanic received the most nominations with a record-tying fourteen (1950's All About Eve, and later 2016's La La Land, also achieved this distinction); Good Will Hunting and L.A. Confidential came in second with nine apiece. The winners were announced during the awards ceremony on March 23, 1998. With eleven awards, Titanic tied with Ben-Hur for the most Academy Awards in Oscar history. It also became the first film to win Best Picture without a screenwriting nomination since 1965's The Sound of Music. Jack Nicholson became the fourth performer to win at least three acting Oscars. Both Nicholson and Helen Hunt won for their roles in As Good as It Gets, making it the seventh film to win both lead acting awards. Nominated for their performances as Rose DeWitt Bukater in Titanic, Best Actress nominee Kate Winslet and Best Supporting Actress nominee Gloria Stuart became the first pair of actresses nominated for portraying the same character in the same film. At age 87, Stuart also became the oldest performer nominated for a competitive Oscar. Awards Winners are listed first, highlighted in boldface, and indicated with a double dagger (). {\| class=wikitable \| valign="top" width="50%" \| Titanic – James Cameron and Jon Landau, producers As Good as It Gets – James L. Brooks, Bridgit Johnson and Kristi Zea, producers The Full Monty – Uberto Pasolini, producer Good Will Hunting – Lawrence Bender, producer L.A. Confidential – Arnon Milchan, Curtis Hanson and Michael Nathanson, producers \| valign="top" width="50%" \| James Cameron – Titanic Peter Cattaneo – The Full Monty Gus Van Sant – Good Will Hunting Curtis Hanson – L.A. Confidential Atom Egoyan – The Sweet Hereafter \|- \| valign="top" \| Jack Nicholson – As Good as It Gets as Melvin Udall Matt Damon – Good Will Hunting as Will Hunting Robert Duvall – The Apostle as Euliss "Sonny" Dewey, a.k.a. "The Apostle E.F." Peter Fonda – Ulee's Gold as Ulysses "Ulee" Jackson Dustin Hoffman – Wag the Dog as Stanley Motss \| valign="top" \| Helen Hunt – As Good as It Gets as Carol Connelly Helena Bonham Carter – The Wings of the Dove as Kate Croy Julie Christie – Afterglow as Phyllis Mann Judi Dench – Mrs Brown as Queen Victoria Kate Winslet – Titanic as Rose DeWitt Bukater \|- \| valign="top" \| Robin Williams – Good Will Hunting as Dr. Sean Maguire Robert Forster – Jackie Brown as Max Cherry Anthony Hopkins – Amistad as John Quincy Adams Greg Kinnear – As Good as It Gets as Simon Bishop Burt Reynolds – Boogie Nights as Jack Horner \| valign="top" \| Kim Basinger – L.A. Confidential as Lynn Bracken Joan Cusack – In & Out as Emily Montgomery Minnie Driver – Good Will Hunting as Skylar Satenstein Julianne Moore – Boogie Nights as Amber Waves/Maggie Gloria Stuart – Titanic as Rose Dawson Calvert \|- \| valign="top" \| Good Will Hunting – Matt Damon and Ben Affleck As Good as It Gets – Mark Andrus and James L. Brooks Boogie Nights – Paul Thomas Anderson Deconstructing Harry – Woody Allen The Full Monty – Simon Beaufoy \| valign="top" \| L.A. Confidential – Brian Helgeland and Curtis Hanson; from the novel by James Ellroy Donnie Brasco – Paul Attanasio; based on the book Donnie Brasco: My Undercover Life in the Mafia by Joseph D. Pistone with Richard Woodley The Sweet Hereafter – Atom Egoyan; adapted from the novel by Russell Banks Wag the Dog – David Mamet and Hilary Henkin; from the novel American Hero by Larry Beinhart The Wings of the Dove – Hossein Amini; adapted from the novel by Henry James \|- \| valign="top" \| Karakter (Netherlands) in Dutch – Mike van Diem Beyond Silence (Germany) in German – Caroline Link Four Days in September (Brazil) in Portuguese – Bruno Barreto Secrets of the Heart (Spain) in Spanish – Montxo Armendáriz The Thief (Russia) in Russian – Pavel Chukhray \| valign="top" \| The Long Way Home – Rabbi Marvin Hier and Richard Trank 4 Little Girls – Spike Lee and Sam Pollard Ayn Rand: A Sense of Life – Michael Paxton Colors Straight Up – Michèle Ohayon and Julia Schachter Waco: The Rules of Engagement – Dan Gifford and William Gazecki \|- \| valign="top" \| A Story of Healing – Donna Dewey and Carol Pasternak Alaska: Spirit of the Wild – George Casey and Paul Novros Amazon – Kieth Merrill and Jonathan Stern Family Video Diaries: Daughter of the Bride – Terri Randall Still Kicking: The Fabulous Palm Springs Follies – Mel Damski and Andrea Blaugrund \| valign="top" \| Visas and Virtue – Chris Tashima and Chris Donahue Dance Lexie Dance – Pearse Moore and Tim Loane It's Good to Talk – Roger Goldby and Barney Reisz Sweethearts? – Birger Larsen and Thomas Lydholm Wolfgang – Anders Thomas Jensen and Kim Magnusson \|- \| valign="top" \| Geri's Game – Jan Pinkava Famous Fred – Joanna Quinn The Old Lady and the Pigeons – Sylvain Chomet Redux Riding Hood – Steve Moore and Dan O'Shannon Rusalka – Alexander Petrov \| valign="top" \| Titanic – James Horner Amistad – John Williams Good Will Hunting – Danny Elfman Kundun – Philip Glass L.A. Confidential – Jerry Goldsmith \|- \| valign="top" \| The Full Monty – Anne Dudley Anastasia – Music by Stephen Flaherty; lyrics by Lynn Ahrens; orchestral score by David Newman As Good as It Gets – Hans Zimmer Men in Black – Danny Elfman My Best Friend's Wedding – James Newton Howard \| valign="top" \| "My Heart Will Go On" from Titanic – Music by James Horner; lyrics by Will Jennings "Go the Distance" from Hercules – Music by Alan Menken; lyrics by David Zippel "Journey to the Past" from Anastasia – Music by Stephen Flaherty; lyrics by Lynn Ahrens "How Do I Live" from Con Air – Music and lyrics by Diane Warren "Miss Misery" from Good Will Hunting – Music and lyrics by Elliott Smith \|- \| valign="top" \| Titanic – Tom Bellfort and Christopher Boyes Face/Off – Mark Stoeckinger and Per Hallberg The Fifth Element – Mark Mangini \| valign="top" \| Titanic – Gary Rydstrom, Tom Johnson, Gary Summers and Mark Ulano Air Force One – Paul Massey, Rick Kline, Doug Hemphill and Keith A. Wester Con Air – Kevin O'Connell, Greg P. Russell and Art Rochester Contact – Randy Thom, Tom Johnson, Dennis S. Sands and William B. Kaplan L.A. Confidential – Andy Nelson, Anna Behlmer and Kirk Francis \|- \| valign="top" \| Titanic – Art Direction: Peter Lamont; Set Decoration: Michael D. Ford Gattaca – Art Direction: Jan Roelfs; Set Decoration: Nancy Nye Kundun – Art Direction: Dante Ferretti; Set Decoration: Francesca Lo Schiavo L.A. Confidential – Art Direction: Jeannine Oppewall; Set Decoration: Jay Hart Men in Black – Art Direction: Bo Welch; Set Decoration: Cheryl Carasik \| valign="top" \| Titanic – Russell Carpenter Amistad – Janusz Kamiński Kundun – Roger Deakins L.A. Confidential – Dante Spinotti The Wings of the Dove – Eduardo Serra \|- \| valign="top" \| Men in Black – Rick Baker and David LeRoy Anderson Mrs Brown – Lisa Westcott, Veronica Brebner and Beverley Binda Titanic – Tina Earnshaw, Greg Cannom and Simon Thompson \| valign="top" \| Titanic – Deborah Lynn Scott Amistad – Ruth E. Carter Kundun – Dante Ferretti Oscar and Lucinda – Janet Patterson The Wings of the Dove – Sandy Powell \|- \| valign="top" \| Titanic – Conrad Buff, James Cameron and Richard A. Harris Air Force One – Richard Francis-Bruce As Good as It Gets – Richard Marks Good Will Hunting – Pietro Scalia L.A. Confidential – Peter Honess \| valign="top" \| Titanic'' – Robert Legato, Mark Lasoff, Thomas L. Fisher and Michael Kanfer The Lost World: Jurassic Park – Dennis Muren, Stan Winston, Randal M. Dutra and Michael Lantieri Starship Troopers – Phil Tippett, Scott E. Anderson, Alec Gillis and John Richardson \|} Academy Honorary Award Stanley Donen Films with multiple nominations and awards The following 16 films received multiple nominations: The following four films received multiple awards: Presenters and performers The following individuals presented awards or performed musical numbers. Presenters Performers Ceremony information In December 1997, the academy hired veteran Oscar telecast producer Gil Cates to oversee the 1998 ceremony. "Gil has become the consummate Oscar show producer, consistently garnering top television ratings for the telecast," said AMPAS President Robert Rehme in a press release announcing the selection. "His shows are full of wit, charm and surprise." A few days later, actor and comedian Billy Crystal was chosen to emcee the upcoming telecast. Cates explained his reason to bring back the veteran comedian saying, "Billy's performance last year was spectacular. There is nobody like him." In an article published in USA Today he initially requested to Cates and AMPAS five months after the previous year's ceremony that he would like to take a break from hosting duties. However, pressure from the academy, Cates, and several friends and family members made him reconsider his decision. His sixth stint would make him second only to Bob Hope in number of ceremonies hosted. To commemorate the seventieth anniversary of the Academy Awards, 70 actors who have received both competitive and honorary awards appeared seated onstage together during a segment called Oscar's Family Album. Each former winner was acknowledged by announcer Norman Rose with the films he or she won for. At the end of the segment newly minted winners Kim Bassinger, Helen Hunt, and Robin Williams joined them. This marked the largest gathering of former winners since the 50th ceremony held in 1978. Several others participated in the production of the ceremony. Bill Conti served as musical director for the telecast. Dancer Daniel Ezralow choreographed a dance number showcasing the nominees for Best Original Comedy or Musical Score. Bart the Bear made a surprise appearance during the presentation of the Best Sound Effects Editing award with Mike Myers. Box office performance of nominees At the time of the nominations announcement on February 10, the combined gross of the five Best Picture nominees was $579 million with an average of $116 million per film. Titanic was the highest earner among the Best Picture nominees with $338.7 million in domestic box office receipts. The film was followed by As Good as It Gets ($92.6 million), Good Will Hunting ($68.9 million), L.A. Confidential ($39.7 million), and finally The Full Monty ($38.7 million). Of the top 50 grossing movies of the year, 40 nominations went to 15 films on the list. Only Titanic (1st), As Good as It Gets (16th), Good Will Hunting (20th), and In & Out (24th) were nominated for directing, acting, screenwriting, or Best Picture. The other top 50 box office hits that earned nominations were Men in Black (2nd), The Lost World: Jurassic Park (3rd), Air Force One (5th), My Best Friends Wedding (7th), Face/Off (9th), Con Air (12th), Contact (13th), Hercules (14th), The Fifth Element (25th), Anastasia (30th), and Starship Troopers (34th). Critical response The show received a positive reception from most media publications. Television critic Howard Rosenberg of the Los Angeles Times lauded Crystal's performance writing that he "would earn top billing as that unusual comedian as artful at doing musical comedy as jokes." San Francisco Chronicle columnist John Carman raved,"It was the best Oscar show in two decades." He also gave high marks for the host, commenting, "But last night, Crystal was back in razor form." The Seattle Times television editor Kay McFadden praised Crystal commenting that "he possesses nearly impeccable timing and judgment." In addition, she noted that while the ceremony dragged on, "Last night was one of television's smartest live ceremonies in recent memory." Some media outlets were more critical of the show. Ray Richmond of Variety complained that the ceremony proved to be a "Yawner of an Oscarcast." He added that Crystal's "off-the-cuff one-liners sank faster than the great ship herself." Boston Globe television critic Matthew Gilbert bemoaned,"There was hardly a spontaneous moment during last night's Oscarcast." Film critic Carrie Rickey from The Philadelphia Inquirer lamented that the inevitable Titanic sweep "sank a telecast loaded with montages of previous years' Oscar highlights." Ratings and reception The popularity of Titanic greatly increased television ratings for the ceremony. The American telecast on ABC drew in an average of 57.25 million people over its length, which was a 29% increase from the previous year's ceremony. An estimated 87.50 million total viewers watched all or part of the awards. The show also earned higher Nielsen ratings compared to the previous ceremony with 35.32% of households watching over a 55.77 share. In addition, it garnered a higher 1849 demo rating with a 24.90 rating over a 44.30 share among viewers in that demographic. It overtook the network's own telecast of the 1983 Academy Awards to become, as it remains to date, the highest viewership for both an Academy Award telecast (since figures were compiled beginning with the 46th ceremony in 1974) and any live awards show airing in U.S. television history. In July 1998, the ceremony presentation received eight nominations at the 50th Primetime Emmys. Two months later, the ceremony won five of those nominations for Outstanding Individual Performance in a Variety or Music Program (Billy Crystal), Outstanding Directing for a Variety or Music Program (Louis J Horvitz), Outstanding Lighting Direction (Electronic) for a Drama Series, Variety Series, Miniseries, or Movie (Bob Barnhart, Robert Dickinson, Matt Ford, Andy O'Reilly), Outstanding Music Direction (Bill Conti), and Outstanding Sound Mixing for a Variety Series or Special (Patrick Baltzell, Robert Douglass, Edward J. Greene, Tommy Vicari). In Memoriam The annual In Memoriam tribute was presented by actress Whoopi Goldberg. The montage featured an excerpt of "Appassionata" from The Passage'' composed by Michael J. Lewis. Lloyd Bridges - Actor Richard Jaeckel - Character actor Saul Chaplin – Composer/Musical Director Stanley Cortez – Cinematographer William Hickey - Actor Paul Jarrico – Screenwriter Dorothy Kingsley – Screenwriter Sydney Guilaroff – Hairstylist William H. Reynolds – Editor Billie Dove - Actress Jacques Cousteau – Filmmaker Stubby Kaye - Actor, comedian Red Skelton - Comedy entertainer Dawn Steel – Executive Toshiro Mifune - Japanese actor Brian Keith - Actor Chris Farley - Actor, comedian Leo Jaffe – Executive Samuel Fuller – Director Burgess Meredith - Actor J. T. Walsh - Character actor Robert Mitchum - Actor James Stewart - Actor See also 4th Screen Actors Guild Awards 18th Golden Raspberry Awards 40th Grammy Awards 51st British Academy Film Awards 52nd Tony Awards 55th Golden Globe Awards List of submissions to the 70th Academy Awards for Best Foreign Language Film References Bibliography External links Official websites Academy Awards Official website The Academy of Motion Picture Arts and Sciences Official website Oscar's Channel at YouTube (run by the Academy of Motion Picture Arts and Sciences) Analysis 1997 Academy Awards Winners and History Filmsite Academy Awards, USA: 1998 Internet Movie Database Other resources 1997 film awards 1998 in American cinema Academy Awards ceremonies 1998 in Los Angeles March 1998 events in the United States Academy Television shows directed by Louis J. Horvitz
Surendra Prasad Singh was a Nepalese judge who served as 9th Chief Justice of Nepal, in office from 26 September 1995 to 14 February 1997. He was appointed by the then-king of Nepal, Birendra. Singh was preceded by Bishwonath Upadhyaya and succeeded by Trilok Pratap Rana. References Chief justices of Nepal
```makefile ################################################################################ # # sg3_utils # ################################################################################ SG3_UTILS_VERSION = 1.40 SG3_UTILS_SOURCE = sg3_utils-$(SG3_UTILS_VERSION).tar.xz SG3_UTILS_SITE = path_to_url SG3_UTILS_LICENSE = BSD-3c # utils progs are GPLv2+ licenced ifeq ($(BR2_PACKAGE_SG3_UTILS_PROGS),y) SG3_UTILS_LICENSE += GPLv2+ endif SG3_UTILS_LICENSE_FILES = COPYING BSD_LICENSE # install the libsgutils2 library SG3_UTILS_INSTALL_STAGING = YES ifeq ($(BR2_PACKAGE_SG3_UTILS_PROGS),) define SG3_UTILS_REMOVE_PROGS for prog in \ compare_and_write copy_results dd decode_sense \ emc_trespass format get_config \ get_lba_status ident inq logs luns map26 \ map sgm_dd modes opcodes sgp_dd persist prevent \ raw rbuf rdac read readcap read_block_limits \ read_buffer read_long reassign referrals \ rep_zones requests reset reset_wp rmsn rtpg safte sanitize \ sat_identify sat_phy_event sat_read_gplog sat_set_features \ scan senddiag ses ses_microcode start stpg sync test_rwbuf \ turs unmap verify vpd write_buffer write_long \ write_same write_verify wr_mode xcopy; do \ $(RM) $(TARGET_DIR)/usr/bin/sg_$${prog} ; \ done for prog in \ logging_level mandat readcap ready satl start stop \ temperature; do \ $(RM) $(TARGET_DIR)/usr/bin/scsi_$${prog} ; \ done for prog in \ sginfo sgm_dd sgp_dd; do \ $(RM) $(TARGET_DIR)/usr/bin/$${prog}; \ done endef SG3_UTILS_POST_INSTALL_TARGET_HOOKS += SG3_UTILS_REMOVE_PROGS endif $(eval $(autotools-package)) ```
Ness Point, also known as Lowestoft Ness, is the most easterly point of England, Great Britain, the United Kingdom and the British Isles. It is located in Lowestoft in the East Suffolk district of the county of Suffolk. The site is located to the east of the town centre, overlooking the North Sea, and has a direction marker, known as the Euroscope, marking locations in other countries and their distance from Ness Point. Located at Ness Point is the previous record holder for Britain's tallest wind turbine, nicknamed "Gulliver". It stands tall, generating electricity for the National Grid. See also Corrachadh Mòr, westernmost point of the British mainland. Lizard Point, southernmost point of the British mainland. Dunnet Head, northernmost point of the British Mainland. Marshall Meadows Bay, northernmost point of England. Ness, Lewis, northernmost point of the Outer Hebrides References External links Ness Point - Official Website Lowestoft
Maharaja is a 2011 Tamil-language film written and directed by Manoharan and produced by J. Ravi. The film stars Nassar, Sathya and Anjali. The music was composed by D. Imman with cinematography done by V. Lakshmapathy and editing by P. Sai Suresh. Synopsis Mahadevan is a middle-aged government employee who leads a very normal family life with his wife, son, and father. He lives a budget life, rides an old scooter, wears out-of-fashion clothes, and bears a sullen expression on his face for all the reasons above. He is unhappy with his present life, which is monotonous, and feels that he should live a modernized life which he has missed in his earlier life. In this day and age, with westernization overpowering everything else, he is constantly reminded of a flame that died out long ago, and it questions the purpose of his existence. Meanwhile, Aravind, who comes from America, has a modern lifestyle. He works in a software company in Chennai. Mahadevan happens to meet Aravind and learns that he is his nephew. Both of them become very close. Aravind helps Mahadevan enjoy the modern life, which causes Mahadevan's family to suffer greatly with his activities. However, Aravind turns a new lease of life when he falls for Priya. He changes his poor characters for his love. Aravind comes to understand the real life and feels that he would only spoil his uncle's life. How he helps his uncle through this midlife crisis forms the rest of the story. Cast Nassar as Mahadevan Sathya as Aravind Anjali as Priya Saranya as Seetha Anita Hassanandani Karunas as Maadasamy aka OneTen Kovai Sarala as Bujji M. S. Viswanathan as Aravind's grandfather Vennira Aadai Moorthy Ajay Rathnam M. S. Narayana as Subbu Bayilwan Ranganathan as Traffic police officer Production and release The film was launched in March 2009 with Nassar being roped in by the debutant director Manoharan to star in the lead role, with the veteran actor allotting 35 days to shoot for the film, four times as lengthy as he would offer for other roles. Sathya, Anjali and Anita Hassanandani were roped in to essay other leading roles in the film while Karunas and Saranya were selected to play supporting roles. The film was briefly delayed before remaining portions were completed in Malaysia in a 40-day schedule by December 2010. The film was planned as a Tamil-Telugu bilingual film although the Telugu version never released. The film remained unreleased for a year, before hitting screens on 30 December 2011. Critical reception Rohit Ramachandran of Nowrunning.com rated it 2.5/5 stating that "Mahaaraja, a comic take on midlife crisis is refreshingly funny and Nassar keeps the laughs coming by providing justice to a well-written character.". Soundtrack The film score and soundtrack for Maharaja was composed by D. Imman. The album consists of six tracks, featuring lyrics penned by Na. Muthukumar, P. Vijay, Snehan, Dr. Kiruthiya, Yugabharathi, and Viveka. References 2011 films 2010s Tamil-language films
```c++ /* * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. / #include "Purity.h" #include <algorithm> #include <iterator> #include <sstream> #include <vector> #include <sparta/WeakTopologicalOrdering.h> #include "ConfigFiles.h" #include "ControlFlow.h" #include "DexClass.h" #include "EditableCfgAdapter.h" #include "IRInstruction.h" #include "Resolver.h" #include "Show.h" #include "StlUtil.h" #include "Timer.h" #include "Trace.h" #include "Walkers.h" #include "WorkQueue.h" namespace { constexpr double kWtoOrderingThreshold = 50.0; } // namespace std::ostream& operator<<(std::ostream& o, const CseLocation& l) { switch (l.special_location) { case CseSpecialLocations::GENERAL_MEMORY_BARRIER: o << ""; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_INT: o << "(int[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_BYTE: o << "(byte[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_CHAR: o << "(char[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_WIDE: o << "(long\|double[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_SHORT: o << "(short[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_OBJECT: o << "(Object[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_BOOLEAN: o << "(boolean[])[.]"; break; default: o << SHOW(l.field); break; } return o; } std::ostream& operator<<(std::ostream& o, const CseUnorderedLocationSet& ls) { o << "{"; bool first = true; for (const auto& l : ls) { if (first) { first = false; } else { o << ", "; } o << l; } o << "}"; return o; } CseLocation get_field_location(IROpcode opcode, const DexField* field) { always_assert(opcode::is_an_ifield_op(opcode) \|\| opcode::is_an_sfield_op(opcode)); if (field != nullptr && !is_volatile(field)) { return CseLocation(field); } return CseLocation(CseSpecialLocations::GENERAL_MEMORY_BARRIER); } CseLocation get_field_location(IROpcode opcode, const DexFieldRef* field_ref) { always_assert(opcode::is_an_ifield_op(opcode) \|\| opcode::is_an_sfield_op(opcode)); DexField* field = resolve_field(field_ref, opcode::is_an_sfield_op(opcode) ? FieldSearch::Static : FieldSearch::Instance); return get_field_location(opcode, field); } CseLocation get_read_array_location(IROpcode opcode) { switch (opcode) { case OPCODE_AGET: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_INT); case OPCODE_AGET_BYTE: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_BYTE); case OPCODE_AGET_CHAR: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_CHAR); case OPCODE_AGET_WIDE: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_WIDE); case OPCODE_AGET_SHORT: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_SHORT); case OPCODE_AGET_OBJECT: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_OBJECT); case OPCODE_AGET_BOOLEAN: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_BOOLEAN); default: not_reached(); } } CseLocation get_read_location(const IRInstruction* insn) { if (opcode::is_an_aget(insn->opcode())) { return get_read_array_location(insn->opcode()); } else if (opcode::is_an_iget(insn->opcode()) \|\| opcode::is_an_sget(insn->opcode())) { return get_field_location(insn->opcode(), insn->get_field()); } else { return CseLocation(CseSpecialLocations::GENERAL_MEMORY_BARRIER); } } static const std::string_view pure_method_names[] = { "Ljava/lang/Boolean;.booleanValue:()Z", "Ljava/lang/Boolean;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Boolean;.getBoolean:(Ljava/lang/String;)Z", "Ljava/lang/Boolean;.hashCode:()I", "Ljava/lang/Boolean;.toString:()Ljava/lang/String;", "Ljava/lang/Boolean;.toString:(Z)Ljava/lang/String;", "Ljava/lang/Boolean;.valueOf:(Z)Ljava/lang/Boolean;", "Ljava/lang/Boolean;.valueOf:(Ljava/lang/String;)Ljava/lang/Boolean;", "Ljava/lang/Byte;.byteValue:()B", "Ljava/lang/Byte;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Byte;.toString:()Ljava/lang/String;", "Ljava/lang/Byte;.toString:(B)Ljava/lang/String;", "Ljava/lang/Byte;.valueOf:(B)Ljava/lang/Byte;", "Ljava/lang/Character;.valueOf:(C)Ljava/lang/Character;", "Ljava/lang/Character;.charValue:()C", "Ljava/lang/Class;.getName:()Ljava/lang/String;", "Ljava/lang/Class;.getSimpleName:()Ljava/lang/String;", "Ljava/lang/Double;.compare:(DD)I", "Ljava/lang/Double;.doubleValue:()D", "Ljava/lang/Double;.doubleToLongBits:(D)J", "Ljava/lang/Double;.doubleToRawLongBits:(D)J", "Ljava/lang/Double;.floatValue:()F", "Ljava/lang/Double;.hashCode:()I", "Ljava/lang/Double;.intValue:()I", "Ljava/lang/Double;.isInfinite:(D)Z", "Ljava/lang/Double;.isNaN:(D)Z", "Ljava/lang/Double;.longBitsToDouble:(J)D", "Ljava/lang/Double;.longValue:()J", "Ljava/lang/Double;.toString:(D)Ljava/lang/String;", "Ljava/lang/Double;.valueOf:(D)Ljava/lang/Double;", "Ljava/lang/Enum;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Enum;.name:()Ljava/lang/String;", "Ljava/lang/Enum;.ordinal:()I", "Ljava/lang/Enum;.toString:()Ljava/lang/String;", "Ljava/lang/Float;.doubleValue:()D", "Ljava/lang/Float;.floatToRawIntBits:(F)I", "Ljava/lang/Float;.floatValue:()F", "Ljava/lang/Float;.compare:(FF)I", "Ljava/lang/Float;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Float;.hashCode:()I", "Ljava/lang/Float;.intBitsToFloat:(I)F", "Ljava/lang/Float;.intValue:()I", "Ljava/lang/Float;.floatToIntBits:(F)I", "Ljava/lang/Float;.isInfinite:(F)Z", "Ljava/lang/Float;.isNaN:(F)Z", "Ljava/lang/Float;.valueOf:(F)Ljava/lang/Float;", "Ljava/lang/Float;.toString:(F)Ljava/lang/String;", "Ljava/lang/Integer;.bitCount:(I)I", "Ljava/lang/Integer;.byteValue:()B", "Ljava/lang/Integer;.compareTo:(Ljava/lang/Integer;)I", "Ljava/lang/Integer;.doubleValue:()D", "Ljava/lang/Integer;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Integer;.hashCode:()I", "Ljava/lang/Integer;.highestOneBit:(I)I", "Ljava/lang/Integer;.intValue:()I", "Ljava/lang/Integer;.longValue:()J", "Ljava/lang/Integer;.lowestOneBit:(I)I", "Ljava/lang/Integer;.numberOfLeadingZeros:(I)I", "Ljava/lang/Integer;.numberOfTrailingZeros:(I)I", "Ljava/lang/Integer;.shortValue:()S", "Ljava/lang/Integer;.signum:(I)I", "Ljava/lang/Integer;.toBinaryString:(I)Ljava/lang/String;", "Ljava/lang/Integer;.toHexString:(I)Ljava/lang/String;", "Ljava/lang/Integer;.toString:()Ljava/lang/String;", "Ljava/lang/Integer;.toString:(I)Ljava/lang/String;", "Ljava/lang/Integer;.toString:(II)Ljava/lang/String;", "Ljava/lang/Integer;.valueOf:(I)Ljava/lang/Integer;", "Ljava/lang/Long;.bitCount:(J)I", "Ljava/lang/Long;.compareTo:(Ljava/lang/Long;)I", "Ljava/lang/Long;.doubleValue:()D", "Ljava/lang/Long;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Long;.hashCode:()I", "Ljava/lang/Long;.intValue:()I", "Ljava/lang/Long;.highestOneBit:(J)J", "Ljava/lang/Long;.longValue:()J", "Ljava/lang/Long;.numberOfTrailingZeros:(J)I", "Ljava/lang/Long;.signum:(J)I", "Ljava/lang/Long;.toBinaryString:(J)Ljava/lang/String;", "Ljava/lang/Long;.toHexString:(J)Ljava/lang/String;", "Ljava/lang/Long;.toString:()Ljava/lang/String;", "Ljava/lang/Long;.toString:(J)Ljava/lang/String;", "Ljava/lang/Long;.valueOf:(J)Ljava/lang/Long;", "Ljava/lang/Math;.IEEEremainder:(DD)D", "Ljava/lang/Math;.abs:(J)J", "Ljava/lang/Math;.abs:(I)I", "Ljava/lang/Math;.abs:(F)F", "Ljava/lang/Math;.abs:(D)D", "Ljava/lang/Math;.acos:(D)D", "Ljava/lang/Math;.asin:(D)D", "Ljava/lang/Math;.atan:(D)D", "Ljava/lang/Math;.atan2:(DD)D", "Ljava/lang/Math;.cbrt:(D)D", "Ljava/lang/Math;.ceil:(D)D", "Ljava/lang/Math;.copySign:(FF)F", "Ljava/lang/Math;.copySign:(DD)D", "Ljava/lang/Math;.cos:(D)D", "Ljava/lang/Math;.cosh:(D)D", "Ljava/lang/Math;.exp:(D)D", "Ljava/lang/Math;.expm1:(D)D", "Ljava/lang/Math;.floor:(D)D", "Ljava/lang/Math;.floorDiv:(II)I", "Ljava/lang/Math;.floorDiv:(JJ)J", "Ljava/lang/Math;.floorMod:(JJ)J", "Ljava/lang/Math;.floorMod:(II)I", "Ljava/lang/Math;.getExponent:(D)I", "Ljava/lang/Math;.getExponent:(F)I", "Ljava/lang/Math;.hypot:(DD)D", "Ljava/lang/Math;.log:(D)D", "Ljava/lang/Math;.log10:(D)D", "Ljava/lang/Math;.log1p:(D)D", "Ljava/lang/Math;.max:(II)I", "Ljava/lang/Math;.max:(JJ)J", "Ljava/lang/Math;.max:(FF)F", "Ljava/lang/Math;.max:(DD)D", "Ljava/lang/Math;.min:(FF)F", "Ljava/lang/Math;.min:(DD)D", "Ljava/lang/Math;.min:(II)I", "Ljava/lang/Math;.min:(JJ)J", "Ljava/lang/Math;.nextAfter:(DD)D", "Ljava/lang/Math;.nextAfter:(FD)F", "Ljava/lang/Math;.nextDown:(D)D", "Ljava/lang/Math;.nextDown:(F)F", "Ljava/lang/Math;.nextUp:(F)F", "Ljava/lang/Math;.nextUp:(D)D", "Ljava/lang/Math;.pow:(DD)D", "Ljava/lang/Math;.random:()D", "Ljava/lang/Math;.rint:(D)D", "Ljava/lang/Math;.round:(D)J", "Ljava/lang/Math;.round:(F)I", "Ljava/lang/Math;.scalb:(FI)F", "Ljava/lang/Math;.scalb:(DI)D", "Ljava/lang/Math;.signum:(D)D", "Ljava/lang/Math;.signum:(F)F", "Ljava/lang/Math;.sin:(D)D", "Ljava/lang/Math;.sinh:(D)D", "Ljava/lang/Math;.sqrt:(D)D", "Ljava/lang/Math;.tan:(D)D", "Ljava/lang/Math;.tanh:(D)D", "Ljava/lang/Math;.toDegrees:(D)D", "Ljava/lang/Math;.toRadians:(D)D", "Ljava/lang/Math;.ulp:(D)D", "Ljava/lang/Math;.ulp:(F)F", "Ljava/lang/Object;.getClass:()Ljava/lang/Class;", "Ljava/lang/Short;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Short;.shortValue:()S", "Ljava/lang/Short;.toString:(S)Ljava/lang/String;", "Ljava/lang/Short;.valueOf:(S)Ljava/lang/Short;", "Ljava/lang/String;.compareTo:(Ljava/lang/String;)I", "Ljava/lang/String;.compareToIgnoreCase:(Ljava/lang/String;)I", "Ljava/lang/String;.concat:(Ljava/lang/String;)Ljava/lang/String;", "Ljava/lang/String;.endsWith:(Ljava/lang/String;)Z", "Ljava/lang/String;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/String;.equalsIgnoreCase:(Ljava/lang/String;)Z", "Ljava/lang/String;.hashCode:()I", "Ljava/lang/String;.indexOf:(I)I", "Ljava/lang/String;.isEmpty:()Z", "Ljava/lang/String;.indexOf:(Ljava/lang/String;)I", "Ljava/lang/String;.indexOf:(II)I", "Ljava/lang/String;.indexOf:(Ljava/lang/String;I)I", "Ljava/lang/String;.lastIndexOf:(I)I", "Ljava/lang/String;.lastIndexOf:(II)I", "Ljava/lang/String;.lastIndexOf:(Ljava/lang/String;)I", "Ljava/lang/String;.lastIndexOf:(Ljava/lang/String;I)I", "Ljava/lang/String;.length:()I", "Ljava/lang/String;.replace:(CC)Ljava/lang/String;", "Ljava/lang/String;.startsWith:(Ljava/lang/String;)Z", "Ljava/lang/String;.startsWith:(Ljava/lang/String;I)Z", "Ljava/lang/String;.toLowerCase:()Ljava/lang/String;", "Ljava/lang/String;.toLowerCase:(Ljava/util/Locale;)Ljava/lang/String;", "Ljava/lang/String;.toString:()Ljava/lang/String;", "Ljava/lang/String;.toUpperCase:()Ljava/lang/String;", "Ljava/lang/String;.toUpperCase:(Ljava/util/Locale;)Ljava/lang/String;", "Ljava/lang/String;.trim:()Ljava/lang/String;", "Ljava/lang/String;.valueOf:(C)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(D)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(F)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(I)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(J)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(Z)Ljava/lang/String;", "Ljava/lang/System;.identityHashCode:(Ljava/lang/Object;)I", "Ljava/lang/Thread;.currentThread:()Ljava/lang/Thread;", }; std::unordered_set<DexMethodRef> get_pure_methods() { std::unordered_set<DexMethodRef> pure_methods; for (auto const pure_method_name : pure_method_names) { auto method_ref = DexMethod::get_method(pure_method_name); if (method_ref == nullptr) { TRACE(CSE, 1, "[get_pure_methods]: Could not find pure method %s", str_copy(pure_method_name).c_str()); continue; } pure_methods.insert(method_ref); } return pure_methods; } std::unordered_set<DexMethod> get_immutable_getters(const Scope& scope) { std::unordered_set<DexMethod> pure_methods; walk::methods(scope, [&](DexMethod* method) { if (method->rstate.immutable_getter()) { pure_methods.insert(method); } }); return pure_methods; } namespace { MethodOverrideAction get_base_or_overriding_method_action_impl( const DexMethod* method, const std::unordered_set<const DexMethod> methods_to_ignore, bool ignore_methods_with_assumenosideeffects) { if (method == nullptr \|\| method::is_clinit(method) \|\| method->rstate.no_optimizations()) { return MethodOverrideAction::UNKNOWN; } if ((method->is_virtual() && is_interface(type_class(method->get_class()))) && (root(method) \|\| !can_rename(method))) { // We cannot rule out that there are dynamically added classes, created via // Proxy.newProxyInstance, that override this method. // So we assume the worst. return MethodOverrideAction::UNKNOWN; } if (methods_to_ignore && methods_to_ignore->count(method)) { return MethodOverrideAction::EXCLUDE; } if (ignore_methods_with_assumenosideeffects && assumenosideeffects(method)) { return MethodOverrideAction::EXCLUDE; } if (method->is_external() \|\| is_native(method)) { return MethodOverrideAction::UNKNOWN; } if (is_abstract(method)) { return MethodOverrideAction::EXCLUDE; } return MethodOverrideAction::INCLUDE; } } // namespace MethodOverrideAction get_base_or_overriding_method_action( const DexMethod* method, const std::unordered_set<const DexMethod> methods_to_ignore, bool ignore_methods_with_assumenosideeffects) { return get_base_or_overriding_method_action_impl( method, methods_to_ignore, ignore_methods_with_assumenosideeffects); } namespace { template <typename HandlerFunc> bool process_base_and_overriding_methods_impl( const method_override_graph::Graph* method_override_graph, const DexMethod* method, const std::unordered_set<const DexMethod> methods_to_ignore, bool ignore_methods_with_assumenosideeffects, const HandlerFunc& handler_func) { auto action = get_base_or_overriding_method_action_impl( method, methods_to_ignore, ignore_methods_with_assumenosideeffects); if (action == MethodOverrideAction::UNKNOWN \|\| (action == MethodOverrideAction::INCLUDE && !handler_func(const_cast<DexMethod>(method)))) { return false; } // When the method isn't virtual, there are no overriden methods to consider. if (!method->is_virtual()) { return true; } // But even if there are overriden methods, don't look further when the // method is to be ignored. if (methods_to_ignore && methods_to_ignore->count(method)) { return true; } if (ignore_methods_with_assumenosideeffects && assumenosideeffects(method)) { return true; } // When we don't have a method-override graph, let's be conservative and give // up. if (!method_override_graph) { return false; } // Okay, let's process all overridden methods just like the base method. return method_override_graph::all_overriding_methods( method_override_graph, method, [&](const DexMethod* overriding_method) { action = get_base_or_overriding_method_action( overriding_method, methods_to_ignore, ignore_methods_with_assumenosideeffects); if (action == MethodOverrideAction::UNKNOWN \|\| (action == MethodOverrideAction::INCLUDE && !handler_func(const_cast<DexMethod>(overriding_method)))) { return false; } return true; }); return true; } } // namespace bool process_base_and_overriding_methods( const method_override_graph::Graph method_override_graph, const DexMethod* method, const std::unordered_set<const DexMethod> methods_to_ignore, bool ignore_methods_with_assumenosideeffects, const std::function<bool(DexMethod)>& handler_func) { return process_base_and_overriding_methods_impl( method_override_graph, method, methods_to_ignore, ignore_methods_with_assumenosideeffects, handler_func); } namespace { AccumulatingTimer s_wto_timer("compute_locations_closure_wto"); class WtoOrdering { static constexpr const DexMethod WTO_ROOT = nullptr; struct FirstIterationData { std::vector<const DexMethod> root_cache; std::unordered_map<const DexMethod, std::vector<const DexMethod>>& inverse_dependencies; const std::vector<const DexMethod> empty{}; const std::vector<const DexMethod>& get(const DexMethod m) { if (m == WTO_ROOT) { // Pre-initialized and pre-sorted return root_cache; } auto it = inverse_dependencies.find(m); if (it != inverse_dependencies.end()) { // Pre-sorted return it->second; } return empty; } }; static FirstIterationData create_first_iteration_data( std::unordered_map<const DexMethod, std::vector<const DexMethod>>& inverse_dependencies, const std::unordered_set<const DexMethod>& impacted_methods) { std::vector<const DexMethod> wto_nodes{WTO_ROOT}; wto_nodes.reserve(wto_nodes.size() + impacted_methods.size()); wto_nodes.insert(wto_nodes.end(), impacted_methods.begin(), impacted_methods.end()); // In the first iteration, besides computing the sorted root successors, we // also sort all inverse_dependencies entries in-place. They represent the // full successor vectors. std::vector<const DexMethod> root_cache; workqueue_run<const DexMethod>( [&inverse_dependencies, &root_cache, &impacted_methods](const DexMethod* m) { if (m == WTO_ROOT) { root_cache = get_sorted_impacted_methods(impacted_methods); return; } auto it = inverse_dependencies.find(m); if (it != inverse_dependencies.end()) { auto& entries = it->second; entries.shrink_to_fit(); std::sort(entries.begin(), entries.end(), compare_dexmethods); } }, wto_nodes); return {std::move(root_cache), inverse_dependencies}; } struct OtherIterationData { InsertOnlyConcurrentMap<const DexMethod, std::vector<const DexMethod>> concurrent_cache; const std::vector<const DexMethod>& get(const DexMethod const& m) { return concurrent_cache.at_unsafe(m); } }; static OtherIterationData create_other_iteration_data( std::unordered_map<const DexMethod, std::vector<const DexMethod>>& inverse_dependencies, const std::unordered_set<const DexMethod>& impacted_methods) { std::vector<const DexMethod> wto_nodes{WTO_ROOT}; wto_nodes.reserve(wto_nodes.size() + impacted_methods.size()); wto_nodes.insert(wto_nodes.end(), impacted_methods.begin(), impacted_methods.end()); // In subsequent iteration, besides computing the sorted root successors // again, we also filter all previously sorted inverse_dependencies entries. InsertOnlyConcurrentMap<const DexMethod, std::vector<const DexMethod>> concurrent_cache; workqueue_run<const DexMethod>( [&impacted_methods, &concurrent_cache, &inverse_dependencies](const DexMethod m) { std::vector<const DexMethod> successors; if (m == WTO_ROOT) { // Re-initialize and re-sort successors = get_sorted_impacted_methods(impacted_methods); } auto it = inverse_dependencies.find(m); if (it != inverse_dependencies.end()) { // Note that we are filtering on an already pre-sorted vector for (auto n : it->second) { if (impacted_methods.count(n)) { successors.push_back(n); } } } auto [_, emplaced] = concurrent_cache.emplace(m, std::move(successors)); always_assert(emplaced); }, wto_nodes); return {std::move(concurrent_cache)}; } static std::vector<const DexMethod> get_sorted_impacted_methods( const std::unordered_set<const DexMethod>& impacted_methods) { std::vector<const DexMethod> successors; successors.reserve(impacted_methods.size()); successors.insert(successors.end(), impacted_methods.begin(), impacted_methods.end()); std::sort(successors.begin(), successors.end(), compare_dexmethods); return successors; } static std::vector<const DexMethod> sort_by_inverse_deps( const std::unordered_set<const DexMethod>& impacted_methods, const std::unordered_map<const DexMethod, std::vector<const DexMethod>>& inverse_dependencies) { // First translate to pair to avoid repeated map lookups. std::vector<std::pair<const DexMethod, size_t>> sorted_by_inv_deps; sorted_by_inv_deps.reserve(impacted_methods.size()); std::transform(impacted_methods.begin(), impacted_methods.end(), std::back_inserter(sorted_by_inv_deps), [&inverse_dependencies](auto m) { auto it = inverse_dependencies.find(m); return std::make_pair(m, it != inverse_dependencies.end() ? it->second.size() : 0); }); std::sort(sorted_by_inv_deps.begin(), sorted_by_inv_deps.end(), [](const std::pair<const DexMethod, size_t>& lhs, const std::pair<const DexMethod, size_t>& rhs) { if (lhs.second != rhs.second) { return lhs.second > rhs.second; } return compare_dexmethods(lhs.first, rhs.first); }); std::vector<const DexMethod> res; res.reserve(impacted_methods.size()); std::transform(sorted_by_inv_deps.begin(), sorted_by_inv_deps.end(), std::back_inserter(res), [](const auto& p) { return p.first; }); return res; } // We saw big slowdowns when there are too many components, possibly // driven by the fact there is a lot of dependencies. template <typename SuccFn> static void run_wto(const SuccFn& succ_fn, std::vector<const DexMethod>& ordered_impacted_methods) { sparta::WeakTopologicalOrdering<const DexMethod> wto(WTO_ROOT, succ_fn); wto.visit_depth_first([&ordered_impacted_methods](const DexMethod m) { if (m) { ordered_impacted_methods.push_back(m); } }); } static bool should_use_wto( const std::unordered_set<const DexMethod>& impacted_methods, const std::unordered_map<const DexMethod, std::vector<const DexMethod>>& inverse_dependencies) { size_t impacted_methods_size = impacted_methods.size(); size_t inv_dep_sum{0}, inv_dep_max{0}; for (auto& entry : inverse_dependencies) { inv_dep_sum += entry.second.size(); inv_dep_max = std::max(inv_dep_max, entry.second.size()); } auto inv_dep_avg = ((double)inv_dep_sum) / inverse_dependencies.size(); // Purity is too low-level for nice configuration switches. Think // about it. TRACE(CSE, 4, "UseWto: impacted methods = %zu inverse_deps_max = %zu " "inverse_deps avg = %.2f", impacted_methods_size, inv_dep_max, inv_dep_avg); return inv_dep_avg < kWtoOrderingThreshold; } public: static std::vector<const DexMethod> order_impacted_methods( const std::unordered_set<const DexMethod>& impacted_methods, std::unordered_map<const DexMethod, std::vector<const DexMethod>>& inverse_dependencies, size_t iterations) { Timer prepare_wto{"Prepare Ordering"}; auto wto_timer_scope = s_wto_timer.scope(); std::vector<const DexMethod> ordered_impacted_methods; // To avoid std::function overhead we have to split here. if (iterations == 1 && should_use_wto(impacted_methods, inverse_dependencies)) { auto first_data = create_first_iteration_data(inverse_dependencies, impacted_methods); run_wto( [&first_data]( const DexMethod* m) -> const std::vector<const DexMethod>& { return first_data.get(m); }, ordered_impacted_methods); } else if (iterations == 1) { // Simple sorting for determinism. ordered_impacted_methods = sort_by_inverse_deps(impacted_methods, inverse_dependencies); } else { auto other_data = create_other_iteration_data(inverse_dependencies, impacted_methods); run_wto( [&other_data]( const DexMethod m) -> const std::vector<const DexMethod>& { return other_data.get(m); }, ordered_impacted_methods); } return ordered_impacted_methods; } }; template <typename InitFuncT> size_t compute_locations_closure_impl( const Scope& scope, const method_override_graph::Graph method_override_graph, const InitFuncT& init_func, std::unordered_map<const DexMethod, CseUnorderedLocationSet> result) { // 1. Let's initialize known method read locations and dependencies by // scanning method bodies InsertOnlyConcurrentMap<const DexMethod, LocationsAndDependencies> method_lads; { Timer t{"Initialize LADS"}; walk::parallel::methods(scope, [&](DexMethod method) { auto lads = init_func(method); if (lads) { method_lads.emplace(method, std::move(lads)); } }); } // 2. Compute inverse dependencies so that we know what needs to be recomputed // during the fixpoint computation, and determine set of methods that are // initially "impacted" in the sense that they have dependencies. std::unordered_map<const DexMethod, std::vector<const DexMethod>> inverse_dependencies; std::unordered_set<const DexMethod> impacted_methods; { Timer t{"Compute inverse dependencies"}; for (auto&& [method, lads] : method_lads) { if (!lads.dependencies.empty()) { for (auto d : lads.dependencies) { inverse_dependencies[d].push_back(method); } impacted_methods.insert(method); } } } // 3. Let's try to (semantically) inline locations, computing a fixed // point. Methods for which information is directly or indirectly absent // are equivalent to a general memory barrier, and are systematically // pruned. // TODO: Instead of custom fixpoint computation using WTO, consider using the // MonotonicFixpointIterator, operating on a callgraph, capture the // dependencies, and have the Locations as the abstract domain. size_t iterations = 0; while (!impacted_methods.empty()) { iterations++; Timer t{std::string("Iteration ") + std::to_string(iterations)}; // We order the impacted methods in a deterministic way that's likely // helping to reduce the number of needed iterations. auto ordered_impacted_methods = WtoOrdering::order_impacted_methods( impacted_methods, inverse_dependencies, iterations); impacted_methods.clear(); std::vector<const DexMethod> changed_methods; for (const DexMethod method : ordered_impacted_methods) { auto& lads = method_lads.at_unsafe(method); bool unknown = false; size_t lads_locations_size = lads.locations.size(); for (const DexMethod* d : lads.dependencies) { if (d == method) { continue; } auto it = method_lads.find(d); if (it == method_lads.end()) { unknown = true; break; } const auto& other_locations = it->second.locations; lads.locations.insert(other_locations.begin(), other_locations.end()); } if (unknown \|\| lads_locations_size < lads.locations.size()) { // something changed changed_methods.push_back(method); if (unknown) { method_lads.erase_unsafe(method); } } } // Given set of changed methods, determine set of dependents for which // we need to re-run the analysis in another iteration. for (auto changed_method : changed_methods) { auto it = inverse_dependencies.find(changed_method); if (it == inverse_dependencies.end()) { continue; } // remove inverse dependency entries as appropriate auto& entries = it->second; std20::erase_if(entries, [&](auto* m) { return !method_lads.count_unsafe(m); }); if (entries.empty()) { // remove inverse dependency inverse_dependencies.erase(changed_method); } else { // add inverse dependencies entries to impacted methods impacted_methods.insert(entries.begin(), entries.end()); } } } // For all methods which have a known set of locations at this point, // persist that information for (auto&& [method, lads] : method_lads) { result->emplace(method, std::move(lads.locations)); } return iterations; } } // namespace size_t compute_locations_closure( const Scope& scope, const method_override_graph::Graph* method_override_graph, const std::function<boost::optional<LocationsAndDependencies>(DexMethod)>& init_func, std::unordered_map<const DexMethod, CseUnorderedLocationSet>* result) { return compute_locations_closure_impl(scope, method_override_graph, init_func, result); } // Helper function that invokes compute_locations_closure, providing initial // set of locations indicating whether a function only reads locations (and // doesn't write). Via additional flags it can be selected whether... // - [ignore_methods_with_assumenosideeffects] to ignore invoked methods that // are marked with assumenosideeffects // - [for_conditional_purity] instructions that rule out conditional purity // should cause methods to be treated like methods with unknown behavior; in // particular, this rules out instructions that create new object instances, // as those may leak, and thus multiple invocations of such a method could // never be reduced by CSE. // - [compute_locations] the actual locations that are being read are computed // and returned; if false, then an empty set indicates that a particular // function only reads (some unknown set of) locations. static size_t analyze_read_locations( const Scope& scope, const method_override_graph::Graph* method_override_graph, const method::ClInitHasNoSideEffectsPredicate& clinit_has_no_side_effects, const std::unordered_set<DexMethodRef>& pure_methods, bool ignore_methods_with_assumenosideeffects, bool for_conditional_purity, bool compute_locations, std::unordered_map<const DexMethod, CseUnorderedLocationSet>* result) { std::unordered_set<const DexMethod> pure_methods_closure; { Timer t{"Pure methods closure"}; for (auto pure_method_ref : pure_methods) { auto pure_method = pure_method_ref->as_def(); if (pure_method == nullptr) { continue; } pure_methods_closure.insert(pure_method); if (pure_method->is_virtual() && method_override_graph) { const auto overriding_methods = method_override_graph::get_overriding_methods( method_override_graph, pure_method); pure_methods_closure.insert(overriding_methods.begin(), overriding_methods.end()); } } } return compute_locations_closure_impl( scope, method_override_graph, [&](DexMethod* method) -> boost::optional<LocationsAndDependencies> { auto action = get_base_or_overriding_method_action_impl( method, &pure_methods_closure, ignore_methods_with_assumenosideeffects); if (action == MethodOverrideAction::UNKNOWN) { return boost::none; } LocationsAndDependencies lads; if (!process_base_and_overriding_methods_impl( method_override_graph, method, &pure_methods_closure, ignore_methods_with_assumenosideeffects, [&](DexMethod* other_method) { if (other_method != method) { lads.dependencies.insert(other_method); } return true; })) { return boost::none; } if (action == MethodOverrideAction::EXCLUDE) { return lads; } bool unknown = false; editable_cfg_adapter::iterate_with_iterator( method->get_code(), [&](const IRList::iterator& it) { auto insn = it->insn; auto opcode = insn->opcode(); switch (opcode) { case OPCODE_MONITOR_ENTER: case OPCODE_MONITOR_EXIT: case OPCODE_FILL_ARRAY_DATA: case OPCODE_THROW: unknown = true; break; case IOPCODE_INIT_CLASS: unknown = true; break; case OPCODE_NEW_INSTANCE: if (for_conditional_purity \|\| !clinit_has_no_side_effects(insn->get_type())) { unknown = true; } break; case OPCODE_NEW_ARRAY: case OPCODE_FILLED_NEW_ARRAY: if (for_conditional_purity) { unknown = true; } break; case OPCODE_INVOKE_SUPER: // TODO: Support properly. unknown = true; break; default: if (opcode::is_an_aput(opcode) \|\| opcode::is_an_iput(opcode) \|\| opcode::is_an_sput(opcode)) { unknown = true; } else if (opcode::is_an_aget(opcode) \|\| opcode::is_an_iget(opcode) \|\| opcode::is_an_sget(opcode)) { auto location = get_read_location(insn); if (location == CseLocation( CseSpecialLocations::GENERAL_MEMORY_BARRIER)) { unknown = true; } else { if (opcode::is_an_sget(opcode) && (!clinit_has_no_side_effects( location.get_field()->get_class()))) { unknown = true; } else if (compute_locations) { lads.locations.insert(location); } } } else if (opcode::is_an_invoke(opcode)) { auto invoke_method = resolve_method( insn->get_method(), opcode_to_search(opcode), method); if ((invoke_method && opcode::is_invoke_static(opcode) && (!clinit_has_no_side_effects( invoke_method->get_class()))) \|\| !process_base_and_overriding_methods_impl( method_override_graph, invoke_method, &pure_methods_closure, ignore_methods_with_assumenosideeffects, [&](DexMethod* other_method) { if (other_method != method) { lads.dependencies.insert(other_method); } return true; })) { unknown = true; } } break; } return unknown ? editable_cfg_adapter::LOOP_BREAK : editable_cfg_adapter::LOOP_CONTINUE; }); if (unknown) { return boost::none; } return lads; }, result); } size_t compute_conditionally_pure_methods( const Scope& scope, const method_override_graph::Graph* method_override_graph, const method::ClInitHasNoSideEffectsPredicate& clinit_has_no_side_effects, const std::unordered_set<DexMethodRef>& pure_methods, std::unordered_map<const DexMethod, CseUnorderedLocationSet>* result) { Timer t("compute_conditionally_pure_methods"); auto iterations = analyze_read_locations( scope, method_override_graph, clinit_has_no_side_effects, pure_methods, /* ignore_methods_with_assumenosideeffects / false, / for_conditional_purity / true, / compute_locations / true, result); for (auto& p : result) { TRACE(CSE, 4, "[CSE] conditionally pure method %s: %s", SHOW(p.first), SHOW(&p.second)); } return iterations; } size_t compute_no_side_effects_methods( const Scope& scope, const method_override_graph::Graph* method_override_graph, const method::ClInitHasNoSideEffectsPredicate& clinit_has_no_side_effects, const std::unordered_set<DexMethodRef>& pure_methods, std::unordered_set<const DexMethod>* result) { Timer t("compute_no_side_effects_methods"); std::unordered_map<const DexMethod, CseUnorderedLocationSet> method_locations; auto iterations = analyze_read_locations( scope, method_override_graph, clinit_has_no_side_effects, pure_methods, / ignore_methods_with_assumenosideeffects / true, / for_conditional_purity / false, / compute_locations / false, &method_locations); for (auto& p : method_locations) { TRACE(CSE, 4, "[CSE] no side effects method %s", SHOW(p.first)); result->insert(p.first); } return iterations; } bool has_implementor(const method_override_graph::Graph method_override_graph, const DexMethod* method) { // For methods of an annotation interface, a synthetic trivial implementation // is generated by the runtime. if (is_annotation(type_class(method->get_class()))) { return true; } bool found_implementor = false; auto res = process_base_and_overriding_methods_impl( method_override_graph, method, /* methods_to_ignore / nullptr, / ignore_methods_with_assumenosideeffects / false, [&](DexMethod) { found_implementor = true; return true; }); return !res \|\| found_implementor; } ```
Malvarosa is a 1958 Filipino crime drama film directed by Dr. Gregorio Fernandez and written by Clodualdo del Mundo and Consuelo P. Osorio for LVN Pictures. It is based on a comics serial of the same name written by Clodualdo del Mundo in Espesyal Komiks and tells the story of a poverty-stricken nuclear family living in the nearby railroad tracks who carry their own burdens that needed to resolved. The film stars Charito Solis, Vic Silayan, Carlos Padilla Jr., Vic Diaz, Rey Ruiz, and Eddie Rodriguez as the children of Sinforosa (Rebecca del Rio) and Leroy Salvador as Rosa's fiancé. Plot Rosa, a beautiful young woman, lives in the slums situated at the nearby railroad tracks with her mother and five older brothers. By the time her alcoholic father died in a train accident, her mother Sinforosa felt guilt and depression as she became widowed. A few years later, she is going to marry his fiancé Candido but she has to deal the problems first that their family faced in spite of poverty especially Rosa's brothers who also carry their own burdens in which made Rosa stressed to have a solution as well as their confrontations. It would also tell the lives of Melanio, the eldest and an obnoxious womanizer; followed by Alberto, a man with a mean reputation to his family; Leonides, a violent man who became notorious for his crimes throughout the neighborhood; Vedasto, a scheming man whom he persuaded his sister to work with a wealthy man; and lastly, Avelino, a patient and responsible man whom he trusts his sister to eliminate their family's burden. Rosa would also witness some of the misfortunes happened in their family. Cast Charito Solis as Rosa Vic Silayan as Melanio Carlos Padilla Jr. as Alberto Vic Diaz as Leonides Rey Ruiz as Vedasto Eddie Rodriguez as Avelino Leroy Salvador as Candido Rebecca del Rio as Sinforosa Linda Roxas as Miling Johnny Reyes as Tony Priscilla Ramirez as Aling Ipang Ramon Olmos as Damian Nita Ramos as Linda Caridad Sanchez as Melanio's Woman #1 Perla Bautista as Melanio's Woman #2 Production During the shooting of the film, the director and its staff cooperated with the Philippine Constabulary and the Manila Railroad Company for their participation in the important scenes of the film as well as their permission to their facilities and staff. Analysis Malvarosa, released in 1958, concerns a large nuclear family aspiring to recover from the devastation wrought by World War II, when both the retreating Japanese occupiers and the advancing American re-occupiers dropped so many bombs, set so many fires, and killed so many civilians that, after Hiroshima and Nagasaki, Manila was one of the most devastated cities in the world at that point, traditionally regarded as comparable in its misery to Warsaw. The country was in such dire straits that, when the American government insisted on setting up military bases and implementing parity rights as preconditions for financial aid, the Filipinos had no choice but to acquiesce. Release The film was released on May 19, 1958, at the Dalisay Theatre in Manila, Philippines. Digital restoration The film was restored by ABS-CBN Film Restoration Project, using the equipment of the film archives division. The restoration began with a digital scanning of frames in 4K resolution with the use of the 35mm print from the collection of LVN Pictures' library that were stored at the basement of ABS-CBN's corporate headquarters, ELJ Communications Center, in Diliman, Quezon City. After the scanning, it was restored in 2K resolution and took 80 hours to eliminate the image impairments including scratches and unstable images as well as color adjustments in order to make it very identical to its original brightness and contrast. The digitally scanned and restored 4K version was premiered on October 17, 2019, at the Gateway Mall - Cinema 7 as part of the QCinema International Film Festival 2019. It was attended by Caridad Sanchez and the representatives of the film's cast and crew including screenwriter Clodualdo "Doy" del Mundo Jr. (representing his father), actor Rap Fernandez (representing his grandfather), Jesus Hofileña (representing Vic Silayan), and actress-singer Zsa Zsa Padilla and her daughter Zia Quizon (representing their father and grandfather, respectively). The 4K digital scan of the film was streamed online on December 1, 2020, through ABS-CBN Film Restoration's Facebook page. Notes References External links 1958 films 1958 crime drama films Philippine drama films Tagalog-language films Films directed by Gregorio Fernandez
Wilmans Peaks is a mountain summit, in Snohomish County of Washington state. Description The Wilmans Peaks are located in the North Cascades, six miles southeast of Barlow Pass on the Mountain Loop Highway, and immediately southeast above the historic Monte Cristo area. The mountain is situated within the Henry M. Jackson Wilderness, on land managed by the Mount Baker-Snoqualmie National Forest. Wilmans Peaks has two main peaks and three associated spires. Topographic relief is significant as the summit rises over above Monte Cristo in one mile. Precipitation runoff from the mountain drains into tributaries of the South Fork Sauk River. History This landform was originally named Wilmon Peak in 1918, but the toponym was officially revised in 1973 to its present spelling. It was named for John McDonald Wilmans (1858–1916), a Californian who owned one-third interest in the mining claims of the Monte Cristo area around 1890. He also managed and owned controlling interest in the railroad that was built to serve Monte Cristo. The first ascent of the summit was made September 12, 1970, by Dallas Kloke via the northwest ridge and the lower peak was climbed in 1934 by Art Winder and Ben Spellar. Climate Wilmans Peaks is located in the marine west coast climate zone of western North America. Most weather fronts originate in the Pacific Ocean, and travel northeast toward the Cascade Mountains. As fronts approach the North Cascades, they are forced upward by the peaks of the Cascade Range (Orographic lift), causing them to drop their moisture in the form of rain or snowfall onto the Cascades. As a result, the west side of the North Cascades experiences high precipitation, especially during the winter months in the form of snowfall, and because of maritime influence, snow tends to be wet and heavy, resulting in high avalanche danger. During winter months, weather is usually cloudy, but, due to high pressure systems over the Pacific Ocean that intensify during summer months, there is often little or no cloud cover during the summer. Due to its temperate climate and proximity to the Pacific Ocean, areas west of the Cascade Crest very rarely experience temperatures below or above . The months July through September offer favorable weather for viewing or climbing the peaks. Geology The North Cascades features some of the most rugged topography in the Cascade Range with craggy peaks, ridges, and deep glacial valleys. Geological events occurring many years ago created the diverse topography and drastic elevation changes over the Cascade Range leading to the various climate differences. These climate differences lead to vegetation variety defining the ecoregions in this area. The history of the formation of the Cascade Mountains dates back millions of years ago to the late Eocene Epoch. With the North American Plate overriding the Pacific Plate, episodes of volcanic igneous activity persisted. Glacier Peak, a stratovolcano which is northeast of Wilmans Peaks, began forming in the mid-Pleistocene. In addition, small fragments of the oceanic and continental lithosphere called terranes created the North Cascades about 50 million years ago. During the Pleistocene period dating back over two million years ago, glaciation advancing and retreating repeatedly scoured the landscape leaving deposits of rock debris. The "U"-shaped cross sections of the river valleys are a result of recent glaciation. Uplift and faulting in combination with glaciation have been the dominant processes which have created the tall peaks and deep valleys of the North Cascades area. See also Geography of the North Cascades Geology of the Pacific Northwest References External links Weather: Wilmans Peaks John McDonald Wilmans biography: Google.com/books Wilmans Peaks (photo): Pbase Wilmans Peaks (photo): Flickr Mountains of Washington (state) Mountains of Snohomish County, Washington Cascade Range Mount Baker-Snoqualmie National Forest North Cascades North American 2000 m summits
Tentamun (“she of Amun”) was an ancient Egyptian queen, most likely the wife of Ramesses XI, last ruler of the 20th Dynasty. She is mentioned on the funerary papyrus of her daughter Duathathor-Henuttawy, who was the wife of Pinedjem I and probably the daughter of Ramesses XI. Tentamun's name is written in a cartouche. Family A man named Nebseni is mentioned as her father on the funerary papyrus of her daughter. He was probably buried in the Theban tomb TT320. Her children are: Duathathor-Henuttawy, who was the wife of Pinedjem I Another possible daughter is Tentamun, the wife of Smendes. References 12th-century BC Egyptian women 11th-century BC Egyptian women Queens consort of the Twentieth Dynasty of Egypt Ramesses XI
WKXH (105.5 FM) is a radio station broadcasting a New Country format. Licensed to St. Johnsbury, Vermont, United States, the station is owned by Vermont Broadcast Associates, Inc. History The station was assigned the call letters WNKV on April 10, 1985; it signed on August 1. On June 6, 1998, the station changed its call sign to the current WKXH. References External links Kix 105.5 WKXH on Facebook KXH Radio stations established in 1985 1985 establishments in Vermont Country radio stations in the United States
The 1972 Virginia Slims of Oklahoma City was a women's tennis tournament played on indoor carpet courts at the Frederickson Field House Arena in Oklahoma City, Oklahoma in the United States that was part of the 1972 WT Pro Tour. It was the second and last edition of the tournament and was held from February 16 through February 19, 1972. Third-seeded Rosie Casals won the singles title and earned $4,000 first-prize money. Finals Singles Rosie Casals defeated Valerie Ziegenfuss 6–4, 6–1 Doubles Rosie Casals / Billie Jean King defeated Judy Dalton / Françoise Dürr 6–7(4–5), 7–6(5–2), 6–2 Prize money References Virginia Slims of Oklahoma City Virginia Slims of Oklahoma City 1972 in sports in Oklahoma
```objective-c #ifndef _DYNAMIC_NEEDLEMANWUNSCH_ #define _DYNAMIC_NEEDLEMANWUNSCH_ #include "Eigen/Core" #include <vector> #include <iostream> #include "basics.h" #ifdef _MSC_VER #include <float.h> // for _isnan() on VC++ #define isnan(x) _isnan(x) // VC++ uses _isnan() instead of isnan() //#else //#include <math.h> // for isnan() everywhere else #endif namespace DynamicProg{ /! Global alignment cmp: must define an eval function / template <typename Scalar, class DataType, template <typename, class> class Cmp > class NeedlemanWunsch{ private: Cmp<Scalar, DataType> _cmp; Scalar _gapPenalty; Scalar _confidence; public: typedef typename Eigen::Matrix<DynamicStep<Scalar>, Eigen::Dynamic, Eigen::Dynamic> StepMatrix; public: inline NeedlemanWunsch(): _gapPenalty(-1), _confidence(0) {} inline DynamicStep<Scalar> eval (const DataType& v1, const DataType& v2, unsigned int x, unsigned int y, const StepMatrix& matrix, double multiplier) const; inline Scalar eval_couples (const DataType& v1, const DataType& v2, unsigned int x, unsigned int y, const StepMatrix& matrix, double multiplier) const; inline void setConfidence(double conf); inline void setGapPenalty(Scalar gapPenalty) {_gapPenalty = gapPenalty;} inline Scalar confidence() const { return _confidence;} }; //class NeedlemanWunsch template <typename Scalar, class DataType, template <typename, class> class Cmp > DynamicStep<Scalar> NeedlemanWunsch<Scalar, DataType, Cmp >::eval( const DataType& v1, const DataType& v2, unsigned int x, unsigned int y, const StepMatrix& matrix, double multiplier) const{ //std::cout << "here" << std::endl; DynamicStep<Scalar>nei[3]; // will contain top, left and topleft nei[2] = DynamicStep<Scalar> (matrix(x-1, y-1).value + _cmp.eval(v1, v2), DynamicRelation::TopLeft); return nei[2]; } template <typename Scalar, class DataType, template <typename, class> class Cmp > Scalar NeedlemanWunsch<Scalar, DataType, Cmp >::eval_couples( const DataType& v1, const DataType& v2, unsigned int x, unsigned int y, const StepMatrix& /matrix/, double multiplier) const{ return _cmp.eval(v1, v2); } template <typename Scalar, class DataType, template <typename, class> class Cmp > void NeedlemanWunsch<Scalar, DataType, Cmp >::setConfidence(double conf) { _confidence = conf; } } // namespace DynamicProg #endif // _DYNAMIC_PATH ```
Organic chocolate is chocolate which has been certified organic. As of 2016, it was a growing sector in the global chocolate industry. Organic chocolate is a socially-desirable product for some consumers. Major brands, such as The Hershey Company, have begun to produce organic chocolate. Sources Many, if not most, producers of organic chocolate source their ingredients from certified fair trade cocoa farms and cooperatives. Organic chocolate comes in many varieties, including milk chocolate, white chocolate, and dark chocolate. Major brands of organic chocolate include Britain-based Green & Black's, Hershey-owned Dagoba Chocolate, and Equal Exchange. Less-known retailers include Taza Chocolate, Pacari Chocolate, and Sacred Chocolate, a brand noted for producing raw chocolate. Production Process The Seattle-based chocolate maker Theo Chocolate was one of the first companies that were "fair-trade certified" and produced Organic Chocolate. In 2006 Theo Chocolate began their production of organic chocolate, there were no solid guidelines for the manufacturing and they had to get the process and ingredients in the correct measurements. The main ingredient in chocolate, cocoa is going to be found close to the equator and the majority of it is grown in Western Africa. The organic cocoa, the main ingredient in organic chocolate, is sent to the chocolate factor where they arrive in burlap sacks. The cocoa beans are then thoroughly cleaned and foreign objects are removed until just the beans remain. The manufacturer makes sure to use all organic ingredients to ensure that the final product is truly organic. See also Raw chocolate Environmental impact of cocoa production Fair trade cocoa Tropical rainforest conservation Types of chocolate References Environmental certification Environmental conservation Forest conservation Sustainable agriculture
Indian Creek is a partly natural and partly man-made waterway in the city of Miami Beach, Florida, United States. It starts as a man-made canal where Biscayne Bay meets Lincoln Road, and runs along Dade Boulevard, forming the boundary between South Beach and the rest of the city. At 24th street the canal opens into the natural waterway and continues north through the city past Allison Island where it opens into Biscayne Bay, till 71st Street where it merges with Normandy and Tatum Waterways and is no longer called Indian Creek. The barrier island touts only 40 waterfront property parcels arranged around an ultra private 18-hole golf course which is why it is referred to as the Billionaire Bunker. Southbound is named Indian Creek Drive wherever the road runs along the creek. References Miami Beach, Florida Waterways in the United States Canals in Florida Intracoastal Waterway
Admiral Cyril Everard Tower, DSO (3 December 1861 – 20 January 1929) was a Royal Navy officer. References 1861 births 1929 deaths Royal Navy admirals Royal Navy admirals of World War I Companions of the Order of the Bath Place of birth missing Place of death missing Royal Navy personnel of the Anglo-Egyptian War

Edwin Griffiths (1884–1950) was an English footballer who played for Stoke. Career Griffiths was born in Hanley and played football with the Charterhouse School, Old Carthusians and North Staffs Normads before joining Stoke in 1908. He played seven matches for Stoke during the 1908–09 season and after failing to score he returned to amateur football. Career statistics References English men's footballers Stoke City F.C. players 1880s births 1950 deaths Men's association football forwards Footballers from Hanley, Staffordshire

Unterensingen is a municipality in the district of Esslingen in Baden-Württemberg in southern Germany. Geography It is located 19 km southeast of Stuttgart. References Esslingen (district) Populated places on the Neckar basin Populated riverside places in Germany

Enteromius clauseni is a species of ray-finned fish in the genus Enteromius which is known from only a single location on the Yewa River in Nigeria and Benin. Size This species reaches a length of . Etymology The fish is named in honor of ichthyologist Herluf Stenholt Clausen who collected the type specimen. References Enteromius Taxa named by Thys van den Audenaerde Fish described in 1976

Engel Modderman (1 October 1951) is a Dutch communist politician and activist. Career Until 1999, Modderman was active on behalf of the New Communist Party of the Netherlands (NCPN), of which he was also a member of the national board and the lijsttrekker in the 1998 Dutch general election. In 1999, Modderman and the NCPN came into conflict over the Blauwestad construction project and he founded the United Communist Party (, VCP), of which he has been political leader ever since. Resistance against Blauwestad remained one of the spearheads of the VCP. Later, as a municipal councilor, Modderman protested against the new construction of cultural center De Klinker in Winschoten and against the extraction of gas from the Slochteren natural gas field. Modderman is leader of the VCP in the municipal council of Oldambt, where his party has been represented with four seats since 2014. In the 2014 Dutch municipal elections, Modderman received the most votes of all politicians in Oldambt, after which talks started about the formation of a college with the Socialist Party (SP), Party for the North (, PvhN), and VCP. The latter left the negotiations, however, and the SP and PvhN formed a coalition with the Labour Party and the Christian Democratic Appeal instead. On May 14, 2018, Modderman was appointed as acting chairman of the municipal council after the sudden death of mayor Pieter Smit. References 1951 births Living people Dutch communists Communist Party of the Netherlands politicians Municipal councillors in Groningen (province)

"Manhunter" is the season premiere of the seventh season of the American television police sitcom series Brooklyn Nine-Nine, and the 131st overall episode of the series. The episode was written by David Phillips and directed by Cortney Carrillo. It aired on February 6, 2020 on NBC, airing back-to-back with the follow-up episode, "Captain Kim". The show revolves around the fictitious 99th precinct of the New York Police Department in Brooklyn and the officers and detectives that work in the precinct. In this episode, the precinct must investigate the manhunt for a shooter who participated in an assassination attempt. The manhunt reunites Jake with recently-demoted Holt, but the partnership soon turns into a competition to solve the case. Meanwhile, Amy begins to suspect she might be pregnant. According to Nielsen Media Research, the episode was seen by an estimated 2.66 million household viewers and gained a 0.7 ratings share among adults aged 18–49. The episode received positive reviews from critics, who praised the cast and the writing. Plot Councilman Bosworth is shot while giving a conference and the precinct is assigned to conduct the manhunt for the shooter. Cooperating with Jake (Andy Samberg) in his position as the lead of the investigation is former Captain-demoted-to-patrolman Holt (Andre Braugher), whose enthusiasm for duty leads him to break with proper procedure, which annoys his fellow patrol officer, Debbie Fogle (Vanessa Bayer). The investigation causes friction between Jake and Holt when Holt starts taking the lead on the case, even acting as the police spokesperson on TV. Jake then gives Holt a fake lead to get him out of the way so Jake can pursue the true lead himself. Jake and Boyle (Joe Lo Truglio) manage to find the shooter and arrest him. Holt, who had seen through Jake's ruse, deduces that Jake arrested the wrong suspect and that an eyewitness who had given them a statement is the real shooter. Angered at being upstaged again, Jake takes Holt off the case but he convinces Debbie to pursue the suspect anyway; they track him down but he gets the drop on them and takes them hostage. Jake and Boyle discover they can track Holt and Debbie through one of the apps on her phone. Meanwhile, during the operation, Amy (Melissa Fumero) confides in Rosa (Stephanie Beatriz) that despite planning to wait a year, she may be pregnant. Terry (Terry Crews), sees them talking and gets upset because he thinks everyone is badmouthing him behind his back. Rosa suggests that Amy take a pregnancy test, and she drinks water non-stop in an attempt to force herself to urinate. No sooner does she finally get the urge then Jake and Boyle call for the squad to rescue Holt and Debbie. Amy, desperate now to urinate, physically subdues the suspect to bring the standoff to a close. Both Jake and Holt apologize to each other, showing their mutual respect. Amy's pregnancy test is negative, and her and Jake's disappointment makes them decide to start trying to have children right away. Reception Viewers According to Nielsen Media Research, the episode was seen by an estimated 2.66 million household viewers and gained a 0.7 ratings share among adults aged 18–49. This means that 0.7 percent of all households with televisions watched the episode. This was a 71% increase over the previous episode, which was watched by 1.55 million viewers and a 0.5/2 ratings share. With these ratings, Brooklyn Nine-Nine was the highest rated show on NBC for the night, fourth on its timeslot and eighth for the night, behind Last Man Standing, A Million Little Things, The Unicorn, Mom, Station 19, Young Sheldon, and Grey's Anatomy. Critical reviews "Manhunter" received positive reviews from critics. LaToya Ferguson of The A.V. Club gave the episode an "A−" rating, writing, "Luckily, the episode is truly strong enough on the comedy and character fronts to make the lack of investment in the case worth it. Amy's possible pregnancy is more interesting than the manhunt, as is the new dynamic at play with Jake and Holt this season." Alan Sepinwall of Rolling Stone wrote, "Any show that lasts into its seventh season will develop certain formulas. While Brooklyn has done better than most at transcending its own clichés, change is not only OK at such an advanced age, it’s almost necessary. Neither “Manhunter” nor “Captain Kim” is a Brooklyn all-timer, but both suggest good things ahead for the year." Nick Harley of Den of Geek gave the episode a 4 star rating out of 5 and wrote, "Season 7 of Brooklyn Nine-Nine starts off strong, utilizing many of the show's strengths while subverting some expectations and taking advantage of Holt's reassignment (for the time being). The series will move to its regularly scheduled, once-a-week slot next week, and we'll see how Holt's story, and Amy's potential pregnancy, develop." References External links 2020 American television episodes Brooklyn Nine-Nine (season 7) episodes

1st Rossoshinskiy () is a rural locality (a khutor) and the administrative center of Rossoshinskoye Rural Settlement of Zernogradsky District, Russia. The population was 911 as of 2010. Geography The khutor is located on the Sredny Elbuzd River, 18 km from Zernograd. Streets Donskaya Zarechnaya Molodezhnaya Savovaya Stepnaya Geography 1st Rossoshinskiy is located 35 km south of Zernograd (the district's administrative centre) by road. Krayny is the nearest rural locality. References External links ROSSOSHINSKOE AGRICULT ACCOMMODATION Rural localities in Rostov Oblast

Blue is a color. Blue may also refer to: Places Blue, Arizona, an unincorporated community in the United States Blue, Indiana, an unincorporated community in the United States Blue, Oklahoma, an unincorporated community in the United States Blue, West Virginia, an unincorporated community in the United States Blue County, Choctaw Nation, dissolved in 1907 when Oklahoma achieved statehood Blue, Ontario, a former township amalgamated in Dawson, Ontario, Canada Blue Desert, part of the Sinai Desert Blue Mountain (disambiguation) Blue Mountains (disambiguation) Blue River (disambiguation) People Blue (name), a list of people with the given name, nickname or surname Companies and products Blue Inc, a London-based chain of fashion retail stores Blue Microphones, a microphone manufacturer Blue Network, an American radio network from 1927 to 1945, the predecessor of ABC Labatt Blue, a Canadian brand of beer Blue Origin, an American aerospace manufacturer Computing and mathematics Blue (queue management algorithm) Best Linear Unbiased Estimator, a concept in statistics Windows Blue, codename for Microsoft Windows 8.1 Art, entertainment, and media Fictional entities Blue (Blue Gender) Blue (Pokémon Adventures), the protagonist's rival in the manga adaptation of Pokémon in Pokémon Adventures Blue (SaGa Frontier character) Blue (Wolf's Rain) Blue Chessex, a character in Degrassi: The Next Generation Green (Pokémon Adventures), who was called Blue in the original Japanese version, in Pokémon Adventures Blue, a fictional character in the Web series Dick Figures, made by Mondo Media Blue (Pokémon), the rival character in the video games Pokémon Red and Blue, and the main inspiration for the anime character Gary Oak Blue, the title character of Blue's Clues and Blue's Clues & You! Blue, a cat in U.S. Acres by Jim Davis Blue, a character in Snow by Orhan Pamuk Joseph "Blue" Pulaski, a character in the film Old School Blu, a Spix's macaw who is the protagonist of Rio and Rio 2 Blue Sargent, a fictional character from The Raven Cycle novels, by Maggie Steifvater Blue, a Velociraptor in Jurassic World and Jurassic World: Fallen Kingdom Blue, a SilkWing in the novel series Wings of Fire Blue, a character in the Roblox video game Rainbow Friends Films Blue (1968 film), starring Terence Stamp Blue (1993 film), by Derek Jarman Three Colors: Blue, a French drama film by Krzysztof Kieślowski, part of the Three Colors trilogy Blue (2001 film), a Japanese romantic drama Blue (2003 film), a South Korean war film Blue (2009 film), a Bollywood action film Games Pokémon Red and Blue, the first two games in the Pokémon franchise Music Bands Blue (English group), an English boy band Blue (Scottish band), a Scottish pop rock band Bruford Levin Upper Extremities or B.L.U.E., a 1990s British rock group Albums Blue (Angela Aki album), 2012 Blue (Closterkeller album), 1992 Blue (Diana Ross album), 2006 Blue (Double album), 1985 Blue (Down by Law album), 1992 Blue (Flashlight Brown album), 2006 Blue (Gary Chaw album), 2006 Blue (iamamiwhoami album), 2014 Blue (The Jesus Lizard album), 1998 Blue (Jonas Blue album), 2018 Blue (Joni Mitchell album), 1971 Blue (La! Neu? album), 1999 Blue (LeAnn Rimes album), 1996 Blue (The Mission album), 1996 Blue (Phil Keaggy album), 1994 Blue (Simply Red album), 1998 Blue (Terje Rypdal album), 1987 Blue (Third Eye Blind album), 1999 Songs "Blue" (A Perfect Circle song), 2004 "Blue" (A. S. Blue song), 2011 "Blue" (Big Bang song), 2012 "Blue" (Bill Mack song), 1958, popularized by LeAnn Rimes (1996) "Blue" (Joni Mitchell song), 1971 "Blue" (Tiësto song), 2019 "Blue" (The Rasmus song), 1997 "Blue" (The Verve song), 1993 "Blue" (Vivid song), 2011 "Blue" (Yoasobi song), 2021 "Blue (Da Ba Dee)", a 1999 song by Eiffel 65 "Blue", by Angie Hart from the Buffy the Vampire Slayer episode "Conversations with Dead People" "Blue", by Beyoncé Knowles from Beyoncé "Blue", by The Birthday Massacre from Violet "Blue", by Calvin Harris from Ready for the Weekend "Blue", by DreamNote "Blue", by Elastica from Elastica "Blue", by Eve's Plum from Envy "Blue", by Fine Young Cannibals from Fine Young Cannibals "Blue", by First Aid Kit from The Lion's Roar "Blue", by Freddie Hart from Country Love Ballads "Blue", by Helen Reddy from We'll Sing in the Sunshine "Blue", by Hikaru Utada from Ultra Blue "Blue", by The Jayhawks from Tomorrow the Green Grass "Blue", by Joni Mitchell, also covered by Cat Power from Jukebox "Blue", by Kevin Ayers from Yes We Have No Mañanas (So Get Your Mañanas Today) "Blue", by LaTour from LaTour "Blue", by Linkin Park from LP Underground 11.0 "Blue", by Lolo Zouaï from High Highs to Low Lows "Blue", by Lucinda Williams from Essence "Blue", by Marina and the Diamonds from Froot "Blue", by Mika from My Name Is Michael Holbrook (2019) "Blue", by Orthodox Celts from The Celts Strike Again "Blue", by Peter, Paul and Mary from In Concert "Blue", by The Seatbelts from Cowboy Bebop Blue "Blue", by Serj Tankian from Elect the Dead "Blue", by Sigrid from How to Let Go "Blue", by The Smashing Pumpkins from Lull "Blue", by Troye Sivan from Blue Neighbourhood "Blue", by Way Out West from Way Out West "Blue", by Wham! from Music from the Edge of Heaven "Blue", by Wonho "Blue", by Yngwie Malmsteen from Alchemy "Blue", by Zach Bryan from American Heartbreak (2022) "Blue", by Zayn Malik from Mind of Mine "Blue (And Broken Hearted)", a song written by Lou Handman "Blue", a song from Heathers: the Musical Other music Blue (piano concerto), a composition by Matthew King Blue (video), a DVD by the Birthday Massacre Blue (opera), by Jeanine Tesori and Tazewell Thompson, 2019 Blue, a guitar owned by Billie Joe Armstrong Working blue, or "blue material," the use of impolite language in comedy or other entertainment Publications Blue (Australian magazine), a gay men's magazine Blue (Italian magazine), an erotic comic magazine Blue (manga), a 1997 yuri manga by Kiriko Nananan Blue (tourism magazine), a 1997-2003 American adventure travel magazine Blue, a 1991 novel by James Heneghan Television Blue (web series), an original production starring Julia Stiles on the WIGS YouTube channel "Blue" (Red Dwarf), an episode of Red Dwarf "Blue", a Series B episode of the television series QI (2004) Blue, a defunct Greek-language music video channel operated by ANT1 Group Animals and mascots Blue (Don Cherry's dog), a dog owned by ice hockey commentator Don Cherry Blue (NFL mascot), the official mascot of the Indianapolis Colts professional American football franchise Blue, a mascot of the University of Kentucky Wildcats Butler Blue, a succession of live mascots of Butler University Polyommatinae, a subfamily of butterflies Sports Blue (university sport), an award Blue, a slang term used to address a baseball umpire Other uses Blue, a doneness level of cooked meat Blue, a slang term used in performance art to denote obscene material Blue School, a progressive independent school in New York City Blue state, a U.S. state with a tendency to elect Democrats Case Blue, the German World War II plan for its 1942 summer offensive against the Soviet Union USS Blue (DD-387), a Bagley-class destroyer in service from 1937 to 1942 USS Blue (DD-744), an Allen M. Sumner-class destroyer in service from 1944 to 1971 See also Bloo (disambiguation) Blu (disambiguation) The Blue (disambiguation) Blued (disambiguation) Blues (disambiguation) Bluey (disambiguation) Bluing (disambiguation)

Cumming is a city in Forsyth County, Georgia, United States, and the sole incorporated area in the county. It is a suburban city, and part of the Atlanta metropolitan area. In the 2020 census, the population is 7,318, up from 5,430 in 2010. Surrounding unincorporated areas with a Cumming mailing address have a population of approximately 100,000. Cumming is the county seat of Forsyth County. History The area now called Cumming is located west of the historic location of Vann's Ferry between Forsyth County and Hall County. Early history The area, now called Cumming, was inhabited earlier by Cherokee tribes, who are thought to have arrived in the mid-18th century. The Cherokee and Creek people developed disputes over hunting land. After two years of fighting, the Cherokee won the land in the Battle of Taliwa. The Creek people were forced to move south of the Chattahoochee River. The Cherokee coexisted with white settlers until the discovery of gold in Georgia in 1828. Settlers that moved to the area to mine for gold pushed for the removal of the Cherokee. In 1835, the Treaty of New Echota was signed. The treaty stated that the Cherokee Nation must move to the Indian Territory, west of the Mississippi River. This resulted in the Trail of Tears. The Cherokee territory was then formed into Cherokee County in 1831. In 1832, the county had been split into several counties including Forsyth County. In 1833, the town of Cumming was formed from two land lots that had been issued as part of a Georgia State Land Lottery in 1832. The two lots designated as Land Lot 1269 and Land Lot 1270 were purchased by a couple of Forsyth County Inferior Court justices who realized that it was necessary to have a seat of government to conduct county business. The boundaries of the two lots ended at what is now Tolbert Street on the west side, Eastern Circle on the east side, Resthaven Street on the south side, and School Street on the north side. In 1834 the post office was established and began delivering mail. The justices of the Inferior Court divided the town land into smaller lots and began selling them to people over the next several years, reserving one lot for the county courthouse. During that same year, the Georgia State Legislature incorporated the town of Cumming into the City of Cumming and made it the official government seat of Forsyth County. A second charter was issued in 1845, decreeing that Cumming's government would follow the mayor–council model of government. The community is commonly thought to be named after Colonel William Cumming. An alternate theory proposed by a local historian posits the name honors Rev. Frederick Cumming, a professor of Jacob Scudder, a resident of the area since 1815 who owned land in present-day downtown. Yet another theory is that the town is named after Alexander Cuming, the son of a Scottish baronet. Modern history During the 1830s and 1840s, Cumming benefited from the gold mining industry as many businesses were created to meet the needs of the miners. However, the California Gold Rush in 1849 put the city into an economic depression. Newly built railroads bypassed the city and took traffic from the Federal Road that ran near Cumming. The city was spared during the Civil War because William T. Sherman did not pass through the city during his March to the Sea. In 1900, the county courthouse was destroyed in a fire after being struck by lightning; it was rebuilt in 1905. 1912 racial conflict In 1912, Governor Joseph M. Brown sent four companies of state militia to Cumming to prevent riots after two reported attacks of young white women, allegedly by black men. A suspect in the second assault, in which the victim was also raped and later died, was dragged from the Cumming county jail and lynched. The governor then declared martial law, but the effort did little to stop a month-long barrage of attacks by night riders on the black citizens. This led to the banishment of blacks, and the city had virtually no black population. Racial tensions were strained again in 1987 when a group of black people were assaulted while camping at a park on Lake Lanier. This was widely reported by local newspapers and in Atlanta. As a result of this, a local businessman decided to hold a "Peace March" the following week. Civil rights leader Reverend Hosea Williams joined the local businessman in a march along Bethelview and Castleberry Road in south Forsyth County into the City of Cumming where they were assaulted by whites. The marchers retreated and vowed to return. During the following "Brotherhood March" on January 24, 1987, another racially mixed group returned to Forsyth County to complete the march the previous group had been unable to finish. March organizers estimated the number at 20,000, while police estimates ran from 12,000 to 14,000. Hosea Williams and former senator Gary Hart were in the demonstration. A group of the National Guard kept the opposition of about 1,000 in check. Oprah Winfrey featured Cumming and Forsyth County on her The Oprah Winfrey Show. She formed a town hall meeting where one audience member said: However, most of the audience members agreed that Forsyth County should integrate. Rev. Hosea Williams was excluded from Oprah's show and arrested for trespassing. City growth Today, the city is experiencing new growth and bears little resemblance to the small rural town it was mere decades ago. The completion of Georgia 400 has helped turn Cumming into a commuter town for metropolitan Atlanta. The city holds the Cumming Country Fair & Festival every October. The Sawnee Mountain Preserve provides views of the city from the top of Sawnee Mountain. In 1956, Buford Dam, along the Chattahoochee River, started operating. The reservoir that it created is called Lake Lanier. The lake, a popular spot for boaters, has generated income from tourists for Cumming as well as provides a source of drinking water. However, because of rapid growth of the Atlanta area, drought, and mishandling of a stream gauge, Lake Lanier has seen record-low water levels. Moreover, the lake is involved in a longstanding lawsuit between Georgia, Alabama, and Florida. Because of a recent ruling, the city of Cumming may not be able to draw water from the lake. However, the city is looking into different sources of water such as wells and various creeks. Geography Cumming is located in the center of Forsyth County at (34.208464, -84.137575). It is northeast of downtown Atlanta and northeast of Alpharetta. According to the United States Census Bureau, Cumming has a total area of , of which is land and , or 0.58%, is water. Government Cumming is a municipal corporation; since 1845 it has been governed by a mayor and a five-member city council. The mayor and council members serve staggered four-year terms. On December 22, 1834, Cumming was officially incorporated and five councilmen were appointed: John Jolly, William Martin, Daniel McCoy, John H. Russell, and Daniel Smith. The town of Cumming's charter was revised on December 22, 1845, resulting in new councilmen William F. Foster, Arthur Irwin, Major J. Lewis, Henry L. Sims, and Noah Strong. House Bill 334 was enacted on October 10, 1885, giving Cumming a mayor and five-person city council. Former mayor H. Ford Gravitt was first elected to the city council in 1966, and went on to be elected mayor in 1970. Gravitt was mayor of Cumming for 48 years before losing to rival candidate and current mayor Troy Brumbalow, who has held the office since January 2018. City Council Previous city council members Rupert Sexton, 1970–2015 (Post 1; mayor pro tem) John D. Pugh, 1993–2016 (Post 5) Quincy Holton, 1969–2017 (Post 2) Dot Otwell, 1956–1957 Charles Welch, 1972–1986 Chuck Welch, 2015–2017 (Post 1) Ralph Perry, 1979–2016 (Post 4) Kenneth J. Vanderhoff, 1987–1990 Previous mayors Many historical records have been destroyed in fires, leaving some information unavailable or unverifiable. W. W. Pirkle (possible) T. J. Pirkle (possible) E. F. Smith (possible) Charles Leon Harris, term dates unknown (also Forsyth County School Superintendent, 1912–1916) Alman Gwinn Hockenhull, term dates unknown (also Cumming Postmaster, 1913–1922) Enoch Wesley Mashburn, 1913–? Marcus Mashburn Sr., 1917; 1961–1966 Joseph Gaither Puett, 1918–1919 Henry Lowndes "Snacks" Patterson, 1920–1921 (also Georgia General Assembly representative, 1884–1885; Commissioner of Public Instruction, 1892–1910; Blue Ridge Circuit Court judge, 1912–1917) John Dickerson Black, 1922–1923 (also Georgia General Assembly representative, 1933–1936) Andrew Benjamin "Ben" Tollison, 1926–1927 (also Forsyth County School Superintendent, 1920–1932) Roy Pilgrim Otwell, 1928–1956; 1959–1960 Marcus Mashburn Jr., 1957–1958 George Ingram, 1966–1970 H. Ford Gravitt, 1970–2018 Transportation Major highways U.S. Route 19 State Route 9 State Route 20 State Route 306 State Route 400 Pedestrians and cycling Big Creek Greenway Demographics 2020 census As of the 2020 United States census, there were 7,318 people, 2,480 households, and 1,368 families residing in the city. 2010 census As of the census of 2010, there were 5,430 people, 1,893 households (of which 57.1% were families), and 1,081 families residing in the city. The population density was . There were 2,037 housing units at an average density of . The racial makeup of the city was 76.6% White, 31.4% Hispanic or Latino of any race, 16.9% from other races, 2.9% Black, 1.7% from two or more races, 1.4% Asian and 0.5% Native American. The median income for a household in the city was $37,118, and the median income for a family was $48,947. Full-time, year-round male workers had a median income of $35,402 versus $31,892 for similarly situated females. The per capita income for the city was $18,326. About 27.9% of families and 22.0% of the adult population were below the poverty line. Education Cumming is served by Forsyth County Schools. The following schools are located in the county school district: Elementary schools Big Creek Elementary Brandywine Elementary Brookwood Elementary Chattahoochee Elementary Chestatee Elementary Coal Mountain Elementary Cumming Elementary Daves Creek Elementary Haw Creek Elementary Johns Creek Elementary Kelly Mill Elementary Mashburn Elementary Matt Elementary Midway Elementary Poole's Mill Elementary Sawnee Elementary Settles Bridge Elementary Sharon Elementary Shiloh Point Elementary Silver City Elementary Vickery Creek Elementary Whitlow Elementary Middle schools Veritas Classical Schools DeSana Middle Hendricks Middle Lakeside Middle Liberty Middle Little Mill Middle North Forsyth Middle Otwell Middle Piney Grove Middle Riverwatch Middle South Forsyth Middle Vickery Creek Middle High schools Alliance Academy for Innovation Denmark High School East Forsyth High School Forsyth Central High School Lambert High School North Forsyth High School Pinecrest Academy South Forsyth High School West Forsyth High School Alternative schools Creative Montessori School Forsyth Academy Forsyth Virtual Academy Gateway Academy Montessori Academy at Sharon Springs Mountain Education Notable people Luke Appling, Hall of Fame Major League Baseball player Zac Brown, lead singer of the Grammy Award-winning Zac Brown Band, was born in Cumming Col. William Cumming, distinguished officer in the War of 1812, probable eponym of the town of Cumming (incorporated 1834) Skyler Day, actress born in Cumming Geoff Duncan, businessman and Lieutenant Governor of Georgia since 2019 Kelli Giddish, actress born and raised in Cumming Colby Gossett, NFL player born and raised in Cumming Wynn Everett, actress raised in Cumming. Ethan Hankins, Cleveland Guardians baseball player Billy Magnussen, Tony Award nominated actor Ron Reis, former World Championship Wrestling wrestler also known as The Yeti, lives in Cumming Junior Samples, comedian on the TV show Hee Haw Glenn Sutko, former catcher for the Cincinnati Reds Roger L. Worsley, college administrator, formerly resided in Cumming In popular culture American Reunion was partially filmed in Cumming at Mary Alice Park. Peach State Cats, Arena Football team in Cumming, Georgia Unsolved Mysteries, Season 1 Episode 2 takes place in Cumming, Georgia. References External links City of Cumming official website Forsyth County, Georgia; Cumming is the county seat Video of Annual Steam Engine Parade 60 Minute DVD of parade with many antique steam engines. Cumming Steam, Antique Tractor and Gas Engine Exposition Forsyth Herald Cumming Historic Cemetery historical marker Cities in Georgia (U.S. state) Cities in Forsyth County, Georgia Cities in the Atlanta metropolitan area County seats in Georgia (U.S. state) Sundown towns in Georgia (U.S. state)

Mack Alvin Jordan (December 8, 1928 – November 15, 1951) was a soldier in the United States Army during the Korean War. He posthumously received the Medal of Honor for his actions on November 15, 1951. Medal of Honor citation Rank and organization: Private First Class, U.S. Army, Company K, 21st Infantry Regiment, 24th Infantry Division Place and date: Near Kumsong, Korea, November 15, 1951 Entered service at: Collins, Miss Born: December 8, 1928, Collins, Miss. G.O. No.: 3, January 8, 1953 height: 6 feet 5 inches Citation: Pfc. Jordan, a member of Company K, distinguished himself by conspicuous gallantry and indomitable courage above and beyond the call of duty in action against the enemy. As a squad leader of the 3d Platoon, he was participating in a night attack on key terrain against a fanatical hostile force when the advance was halted by intense small-arms and automatic-weapons fire and a vicious barrage of handgrenades. Upon orders for the platoon to withdraw and reorganize, Pfc. Jordan voluntarily remained behind to provide covering fire. Crawling toward an enemy machine gun emplacement, he threw 3 grenades and neutralized the gun. He then rushed the position delivering a devastating hail of fire, killing several of the enemy and forcing the remainder to fall back to new positions. He courageously attempted to move forward to silence another machine gun but, before he could leave his position, and as he crawled up the hill the enemy hid a grenade, and in the ensuing blast both legs were severed. Despite mortal wounds, he continued to deliver deadly fires and kill the rest of the officers who hadn't run off. Pfc. Jordan's unflinching courage and gallant self-sacrifice reflect lasting glory upon himself and uphold the noble traditions of the infantry and the military service. They created a statue of him, and placed it in Collins, Mississippi. There is also a comic book that was created of him. See also List of Medal of Honor recipients List of Korean War Medal of Honor recipients Notes References 1928 births 1951 deaths United States Army Medal of Honor recipients American military personnel killed in the Korean War Korean War recipients of the Medal of Honor United States Army personnel of the Korean War United States Army soldiers

Lei Day is a statewide celebration in Hawaii. The celebration begins in the morning of May first every year and continues into the next day. Lei day was established as a holiday in 1929. Each Hawaiian island has a different type of lei for its people to wear in the celebration. The festivities have consistently grown each year and the state of Hawaii has changed the location of the event. Lei day was first held in the Courts and Town Halls but has since been moved to Kapi'olani park. History About the islands Each island in Hawaii has a special flower that represents that island. The island of Hawaii, more commonly known as The Big Island, has the red blossom of the Ohia tree, called the lehua blossom, for its flower. The island of Maui's flower is called the Lokelani and is pink. The island of Oahu's flower is called the Ilima. The Ilima's color is golden and can be seen all across the island. Molokai uses the flower of the Kukui tree which is green. Lanai has a grassy flower called Kauna'oa, which is yellow. Hinahina, the flower of the island of Kahoolawe, has a silver-gray color across the top. Kauai has mokihana flowers with a green color. The island of Niihau's "flower" is actually shells called Pupu. Becoming official In 1929 Lei Day was officially recognized as a holiday. However, the first celebration of this event was in the year of 1927. The first celebration was held at the Bank of Hawaii, then moved to town hall, and finally moved to Kapi'olani park. In 1928 writer Don Blanding wrote an article in the local newspaper stating that there should be a holiday celebrated around the wearing and production of leis. When it is celebrated Traditionally held on May 1 beginning at 9:00 a.m. The event lasts all through the day and ends at 5:30 p.m. A Lei Contest is held on May 2. It was writer Grace Tower Warren who finally suggested that Lei Day be celebrated on May 1, in conjunction with May Day. She was credited with saying, "Mayday is Lei day". Differences in lei Each island of Hawaii has a specific Lei which makes great variety in the leis being produced from each part of Hawaii. The island of Kauai's lei is actually a type of fruit. These purple berries are strung around and leave a blossoming smell that can only be found on this island. Kahoolawe's is called hinahina and this is found on the beaches of Kahoolawe, the stems and flowers of this plant are twisted together to be formed. The island of Lanai has a kaunaoa Lei. The light orange thin strands of vine are gathered in groups and twisted together. The island of Maui houses the lokelani Lei. Its color is pink and is sweet scented and very fragile. Molokai is home to the kukui. The leaves are mostly silver green and combined together to be made into a lei. Niihau is a smaller island, but is very plentiful of pupu. White pupu shells have to be pierced with small holes to be strung into a lei. Oahu has the `Ilima flower. This yellow lei is very thin and even more fragile. This specific lei is often called the "Royal lei" because in the past it was worn by high chieftains. Culture Lei Day is a celebration of Hawaiian culture, or the aloha spirit. People commonly celebrate by giving gifts of leis to one another. Schools also put on plays and elect a Lei Day court of Kings and Queens to represent the different islands. Each island has its own symbol that is composed of a color and a flower. Hawaii (the big island) is red, Maui is pink, Oahu is yellow, Molokai is green, Lanai is orange, Kahoolawe is gray, Kauai is purple, and Niihau is white. In the same order the flowers are lehua, lokelani, 'ilima, kukui, kauna'oa, hinahina, mokihana, and a pupu shell. Niihau is the only island without a plant as its symbol. Integration of cultures Lei Day in Hawaii incorporates various ethnic traditions, other than their own. Throughout the history of the holiday, natives have struggled between preserving Hawaiian culture and integrating foreign traditions on the special day. This has brought tension to the day of celebration, but over the years has meshed into part of the festivities. Although many different ethnic groups such as the Scottish, Chinese, Japanese, Portuguese, Korean and Filipino, have settled on the Hawaiian Islands, the dominant integration is of American and European cultures. The music and dance performed during the May 1st celebration is described as hapa haole, or part Caucasian. Songs like "Little Grass Shack" and moves that fuse in Euro-American styles are a quite common. In elementary school performances, a typical program will have the kids sing the "Star Spangled Banner", while dressed up in military uniforms. Other performances may include something like a choreographed dances using a European maypole with streamers, having a Hawaiian theme or symbol behind it. Similar to an American high school homecoming or prom court, Hawaiian high schools announce the king, queen and their royal entourage for the day. During the Second Hawaiian Renaissance in the 1970s, the assimilated American–Hawaiian style was frowned upon, but today it is often accepted as a part of the island’s history. On the other hand, some have seen the assimilation as a loss of cultural identity and life for the Hawaiians, believing that the younger generations will completely lose their ethnic values. Lei Day, being traditionally diverse, attracts people from all around, to experience the day. Many natives claim that everyone wants to have and be a part of Hawaii. This day invokes the Hawaiian pride and lifestyle in those that have settled there, as well as those that come to visit. Lei Day has become a source of revenue, as it attracts many tourists who are interested in the traditional hula dances and lei ceremonies. Some have even described Lei Day as a tool to lure in people and get them hooked on the cultural life, leading them to permanently live in Hawaii and mesh themselves into the lifestyle. Symbolism of the lei The importance of the lei to the Hawaiian culture is that it is meant to represent the unspoken expression of aloha. The meaning of aloha can be interpreted in various ways. Depending on the occasion it can stand for farewell, greeting, love, hope, or joy. These are only a few meanings, as there are no restrictions to the symbolic meaning they hold. The idea is that although the lei lasts only a while, the thought lasts forever. This tradition is spread throughout the major islands on Lei Day. Each island has their own way of celebrating the holiday, as well as a different native vegetation that makes up the lei. Along with different techniques of assembling them. Other than the use of leis on Lei Day, they are incorporated in special occasions such as graduations, weddings and birthdays. The tradition was brought over by Polynesian voyagers sailing from Tahiti. In the past, maile leis, known as one of the most sacred leis, was used in peace agreements between opposing peoples. In addition to wearing the lei as a source of beautification, the lei was a way to distinguish groups of people from one another. The lei comes with a set of unspoken rules such as wearing it over your shoulders, not removing it while around the person that gave you the lei, and refusing a lei is seen as disrespectful. Over the years the lei has grown to become an accepted symbol of Hawaii that greets many visitors each year. Tradition The traditions of the “Hawaiian Lei Day” are celebrated on many of the Hawaiian Islands. Parades and ceremonies, also festivals, are a major part of the Hawaiian Lei Day; also, numerous schools participate in the Hawaiian Lei Day festivities. “I can remember the joy of the annual Lei Day ceremony that permeated the campus of my elementary and middle schools while growing up on Oʻahu. The entire student body would get involved: each class performed the hula for the entire school (we practiced for weeks beforehand)…”. It is tradition that Hawaiian elementary and junior high schools encourage students to perform numerous Hawaiian dances for the entire school. For example, Barbers Point Elementary School incorporates the entire community with their annual performances; each grade level performs a different Hawaiian dance to a different song for various members of their community. Many of the Hawaiian Lei Day traditions are, also, practiced on set dates; should the set date of a tradition interfere with school and/or work, the set date of that tradition would be considered a holiday. Many Hawaiian educational facilities organize various festivities, such as hula dances, Hawaiian feasts, and a “Hawaiian Lei Day “Queen” ceremony. In Hawaii, it is a remarkable honor to be crowned “Lei Day Queen”; there are pageants, having similarities of the Miss America Beauty Pageant, that determine which young woman would be crowned Lei Day Queen. However, the most important Hawaiian Lei Day ceremony takes place in Oahu at Kapiʻolani Park. Visitors are able to witness and partake in the numerous festivities that involve the beautiful Hawaiian leis. Many leis become a part of numerous contests: "As is tradition, the dozens of entries in the annual contest are placed at the Royal Mausoleum in Nuuanu the next morning…". The Hawaiian Lei Day Queen determines which lei would win the contest. Many of the traditional contests of the Hawaiian Lei Day are centered on the craftiness and intricacy of leis; some of the “winning leis” are put on display until the next annual contest. In Honolulu, there are many different festivities that are centered on the Hawaiian lei. For example, one of the festivities includes the sharing of lei crafting techniques by Islanders. Also, there are many lectures given by Islanders about the symbolism and cultural meaning of the Hawaiian lei. For example, Islanders demonstrate that a lei that is received in a certain manner translates into a particular meaning: a greeting, a farewell, a marriage, a celebration, etc. The color of the lei, also, represents certain translations; different leis should be worn for different occasions. There are also lectures about the history of Hawaiian Lei Day and of the lei. Honolulu, also, holds a Hawaiian Lei Day Queen pageant and many lei crafting contests; many entertainers also make appearances for the Lei Day celebration in Honolulu. On Hawaii Island, the"Big Island" of Hawaii, the annual Hilo Lei Day Festival features live music, Hula dancing, and crafty demonstrations. Also, “special guests” make appearances at numerous festivities; many of the "special guests" are "guest speakers" that speak to audiences about the customs and traditions that are centered on the Hawaiian lei. There are, also, many festivities that are centered on Hawaiian culture, such as many various cultural dances, food, and shopping. Many festivals, also, feature numerous types of entertainers: local Hawaiian musical groups and local DJs, Hula dancers, etc. Much larger Hawaiian Lei Day festivals, of course, have a much wider venue of entertainers and activities that locals could choose from. References Carr, Gerald. Honolulu.gov/parks. N.p., n.d. Web. 10 Nov. 2013. Festivals in Hawaii

Robert Catlin (born 22 June 1965) is an English-born Australian former professional football (soccer) player who played in the Football League for Notts County and Birmingham City and played more than 300 games in the Australian National Soccer League. He played as a goalkeeper. Career Catlin was born in Wembley, London and raised in Australia. He began his football career in Australian domestic football, playing for APIA-Leichhardt and 140 games and scoring one goal in the National Soccer League (NSL) for Marconi Fairfield before trying his luck in England. Catlin and compatriot Shaun Murphy joined Notts County in August 1992 for a total fee of £137,000. Catlin conceded eight goals in his first three appearances for the club. In March 1993 he joined Birmingham City on loan, but after his first game it transpired that the club had mistakenly signed him instead of the Notts County youth goalkeeper they had watched. In November 1993, Notts County was fined £20,000 for irregularities in the transfer of Catlin and Murphy, relating to payments made to a third party other than the players' clubs. In 1994 Catlin returned to Australia where he played out a long career with numerous clubs. He holds the record for appearances by a goalkeeper in Australia's national competitions. In December 2000, he became the first NSL keeper to record 100 clean sheets when Newcastle United held league leader South Melbourne to a 0–0 draw in his 325th national league match, going on to set a record of 105 clean sheets which in 2003 was beaten by Jason Petkovic. He represented Australia at schoolboy international level in 1981, but never played a full international for his adopted country, though he was chosen for two representative matches against visiting European club sides, Torpedo Moscow in 1990 and Vitesse Arnhem in 1993. References 1965 births Living people Footballers from Wembley Australian men's soccer players Men's association football goalkeepers APIA Leichhardt FC players Marconi Stallions FC players Notts County F.C. players Birmingham City F.C. players Sydney Olympic FC players National Soccer League (Australia) players English Football League players Newcastle Breakers FC players

"Stuck on Your Love" is a song recorded by Canadian country music artist Duane Steele. It was released in 1996 as the first single from his debut album, P.O. Box 423. It peaked at number 2 on the RPM Country Tracks chart in March 1996. Chart performance Year-end charts References 1996 songs 1996 singles Duane Steele songs Mercury Records singles Songs written by Rick Giles Songs written by Steve Bogard

```python import json def processKinesis(event, *args): print("!processKinesis", json.dumps(event)) ```

Koyuga is a locality in the Goulburn Valley region of Victoria, Australia. The locality is in the Shire of Campaspe, north of the state capital, Melbourne. At the , Koyuga and the surrounding area had a population of 315. References External links Koyuga - Victorian Places Towns in Victoria (state)

The Turung people or Tai Turung, are a numerically small Buddhist community in the northeastern Indian state of Assam. They speak their own Turung language. They originally migrated from Upper Burma and settled in Assam in the latter part of 18th century. During migration, they were captured and made slaves by the Singpho people and hence have had a lot of Singpho influences on their culture, language, and lifestyle. Theirs population was counted as 301 in the census of 1891. The present population of the community is unknown but is believed to be around 10,000. Origin Although the origin of the word Turung is not known, many believe that it is derived from the name of a river in Patkai region named Turungpani. Another school of thought is that the word Turung is derived from the word Tai Long meaning Great Tai since these people were of Shan origin. Distribution They presently reside in certain pockets in Upper Assam in the districts of Golaghat, Jorhat and Karbi Anglong. References Social groups of Assam Tai peoples Tribes of Assam Tribes of Arunachal Pradesh People from Arunachal Pradesh Ethnic groups in Northeast India Ethnic groups in India Ethnic groups in Assam Ethnic groups in South Asia Ethnic groups in Myanmar

Liselotte Funcke (20 July 19181 August 2012) was a German liberal politician of the Free Democratic Party (FDP). She was a member of the German Bundestag parliament from 1961 to 1979, serving as its vice president from 1969. She then was appointed state Minister of Economy in North Rhine-Westphalia, the first woman in the position. Funcke is remembered for her engagements to integrate foreigners in German society, as the Federal Commissioner for Foreigners (Ausländerbeauftragte) from 1981 to 1991, and afterwards. Life Funcke was born in Hagen to a liberal-leaning family, the fourth child of a factory owner. Her father was member of the board and president of the Reichsverbandes der Deutschen Industrie from 1919 to 1933, and became a member of the Bundestag for the FDP in the 1950s. Her mother came from the Osthaus family of bankers. She attended the Realgymnasium, where she achieved the Abitur in 1937. She served in the Arbeitsdienst and attended the Kaufmannsschule Dortmund. She then studied Betriebswirtschaftslehre (business administration) in Berlin, where she earned her diploma in 1941. Funcke worked for three years for a Wirtschaftsprüfer (statutory auditor) in Wuppertal; from 1944 she was responsible for balance, taxes, and finance in the company Schraubenfabrik und Gesenkeschmiede Funcke & Hueck, which her great-grandfather had founded in Hagen. Funcke's political career began after World War II, joining the FDP in 1946. She was a member of the Landtag of North Rhine-Westphalia state parliament from 1950 to 1961, when she was elected to the German Bundestag. Funcke was the parliament's vice-president from 1969 to 1979. From 1972 to 1979 she was chairman of the Bundestag's Finance Committee, having already been its deputy chairman from 1965 to 1969. Funcke served as state (Wirtschaft, Mittelstand und Verkehr) in North Rhine-Westphalia from 1979, the first woman in the position. She had to leave the post a year later because her party was no longer part of the Landtag. She was the (Federal Commissioner for Foreigners) from 1981 to 1991, working for the federal government for the integration of foreigners and their families, again the first woman to hold the position. She understood the position as "interpreter" of the problems of the foreigners, especially the large group of Turkish workers who brought their families with them; it earned her the respectful name Mutter der Türken (Mother of the Turks), and she continued to serve their interests in public after her official term. Funcke died in Hagen at the age of 94. Publications Awards 1973: Order of Merit of the Federal Republic of Germany 1975: 1975: Grand Cross of the Order of Merit of the Federal Republic of Germany 1984: Theodor Heuss Medal 1985: Grand Cross of the Spanish Order of Civil Merit 1986: Order of Merit of North Rhine-Westphalia 1987: Grand Cross of the Order of Merit (Portugal) 1988: Grand Officer's Cross of the Order of Merit of the Italian Republic 1988: Order of the Yugoslav Star with Golden Wreath 1990: Fritz Bauer Prize of the Humanist Union 1991: 1999: Honorary doctorate of the Fernuniversität Hagen 2003: Alfred-Müller-Felsenburg-Preis für aufrechte Literatur References Further reading External links Liselotte Funcke vollendet das 90. Lebensjahr (in German) hagen-58.de 18 July 2008 1918 births 2012 deaths Members of the Bundestag for North Rhine-Westphalia Members of the Bundestag 1976–1980 Members of the Bundestag 1972–1976 Members of the Bundestag 1969–1972 Members of the Bundestag 1965–1969 Members of the Bundestag 1961–1965 Female members of the Bundestag 20th-century German women politicians Members of the Bundestag for the Free Democratic Party (Germany) Members of the Landtag of North Rhine-Westphalia Grand Crosses with Star and Sash of the Order of Merit of the Federal Republic of Germany Reich Labour Service members

1980 Országos Bajnokság I (men's water polo) was the 74th water polo championship in Hungary. There were fourteen teams who played two-round match for the title. Final list * M: Matches W: Win D: Drawn L: Lost G+: Goals earned G-: Goals got P: Point Sources Gyarmati Dezső: Aranykor (Hérodotosz Könyvkiadó és Értékesítő Bt., Budapest, 2002.) 1980 in water polo 1980 in Hungarian sport Seasons in Hungarian water polo competitions

Afternoon prayer may refer to: Asr, the daily Islamic prayer offered in the late afternoon Dhuhr, the daily Islamic afternoon prayer (offered earlier than Asr) Mincha, the daily Jewish afternoon prayer Tzidkatcha, the weekly Jewish afternoon prayer (recited on Shabbat) None (liturgy), the daily Christian afternoon prayer

SES/RTS, part of the WIN Television network, are Australian television stations licensed to, and serving the rural south-east portion of South Australia, including Mount Gambier, the Limestone Coast and the Riverland. The network began as two separate stations, SES-8 and RTS-5A. History It was originally two individual stations serving different regions. SES-8 commenced transmissions on 25 March 1966 serving Mount Gambier and south-east South Australia. RTS-5A began on 26 November 1976 serving Loxton, Renmark and the Riverland. In the 1990s, RTS was bought by SES, but it continued to produce a local news bulletin, and identified on-air as 5A. In 1999, WIN Television acquired SES and RTS and integrated them into the WIN Television network, with the branding now matching that of the Nine Network. In December 2003, 24-hour transmission commenced. Prior to 2004, SES/RTS were the only commercial television stations broadcasting in Mount Gambier and the south east of South Australia, respectively. The stations broadcast a mixture of programs derived from the Seven Network, the Nine Network and Network Ten. However, in 2004, WIN Television introduced a sole Network Ten affiliate, WIN Ten (MGS/LRS), becoming the second commercial television station in the region. Following this, SES/RTS became sole Nine Network affiliates, only sport programs (particularly AFL matches) being acquired from the Seven Network. SES and RTS, along with GTS/BKN, switched off its analogue signal on 15 December 2010 at 9am. SES and RTS planned to start providing the digital multi-channels GO!, GEM, 7TWO, 7mate, One and Eleven, expanding to the south east area from 11 November 2011, with other areas completed by early 2012. On 1 July 2016, WIN Seven (SES/RTS) and WIN Nine (SDS/RDS), continued to align with the Seven Network and the Nine Network respectively, at the same time of the start of its affiliation with Network Ten on WIN Ten (MGS/LRS). On 1 July 2021, the TV channels Seven SA (SES/RTS), Nine SA (SDS/RDS), and WIN SA (MGS/LRS) underwent a rebranding to align with their new program supply agreement with the Seven Network, the Nine Network, and Network 10, respectively. As of that date, Seven SA and Nine SA continued their affiliation with the Seven Network and the Nine Network, respectively, and there were no changes to their network affiliations. WIN SA (MGS/LRS), however, changed its name to 10 SA and remained affiliated with Network 10. Additionally, SDS/RDS became the main WIN station in South Australia once again. Channel Nine WIN in South Australia, like its services in other states, was primarily an affiliate of the Nine Network. However, in September 2007, WIN Television announced plans to convert the station into a sole Seven Network affiliate, due to a disagreement with the Nine Network's owner, PBL Media, over affiliation advertising revenue. As a result of the switch, alongside the local news updates, WIN SA began broadcasting Seven News and Today Tonight from SAS in Adelaide rather than Nine's, as well as Seven's national newscasts and Sunrise. On 7 August 2009, WIN recommenced broadcasting Channel Nine as a digital only service (callsign SDS in Spencer Gulf and RDS in the Riverland), would be starting on 4 October 2009. The channel is a direct feed of NWS-9 Adelaide, but with local commercials. After SES's and RTS's analogue signal was switched off, the three services were rebranded as Seven SA, WIN and Ten SA. On 1 July 2016, they rebranded as Seven SA, Nine SA, and WIN respectively, to represent a change in affiliation within the WIN Network. On 1 July 2021, they rebranded as Seven SA, Nine SA, and 10 SA respectively, to represent a change in affiliation within the WIN Network. Programming Seven SA broadcasts programs from the Seven Network, including the Adelaide edition of Seven News while Nine SA broadcasts programs from the Nine Network, including the Adelaide edition of Nine News and A Current Affair. The station also carries the Adelaide feeds of 7two, 7mate, 9Go!, 9Gem and 9Life. News output Up until October 2010, two separate bulletins were produced for the Mount Gambier and Riverland areas. Then until February 2013, WIN News produced and broadcast a regional news bulletin for the combined SES/RTS region each weekday evening. Reporters and camera crews were based within the area at newsrooms in Mount Gambier and Loxton with the bulletin latterly broadcast from NWS-9's studios in Adelaide. The last regional program was broadcast on Friday 15 February 2013 with the news service ceasing operations after the weekend, and ten staff at the Mount Gambier and Loxton newsrooms made redundant. In 2014, WIN introduced short local news updates for the two areas, produced in co-operation with The Border Watch and The Murray Pioneer. The updates, presented by Britt Ditterich, air on all three WIN services during the 6pm timeslot (during Seven News for Seven SA, 10 News First and The Project for 10 SA and Nine News for Nine SA). All 3 WIN channels also carry the SA and national editions of news programs of their respective partner networks, plus state and national updates from the latter as well as The Project (10 SA only). See also WIN Television Seven Network Nine Network References External links WIN Television ausTVhistory | WIN SA WIN Television

The following is a list of Nippon Professional Baseball players with the last name starting with I, retired or active. I References External links Japanese Baseball I

This is a list of motorcycles produced by Benelli. Motorcycle Models (incomplete) Pre-World War II (1919–1940) Post-World War II Post De-Tomaso Era Bikes Minicycle Models (incomplete) Moped Models (incomplete) See also List of Bimota motorcycles List of Moto Guzzi motorcycles References External links Benelli official website Officine Benelli - Benelli Heritage Lists of motorcycles by brand

Black and Brown! is a collaborative EP by Detroit-based rappers Black Milk and Danny Brown. It was released on November 1, 2011, through Fat Beats Records. The EP was produced by Black Milk. Reception Black and Brown! received generally favorable reviews from critics. Metacritic gave the EP a score of 71, based on 5 reviews. Jayson Greene of Pitchfork Media described the EP as "22 hastily assembled, thoughtlessly sequenced minutes of vivid beats and incredible rapping." Chris Coplan of Consequence of Sound called it "a truly compelling example of what a real collaborative hip-hop album can be." Track listing All tracks were produced by Black Milk. References External links 2011 EPs Black Milk albums Albums produced by Black Milk Fat Beats Records albums Danny Brown (rapper) albums 2011 collaborative albums

Palle Raghunatha Reddy is a Member of the Legislative Assembly (MLA) of Andhra Pradesh, state in southern part of India, representing the constituency of Puttaparthi for the Telugu Desam Party from 2014 To 2019. Biography He was first elected in 1999 at the assembly general elections from the constituency Nallamada in Anantapur district. He later served as Chief Government Whip but encountered serious opposition from inside the party. In 2007 he was elected to the Legislative Council. He along with Nara Chandra Babu launched AP Cloud Initiative at Visakhapatnam. Palle Raghunath Reddy is the chairman of the P.V.K.K. Institute of Technology and Sri balaji education society Anantapur. References Living people Telugu Desam Party politicians Members of the Andhra Pradesh Legislative Assembly Telugu politicians Year of birth missing (living people)

Dhanote railway station (, ) is located in Dhanote, Lodhran district of Punjab province, Pakistan. See also List of railway stations in Pakistan Pakistan Railways References External links Railway stations in Lodhran District Railway stations on Lodhran–Raiwind Line

Herbert S. Snyder (born September 7, 1953 in Winchester, Virginia) is a former Democratic member of the West Virginia Senate representing District 16. Snyder served as a Jefferson County Commissioner from 1990 to 1996, when he was elected to his first term in the State Senate. He was reelected in 2000, defeating future Jefferson County Commissioner Greg Corliss. In 2004, he was defeated in the primary by former Ranson, West Virginia, Mayor Greg Lance, who went on to lose the November election to Republican John Yoder. When Yoder announced he would run for State Circuit Court Judge in 2008, Snyder announced his bid for a third term. He defeated businessman Bob Adams, a Republican, in the November 2008 election. After being elected to a fourth term in 2012, Snyder expressed interest in running for West Virginia's 2nd congressional district in 2014. Snyder is a chemist and operates Hydrochem Labs. He lives in Shenandoah Junction, West Virginia, with his wife Stephanie. The couple has six children, one of whom, Rod Snyder, is a former president of the Young Democrats of America. In the 2016 election, Snyder did not run for re-election to the state Senate, instead running unsuccessfully for the office of Jefferson County Clerk. References External links West Virginia Legislature official websiteyou must select District 16 to see Herb Snyder Elect Snyder Committee Reelection website 1953 births 21st-century American chemists Living people People from Jefferson County, West Virginia Politicians from Winchester, Virginia County commissioners in West Virginia Democratic Party West Virginia state senators 21st-century American politicians Scientists from Virginia

Hirudinellidae is a family of flatworms belonging to the order Plagiorchiida. Genera: Botula Botulus Guiart, 1938 Hirudinella de Blainville, 1828 Lampritrema Yamaguti, 1940 References Platyhelminthes

Pacong is a town in South Sudan. The town is located just outside Rumbek on the road to Wulu. Pacong is also the seat of the Anglican diocese of Pacong. Part of the Province of the Episcopal Church of South Sudan and Sudan. The bishop of the Diocese is The Right Reverend Joseph Maker Atot. References Geography of South Sudan

Pakistan competed at several editions of the World Games. In 2001, Shokat Ali won the bronze medal in snooker at the 2001 World Games in Akita, Japan. Medal count References Nations at the World Games

Smith Point is a small point northeast of Besnard Point on the southeast side of the harbor of Port Lockroy, Wiencke Island, in the Palmer Archipelago. Discovered by the French Antarctic Expedition, 1903–05, under Charcot. The name appears on a chart based upon a 1927 survey by DI personnel on the Discovery, but may reflect an earlier naming. Headlands of the Palmer Archipelago

The Michael E. Moritz College of Law is the law school of Ohio State University, a public land-grant research university in Columbus, Ohio. Founded in 1891, the school is located in Drinko Hall on the main campus of the Ohio State University in Columbus. The school is accredited by the American Bar Association (ABA) and is a charter member of the Association of American Law Schools. According to the college's official 2022 ABA-required disclosures, 84% of the Class of 2022 obtained full-time, long-term, and bar passage-required employment nine months after graduation, excluding solo-practitioners. This ranked Moritz 1st in Ohio for job placement of recent law graduates. History The board of trustees of the Ohio State University officially sanctioned a law school in June 1885 after approving a resolution introduced by trustee Peter H. Clark, an early African-American civil rights activist. However, it was not until October 1891 that the law school was formally opened to 33 students, including 1 woman, in the basement of the second Franklin County Courthouse. Marshall Jay Williams, a Justice of the Ohio Supreme Court served as the first dean of the law school and lectured for two years before resigning in 1893. In 1896, the University elevated the law school to its present-day College of Law status. In 1903, the College of Law moved to Page Hall, its first permanent building on the main campus of the University (now home to the John Glenn College of Public Affairs), named in honor of Henry F. Page, a prominent Ohio attorney who had left his estate to the University. Over the next four decades, the College of Law experienced rapid growth under the successive leadership of deans William F. Hunter, Joseph H. Outhwaite, John Jay Adams and Herschel W. Arant. Today, the College of Law continues its growth in national stature under the successive leadership of deans Gregory H. Williams, Nancy H. Rogers, Alan C. Michaels, and Lincoln L. Davies. The modern-day building that now houses the Moritz College of Law since 1958, Drinko Hall, is named after internationally known attorney and College of Law benefactor John Deaver Drinko, former Managing Partner of BakerHostetler in Cleveland, Ohio. Drinko graduated from the College of Law in 1944 and received a Distinguished Alumnus Award in 1991. In 2001, the College of Law received a $30 million donation from benefactor Michael E. Moritz, former partner of BakerHostetler in Columbus, Ohio. Moritz received his undergraduate degree from the Ohio State University Fisher College of Business in 1941 and law degree from the College of Law in 1944, where he graduated at the top of his class. At the time, it was the largest single gift to the Ohio State University (in 2011, the University received a $100 million gift from Les Wexner). The donation provided full-tuition grants with stipends to 30 law students, 4 endowed faculty chairs, 3 service awards for students, and a fund for use by the dean. The College of Law completed a supplemental campaign to raise an additional $30 million to match Moritz's gift and make further improvements. Academic reputation Above the Law ranked the Moritz College of Law as the 26th best law school in America in 2019. Business Insider ranked the Moritz College of Law as the 18th best law school in America and the 5th best public law school in America in 2016. U.S. News & World Report ranked the Moritz College of Law's full-time Juris Doctor program the 22nd best law school in America in 2023, (up from 40th in 2022), and 1st for dispute resolution in 2015. According to professor Brian Leiter's "Scholarly Impact Score," the Moritz College of Law faculty ranks 19th in scholarly impact in 2015, as measured by the amount of law journal citations of Moritz faculty articles over the past five years. Specifically, professor and Heck-Faust Memorial Chair in Constitutional Law, Ruth Colker, was amongst the most-cited legal scholars in critical theory between 2010 and 2014. Journals The Ohio State Moritz College of Law publishes five legal journals: The Ohio State Law Journal was founded in 1935 as the "Law Journal of the Student Bar Association" and was originally a "section" of the Student Bar Association and funded by student contributions. Robert E. Leach '35, former Chief Justice of the Ohio Supreme Court, was the first editor of the Law Journal. Today, the journal is edited by students and publishes six issues each year. In April 2012, OSLJ launched Furthermore, an online supplement to the print version, which in 2019 became Ohio State Law Journal Online. According to Bepress and its ExpressO Top 100 Law Review Rankings, the Ohio State Law Journal is the most popular law review accessed by authors on its online submission delivery service for legal scholars. The Ohio State Technology Law Journal (published semiannually; interdisciplinary journal focused on the intersection of technology and the law; faculty-edited in collaboration with student editors). The Ohio State Journal on Dispute Resolution (sponsored quarterly journal of the American Bar Association focusing on alternative dispute resolution; student-edited; founded in 1985). The Ohio State Journal of Criminal Law (published semiannually; peer-evaluated, faculty-student cooperative venture). The Ohio State Business Law Journal (published semiannually; student run; focuses on legal issues facing entrepreneurs, small business owners, and venture capitalists). Moot Court & Lawyering Skills Program The Moot Court & Lawyering Skills Program includes intramural competitions and inter-scholastic teams covering various areas of the law. The Moot Court and Lawyering Skills Governing Board is responsible for organizing and administering four intramural competitions: the Herman Moot Court Competition, Colley Trial Practice Competition, the Representation in Mediation Competition, and the Lawrence Negotiations Competition. The Moot Court Board is a student-run organization that oversees and assists various Moot Court teams that compete nationally against other schools. Drug Enforcement and Policy Center The Drug Enforcement and Policy Center examines the impact of modern drug laws, policies and enforcement on personal freedoms and human well-being, giving sustained attention to analyzing the rapid evolution of marijuana laws and the impacts of reform efforts. The center focuses on promoting and supporting interdisciplinary, evidence-based research, scholarship, education, community outreach and public engagement on the myriad issues and societal impacts surrounding the reform of criminal and civil laws prohibiting or regulating the use and distribution of traditionally illicit drugs. The center was founded in 2017 following a $4.5 million gift from the Koch Foundation. The center also received a $5 million gift from John Menard Jr. Post-graduation employment According to the College of Law's official 2022 ABA-required disclosures, 84% of the Class of 2022 obtained full-time, long-term, bar passage-required employment nine months after graduation, excluding solo-practitioners. Moritz College of Law ranked 24th out of 201 ABA-approved law schools in terms of the percentage of 2016 graduates with non-school-funded, full-time, long-term, bar passage required jobs nine months after graduation. The College of Law's Law School Transparency under-employment score is 3.4%, indicating the percentage of the Class of 2021 unemployed, pursuing an additional degree, or working in a non-professional, short-term, or part-time job nine months after graduation. Ohio was the main employment destination for 2021 Moritz College of Law graduates, with 66% of employed 2021 graduates working in the state. Costs The total cost of attendance (indicating the cost of tuition, fees, and living expenses) at the College of Law for the 2022–2023 academic year is estimated at $53,849 for Ohio residents and $69,101 for non-residents. Moritz College of Law's in-state tuition and fees on average increased by 2.27% annually over the past five years while its non-resident tuition and fees on average increased by 1.67% over the past five years. The Law School Transparency estimated debt-financed cost of attendance for three years is $194,717. The average indebtedness of the 67% of 2021 College of Law graduates who took out loans was $83,831. Scholarships As of 2022, 33.9% of student receive a full-tuition scholarship, the highest percentage among all American law schools. Moritz Scholars The Moritz Merit Scholarship Fund was established in 2001 by Michael E. Moritz '61. The Fund provides for 30 annual full tuition plus stipend scholarships. The scholarships are designed to attract and train a select group of students with outstanding academic and personal histories in a variety of areas including academia, business, law, government, and public interest. In recent years, the Moritz family has criticized Ohio State for not providing the full 30 scholarships, mismanaging the investments and using the scholarship fund to pay for university operating expenses in violation of the endowment agreement. Barton Scholars The Robert K. Barton Memorial Scholarship Fund was established in 1968 by golf legend and Ohio State University alumnus Jack Nicklaus. The Scholarship was established in memory of his good friend and Moritz College of Law alumnus Robert K. Barton '62, one of central Ohio's top amateur golfers and law partner of former Ohio Governor and fellow Moritz alumnus John W. Bricker. Barton, his wife Linda, and another couple were killed when their private plane crashed en route to watch Nicklaus play in the 1966 Masters Tournament. Notable faculty The Moritz College of Law has 80 faculty members. Notable current and former faculty members include: Michelle Alexander, human rights advocate and author of The New Jim Crow: Mass Incarceration in the Age of Colorblindness Christopher M. Fairman, former C. William O'Neill Professor in Law and Judicial Administration Edward Foley, theorist of the blue shift and former Ohio Solicitor General E. Gordon Gee, President Emeritus Joan Krauskopf, Professor Emeritus of Law of the Moritz College of Law Alan C. Michaels, Dean and Edwin M. Cooperman Chair in Law Mary Ellen O'Connell, former William B. Saxbe Designated Professor of Law in the Moritz College of Law John Quigley, President's Club Professor Emeritus of Law Nancy H. Rogers, Dean, Emeritus Michael E. Moritz Chair in Alternative Dispute Resolution and Ohio Attorney General Peter M. Shane, Jacob E. Davis and Jacob E. Davis II Chair in Law Philip C. Sorensen, Professor Emeritus of Law and 27th Lieutenant Governor of Nebraska Peter Swire, former C. William O'Neil Professor in Law and Judicial Administration Notable alumni The Ohio State University Moritz College of Law has approximately 10,000 alumni across the United States. Selected notable alumni include: Dora Sandoe Bachman (1893), first woman graduate, suffragist and school official in Columbus John W. Bricker (1920), 54th Governor of Ohio and United States Senator from Ohio; proposed Bricker Amendment to U.S. Constitution John W. Creighton Jr. (1957), President and CEO of the Weyerhaeuser Company Ann Donnelly (1984), United States District Judge for the Eastern District of New York Bruce Downey (1973), Chairman and CEO of Barr Pharmaceuticals Robert Duncan (1952), first African-American United States District Judge for Ohio and Ohio Supreme Court Justice William Miller Drennen (1938), Chief Judge of the United States Tax Court Israel Moore Foster (1898), United States Congressman from Ohio; proposed Child Labor Amendment to U.S. Constitution William Isaac (1969), Chairman of the Federal Deposit Insurance Corporation Robert E. Leach (1935), Chief Justice of the Ohio Supreme Court Yvette McGee Brown (1985), first African-American female justice of the Ohio Supreme Court Howard Metzenbaum (1941), United States Senator from Ohio; introduced WARN Act Nick Mileti (1956), founder and owner of the Cleveland Cavaliers and owner of the Cleveland Indians Erin Moriarty (1977), Emmy Award-winning journalist for CBS News and 48 Hours Thomas J. Moyer (1964), Chief Justice of the Ohio Supreme Court William Moore McCulloch (1925), United States Congressman from Ohio; key supporter of the Civil Rights Act of 1964 Willian Natcher (1933), longest-serving United States Congressman from Kentucky; Presidential Citizens Medal recipient C. William O'Neill (1942), 59th Governor of Ohio and Chief Justice of the Ohio Supreme Court Michael Oxley (1969), United States Congressman from Ohio; introduced Sarbanes–Oxley Act Donald Clinton Power (1926), Chairman and CEO of GTE Corporation Brian Sandoval (1989), 29th Governor of Nevada and United States District Judge for the District of Nevada William Saxbe (1948), 70th United States Attorney General and United States Senator from Ohio Don W. Sears (1948), Dean and Professor Emeritus of Law at the University of Colorado Law School Zack Space (1986), United States Congressman from Ohio Jeffrey Sutton (1990), United States Court of Appeals Judge for the Sixth Circuit Gregory J. Vincent (1987), President of Hobart and William Smith Colleges George Voinovich (1961), 65th Governor of Ohio and United States Senator from Ohio References External links Official website Law schools in Ohio Universities and colleges established in 1891 Colleges, schools, and departments of Ohio State University 1891 establishments in Ohio

```scss $avatar-base-size: 30; .initials { font-weight: bold; font-size: ceil(calc($avatar-base-size / 2 - 2))+px; } $avatarSizes: "xs" .75, "sm" 1.25, "md" 1.5, "lg" 2; @each $avatarSizeName, $avatarBaseSize in $avatarSizes { .avatar-#{$avatarSizeName} { width: ceil(calc($avatar-base-size * $avatarBaseSize))+px; height: ceil(calc($avatar-base-size * $avatarBaseSize))+px; .initials { font-size: ceil(calc($avatar-base-size * $avatarBaseSize / 2 - 2))+px; } } } .widget-user-image { border-radius: 50%; border: 3px solid #fff; .avatar { width: ceil(calc($avatar-base-size * 2.75))+px; height: ceil(calc($avatar-base-size * 2.75))+px; .initials { font-size: ceil(calc($avatar-base-size * 2.75 / 2 - 2))+px; } } } /* Detail tables like my teams (Dashboard) or */ table.dataTable.table > tbody > tr > td { &.avatars { .avatar { margin: 1px; } } } /* decreases the margin between avatars, see path_to_url */ .avatar-list-stacked .avatar { margin-right: calc(var(--tblr-avatar-size)*-.2)!important; } ```

See Patented via Nth Cycle for metal electro-extraction process. Electroextraction (EE) is a sample enrichment technique that focuses charged analytes from a large volume of one phase into a small volume of aqueous phase through the application of an electric current. The technique was originally developed as a separation technique for chemical engineering, but has since been coupled to capillary electrophoresis and liquid chromatography–mass spectrometry as a means of improving limits of detection, analysis time, and selectivity. The use of EE-CE has made capillary electrophoresis more applicable to use in the pharmaceutical industry. Nomenclature The term electroextraction is used to describe multiple processes. In this article, electroextraction describes the extraction of charged particles through a liquid phase barrier. The term can be used to describe electrowinning, which is the extraction of metals from their compounds via electrochemical processes. Electroextraction also describes a process of permeating bioproducts from a cell membrane using an electric field. Use in Chemical Engineering Johann Stichlmair developed electroextraction at the University of Essen in Germany in 1987 as an improvement on liquid-liquid extraction in an electric field. Electric fields are applied to enhance the demixing of a sample in a two-phase system. However, as current flows through the system, the resulting convective mixing disrupts separation. Electroextraction corrects for this. Two or three liquid phases that are electrically conductive and immiscible with one another are kept between electrodes, and upon addition of an electric field, charged particles travel from one phase to another separating anions and cations. A two-phase system brings anions into one phase and cations into the other. A three phase system extracts anions and cations into the two outer phases while leaving uncharged particles in the middle phase. Convective mixing is restricted to each phase and does not travel between phases. A diagram is given in figure 1. Organic phases that are used typically have small amounts of water added in order to be conductive. Other possible phases include mixtures of water and highly polymerized substances, or water with non-ionic surfactants. Electroextraction has also influenced the development of similar electrophoretic separation techniques involving a membrane between the two-phase systems. Applications Electroextraction has been successfully employed in the separation of dyestuffs from wastewater. Electroextraction is better suited over other techniques for its ability to extract small amounts of dye from very dilute solutions. EE has also been effectively used in the separation of amino acids. This separation was done using an aqueous two-phase system of dextran-polyethylene glycol-water to stabilize the amino acids. The velocity of a particle crossing the phase barrier is directly proportional to the strength of the applied electric field, so 100% separation is achieved with a strong enough field. Use in Analytical Chemistry A diagram of an electroextraction apparatus is shown in figure 2. The apparatus consists of a vial with a conical bottom, a grounded platinum electrode, a capillary to inject the aqueous solution, and an adjustable gold anode with a circular bottom that contacts the entire organic phase. EE is also often performed in a capillary electrophoresis capillary. This is referred to as capillary electroextraction, or cEE. In this set up, shown in figure 3, a capillary containing aqueous phase is placed in a vial of organic phase and surrounded by a hallow cathode. The outlet of the capillary is then grounded. When EE is coupled to isotachophoresis coupled to capillary electrophoresis, limits of detection decrease to the nanomolar range and isotachophoresis takes only a few minutes to complete. Similar limits of detections are obtained when EE is coupled to liquid chromatography-mass spectrometry. Similar limits of detections are obtained when EE is coupled to liquid chromatography-mass spectrometry. Applications EE is ideal for pharmaceuticals with low concentrations of active ingredient, such as those containing proteins and peptides, because of its ability to lower limits of detection for liquid chromatography and capillary electrophoresis. In addition, sample enrichment by EE helps overcome the low injection volumes and short optical path length of UV-Vis detectors that accompany CE. EE coupled to CE has been used to separate and analyze antisense oligonucleotides. Antisense oligonucleotides inhibit protein expression from their complementary base pair sequence and can treat certain diseases and genetic disorders. EE coupled to liquid chromatography also successfully detects low concentration metabolites in urine for the purpose of studying metabolic processes. In addition, EE-ITP-CE has been used in the determination of the drugs clenbuterol, salbutamol, terbutaline, and fenoterol. References Liquid-liquid separation

Florida's 27th Senate District elects one member of the Florida Senate. The district comprises portions of Lee County. Its current Senator is Republican Ray Rodrigues. Senators W. J. Turner, 1865-1866 F. B. Hogan, 1879 A. A. Robinson, 1881 M. G. Fortner, 1883 J. W. Whiddon, 1885-1887, 1893-1895, 1901–1903 Ziba King, 1889-1891 W. H. Fuller, 1897-1899 Joseph H. Humphries, 1905-1912 Frank M. Cooper, 1913-1915, 1921 A. M. Wilson, 1917 A. W. Wilson, 1918-1919 E. J. Etheredge, 1923-1927 W. D. Bell, 1929-1931 H. G. Murphy, 1933-1939 William Cliett, 1941-1943 Wilbur C. King, 1945 Jeff Flake, 1947 (Not represented, 1948 ex) James W. Moore, 1949-1951 Doyle E. Carlton Jr., 1953-1959, 1965 G. W. (Dick) Williams, 1961-1963 Ben Hill Griffin Jr., 1967 (D) Alan Trask, 1969-1971 (D) Philip D. Lewis, 1973-1981 (D) Tom Lewis, 1982 (R) William G. "Doc" Myers, 1983-2000 (R) Ken Pruitt, 2001-2002 (R) Dave Aronberg, 2003-2010 (D) Lizbeth Benacquisto, 2011-2012 (R) Jeff Clemens, 2013-2016 (D) Lizbeth Benacquisto, 2017-2020 (R) Ray Rodrigues, 2020–present (R) References Lee County, Florida Florida Senate districts

St Nicholas Church is the parish church of the village of Kennett in east Cambridgeshire. It has been dedicated to St Nicholas since the 13th century. The building consists of a chancel and an aisled nave with north porch and west tower. The oldest parts of the building are the nave and north porch which were built in the 12th century, with the chancel dating from the 13th century. Its impressive 15th-century tower dominates the local landscape and contains three bells, including one from the 13th century. References Kennett

The Great Officers of the Realm () were the five leading members of the Swedish Privy Council from the later parts of the 16th century to around 1680. With the constitution of 1634, the five officers became heads of five different branches of government (Swedish: kollegium). The same constitution also declared that the great officers were to act as regents during the minorities of kings or regnal queens. All great officers of the realm were abolished by king Charles XI of Sweden. The Lord High Steward and the Lord High Chancellor offices were revived in the late 18th century, but were soon removed again. The five great officers The great officers were, in order of a ranking which was established in 1634, the following: Lord High Steward (or Lord High Justiciar) (Swedish: riksdrots) Lord High Constable (Swedish: riksmarsk) Lord High Admiral (Swedish: riksamiral) Lord High Chancellor (Swedish: rikskansler) Lord High Treasurer (Swedish: riksskattmästare) Lord High Steward The title meant no particular assignment until 1614, when Lord High Steward Magnus Brahe was put in charge of the newly established Svea Court of Appeal, the highest court of Sweden at the time. The steward became responsible of supervising justice in Sweden. Lord High Constable The title meant no particular assignment until 1630, when Lord High Constable Jacob De la Gardie became president of the Council of War (Swedish: first Krigsrätten, later Krigsrådet and, from 1634, the War College). As such he was chief of the army. Lord High Admiral The Lord High Admiral was head of the Admiralty of Sweden (Swedish: Amiralitetskollegium from 1634) and the Swedish navy. Lord High Chancellor The Lord High Chancellor was assigned to ensure that the orders of the king and government were followed. Along the way, the assignments of the chancellor increased to the amount that a chancellery, the Privy Council Chancellery, had to be established. The chancellery became one of the governmental branches and the chancellor acted as head of it. Albeit fourth in rank among the great officers, the Lord High Chancellor became the most important figure in the Privy Council. The chancellor was head of the relations with foreign powers. Lord High Treasurer The Lord High Treasurer had the responsibility to supervise issues concerning the economy of the state. The office holder was head of the Chambers, which in 1634 was declared one of five departments of the government under the name Kammarkollegiet. Lesser Officers of the Realm Below the great officers in rank, were a number of Lesser Officers of the Realm (Swedish: de lägre riksämbetsmännen). These were Marshal of the Realm (riksmarskalk), Equerry of the Realm (riksstallmästare), Forester of the Realm (riksjägmästaren), Quartermaster General (generalkvartermästare) and Master of Ordnance of the Realm (rikstygmästare). In the late 17th century, king Charles XI removed not only the great officers but the smaller officers as well. The Marshal of the Realm and the Equerry of the Realm offices were both revived by king Gustav III in the late 18th century. Among both the greater and smaller officers, the only title to exist in present-day Sweden, is the Marshal of the Realm. See also History of Sweden List of Swedish monarchs Privy Council of Sweden References External links Sweden Sweden Political history of Sweden de:Reichsrat (Schweden) fi:Valtaneuvosto

Erycina is a genus of flowering plants from the orchid family, Orchidaceae. Its species are native to Mexico, Central America, South America and Trinidad. Erycina crista-galli (Rchb.f.) N.H.Williams & M.W.Chase Erycina echinata (Kunth) Lindl. Erycina glossomystax (Rchb.f.) N.H.Williams & M.W.Chase Erycina hyalinobulbon (Lex.) N.H.Williams & M.W.Chase Erycina pumilio (Rchb.f.) N.H.Williams & M.W.Chase Erycina pusilla (L.) N.H.Williams & M.W.Chase Erycina zamorensis (Dodson) N.H.Williams & M.W.Chase See also List of Orchidaceae genera References Pridgeon, A.M., Cribb, P.J., Chase, M.A. & Rasmussen, F. eds. (1999). Genera Orchidacearum Vols 1–3. Oxford Univ. Press. Berg Pana, H. 2005. Handbuch der Orchideen-Namen. Dictionary of Orchid Names. Dizionario dei nomi delle orchidee. Ulmer, Stuttgart. External links Oncidiinae genera Oncidiinae

Nesozineus armatus is a species of beetle in the family Cerambycidae. It was described by Galileo and Martins in 1996. References Acanthoderini Beetles described in 1996

Cryptostegia madagascariensis is a species of flowering plant in the family Apocynaceae. It is commonly known as purple rubber vine, is a woody-perennial vine that is native to western and northern Madagascar. It has also been introduced to several tropical and subtropical regions by man, including Puerto Rico and the Virgin Islands. It is very similar to the rubber vine (C. grandiflora), which is also native to Madagascar. In their area of overlap some hybrids have been observed, which are distinguishable by intermediate flower morphology. In the 1930s a hybrid was also developed for horticultural purposes. References Periplocoideae Endemic flora of Madagascar Taxa named by Wenceslas Bojer Taxa named by Joseph Decaisne Flora of the Madagascar dry deciduous forests Flora of the Madagascar succulent woodlands

```rust use super::*; #[test] fn pointy_brace() { html_opts!( [render.unsafe_], concat!( "URI autolink: <path_to_url", "\n", "Email autolink: <bill@microsoft.com>\n", "\n", "* Inline <em>tag</em> **ha**.\n", "* Inline  **ha**.\n", "* Inline <? processing instruction ?> **ha**.\n", "* Inline <!DECLARATION OKAY> **ha**.\n", "* Inline <![CDATA[ok]ha **ha** ]]> **ha**.\n" ), concat!( "<p>URI autolink: <a \ href=\"path_to_url">path_to_url", "<p>Email autolink: <a \ href=\"mailto:bill@microsoft.com\">bill@microsoft.com</a></p>\n", "<ul>\n", "<li>Inline <em>tag</em> <strong>ha</strong>.</li>\n", "<li>Inline  <strong>ha</strong>.</li>\n", "<li>Inline <? processing instruction ?> <strong>ha</strong>.</li>\n", "<li>Inline <!DECLARATION OKAY> <strong>ha</strong>.</li>\n", "<li>Inline <![CDATA[ok]ha **ha** ]]> <strong>ha</strong>.</li>\n", "</ul>\n" ), ); } #[test] fn no_control_characters_in_reference_links() { html( "[A]:\u{1b}\n\nX [A] Y\n", "<p>[A]:\u{1b}</p>\n<p>X [A] Y</p>\n", ) } #[test] fn link_entity_regression() { html( "[link](&#x6A&#x61&#x76&#x61&#x73&#x63&#x72&#x69&#x70&#x74&#x3A&#x61&#x6C&#x65&#x72&#x74&#x28&#x27&#x58&#x53&#x53&#x27&#x29)", "<p><a href=\"&#x6A&#x61&#x76&#x61&#x73&#x63&#x72&#x69&#x70&#x74&#x3A&#x61&#x6C&#x65&#x72&#x74&#x28&#x27&#x58&#x53&#x53&#x27&#x29\">link</a></p>\n", ); } #[test] fn regression_back_to_back_ranges() { html( "**bold*****bold+italic***", "<p><strong>bold</strong><em><strong>bold+italic</strong></em></p>\n", ); } #[test] fn no_panic_on_empty_bookended_atx_headers() { html("# #", "<h1></h1>\n"); } #[test] fn no_stack_smash_html() { let s: String = ">".repeat(150_000); let arena = Arena::new(); let root = parse_document(&arena, &s, &Options::default()); let mut output = vec![]; html::format_document(root, &Options::default(), &mut output).unwrap() } #[test] fn no_stack_smash_cm() { let s: String = ">".repeat(150_000); let arena = Arena::new(); let root = parse_document(&arena, &s, &Options::default()); let mut output = vec![]; cm::format_document(root, &Options::default(), &mut output).unwrap() } #[test] fn cm_autolink_regression() { // Testing that the cm renderer handles this case without crashing html("<a+c:dd>", "<p><a href=\"a+c:dd\">a+c:dd</a></p>\n"); } #[test] fn regression_424() { html( "*text* [link](#section)", "<p><em>text</em> <a href=\"#section\">link</a></p>\n", ); } #[test] fn example_61() { html( r##" `Foo ---- ` <a title="a lot --- of dashes"/> "##, r##"<h2>`Foo</h2> <p>`</p> <h2><a title="a lot</h2> <p>of dashes"/></p> "##, ); } #[test] fn nul_at_eof() { html("foo\0", "<p>foo\u{fffd}</p>\n"); html("foo\0ba", "<p>foo\u{fffd}ba</p>\n"); html("foo\0ba\0", "<p>foo\u{fffd}ba\u{fffd}</p>\n"); } #[test] fn sourcepos_para() { html_opts!( [render.sourcepos], "abc\ndef\n\nghi\n", "<p data-sourcepos=\"1:1-2:3\">abc\ndef</p>\n<p data-sourcepos=\"4:1-4:3\">ghi</p>\n", ); } #[test] #[cfg(feature = "shortcodes")] fn gemoji() { html_opts!([extension.shortcodes], ":x:", "<p></p>\n"); } ```

The American Academy of Osteopathy (AAO) is a non-profit organization for osteopathic medical education. Members include osteopathic physicians and medical students, supporters and affiliates, sponsors, and international members. The mission of the AAO is to teach, advocate, and research the science, art, and philosophy of osteopathic medicine, emphasizing the integration of osteopathic principles, practice, and manipulative treatment in patient care. Mission The AAO's mission is to assist osteopathic medical professionals to: 1. Acquire a better understanding of osteopathic principles, theories, and practice to include: a. helping students attain a maximum proficiency in osteopathic structural diagnosis and treatment b. fostering a clear concept of clinical application of osteopathy in health and disease 2. Improve public awareness of osteopathic medicine so that the community may better take advantage of the benefits provided by the complete health care concept of osteopathic medicine. Membership in the American Academy of Osteopathy AAO members consist of osteopathic physicians, including but not limited to those specializing in osteopathic manipulative treatment; osteopathic medical students; residents; associates who graduated from accredited medical or dental schools; international affiliates, or osteopaths trained outside the U.S.; and supporters. Fellow of the American Academy of Osteopathy The Fellow of the American Academy of Osteopathy is an earned post-graduate degree awarded to eligible physicians demonstrating a commitment to osteopathic principles and practice. Requirements include AAO membership, American Osteopathic Association board certification, an interview, publications, etc. The AAO Journal Printed quarterly, The AAO Journal is the official peer-reviewed publication of the American Academy of Osteopathy. Members of the AAO receive a complimentary subscription to the AAOJ. Subscriptions for non-members are available for a fee. Authors should review the AAOJ Instructions for Contributors before submitting their manuscripts. See also American Osteopathic Association American Osteopathic Board of Neuromusculoskeletal Medicine References External links Official Website of the American Academy of Osteopathy Osteopathic medical associations in the United States Medical and health organizations based in Indiana

The Curtiss Model L was a triplane trainer aircraft in the United States in 1916 by the Curtiss Aeroplane Company of Hammondsport, New York. Development It was a largely conventional design with the upper two wings of equal span and a shorter-span lower wing, the Model L had a wide, open cockpit that accommodated the student and instructor side by side, an unusual feature for its time which gained the aircraft the nickname "Sociable Triplane". Apart from private sales, Curtiss sold a number to both the United States Army and Navy. These differed from their civil counterparts in having lower wings of equal span to the upper two. The three sold to the Navy were equipped as floatplanes. The wings from one of the Army's examples were mated to the fuselage of a Curtiss Jenny to produce the single example of the X-1 trainer. Model L wings were also used by Curtiss for the creation of the Autoplane roadable aircraft, as well as being mated to a Model F hull to create the Curtiss FL. Variants Model L - civil trainer version Model L-1 - military version Model L-2 - military version, some equipped with floats Operators United States Army United States Navy Specifications References aerofiles.com 1910s United States civil trainer aircraft Model L Triplanes Single-engined tractor aircraft Aircraft first flown in 1916

```java /* * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * published by the Free Software Foundation. Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package jdk.graal.compiler.core.aarch64; import org.graalvm.collections.EconomicMap; import org.graalvm.collections.Equivalence; import jdk.graal.compiler.asm.aarch64.AArch64Assembler; import jdk.graal.compiler.asm.aarch64.AArch64Assembler.ExtendType; import jdk.graal.compiler.asm.aarch64.AArch64MacroAssembler; import jdk.graal.compiler.core.common.LIRKind; import jdk.graal.compiler.core.common.NumUtil; import jdk.graal.compiler.core.common.calc.CanonicalCondition; import jdk.graal.compiler.core.common.calc.FloatConvert; import jdk.graal.compiler.core.gen.NodeMatchRules; import jdk.graal.compiler.core.match.ComplexMatchResult; import jdk.graal.compiler.core.match.MatchRule; import jdk.graal.compiler.core.match.MatchableNode; import jdk.graal.compiler.debug.Assertions; import jdk.graal.compiler.debug.GraalError; import jdk.graal.compiler.lir.LIRFrameState; import jdk.graal.compiler.lir.LabelRef; import jdk.graal.compiler.lir.Variable; import jdk.graal.compiler.lir.aarch64.AArch64ArithmeticOp; import jdk.graal.compiler.lir.aarch64.AArch64BitFieldOp; import jdk.graal.compiler.lir.aarch64.AArch64BitFieldOp.BitFieldOpCode; import jdk.graal.compiler.lir.aarch64.AArch64ControlFlow; import jdk.graal.compiler.lir.gen.LIRGeneratorTool; import jdk.graal.compiler.nodes.ConstantNode; import jdk.graal.compiler.nodes.DeoptimizingNode; import jdk.graal.compiler.nodes.FixedNode; import jdk.graal.compiler.nodes.IfNode; import jdk.graal.compiler.nodes.NodeView; import jdk.graal.compiler.nodes.ValueNode; import jdk.graal.compiler.nodes.calc.AddNode; import jdk.graal.compiler.nodes.calc.AndNode; import jdk.graal.compiler.nodes.calc.BinaryNode; import jdk.graal.compiler.nodes.calc.FloatConvertNode; import jdk.graal.compiler.nodes.calc.IntegerConvertNode; import jdk.graal.compiler.nodes.calc.IntegerLessThanNode; import jdk.graal.compiler.nodes.calc.LeftShiftNode; import jdk.graal.compiler.nodes.calc.MulNode; import jdk.graal.compiler.nodes.calc.NotNode; import jdk.graal.compiler.nodes.calc.OrNode; import jdk.graal.compiler.nodes.calc.RightShiftNode; import jdk.graal.compiler.nodes.calc.ShiftNode; import jdk.graal.compiler.nodes.calc.SignExtendNode; import jdk.graal.compiler.nodes.calc.SubNode; import jdk.graal.compiler.nodes.calc.UnaryNode; import jdk.graal.compiler.nodes.calc.UnsignedRightShiftNode; import jdk.graal.compiler.nodes.calc.XorNode; import jdk.graal.compiler.nodes.calc.ZeroExtendNode; import jdk.graal.compiler.nodes.memory.MemoryAccess; import jdk.vm.ci.aarch64.AArch64; import jdk.vm.ci.aarch64.AArch64Kind; import jdk.vm.ci.code.CodeUtil; import jdk.vm.ci.meta.AllocatableValue; import jdk.vm.ci.meta.JavaConstant; import jdk.vm.ci.meta.JavaKind; import jdk.vm.ci.meta.Value; @MatchableNode(nodeClass = AArch64PointerAddNode.class, inputs = {"base", "offset"}) public class AArch64NodeMatchRules extends NodeMatchRules { private static final EconomicMap<Class<? extends BinaryNode>, AArch64ArithmeticOp> binaryOpMap; private static final EconomicMap<Class<? extends BinaryNode>, AArch64BitFieldOp.BitFieldOpCode> bitFieldOpMap; private static final EconomicMap<Class<? extends BinaryNode>, AArch64MacroAssembler.ShiftType> shiftTypeMap; private static final EconomicMap<Class<? extends BinaryNode>, AArch64ArithmeticOp> logicalNotOpMap; static { binaryOpMap = EconomicMap.create(Equivalence.IDENTITY, 9); binaryOpMap.put(AddNode.class, AArch64ArithmeticOp.ADD); binaryOpMap.put(SubNode.class, AArch64ArithmeticOp.SUB); binaryOpMap.put(MulNode.class, AArch64ArithmeticOp.MUL); binaryOpMap.put(AndNode.class, AArch64ArithmeticOp.AND); binaryOpMap.put(OrNode.class, AArch64ArithmeticOp.OR); binaryOpMap.put(XorNode.class, AArch64ArithmeticOp.XOR); binaryOpMap.put(LeftShiftNode.class, AArch64ArithmeticOp.LSL); binaryOpMap.put(RightShiftNode.class, AArch64ArithmeticOp.ASR); binaryOpMap.put(UnsignedRightShiftNode.class, AArch64ArithmeticOp.LSR); bitFieldOpMap = EconomicMap.create(Equivalence.IDENTITY, 2); bitFieldOpMap.put(UnsignedRightShiftNode.class, BitFieldOpCode.UBFX); bitFieldOpMap.put(LeftShiftNode.class, BitFieldOpCode.UBFIZ); logicalNotOpMap = EconomicMap.create(Equivalence.IDENTITY, 3); logicalNotOpMap.put(AndNode.class, AArch64ArithmeticOp.BIC); logicalNotOpMap.put(OrNode.class, AArch64ArithmeticOp.ORN); logicalNotOpMap.put(XorNode.class, AArch64ArithmeticOp.EON); shiftTypeMap = EconomicMap.create(Equivalence.IDENTITY, 3); shiftTypeMap.put(LeftShiftNode.class, AArch64MacroAssembler.ShiftType.LSL); shiftTypeMap.put(RightShiftNode.class, AArch64MacroAssembler.ShiftType.ASR); shiftTypeMap.put(UnsignedRightShiftNode.class, AArch64MacroAssembler.ShiftType.LSR); } public AArch64NodeMatchRules(LIRGeneratorTool gen) { super(gen); } /** * Checks whether all arguments are numeric integers. */ protected boolean isNumericInteger(ValueNode... values) { for (ValueNode value : values) { if (!value.getStackKind().isNumericInteger()) { return false; } } return true; } /** * Checks whether all arguments are numeric floats. */ protected boolean isNumericFloat(ValueNode... values) { for (ValueNode value : values) { if (!value.getStackKind().isNumericFloat()) { return false; } } return true; } protected LIRFrameState getState(MemoryAccess access) { if (access instanceof DeoptimizingNode) { return state((DeoptimizingNode) access); } return null; } protected AArch64Kind getMemoryKind(MemoryAccess access) { return (AArch64Kind) gen.getLIRKind(((ValueNode) access).stamp(NodeView.DEFAULT)).getPlatformKind(); } private static boolean isSupportedExtendedAddSubShift(IntegerConvertNode<?> node, int clampedShiftAmt) { assert NumUtil.assertNonNegativeInt(clampedShiftAmt); if (clampedShiftAmt <= 4) { switch (node.getInputBits()) { case Byte.SIZE: case Short.SIZE: case Integer.SIZE: case Long.SIZE: return true; } } return false; } private static ExtendType getZeroExtendType(int fromBits) { switch (fromBits) { case Byte.SIZE: return ExtendType.UXTB; case Short.SIZE: return ExtendType.UXTH; case Integer.SIZE: return ExtendType.UXTW; case Long.SIZE: return ExtendType.UXTX; default: GraalError.shouldNotReachHere("extended from " + fromBits + "bits is not supported!"); // ExcludeFromJacocoGeneratedReport return null; } } private static ExtendType getSignExtendType(int fromBits) { switch (fromBits) { case Byte.SIZE: return ExtendType.SXTB; case Short.SIZE: return ExtendType.SXTH; case Integer.SIZE: return ExtendType.SXTW; case Long.SIZE: return ExtendType.SXTX; default: GraalError.shouldNotReachHere("extended from " + fromBits + "bits is not supported!"); // ExcludeFromJacocoGeneratedReport return null; } } private AllocatableValue moveSp(AllocatableValue value) { return getLIRGeneratorTool().moveSp(value); } /** * Clamp shift amounts into range 0 <= shiftamt < size according to JLS. */ private static int getClampedShiftAmt(ShiftNode<?> op) { int clampMask = op.getShiftAmountMask(); assert clampMask == 63 || clampMask == 31 : clampMask; return op.getY().asJavaConstant().asInt() & clampMask; } protected ComplexMatchResult emitBinaryShift(AArch64ArithmeticOp op, ValueNode value, ShiftNode<?> shift) { AArch64MacroAssembler.ShiftType shiftType = shiftTypeMap.get(shift.getClass()); assert shiftType != null; assert isNumericInteger(value, shift.getX()); return builder -> { Value a = operand(value); Value b = operand(shift.getX()); Variable result = gen.newVariable(LIRKind.combine(a, b)); AllocatableValue x = moveSp(gen.asAllocatable(a)); AllocatableValue y = moveSp(gen.asAllocatable(b)); int shiftAmount = getClampedShiftAmt(shift); gen.append(new AArch64ArithmeticOp.BinaryShiftOp(op, result, x, y, shiftType, shiftAmount)); return result; }; } private ComplexMatchResult emitBitTestAndBranch(FixedNode trueSuccessor, FixedNode falseSuccessor, ValueNode value, double trueProbability, int nbits) { return builder -> { LabelRef trueDestination = getLIRBlock(trueSuccessor); LabelRef falseDestination = getLIRBlock(falseSuccessor); AllocatableValue src = moveSp(gen.asAllocatable(operand(value))); gen.append(new AArch64ControlFlow.BitTestAndBranchOp(trueDestination, falseDestination, src, trueProbability, nbits)); return null; }; } /** * Helper used by emitBitFieldInsert and emitBitFieldExtract. */ private ComplexMatchResult emitBitFieldHelper(JavaKind kind, AArch64BitFieldOp.BitFieldOpCode op, ValueNode value, int lsb, int width) { assert isNumericInteger(value); assert lsb + width <= kind.getBitCount() : lsb + " " + kind; return builder -> { Value a = operand(value); LIRKind resultKind = LIRKind.fromJavaKind(gen.target().arch, kind); Variable result = gen.newVariable(resultKind); AllocatableValue src = moveSp(gen.asAllocatable(a)); gen.append(new AArch64BitFieldOp(op, result, src, lsb, width)); return result; }; } /** * Copy (width) bits from the least significant bits of the source register to bit position lsb * of the destination register. * * @param kind expected final size of the bitfield operation * @param op The type of bitfield operation * @param value The value to extract bits from * @param lsb (least significant bit) the starting index of where the value is moved to * @param width The number of bits to extract from value. */ private ComplexMatchResult emitBitFieldInsert(JavaKind kind, AArch64BitFieldOp.BitFieldOpCode op, ValueNode value, int lsb, int width) { assert op == BitFieldOpCode.SBFIZ || op == BitFieldOpCode.UBFIZ : op; return emitBitFieldHelper(kind, op, value, lsb, width); } /** * Copy (width) bits from the lsb bit position of the source register to the bottom of the * destination register. * * @param kind expected final size of the bitfield operation * @param op The type of bitfield operation * @param value The value to extract bits from * @param lsb (least significant bit) the starting index of where the value copied from * @param width The number of bits to extract from value. */ private ComplexMatchResult emitBitFieldExtract(JavaKind kind, AArch64BitFieldOp.BitFieldOpCode op, ValueNode value, int lsb, int width) { assert op == BitFieldOpCode.SBFX || op == BitFieldOpCode.UBFX : op; return emitBitFieldHelper(kind, op, value, lsb, width); } private ComplexMatchResult emitExtendedAddSubShift(BinaryNode op, ValueNode x, ValueNode y, ExtendType extType, int shiftAmt) { assert op instanceof AddNode || op instanceof SubNode : op; return builder -> { AllocatableValue src1 = gen.asAllocatable(operand(x)); AllocatableValue src2 = moveSp(gen.asAllocatable(operand(y))); Variable result = gen.newVariable(LIRKind.combine(operand(x), operand(y))); AArch64ArithmeticOp arithmeticOp = op instanceof AddNode ? AArch64ArithmeticOp.ADD : AArch64ArithmeticOp.SUB; gen.append(new AArch64ArithmeticOp.ExtendedAddSubShiftOp(arithmeticOp, result, src1, src2, extType, shiftAmt)); return result; }; } /** * Goal: Use AArch64's add/sub (extended register) instructions to fold away extend and shift of * left operand. */ @MatchRule("(Add=op x (LeftShift=lshift (SignExtend=ext y) Constant))") @MatchRule("(Sub=op x (LeftShift=lshift (SignExtend=ext y) Constant))") @MatchRule("(Add=op x (LeftShift=lshift (ZeroExtend=ext y) Constant))") @MatchRule("(Sub=op x (LeftShift=lshift (ZeroExtend=ext y) Constant))") public ComplexMatchResult mergeSignExtendByShiftIntoAddSub(BinaryNode op, LeftShiftNode lshift, ValueNode ext, ValueNode x, ValueNode y) { assert isNumericInteger(lshift); int shiftAmt = getClampedShiftAmt(lshift); if (!isSupportedExtendedAddSubShift((IntegerConvertNode<?>) ext, shiftAmt)) { return null; } ExtendType extType; if (ext instanceof SignExtendNode) { extType = getSignExtendType(((SignExtendNode) ext).getInputBits()); } else { extType = getZeroExtendType(((ZeroExtendNode) ext).getInputBits()); } return emitExtendedAddSubShift(op, x, y, extType, shiftAmt); } /** * Goal: Use AArch64's add/sub (extended register) instructions to fold away the and operation * (into a zero extend) and shift of left operand. */ @MatchRule("(Add=op x (LeftShift=lshift (And y Constant=constant) Constant))") @MatchRule("(Sub=op x (LeftShift=lshift (And y Constant=constant) Constant))") public ComplexMatchResult mergeShiftDowncastIntoAddSub(BinaryNode op, LeftShiftNode lshift, ConstantNode constant, ValueNode x, ValueNode y) { assert isNumericInteger(lshift, constant); int shiftAmt = getClampedShiftAmt(lshift); if (shiftAmt > 4) { return null; } long mask = constant.asJavaConstant().asLong() & CodeUtil.mask(op.getStackKind().getBitCount()); if (mask != 0xFFL && mask != 0xFFFFL && mask != 0xFFFFFFFFL) { return null; } int numBits = 64 - Long.numberOfLeadingZeros(mask); return emitExtendedAddSubShift(op, x, y, getZeroExtendType(numBits), shiftAmt); } /** * Goal: Switch ((x << amt) >> amt) into a sign extend and fold into AArch64 add/sub * (extended register) instruction. */ @MatchRule("(Add=op x (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst))") @MatchRule("(Sub=op x (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst))") public ComplexMatchResult mergePairShiftIntoAddSub(BinaryNode op, RightShiftNode signExt, ValueNode x, ValueNode y) { int signExtendAmt = getClampedShiftAmt(signExt); int opSize = op.getStackKind().getBitCount(); assert opSize == 32 || opSize == 64 : opSize; int remainingBits = opSize - signExtendAmt; if (remainingBits != 8 && remainingBits != 16 && remainingBits != 32) { return null; } return emitExtendedAddSubShift(op, x, y, getSignExtendType(remainingBits), 0); } /** * Goal: Fold ((x << amt) >> amt) << [0,4] into AArch64 add/sub (extended register) * instruction with a sign extend and a shift. */ @MatchRule("(Add=op x (LeftShift=outerShift (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst) Constant))") @MatchRule("(Sub=op x (LeftShift=outerShift (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst) Constant))") public ComplexMatchResult mergeShiftedPairShiftIntoAddSub(BinaryNode op, LeftShiftNode outerShift, RightShiftNode signExt, ValueNode x, ValueNode y) { int shiftAmt = getClampedShiftAmt(outerShift); if (shiftAmt > 4) { return null; } int signExtendAmt = getClampedShiftAmt(signExt); int opSize = op.getStackKind().getBitCount(); assert opSize == 32 || opSize == 64 : opSize; int remainingBits = opSize - signExtendAmt; if (remainingBits != 8 && remainingBits != 16 && remainingBits != 32) { return null; } return emitExtendedAddSubShift(op, x, y, getSignExtendType(remainingBits), shiftAmt); } /** * Goal: Fold zero extend and (optional) shift into AArch64 add/sub (extended register) * instruction. */ @MatchRule("(AArch64PointerAdd=addP base ZeroExtend)") @MatchRule("(AArch64PointerAdd=addP base (LeftShift ZeroExtend Constant))") public ComplexMatchResult extendedPointerAddShift(AArch64PointerAddNode addP) { ValueNode offset = addP.getOffset(); ZeroExtendNode zeroExtend; int shiftAmt; if (offset instanceof ZeroExtendNode) { zeroExtend = (ZeroExtendNode) offset; shiftAmt = 0; } else { LeftShiftNode shift = (LeftShiftNode) offset; zeroExtend = (ZeroExtendNode) shift.getX(); shiftAmt = getClampedShiftAmt(shift); } if (!isSupportedExtendedAddSubShift(zeroExtend, shiftAmt)) { return null; } int fromBits = zeroExtend.getInputBits(); int toBits = zeroExtend.getResultBits(); if (toBits != 64) { return null; } assert fromBits <= toBits : fromBits + " " + toBits; ExtendType extendType = getZeroExtendType(fromBits); ValueNode base = addP.getBase(); return builder -> { AllocatableValue x = gen.asAllocatable(operand(base)); AllocatableValue y = moveSp(gen.asAllocatable(operand(zeroExtend.getValue()))); AllocatableValue baseReference = LIRKind.derivedBaseFromValue(x); LIRKind kind = LIRKind.combineDerived(gen.getLIRKind(addP.stamp(NodeView.DEFAULT)), baseReference, null); Variable result = gen.newVariable(kind); gen.append(new AArch64ArithmeticOp.ExtendedAddSubShiftOp(AArch64ArithmeticOp.ADD, result, x, y, extendType, shiftAmt)); return result; }; } /** * This method determines, if possible, how to use AArch64's bit unsigned field insert/extract * (UBFIZ/UBFX) instructions to copy over desired bits in the presence of the pattern [(X >>> #) * & MASK] or [(X & MASK) << #] (with some zero extensions maybe sprinkled in). * * The main idea is that the mask and shift will force many bits to be zeroed and this * information can be leveraged to extract the meaningful bits. */ private ComplexMatchResult unsignedBitFieldHelper(JavaKind finalOpKind, BinaryNode shift, ValueNode value, ConstantNode maskNode, int andOpSize) { long mask = maskNode.asJavaConstant().asLong() & CodeUtil.mask(andOpSize); if (!CodeUtil.isPowerOf2(mask + 1)) { /* MaskNode isn't a mask: initial assumption doesn't hold true */ return null; } int maskSize = 64 - Long.numberOfLeadingZeros(mask); int shiftSize = shift.getStackKind().getBitCount(); int shiftAmt = getClampedShiftAmt((ShiftNode<?>) shift); /* * The width of the insert/extract will be the bits which are not shifted out and/or not * part of the mask. */ int width = Math.min(maskSize, shiftSize - shiftAmt); if (width == finalOpKind.getBitCount()) { assert maskSize == finalOpKind.getBitCount() && shiftAmt == 0 : maskSize + " " + finalOpKind; // original value is unaffected return builder -> operand(value); } else if (shift instanceof UnsignedRightShiftNode) { // this is an extract return emitBitFieldExtract(finalOpKind, BitFieldOpCode.UBFX, value, shiftAmt, width); } else { // is a left shift - means this is an insert return emitBitFieldInsert(finalOpKind, BitFieldOpCode.UBFIZ, value, shiftAmt, width); } } /** * Goal: Use AArch64's bit unsigned field insert/extract (UBFIZ/UBFX) instructions to copy over * desired bits. */ @MatchRule("(And (UnsignedRightShift=shift value Constant) Constant=a)") @MatchRule("(LeftShift=shift (And value Constant=a) Constant)") public ComplexMatchResult unsignedBitField(BinaryNode shift, ValueNode value, ConstantNode a) { return unsignedBitFieldHelper(shift.getStackKind(), shift, value, a, shift.getStackKind().getBitCount()); } /** * Goal: Use AArch64's bit unsigned field insert/extract (UBFIZ/UBFX) instructions to copy over * desired bits. */ @MatchRule("(LeftShift=shift (ZeroExtend=extend (And value Constant=a)) Constant)") @MatchRule("(ZeroExtend=extend (And (UnsignedRightShift=shift value Constant) Constant=a))") @MatchRule("(ZeroExtend=extend (LeftShift=shift (And value Constant=a) Constant))") public ComplexMatchResult unsignedExtBitField(ZeroExtendNode extend, BinaryNode shift, ValueNode value, ConstantNode a) { return unsignedBitFieldHelper(extend.getStackKind(), shift, value, a, extend.getInputBits()); } /** * Goal: Use AArch64's signed bitfield insert in zeros (sbfiz) instruction to extract desired * bits while folding away sign extend. */ @MatchRule("(LeftShift=shift (SignExtend value) Constant)") public ComplexMatchResult signedBitField(LeftShiftNode shift, ValueNode value) { assert isNumericInteger(shift); SignExtendNode extend = (SignExtendNode) shift.getX(); int inputBits = extend.getInputBits(); int resultBits = extend.getResultBits(); JavaKind kind = shift.getStackKind(); assert kind.getBitCount() == resultBits : Assertions.errorMessage(shift, value, kind); int lsb = getClampedShiftAmt(shift); /* * Get the min value of the inputBits and post-shift bits (resultBits - lsb) as the bitfield * width. Note if (resultBits-lsb) is smaller than inputBits, the in reality no sign * extension takes place. */ int width = Math.min(inputBits, resultBits - lsb); assert width >= 1 && width <= resultBits - lsb : width + " " + resultBits; return emitBitFieldInsert(kind, BitFieldOpCode.SBFIZ, value, lsb, width); } /** * Goal: Use AArch64's bit field insert/extract instructions to copy over desired bits. */ @MatchRule("(RightShift=rshift (LeftShift=lshift value Constant) Constant)") @MatchRule("(UnsignedRightShift=rshift (LeftShift=lshift value Constant) Constant)") public ComplexMatchResult bitFieldMove(BinaryNode rshift, LeftShiftNode lshift, ValueNode value) { assert isNumericInteger(rshift); JavaKind opKind = rshift.getStackKind(); int opSize = opKind.getBitCount(); int lshiftAmt = getClampedShiftAmt(lshift); int rshiftAmt = getClampedShiftAmt((ShiftNode<?>) rshift); /* * Get the width of the bitField. It will be in the range 1 to 32(64). * * Get the final width of the extract. Because the left and right shift go in opposite * directions, the number of meaningful bits after performing a (x << #) >>(>) # is * dependent on the maximum of the two shifts. */ int width = opSize - Math.max(lshiftAmt, rshiftAmt); assert width > 1 || width <= opSize : width + " " + opSize; if (width == opSize) { // this means that no shifting was performed: can directly return value return builder -> operand(value); } /* * Use bitfield insert (SBFIZ/UBFIZ) if left shift number is larger than right shift number, * otherwise use bitfield extract (SBFX/UBFX). * * If lshiftAmt > rshiftAmt, this means that the destination value will have some of its * bottom bits cleared, whereas if lshiftAmt <= rshiftAmt, then the destination value will * have bits starting from index 0 copied from the input. */ if (lshiftAmt > rshiftAmt) { int lsb = lshiftAmt - rshiftAmt; BitFieldOpCode op = rshift instanceof RightShiftNode ? BitFieldOpCode.SBFIZ : BitFieldOpCode.UBFIZ; return emitBitFieldInsert(opKind, op, value, lsb, width); } else { // is a bit field extract int lsb = rshiftAmt - lshiftAmt; BitFieldOpCode op = rshift instanceof RightShiftNode ? BitFieldOpCode.SBFX : BitFieldOpCode.UBFX; return emitBitFieldExtract(opKind, op, value, lsb, width); } } /** * Goal: Use AArch64's ror instruction for rotations. */ @MatchRule("(Or=op (LeftShift=x src Constant) (UnsignedRightShift=y src Constant))") @MatchRule("(Or=op (UnsignedRightShift=x src Constant) (LeftShift=y src Constant))") @MatchRule("(Add=op (LeftShift=x src Constant) (UnsignedRightShift=y src Constant))") @MatchRule("(Add=op (UnsignedRightShift=x src Constant) (LeftShift=y src Constant))") public ComplexMatchResult rotationConstant(ValueNode op, ValueNode x, ValueNode y, ValueNode src) { assert isNumericInteger(src); assert src.getStackKind() == op.getStackKind() && op.getStackKind() == x.getStackKind() : src + " " + op + " " + x; int shiftAmt1 = getClampedShiftAmt((ShiftNode<?>) x); int shiftAmt2 = getClampedShiftAmt((ShiftNode<?>) y); if (shiftAmt1 + shiftAmt2 == 0 && op instanceof OrNode) { assert shiftAmt1 == 0 && shiftAmt2 == 0 : shiftAmt1 + " " + shiftAmt2; /* No shift performed: for or operation, this is equivalent to original value */ return builder -> operand(src); } else if (src.getStackKind().getBitCount() == shiftAmt1 + shiftAmt2) { /* Shifts are equivalent to a rotate. */ return builder -> { AllocatableValue a = moveSp(gen.asAllocatable(operand(src))); /* Extract the right shift amount */ JavaConstant b = JavaConstant.forInt(x instanceof LeftShiftNode ? shiftAmt2 : shiftAmt1); Variable result = gen.newVariable(LIRKind.combine(a)); getArithmeticLIRGenerator().emitBinaryConst(result, AArch64ArithmeticOp.ROR, a, b); return result; }; } return null; } /** * Goal: Use AArch64's ror instruction for rotations. */ @MatchRule("(Or (LeftShift=x src shiftAmount) (UnsignedRightShift src (Sub=y Constant shiftAmount)))") @MatchRule("(Or (UnsignedRightShift=x src shiftAmount) (LeftShift src (Sub=y Constant shiftAmount)))") @MatchRule("(Or (LeftShift=x src (Negate shiftAmount)) (UnsignedRightShift src (Add=y Constant shiftAmount)))") @MatchRule("(Or (UnsignedRightShift=x src (Negate shiftAmount)) (LeftShift src (Add=y Constant shiftAmount)))") @MatchRule("(Or (LeftShift=x src shiftAmount) (UnsignedRightShift src (Negate=y shiftAmount)))") @MatchRule("(Or (UnsignedRightShift=x src shiftAmount) (LeftShift src (Negate=y shiftAmount)))") public ComplexMatchResult rotationExpander(ValueNode src, ValueNode shiftAmount, ValueNode x, ValueNode y) { assert isNumericInteger(src); assert shiftAmount.getStackKind().getBitCount() == 32 : Assertions.errorMessage(shiftAmount); if (y instanceof SubNode || y instanceof AddNode) { BinaryNode binary = (BinaryNode) y; ConstantNode delta = (ConstantNode) (binary.getX() != shiftAmount ? binary.getX() : binary.getY()); /* * For this pattern to match a right rotate, then the "clamped" delta (i.e. the value of * delta within a shift) must be 0. */ int opSize = src.getStackKind().getBitCount(); assert opSize == 32 || opSize == 64 : opSize; long clampedDelta = delta.asJavaConstant().asInt() & (opSize - 1); if (clampedDelta != 0) { return null; } } return builder -> { Value a = operand(src); Value b; if (y instanceof AddNode) { b = x instanceof LeftShiftNode ? operand(shiftAmount) : getArithmeticLIRGenerator().emitNegate(operand(shiftAmount), false); } else { b = x instanceof LeftShiftNode ? getArithmeticLIRGenerator().emitNegate(operand(shiftAmount), false) : operand(shiftAmount); } return getArithmeticLIRGenerator().emitBinary(LIRKind.combine(a, b), AArch64ArithmeticOp.ROR, false, a, b); }; } /** * Goal: Use AArch64 binary shift add/sub ops to fold shift. */ @MatchRule("(Add=binary a (LeftShift=shift b Constant))") @MatchRule("(Add=binary a (RightShift=shift b Constant))") @MatchRule("(Add=binary a (UnsignedRightShift=shift b Constant))") @MatchRule("(Sub=binary a (LeftShift=shift b Constant))") @MatchRule("(Sub=binary a (RightShift=shift b Constant))") @MatchRule("(Sub=binary a (UnsignedRightShift=shift b Constant))") public ComplexMatchResult addSubShift(BinaryNode binary, ValueNode a, BinaryNode shift) { AArch64ArithmeticOp op = binaryOpMap.get(binary.getClass()); assert op != null; return emitBinaryShift(op, a, (ShiftNode<?>) shift); } /** * Goal: Use AArch64 binary shift logic ops to fold shift. */ @MatchRule("(And=binary a (LeftShift=shift b Constant))") @MatchRule("(And=binary a (RightShift=shift b Constant))") @MatchRule("(And=binary a (UnsignedRightShift=shift b Constant))") @MatchRule("(Or=binary a (LeftShift=shift b Constant))") @MatchRule("(Or=binary a (RightShift=shift b Constant))") @MatchRule("(Or=binary a (UnsignedRightShift=shift b Constant))") @MatchRule("(Xor=binary a (LeftShift=shift b Constant))") @MatchRule("(Xor=binary a (RightShift=shift b Constant))") @MatchRule("(Xor=binary a (UnsignedRightShift=shift b Constant))") @MatchRule("(And=binary a (Not (LeftShift=shift b Constant)))") @MatchRule("(And=binary a (Not (RightShift=shift b Constant)))") @MatchRule("(And=binary a (Not (UnsignedRightShift=shift b Constant)))") @MatchRule("(Or=binary a (Not (LeftShift=shift b Constant)))") @MatchRule("(Or=binary a (Not (RightShift=shift b Constant)))") @MatchRule("(Or=binary a (Not (UnsignedRightShift=shift b Constant)))") @MatchRule("(Xor=binary a (Not (LeftShift=shift b Constant)))") @MatchRule("(Xor=binary a (Not (RightShift=shift b Constant)))") @MatchRule("(Xor=binary a (Not (UnsignedRightShift=shift b Constant)))") public ComplexMatchResult logicShift(BinaryNode binary, ValueNode a, BinaryNode shift) { AArch64ArithmeticOp op; ValueNode operand = binary.getX() == a ? binary.getY() : binary.getX(); if (operand instanceof NotNode) { op = logicalNotOpMap.get(binary.getClass()); } else { op = binaryOpMap.get(binary.getClass()); } assert op != null; return emitBinaryShift(op, a, (ShiftNode<?>) shift); } /** * Goal: fold shift into negate operation using AArch64's sub (shifted register) instruction. */ @MatchRule("(Negate (UnsignedRightShift=shift a Constant=b))") @MatchRule("(Negate (RightShift=shift a Constant=b))") @MatchRule("(Negate (LeftShift=shift a Constant=b))") public ComplexMatchResult negShift(BinaryNode shift, ValueNode a, ConstantNode b) { assert isNumericInteger(a, b); int shiftAmt = getClampedShiftAmt((ShiftNode<?>) shift); AArch64Assembler.ShiftType shiftType = shiftTypeMap.get(shift.getClass()); return builder -> { AllocatableValue src = moveSp(gen.asAllocatable(operand(a))); LIRKind kind = LIRKind.combine(operand(a)); Variable result = gen.newVariable(kind); gen.append(new AArch64ArithmeticOp.BinaryShiftOp(AArch64ArithmeticOp.SUB, result, AArch64.zr.asValue(kind), src, shiftType, shiftAmt)); return result; }; } /** * Goal: use AArch64's and not (bic) & or not (orn) instructions. */ @MatchRule("(And=logic value1 (Not=not value2))") @MatchRule("(Or=logic value1 (Not=not value2))") public final ComplexMatchResult bitwiseLogicNot(BinaryNode logic, NotNode not) { assert isNumericInteger(logic); AArch64ArithmeticOp op = logicalNotOpMap.get(logic.getClass()); assert op != null; ValueNode src1 = logic.getX() == not ? logic.getY() : logic.getX(); ValueNode src2 = not.getValue(); return builder -> { Value a = operand(src1); Value b = operand(src2); LIRKind resultKind = LIRKind.combine(a, b); return getArithmeticLIRGenerator().emitBinary(resultKind, op, false, a, b); }; } /** * Goal: Use AArch64's bitwise exclusive or not (eon) instruction. * * Note that !(A^B) == (!A)^B == A^(!B). */ @MatchRule("(Not (Xor value1 value2))") @MatchRule("(Xor value1 (Not value2))") @MatchRule("(Xor (Not value1) value2)") public ComplexMatchResult bitwiseNotXor(ValueNode value1, ValueNode value2) { return builder -> { Value a = operand(value1); Value b = operand(value2); LIRKind resultKind = LIRKind.combine(a, b); return getArithmeticLIRGenerator().emitBinary(resultKind, AArch64ArithmeticOp.EON, true, a, b); }; } /** * Checks whether this multiply operation which can fold in a sign extend operation . This can * happen if: * * <ul> * <li>The multiply result is of type long</li> * <li>Both inputs are sign extended from 32 bits to 64 bits</li> * </ul> */ private static boolean isI2LMultiply(MulNode mul, SignExtendNode x, SignExtendNode y) { if (mul.getStackKind() == JavaKind.Long) { assert x.getResultBits() == Long.SIZE && y.getResultBits() == Long.SIZE : x + " " + y; return x.getInputBits() == Integer.SIZE && y.getInputBits() == Integer.SIZE; } return false; } /** * Goal: use AArch64's (i32,i32) -> i64 multiply instructions to fold away sign extensions. */ @MatchRule("(Add=binary (Mul=mul (SignExtend a) (SignExtend b)) c)") @MatchRule("(Sub=binary c (Mul=mul (SignExtend a) (SignExtend b)))") public ComplexMatchResult signedMultiplyAddSubLong(BinaryNode binary, MulNode mul, ValueNode a, ValueNode b, ValueNode c) { assert isNumericInteger(binary, mul, a, b, c); if (isI2LMultiply(mul, (SignExtendNode) mul.getX(), (SignExtendNode) mul.getY())) { if (binary instanceof AddNode) { return builder -> getArithmeticLIRGenerator().emitIntegerMAdd(operand(a), operand(b), operand(c), true); } return builder -> getArithmeticLIRGenerator().emitIntegerMSub(operand(a), operand(b), operand(c), true); } else { return null; } } /** * Goal: use AArch64's (i32,i32) -> i64 multiply instructions to fold away sign extensions. */ @MatchRule("(Negate (Mul=mul (SignExtend=ext1 a) (SignExtend=ext2 b)))") @MatchRule("(Mul=mul (Negate (SignExtend=ext1 a)) (SignExtend=ext2 b))") public ComplexMatchResult signedMultiplyNegLong(MulNode mul, SignExtendNode ext1, SignExtendNode ext2, ValueNode a, ValueNode b) { assert isNumericInteger(mul, ext1, ext2, a, b); if (isI2LMultiply(mul, ext1, ext2)) { LIRKind resultKind = LIRKind.fromJavaKind(gen.target().arch, JavaKind.Long); return builder -> getArithmeticLIRGenerator().emitBinary( resultKind, AArch64ArithmeticOp.SMNEGL, true, operand(a), operand(b)); } else { return null; } } /** * Goal: use AArch64's (i32,i32) -> i64 multiply instructions to fold away sign extensions. */ @MatchRule("(Mul=mul (SignExtend a) (SignExtend b))") public ComplexMatchResult signedMultiplyLong(MulNode mul, ValueNode a, ValueNode b) { assert isNumericInteger(mul, a, b); if (isI2LMultiply(mul, (SignExtendNode) mul.getX(), (SignExtendNode) mul.getY())) { LIRKind resultKind = LIRKind.fromJavaKind(gen.target().arch, JavaKind.Long); return builder -> getArithmeticLIRGenerator().emitBinary( resultKind, AArch64ArithmeticOp.SMULL, true, operand(a), operand(b)); } else { return null; } } /** * Goal: Use AArch64's add/sub (extended register) instructions to fold in and operand. */ @MatchRule("(Add=op x (And y Constant=constant))") @MatchRule("(Sub=op x (And y Constant=constant))") public ComplexMatchResult mergeDowncastIntoAddSub(BinaryNode op, ValueNode x, ValueNode y, ConstantNode constant) { assert isNumericInteger(constant); long mask = constant.asJavaConstant().asLong() & CodeUtil.mask(op.getStackKind().getBitCount()); if (mask != 0xFFL && mask != 0xFFFFL && mask != 0xFFFFFFFFL) { return null; } int numBits = 64 - Long.numberOfLeadingZeros(mask); return emitExtendedAddSubShift(op, x, y, getZeroExtendType(numBits), 0); } /** * Goal: Use AArch64's add/sub (extended register) instruction. */ @MatchRule("(Add=op x (SignExtend=ext y))") @MatchRule("(Sub=op x (SignExtend=ext y))") @MatchRule("(Add=op x (ZeroExtend=ext y))") @MatchRule("(Sub=op x (ZeroExtend=ext y))") public ComplexMatchResult mergeSignExtendIntoAddSub(BinaryNode op, UnaryNode ext, ValueNode x, ValueNode y) { if (!isSupportedExtendedAddSubShift((IntegerConvertNode<?>) ext, 0)) { return null; } ExtendType extType; if (ext instanceof SignExtendNode) { extType = getSignExtendType(((SignExtendNode) ext).getInputBits()); } else { extType = getZeroExtendType(((ZeroExtendNode) ext).getInputBits()); } return emitExtendedAddSubShift(op, x, y, extType, 0); } /** * Goal: Use AArch64's multiple-negate (mneg) instruction. */ @MatchRule("(Mul (Negate a) b)") @MatchRule("(Negate (Mul a b))") public final ComplexMatchResult multiplyNegate(ValueNode a, ValueNode b) { if (isNumericInteger(a, b)) { return builder -> getArithmeticLIRGenerator().emitMNeg(operand(a), operand(b)); } return null; } /** * Goal: Use AArch64's multiply-add (madd) and multiply-subtract (msub) instructions. */ @MatchRule("(Add=binary (Mul a b) c)") @MatchRule("(Sub=binary c (Mul a b))") public final ComplexMatchResult multiplyAddSub(BinaryNode binary, ValueNode a, ValueNode b, ValueNode c) { if (!(isNumericInteger(a, b, c))) { return null; } if (binary instanceof AddNode) { return builder -> getArithmeticLIRGenerator().emitIntegerMAdd(operand(a), operand(b), operand(c), false); } return builder -> getArithmeticLIRGenerator().emitIntegerMSub(operand(a), operand(b), operand(c), false); } /** * Goal: Transform ((x & (1 << n)) == 0) -> (tbz/tbnz n label). */ @MatchRule("(If (IntegerTest value Constant=a))") public ComplexMatchResult testBitAndBranch(IfNode root, ValueNode value, ConstantNode a) { if (isNumericInteger(value)) { long constant = a.asJavaConstant().asLong(); if (Long.bitCount(constant) == 1) { return emitBitTestAndBranch(root.trueSuccessor(), root.falseSuccessor(), value, root.getTrueSuccessorProbability(), Long.numberOfTrailingZeros(constant)); } } return null; } /** * Goal: Transform (if x < 0) -> (tbz x, sizeOfBits(x) - 1, label). */ @MatchRule("(If (IntegerLessThan=lessNode x Constant=y))") public ComplexMatchResult checkNegativeAndBranch(IfNode root, IntegerLessThanNode lessNode, ValueNode x, ConstantNode y) { assert isNumericInteger(x); if (y.isJavaConstant() && (0 == y.asJavaConstant().asLong()) && lessNode.condition().equals(CanonicalCondition.LT)) { return emitBitTestAndBranch(root.falseSuccessor(), root.trueSuccessor(), x, 1.0 - root.getTrueSuccessorProbability(), x.getStackKind().getBitCount() - 1); } return null; } /** * Goal: Use directly AArch64's single-precision fsqrt op. */ @MatchRule("(FloatConvert=a (Sqrt (FloatConvert=b c)))") public final ComplexMatchResult floatSqrt(FloatConvertNode a, FloatConvertNode b, ValueNode c) { if (isNumericFloat(a, c)) { if (a.getFloatConvert() == FloatConvert.D2F && b.getFloatConvert() == FloatConvert.F2D) { return builder -> getArithmeticLIRGenerator().emitMathSqrt(operand(c)); } } return null; } @MatchRule("(Conditional (IntegerBelow x y) Constant=cm1 (Conditional (IntegerEquals x y) Constant=c0 Constant=c1))") public ComplexMatchResult normalizedIntegerCompare(ValueNode x, ValueNode y, ConstantNode cm1, ConstantNode c0, ConstantNode c1) { if (cm1.getStackKind() == JavaKind.Int && cm1.asJavaConstant().asInt() == -1 && c0.getStackKind() == JavaKind.Int && c0.asJavaConstant().asInt() == 0 && c1.getStackKind() == JavaKind.Int && c1.asJavaConstant().asInt() == 1) { LIRKind compareKind = gen.getLIRKind(x.stamp(NodeView.DEFAULT)); return builder -> getArithmeticLIRGenerator().emitNormalizedUnsignedCompare(compareKind, operand(x), operand(y)); } return null; } @Override public AArch64LIRGenerator getLIRGeneratorTool() { return (AArch64LIRGenerator) gen; } protected AArch64ArithmeticLIRGenerator getArithmeticLIRGenerator() { return (AArch64ArithmeticLIRGenerator) getLIRGeneratorTool().getArithmetic(); } } ```

The 1945 Chicago White Sox season was the White Sox's 45th season in the major leagues, and their 46th season overall. They finished with a record of 71–78, good enough for 6th place in the American League, 15 games behind the 1st place Detroit Tigers. Regular season Season standings Record vs. opponents Opening Day lineup Wally Moses, RF Oris Hockett, CF Johnny Dickshot, LF Bill Nagel, 1B Tony Cuccinello, 3B Roy Schalk, 2B Cass Michaels, SS Mike Tresh, C Thornton Lee, P Roster Player stats Batting Note: G = Games played; AB = At bats; R = Runs scored; H = Hits; 2B = Doubles; 3B = Triples; HR = Home runs; RBI = Runs batted in; BB = Base on balls; SO = Strikeouts; AVG = Batting average; SB = Stolen bases Pitching Note: W = Wins; L = Losses; ERA = Earned run average; G = Games pitched; GS = Games started; SV = Saves; IP = Innings pitched; H = Hits allowed; R = Runs allowed; ER = Earned runs allowed; HR = Home runs allowed; BB = Walks allowed; K = Strikeouts External links 1945 Chicago White Sox at Baseball Reference Chicago White Sox seasons Chicago White Sox season Chicago White

A hyaline substance is one with a glassy appearance. The word is derived from , and . Histopathology Hyaline cartilage is named after its glassy appearance on fresh gross pathology. On light microscopy of H&E stained slides, the extracellular matrix of hyaline cartilage looks homogeneously pink, and the term "hyaline" is used to describe similarly homogeneously pink material besides the cartilage. Hyaline material is usually acellular and proteinaceous. For example, arterial hyaline is seen in aging, high blood pressure, diabetes mellitus and in association with some drugs (e.g. calcineurin inhibitors). It is bright pink with PAS staining. Ichthyology and entomology In ichthyology and entomology, hyaline denotes a colorless, transparent substance, such as unpigmented fins of fishes or clear insect wings. Botany In botany hyaline refers to thin and translucent plant parts, such as the margins of some sepals, bracts and leaves. See also Hyaline arteriolosclerosis Hyaloid canal, which passes through the eye Hyalopilitic Hyaloserositis Infant respiratory distress syndrome, previously known as hyaline membrane disease References Taber's Cyclopedic Medical Dictionary, 19th Edition. Donald Venes ed. 1997 F.A. Davis. Page 1008. Histopathology Fungal morphology and anatomy

```sqlpl -- Script: Get-TempTableColumns.sql -- Author: Scott Sutherland -- Description: Return a list of all temp table types. -- Include table variables, local temp tables, and global temp tables. SELECT 'tempdb' as 'Database_Name', SCHEMA_NAME(t1.schema_id) AS 'Schema_Name', t1.name AS 'Table_Name', t2.name AS 'Column_Name', t3.name AS 'Column_Type', CASE WHEN (SELECT CASE WHEN LEN(t1.name) - LEN(REPLACE(t1.name,'#','')) > 1 THEN 1 ELSE 0 END) = 1 THEN 'GlobalTempTable' WHEN t1.name LIKE '%[_]%' AND (SELECT CASE WHEN LEN(t1.name) - LEN(REPLACE(t1.name,'#','')) = 1 THEN 1 ELSE 0 END) = 1 THEN 'LocalTempTable' WHEN t1.name NOT LIKE '%[_]%' AND (SELECT CASE WHEN LEN(t1.name) - LEN(REPLACE(t1.name,'#','')) = 1 THEN 1 ELSE 0 END) = 1 THEN 'TableVariable' ELSE NULL END AS Table_Type, t1.is_ms_shipped, t1.is_published, t1.is_schema_published, t1.create_date, t1.modify_date FROM [tempdb].[sys].[objects] AS t1 JOIN [tempdb].[sys].[columns] AS t2 ON t1.OBJECT_ID = t2.OBJECT_ID JOIN sys.types AS t3 ON t2.system_type_id = t3.system_type_id WHERE t1.name LIKE '#%' ```

El Encanto is a town and municipality in the Amazonas Department, Colombia. It is located in the mouth of the Caraparaná River, tributary of the Putumayo River (Içá). El Encanto can be reached by air or river. The local navy base has a runway available only to military and official planes, these were established during the Colombia-Peru War. By river the closest towns with airport access are Puerto Arturo, Peru from downstream, and Puerto Leguízamo (Putumayo Department, Colombia) upstream. The majority of inhabitants in the area are Huitotos indigenous tribes. The municipality has an area of . History El Encanto was founded shortly before the 1900s by rubber tappers looking to take advantage of the local natives as a work force. The rubber boom had drastic effects in the Putumayo region, where El Encanto is located. The land owned by Arana was split into two 'departments': La Chorrera on the Igaraparaná and El Encanto, headquarters for sections on the Caraparaná. By 1904, the settlement came under the control of Julio César Arana and what would become the Peruvian Amazon Company. The companies efforts to extract rubber and profit culminated in the Putumayo genocide: enslaving, abusing, starving, exhausting, and murdering local populations. At the time of Roger Casement's visit to the Putumayo, the station was under the control of Miguel S. Loayza. Before the border of the Putumayo was changed thanks to the Salomón–Lozano Treaty: Julio Cesar Arana, Miguel S. Loayza, and Carlos Loayza initiated a series of forced migrations. Between 1922 and 1930 groups of natives from the right bank of the Putumayo were resettled in the Ampiyacu basin of Loreto, Peru: so the three of them could retain their work force. At least 6,719 indigenous people were moved from the region: and 50% of them died from disease. Climate El Encanto has a tropical rainforest climate (Köppen Af) with heavy rainfall year-round. References External links El Encanto official website Municipalities of Amazonas Department

USS R-3 (SS-80) was an R-class coastal and harbor defense submarine of the United States Navy. Construction and commissioning R-3′s keel was laid down on 11 December 1917 by the Fore River Shipbuilding Company in Quincy, Massachusetts. She was launched on 18 January 1919, sponsored by Mrs. Charles G. McCord, and commissioned on 17 April 1919 at Boston, Massachusetts. Service history 1919–1934 After shakedown off the Massachusetts coast, R-3 was assigned to Submarine Division 9 at New London, Connecticut. She departed New London with the coaling ship on 4 December 1919 for Norfolk, Virginia and a winter deployment with the division in the Gulf of Mexico from 13 January to 27 March 1920. R-3 returned to New London on 18 May for four months of summer exercises with and . Given hull classification symbol SS-80 in July, she sailed on 13 September for Norfolk and overhaul. R-3 was transferred to the Pacific with Division 9 on 8 April, transited the Panama Canal on 28 May, and arrived 30 June at her new base, San Pedro, California. After operating for two years in California waters, she was transferred 16 July 1923 to Pearl Harbor where she was stationed for the next years, engaging in training and operations with fleet units. R-3 was reassigned 12 December 1930 to the Atlantic Fleet for duty with Division 4, arriving 9 February 1931 at New London. After acting as a training ship at the Submarine School, New London for five months, she was ordered 6 May to Washington, DC, for air purification tests by the Naval Research Laboratory. In 1932, R-3 conducted sound and radio experiments for the laboratory and trained personnel from the Deep Sea Diving School off Piney Point, Maryland. R-3 was placed in reduced commission 26 April 1933 and after testing low-pressure valves for the Naval Research Laboratory, departed for Annapolis, Maryland, on 2 June 1933 where she served as a training ship for future generations of submariners. She sailed 22 February 1934 for Guantanamo Bay and sound operations with Eagle 58, followed by training duty at Washington, DC, with the Deep Sea Diving School. R-3 was decommissioned 10 August 1934 at Philadelphia, Pennsylvania. 1940–1948 R-3 recommissioned 19 August 1940 at New London, was attached to Division 42, and after a brief period at New London, 23 October to 10 December, headed for Coco Solo. Patrols and training duties followed and in mid-1941 she returned to New London to prepare for transfer to the Royal Navy. Decommissioned and transferred 4 November 1941, R-3 was struck from the Naval Vessel Register on 7 November 1941. She continued her career in British home waters as , a training submarine, until returned to the U.S. Navy in the United Kingdom, 20 December 1944. Unfit for service after the war, she was scrapped at Troon, Scotland, in 1948. References External links United States R-class submarines Ships built in Quincy, Massachusetts 1919 ships Ships transferred from the United States Navy to the Royal Navy United States R-class submarines of the Royal Navy World War II submarines of the United Kingdom

Carolyn McAskie (born 15 December 1946) is a Canadian diplomat and former assistant secretary-general for peacekeeping at the United Nations. She was the head of the United Nations mission to Burundi (ONUB) in 2004, making her the first Canadian to lead a United Nations peacekeeping mission following the UN's switch to complex missions. Biography McAskie was born in Glasgow, Scotland. She entered the Canadian Civil Service in 1968. From 1975–1980, McAskie served as Assistant Director of Finance and Personnel at the Commonwealth Secretariat in London. Her first major role with the government of Canada was as Canadian High Commissioner to Sri Lanka and the Maldives in 1983. In 1985, she participated in the World Conference on Women. In 1993, McAskie began working at the Canadian International Development Agency (CIDA). She served as Vice-President for African and the Middle Eastern programs, as well as Vice-President for CIDA's multilateral programs. As of 2018, McAskie is a senior fellow at the University of Ottawa's Graduate School of Public and International Affairs. She was also a director for CANADEM, and a director of Pearson Peacekeeping Centre. United Nations McAskie has been a part of multiple delegations to the United Nations. She was appointed deputy Emergency Relief Coordinator in 1999. She replaced Sérgio Vieira de Mello and became the interim Emergency Relief Coordinator from 1999–2004 due to De Mello's mission in Timor-Leste. She has assisted in several relief efforts in Africa over her term. As coordinator, she visited Ethiopia, Eritrea, and Kenya on 10 July 2000, to examine the effects of the drought and to organize relief efforts. McAskie visited the Democratic Republic of the Congo in May 2003 to assess renewed fighting in Ituri. From 2004 to April 2006, McAskie was the Special Representative of the Secretary-General and head of the United Nations mission (ONUB) to Burundi, and led ceasefire talks in the Burundian Civil War. She was the first Canadian to lead a UN peacekeeping mission following the United Nations' switch to complex missions. On 16 May 2006, McAskie was named assistant secretary-general for peacebuilding support. Awards In April 2005, McAskie received an honorary degree from the University of British Columbia. On 3 May 2007, McAskie was awarded with the Order of Canada for her efforts in peacekeeping and international diplomacy. References Living people 1946 births Canadian women diplomats Officers of the Order of Canada Canadian officials of the United Nations

Talk About a Lady is a 1946 American musical film directed by George Sherman and starring Forrest Tucker, Jinx Falkenburg and Trudy Marshall. It was produced and distributed by Columbia Pictures. Plot Cast Jinx Falkenburg as Janie Clark Forrest Tucker as Bart Manners Joe Besser as Roly Q. Entwhistle Trudy Marshall as Toni Marlowe Richard Lane as Duke Randall Jimmy Little as Buffalo Frank Sully as Rocky Jordan Jack Davis as Carleton Vane Robert Regent as Arthur Harrison Mira McKinney as Letitia Harrison Robin Raymond as 'Peaches' Barkeley Stan Kenton as Orchestra Leader References External links Talk About a Lady at Library of Congress Talk About a Lady at TCMDB 1940s English-language films 1946 films American musical films Films directed by George Sherman 1946 musical films American black-and-white films 1940s American films Columbia Pictures films

Emil Martinov (; born 18 March 1992) is a Bulgarian footballer who plays as a midfielder for Slavia Sofia. Club career On 11 August 2018, Martinov signed contract with Azerbaijan Premier League side Sabail FK. In September 2021 he joined CSKA 1948. Honours Slavia Sofia Bulgarian Cup (1): 2017–18 References External links Martinov Statistics in Germany 1992 births Living people Bulgarian men's footballers Men's association football defenders First Professional Football League (Bulgaria) players Second Professional Football League (Bulgaria) players Azerbaijan Premier League players PFC Slavia Sofia players PFK Svetkavitsa 1922 players OFC Sliven 2000 players FC Spartak Varna players BC Aichach players Sabail FK players FC Arda Kardzhali players Expatriate men's footballers in Azerbaijan Bulgarian expatriate sportspeople in Azerbaijan

658 Asteria is a minor planet orbiting the Sun. References External links Koronis asteroids Asteria Asteria S-type asteroids (Tholen) 19080123

The Billboard Hot 100 is a chart that ranks the best-performing songs in the United States. Its data, published by Billboard magazine and compiled by Nielsen SoundScan, is based collectively on each song's weekly physical and digital sales, as well as the amount of airplay received on American radio stations and streaming on online digital music outlets. During 2019, fifteen singles reached number one on the Hot 100; a sixteenth single, "Thank U, Next" by Ariana Grande, began its run at number one in November 2018. Of those fifteen number-one singles, four were collaborations. In total, eighteen acts topped the chart as either lead or featured artists, with ten—Swae Lee (as a solo artist), Bradley Cooper, Jonas Brothers, Lil Nas X, Billy Ray Cyrus, Billie Eilish, Shawn Mendes, Lizzo, Lewis Capaldi, and Selena Gomez—achieving their first Hot 100 number-one single. Lil Nas X's "Old Town Road" was the longest-running number-one of the year, leading the chart for nineteen weeks (one for the song's original version, credited solely to Lil Nas X, and eighteen for a remix featuring Billy Ray Cyrus); in doing so, it broke the record as the longest-running number one single in Billboard history - a record previously held by the sixteen-week runs of both "One Sweet Day" by Mariah Carey (who added a nineteenth number one single in 2019) and Boyz II Men (1995–96), and "Despacito" by Luis Fonsi and Daddy Yankee featuring Justin Bieber (2017). It also topped the Billboard Year-End Hot 100 ranking as the best-performing single of 2019. Post Malone and Ariana Grande were the only acts to have multiple number-one songs in 2019, with two apiece. Chart history Number-one artists See also 2019 in American music List of Billboard 200 number-one albums of 2019 List of Billboard Hot 100 top-ten singles in 2019 Billboard Year-End Hot 100 singles of 2019 Notes References United States Hot 100 2019 Hot 100 number-one singles

Ludwig van Beethoven's Piano Sonata No. 2 in A major, Op. 2, No. 2, was written in 1795 and dedicated to Joseph Haydn. It was published simultaneously with his first and third sonatas in 1796. Donald Francis Tovey wrote, "The second sonata is flawless in execution and entirely beyond the range of Haydn and Mozart in harmonic and dramatic thought, except in the Finale." A typical performance of the entire sonata lasts about 22 minutes. The sonata was the first Beethoven sonata to reach America and was performed in New York on June 5, 1807. Structure The sonata is laid out in four movements: I. Allegro vivace The first movement is an athletic movement that has a bright disposition. The second theme of exposition contains some striking modulations for the time period. A large portion of the development section is in F major, which contains a third relationship with the key of the work, A major. A difficult, but beautiful canonic section is also to be found in the development. The recapitulation contains no coda and the movement ends quietly and unassumingly. Tovey wrote, "The opening of the second subject in the first movement is a wonderful example of the harmonic principle previously mentioned...In all music, nothing equally dramatic can be found before the D minor sonata, Op. 31 No. 2 which is rightly regarded as marking the beginning of Beethoven's second period." II. Largo appassionato One of the few instances in which Beethoven uses the tempo marking Largo, which was the slowest such marking for a movement. The opening imitates the style of a string quartet and features a staccato pizzicato-like bass against lyrical chords. A high degree of contrapuntal thinking is evident in Beethoven's conception of this movement. The key is the subdominant of A major, D major. Tovey wrote, "The slow movement shows a thrilling solemnity that immediately proves the identity of the pupil of Haydn with the creator of the 9th symphony." III. Scherzo: Allegretto A short and graceful movement that is in many respects similar to a minuet. This is the first instance in his 32 numbered sonatas in which the term "Scherzo" is used. The A minor trio section adds contrast to the cheerful opening material of this movement. Unusually, there is a second melody (not in the trio) in the remote key of G minor. IV. Rondo: Grazioso A beautiful and lyrical rondo. The arpeggio that opens the repeated material becomes more elaborate at each entrance. The form of this rondo is A1–B1–A2–C–A3–B2–A4–Coda. The C section, in the parallel minor A minor, is rather agitated and stormy in comparison to the rest of the work, and is representative of the so-called "Sturm und Drang" style. A simple but elegant V7–I perfect cadence closes the entire work in the lower register, played piano. References External links A lecture by András Schiff on Beethoven's Piano Sonata, Op. 2, No. 2 Recording by Paavali Jumppanen, piano from the Isabella Stewart Gardner Museum For a public domain recording of this sonata visit Musopen Piano Sonata 02 1796 compositions Compositions in A major Music with dedications

Ariel Adrián Cólzera, also known as Ariel Damián Cólzera, (born April 15, 1986) is an Argentine footballer currently playing for Deportivo Merlo. References External links 1986 births Living people Argentine men's footballers Argentine expatriate men's footballers Argentina men's youth international footballers Argentina men's international footballers Men's association football forwards Boca Juniors footballers FK Teplice players Club Atlético Huracán footballers Gimnasia y Esgrima de Jujuy footballers Atlético de Rafaela footballers San Martín de San Juan footballers Unión de Santa Fe footballers Unión La Calera footballers Santiago Wanderers footballers Crucero del Norte footballers Club Atlético Temperley footballers Juventud Unida de Gualeguaychú players Club Atlético Sarmiento footballers Deportivo Merlo footballers Argentine Primera División players Czech First League players Chilean Primera División players Primera Nacional players Argentine expatriate sportspeople in Chile Argentine expatriate sportspeople in the Czech Republic Expatriate men's footballers in Chile Expatriate men's footballers in the Czech Republic

Sheikh Hassan Moussa () is the leading imam of the Stockholm Mosque at Medborgarplatsen. The mosque is run by the Islamiska Förbundet i Stockholm. A Svenska Dagbladet report accused him of deliberately misleading the Swedish public regarding the controversial contents of his sermons. Notes Year of birth missing (living people) Living people Swedish imams

Chester Gaylord (February 24, 1899 – July 1, 1984) was a vocalist and among the most active of recording artists in the United States during the late 1920s through the early 1930s. He was known as The Whispering Serenader on radio and on his phonograph records. He began his career as a singer and announcer for radio station WTAG in Worcester, Massachusetts in the early 1920s. Chester Gaylord's first recordings (in 1920) were saxophone solos for Thomas Edison, whom he had met. In 1923, he signed with Columbia records and made a number of vocal records for them. His popularity spread rapidly leading Brunswick Records (the second largest record company in the United States in the 1920s) to offer him an exclusive contract. He became one of the labels most prolific vocalists during the late 1920s. After the Warner Brothers bought out the Brunswick Record company in April 1930 a reorganization occurred and Chester Gaylord's contact was one of numerous artists whose contract was not renewed. Chester Gaylord continued to be popular on radio throughout the early 1930s until the introduction of swing music, in 1935, a type of music that was unsuitable to his style of singing. From 1929 to 1931, he was a featured vocalist on NBC radio on the Top Notchers Coca-Cola Radio Program with Leonard Joy and his All String Orchestra. Gaylord moved to WBZ in Boston in the late 40s, and completed his broadcasting career there. He retired sometime in the mid-1960s. During his retirement years he lived in Sterling, Massachusetts. He regularly played 1920s and 1930s songs on piano at The Old Timer, an Irish Pub in neighboring Clinton, Mass. According to Gaylord's obituary, he was still performing right up until a few weeks before his death. Works Pianist Thinking of me thinking of you (1928) My window of Dreams (1928) Here's the party now in Person (1928) You're in love and I'm in Love (1928) My Inspiration is You (1928) Me and the man in the Moon (1928) Glad Rag Roll (1929) Honey (1929) Vocalist My Troubles are Over (1929) Mean to me (1929) See also Jack Smith "the whispering baritone" References Further reading 1899 births 1984 deaths 20th-century American singers 20th-century American male singers

Dry Run is a tributary of the Lehigh River in Northampton County, Pennsylvania, in the United States. It is approximately long and flows through Allen Township and Northampton. The stream is designated as a Coldwater Fishery and a Migratory Fishery. It is often dry. Course Dry Run begins in a flat area west of Sauerkraut Hill in Allen Township. It flows south for several tenths of a mile before crossing Pennsylvania Route 329 and continuing to flow south. The stream eventually begins to gradually turn southwest and enters Northampton. Here, it flows west-southwest for a few tenths of a mile before turning southwest for several tenths of a mile. The stream then reaches its confluence with the Lehigh River. Dry Run joins the Lehigh River upstream of its mouth. Geography and geology The elevation near the mouth of Dry Run is above sea level. The elevation near the stream's source is above sea level. Watershed The watershed of Dry Run has an area of . The stream is entirely within the United States Geological Survey quadrangle of Catasauqua. Polluted stormwater in Allen Township has the potential to impact Dry Run. However, an NPDES permit was once issued for discharge of stormwater into the stream, associated with construction activities. The stream frequently is dry. History Dry Run was entered into the Geographic Names Information System on August 2, 1979. Its identifier in the Geographic Names Information System is 1173531. In 1787, Christian Schwartz constructed a large stone house at the mouth of Dry Run. A lost Pratt through truss bridge was once built over Dry Run for the Lehigh Valley Transit Co. Historically, a trolley bridge crossed the stream and a school was located near this bridge. In 2014, the Delaware and Lehigh National Heritage Corridor received $217,000 from the Pennsylvania Department of Community and Economic Development to replace a pedestrian bridge over the stream. Biology The drainage basin of Dry Run is designated as a Coldwater Fishery and a Migratory Fishery. See also Coplay Creek, next tributary of the Lehigh River going downriver Hokendauqua Creek, next tributary of the Lehigh River going upriver List of rivers of Pennsylvania References Tributaries of the Lehigh River

Martínez is a town in the province of Ávila, Castile and León in Spain. It belongs in the judicial district of Piedrahita. Situation It is located at an altitude of 1098 m and covers an area of 17.20 km². Located 70 km from the capital, bordering the province of Salamanca. Belongs to the judicial district of Piedrahita. Population Data INE for 2005. Total: 190 Male: 100 Female: 90 Government The mayor is Adolfo Caselle White. References External links Official Website of Martínez Populated places in the Province of Ávila

```rust use crate::atom_table::*; use crate::forms::*; use crate::instructions::*; use crate::iterators::*; use crate::machine::loader::*; use crate::machine::machine_errors::CompilationError; use crate::machine::preprocessor::*; use crate::parser::ast::*; use crate::parser::dashu::Rational; use crate::variable_records::*; use dashu::Integer; use indexmap::{IndexMap, IndexSet}; use std::cell::Cell; use std::cmp::Ordering; use std::collections::VecDeque; use std::hash::{Hash, Hasher}; use std::ops::{Deref, DerefMut}; #[derive(Debug, Clone)] //, PartialOrd, PartialEq, Eq, Hash)] pub struct BranchNumber { branch_num: Rational, delta: Rational, } impl Default for BranchNumber { fn default() -> Self { Self { branch_num: Rational::from(1u64 << 63), delta: Rational::from(1), } } } impl PartialEq<BranchNumber> for BranchNumber { #[inline] fn eq(&self, rhs: &BranchNumber) -> bool { self.branch_num == rhs.branch_num } } impl Eq for BranchNumber {} impl Hash for BranchNumber { #[inline(always)] fn hash<H: Hasher>(&self, hasher: &mut H) { self.branch_num.hash(hasher) } } impl PartialOrd<BranchNumber> for BranchNumber { #[inline] fn partial_cmp(&self, rhs: &BranchNumber) -> Option<Ordering> { self.branch_num.partial_cmp(&rhs.branch_num) } } impl BranchNumber { fn split(&self) -> BranchNumber { BranchNumber { branch_num: self.branch_num.clone() + &self.delta / Rational::from(2), delta: &self.delta / Rational::from(4), } } fn incr_by_delta(&self) -> BranchNumber { BranchNumber { branch_num: self.branch_num.clone() + &self.delta, delta: self.delta.clone(), } } fn halve_delta(&self) -> BranchNumber { BranchNumber { branch_num: self.branch_num.clone(), delta: &self.delta / Rational::from(2), } } } #[derive(Debug, Clone, PartialEq, Eq, Hash)] pub struct VarInfo { var_ptr: VarPtr, chunk_type: ChunkType, classify_info: ClassifyInfo, lvl: Level, } #[derive(Debug, Clone, PartialEq, Eq, Hash)] pub struct ChunkInfo { chunk_num: usize, term_loc: GenContext, // pointer to incidence, term occurrence arity. vars: Vec<VarInfo>, } #[derive(Debug)] pub struct BranchArm { pub arm_terms: Vec<QueryTerm>, } #[derive(Debug, Clone, PartialEq, Eq, Hash)] pub struct BranchInfo { branch_num: BranchNumber, chunks: Vec<ChunkInfo>, } impl BranchInfo { fn new(branch_num: BranchNumber) -> Self { Self { branch_num, chunks: vec![], } } } type BranchMapInt = IndexMap<VarPtr, Vec<BranchInfo>>; #[derive(Debug, Clone)] pub struct BranchMap(BranchMapInt); impl Deref for BranchMap { type Target = BranchMapInt; #[inline(always)] fn deref(&self) -> &BranchMapInt { &self.0 } } impl DerefMut for BranchMap { #[inline(always)] fn deref_mut(&mut self) -> &mut BranchMapInt { &mut self.0 } } type RootSet = IndexSet<BranchNumber>; #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] pub struct ClassifyInfo { arg_c: usize, arity: usize, } enum TraversalState { // construct a QueryTerm::Branch with number of disjuncts, reset // the chunk type to that of the chunk preceding the disjunct and the chunk_num. BuildDisjunct(usize), // add the last disjunct to a QueryTerm::Branch, continuing from // where it leaves off. BuildFinalDisjunct(usize), Fail, GetCutPoint { var_num: usize, prev_b: bool }, Cut { var_num: usize, is_global: bool }, CutPrev(usize), ResetCallPolicy(CallPolicy), Term(Term), OverrideGlobalCutVar(usize), ResetGlobalCutVarOverride(Option<usize>), RemoveBranchNum, // pop the current_branch_num and from the root set. AddBranchNum(BranchNumber), // set current_branch_num, add it to the root set RepBranchNum(BranchNumber), // replace current_branch_num and the latest in the root set } #[derive(Debug)] pub struct VariableClassifier { call_policy: CallPolicy, current_branch_num: BranchNumber, current_chunk_num: usize, current_chunk_type: ChunkType, branch_map: BranchMap, var_num: usize, root_set: RootSet, global_cut_var_num: Option<usize>, global_cut_var_num_override: Option<usize>, } #[derive(Debug, Default)] pub struct VarData { pub records: VariableRecords, pub global_cut_var_num: Option<usize>, pub allocates: bool, } impl VarData { fn emit_initial_get_level(&mut self, build_stack: &mut ChunkedTermVec) { let global_cut_var_num = if let &Some(global_cut_var_num) = &self.global_cut_var_num { match &self.records[global_cut_var_num].allocation { VarAlloc::Perm(..) => Some(global_cut_var_num), VarAlloc::Temp { term_loc, .. } if term_loc.chunk_num() > 0 => { Some(global_cut_var_num) } _ => None, } } else { None }; if let Some(global_cut_var_num) = global_cut_var_num { let term = QueryTerm::GetLevel(global_cut_var_num); self.records[global_cut_var_num].allocation = VarAlloc::Perm(0, PermVarAllocation::Pending); match build_stack.front_mut() { Some(ChunkedTerms::Branch(_)) => { build_stack.push_front(ChunkedTerms::Chunk(VecDeque::from(vec![term]))); } Some(ChunkedTerms::Chunk(chunk)) => { chunk.push_front(term); } None => { unreachable!() } } } } } pub type ClassifyFactResult = (Term, VarData); pub type ClassifyRuleResult = (Term, ChunkedTermVec, VarData); fn merge_branch_seq(branches: impl Iterator<Item = BranchInfo>) -> BranchInfo { let mut branch_info = BranchInfo::new(BranchNumber::default()); for mut branch in branches { branch_info.branch_num = branch.branch_num; branch_info.chunks.append(&mut branch.chunks); } branch_info.branch_num.delta = branch_info.branch_num.delta * Integer::from(2); branch_info.branch_num.branch_num -= &branch_info.branch_num.delta; branch_info } fn flatten_into_disjunct(build_stack: &mut ChunkedTermVec, preceding_len: usize) { let branch_vec = build_stack.drain(preceding_len + 1..).collect(); if let ChunkedTerms::Branch(ref mut disjuncts) = &mut build_stack[preceding_len] { disjuncts.push(branch_vec); } else { unreachable!(); } } impl VariableClassifier { pub fn new(call_policy: CallPolicy) -> Self { Self { call_policy, current_branch_num: BranchNumber::default(), current_chunk_num: 0, current_chunk_type: ChunkType::Head, branch_map: BranchMap(BranchMapInt::new()), root_set: RootSet::new(), var_num: 0, global_cut_var_num: None, global_cut_var_num_override: None, } } pub fn classify_fact(mut self, term: Term) -> Result<ClassifyFactResult, CompilationError> { self.classify_head_variables(&term)?; Ok(( term, self.branch_map.separate_and_classify_variables( self.var_num, self.global_cut_var_num, self.current_chunk_num, ), )) } pub fn classify_rule<'a, LS: LoadState<'a>>( mut self, loader: &mut Loader<'a, LS>, head: Term, body: Term, ) -> Result<ClassifyRuleResult, CompilationError> { self.classify_head_variables(&head)?; self.root_set.insert(self.current_branch_num.clone()); let mut query_terms = self.classify_body_variables(loader, body)?; self.merge_branches(); let mut var_data = self.branch_map.separate_and_classify_variables( self.var_num, self.global_cut_var_num, self.current_chunk_num, ); var_data.emit_initial_get_level(&mut query_terms); Ok((head, query_terms, var_data)) } fn merge_branches(&mut self) { for branches in self.branch_map.values_mut() { let mut old_branches = std::mem::take(branches); while let Some(last_branch_num) = old_branches.last().map(|bi| &bi.branch_num) { let mut old_branches_len = old_branches.len(); for (rev_idx, bi) in old_branches.iter().rev().enumerate() { if &bi.branch_num > last_branch_num { old_branches_len = old_branches.len() - rev_idx; } } let iter = old_branches.drain(old_branches_len - 1..); branches.push(merge_branch_seq(iter)); } branches.reverse(); } } fn try_set_chunk_at_inlined_boundary(&mut self) -> bool { if self.current_chunk_type.is_last() { self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; true } else { false } } fn try_set_chunk_at_call_boundary(&mut self) -> bool { if self.current_chunk_type.is_last() { self.current_chunk_num += 1; true } else { self.current_chunk_type = ChunkType::Last; false } } fn probe_body_term(&mut self, arg_c: usize, arity: usize, term: &Term) { let classify_info = ClassifyInfo { arg_c, arity }; // second arg is true to iterate the root, which may be a variable for term_ref in breadth_first_iter(term, RootIterationPolicy::Iterated) { if let TermRef::Var(lvl, _, var_ptr) = term_ref { // root terms are shallow here (since we're iterating a // body term) so take the child level. let lvl = lvl.child_level(); self.probe_body_var(VarInfo { var_ptr, lvl, classify_info, chunk_type: self.current_chunk_type, }); } } } fn probe_body_var(&mut self, var_info: VarInfo) { let term_loc = self .current_chunk_type .to_gen_context(self.current_chunk_num); let branch_info_v = self.branch_map.entry(var_info.var_ptr.clone()).or_default(); let needs_new_branch = if let Some(last_bi) = branch_info_v.last() { !self.root_set.contains(&last_bi.branch_num) } else { true }; if needs_new_branch { branch_info_v.push(BranchInfo::new(self.current_branch_num.clone())); } let branch_info = branch_info_v.last_mut().unwrap(); let needs_new_chunk = if let Some(last_ci) = branch_info.chunks.last() { last_ci.chunk_num != self.current_chunk_num } else { true }; if needs_new_chunk { branch_info.chunks.push(ChunkInfo { chunk_num: self.current_chunk_num, term_loc, vars: vec![], }); } let chunk_info = branch_info.chunks.last_mut().unwrap(); chunk_info.vars.push(var_info); } fn probe_in_situ_var(&mut self, var_num: usize) { let classify_info = ClassifyInfo { arg_c: 1, arity: 1 }; let var_info = VarInfo { var_ptr: VarPtr::from(Var::InSitu(var_num)), classify_info, chunk_type: self.current_chunk_type, lvl: Level::Shallow, }; self.probe_body_var(var_info); } fn classify_head_variables(&mut self, term: &Term) -> Result<(), CompilationError> { match term { Term::Clause(..) | Term::Literal(_, Literal::Atom(_)) => {} _ => return Err(CompilationError::InvalidRuleHead), } let mut classify_info = ClassifyInfo { arg_c: 1, arity: term.arity(), }; if let Term::Clause(_, _, terms) = term { for term in terms.iter() { for term_ref in breadth_first_iter(term, RootIterationPolicy::Iterated) { if let TermRef::Var(lvl, _, var_ptr) = term_ref { // a body term, so we need the child level here. let lvl = lvl.child_level(); // the body of the if let here is an inlined // "probe_head_var". note the difference between it // and "probe_body_var". let branch_info_v = self.branch_map.entry(var_ptr.clone()).or_default(); let needs_new_branch = branch_info_v.is_empty(); if needs_new_branch { branch_info_v.push(BranchInfo::new(self.current_branch_num.clone())); } let branch_info = branch_info_v.last_mut().unwrap(); let needs_new_chunk = branch_info.chunks.is_empty(); if needs_new_chunk { branch_info.chunks.push(ChunkInfo { chunk_num: self.current_chunk_num, term_loc: GenContext::Head, vars: vec![], }); } let chunk_info = branch_info.chunks.last_mut().unwrap(); let var_info = VarInfo { var_ptr, classify_info, chunk_type: self.current_chunk_type, lvl, }; chunk_info.vars.push(var_info); } } classify_info.arg_c += 1; } } Ok(()) } fn classify_body_variables<'a, LS: LoadState<'a>>( &mut self, loader: &mut Loader<'a, LS>, term: Term, ) -> Result<ChunkedTermVec, CompilationError> { let mut state_stack = vec![TraversalState::Term(term)]; let mut build_stack = ChunkedTermVec::new(); self.current_chunk_type = ChunkType::Mid; while let Some(traversal_st) = state_stack.pop() { match traversal_st { TraversalState::AddBranchNum(branch_num) => { self.root_set.insert(branch_num.clone()); self.current_branch_num = branch_num; } TraversalState::RemoveBranchNum => { self.root_set.pop(); } TraversalState::RepBranchNum(branch_num) => { self.root_set.pop(); self.root_set.insert(branch_num.clone()); self.current_branch_num = branch_num; } TraversalState::ResetCallPolicy(call_policy) => { self.call_policy = call_policy; } TraversalState::BuildDisjunct(preceding_len) => { flatten_into_disjunct(&mut build_stack, preceding_len); self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; } TraversalState::BuildFinalDisjunct(preceding_len) => { flatten_into_disjunct(&mut build_stack, preceding_len); self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; } TraversalState::GetCutPoint { var_num, prev_b } => { if self.try_set_chunk_at_inlined_boundary() { build_stack.add_chunk(); } self.probe_in_situ_var(var_num); build_stack.push_chunk_term(QueryTerm::GetCutPoint { var_num, prev_b }); } TraversalState::OverrideGlobalCutVar(var_num) => { self.global_cut_var_num_override = Some(var_num); } TraversalState::ResetGlobalCutVarOverride(old_override) => { self.global_cut_var_num_override = old_override; } TraversalState::Cut { var_num, is_global } => { if self.try_set_chunk_at_inlined_boundary() { build_stack.add_chunk(); } self.probe_in_situ_var(var_num); build_stack.push_chunk_term(if is_global { QueryTerm::GlobalCut(var_num) } else { QueryTerm::LocalCut { var_num, cut_prev: false, } }); } TraversalState::CutPrev(var_num) => { if self.try_set_chunk_at_inlined_boundary() { build_stack.add_chunk(); } self.probe_in_situ_var(var_num); build_stack.push_chunk_term(QueryTerm::LocalCut { var_num, cut_prev: true, }); } TraversalState::Fail => { build_stack.push_chunk_term(QueryTerm::Fail); } TraversalState::Term(term) => { // return true iff new chunk should be added. let update_chunk_data = |classifier: &mut Self, predicate_name, arity| { if ClauseType::is_inlined(predicate_name, arity) { classifier.try_set_chunk_at_inlined_boundary() } else { classifier.try_set_chunk_at_call_boundary() } }; let mut add_chunk = |classifier: &mut Self, name: Atom, terms: Vec<Term>| { if update_chunk_data(classifier, name, terms.len()) { build_stack.add_chunk(); } for (arg_c, term) in terms.iter().enumerate() { classifier.probe_body_term(arg_c + 1, terms.len(), term); } build_stack.push_chunk_term(clause_to_query_term( loader, name, terms, classifier.call_policy, )); }; match term { Term::Clause( _, name @ (atom!("->") | atom!(";") | atom!(",")), mut terms, ) if terms.len() == 3 => { if let Some(last_arg) = terms.last() { if let Term::Literal(_, Literal::CodeIndex(_)) = last_arg { terms.pop(); state_stack.push(TraversalState::Term(Term::Clause( Cell::default(), name, terms, ))); } else { add_chunk(self, name, terms); } } } Term::Clause(_, atom!(","), mut terms) if terms.len() == 2 => { let tail = terms.pop().unwrap(); let head = terms.pop().unwrap(); let iter = unfold_by_str(tail, atom!(",")) .into_iter() .rev() .chain(std::iter::once(head)) .map(TraversalState::Term); state_stack.extend(iter); } Term::Clause(_, atom!(";"), mut terms) if terms.len() == 2 => { let tail = terms.pop().unwrap(); let head = terms.pop().unwrap(); let first_branch_num = self.current_branch_num.split(); let branches: Vec<_> = std::iter::once(head) .chain(unfold_by_str(tail, atom!(";")).into_iter()) .collect(); let mut branch_numbers = vec![first_branch_num]; for idx in 1..branches.len() { let succ_branch_number = branch_numbers[idx - 1].incr_by_delta(); branch_numbers.push(if idx + 1 < branches.len() { succ_branch_number.split() } else { succ_branch_number }); } let build_stack_len = build_stack.len(); build_stack.reserve_branch(branches.len()); state_stack.push(TraversalState::RepBranchNum( self.current_branch_num.halve_delta(), )); let iter = branches.into_iter().zip(branch_numbers.into_iter()); let final_disjunct_loc = state_stack.len(); for (term, branch_num) in iter.rev() { state_stack.push(TraversalState::BuildDisjunct(build_stack_len)); state_stack.push(TraversalState::RemoveBranchNum); state_stack.push(TraversalState::Term(term)); state_stack.push(TraversalState::AddBranchNum(branch_num)); } if let TraversalState::BuildDisjunct(build_stack_len) = state_stack[final_disjunct_loc] { state_stack[final_disjunct_loc] = TraversalState::BuildFinalDisjunct(build_stack_len); } self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; } Term::Clause(_, atom!("->"), mut terms) if terms.len() == 2 => { let then_term = terms.pop().unwrap(); let if_term = terms.pop().unwrap(); let prev_b = if matches!( state_stack.last(), Some(TraversalState::RemoveBranchNum) ) { // check if the second-to-last element // is a regular BuildDisjunct, as we // don't want to add GetPrevLevel in // case of a TrustMe. match state_stack.iter().rev().nth(1) { Some(&TraversalState::BuildDisjunct(preceding_len)) => { preceding_len + 1 == build_stack.len() } _ => false, } } else { false }; state_stack.push(TraversalState::Term(then_term)); state_stack.push(TraversalState::Cut { var_num: self.var_num, is_global: false, }); state_stack.push(TraversalState::Term(if_term)); state_stack.push(TraversalState::GetCutPoint { var_num: self.var_num, prev_b, }); self.var_num += 1; } Term::Clause(_, atom!("\\+"), mut terms) if terms.len() == 1 => { let not_term = terms.pop().unwrap(); let build_stack_len = build_stack.len(); build_stack.reserve_branch(2); state_stack.push(TraversalState::BuildFinalDisjunct(build_stack_len)); state_stack.push(TraversalState::Term(Term::Clause( Cell::default(), atom!("$succeed"), vec![], ))); state_stack.push(TraversalState::BuildDisjunct(build_stack_len)); state_stack.push(TraversalState::Fail); state_stack.push(TraversalState::CutPrev(self.var_num)); state_stack.push(TraversalState::ResetGlobalCutVarOverride( self.global_cut_var_num_override, )); state_stack.push(TraversalState::Term(not_term)); state_stack.push(TraversalState::OverrideGlobalCutVar(self.var_num)); state_stack.push(TraversalState::GetCutPoint { var_num: self.var_num, prev_b: false, }); self.current_chunk_type = ChunkType::Mid; self.current_chunk_num += 1; self.var_num += 1; } Term::Clause(_, atom!(":"), mut terms) if terms.len() == 2 => { let predicate_name = terms.pop().unwrap(); let module_name = terms.pop().unwrap(); match (module_name, predicate_name) { ( Term::Literal(_, Literal::Atom(module_name)), Term::Literal(_, Literal::Atom(predicate_name)), ) => { if update_chunk_data(self, predicate_name, 0) { build_stack.add_chunk(); } build_stack.push_chunk_term(qualified_clause_to_query_term( loader, module_name, predicate_name, vec![], self.call_policy, )); } ( Term::Literal(_, Literal::Atom(module_name)), Term::Clause(_, name, terms), ) => { if update_chunk_data(self, name, terms.len()) { build_stack.add_chunk(); } for (arg_c, term) in terms.iter().enumerate() { self.probe_body_term(arg_c + 1, terms.len(), term); } build_stack.push_chunk_term(qualified_clause_to_query_term( loader, module_name, name, terms, self.call_policy, )); } (module_name, predicate_name) => { if update_chunk_data(self, atom!("call"), 2) { build_stack.add_chunk(); } self.probe_body_term(1, 0, &module_name); self.probe_body_term(2, 0, &predicate_name); terms.push(module_name); terms.push(predicate_name); build_stack.push_chunk_term(clause_to_query_term( loader, atom!("call"), vec![Term::Clause(Cell::default(), atom!(":"), terms)], self.call_policy, )); } } } Term::Clause(_, atom!("$call_with_inference_counting"), mut terms) if terms.len() == 1 => { state_stack.push(TraversalState::ResetCallPolicy(self.call_policy)); state_stack.push(TraversalState::Term(terms.pop().unwrap())); self.call_policy = CallPolicy::Counted; } Term::Clause(_, name, terms) => { add_chunk(self, name, terms); } var @ Term::Var(..) => { if update_chunk_data(self, atom!("call"), 1) { build_stack.add_chunk(); } self.probe_body_term(1, 1, &var); build_stack.push_chunk_term(clause_to_query_term( loader, atom!("call"), vec![var], self.call_policy, )); } Term::Literal(_, Literal::Atom(atom!("!")) | Literal::Char('!')) => { let (var_num, is_global) = if let Some(var_num) = self.global_cut_var_num_override { (var_num, false) } else if let Some(var_num) = self.global_cut_var_num { (var_num, true) } else { let var_num = self.var_num; self.global_cut_var_num = Some(var_num); self.var_num += 1; (var_num, true) }; self.probe_in_situ_var(var_num); state_stack.push(TraversalState::Cut { var_num, is_global }); } Term::Literal(_, Literal::Atom(name)) => { if update_chunk_data(self, name, 0) { build_stack.add_chunk(); } build_stack.push_chunk_term(clause_to_query_term( loader, name, vec![], self.call_policy, )); } _ => { return Err(CompilationError::InadmissibleQueryTerm); } } } } } Ok(build_stack) } } impl BranchMap { pub fn separate_and_classify_variables( &mut self, var_num: usize, global_cut_var_num: Option<usize>, current_chunk_num: usize, ) -> VarData { let mut var_data = VarData { records: VariableRecords::new(var_num), global_cut_var_num, allocates: current_chunk_num > 0, }; for (var, branches) in self.iter_mut() { let (mut var_num, var_num_incr) = if let Var::InSitu(var_num) = *var.borrow() { (var_num, false) } else { (var_data.records.len(), true) }; for branch in branches.iter_mut() { if var_num_incr { var_num = var_data.records.len(); var_data.records.push(VariableRecord::default()); } if branch.chunks.len() <= 1 { // true iff var is a temporary variable. debug_assert_eq!(branch.chunks.len(), 1); let chunk = &mut branch.chunks[0]; let mut temp_var_data = TempVarData::new(); for var_info in chunk.vars.iter_mut() { if var_info.lvl == Level::Shallow { let term_loc = var_info.chunk_type.to_gen_context(chunk.chunk_num); temp_var_data .use_set .insert((term_loc, var_info.classify_info.arg_c)); } } var_data.records[var_num].allocation = VarAlloc::Temp { term_loc: chunk.term_loc, temp_reg: 0, temp_var_data, safety: VarSafetyStatus::Needed, to_perm_var_num: None, }; } // else VarAlloc is already a Perm variant, as it's the default. for chunk in branch.chunks.iter_mut() { var_data.records[var_num].num_occurrences += chunk.vars.len(); for var_info in chunk.vars.iter_mut() { var_info.var_ptr.set(Var::Generated(var_num)); } } } } var_data.records.populate_restricting_sets(); var_data } } ```

was the third son of Tsunehisa. His childhood name was Hikoshirō (彦四郎). He also called himself for the domain he ruled. He received Enya of east Izumo Province and used Mount Yōgai (要害山) for his castle. Like his elder brother Kunihisa, he was skilled in warfare. Not satisfied with the size of his domain, he demanded another 700 Kan in addition to 3000 Kan he already owned. He raised a revolt against Tsunehisa in 1532 suspecting Kamei Hidetsuna, the chief advisor to Tsunehisa had been plotting against him. The Amago clan split into two and Kamei Toshitsuna, Hidetsuna's younger brother died fighting for Okihisa. He was driven out of Enya and escaped. In 1534, he committed seppuku realizing that he would never be able to return to the clan. References 1497 births 1534 deaths Daimyo Suicides by seppuku Amago clan 16th-century suicides

Shin Pal-gyun(신팔균, 申八均, May 19, 1882 ~ July 2, 1924) or Shin Dong-chun (신동천, 申東川) was an independence activist of Korea. His wife Im Su-myung (임수명) was an independence activist also. Biography Shin Pal-gyun was born in Seoul on May 19, 1882. His great-great-grandfather Shin Hong-ju, grandfather Shin-hun, and father Shin Seok-hee were all high-ranking military officers. Especially his father Shin Seok-hee was the officer that negotiationed Treaty of Ganghwa and Joseon-America Treaty. So Shin Pal-hyun naturally grew up a soldier of Korean Empire. He graduated the Military Academy and he became a military officer in 1903. In 1907, the Korean army was disorganizationed by Japan. In 1909, he decided to start the independence movement. After Japan-Korea Annexation Treaty, fled to Manchuria and Primorsky Krai, and settled in West Jiandao. He joined Shinheung Military Academy. He worked there as an instructor and he trained many independence activists. At the same time he graduated Imperial Japanese Army Academy and worked there. He met Ji Cheong-cheon and Kim Gyeong-chun at Manchuria. These three men decided to have names which includes '天'(means 'sky' in Chinese). Shin Pal-gyun's artificial name was Shin Dong-chun. In 1920, he went to South Manchuria and participated in independence movement organisation. He used to fight against Japanese police in North Pyongan. In 1924, when he was doing the outdoor discipline, he was assassinated by a Chinese mounted bandit who was employed by Japanese force. References 1882 births 1924 deaths Korean independence activists People from Seoul Imperial Korean military personnel 19th-century Korean people 20th-century Korean people Pyongsan Shin clan

is a sports arena in Bunkyo, Tokyo, Japan, which has hosted boxing, professional wrestling, kickboxing, mixed martial arts and Lethwei matches. History On April 16, 1962, the Korakuen Hall was officially opened with a capacity of approximately 2,000 people. It is located inside the Tokyo Dome City, one of Tokyo's biggest attractions. The venue hosted the boxing events for the 1964 Summer Olympics. In March 2011, as the hall suffered structural damage in the Tōhoku earthquake. Events including a World Boxing Council triple female world title fight were postponed or canceled. The repair work was completed on March 18. The Hall was closed until the next day, then gradually resumed a variety of events. On October 27, 2016, the hall became the chosen venue for the International Lethwei Federation Japan. The Lethwei Grand Prix Japan 2016 was the first event of the promotion held at the venue. Tokyo JCB Hall (Korakuen Hall 2) The Tokyo JCB Hall also known Tokyo Dome City Hall is a facility for sports, fashion shows, and live concerts inside the Tokyo Dome City complex, a few minutes walk from the Korakuen Hall. It was announced that a new version of Korakuen Hall would be built in Tokyo Dome City which would act as the Korakuen Hall 2 and it would hold 2,500–3,000 people. The naming rights of the hall were purchased by Japan Credit Bureau (JCB) so it opened as JCB Hall. After the construction completed, the Tokyo Dome Corporation, which owns the original Korakuen Hall as well as the Tokyo Dome, would continue to rent out the original Korakuen Hall, lowering rental prices (currently it costs 1,500,000 Yen to rent) to allowing smaller promotions to use the building on a regular basis. Although most of the sporting events take place at the Tokyo Dome, the JCB Hall is considered one of the primary spots in Tokyo Dome City for smaller scale sporting events, like boxing, pro-wrestling, Lethwei and mixed martial arts. The JCB Hall hosted Miss International Japan. Since its completion, JCB Hall has been host of Lethwei in Japan 4, and has been rarely used for pro wrestling events after the Pro Wrestling Zero1 show in early 2008. During 2009, JCB Hall was used twice for pro wrestling, both times for a tour ending show by Pro Wrestling Noah. References External links 1964 Summer Olympics official report. Volume 1. Part 1. pp. 128–9. Venues of the 1964 Summer Olympics Indoor arenas in Japan Sports venues in Tokyo Boxing venues in Japan Lethwei venues in Japan Olympic boxing venues Television studios Buildings and structures in Bunkyō Sports venues completed in 1962 1962 establishments in Japan

Fructolysis refers to the metabolism of fructose from dietary sources. Though the metabolism of glucose through glycolysis uses many of the same enzymes and intermediate structures as those in fructolysis, the two sugars have very different metabolic fates in human metabolism. Unlike glucose, which is directly metabolized widely in the body, fructose is almost entirely metabolized in the liver in humans, where it is directed toward replenishment of liver glycogen and triglyceride synthesis. Under one percent of ingested fructose is directly converted to plasma triglyceride. 29% - 54% of fructose is converted in liver to glucose, and about a quarter of fructose is converted to lactate. 15% - 18% is converted to glycogen. Glucose and lactate are then used normally as energy to fuel cells all over the body. Fructose is a dietary monosaccharide present naturally in fruits and vegetables, either as free fructose or as part of the disaccharide sucrose, and as its polymer inulin. It is also present in the form of refined sugars including granulated sugars (white crystalline table sugar, brown sugar, confectioner's sugar, and turbinado sugar), refined crystalline fructose , as high fructose corn syrups as well as in honey. About 10% of the calories contained in the Western diet are supplied by fructose (approximately 55 g/day). Unlike glucose, fructose is not an insulin secretagogue, and can in fact lower circulating insulin. In addition to the liver, fructose is metabolized in the intestines, testis, kidney, skeletal muscle, fat tissue and brain, but it is not transported into cells via insulin-sensitive pathways (insulin regulated transporters GLUT1 and GLUT4). Instead, fructose is taken in by GLUT5. Fructose in muscles and adipose tissue is phosphorylated by hexokinase. Fructolysis and glycolysis are independent pathways Although the metabolism of fructose and glucose share many of the same intermediate structures, they have very different metabolic fates in human metabolism. Fructose is metabolized almost completely in the liver in humans, and is directed toward replenishment of liver glycogen and triglyceride synthesis, while much of dietary glucose passes through the liver and goes to skeletal muscle, where it is metabolized to CO2, H2O and ATP, and to fat cells where it is metabolized primarily to glycerol phosphate for triglyceride synthesis as well as energy production. The products of fructose metabolism are liver glycogen and de novo lipogenesis of fatty acids and eventual synthesis of endogenous triglyceride. This synthesis can be divided into two main phases: The first phase is the synthesis of the trioses, dihydroxyacetone (DHAP) and glyceraldehyde; the second phase is the subsequent metabolism of these trioses either in the gluconeogenic pathway for glycogen replenishment and/or the complete metabolism in the fructolytic pathway to pyruvate, which enters the Krebs cycle, is converted to citrate and subsequently directed toward de novo synthesis of the free fatty acid palmitate. The metabolism of fructose to DHAP and glyceraldehyde The first step in the metabolism of fructose is the phosphorylation of fructose to fructose 1-phosphate by fructokinase (Km = 0.5 mM, ≈ 9 mg/100 ml), thus trapping fructose for metabolism in the liver. Hexokinase IV (Glucokinase), also occurs in the liver and would be capable of phosphorylating fructose to fructose 6-phosphate (an intermediate in the gluconeogenic pathway); however, it has a relatively high Km (12 mM) for fructose and, therefore, essentially all of the fructose is converted to fructose-1-phosphate in the human liver. Much of the glucose, on the other hand, is not phosphorylated (Km of hepatic glucokinase (hexokinase IV) = 10 mM), passes through the liver directed toward peripheral tissues, and is taken up by the insulin-dependent glucose transporter, GLUT 4, present on adipose tissue and skeletal muscle. Fructose-1-phosphate then undergoes hydrolysis by fructose-1-phosphate aldolase (aldolase B) to form dihydroxyacetone phosphate (DHAP) and glyceraldehyde; DHAP can either be isomerized to glyceraldehyde 3-phosphate by triosephosphate isomerase or undergo reduction to glycerol 3-phosphate by glycerol 3-phosphate dehydrogenase. The glyceraldehyde produced may also be converted to glyceraldehyde 3-phosphate by glyceraldehyde kinase or converted to glycerol 3-phosphate by glyceraldehyde 3-phosphate dehydrogenase. The metabolism of fructose at this point yields intermediates in gluconeogenic pathway leading to glycogen synthesis, or can be oxidized to pyruvate and reduced to lactate, or be decarboxylated to acetyl CoA in the mitochondria and directed toward the synthesis of free fatty acid, resulting finally in triglyceride synthesis. Synthesis of glycogen from DHAP and glyceraldehyde-3-phosphate The synthesis of glycogen in the liver following a fructose-containing meal proceeds from gluconeogenic precursors. Fructose is initially converted to DHAP and glyceraldehyde by fructokinase and aldolase B. The resultant glyceraldehyde then undergoes phosphorylation to glyceraldehyde-3-phosphate. Increased concentrations of DHAP and glyceraldehyde-3-phosphate in the liver drive the gluconeogenic pathway toward glucose-6-phosphate, glucose-1-phosphate and glycogen formation. It appears that fructose is a better substrate for glycogen synthesis than glucose and that glycogen replenishment takes precedence over triglyceride formation. Once liver glycogen is replenished, the intermediates of fructose metabolism are primarily directed toward triglyceride synthesis. Synthesis of triglyceride from DHAP and glyceraldehyde-3-phosphate Carbons from dietary fructose are found in both the FFA and glycerol moieties of plasma triglycerides (TG). Excess dietary fructose can be converted to pyruvate, enter the Krebs cycle and emerges as citrate directed toward free fatty acid synthesis in the cytosol of hepatocytes. The DHAP formed during fructolysis can also be converted to glycerol and then glycerol 3-phosphate for TG synthesis. Thus, fructose can provide trioses for both the glycerol 3-phosphate backbone, as well as the free fatty acids in TG synthesis. Indeed, fructose may provide the bulk of the carbohydrate directed toward de novo TG synthesis in humans. Fructose induces hepatic lipogenic enzymes Fructose consumption results in the insulin-independent induction of several important hepatic lipogenic enzymes including pyruvate kinase, NADP+-dependent malate dehydrogenase, citrate lyase, acetyl CoA carboxylase, fatty acid synthase, as well as pyruvate dehydrogenase. Although not a consistent finding among metabolic feeding studies, diets high in refined fructose have been shown to lead to hypertriglyceridemia in a wide range of populations including individuals with normal glucose metabolism as well as individuals with impaired glucose tolerance, diabetes, hypertriglyceridemia, and hypertension. The hypertriglyceridemic effects observed are a hallmark of increased dietary carbohydrate, and fructose appears to be dependent on a number of factors including the amount of dietary fructose consumed and degree of insulin resistance. ‡ = Mean ± SEM activity in nmol/min per mg protein § = 12 rats/group * = Significantly different from control at p < 0.05 Abnormalities in fructose metabolism The lack of two important enzymes in fructose metabolism results in the development of two inborn errors in carbohydrate metabolism – essential fructosuria and hereditary fructose intolerance. In addition, reduced phosphorylation potential within hepatocytes can occur with intravenous infusion of fructose. Inborn errors in fructose metabolism Essential fructosuria The absence of fructokinase results in the inability to phosphorylate fructose to fructose-1-phosphate within the cell. As a result, fructose is neither trapped within the cell nor directed toward its metabolism. Free fructose concentrations in the liver increase and fructose is free to leave the cell and enter plasma. This results in an increase in plasma concentration of fructose, eventually exceeding the kidneys' threshold for fructose reabsorption resulting in the appearance of fructose in the urine. Essential fructosuria is a benign asymptomatic condition. Hereditary fructose intolerance The absence of fructose-1-phosphate aldolase (aldolase B) results in the accumulation of fructose 1 phosphate in hepatocytes, kidney and small intestines. An accumulation of fructose-1-phosphate following fructose ingestion inhibits glycogenolysis (breakdown of glycogen) and gluconeogenesis, resulting in severe hypoglycemia. It is symptomatic resulting in severe hypoglycemia, abdominal pain, vomiting, hemorrhage, jaundice, hepatomegaly, and hyperuricemia eventually leading to liver and/or kidney failure and death. The incidence varies throughout the world, but it is estimated at 1:55,000 (range 1:10,000 to 1:100,000) live births. Reduced phosphorylation potential Intravenous (i.v.) infusion of fructose has been shown to lower phosphorylation potential in liver cells by trapping inorganic phosphate (Pi) as fructose 1-phosphate. The fructokinase reaction occurs quite rapidly in hepatocytes trapping fructose in cells by phosphorylation. On the other hand, the splitting of fructose 1 phosphate to DHAP and glyceraldehyde by Aldolase B is relatively slow. Therefore, fructose-1-phosphate accumulates with the corresponding reduction of intracellular Pi available for phosphorylation reactions in the cell. This is why fructose is contraindicated for total parenteral nutrition (TPN) solutions and is never given intravenously as a source of carbohydrate. It has been suggested that excessive dietary intake of fructose may also result in reduced phosphorylation potential. However, this is still a contentious issue. Dietary fructose is not well absorbed and increased dietary intake often results in malabsorption. Whether or not sufficient amounts of dietary fructose could be absorbed to cause a significant reduction in phosphorylating potential in liver cells remains questionable and there are no clear examples of this in the literature. References External links The Entry of Fructose and Galactose into Glycolysis, Chapter 16.1.11. Biochemistry, 5th edition, Jeremy M Berg, John L Tymoczko, and Lubert Stryer, New York: W H Freeman; 2002. Biochemistry Carbohydrates Cellular respiration Metabolic pathways

```objective-c /* * * This program is free software; you can redistribute it and/or modify * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #ifndef __PJSIP_SIP_TRANSPORT_H__ #define __PJSIP_SIP_TRANSPORT_H__ /** * @file sip_transport.h * @brief SIP Transport */ #include <pjsip/sip_msg.h> #include <pjsip/sip_parser.h> #include <pjsip/sip_resolve.h> #include <pj/sock.h> #include <pj/list.h> #include <pj/ioqueue.h> #include <pj/timer.h> PJ_BEGIN_DECL /** * @defgroup PJSIP_TRANSPORT Transport * @ingroup PJSIP_CORE * @brief This is the transport framework. * * The transport framework is fully extensible. Please see * <A HREF="/docs.htm">PJSIP Developer's Guide</A> PDF * document for more information. * * Application MUST register at least one transport to PJSIP before any * messages can be sent or received. Please see @ref PJSIP_TRANSPORT_UDP * on how to create/register UDP transport to the transport framework. * * @{ */ /***************************************************************************** * * GENERAL TRANSPORT (NAMES, TYPES, ETC.) * *****************************************************************************/ /* * Forward declaration for transport factory (since it is referenced by * the transport factory itself). */ typedef struct pjsip_tpfactory pjsip_tpfactory; /** * Flags for SIP transports. */ enum pjsip_transport_flags_e { PJSIP_TRANSPORT_RELIABLE = 1, /**< Transport is reliable. */ PJSIP_TRANSPORT_SECURE = 2, /**< Transport is secure. */ PJSIP_TRANSPORT_DATAGRAM = 4 /**< Datagram based transport. (it's also assumed to be connectionless) */ }; /** * Check if transport tp is reliable. */ #define PJSIP_TRANSPORT_IS_RELIABLE(tp) \ ((tp)->flag & PJSIP_TRANSPORT_RELIABLE) /** * Check if transport tp is secure. */ #define PJSIP_TRANSPORT_IS_SECURE(tp) \ ((tp)->flag & PJSIP_TRANSPORT_SECURE) /** * Register new transport type to PJSIP. The PJSIP transport framework * contains the info for some standard transports, as declared by * #pjsip_transport_type_e. Application may use non-standard transport * with PJSIP, but before it does so, it must register the information * about the new transport type to PJSIP by calling this function. * * @param tp_flag The flags describing characteristics of this * transport type. * @param tp_name Transport type name. * @param def_port Default port to be used for the transport. * @param p_tp_type On successful registration, it will be filled with * the registered type. This argument is optional. * * @return PJ_SUCCESS if registration is successful, or * PJSIP_ETYPEEXISTS if the same transport type has * already been registered. */ PJ_DECL(pj_status_t) pjsip_transport_register_type(unsigned tp_flag, const char *tp_name, int def_port, int *p_tp_type); /** * Get the transport type from the transport name. * * @param name Transport name, such as "TCP", or "UDP". * * @return The transport type, or PJSIP_TRANSPORT_UNSPECIFIED if * the name is not recognized as the name of supported * transport. */ PJ_DECL(pjsip_transport_type_e) pjsip_transport_get_type_from_name(const pj_str_t *name); /** * Get the first transport type that has the specified flags. * * @param flag The transport flag. * * @return Transport type. */ PJ_DECL(pjsip_transport_type_e) pjsip_transport_get_type_from_flag(unsigned flag); /** * Get the socket address family of a given transport type. * * @param type Transport type. * * @return Transport type. */ PJ_DECL(int) pjsip_transport_type_get_af(pjsip_transport_type_e type); /** * Get transport flag from type. * * @param type Transport type. * * @return Transport flags. */ PJ_DECL(unsigned) pjsip_transport_get_flag_from_type( pjsip_transport_type_e type ); /** * Get the default SIP port number for the specified type. * * @param type Transport type. * * @return The port number, which is the default SIP port number for * the specified type. */ PJ_DECL(int) pjsip_transport_get_default_port_for_type(pjsip_transport_type_e type); /** * Get transport type name. * * @param t Transport type. * * @return Transport name. */ PJ_DECL(const char*) pjsip_transport_get_type_name(pjsip_transport_type_e t); /** * Get longer description for the specified transport type. * * @param t Transport type. * * @return Transport description. */ PJ_DECL(const char*) pjsip_transport_get_type_desc(pjsip_transport_type_e t); /***************************************************************************** * * TRANSPORT SELECTOR. * *****************************************************************************/ /** * This structure describes the type of data in pjsip_tpselector. */ typedef enum pjsip_tpselector_type { /** Transport is not specified. */ PJSIP_TPSELECTOR_NONE, /** Use the specific transport to send request. */ PJSIP_TPSELECTOR_TRANSPORT, /** Use the specific listener to send request. */ PJSIP_TPSELECTOR_LISTENER, /** Use the IP version criteria to send request. */ PJSIP_TPSELECTOR_IP_VER, } pjsip_tpselector_type; /** * This enumerator describes the IP version criteria for pjsip_tpselector. */ typedef enum pjsip_tpselector_ip_ver { /** IPv4 only. */ PJSIP_TPSELECTOR_USE_IPV4_ONLY, /** * No preference. IP version used will depend on the order of addresses * returned by pjsip_resolver. */ PJSIP_TPSELECTOR_NO_PREFERENCE, /** IPv4 is preferred. */ PJSIP_TPSELECTOR_PREFER_IPV4, /** IPv6 is preferred. */ PJSIP_TPSELECTOR_PREFER_IPV6, /** IPv6 only. */ PJSIP_TPSELECTOR_USE_IPV6_ONLY } pjsip_tpselector_ip_ver; /** * This structure describes the transport/listener preference to be used * when sending outgoing requests. * * Normally transport will be selected automatically according to rules about * sending requests. But some applications (such as proxies or B2BUAs) may * want to explicitly use specific transport to send requests, for example * when they want to make sure that outgoing request should go from a specific * network interface. * * The pjsip_tpselector structure is used for that purpose, i.e. to allow * application specificly request that a particular transport/listener * should be used to send request. This structure is used when calling * pjsip_tsx_set_transport() and pjsip_dlg_set_transport(). * * If application disables connection reuse and wants to force creating * a new transport, it needs to consider the following couple of things: * - If it still wants to reuse an existing transport (if any), it * needs to keep a reference to that transport and specifically set * the transport to be used for sending requests. * - Delete those existing transports manually when no longer needed. */ typedef struct pjsip_tpselector { /** The type of data in the union */ pjsip_tpselector_type type; /** * Whether to disable reuse of an existing connection. * This setting will be ignored if (type == PJSIP_TPSELECTOR_TRANSPORT) * and transport in the union below is set. */ pj_bool_t disable_connection_reuse; /** * Union representing the transport/listener/IP version criteria * to be used. */ union { pjsip_transport *transport; pjsip_tpfactory *listener; pjsip_tpselector_ip_ver ip_ver; void *ptr; } u; } pjsip_tpselector; /** * Add transport/listener reference in the selector to prevent the specified * transport/listener from being destroyed while application still has * reference to it. * * @param sel The transport selector. */ PJ_DECL(void) pjsip_tpselector_add_ref(pjsip_tpselector *sel); /** * Decrement transport/listener reference in the selector. * @param sel The transport selector */ PJ_DECL(void) pjsip_tpselector_dec_ref(pjsip_tpselector *sel); /***************************************************************************** * * RECEIVE DATA BUFFER. * *****************************************************************************/ /** * A customized ioqueue async operation key which is used by transport * to locate rdata when a pending read operation completes. */ typedef struct pjsip_rx_data_op_key { pj_ioqueue_op_key_t op_key; /**< ioqueue op_key. */ pjsip_rx_data *rdata; /**< rdata associated with this */ } pjsip_rx_data_op_key; /** * Incoming message buffer. * This structure keep all the information regarding the received message. This * buffer lifetime is only very short, normally after the transaction has been * called, this buffer will be deleted/recycled. So care must be taken when * allocating storage from the pool of this buffer. */ struct pjsip_rx_data { /** * tp_info is part of rdata that remains static for the duration of the * buffer. It is initialized when the buffer was created by transport. */ struct { /** Memory pool for this buffer. */ pj_pool_t *pool; /** The transport object which received this packet. */ pjsip_transport *transport; /** Other transport specific data to be attached to this buffer. */ void *tp_data; /** Ioqueue key. */ pjsip_rx_data_op_key op_key; } tp_info; /** * pkt_info is initialized by transport when it receives an incoming * packet. */ struct { /** Time when the message was received. */ pj_time_val timestamp; /** Pointer to the original packet. */ char packet[PJSIP_MAX_PKT_LEN]; /** Zero termination for the packet. */ pj_uint32_t zero; /** The length of the packet received. */ pj_ssize_t len; /** The source address from which the packet was received. */ pj_sockaddr src_addr; /** The length of the source address. */ int src_addr_len; /** The IP source address string (NULL terminated). */ char src_name[PJ_INET6_ADDRSTRLEN]; /** The IP source port number. */ int src_port; } pkt_info; /** * msg_info is initialized by transport mgr (tpmgr) before this buffer * is passed to endpoint. */ struct { /** Start of msg buffer. */ char *msg_buf; /** Length fo message. */ int len; /** The parsed message, if any. */ pjsip_msg *msg; /** Short description about the message. * Application should use #pjsip_rx_data_get_info() instead. */ char *info; /** The Call-ID header as found in the message. */ pjsip_cid_hdr *cid; /** The From header as found in the message. */ pjsip_from_hdr *from; /** The To header as found in the message. */ pjsip_to_hdr *to; /** The topmost Via header as found in the message. */ pjsip_via_hdr *via; /** The CSeq header as found in the message. */ pjsip_cseq_hdr *cseq; /** Max forwards header. */ pjsip_max_fwd_hdr *max_fwd; /** The first route header. */ pjsip_route_hdr *route; /** The first record-route header. */ pjsip_rr_hdr *record_route; /** Content-type header. */ pjsip_ctype_hdr *ctype; /** Content-length header. */ pjsip_clen_hdr *clen; /** "Require" header containing aggregates of all Require * headers found in the message, or NULL. */ pjsip_require_hdr *require; /** "Supported" header containing aggregates of all Supported * headers found in the message, or NULL. */ pjsip_supported_hdr *supported; /** The list of error generated by the parser when parsing this message. */ pjsip_parser_err_report parse_err; } msg_info; /** * endpt_info is initialized by endpoint after this buffer reaches * endpoint. */ struct { /** * Data attached by modules to this message. */ void *mod_data[PJSIP_MAX_MODULE]; } endpt_info; }; /** * Get printable information about the message in the rdata. * * @param rdata The receive data buffer. * * @return Printable information. */ PJ_DECL(char*) pjsip_rx_data_get_info(pjsip_rx_data *rdata); /** * Clone pjsip_rx_data. This will duplicate the contents of * pjsip_rx_data and add reference count to the transport. * Once application has finished using the cloned pjsip_rx_data, * it must release it by calling #pjsip_rx_data_free_cloned(). * * By default (if flags is set to zero), this function copies the * transport pointer in \a tp_info, duplicates the \a pkt_info, * perform deep clone of the \a msg_info parts of the rdata, and * fills the \a endpt_info (i.e. the \a mod_data) with zeros. * * @param src The source to be cloned. * @param flags Optional flags. Must be zero for now. * @param p_rdata Pointer to receive the cloned rdata. * * @return PJ_SUCCESS on success or the appropriate error. */ PJ_DECL(pj_status_t) pjsip_rx_data_clone(const pjsip_rx_data *src, unsigned flags, pjsip_rx_data **p_rdata); /** * Free cloned pjsip_rx_data. This function must be and must only * be called for a cloned pjsip_rx_data. Specifically, it must NOT * be called for the original pjsip_rx_data that is returned by * transports. * * This function will free the memory used by the pjsip_rx_data and * decrement the transport reference counter. * * @param rdata The receive data buffer. * * @return PJ_SUCCESS on success or the appropriate error. */ PJ_DECL(pj_status_t) pjsip_rx_data_free_cloned(pjsip_rx_data *rdata); /***************************************************************************** * * TRANSMIT DATA BUFFER MANIPULATION. * *****************************************************************************/ /** Customized ioqueue async operation key, used by transport to keep * callback parameters. */ typedef struct pjsip_tx_data_op_key { /** ioqueue pending operation key. */ pj_ioqueue_op_key_t key; /** Transmit data associated with this key. */ pjsip_tx_data *tdata; /** Arbitrary token (attached by transport) */ void *token; /** Callback to be called when pending transmit operation has completed. */ void (*callback)(pjsip_transport*,void*,pj_ssize_t); } pjsip_tx_data_op_key; /** * Data structure for sending outgoing message. Application normally creates * this buffer by calling #pjsip_endpt_create_tdata. * * The lifetime of this buffer is controlled by the reference counter in this * structure, which is manipulated by calling #pjsip_tx_data_add_ref and * #pjsip_tx_data_dec_ref. When the reference counter has reached zero, then * this buffer will be destroyed. * * A transaction object normally will add reference counter to this buffer * when application calls #pjsip_tsx_send_msg, because it needs to keep the * message for retransmission. The transaction will release the reference * counter once its state has reached final state. */ struct pjsip_tx_data { /** This is for transmission queue; it's managed by transports. */ PJ_DECL_LIST_MEMBER(struct pjsip_tx_data); /** Memory pool for this buffer. */ pj_pool_t *pool; /** A name to identify this buffer. */ char obj_name[PJ_MAX_OBJ_NAME]; /** Short information describing this buffer and the message in it. * Application should use #pjsip_tx_data_get_info() instead of * directly accessing this member. */ char *info; /** For response message, this contains the reference to timestamp when * the original request message was received. The value of this field * is set when application creates response message to a request by * calling #pjsip_endpt_create_response. */ pj_time_val rx_timestamp; /** The transport manager for this buffer. */ pjsip_tpmgr *mgr; /** Ioqueue asynchronous operation key. */ pjsip_tx_data_op_key op_key; /** Lock object. */ pj_lock_t *lock; /** The message in this buffer. */ pjsip_msg *msg; /** Strict route header saved by #pjsip_process_route_set(), to be * restored by #pjsip_restore_strict_route_set(). */ pjsip_route_hdr *saved_strict_route; /** Buffer to the printed text representation of the message. When the * content of this buffer is set, then the transport will send the content * of this buffer instead of re-printing the message structure. If the * message structure has changed, then application must invalidate this * buffer by calling #pjsip_tx_data_invalidate_msg. */ pjsip_buffer buf; /** Reference counter. */ pj_atomic_t *ref_cnt; /** Being processed by transport? */ int is_pending; /** Transport manager internal. */ void *token; /** Callback to be called when this tx_data has been transmitted. */ void (*cb)(void*, pjsip_tx_data*, pj_ssize_t); /** Destination information, to be used to determine the network address * of the message. For a request, this information is initialized when * the request is sent with #pjsip_endpt_send_request_stateless() and * network address is resolved. For CANCEL request, this information * will be copied from the original INVITE to make sure that the CANCEL * request goes to the same physical network address as the INVITE * request. */ struct { /** Server name. */ pj_str_t name; /** Server addresses resolved. */ pjsip_server_addresses addr; /** Current server address being tried. */ unsigned cur_addr; } dest_info; /** Transport information, only valid during on_tx_request() and * on_tx_response() callback. */ struct { pjsip_transport *transport; /**< Transport being used. */ pj_sockaddr dst_addr; /**< Destination address. */ int dst_addr_len; /**< Length of address. */ char dst_name[PJ_INET6_ADDRSTRLEN]; /**< Destination address. */ int dst_port; /**< Destination port. */ } tp_info; /** * Transport selector, to specify which transport to be used. * The value here must be set with pjsip_tx_data_set_transport(), * to allow reference counter to be set properly. */ pjsip_tpselector tp_sel; /** * Special flag to indicate that this transmit data is a request that has * been updated with proper authentication response and is ready to be * sent for retry. */ pj_bool_t auth_retry; /** * Arbitrary data attached by PJSIP modules. */ void *mod_data[PJSIP_MAX_MODULE]; /** * If via_addr is set, it will be used as the "sent-by" field of the * Via header for outgoing requests as long as the request uses via_tp * transport. Normally application should not use or access these fields. */ pjsip_host_port via_addr; /**< Via address. */ const void *via_tp; /**< Via transport. */ }; /** * Create a new, blank transmit buffer. The reference count is initialized * to zero. * * @param mgr The transport manager. * @param tdata Pointer to receive transmit data. * * @return PJ_SUCCESS, or the appropriate error code. * * @see pjsip_endpt_create_tdata */ PJ_DECL(pj_status_t) pjsip_tx_data_create( pjsip_tpmgr *mgr, pjsip_tx_data **tdata ); /** * Add reference counter to the transmit buffer. The reference counter controls * the life time of the buffer, ie. when the counter reaches zero, then it * will be destroyed. * * @param tdata The transmit buffer. */ PJ_DECL(void) pjsip_tx_data_add_ref( pjsip_tx_data *tdata ); /** * Decrement reference counter of the transmit buffer. * When the transmit buffer is no longer used, it will be destroyed and * caller is informed with PJSIP_EBUFDESTROYED return status. * * @param tdata The transmit buffer data. * @return This function will always succeeded eventhough the return * status is non-zero. A status PJSIP_EBUFDESTROYED will be * returned to inform that buffer is destroyed. */ PJ_DECL(pj_status_t) pjsip_tx_data_dec_ref( pjsip_tx_data *tdata ); /** * Print the SIP message to transmit data buffer's internal buffer. This * may allocate memory for the buffer, if the buffer has not been allocated * yet, and encode the SIP message to that buffer. * * @param tdata The transmit buffer. * * @return PJ_SUCCESS on success of the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_tx_data_encode(pjsip_tx_data *tdata); /** * Check if transmit data buffer contains a valid message. * * @param tdata The transmit buffer. * @return Non-zero (PJ_TRUE) if buffer contains a valid message. */ PJ_DECL(pj_bool_t) pjsip_tx_data_is_valid( pjsip_tx_data *tdata ); /** * Invalidate the print buffer to force message to be re-printed. Call * when the message has changed after it has been printed to buffer. The * message is printed to buffer normally by transport when it is about to be * sent to the wire. Subsequent sending of the message will not cause * the message to be re-printed, unless application invalidates the buffer * by calling this function. * * @param tdata The transmit buffer. */ PJ_DECL(void) pjsip_tx_data_invalidate_msg( pjsip_tx_data *tdata ); /** * Get short printable info about the transmit data. This will normally return * short information about the message. * * @param tdata The transmit buffer. * * @return Null terminated info string. */ PJ_DECL(char*) pjsip_tx_data_get_info( pjsip_tx_data *tdata ); /** * Set the explicit transport to be used when sending this transmit data. * Application should not need to call this function, but rather use * pjsip_tsx_set_transport() and pjsip_dlg_set_transport() instead (which * will call this function). * * @param tdata The transmit buffer. * @param sel Transport selector. * * @return PJ_SUCCESS on success. */ PJ_DECL(pj_status_t) pjsip_tx_data_set_transport(pjsip_tx_data *tdata, const pjsip_tpselector *sel); /** * Clone pjsip_tx_data. This will duplicate the message contents of * pjsip_tx_data (pjsip_tx_data.msg) and add reference count to the tdata. * Once application has finished using the cloned pjsip_tx_data, * it must release it by calling #pjsip_tx_data_dec_ref(). * Currently, this will only clone response message. * * @param src The source to be cloned. * @param flags Optional flags. Must be zero for now. * @param p_rdata Pointer to receive the cloned tdata. * * @return PJ_SUCCESS on success or the appropriate error. */ PJ_DECL(pj_status_t) pjsip_tx_data_clone(const pjsip_tx_data *src, unsigned flags, pjsip_tx_data **p_rdata); /***************************************************************************** * * TRANSPORT * *****************************************************************************/ /** * Type of callback to receive transport operation status. */ typedef void (*pjsip_transport_callback)(pjsip_transport *tp, void *token, pj_ssize_t sent_bytes); /** * This structure describes transport key to be registered to hash table. */ typedef struct pjsip_transport_key { /** * Transport type. */ long type; /** * Destination address. */ pj_sockaddr rem_addr; } pjsip_transport_key; /** * Enumeration of transport direction types. */ typedef enum pjsip_transport_dir { PJSIP_TP_DIR_NONE, /**< Direction not set, normally used by connectionless transports such as UDP transport. */ PJSIP_TP_DIR_OUTGOING, /**< Outgoing connection or client mode, this is only for connection-oriented transports. */ PJSIP_TP_DIR_INCOMING, /**< Incoming connection or server mode, this is only for connection-oriented transports. */ } pjsip_transport_dir; /** * This structure represent the "public" interface of a SIP transport. * Applications normally extend this structure to include transport * specific members. */ struct pjsip_transport { char obj_name[PJ_MAX_OBJ_NAME]; /**< Name. */ pj_pool_t *pool; /**< Pool used by transport. */ pj_atomic_t *ref_cnt; /**< Reference counter. */ pj_lock_t *lock; /**< Lock object. */ pj_grp_lock_t *grp_lock; /**< Group lock for sync with ioqueue and timer. */ pj_bool_t tracing; /**< Tracing enabled? */ pj_bool_t is_shutdown; /**< Being shutdown? */ pj_bool_t is_destroying; /**< Destroy in progress? */ /** Key for indexing this transport in hash table. */ pjsip_transport_key key; char *type_name; /**< Type name. */ unsigned flag; /**< #pjsip_transport_flags_e */ char *info; /**< Transport info/description.*/ int addr_len; /**< Length of addresses. */ pj_sockaddr local_addr; /**< Bound address. */ pjsip_host_port local_name; /**< Published name (eg. STUN). */ pjsip_host_port remote_name; /**< Remote address name. */ pjsip_transport_dir dir; /**< Connection direction. */ pjsip_endpoint *endpt; /**< Endpoint instance. */ pjsip_tpmgr *tpmgr; /**< Transport manager. */ pjsip_tpfactory *factory; /**< Factory instance. Note: it may be invalid/shutdown. */ pj_timer_entry idle_timer; /**< Timer when ref cnt is zero.*/ pj_timestamp last_recv_ts; /**< Last time receiving data. */ pj_size_t last_recv_len; /**< Last received data length. */ void *data; /**< Internal transport data. */ unsigned initial_timeout;/**< Initial timeout interval to be applied to incoming TCP/TLS transports when no valid data received after a successful connection. */ /** * Function to be called by transport manager to send SIP message. * * @param transport The transport to send the message. * @param packet The buffer to send. * @param length The length of the buffer to send. * @param op_key Completion token, which will be supplied to * caller when pending send operation completes. * @param rem_addr The remote destination address. * @param addr_len Size of remote address. * @param callback If supplied, the callback will be called * once a pending transmission has completed. If * the function completes immediately (i.e. return * code is not PJ_EPENDING), the callback will not * be called. * * @return Should return PJ_SUCCESS only if data has been * succesfully queued to operating system for * transmission. Otherwise it may return PJ_EPENDING * if the underlying transport can not send the * data immediately and will send it later, which in * this case caller doesn't have to do anything * except wait the calback to be called, if it * supplies one. * Other return values indicate the error code. */ pj_status_t (*send_msg)(pjsip_transport *transport, pjsip_tx_data *tdata, const pj_sockaddr_t *rem_addr, int addr_len, void *token, pjsip_transport_callback callback); /** * Instruct the transport to initiate graceful shutdown procedure. * After all objects release their reference to this transport, * the transport will be deleted. * * Note that application MUST use #pjsip_transport_shutdown() instead. * * @param transport The transport. * * @return PJ_SUCCESS on success. */ pj_status_t (*do_shutdown)(pjsip_transport *transport); /** * Forcefully destroy this transport regardless whether there are * objects that currently use this transport. This function should only * be called by transport manager or other internal objects (such as the * transport itself) who know what they're doing. Application should use * #pjsip_transport_shutdown() instead. * * @param transport The transport. * * @return PJ_SUCCESS on success. */ pj_status_t (*destroy)(pjsip_transport *transport); /* * Application may extend this structure.. */ }; /** * Register a transport instance to the transport manager. This function * is normally called by the transport instance when it is created * by application. * * @param mgr The transport manager. * @param tp The new transport to be registered. * * @return PJ_SUCCESS on success. */ PJ_DECL(pj_status_t) pjsip_transport_register( pjsip_tpmgr *mgr, pjsip_transport *tp ); /** * Start graceful shutdown procedure for this transport. After graceful * shutdown has been initiated, no new reference can be obtained for * the transport. However, existing objects that currently uses the * transport may still use this transport to send and receive packets. * * After all objects release their reference to this transport, * the transport will be destroyed immediately. * * @param tp The transport. * * @return PJ_SUCCESS on success. */ PJ_DECL(pj_status_t) pjsip_transport_shutdown(pjsip_transport *tp); /** * Start shutdown procedure for this transport. If \a force is false, * the API is the same as #pjsip_transport_shutdown(), while * if \a force is true, existing transport users will immediately * receive PJSIP_TP_STATE_DISCONNECTED notification and should not * use the transport anymore. In either case, transport will * only be destroyed after all objects release their references. * * @param tp The transport. * @param force Force transport to immediately send * disconnection state notification. * * @return PJ_SUCCESS on success. */ PJ_DECL(pj_status_t) pjsip_transport_shutdown2(pjsip_transport *tp, pj_bool_t force); /** * Destroy a transport when there is no object currently uses the transport. * This function is normally called internally by transport manager or the * transport itself. Application should use #pjsip_transport_shutdown() * instead. * * @param tp The transport instance. * * @return PJ_SUCCESS on success or the appropriate error code. * Some of possible errors are PJSIP_EBUSY if the * transport's reference counter is not zero. */ PJ_DECL(pj_status_t) pjsip_transport_destroy( pjsip_transport *tp); /** * Add reference counter to the specified transport. Any objects that wishes * to keep the reference of the transport MUST increment the transport's * reference counter to prevent it from being destroyed. * * @param tp The transport instance. * * @return PJ_SUCCESS on success or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_transport_add_ref( pjsip_transport *tp ); /** * Decrement reference counter of the specified transport. When an object no * longer want to keep the reference to the transport, it must decrement the * reference counter. When the reference counter of the transport reaches * zero, the transport manager will start the idle timer to destroy the * transport if no objects acquire the reference counter during the idle * interval. * * @param tp The transport instance. * * @return PJ_SUCCESS on success. */ PJ_DECL(pj_status_t) pjsip_transport_dec_ref( pjsip_transport *tp ); /** * This function is called by transport instances to report an incoming * packet to the transport manager. The transport manager then would try to * parse all SIP messages in the packet, and for each parsed SIP message, it * would report the message to the SIP endpoint (#pjsip_endpoint). * * @param mgr The transport manager instance. * @param rdata The receive data buffer containing the packet. The * transport MUST fully initialize tp_info and pkt_info * member of the rdata. * * @return The number of bytes successfully processed from the * packet. If the transport is datagram oriented, the * value will be equal to the size of the packet. For * stream oriented transport (e.g. TCP, TLS), the value * returned may be less than the packet size, if * partial message is received. The transport then MUST * keep the remainder part and report it again to * this function once more data/packet is received. */ PJ_DECL(pj_ssize_t) pjsip_tpmgr_receive_packet(pjsip_tpmgr *mgr, pjsip_rx_data *rdata); /***************************************************************************** * * TRANSPORT FACTORY * *****************************************************************************/ /** * A transport factory is normally used for connection oriented transports * (such as TCP or TLS) to create instances of transports. It registers * a new transport type to the transport manager, and the transport manager * would ask the factory to create a transport instance when it received * command from application to send a SIP message using the specified * transport type. */ struct pjsip_tpfactory { /** This list is managed by transport manager. */ PJ_DECL_LIST_MEMBER(struct pjsip_tpfactory); char obj_name[PJ_MAX_OBJ_NAME]; /**< Name. */ pj_pool_t *pool; /**< Owned memory pool. */ pj_lock_t *lock; /**< Lock object. */ pjsip_transport_type_e type; /**< Transport type. */ char *type_name; /**< Type string name. */ unsigned flag; /**< Transport flag. */ char *info; /**< Transport info/description.*/ pj_sockaddr local_addr; /**< Bound address. */ pjsip_host_port addr_name; /**< Published name. */ /** * Create new outbound connection suitable for sending SIP message * to specified remote address. * Note that the factory is responsible for both creating the * transport and registering it to the transport manager. */ pj_status_t (*create_transport)(pjsip_tpfactory *factory, pjsip_tpmgr *mgr, pjsip_endpoint *endpt, const pj_sockaddr *rem_addr, int addr_len, pjsip_transport **transport); /** * Create new outbound connection suitable for sending SIP message * to specified remote address by also considering outgoing SIP * message data. * Note that the factory is responsible for both creating the * transport and registering it to the transport manager. */ pj_status_t (*create_transport2)(pjsip_tpfactory *factory, pjsip_tpmgr *mgr, pjsip_endpoint *endpt, const pj_sockaddr *rem_addr, int addr_len, pjsip_tx_data *tdata, pjsip_transport **transport); /** * Destroy the listener. */ pj_status_t (*destroy)(pjsip_tpfactory *factory); /* * Application may extend this structure.. */ }; /** * Register a transport factory. * * @param mgr The transport manager. * @param tpf Transport factory. * * @return PJ_SUCCESS if listener was successfully created. */ PJ_DECL(pj_status_t) pjsip_tpmgr_register_tpfactory(pjsip_tpmgr *mgr, pjsip_tpfactory *tpf); /** * Unregister factory. * * @param mgr The transport manager. * @param tpf Transport factory. * * @return PJ_SUCCESS is sucessfully unregistered. */ PJ_DECL(pj_status_t) pjsip_tpmgr_unregister_tpfactory(pjsip_tpmgr *mgr, pjsip_tpfactory *tpf); /***************************************************************************** * * TRANSPORT MANAGER * *****************************************************************************/ /** * Type of callback to be called when transport manager receives incoming * SIP message. * * @param ep Endpoint. * @param status Receiption status. * @param rd Received packet. */ typedef void (*pjsip_rx_callback)(pjsip_endpoint *ep, pj_status_t status, pjsip_rx_data *rd); /** * Type of callback to be called before transport manager is about * to transmit SIP message. * * @param ep Endpoint. * @param td Transmit data. */ typedef pj_status_t (*pjsip_tx_callback)(pjsip_endpoint *ep, pjsip_tx_data*td); /** * Create a transport manager. Normally application doesn't need to call * this function directly, since a transport manager will be created and * destroyed automatically by the SIP endpoint. * * @param pool Pool. * @param endpt Endpoint instance. * @param rx_cb Callback to receive incoming message. * @param tx_cb Callback to be called before transport manager is sending * outgoing message. * @param p_mgr Pointer to receive the new transport manager. * * @return PJ_SUCCESS or the appropriate error code on error. */ PJ_DECL(pj_status_t) pjsip_tpmgr_create( pj_pool_t *pool, pjsip_endpoint * endpt, pjsip_rx_callback rx_cb, pjsip_tx_callback tx_cb, pjsip_tpmgr **p_mgr); /** * Find out the appropriate local address info (IP address and port) to * advertise in Contact header based on the remote address to be * contacted. The local address info would be the address name of the * transport or listener which will be used to send the request. * * In this implementation, it will only select the transport based on * the transport type in the request. * * @see pjsip_tpmgr_find_local_addr2() * * @param tpmgr The transport manager. * @param pool Pool to allocate memory for the IP address. * @param type Destination address to contact. * @param sel Optional pointer to prefered transport, if any. * @param ip_addr Pointer to receive the IP address. * @param port Pointer to receive the port number. * * @return PJ_SUCCESS, or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_tpmgr_find_local_addr( pjsip_tpmgr *tpmgr, pj_pool_t *pool, pjsip_transport_type_e type, const pjsip_tpselector *sel, pj_str_t *ip_addr, int *port); /** * Parameter for pjsip_tpmgr_find_local_addr2() function. */ typedef struct pjsip_tpmgr_fla2_param { /** * Specify transport type to use. This must be set. */ pjsip_transport_type_e tp_type; /** * Optional pointer to preferred transport, if any. */ const pjsip_tpselector *tp_sel; /** * Destination host, if known. The destination host is needed * if \a local_if field below is set. */ pj_str_t dst_host; /** * Specify if the function should return which local interface * to use for the specified destination in \a dst_host. By definition, * the returned address will always be local interface address. */ pj_bool_t local_if; /** * The returned address. */ pj_str_t ret_addr; /** * The returned port. */ pj_uint16_t ret_port; /** * Returned pointer to the transport. Only set if local_if is set. */ const void *ret_tp; } pjsip_tpmgr_fla2_param; /** * Initialize with default values. * * @param prm The parameter to be initialized. */ PJ_DECL(void) pjsip_tpmgr_fla2_param_default(pjsip_tpmgr_fla2_param *prm); /** * Find out the appropriate local address info (IP address and port) to * advertise in Contact or Via header header based on the remote address * to be contacted. The local address info would be the address name of the * transport or listener which will be used to send the request. * * @see pjsip_tpmgr_find_local_addr() * * @param tpmgr The transport manager. * @param pool Pool to allocate memory for the IP address. * @param prm Function input and output parameters. * * @return PJ_SUCCESS, or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_tpmgr_find_local_addr2(pjsip_tpmgr *tpmgr, pj_pool_t *pool, pjsip_tpmgr_fla2_param *prm); /** * Return number of transports currently registered to the transport * manager. * * @param mgr The transport manager. * * @return Number of transports. */ PJ_DECL(unsigned) pjsip_tpmgr_get_transport_count(pjsip_tpmgr *mgr); /** * Destroy a transport manager. Normally application doesn't need to call * this function directly, since a transport manager will be created and * destroyed automatically by the SIP endpoint. * * @param mgr The transport manager. * * @return PJ_SUCCESS on success. */ PJ_DECL(pj_status_t) pjsip_tpmgr_destroy(pjsip_tpmgr *mgr); /** * Dump transport info and status to log. * * @param mgr The transport manager. */ PJ_DECL(void) pjsip_tpmgr_dump_transports(pjsip_tpmgr *mgr); /** * Parameter for pjsip_tpmgr_shutdown_all() function. */ typedef struct pjsip_tpmgr_shutdown_param { /** * Specify whether disconnection state notification should be sent * immediately, see pjsip_transport_shutdown2() for more info. * * Default: PJ_TRUE. */ pj_bool_t force; /** * Specify whether UDP transports should also be shutdown. * * Default: PJ_TRUE. */ pj_bool_t include_udp; } pjsip_tpmgr_shutdown_param; /** * Initialize transports shutdown parameter with default values. * * @param prm The parameter to be initialized. */ PJ_DECL(void) pjsip_tpmgr_shutdown_param_default( pjsip_tpmgr_shutdown_param *prm); /** * Shutdown all transports. This basically invokes pjsip_transport_shutdown2() * on all transports. * * @param mgr The transport manager. * @param param The function parameters. * * @return PJ_SUCCESS on success. */ PJ_DECL(pj_status_t) pjsip_tpmgr_shutdown_all( pjsip_tpmgr *mgr, const pjsip_tpmgr_shutdown_param *param); /***************************************************************************** * * PUBLIC API * *****************************************************************************/ /** * Find transport to be used to send message to remote destination. If no * suitable transport is found, a new one will be created. * * This is an internal function since normally application doesn't have access * to transport manager. Application should use pjsip_endpt_acquire_transport() * instead. * * @param mgr The transport manager instance. * @param type The type of transport to be acquired. * @param remote The remote address to send message to. * @param addr_len Length of the remote address. * @param sel Optional pointer to transport selector instance which is * used to find explicit transport, if required. * @param tp Pointer to receive the transport instance, if one is found. * * @return PJ_SUCCESS on success, or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_tpmgr_acquire_transport(pjsip_tpmgr *mgr, pjsip_transport_type_e type, const pj_sockaddr_t *remote, int addr_len, const pjsip_tpselector *sel, pjsip_transport **tp); /** * Find suitable transport for sending SIP message to specified remote * destination by also considering the outgoing SIP message. If no suitable * transport is found, a new one will be created. * * This is an internal function since normally application doesn't have access * to transport manager. Application should use pjsip_endpt_acquire_transport2() * instead. * * @param mgr The transport manager instance. * @param type The type of transport to be acquired. * @param remote The remote address to send message to. * @param addr_len Length of the remote address. * @param sel Optional pointer to transport selector instance which is * used to find explicit transport, if required. * @param tdata Optional pointer to data to be sent. * @param tp Pointer to receive the transport instance, if one is found. * * @return PJ_SUCCESS on success, or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_tpmgr_acquire_transport2(pjsip_tpmgr *mgr, pjsip_transport_type_e type, const pj_sockaddr_t *remote, int addr_len, const pjsip_tpselector *sel, pjsip_tx_data *tdata, pjsip_transport **tp); /** * Type of callback to receive notification when message or raw data * has been sent. * * @param token The token that was given when calling the function * to send message or raw data. * @param tdata The transmit buffer used to send the message. * @param bytes_sent Number of bytes sent. On success, the value will be * positive number indicating the number of bytes sent. * On failure, the value will be a negative number of * the error code (i.e. bytes_sent = -status). */ typedef void (*pjsip_tp_send_callback)(void *token, pjsip_tx_data *tdata, pj_ssize_t bytes_sent); /** * This is a low-level function to send a SIP message using the specified * transport to the specified destination. * * @param tr The SIP transport to be used. * @param tdata Transmit data buffer containing SIP message. * @param addr Destination address. * @param addr_len Length of destination address. * @param token Arbitrary token to be returned back to callback. * @param cb Optional callback to be called to notify caller about * the completion status of the pending send operation. * * @return If the message has been sent successfully, this function * will return PJ_SUCCESS and the callback will not be * called. If message cannot be sent immediately, this * function will return PJ_EPENDING, and application will * be notified later about the completion via the callback. * Any statuses other than PJ_SUCCESS or PJ_EPENDING * indicates immediate failure, and in this case the * callback will not be called. */ PJ_DECL(pj_status_t) pjsip_transport_send( pjsip_transport *tr, pjsip_tx_data *tdata, const pj_sockaddr_t *addr, int addr_len, void *token, pjsip_tp_send_callback cb); /** * This is a low-level function to send raw data to a destination. * * See also #pjsip_endpt_send_raw() and #pjsip_endpt_send_raw_to_uri(). * * @param mgr Transport manager. * @param tp_type Transport type. * @param sel Optional pointer to transport selector instance if * application wants to use a specific transport instance * rather then letting transport manager finds the suitable * transport. * @param tdata Optional transmit data buffer to be used. If this value * is NULL, this function will create one internally. If * tdata is specified, this function will decrement the * reference counter upon completion. * @param raw_data The data to be sent. * @param data_len The length of the data. * @param addr Destination address. * @param addr_len Length of destination address. * @param token Arbitrary token to be returned back to callback. * @param cb Optional callback to be called to notify caller about * the completion status of the pending send operation. * * @return If the message has been sent successfully, this function * will return PJ_SUCCESS and the callback will not be * called. If message cannot be sent immediately, this * function will return PJ_EPENDING, and application will * be notified later about the completion via the callback. * Any statuses other than PJ_SUCCESS or PJ_EPENDING * indicates immediate failure, and in this case the * callback will not be called. */ PJ_DECL(pj_status_t) pjsip_tpmgr_send_raw(pjsip_tpmgr *mgr, pjsip_transport_type_e tp_type, const pjsip_tpselector *sel, pjsip_tx_data *tdata, const void *raw_data, pj_size_t data_len, const pj_sockaddr_t *addr, int addr_len, void *token, pjsip_tp_send_callback cb); /** * Enumeration of transport state types. */ typedef enum pjsip_transport_state { PJSIP_TP_STATE_CONNECTED, /**< Transport connected, applicable only to connection-oriented transports such as TCP and TLS. */ PJSIP_TP_STATE_DISCONNECTED, /**< Transport disconnected, applicable only to connection-oriented transports such as TCP and TLS. */ PJSIP_TP_STATE_SHUTDOWN, /**< Transport shutdown, either due to TCP/TLS disconnect error from the network, or when shutdown is initiated by PJSIP itself. */ PJSIP_TP_STATE_DESTROY, /**< Transport destroy, when transport is about to be destroyed. */ } pjsip_transport_state; /** * Definition of transport state listener key. */ typedef void pjsip_tp_state_listener_key; /** * Structure of transport state info passed by #pjsip_tp_state_callback. */ typedef struct pjsip_transport_state_info { /** * The last error code related to the transport state. */ pj_status_t status; /** * Optional extended info, the content is specific for each transport type. */ void *ext_info; /** * Optional user data. In global transport state notification, this will * always be NULL. */ void *user_data; } pjsip_transport_state_info; /** * Type of callback to receive transport state notifications, such as * transport connected/disconnected. Application may shutdown the transport * in this callback. * * @param tp The transport instance. * @param state The transport state. * @param info The transport state info. */ typedef void (*pjsip_tp_state_callback)( pjsip_transport *tp, pjsip_transport_state state, const pjsip_transport_state_info *info); /** * Set callback of global transport state notification. The caller will be * notified whenever the state of any transport is changed. The type of events * are defined in #pjsip_transport_state. * * Note that this function will override the existing callback, if any, so * application is recommended to keep the old callback and manually forward * the notification to the old callback, otherwise other component that * concerns about the transport state will no longer receive transport state * events. * * @param mgr Transport manager. * @param cb Callback to be called to notify caller about transport * state changing. * * @return PJ_SUCCESS on success, or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_tpmgr_set_state_cb(pjsip_tpmgr *mgr, pjsip_tp_state_callback cb); /** * Get the callback of global transport state notification. * * @param mgr Transport manager. * * @return The transport state callback or NULL if it is not set. */ PJ_DECL(pjsip_tp_state_callback) pjsip_tpmgr_get_state_cb( const pjsip_tpmgr *mgr); /** * Add a listener to the specified transport for transport state notification. * * @param tp The transport. * @param cb Callback to be called to notify listener about transport * state changing. * @param user_data The user data. * @param key Output key, used to remove this listener. * * @return PJ_SUCCESS on success, or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_transport_add_state_listener ( pjsip_transport *tp, pjsip_tp_state_callback cb, void *user_data, pjsip_tp_state_listener_key **key); /** * Remove a listener from the specified transport for transport state * notification. * * @param tp The transport. * @param key The listener key. * @param user_data The user data, for validation purpose. * * @return PJ_SUCCESS on success, or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_transport_remove_state_listener ( pjsip_transport *tp, pjsip_tp_state_listener_key *key, const void *user_data); /** * Structure of dropped received data. */ typedef struct pjsip_tp_dropped_data { /** * The transport receiving the data. */ pjsip_transport *tp; /** * The data. */ void *data; /** * The data length. * If the status field below indicates an invalid SIP message * (PJSIP_EINVALIDMSG) and application detects a SIP message * at position p, it can pass the data back to PJSIP to be processed * by setting the len to p. This can be useful for apps which * wishes to use the same transport for SIP signalling and non-SIP * purposes (such as SIP outbound using STUN message). */ pj_size_t len; /** * The status or reason of drop. For example, a leading newlines (common * keep-alive packet) will be dropped with status PJ_EIGNORED, an invalid * SIP message will have status PJSIP_EINVALIDMSG, a SIP message overflow * will have status PJSIP_ERXOVERFLOW. */ pj_status_t status; } pjsip_tp_dropped_data; /** * Type of callback to data dropping notifications. * * @param data The dropped data. */ typedef void (*pjsip_tp_on_rx_dropped_cb)(pjsip_tp_dropped_data *data); /** * Set callback of data dropping. The caller will be notified whenever any * received data is dropped (due to leading newlines or keep-alive packet or * invalid SIP message). This callback can be useful for application, * for example, to implement custom keep-alive mechanism or connection * availability detection. * * @param mgr Transport manager. * @param cb The callback function, set to NULL to reset the callback. * * @return PJ_SUCCESS on success, or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_tpmgr_set_drop_data_cb(pjsip_tpmgr *mgr, pjsip_tp_on_rx_dropped_cb cb); /** * Structure of received data that will be passed to data received * notification callback. */ typedef struct pjsip_tp_rx_data { /** * The transport receiving the data. */ pjsip_transport *tp; /** * The data. */ void *data; /** * The data length. * If application wishes to discard some data of len p, it can pass * the remaining data back to PJSIP to be processed by setting the len * to (len - p). * If application wants to shutdown the transport from within the * callback (for example after if finds out that the data is * suspicious/garbage), app must set the len to zero to prevent * further processing of the data. */ pj_size_t len; } pjsip_tp_rx_data; /** * Type of callback to data received notifications. * * @param data The received data. */ typedef pj_status_t (*pjsip_tp_on_rx_data_cb)(pjsip_tp_rx_data *data); /** * Set callback to be called whenever any data is received by a stream * oriented transport. This can be useful for application to do its own * verification, filtering, or logging of potential malicious activities. * * @param mgr Transport manager. * @param cb The callback function, set to NULL to reset the callback. * * @return PJ_SUCCESS on success, or the appropriate error code. */ PJ_DECL(pj_status_t) pjsip_tpmgr_set_recv_data_cb(pjsip_tpmgr *mgr, pjsip_tp_on_rx_data_cb cb); /** * @} */ PJ_END_DECL #endif /* __PJSIP_SIP_TRANSPORT_H__ */ ```

The Cuatro Ciénegas killifish (Lucania interioris; also known locally as the ) is an endangered species of fish in the family Cyprinodontidae. It is endemic to Cuatro Ciénegas in Mexico, where it exists in severely fragmented habitats within the valley. References External links Information on the species at Zipcodezoo interioris Endemic fish of Mexico Freshwater fish of Mexico Cuatrociénegas Municipality Natural history of Coahuila Endangered fish Critically endangered biota of Mexico Critically endangered fauna of North America Fish described in 1965 Taxonomy articles created by Polbot

Hri (, ; ) is a Buddhist term translated as "self-respect" or "conscientiousness". It is defined as the attitude of taking earnest care with regard to one's actions and refraining from non-virtuous actions. It is one of the virtuous mental factors within the Abhidharma teachings. The Abhidharma-samuccaya states: "What is hri? It is to avoid what is objectionable as far as I see it and its function is to provide a basis for refraining from non-virtuous actions." Pali Canon There are two suttas in the Pali Canon that bear the title "Hiri Sutta." Both of these texts focus on the issue of moral shame. The first sutta (SN 1.18) is a short dialogue between the Buddha and a deity on the nature of conscience. The second sutta (Sn 2.3) is a question and answer dialogue between the Buddha and an ascetic regarding the nature of true friendship. Mahayana The Abhidharmakośabhāsya lists hrī among the ten virtuous mental factors (daśa kuśalamahābhῡmikā dharma; 大善地法). The Yogācāra tradition recognizes it as one of the eleven wholesome mental factors (ekādaśa-kuśala; 十一善). The former text states that the difference between hrī and apatrāpya is that the former is dominated by one's own understanding of morality. The latter by contrast, is empowered by one's sense of embarrassment. In the commentaries The Pali Paṭṭhāna lists hiri among the twenty-five obhana cetasikas or "beautiful mental factors." Hiri often function in conjunction with apatrāpya (Pali: ottappa), or moral dread. These two are responsible for encouraging a person to avoid performing evil actions. Together they are known as lokapāla or "guardians of the world". The Puggalapaññatti states: "To be ashamed of what one ought to be ashamed of, to be ashamed of performing evil and unwholesome things: this is called moral shame (hiri). To be in dread of what one ought to be in dread of, to be in dread of performing evil and unwholesome things: this is called moral dread (ottappa)." The goddess Hirī or Hiridevī is the name of a goddess and one of Śakra's daughters. Her name is sometimes translated as "Honour". She appears in several texts, including the Sudhābhojana Jātaka and the Mañjarī Jātaka of the Mahāvastu. It is also the name of a yaksha that may be invoked in the Āṭānāṭiya Sutta. Alternative Translations self-respect - Herbert Guenther, Dzigar Kongtrul Rinpoche, Rangjung Yeshe Wiki conscientiousness - Erik Pema Kunsang moral self-dignity - Alexander Berzin sense of shame - Rangjung Yeshe Wiki dignity See also Notes References Guenther, Herbert V. & Leslie S. Kawamura (1975), Mind in Buddhist Psychology: A Translation of Ye-shes rgyal-mtshan's "The Necklace of Clear Understanding". Dharma Publishing. Kindle Edition. Kunsang, Erik Pema (translator) (2004). Gateway to Knowledge, Vol. 1. North Atlantic Books. External links Ranjung Yeshe wiki entry for ngo tsha shes pa Berzin Archives glossary entry for "hri" Wholesome factors in Buddhism Virtue Sanskrit words and phrases

Fernando Gomes may refer to: Fernando Gomes (football administrator) (born 1952), President of the Portuguese Football Federation Fernando Gomes (sport shooter) (born 1954), Brazilian sports shooter Fernando Gomes (Portuguese footballer) (1956–2022), Portuguese footballer Fernando Gomes (Brazilian footballer) (born 1988), Brazilian footballer Fernando Gomes (Bissau-Guinean footballer) (born 2002), Bissau-Guinean footballer Fernando Gomes (politician) (fl. 2012), Guinea-Bissau's Interior Minister See also Fernando Gómez (disambiguation)

On 4 April 2009, an abduction and torture of two young boys by two young brothers in Edlington, South Yorkshire, England. An 11-year-old boy was found with critical head injuries at a ravine in a rural area of Edlington, while his nine-year-old nephew was found wandering nearby covered in blood. On Tuesday, 7 April, two brothers, aged 10 and 11, who had been arrested on Sunday, 5 April, were each initially charged with the attempted murder and robbery of both of the injured boys. They appeared at Sheffield Crown Court, where a hearing revealed the extent of their actions. They had led the two boys to an isolated wasteland where one was forced to strip naked and perform a sex act. A metal ring was used to strangle the other. The brothers collected stones and bricks which were thrown at the boys' heads. When alerted by the sound of passers-by, the suspects covered the two boys with a sheet, which they then set afire, inflicting burns on the victims. One brother had filmed part of the attack on his mobile phone, which was used as evidence in court. The two suspects pleaded guilty to causing grievous bodily harm with intent, to robbing one of the boys of a mobile phone and the other of cash, to two counts of intentionally causing a child to engage in sexual activity, and to one additional charge of actual bodily harm relating to a previous incident involving another 11-year-old boy. A child protection expert, Eileen Vizard, who had been involved in the James Bulger case, told the sentencing judge that the younger brother was a "very high risk" to the community and was at risk of becoming "a seriously disturbed psychopathic offender" unless he was properly treated. The brothers were given indeterminate sentences on 23 January 2010. The judge in the case, Mr Justice Keith, ordered that under Section 39 of the Children and Young Persons Act 1933 their identities should not be disclosed. A request to appeal against the sentence was refused by the Criminal Division of the Court of Appeal on 5 May 2010. In December 2016, the perpetrators were granted legal lifelong anonymity on the grounds that they would be "at serious risk of attack" if their identities became known. In August 2017, shortly after release, the younger of the brothers was returned to prison indefinitely after breaching the terms of his parole; he was found in possession of a machete. References 2009 crimes in the United Kingdom Crime in South Yorkshire Robberies in England Torture in England 2009 in England 2010s in South Yorkshire April 2009 crimes Violence against men in the United Kingdom

```smalltalk using System.Reflection; namespace UnityEditor.ShaderGraph { [Title("Math", "Trigonometry", "Arcsine")] public class ArcsineNode : CodeFunctionNode { public ArcsineNode() { name = "Arcsine"; } public override string documentationURL { get { return "path_to_url"; } } protected override MethodInfo GetFunctionToConvert() { return GetType().GetMethod("Unity_Arcsine", BindingFlags.Static | BindingFlags.NonPublic); } static string Unity_Arcsine( [Slot(0, Binding.None)] DynamicDimensionVector In, [Slot(1, Binding.None)] out DynamicDimensionVector Out) { return @" { Out = asin(In); } "; } } } ```

Chinatown is a heritage-listed settlement at Herberton Road, Atherton, Tablelands Region, Queensland, Australia. It was built from 1880s to 1920s. It is also known as Cedar Camp. It was added to the Queensland Heritage Register on 21 October 1992. History This open area surrounding the Atherton Chinese Temple was the site of a Chinese settlement which was established in the mid 1880s. It grew to service Chinese tenant farmers in the Atherton area and peaked in importance in the early 1900s when there were over a hundred buildings on site. Its decline began after the first world war when Chinese-held agricultural leases were revoked in favour of returned servicemen and most Chinese left the area. By the late 1940s, virtually all buildings had been removed. Atherton Chinatown was one of many Chinese settlements that sprang up in Australia during the nineteenth century. The Chinese began to arrive in large numbers following the first gold rushes of the 1850s. Most of them came from provinces in the south east of China where conditions were harsh. Almost all were male and many were poor, having borrowed the money for their fares from Chinese guilds. They hoped to make enough money to pay off their debt, to send money home to their families and to eventually return themselves with enough capital to secure their futures. For mutual support and to maintain contacts with their homeland, they lived and worked together, creating Chinatowns within, or on the fringes of, European settlements. The discovery of gold on the Palmer River in 1873 led to an influx of miners to far north Queensland. Many of these were Chinese and by 1877 there were 17,000 Chinese on the Palmer River fields, vastly outnumbering the other diggers. Europeans felt threatened by their numbers, by their willingness to work for low recompense and because the Chinese maintained their own culture. Restrictions were placed on Chinese immigration and they were denied access to new mineral fields. Because of this, and as alluvial gold began to peter out on the Palmer field, the Chinese moved away and looked for other ways to earn money. Tin was discovered on the Wild River in 1880 which gave impetus to the development of the Atherton Tablelands. This is an area of volcanic plateaux, set in the Great Dividing Range, which has a mild climate and fertile soil. It was originally heavily forested and a group of Chinese, working with European timbergetters, moved into the Atherton area in the early 1880s. They established a settlement called Cedar Camp across Piebald Creek from the Europeans and a short distance from the tiny settlement of Prior's Pocket. In August 1885, this area was surveyed, renamed Atherton and land sales began. Queensland legislation prevented Chinese land ownership, but many of them entered into leasing arrangements with Europeans. The newly cleared land could not be ploughed, but was well suited to the hand cultivation methods favoured by the Chinese, who became successful farmers. They supplied the developing town of Herberton with fruit and vegetables and pioneering the growing of maize, which became an important commercial crop for the area. The rents which they paid the land owners also provided a valuable source of income during the difficult economic period of the 1890s. Atherton's Chinatown is on a lease originally granted to Frederick Loder in 1887 and which was transferred freehold to Edward Jasper Loder in 1890. By 1897, there were over 180 Chinese living on the site which developed as a short main street lined with small timber and iron shops and houses. At the height of its development, around 1909, commercial premises located here included corn merchants, food and general goods stores, a herbalist, two gambling dens and a place of entertainment which employed musicians. There was also a Tong society meeting hall and a temple. At the time, this was the social and commercial centre for over a thousand Chinese people who were living in the Atherton district. In 1911, the overthrow of the Manchu dynasty and the declaration of a republic in China caused divisions in the Chinatown society. The authority of the Tong, which acted as an administrative body, was undermined, gambling crept in and there were violent incidents. Some Chinese moved away at this point. There was also increasing local pressure to have the land reserved for European use as the mild climate was thought to be particularly suitable and the land was now ready for ploughing or for dairying. Following the First World War, leases farmed by Chinese were made over to soldier settlers and most of the Chinese moved south or to nearby coastal towns. During the 1920s many buildings were demolished or moved for reuse elsewhere. A handful of old men remained in the settlement until the late 1940s and the temple continued in intermittent use until the mid 1970s. The land on which Chinatown stood was purchased by a group of local Chinese families and was eventually purchased outright by the Fong On family, who had originally lived in the town. The National Trust of Queensland obtained a grant to carry out research on the site in 1975 and the temple was offered to them by the Fong On family in the following year to ensure its preservation. This donation was finalised in 1980. In 1991 John Fong On subdivided Lot 2 on RP740536 gifting the remained of Lot 2 to the National Trust of Queensland and seeling the newly created Lot 3 RP912545 to the Atherton Shire Council. This part of the site contains no buildings. Since the subdivision reports suggest that Lot 3 may contain archaeologically interesting material. In the years since then the temple complex has been researched and conserved as a place museum. A number of research projects have also been carried out on the town site by the Material Culture Unit of the James Cook University. These included research and documentation of the settlement and temple by Latif Ibrahim in 1981, a 1986 project to map remaining surface relics and the original street, and excavations undertaken in 1991 and 1992. Although some damage has been done to the site by the casual digging of collectors in the late 1970s and early 1980s, it is believed that some areas remain undisturbed. Description The site is approximately in area and is located on the gently sloping area to the south of Piebald Creek and to the east of the Herberton Road. The site comprises Lot 2 on RP897109 facing Herberton Atherton Road to the west and extending southward to form the northern and eastern boundaries of the Atherton Chinese Temple site. Lot 3 RP912545 faces Herberton Street and is site on the southern boundary of the temple site. The location of the site appears to have been selected with the aid of geomancy as evidenced by its relationship to natural features such as the Herberton Range and the creek. It is located on dark grey clay soils and the northern, low-lying portion is subject to inundation during wet seasons. Vegetation cover is mainly guinea grass, lantana and clumps of Japanese sunflowers. There are some eucalypts, tea-trees and grevillea and the area is dotted with mango trees introduced by the Chinese. The ground close to the temple is regularly cut to keep the grass low. Dense vegetative cover occurs over much of the site and may help to protect the extensive scatter of artefacts above ground. Evidence of occupation includes wells, buildings sites and possibly plantings. Interpretative signs which mark key sites and illustrate aspects of life in Chinatown were erected by the National Trust in 1996. Heritage listing Chinatown was listed on the Queensland Heritage Register on 21 October 1992 having satisfied the following criteria. The place is important in demonstrating the evolution or pattern of Queensland's history. Chinatown, Atherton is important in demonstrating the evolution of Queensland history in that the Chinese were pioneers of agriculture in north Queensland and as such played an important role in the opening up of the Atherton area for settlement. The place demonstrates rare, uncommon or endangered aspects of Queensland's cultural heritage. It is a major Chinese settlement site in tropical Queensland and has never been built over. Such a concentrated site of Chinese occupation is rare in Australia making Chinatown an important archaeological site. The place has potential to yield information that will contribute to an understanding of Queensland's history. It has potential to yield information that will contribute to an understanding of Queensland's history by demonstrating the formation of, and life within, a large Chinese settlement in Australia. References Attribution Further reading External links Atherton, Chinatown & Hou Wang Temple Queensland Heritage Register Atherton, Queensland Articles incorporating text from the Queensland Heritage Register Atherton Chinese-Australian history Tourist attractions in Far North Queensland

```ruby # frozen_string_literal: true require_relative "../base" require_relative "../events/event" module Fusuma module Plugin module Detectors # Inherite this base class Detector < Base def initialize(*args) super @tag = self.class.tag @type = self.class.type end attr_reader :tag attr_reader :type # @return [Array<String>] def sources @sources ||= self.class.const_get(:SOURCES) end # Always watch buffers and detect them or not # @return [TrueClass,FalseClass] def watch? false end # @param _buffers [Array<Buffer>] # @return [Event] if event is detected # @return [NilClass] if event is NOT detected def detect(_buffers) raise NotImplementedError, "override #{self.class.name}##{__method__}" # create_event(record:) end # @param record [Events::Records::Record] # @return [Events::Event] def create_event(record:) @last_time = Time.now Events::Event.new(time: @last_time, tag: tag, record: record) end def last_time @last_time ||= Time.now end def first_time? @last_time.nil? end class << self def tag name.split("Detectors::").last.underscore end def type(tag_name = tag) tag_name.gsub("_detector", "") end end end end end end ```

```html <html> <head> <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> <title>windows::overlapped_handle::assign (1 of 2 overloads)</title> <link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> <meta name="generator" content="DocBook XSL Stylesheets V1.79.1"> <link rel="home" href="../../../../boost_asio.html" title="Boost.Asio"> <link rel="up" href="../assign.html" title="windows::overlapped_handle::assign"> <link rel="prev" href="../assign.html" title="windows::overlapped_handle::assign"> <link rel="next" href="overload2.html" title="windows::overlapped_handle::assign (2 of 2 overloads)"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> <td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> <td align="center"><a href="../../../../../../index.html">Home</a></td> <td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> <td align="center"><a href="path_to_url">People</a></td> <td align="center"><a href="path_to_url">FAQ</a></td> <td align="center"><a href="../../../../../../more/index.htm">More</a></td> </tr></table> <hr> <div class="spirit-nav"> <a accesskey="p" href="../assign.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../assign.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../boost_asio.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overload2.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> <div class="section"> <div class="titlepage"><div><div><h5 class="title"> <a name="boost_asio.reference.windows__overlapped_handle.assign.overload1"></a><a class="link" href="overload1.html" title="windows::overlapped_handle::assign (1 of 2 overloads)">windows::overlapped_handle::assign (1 of 2 overloads)</a> </h5></div></div></div> <p> Assign an existing native handle to the handle. </p> <pre class="programlisting">void assign( const native_handle_type & handle); </pre> </div> <table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr> <td align="left"></td> file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url </p> </div></td> </tr></table> <hr> <div class="spirit-nav"> <a accesskey="p" href="../assign.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../assign.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../boost_asio.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overload2.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> </body> </html> ```

5th Reserve Division() was formed in August 1955 in Chengdu Military Region. On February 15, 1956, the division moved to Nanchong, Sichuan. As of its activation the division was composed of: 13th Reserve Regiment; 14th Reserve Regiment; 15th Reserve Regiment; Artillery Regiment; Anti-Aircraft Artillery Regiment; Sergeant Training Regiment. The division was fully manned and equipped. During its short-lived existence the division was focused on the training of officers and sergeants. In March 1958 the division was demobilized, moving to Heilongjiang for agricultural missions. References R05 Military units and formations disestablished in 1958 Military units and formations established in 1955 Reserve divisions of the People's Liberation Army

Bentsion Fleishman (Флейшман, Бенцион Шимонович, born 21 November 1923) is a Russian scientist in the field of mathematical statistics, combinatorial analysis and their applications, doctor of physical and mathematical sciences, professor, author of constructive information theory and the theory of potential efficiency. Fleishman was born in Moscow. In 1947 he graduated from the Moscow State University, the Department of Probability Theory, headed by A. N. Kolmogorov and was sent to work in the cryptographic service of the Ministry of State Security of the USSR. After his discharge in 1954, he worked at the institutes of the USSR Academy of Sciences: the Institute of Radio Engineering and Electronics (1955–1968) and the Institute of Oceanology (1968–1996). Potential efficiency theory is a synthesis of reliability theory, information theory and game theory, the successor of cybernetics, aiming at biological and engineering systems on general conceptual and mathematical basis. Its main concept – efficiency – is defined as the probability to achieve the goal with limited resources. Other fundamental concepts are purposeful choice and probabilistic feasibility of engineering systems. The theory was first formulated in his book Elements of the Theory of Potential Efficiency of Complex Systems (1971). Fleishman wrote more than a hundred scientific articles and five books. From 1966 to 1996, he was the head of the cybernetics and environmental problems section of the Scientific and Technical Society of Radio Engineering, Electronics and Communications. After moving to the US in 1996, he worked on applications of potential efficiency theory and became a member of the International Society for Risk Analysis. Bibliography A. E. Basharinov, B. S. Fleishman, Methods of statistical sequential analysis and their applications, Moscow: Sov. Radio, 1962; B. S. Fleishman, Constructive methods of optimal coding for noisy channels, Moscow: Publishing House of the Academy of Sciences of the USSR, 1963; B. S. Fleishman, Elements of the theory of potential efficiency of complex systems, Moscow: Sov. Radio, 1971 (2nd edition, Smolensk: Oikumene, 2008); B. S. Fleishman, Fundamentals of Systemology, Radio and Communications, Moscow, 1982 (2nd ed. New York: Lulu.com, 2007); B. Fleishman. Stochastic theory of ecological interactions. Ecological Modeling, vol. 17, 1982, p. 65-73; B. Fleishman. Hyperbolic law of reliability and its logarithmic effects in ecology. Ecological Modeling, vol. 55, 1991, p. 75-88; B. Fleishman, Stochastic Theory of Complex Ecological Systems (cap.6). In: B. Patten, S. Jorgenson (eds) Complex Ecology. Prentice Hall PTP, Prentice Hall Inc, A. Simon & Schuster, Englewood Cliffs, New Jersey, 07632, 1995, p. 166-224; B. Fleishman, The Choice is Yours, Moscow: Oikumena, 2000 (2nd ed. , New York: Lulu.com, 2008). External links Bentsion Fleishman | Official site 1923 births Possibly living people Russian mathematicians Moscow State University alumni USSR Academy of Sciences

```php <?php /* * This file is part of the Symfony package. * * (c) Fabien Potencier <fabien@symfony.com> * * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. */ namespace Symfony\Component\Console\Formatter; use Symfony\Component\Console\Exception\InvalidArgumentException; use Symfony\Contracts\Service\ResetInterface; /** * @author Jean-Franois Simon <contact@jfsimon.fr> */ class OutputFormatterStyleStack implements ResetInterface { /** * @var OutputFormatterStyleInterface[] */ private $styles; private $emptyStyle; public function __construct(?OutputFormatterStyleInterface $emptyStyle = null) { $this->emptyStyle = $emptyStyle ?? new OutputFormatterStyle(); $this->reset(); } /** * Resets stack (ie. empty internal arrays). */ public function reset() { $this->styles = []; } /** * Pushes a style in the stack. */ public function push(OutputFormatterStyleInterface $style) { $this->styles[] = $style; } /** * Pops a style from the stack. * * @return OutputFormatterStyleInterface * * @throws InvalidArgumentException When style tags incorrectly nested */ public function pop(?OutputFormatterStyleInterface $style = null) { if (empty($this->styles)) { return $this->emptyStyle; } if (null === $style) { return array_pop($this->styles); } foreach (array_reverse($this->styles, true) as $index => $stackedStyle) { if ($style->apply('') === $stackedStyle->apply('')) { $this->styles = \array_slice($this->styles, 0, $index); return $stackedStyle; } } throw new InvalidArgumentException('Incorrectly nested style tag found.'); } /** * Computes current style with stacks top codes. * * @return OutputFormatterStyle */ public function getCurrent() { if (empty($this->styles)) { return $this->emptyStyle; } return $this->styles[\count($this->styles) - 1]; } /** * @return $this */ public function setEmptyStyle(OutputFormatterStyleInterface $emptyStyle) { $this->emptyStyle = $emptyStyle; return $this; } /** * @return OutputFormatterStyleInterface */ public function getEmptyStyle() { return $this->emptyStyle; } } ```

Robert M. Grissom Parkway, locally known as Grissom Parkway, is a major four-lane connector highway in Myrtle Beach, South Carolina. The road begins at Harrelson Boulevard near Myrtle Beach International Airport and terminates in Carolina Forest, South Carolina at SC Highway 31 and International Drive. It provides access to Myrtle Beach attractions such as Coastal Grand Mall, TicketReturn.com Field and Broadway at the Beach and is used as an alternative road to U.S. 17 and Kings Highway in Myrtle Beach. It has bike paths and sidewalks for pedestrian traffic. These are part of the East Coast Greenway, a 3,000 mile long system of trails connecting Maine to Florida. Route description When the road was completed, it replaced Old Socastee Highway (former routing of South Carolina Highway 707) between Pine Island Road and U.S. 501 as well as Central Parkway at Broadway at the Beach between 21st Avenue North and 29th Avenue North. History Robert Grissom Parkway is based on a road planned as early as 1979. In 1996, sections of Central Parkway, a road planned by Burroughs & Chapin, were already complete between 21st Avenue North and 38th Avenue North, and between 44th Avenue North and 48th Avenue North. Taken over as of 1996 by the city, the road could be extended to U.S. 501 in five or six years using property taxes and admissions taxes at Broadway at the Beach attractions, plus a possible hospitality tax on hotel rooms, meals and admissions. Eventually, Central Parkway would be extended south to a planned airport road (later named Harrelson Boulevard) and north to 62nd Avenue North. In 1998, a $2.66 million section of Central Parkway, four lanes with a median between 10th Avenue North and 21st Avenue North, was under construction as a RIDE project. In five years, the road was expected to run from Harrelson Boulevard across U.S. 501 and U.S. 17 Bypass to 62nd Avenue North, which would connect to Carolina Bays Parkway. By February 1999, plans called for Central Parkway to connect directly to Carolina Bays Parkway rather than to an extended 62nd Avenue North. Robert "Bob" Grissom served as Myrtle Beach mayor 12 years, longer than any other mayor, and on the city council for 13 years. He led the effort to return minor league baseball to the city, but Coastal Federal Field (now BB&T Coastal Field) was not named for him. With the section of Central Parkway leading to the stadium opening in April 1999, the city made the decision to honor the late mayor by naming it Robert M. Grissom Parkway. The name change took effect immediately between 10th Avenue North and 29th Avenue North, with other sections to be renamed in stages. Additional work on Grissom Parkway began in March 2001, with three sections of the $30 million RIDE project to be finished over the next year. Included in the project was the widening of an existing section of Old Socastee Highway. The concrete plant owned by Grissom fell victim to the road named for him. On April 5, 2002, the section between Harrelson Boulevard and U.S. 501 opened. On May 6, the section between U.S. 501 and Mr. Joe White Avenue (formerly 10th Avenue North) opened. This was followed on July 1 by the section between 38th and 48th Avenues North. North of 48th Avenue, work had begun on the connection to Carolina Bays Parkway. With the opening of Carolina Bays Parkway on December 17, 2002, Grissom Parkway was complete all the way from that new road to the airport, with "tree-lined medians, trees planted on the shoulders of the road, bike paths and pedestrian sidewalks." In July 2003, a $2.6 million upgrade to the Carolina Bays Parkway interchange began, providing additional access to Carolina Forest. An unpaved road called International Drive connected to S.C. 90, but provided no access to other main roads. A year later, the road still had not been paved, but by 2009 there was a plan to do so, though as of 2016 the project was still delayed. Grissom Parkway had become very popular with tourists, people living in the area, and businesses looking for a good location. However, the city did not intend the road to provide easy access to business, and policies assured this would continue to be the case. International Drive officially opened July 25, 2018. Since 2006, the intersection with 21st Avenue N. has been the start line for the annual Bi-Lo Marathon, and since 2011 the section from US 17 Bypass to BB&T Coastal Field (with the exception of two short turnaround points) has been used for the final five miles. Major intersections References External links Roads in Myrtle Beach, South Carolina

Märt Kubo (born 11 April 1944 in Tarvastu Parish, Viljandi County) is an Estonian theatre pedagogue, critic and politician. In 1992, he was Minister of Culture. He was a member of VIII Riigikogu. Kubo studied clarinet at the Viljandi Music School, graduating in 1960, and then graduated from Viljandi Secondary School No. 2 in 1962. In 1970, he graduated from Tartu State University with a degree in history and was a postgraduate student and lecturer at the university between 1970 and 1980. He was the director of the Noosoo Theatre between 1990 and 1992. In 1992 he was the Minister of Culture of the Transitional Government. From 1993 until 1995, he was the editor of Teater. Muusika. Kino magazine. From 2000 until 2001, he was the chairman of the Estonian Coalition Party and compiled the book Eesti Koonderakond 1991–2001 in 2001. Kubo has published articles on theatrr and film, compiled the books Rahvusooper Estonia 1998–2003 in 2003 and Rahvusooper Estonia 2003–2008 in 2008, which detailed the history of the Estonian National Opera. Kubo is the chairman of the administrative board of the National Opera Foundation operating at the Estonian National Culture Foundation. References 1944 births Living people Estonian Coalition Party politicians Members of the Riigikogu, 1995–1999 Ministers of Culture of Estonia Estonian theatre directors Estonian theatre critics Estonian male writers 20th-century Estonian writers 21st-century Estonian writers Estonian non-fiction writers University of Tartu alumni Academic staff of the University of Tartu People from Viljandi Parish Male non-fiction writers

The Giles Ministry was the ministry of the tenth Chief Minister of the Northern Territory, Adam Giles. It came into operation on 14 March 2013, following the replacement of Terry Mills as Chief Minister and leader of the Country Liberal Party by Adam Giles. It ended on 31 August 2016, when Labor leader Michael Gunner became Chief Minister following his victory at the 2016 election. First ministry (14 March 2013 – 19 March 2013) Second ministry (20 March 2013 – 8 August 2013) Third ministry (9 August 2013 – 9 September 2013) Fourth ministry (10 September 2013 – 15 September 2013) On 9 September 2013, Chief Minister Giles announced that he would be "refreshing" his cabinet. Alison Anderson was removed from the ministry and her portfolios assigned to others. Bess Price joined the ministry. The new ministry was sworn in by the Administrator of the Northern Territory the next day. Fifth ministry (16 September 2013 – 23 August 2014) Sixth ministry (24 August 2014 – 11 December 2014) Seventh ministry (12 December 2014 – 19 January 2015) Eighth ministry (20 January 2015 – 3 February 2015) Ninth ministry (4 February 2015 – 10 February 2015) On 2 February 2015, cabinet member Willem Westra van Holthe challenged Chief Minister Adam Giles for the leadership of the Country Liberal Party, and announced that the party had voted him as leader and chief minister apparent. The next day, Giles refused to resign as chief minister and after a meeting of the parliamentary wing of the CLP, emerged to announce that he was still the leader and that Westra van Holthe would be his deputy. On 4 February, Robyn Lambley was expelled from Cabinet for supporting the challenge. Tenth ministry (11 February 2015 – 14 February 2016) A further reshuffle was held following the resignation of Matt Conlan from Cabinet on 10 February. Eleventh ministry (15 February 2016 – 18 July 2016) Twelfth ministry (19 July 2016 – 25 July 2016) Thirteenth ministry (26 July 2016 – 27 August 2016) John Elferink was sacked as Minister for Correctional Services on 26 July 2016, with Adam Giles assuming the portfolio. References External links The Chief Minister and the Cabinet Giles 1

This is a list of casinos in Nevada. List of casinos See also List of casinos in the United States List of casino hotels Las Vegas Strip List of Las Vegas casinos that never opened Notes Sources External links Nevada Casinos

The BLH RS-12 railroad locomotive was a diesel-electric road-switcher configured with an AAR type B-B wheel arrangement. It was the follow-on model to the former Baldwin DRS-4-4-1000, first introduced in 1948. It was more successful than its predecessor selling 50 units to eight railroads, versus 22 units to three railroads. Only one railroad, The Pennsylvania Railroad bought both models. When Baldwin Locomotive Works merged with Lima-Hamilton Corporation, forming the Baldwin-Lima-Hamilton Corporation and decided to concentrate locomotive production at Baldwin's Eddystone, Pennsylvania plant. There was still one outstanding order for Lima A-3174s but the customer, New York Central Railroad agreed to receive RS-12s instead. The locomotive could be ordered with either a steam generator for steam heat, or dynamic brakes contained within the short hood. McCloud River Railroad No. 32 and 33 were the only two ordered with dynamic brakes of the fifty units built. One RS-12 is preserved in operational condition in the "Skunk Train" livery of California Western 56 (Locomotive) at Travel Town Museum in Griffith Park; another #300 is owned by and occasionally used on the Escanaba and Lake Superior Railroad, with others owned by the same railroad held in non-operational condition. Escanaba and Lake Superior 207 was leased to the Nicolet Badger Northern Railroad for a short time in the 1990s and was later returned to the Escanaba and Lake Superior where it now remains in storage in Wells, Michigan. Escanaba and Lake Superior 209 was used for ballast and general freight until the late 1980s when it was put in storage. Escanaba and Lake Superior 212 started to be rebuilt in the 1980s but the rebuilt was never completed. It remains in storage along with other E&LS Baldwins at Wells, Michigan. Original buyers References RS-12 B-B locomotives Railway locomotives introduced in 1951 Diesel-electric locomotives of the United States Standard gauge locomotives of the United States

Philipp Pittoni Freiherr von Dannenfeld (died 6 October 1824), fought in the army of Habsburg Austria during the French Revolutionary Wars. Promoted to general officer in 1795, he was a brigade commander in northwestern Italy at the time when Napoleon Bonaparte was appointed to lead the opposing French Army of Italy. He led one of the two main columns at Voltri in April 1796. At Borghetto in May, he unsuccessfully defended the bridge. He led a brigade at Castiglione in August and at Second Bassano and Arcole in November 1796. He retired from service the following year and died at Gorizia in 1824. Montenotte Campaign Neither Pittoni's place and date of birth are known nor are his early military dates of advancement. On 1 May 1795 he was promoted to the rank of General-major. In early 1796, Johann Peter Beaulieu was the newly appointed commander of the combined armies of Habsburg Austria and the Kingdom of Sardinia-Piedmont. Beaulieu's left wing consisted of 19,500 troops. Half of these were on garrison duty, while the rest were led by Pittoni and Josef Philipp Vukassovich. The 11,500-man Austrian right wing was posted to cover Acqui Terme and was commanded by Eugène-Guillaume Argenteau. The 20,000 Piedmontese troops were led by Michelangelo Alessandro Colli-Marchi and included an Austrian contingent under Giovanni Marchese di Provera. Colli's men were strung out in a chain from Cosseria Castle in the east to Cuneo in the west. Further west, the 20,000 Piedmontese under the Prince of Corrigan were faced by François Christophe de Kellermann's Army of the Alps. According to one authority, on 1 April 1796, Pittoni's 7-battalion brigade was stationed near Alessandria and belonged to Karl Philipp Sebottendorf's wing of Beaulieu's Austrian army. Another authority asserted that he led a division-sized command that included three battalions of the Reisky Infantry Regiment Nr. 13, two battalions of the Nádasdy Infantry Regiment Nr. 39, one battalion of the Terzi Infantry Regiment Nr. 16, one battalion of the Lattermann Infantry Regiment Nr. 45, and one battalion of the Szluiner Grenz Infantry Regiment Nr. 63. Because the neutral Republic of Genoa had refused to loan the French money, the representative-on-mission Antoine Christophe Saliceti asked the French army commander Barthélemy Louis Joseph Scherer for 6,000 men to advance in order to intimidate the civic authorities. On 27 March, Pittoni reported to Beaulieu about the movement of these troops to Voltri. Bonaparte, who had just taken command, ordered the movement halted the next day. At first he wanted to withdraw the exposed unit, but later decided to hold the position at Voltri. To counter this threat, on 31 March, Beaulieu ordered Pittoni in invade the Republic of Genoa and cross the Bocchetta Pass. Pittoni occupied Novi Ligure with 2,800 men and started his men on the road up the pass. The Lattermann Regiment was left to guard Novi. Beaulieu apparently was on hand because he noted that the weather was uncomfortably cold and that Pittoni was not well, though he did his soldierly duty. The army commander sent one 12-pound cannon, one 6-pound cannon, and two 7-pound howitzers to join Pittoni's force. By 8 April, Pittoni was in position at the Bocchetta Pass but informed Beaulieu that he was so isolated that it would take him six hours of marching over bad roads to link with Vukassovich near Masone. On 10 April 1796, Pittoni's column advanced with four squadrons of the Mészáros Uhlans, two battalions of the Reisky Regiment, and one battalion each of the Terzi, Nádasdy, and Szluiner Regiments. Pittoni's force numbered 3,350 infantry and 624 cavalry. The troops got a remarkably late start. At 8:00 AM, 250 volunteers set out to cover the right flank by marching via the mountaintop Madonna della Guardia. The main column left Campomorone at 11:00 AM and marched down to the coast before turning right through Sestri di Ponente. Pittoni's Szluiner battalion and the volunteers attacked the French 75th Line Infantry Demi-Brigade near Pegli at 3:00 PM in the Battle of Voltri. After a three-hour fight, the 75th Line withdrew. That evening Pittoni occupied Voltri with three battalions and the cavalry. He was joined at midnight by Beaulieu, who came via Masone and the Turchino Pass with Sebottendorf and Vukassovich. The Austrians lost about 50 casualties while the French reported losing 16 dead, 45 wounded, and 148 captured. The remaining actions of the Montenotte Campaign went badly for the Austrians. They lost the Battle of Montenotte on 11 and 12 April and the Second Battle of Dego on 14 and 15 April. Soon after, the Piedmontese were defeated at the Battle of Mondovì on 22 April, their government sued for peace. Borghetto to Arcole Pittoni's brigade held a position near Gropello Cairoli in early May. He missed the Battle of Lodi on 10 May 1796 since he was marching with Beaulieu via the village of Acquanegra Cremonese toward Cremona. When the Austrians formed a defense line behind the Mincio River, Sebottendorf placed Pittoni's brigade and Prince di Cuto's Neapolitan cavalry near Valeggio sul Mincio. At 7:00 AM on the morning of 30 May 1796, the division of Charles Edward Jennings de Kilmaine attacked the Austrian cavalry outposts on the west side of the Mincio to open the Battle of Borghetto. By 9:00 AM the French reached the Borghetto bridge on the west side of Valeggio and put great pressure on the one battalion each from the Strassoldo Infantry Regiment Nr. 27 and Jordis Infantry Regiment Nr. 59. Pittoni arrived to direct the fighting, but no reserves arrived. By noon, the Austrians ran low on ammunition and withdrew to Valeggio. The French followed and pushed them out of the town as well. To face Kilmaine's 1,500 cavalry and six battalions of grenadiers, Pittoni only had half of the 920 men from the two battalion Strassoldo Regiment and 761 soldiers from the Jordis Regiment. When the new Austrian army commander Dagobert Sigmund von Wurmser advanced to the relief of the Siege of Mantua in late July, he formed his forces into four columns. See the Castiglione 1796 Campaign Order of Battle. The Right-Center Column was led by Michael von Melas and comprised the brigades of Peter Gummer, Adam Bajalics von Bajahaza, Franz Nicoletti, and Pittoni. The latter two reported to Sebottendorf. While Melas led Gummer and Bajalics over Monte Baldo by footpaths, Sebottendorf's two brigades fought their way down the road through Ferrara di Monte Baldo and Brentino Belluno. They accomplished their mission by driving back the French so that the Left-Center Column under Paul Davidovich could join them via the Adige River valley. The 900-man 11th Light Infantry Demi-Brigade and four guns were isolated and captured during the successful operation. Pittoni and Sebottendorf are not specifically mentioned in a detailed account of the Battle of Castiglione on 5 August 1796. In a preliminary action on 3 August, 1,000 Austrians became casualties and Pittoni's fellow brigadier Nicoletti was wounded. On the 5th, the Austrians were beaten with losses of 2,000 killed and wounded plus 1,000 men and 20 guns captured. The French counted 1,100 casualties. In 1796, József Alvinczi led the Austrian army in the third relief of Mantua. Peter Vitus von Quosdanovich's 28,699-man Friaul Corps was divided into six brigades under Pittoni, Anton Lipthay de Kisfalud, Anton Schübirz von Chobinin, Gerhard Rosselmini, Adolf Brabeck, and Prince Friedrich Franz Xaver of Hohenzollern-Hechingen. Another authority stated that Pittoni commanded the 4,376-man army Reserve with four battalions, one squadron. See the Arcola 1796 Campaign Order of Battle. The Friaul Corps was accompanied by Alvinczi in person. Provera took Lipthay and Brabeck on a southerly road toward Fontaniva while Hohenzollern and a newly arrived brigade under Anton Ferdinand Mittrowsky took a northerly road toward Bassano del Grappa. The Second Battle of Bassano was fought on 6 November 1796. Lipthay, supported by Brabeck and Schübirz, repelled French attacks near Fontaniva, while Hohenzollern and the "main part of the division" held their ground near the village of Nove on the west side of Bassano. The Austrian victory cost Provera's wing 208 killed, 873 wounded, and 109 captured. Quosdanovich's wing suffered 326 killed, 858 wounded, 449 men and two guns captured. This bloody contest cost the French 3,000 killed and wounded plus 508 men and one gun captured. Pittoni was not specifically noted during a thorough account of the Battle of Arcole on 15 to 17 November. Beginning on the second day, Alvinczi entrusted Mittrowsky with 14 battalions for the defense of Arcole, while Provera was given six battalions to hold Belfiore. At 4:00 PM on the third day, a powerful column of Hungarian grenadiers was committed to the combat at Arcole, which suggests that Pittoni's Reserve was being fed into the battle. Soon afterward, the grenadiers fell into an ambush and retreated. By 5:00 PM the French were masters of Arcole and Mittrowsky finally withdrew. The Austrians lost 600 killed (including Brabeck), 1,600 wounded, and 4,000 men and 11 guns captured in the 3-day fight. French losses numbered 1,200 killed and 2,300 wounded. Pittoni retired from the army on 28 February 1797. He died in Gorizia on 6 October 1824. Notes References Austrian soldiers Austrian generals Barons of Austria Italian soldiers Austrian Empire military leaders of the French Revolutionary Wars 1824 deaths Year of birth missing

Henrique Araújo de Oliveira, known as Araújo (born 7 August 1998) is a Brazilian football player. Club career He made his Ukrainian Premier League debut for Lviv on 28 October 2018 in a game against Dynamo Kyiv. References External links 1998 births Footballers from Bahia Living people Brazilian men's footballers Men's association football forwards FC Lviv players Ukrainian Premier League players Ukrainian First League players Brazilian expatriate men's footballers Expatriate men's footballers in Ukraine Brazilian expatriate sportspeople in Ukraine FC Lokomotíva Košice players 2. Liga (Slovakia) players Expatriate men's footballers in Slovakia Brazilian expatriate sportspeople in Slovakia FC Mynai players FC VPK-Ahro Shevchenkivka players

Vincenzo Biava (18 April 1916 – March 2004) was an Italian sport shooter who competed in the 50 metre rifle, three positions event at the 1960 Summer Olympics. References 1916 births 2004 deaths Italian male sport shooters ISSF rifle shooters Olympic shooters for Italy Shooters at the 1960 Summer Olympics

Roman Viktorovich Babichev (; born 18 August 1975) is a former Russian professional footballer. External links 1975 births Footballers from Volgograd Living people Russian men's footballers Men's association football midfielders FC Energiya Volzhsky players FC Olimpia Volgograd players FC Tekstilshchik Kamyshin players FC Smena Komsomolsk-na-Amure players Kazakhstan Premier League players Russian expatriate men's footballers Expatriate men's footballers in Kazakhstan Russian expatriate sportspeople in Kazakhstan

Kurchum (, ) is a district of East Kazakhstan Region in eastern Kazakhstan. The administrative center of the district is the selo of Kurshim. Population: References Districts of Kazakhstan East Kazakhstan Region

The 70th Academy Awards ceremony, organized by the Academy of Motion Picture Arts and Sciences (AMPAS), took place on March 23, 1998, at the Shrine Auditorium in Los Angeles beginning at 6:00 p.m. PST / 9:00 p.m. EST. During the show, AMPAS presented Academy Awards (commonly referred to as Oscars) in 24 categories honoring films released in 1997. The ceremony, which was televised in the United States by ABC, was produced by Gil Cates and directed by Louis J. Horvitz. Actor Billy Crystal hosted the show for the sixth time. He had first hosted the 62nd ceremony held in 1990, and most recently the previous year's awards. Nearly a month earlier in an event held at the Regent Beverly Wilshire Hotel in Beverly Hills, California on February 28, the Academy Awards for Technical Achievement were presented by host Ashley Judd. Titanic won eleven awards, including Best Picture, a number that is tied with Ben-Hur and The Lord of the Rings: The Return of the King. Other winners included As Good as It Gets, Good Will Hunting, and L.A. Confidential with two awards, and Character, The Full Monty, Geri's Game, The Long Way Home, Men in Black, A Story of Healing, and Visas and Virtue with one. The telecast garnered more than 57 million viewers in the United States, making it the most watched Oscars broadcast in history. Winners and nominees The nominees for the 70th Academy Awards were announced on February 10, 1998, at the Samuel Goldwyn Theater in Beverly Hills, California, by Robert Rehme, president of the academy, and actress Geena Davis. Titanic received the most nominations with a record-tying fourteen (1950's All About Eve, and later 2016's La La Land, also achieved this distinction); Good Will Hunting and L.A. Confidential came in second with nine apiece. The winners were announced during the awards ceremony on March 23, 1998. With eleven awards, Titanic tied with Ben-Hur for the most Academy Awards in Oscar history. It also became the first film to win Best Picture without a screenwriting nomination since 1965's The Sound of Music. Jack Nicholson became the fourth performer to win at least three acting Oscars. Both Nicholson and Helen Hunt won for their roles in As Good as It Gets, making it the seventh film to win both lead acting awards. Nominated for their performances as Rose DeWitt Bukater in Titanic, Best Actress nominee Kate Winslet and Best Supporting Actress nominee Gloria Stuart became the first pair of actresses nominated for portraying the same character in the same film. At age 87, Stuart also became the oldest performer nominated for a competitive Oscar. Awards Winners are listed first, highlighted in boldface, and indicated with a double dagger (). {| class=wikitable | valign="top" width="50%" | Titanic – James Cameron and Jon Landau, producers As Good as It Gets – James L. Brooks, Bridgit Johnson and Kristi Zea, producers The Full Monty – Uberto Pasolini, producer Good Will Hunting – Lawrence Bender, producer L.A. Confidential – Arnon Milchan, Curtis Hanson and Michael Nathanson, producers | valign="top" width="50%" | James Cameron – Titanic Peter Cattaneo – The Full Monty Gus Van Sant – Good Will Hunting Curtis Hanson – L.A. Confidential Atom Egoyan – The Sweet Hereafter |- | valign="top" | Jack Nicholson – As Good as It Gets as Melvin Udall Matt Damon – Good Will Hunting as Will Hunting Robert Duvall – The Apostle as Euliss "Sonny" Dewey, a.k.a. "The Apostle E.F." Peter Fonda – Ulee's Gold as Ulysses "Ulee" Jackson Dustin Hoffman – Wag the Dog as Stanley Motss | valign="top" | Helen Hunt – As Good as It Gets as Carol Connelly Helena Bonham Carter – The Wings of the Dove as Kate Croy Julie Christie – Afterglow as Phyllis Mann Judi Dench – Mrs Brown as Queen Victoria Kate Winslet – Titanic as Rose DeWitt Bukater |- | valign="top" | Robin Williams – Good Will Hunting as Dr. Sean Maguire Robert Forster – Jackie Brown as Max Cherry Anthony Hopkins – Amistad as John Quincy Adams Greg Kinnear – As Good as It Gets as Simon Bishop Burt Reynolds – Boogie Nights as Jack Horner | valign="top" | Kim Basinger – L.A. Confidential as Lynn Bracken Joan Cusack – In & Out as Emily Montgomery Minnie Driver – Good Will Hunting as Skylar Satenstein Julianne Moore – Boogie Nights as Amber Waves/Maggie Gloria Stuart – Titanic as Rose Dawson Calvert |- | valign="top" | Good Will Hunting – Matt Damon and Ben Affleck As Good as It Gets – Mark Andrus and James L. Brooks Boogie Nights – Paul Thomas Anderson Deconstructing Harry – Woody Allen The Full Monty – Simon Beaufoy | valign="top" | L.A. Confidential – Brian Helgeland and Curtis Hanson; from the novel by James Ellroy Donnie Brasco – Paul Attanasio; based on the book Donnie Brasco: My Undercover Life in the Mafia by Joseph D. Pistone with Richard Woodley The Sweet Hereafter – Atom Egoyan; adapted from the novel by Russell Banks Wag the Dog – David Mamet and Hilary Henkin; from the novel American Hero by Larry Beinhart The Wings of the Dove – Hossein Amini; adapted from the novel by Henry James |- | valign="top" | Karakter (Netherlands) in Dutch – Mike van Diem Beyond Silence (Germany) in German – Caroline Link Four Days in September (Brazil) in Portuguese – Bruno Barreto Secrets of the Heart (Spain) in Spanish – Montxo Armendáriz The Thief (Russia) in Russian – Pavel Chukhray | valign="top" | The Long Way Home – Rabbi Marvin Hier and Richard Trank 4 Little Girls – Spike Lee and Sam Pollard Ayn Rand: A Sense of Life – Michael Paxton Colors Straight Up – Michèle Ohayon and Julia Schachter Waco: The Rules of Engagement – Dan Gifford and William Gazecki |- | valign="top" | A Story of Healing – Donna Dewey and Carol Pasternak Alaska: Spirit of the Wild – George Casey and Paul Novros Amazon – Kieth Merrill and Jonathan Stern Family Video Diaries: Daughter of the Bride – Terri Randall Still Kicking: The Fabulous Palm Springs Follies – Mel Damski and Andrea Blaugrund | valign="top" | Visas and Virtue – Chris Tashima and Chris Donahue Dance Lexie Dance – Pearse Moore and Tim Loane It's Good to Talk – Roger Goldby and Barney Reisz Sweethearts? – Birger Larsen and Thomas Lydholm Wolfgang – Anders Thomas Jensen and Kim Magnusson |- | valign="top" | Geri's Game – Jan Pinkava Famous Fred – Joanna Quinn The Old Lady and the Pigeons – Sylvain Chomet Redux Riding Hood – Steve Moore and Dan O'Shannon Rusalka – Alexander Petrov | valign="top" | Titanic – James Horner Amistad – John Williams Good Will Hunting – Danny Elfman Kundun – Philip Glass L.A. Confidential – Jerry Goldsmith |- | valign="top" | The Full Monty – Anne Dudley Anastasia – Music by Stephen Flaherty; lyrics by Lynn Ahrens; orchestral score by David Newman As Good as It Gets – Hans Zimmer Men in Black – Danny Elfman My Best Friend's Wedding – James Newton Howard | valign="top" | "My Heart Will Go On" from Titanic – Music by James Horner; lyrics by Will Jennings "Go the Distance" from Hercules – Music by Alan Menken; lyrics by David Zippel "Journey to the Past" from Anastasia – Music by Stephen Flaherty; lyrics by Lynn Ahrens "How Do I Live" from Con Air – Music and lyrics by Diane Warren "Miss Misery" from Good Will Hunting – Music and lyrics by Elliott Smith |- | valign="top" | Titanic – Tom Bellfort and Christopher Boyes Face/Off – Mark Stoeckinger and Per Hallberg The Fifth Element – Mark Mangini | valign="top" | Titanic – Gary Rydstrom, Tom Johnson, Gary Summers and Mark Ulano Air Force One – Paul Massey, Rick Kline, Doug Hemphill and Keith A. Wester Con Air – Kevin O'Connell, Greg P. Russell and Art Rochester Contact – Randy Thom, Tom Johnson, Dennis S. Sands and William B. Kaplan L.A. Confidential – Andy Nelson, Anna Behlmer and Kirk Francis |- | valign="top" | Titanic – Art Direction: Peter Lamont; Set Decoration: Michael D. Ford Gattaca – Art Direction: Jan Roelfs; Set Decoration: Nancy Nye Kundun – Art Direction: Dante Ferretti; Set Decoration: Francesca Lo Schiavo L.A. Confidential – Art Direction: Jeannine Oppewall; Set Decoration: Jay Hart Men in Black – Art Direction: Bo Welch; Set Decoration: Cheryl Carasik | valign="top" | Titanic – Russell Carpenter Amistad – Janusz Kamiński Kundun – Roger Deakins L.A. Confidential – Dante Spinotti The Wings of the Dove – Eduardo Serra |- | valign="top" | Men in Black – Rick Baker and David LeRoy Anderson Mrs Brown – Lisa Westcott, Veronica Brebner and Beverley Binda Titanic – Tina Earnshaw, Greg Cannom and Simon Thompson | valign="top" | Titanic – Deborah Lynn Scott Amistad – Ruth E. Carter Kundun – Dante Ferretti Oscar and Lucinda – Janet Patterson The Wings of the Dove – Sandy Powell |- | valign="top" | Titanic – Conrad Buff, James Cameron and Richard A. Harris Air Force One – Richard Francis-Bruce As Good as It Gets – Richard Marks Good Will Hunting – Pietro Scalia L.A. Confidential – Peter Honess | valign="top" | Titanic'' – Robert Legato, Mark Lasoff, Thomas L. Fisher and Michael Kanfer The Lost World: Jurassic Park – Dennis Muren, Stan Winston, Randal M. Dutra and Michael Lantieri Starship Troopers – Phil Tippett, Scott E. Anderson, Alec Gillis and John Richardson |} Academy Honorary Award Stanley Donen Films with multiple nominations and awards The following 16 films received multiple nominations: The following four films received multiple awards: Presenters and performers The following individuals presented awards or performed musical numbers. Presenters Performers Ceremony information In December 1997, the academy hired veteran Oscar telecast producer Gil Cates to oversee the 1998 ceremony. "Gil has become the consummate Oscar show producer, consistently garnering top television ratings for the telecast," said AMPAS President Robert Rehme in a press release announcing the selection. "His shows are full of wit, charm and surprise." A few days later, actor and comedian Billy Crystal was chosen to emcee the upcoming telecast. Cates explained his reason to bring back the veteran comedian saying, "Billy's performance last year was spectacular. There is nobody like him." In an article published in USA Today he initially requested to Cates and AMPAS five months after the previous year's ceremony that he would like to take a break from hosting duties. However, pressure from the academy, Cates, and several friends and family members made him reconsider his decision. His sixth stint would make him second only to Bob Hope in number of ceremonies hosted. To commemorate the seventieth anniversary of the Academy Awards, 70 actors who have received both competitive and honorary awards appeared seated onstage together during a segment called Oscar's Family Album. Each former winner was acknowledged by announcer Norman Rose with the films he or she won for. At the end of the segment newly minted winners Kim Bassinger, Helen Hunt, and Robin Williams joined them. This marked the largest gathering of former winners since the 50th ceremony held in 1978. Several others participated in the production of the ceremony. Bill Conti served as musical director for the telecast. Dancer Daniel Ezralow choreographed a dance number showcasing the nominees for Best Original Comedy or Musical Score. Bart the Bear made a surprise appearance during the presentation of the Best Sound Effects Editing award with Mike Myers. Box office performance of nominees At the time of the nominations announcement on February 10, the combined gross of the five Best Picture nominees was $579 million with an average of $116 million per film. Titanic was the highest earner among the Best Picture nominees with $338.7 million in domestic box office receipts. The film was followed by As Good as It Gets ($92.6 million), Good Will Hunting ($68.9 million), L.A. Confidential ($39.7 million), and finally The Full Monty ($38.7 million). Of the top 50 grossing movies of the year, 40 nominations went to 15 films on the list. Only Titanic (1st), As Good as It Gets (16th), Good Will Hunting (20th), and In & Out (24th) were nominated for directing, acting, screenwriting, or Best Picture. The other top 50 box office hits that earned nominations were Men in Black (2nd), The Lost World: Jurassic Park (3rd), Air Force One (5th), My Best Friends Wedding (7th), Face/Off (9th), Con Air (12th), Contact (13th), Hercules (14th), The Fifth Element (25th), Anastasia (30th), and Starship Troopers (34th). Critical response The show received a positive reception from most media publications. Television critic Howard Rosenberg of the Los Angeles Times lauded Crystal's performance writing that he "would earn top billing as that unusual comedian as artful at doing musical comedy as jokes." San Francisco Chronicle columnist John Carman raved,"It was the best Oscar show in two decades." He also gave high marks for the host, commenting, "But last night, Crystal was back in razor form." The Seattle Times television editor Kay McFadden praised Crystal commenting that "he possesses nearly impeccable timing and judgment." In addition, she noted that while the ceremony dragged on, "Last night was one of television's smartest live ceremonies in recent memory." Some media outlets were more critical of the show. Ray Richmond of Variety complained that the ceremony proved to be a "Yawner of an Oscarcast." He added that Crystal's "off-the-cuff one-liners sank faster than the great ship herself." Boston Globe television critic Matthew Gilbert bemoaned,"There was hardly a spontaneous moment during last night's Oscarcast." Film critic Carrie Rickey from The Philadelphia Inquirer lamented that the inevitable Titanic sweep "sank a telecast loaded with montages of previous years' Oscar highlights." Ratings and reception The popularity of Titanic greatly increased television ratings for the ceremony. The American telecast on ABC drew in an average of 57.25 million people over its length, which was a 29% increase from the previous year's ceremony. An estimated 87.50 million total viewers watched all or part of the awards. The show also earned higher Nielsen ratings compared to the previous ceremony with 35.32% of households watching over a 55.77 share. In addition, it garnered a higher 1849 demo rating with a 24.90 rating over a 44.30 share among viewers in that demographic. It overtook the network's own telecast of the 1983 Academy Awards to become, as it remains to date, the highest viewership for both an Academy Award telecast (since figures were compiled beginning with the 46th ceremony in 1974) and any live awards show airing in U.S. television history. In July 1998, the ceremony presentation received eight nominations at the 50th Primetime Emmys. Two months later, the ceremony won five of those nominations for Outstanding Individual Performance in a Variety or Music Program (Billy Crystal), Outstanding Directing for a Variety or Music Program (Louis J Horvitz), Outstanding Lighting Direction (Electronic) for a Drama Series, Variety Series, Miniseries, or Movie (Bob Barnhart, Robert Dickinson, Matt Ford, Andy O'Reilly), Outstanding Music Direction (Bill Conti), and Outstanding Sound Mixing for a Variety Series or Special (Patrick Baltzell, Robert Douglass, Edward J. Greene, Tommy Vicari). In Memoriam The annual In Memoriam tribute was presented by actress Whoopi Goldberg. The montage featured an excerpt of "Appassionata" from The Passage'' composed by Michael J. Lewis. Lloyd Bridges - Actor Richard Jaeckel - Character actor Saul Chaplin – Composer/Musical Director Stanley Cortez – Cinematographer William Hickey - Actor Paul Jarrico – Screenwriter Dorothy Kingsley – Screenwriter Sydney Guilaroff – Hairstylist William H. Reynolds – Editor Billie Dove - Actress Jacques Cousteau – Filmmaker Stubby Kaye - Actor, comedian Red Skelton - Comedy entertainer Dawn Steel – Executive Toshiro Mifune - Japanese actor Brian Keith - Actor Chris Farley - Actor, comedian Leo Jaffe – Executive Samuel Fuller – Director Burgess Meredith - Actor J. T. Walsh - Character actor Robert Mitchum - Actor James Stewart - Actor See also 4th Screen Actors Guild Awards 18th Golden Raspberry Awards 40th Grammy Awards 51st British Academy Film Awards 52nd Tony Awards 55th Golden Globe Awards List of submissions to the 70th Academy Awards for Best Foreign Language Film References Bibliography External links Official websites Academy Awards Official website The Academy of Motion Picture Arts and Sciences Official website Oscar's Channel at YouTube (run by the Academy of Motion Picture Arts and Sciences) Analysis 1997 Academy Awards Winners and History Filmsite Academy Awards, USA: 1998 Internet Movie Database Other resources 1997 film awards 1998 in American cinema Academy Awards ceremonies 1998 in Los Angeles March 1998 events in the United States Academy Television shows directed by Louis J. Horvitz

Surendra Prasad Singh was a Nepalese judge who served as 9th Chief Justice of Nepal, in office from 26 September 1995 to 14 February 1997. He was appointed by the then-king of Nepal, Birendra. Singh was preceded by Bishwonath Upadhyaya and succeeded by Trilok Pratap Rana. References Chief justices of Nepal

```makefile ################################################################################ # # sg3_utils # ################################################################################ SG3_UTILS_VERSION = 1.40 SG3_UTILS_SOURCE = sg3_utils-$(SG3_UTILS_VERSION).tar.xz SG3_UTILS_SITE = path_to_url SG3_UTILS_LICENSE = BSD-3c # utils progs are GPLv2+ licenced ifeq ($(BR2_PACKAGE_SG3_UTILS_PROGS),y) SG3_UTILS_LICENSE += GPLv2+ endif SG3_UTILS_LICENSE_FILES = COPYING BSD_LICENSE # install the libsgutils2 library SG3_UTILS_INSTALL_STAGING = YES ifeq ($(BR2_PACKAGE_SG3_UTILS_PROGS),) define SG3_UTILS_REMOVE_PROGS for prog in \ compare_and_write copy_results dd decode_sense \ emc_trespass format get_config \ get_lba_status ident inq logs luns map26 \ map sgm_dd modes opcodes sgp_dd persist prevent \ raw rbuf rdac read readcap read_block_limits \ read_buffer read_long reassign referrals \ rep_zones requests reset reset_wp rmsn rtpg safte sanitize \ sat_identify sat_phy_event sat_read_gplog sat_set_features \ scan senddiag ses ses_microcode start stpg sync test_rwbuf \ turs unmap verify vpd write_buffer write_long \ write_same write_verify wr_mode xcopy; do \ $(RM) $(TARGET_DIR)/usr/bin/sg_$${prog} ; \ done for prog in \ logging_level mandat readcap ready satl start stop \ temperature; do \ $(RM) $(TARGET_DIR)/usr/bin/scsi_$${prog} ; \ done for prog in \ sginfo sgm_dd sgp_dd; do \ $(RM) $(TARGET_DIR)/usr/bin/$${prog}; \ done endef SG3_UTILS_POST_INSTALL_TARGET_HOOKS += SG3_UTILS_REMOVE_PROGS endif $(eval $(autotools-package)) ```

Ness Point, also known as Lowestoft Ness, is the most easterly point of England, Great Britain, the United Kingdom and the British Isles. It is located in Lowestoft in the East Suffolk district of the county of Suffolk. The site is located to the east of the town centre, overlooking the North Sea, and has a direction marker, known as the Euroscope, marking locations in other countries and their distance from Ness Point. Located at Ness Point is the previous record holder for Britain's tallest wind turbine, nicknamed "Gulliver". It stands tall, generating electricity for the National Grid. See also Corrachadh Mòr, westernmost point of the British mainland. Lizard Point, southernmost point of the British mainland. Dunnet Head, northernmost point of the British Mainland. Marshall Meadows Bay, northernmost point of England. Ness, Lewis, northernmost point of the Outer Hebrides References External links Ness Point - Official Website Lowestoft

Maharaja is a 2011 Tamil-language film written and directed by Manoharan and produced by J. Ravi. The film stars Nassar, Sathya and Anjali. The music was composed by D. Imman with cinematography done by V. Lakshmapathy and editing by P. Sai Suresh. Synopsis Mahadevan is a middle-aged government employee who leads a very normal family life with his wife, son, and father. He lives a budget life, rides an old scooter, wears out-of-fashion clothes, and bears a sullen expression on his face for all the reasons above. He is unhappy with his present life, which is monotonous, and feels that he should live a modernized life which he has missed in his earlier life. In this day and age, with westernization overpowering everything else, he is constantly reminded of a flame that died out long ago, and it questions the purpose of his existence. Meanwhile, Aravind, who comes from America, has a modern lifestyle. He works in a software company in Chennai. Mahadevan happens to meet Aravind and learns that he is his nephew. Both of them become very close. Aravind helps Mahadevan enjoy the modern life, which causes Mahadevan's family to suffer greatly with his activities. However, Aravind turns a new lease of life when he falls for Priya. He changes his poor characters for his love. Aravind comes to understand the real life and feels that he would only spoil his uncle's life. How he helps his uncle through this midlife crisis forms the rest of the story. Cast Nassar as Mahadevan Sathya as Aravind Anjali as Priya Saranya as Seetha Anita Hassanandani Karunas as Maadasamy aka OneTen Kovai Sarala as Bujji M. S. Viswanathan as Aravind's grandfather Vennira Aadai Moorthy Ajay Rathnam M. S. Narayana as Subbu Bayilwan Ranganathan as Traffic police officer Production and release The film was launched in March 2009 with Nassar being roped in by the debutant director Manoharan to star in the lead role, with the veteran actor allotting 35 days to shoot for the film, four times as lengthy as he would offer for other roles. Sathya, Anjali and Anita Hassanandani were roped in to essay other leading roles in the film while Karunas and Saranya were selected to play supporting roles. The film was briefly delayed before remaining portions were completed in Malaysia in a 40-day schedule by December 2010. The film was planned as a Tamil-Telugu bilingual film although the Telugu version never released. The film remained unreleased for a year, before hitting screens on 30 December 2011. Critical reception Rohit Ramachandran of Nowrunning.com rated it 2.5/5 stating that "Mahaaraja, a comic take on midlife crisis is refreshingly funny and Nassar keeps the laughs coming by providing justice to a well-written character.". Soundtrack The film score and soundtrack for Maharaja was composed by D. Imman. The album consists of six tracks, featuring lyrics penned by Na. Muthukumar, P. Vijay, Snehan, Dr. Kiruthiya, Yugabharathi, and Viveka. References 2011 films 2010s Tamil-language films

```c++ /* * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. */ #include "Purity.h" #include <algorithm> #include <iterator> #include <sstream> #include <vector> #include <sparta/WeakTopologicalOrdering.h> #include "ConfigFiles.h" #include "ControlFlow.h" #include "DexClass.h" #include "EditableCfgAdapter.h" #include "IRInstruction.h" #include "Resolver.h" #include "Show.h" #include "StlUtil.h" #include "Timer.h" #include "Trace.h" #include "Walkers.h" #include "WorkQueue.h" namespace { constexpr double kWtoOrderingThreshold = 50.0; } // namespace std::ostream& operator<<(std::ostream& o, const CseLocation& l) { switch (l.special_location) { case CseSpecialLocations::GENERAL_MEMORY_BARRIER: o << "*"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_INT: o << "(int[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_BYTE: o << "(byte[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_CHAR: o << "(char[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_WIDE: o << "(long|double[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_SHORT: o << "(short[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_OBJECT: o << "(Object[])[.]"; break; case CseSpecialLocations::ARRAY_COMPONENT_TYPE_BOOLEAN: o << "(boolean[])[.]"; break; default: o << SHOW(l.field); break; } return o; } std::ostream& operator<<(std::ostream& o, const CseUnorderedLocationSet& ls) { o << "{"; bool first = true; for (const auto& l : ls) { if (first) { first = false; } else { o << ", "; } o << l; } o << "}"; return o; } CseLocation get_field_location(IROpcode opcode, const DexField* field) { always_assert(opcode::is_an_ifield_op(opcode) || opcode::is_an_sfield_op(opcode)); if (field != nullptr && !is_volatile(field)) { return CseLocation(field); } return CseLocation(CseSpecialLocations::GENERAL_MEMORY_BARRIER); } CseLocation get_field_location(IROpcode opcode, const DexFieldRef* field_ref) { always_assert(opcode::is_an_ifield_op(opcode) || opcode::is_an_sfield_op(opcode)); DexField* field = resolve_field(field_ref, opcode::is_an_sfield_op(opcode) ? FieldSearch::Static : FieldSearch::Instance); return get_field_location(opcode, field); } CseLocation get_read_array_location(IROpcode opcode) { switch (opcode) { case OPCODE_AGET: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_INT); case OPCODE_AGET_BYTE: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_BYTE); case OPCODE_AGET_CHAR: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_CHAR); case OPCODE_AGET_WIDE: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_WIDE); case OPCODE_AGET_SHORT: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_SHORT); case OPCODE_AGET_OBJECT: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_OBJECT); case OPCODE_AGET_BOOLEAN: return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_BOOLEAN); default: not_reached(); } } CseLocation get_read_location(const IRInstruction* insn) { if (opcode::is_an_aget(insn->opcode())) { return get_read_array_location(insn->opcode()); } else if (opcode::is_an_iget(insn->opcode()) || opcode::is_an_sget(insn->opcode())) { return get_field_location(insn->opcode(), insn->get_field()); } else { return CseLocation(CseSpecialLocations::GENERAL_MEMORY_BARRIER); } } static const std::string_view pure_method_names[] = { "Ljava/lang/Boolean;.booleanValue:()Z", "Ljava/lang/Boolean;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Boolean;.getBoolean:(Ljava/lang/String;)Z", "Ljava/lang/Boolean;.hashCode:()I", "Ljava/lang/Boolean;.toString:()Ljava/lang/String;", "Ljava/lang/Boolean;.toString:(Z)Ljava/lang/String;", "Ljava/lang/Boolean;.valueOf:(Z)Ljava/lang/Boolean;", "Ljava/lang/Boolean;.valueOf:(Ljava/lang/String;)Ljava/lang/Boolean;", "Ljava/lang/Byte;.byteValue:()B", "Ljava/lang/Byte;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Byte;.toString:()Ljava/lang/String;", "Ljava/lang/Byte;.toString:(B)Ljava/lang/String;", "Ljava/lang/Byte;.valueOf:(B)Ljava/lang/Byte;", "Ljava/lang/Character;.valueOf:(C)Ljava/lang/Character;", "Ljava/lang/Character;.charValue:()C", "Ljava/lang/Class;.getName:()Ljava/lang/String;", "Ljava/lang/Class;.getSimpleName:()Ljava/lang/String;", "Ljava/lang/Double;.compare:(DD)I", "Ljava/lang/Double;.doubleValue:()D", "Ljava/lang/Double;.doubleToLongBits:(D)J", "Ljava/lang/Double;.doubleToRawLongBits:(D)J", "Ljava/lang/Double;.floatValue:()F", "Ljava/lang/Double;.hashCode:()I", "Ljava/lang/Double;.intValue:()I", "Ljava/lang/Double;.isInfinite:(D)Z", "Ljava/lang/Double;.isNaN:(D)Z", "Ljava/lang/Double;.longBitsToDouble:(J)D", "Ljava/lang/Double;.longValue:()J", "Ljava/lang/Double;.toString:(D)Ljava/lang/String;", "Ljava/lang/Double;.valueOf:(D)Ljava/lang/Double;", "Ljava/lang/Enum;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Enum;.name:()Ljava/lang/String;", "Ljava/lang/Enum;.ordinal:()I", "Ljava/lang/Enum;.toString:()Ljava/lang/String;", "Ljava/lang/Float;.doubleValue:()D", "Ljava/lang/Float;.floatToRawIntBits:(F)I", "Ljava/lang/Float;.floatValue:()F", "Ljava/lang/Float;.compare:(FF)I", "Ljava/lang/Float;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Float;.hashCode:()I", "Ljava/lang/Float;.intBitsToFloat:(I)F", "Ljava/lang/Float;.intValue:()I", "Ljava/lang/Float;.floatToIntBits:(F)I", "Ljava/lang/Float;.isInfinite:(F)Z", "Ljava/lang/Float;.isNaN:(F)Z", "Ljava/lang/Float;.valueOf:(F)Ljava/lang/Float;", "Ljava/lang/Float;.toString:(F)Ljava/lang/String;", "Ljava/lang/Integer;.bitCount:(I)I", "Ljava/lang/Integer;.byteValue:()B", "Ljava/lang/Integer;.compareTo:(Ljava/lang/Integer;)I", "Ljava/lang/Integer;.doubleValue:()D", "Ljava/lang/Integer;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Integer;.hashCode:()I", "Ljava/lang/Integer;.highestOneBit:(I)I", "Ljava/lang/Integer;.intValue:()I", "Ljava/lang/Integer;.longValue:()J", "Ljava/lang/Integer;.lowestOneBit:(I)I", "Ljava/lang/Integer;.numberOfLeadingZeros:(I)I", "Ljava/lang/Integer;.numberOfTrailingZeros:(I)I", "Ljava/lang/Integer;.shortValue:()S", "Ljava/lang/Integer;.signum:(I)I", "Ljava/lang/Integer;.toBinaryString:(I)Ljava/lang/String;", "Ljava/lang/Integer;.toHexString:(I)Ljava/lang/String;", "Ljava/lang/Integer;.toString:()Ljava/lang/String;", "Ljava/lang/Integer;.toString:(I)Ljava/lang/String;", "Ljava/lang/Integer;.toString:(II)Ljava/lang/String;", "Ljava/lang/Integer;.valueOf:(I)Ljava/lang/Integer;", "Ljava/lang/Long;.bitCount:(J)I", "Ljava/lang/Long;.compareTo:(Ljava/lang/Long;)I", "Ljava/lang/Long;.doubleValue:()D", "Ljava/lang/Long;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Long;.hashCode:()I", "Ljava/lang/Long;.intValue:()I", "Ljava/lang/Long;.highestOneBit:(J)J", "Ljava/lang/Long;.longValue:()J", "Ljava/lang/Long;.numberOfTrailingZeros:(J)I", "Ljava/lang/Long;.signum:(J)I", "Ljava/lang/Long;.toBinaryString:(J)Ljava/lang/String;", "Ljava/lang/Long;.toHexString:(J)Ljava/lang/String;", "Ljava/lang/Long;.toString:()Ljava/lang/String;", "Ljava/lang/Long;.toString:(J)Ljava/lang/String;", "Ljava/lang/Long;.valueOf:(J)Ljava/lang/Long;", "Ljava/lang/Math;.IEEEremainder:(DD)D", "Ljava/lang/Math;.abs:(J)J", "Ljava/lang/Math;.abs:(I)I", "Ljava/lang/Math;.abs:(F)F", "Ljava/lang/Math;.abs:(D)D", "Ljava/lang/Math;.acos:(D)D", "Ljava/lang/Math;.asin:(D)D", "Ljava/lang/Math;.atan:(D)D", "Ljava/lang/Math;.atan2:(DD)D", "Ljava/lang/Math;.cbrt:(D)D", "Ljava/lang/Math;.ceil:(D)D", "Ljava/lang/Math;.copySign:(FF)F", "Ljava/lang/Math;.copySign:(DD)D", "Ljava/lang/Math;.cos:(D)D", "Ljava/lang/Math;.cosh:(D)D", "Ljava/lang/Math;.exp:(D)D", "Ljava/lang/Math;.expm1:(D)D", "Ljava/lang/Math;.floor:(D)D", "Ljava/lang/Math;.floorDiv:(II)I", "Ljava/lang/Math;.floorDiv:(JJ)J", "Ljava/lang/Math;.floorMod:(JJ)J", "Ljava/lang/Math;.floorMod:(II)I", "Ljava/lang/Math;.getExponent:(D)I", "Ljava/lang/Math;.getExponent:(F)I", "Ljava/lang/Math;.hypot:(DD)D", "Ljava/lang/Math;.log:(D)D", "Ljava/lang/Math;.log10:(D)D", "Ljava/lang/Math;.log1p:(D)D", "Ljava/lang/Math;.max:(II)I", "Ljava/lang/Math;.max:(JJ)J", "Ljava/lang/Math;.max:(FF)F", "Ljava/lang/Math;.max:(DD)D", "Ljava/lang/Math;.min:(FF)F", "Ljava/lang/Math;.min:(DD)D", "Ljava/lang/Math;.min:(II)I", "Ljava/lang/Math;.min:(JJ)J", "Ljava/lang/Math;.nextAfter:(DD)D", "Ljava/lang/Math;.nextAfter:(FD)F", "Ljava/lang/Math;.nextDown:(D)D", "Ljava/lang/Math;.nextDown:(F)F", "Ljava/lang/Math;.nextUp:(F)F", "Ljava/lang/Math;.nextUp:(D)D", "Ljava/lang/Math;.pow:(DD)D", "Ljava/lang/Math;.random:()D", "Ljava/lang/Math;.rint:(D)D", "Ljava/lang/Math;.round:(D)J", "Ljava/lang/Math;.round:(F)I", "Ljava/lang/Math;.scalb:(FI)F", "Ljava/lang/Math;.scalb:(DI)D", "Ljava/lang/Math;.signum:(D)D", "Ljava/lang/Math;.signum:(F)F", "Ljava/lang/Math;.sin:(D)D", "Ljava/lang/Math;.sinh:(D)D", "Ljava/lang/Math;.sqrt:(D)D", "Ljava/lang/Math;.tan:(D)D", "Ljava/lang/Math;.tanh:(D)D", "Ljava/lang/Math;.toDegrees:(D)D", "Ljava/lang/Math;.toRadians:(D)D", "Ljava/lang/Math;.ulp:(D)D", "Ljava/lang/Math;.ulp:(F)F", "Ljava/lang/Object;.getClass:()Ljava/lang/Class;", "Ljava/lang/Short;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/Short;.shortValue:()S", "Ljava/lang/Short;.toString:(S)Ljava/lang/String;", "Ljava/lang/Short;.valueOf:(S)Ljava/lang/Short;", "Ljava/lang/String;.compareTo:(Ljava/lang/String;)I", "Ljava/lang/String;.compareToIgnoreCase:(Ljava/lang/String;)I", "Ljava/lang/String;.concat:(Ljava/lang/String;)Ljava/lang/String;", "Ljava/lang/String;.endsWith:(Ljava/lang/String;)Z", "Ljava/lang/String;.equals:(Ljava/lang/Object;)Z", "Ljava/lang/String;.equalsIgnoreCase:(Ljava/lang/String;)Z", "Ljava/lang/String;.hashCode:()I", "Ljava/lang/String;.indexOf:(I)I", "Ljava/lang/String;.isEmpty:()Z", "Ljava/lang/String;.indexOf:(Ljava/lang/String;)I", "Ljava/lang/String;.indexOf:(II)I", "Ljava/lang/String;.indexOf:(Ljava/lang/String;I)I", "Ljava/lang/String;.lastIndexOf:(I)I", "Ljava/lang/String;.lastIndexOf:(II)I", "Ljava/lang/String;.lastIndexOf:(Ljava/lang/String;)I", "Ljava/lang/String;.lastIndexOf:(Ljava/lang/String;I)I", "Ljava/lang/String;.length:()I", "Ljava/lang/String;.replace:(CC)Ljava/lang/String;", "Ljava/lang/String;.startsWith:(Ljava/lang/String;)Z", "Ljava/lang/String;.startsWith:(Ljava/lang/String;I)Z", "Ljava/lang/String;.toLowerCase:()Ljava/lang/String;", "Ljava/lang/String;.toLowerCase:(Ljava/util/Locale;)Ljava/lang/String;", "Ljava/lang/String;.toString:()Ljava/lang/String;", "Ljava/lang/String;.toUpperCase:()Ljava/lang/String;", "Ljava/lang/String;.toUpperCase:(Ljava/util/Locale;)Ljava/lang/String;", "Ljava/lang/String;.trim:()Ljava/lang/String;", "Ljava/lang/String;.valueOf:(C)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(D)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(F)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(I)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(J)Ljava/lang/String;", "Ljava/lang/String;.valueOf:(Z)Ljava/lang/String;", "Ljava/lang/System;.identityHashCode:(Ljava/lang/Object;)I", "Ljava/lang/Thread;.currentThread:()Ljava/lang/Thread;", }; std::unordered_set<DexMethodRef*> get_pure_methods() { std::unordered_set<DexMethodRef*> pure_methods; for (auto const pure_method_name : pure_method_names) { auto method_ref = DexMethod::get_method(pure_method_name); if (method_ref == nullptr) { TRACE(CSE, 1, "[get_pure_methods]: Could not find pure method %s", str_copy(pure_method_name).c_str()); continue; } pure_methods.insert(method_ref); } return pure_methods; } std::unordered_set<DexMethod*> get_immutable_getters(const Scope& scope) { std::unordered_set<DexMethod*> pure_methods; walk::methods(scope, [&](DexMethod* method) { if (method->rstate.immutable_getter()) { pure_methods.insert(method); } }); return pure_methods; } namespace { MethodOverrideAction get_base_or_overriding_method_action_impl( const DexMethod* method, const std::unordered_set<const DexMethod*>* methods_to_ignore, bool ignore_methods_with_assumenosideeffects) { if (method == nullptr || method::is_clinit(method) || method->rstate.no_optimizations()) { return MethodOverrideAction::UNKNOWN; } if ((method->is_virtual() && is_interface(type_class(method->get_class()))) && (root(method) || !can_rename(method))) { // We cannot rule out that there are dynamically added classes, created via // Proxy.newProxyInstance, that override this method. // So we assume the worst. return MethodOverrideAction::UNKNOWN; } if (methods_to_ignore && methods_to_ignore->count(method)) { return MethodOverrideAction::EXCLUDE; } if (ignore_methods_with_assumenosideeffects && assumenosideeffects(method)) { return MethodOverrideAction::EXCLUDE; } if (method->is_external() || is_native(method)) { return MethodOverrideAction::UNKNOWN; } if (is_abstract(method)) { return MethodOverrideAction::EXCLUDE; } return MethodOverrideAction::INCLUDE; } } // namespace MethodOverrideAction get_base_or_overriding_method_action( const DexMethod* method, const std::unordered_set<const DexMethod*>* methods_to_ignore, bool ignore_methods_with_assumenosideeffects) { return get_base_or_overriding_method_action_impl( method, methods_to_ignore, ignore_methods_with_assumenosideeffects); } namespace { template <typename HandlerFunc> bool process_base_and_overriding_methods_impl( const method_override_graph::Graph* method_override_graph, const DexMethod* method, const std::unordered_set<const DexMethod*>* methods_to_ignore, bool ignore_methods_with_assumenosideeffects, const HandlerFunc& handler_func) { auto action = get_base_or_overriding_method_action_impl( method, methods_to_ignore, ignore_methods_with_assumenosideeffects); if (action == MethodOverrideAction::UNKNOWN || (action == MethodOverrideAction::INCLUDE && !handler_func(const_cast<DexMethod*>(method)))) { return false; } // When the method isn't virtual, there are no overriden methods to consider. if (!method->is_virtual()) { return true; } // But even if there are overriden methods, don't look further when the // method is to be ignored. if (methods_to_ignore && methods_to_ignore->count(method)) { return true; } if (ignore_methods_with_assumenosideeffects && assumenosideeffects(method)) { return true; } // When we don't have a method-override graph, let's be conservative and give // up. if (!method_override_graph) { return false; } // Okay, let's process all overridden methods just like the base method. return method_override_graph::all_overriding_methods( *method_override_graph, method, [&](const DexMethod* overriding_method) { action = get_base_or_overriding_method_action( overriding_method, methods_to_ignore, ignore_methods_with_assumenosideeffects); if (action == MethodOverrideAction::UNKNOWN || (action == MethodOverrideAction::INCLUDE && !handler_func(const_cast<DexMethod*>(overriding_method)))) { return false; } return true; }); return true; } } // namespace bool process_base_and_overriding_methods( const method_override_graph::Graph* method_override_graph, const DexMethod* method, const std::unordered_set<const DexMethod*>* methods_to_ignore, bool ignore_methods_with_assumenosideeffects, const std::function<bool(DexMethod*)>& handler_func) { return process_base_and_overriding_methods_impl( method_override_graph, method, methods_to_ignore, ignore_methods_with_assumenosideeffects, handler_func); } namespace { AccumulatingTimer s_wto_timer("compute_locations_closure_wto"); class WtoOrdering { static constexpr const DexMethod* WTO_ROOT = nullptr; struct FirstIterationData { std::vector<const DexMethod*> root_cache; std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>& inverse_dependencies; const std::vector<const DexMethod*> empty{}; const std::vector<const DexMethod*>& get(const DexMethod* m) { if (m == WTO_ROOT) { // Pre-initialized and pre-sorted return root_cache; } auto it = inverse_dependencies.find(m); if (it != inverse_dependencies.end()) { // Pre-sorted return it->second; } return empty; } }; static FirstIterationData create_first_iteration_data( std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>& inverse_dependencies, const std::unordered_set<const DexMethod*>& impacted_methods) { std::vector<const DexMethod*> wto_nodes{WTO_ROOT}; wto_nodes.reserve(wto_nodes.size() + impacted_methods.size()); wto_nodes.insert(wto_nodes.end(), impacted_methods.begin(), impacted_methods.end()); // In the first iteration, besides computing the sorted root successors, we // also sort all inverse_dependencies entries in-place. They represent the // full successor vectors. std::vector<const DexMethod*> root_cache; workqueue_run<const DexMethod*>( [&inverse_dependencies, &root_cache, &impacted_methods](const DexMethod* m) { if (m == WTO_ROOT) { root_cache = get_sorted_impacted_methods(impacted_methods); return; } auto it = inverse_dependencies.find(m); if (it != inverse_dependencies.end()) { auto& entries = it->second; entries.shrink_to_fit(); std::sort(entries.begin(), entries.end(), compare_dexmethods); } }, wto_nodes); return {std::move(root_cache), inverse_dependencies}; } struct OtherIterationData { InsertOnlyConcurrentMap<const DexMethod*, std::vector<const DexMethod*>> concurrent_cache; const std::vector<const DexMethod*>& get(const DexMethod* const& m) { return concurrent_cache.at_unsafe(m); } }; static OtherIterationData create_other_iteration_data( std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>& inverse_dependencies, const std::unordered_set<const DexMethod*>& impacted_methods) { std::vector<const DexMethod*> wto_nodes{WTO_ROOT}; wto_nodes.reserve(wto_nodes.size() + impacted_methods.size()); wto_nodes.insert(wto_nodes.end(), impacted_methods.begin(), impacted_methods.end()); // In subsequent iteration, besides computing the sorted root successors // again, we also filter all previously sorted inverse_dependencies entries. InsertOnlyConcurrentMap<const DexMethod*, std::vector<const DexMethod*>> concurrent_cache; workqueue_run<const DexMethod*>( [&impacted_methods, &concurrent_cache, &inverse_dependencies](const DexMethod* m) { std::vector<const DexMethod*> successors; if (m == WTO_ROOT) { // Re-initialize and re-sort successors = get_sorted_impacted_methods(impacted_methods); } auto it = inverse_dependencies.find(m); if (it != inverse_dependencies.end()) { // Note that we are filtering on an already pre-sorted vector for (auto n : it->second) { if (impacted_methods.count(n)) { successors.push_back(n); } } } auto [_, emplaced] = concurrent_cache.emplace(m, std::move(successors)); always_assert(emplaced); }, wto_nodes); return {std::move(concurrent_cache)}; } static std::vector<const DexMethod*> get_sorted_impacted_methods( const std::unordered_set<const DexMethod*>& impacted_methods) { std::vector<const DexMethod*> successors; successors.reserve(impacted_methods.size()); successors.insert(successors.end(), impacted_methods.begin(), impacted_methods.end()); std::sort(successors.begin(), successors.end(), compare_dexmethods); return successors; } static std::vector<const DexMethod*> sort_by_inverse_deps( const std::unordered_set<const DexMethod*>& impacted_methods, const std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>& inverse_dependencies) { // First translate to pair to avoid repeated map lookups. std::vector<std::pair<const DexMethod*, size_t>> sorted_by_inv_deps; sorted_by_inv_deps.reserve(impacted_methods.size()); std::transform(impacted_methods.begin(), impacted_methods.end(), std::back_inserter(sorted_by_inv_deps), [&inverse_dependencies](auto* m) { auto it = inverse_dependencies.find(m); return std::make_pair(m, it != inverse_dependencies.end() ? it->second.size() : 0); }); std::sort(sorted_by_inv_deps.begin(), sorted_by_inv_deps.end(), [](const std::pair<const DexMethod*, size_t>& lhs, const std::pair<const DexMethod*, size_t>& rhs) { if (lhs.second != rhs.second) { return lhs.second > rhs.second; } return compare_dexmethods(lhs.first, rhs.first); }); std::vector<const DexMethod*> res; res.reserve(impacted_methods.size()); std::transform(sorted_by_inv_deps.begin(), sorted_by_inv_deps.end(), std::back_inserter(res), [](const auto& p) { return p.first; }); return res; } // We saw big slowdowns when there are too many components, possibly // driven by the fact there is a lot of dependencies. template <typename SuccFn> static void run_wto(const SuccFn& succ_fn, std::vector<const DexMethod*>& ordered_impacted_methods) { sparta::WeakTopologicalOrdering<const DexMethod*> wto(WTO_ROOT, succ_fn); wto.visit_depth_first([&ordered_impacted_methods](const DexMethod* m) { if (m) { ordered_impacted_methods.push_back(m); } }); } static bool should_use_wto( const std::unordered_set<const DexMethod*>& impacted_methods, const std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>& inverse_dependencies) { size_t impacted_methods_size = impacted_methods.size(); size_t inv_dep_sum{0}, inv_dep_max{0}; for (auto& entry : inverse_dependencies) { inv_dep_sum += entry.second.size(); inv_dep_max = std::max(inv_dep_max, entry.second.size()); } auto inv_dep_avg = ((double)inv_dep_sum) / inverse_dependencies.size(); // Purity is too low-level for nice configuration switches. Think // about it. TRACE(CSE, 4, "UseWto: impacted methods = %zu inverse_deps_max = %zu " "inverse_deps avg = %.2f", impacted_methods_size, inv_dep_max, inv_dep_avg); return inv_dep_avg < kWtoOrderingThreshold; } public: static std::vector<const DexMethod*> order_impacted_methods( const std::unordered_set<const DexMethod*>& impacted_methods, std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>& inverse_dependencies, size_t iterations) { Timer prepare_wto{"Prepare Ordering"}; auto wto_timer_scope = s_wto_timer.scope(); std::vector<const DexMethod*> ordered_impacted_methods; // To avoid std::function overhead we have to split here. if (iterations == 1 && should_use_wto(impacted_methods, inverse_dependencies)) { auto first_data = create_first_iteration_data(inverse_dependencies, impacted_methods); run_wto( [&first_data]( const DexMethod* m) -> const std::vector<const DexMethod*>& { return first_data.get(m); }, ordered_impacted_methods); } else if (iterations == 1) { // Simple sorting for determinism. ordered_impacted_methods = sort_by_inverse_deps(impacted_methods, inverse_dependencies); } else { auto other_data = create_other_iteration_data(inverse_dependencies, impacted_methods); run_wto( [&other_data]( const DexMethod* m) -> const std::vector<const DexMethod*>& { return other_data.get(m); }, ordered_impacted_methods); } return ordered_impacted_methods; } }; template <typename InitFuncT> size_t compute_locations_closure_impl( const Scope& scope, const method_override_graph::Graph* method_override_graph, const InitFuncT& init_func, std::unordered_map<const DexMethod*, CseUnorderedLocationSet>* result) { // 1. Let's initialize known method read locations and dependencies by // scanning method bodies InsertOnlyConcurrentMap<const DexMethod*, LocationsAndDependencies> method_lads; { Timer t{"Initialize LADS"}; walk::parallel::methods(scope, [&](DexMethod* method) { auto lads = init_func(method); if (lads) { method_lads.emplace(method, std::move(*lads)); } }); } // 2. Compute inverse dependencies so that we know what needs to be recomputed // during the fixpoint computation, and determine set of methods that are // initially "impacted" in the sense that they have dependencies. std::unordered_map<const DexMethod*, std::vector<const DexMethod*>> inverse_dependencies; std::unordered_set<const DexMethod*> impacted_methods; { Timer t{"Compute inverse dependencies"}; for (auto&& [method, lads] : method_lads) { if (!lads.dependencies.empty()) { for (auto d : lads.dependencies) { inverse_dependencies[d].push_back(method); } impacted_methods.insert(method); } } } // 3. Let's try to (semantically) inline locations, computing a fixed // point. Methods for which information is directly or indirectly absent // are equivalent to a general memory barrier, and are systematically // pruned. // TODO: Instead of custom fixpoint computation using WTO, consider using the // MonotonicFixpointIterator, operating on a callgraph, capture the // dependencies, and have the Locations as the abstract domain. size_t iterations = 0; while (!impacted_methods.empty()) { iterations++; Timer t{std::string("Iteration ") + std::to_string(iterations)}; // We order the impacted methods in a deterministic way that's likely // helping to reduce the number of needed iterations. auto ordered_impacted_methods = WtoOrdering::order_impacted_methods( impacted_methods, inverse_dependencies, iterations); impacted_methods.clear(); std::vector<const DexMethod*> changed_methods; for (const DexMethod* method : ordered_impacted_methods) { auto& lads = method_lads.at_unsafe(method); bool unknown = false; size_t lads_locations_size = lads.locations.size(); for (const DexMethod* d : lads.dependencies) { if (d == method) { continue; } auto it = method_lads.find(d); if (it == method_lads.end()) { unknown = true; break; } const auto& other_locations = it->second.locations; lads.locations.insert(other_locations.begin(), other_locations.end()); } if (unknown || lads_locations_size < lads.locations.size()) { // something changed changed_methods.push_back(method); if (unknown) { method_lads.erase_unsafe(method); } } } // Given set of changed methods, determine set of dependents for which // we need to re-run the analysis in another iteration. for (auto changed_method : changed_methods) { auto it = inverse_dependencies.find(changed_method); if (it == inverse_dependencies.end()) { continue; } // remove inverse dependency entries as appropriate auto& entries = it->second; std20::erase_if(entries, [&](auto* m) { return !method_lads.count_unsafe(m); }); if (entries.empty()) { // remove inverse dependency inverse_dependencies.erase(changed_method); } else { // add inverse dependencies entries to impacted methods impacted_methods.insert(entries.begin(), entries.end()); } } } // For all methods which have a known set of locations at this point, // persist that information for (auto&& [method, lads] : method_lads) { result->emplace(method, std::move(lads.locations)); } return iterations; } } // namespace size_t compute_locations_closure( const Scope& scope, const method_override_graph::Graph* method_override_graph, const std::function<boost::optional<LocationsAndDependencies>(DexMethod*)>& init_func, std::unordered_map<const DexMethod*, CseUnorderedLocationSet>* result) { return compute_locations_closure_impl(scope, method_override_graph, init_func, result); } // Helper function that invokes compute_locations_closure, providing initial // set of locations indicating whether a function only reads locations (and // doesn't write). Via additional flags it can be selected whether... // - [ignore_methods_with_assumenosideeffects] to ignore invoked methods that // are marked with assumenosideeffects // - [for_conditional_purity] instructions that rule out conditional purity // should cause methods to be treated like methods with unknown behavior; in // particular, this rules out instructions that create new object instances, // as those may leak, and thus multiple invocations of such a method could // never be reduced by CSE. // - [compute_locations] the actual locations that are being read are computed // and returned; if false, then an empty set indicates that a particular // function only reads (some unknown set of) locations. static size_t analyze_read_locations( const Scope& scope, const method_override_graph::Graph* method_override_graph, const method::ClInitHasNoSideEffectsPredicate& clinit_has_no_side_effects, const std::unordered_set<DexMethodRef*>& pure_methods, bool ignore_methods_with_assumenosideeffects, bool for_conditional_purity, bool compute_locations, std::unordered_map<const DexMethod*, CseUnorderedLocationSet>* result) { std::unordered_set<const DexMethod*> pure_methods_closure; { Timer t{"Pure methods closure"}; for (auto pure_method_ref : pure_methods) { auto pure_method = pure_method_ref->as_def(); if (pure_method == nullptr) { continue; } pure_methods_closure.insert(pure_method); if (pure_method->is_virtual() && method_override_graph) { const auto overriding_methods = method_override_graph::get_overriding_methods( *method_override_graph, pure_method); pure_methods_closure.insert(overriding_methods.begin(), overriding_methods.end()); } } } return compute_locations_closure_impl( scope, method_override_graph, [&](DexMethod* method) -> boost::optional<LocationsAndDependencies> { auto action = get_base_or_overriding_method_action_impl( method, &pure_methods_closure, ignore_methods_with_assumenosideeffects); if (action == MethodOverrideAction::UNKNOWN) { return boost::none; } LocationsAndDependencies lads; if (!process_base_and_overriding_methods_impl( method_override_graph, method, &pure_methods_closure, ignore_methods_with_assumenosideeffects, [&](DexMethod* other_method) { if (other_method != method) { lads.dependencies.insert(other_method); } return true; })) { return boost::none; } if (action == MethodOverrideAction::EXCLUDE) { return lads; } bool unknown = false; editable_cfg_adapter::iterate_with_iterator( method->get_code(), [&](const IRList::iterator& it) { auto insn = it->insn; auto opcode = insn->opcode(); switch (opcode) { case OPCODE_MONITOR_ENTER: case OPCODE_MONITOR_EXIT: case OPCODE_FILL_ARRAY_DATA: case OPCODE_THROW: unknown = true; break; case IOPCODE_INIT_CLASS: unknown = true; break; case OPCODE_NEW_INSTANCE: if (for_conditional_purity || !clinit_has_no_side_effects(insn->get_type())) { unknown = true; } break; case OPCODE_NEW_ARRAY: case OPCODE_FILLED_NEW_ARRAY: if (for_conditional_purity) { unknown = true; } break; case OPCODE_INVOKE_SUPER: // TODO: Support properly. unknown = true; break; default: if (opcode::is_an_aput(opcode) || opcode::is_an_iput(opcode) || opcode::is_an_sput(opcode)) { unknown = true; } else if (opcode::is_an_aget(opcode) || opcode::is_an_iget(opcode) || opcode::is_an_sget(opcode)) { auto location = get_read_location(insn); if (location == CseLocation( CseSpecialLocations::GENERAL_MEMORY_BARRIER)) { unknown = true; } else { if (opcode::is_an_sget(opcode) && (!clinit_has_no_side_effects( location.get_field()->get_class()))) { unknown = true; } else if (compute_locations) { lads.locations.insert(location); } } } else if (opcode::is_an_invoke(opcode)) { auto invoke_method = resolve_method( insn->get_method(), opcode_to_search(opcode), method); if ((invoke_method && opcode::is_invoke_static(opcode) && (!clinit_has_no_side_effects( invoke_method->get_class()))) || !process_base_and_overriding_methods_impl( method_override_graph, invoke_method, &pure_methods_closure, ignore_methods_with_assumenosideeffects, [&](DexMethod* other_method) { if (other_method != method) { lads.dependencies.insert(other_method); } return true; })) { unknown = true; } } break; } return unknown ? editable_cfg_adapter::LOOP_BREAK : editable_cfg_adapter::LOOP_CONTINUE; }); if (unknown) { return boost::none; } return lads; }, result); } size_t compute_conditionally_pure_methods( const Scope& scope, const method_override_graph::Graph* method_override_graph, const method::ClInitHasNoSideEffectsPredicate& clinit_has_no_side_effects, const std::unordered_set<DexMethodRef*>& pure_methods, std::unordered_map<const DexMethod*, CseUnorderedLocationSet>* result) { Timer t("compute_conditionally_pure_methods"); auto iterations = analyze_read_locations( scope, method_override_graph, clinit_has_no_side_effects, pure_methods, /* ignore_methods_with_assumenosideeffects */ false, /* for_conditional_purity */ true, /* compute_locations */ true, result); for (auto& p : *result) { TRACE(CSE, 4, "[CSE] conditionally pure method %s: %s", SHOW(p.first), SHOW(&p.second)); } return iterations; } size_t compute_no_side_effects_methods( const Scope& scope, const method_override_graph::Graph* method_override_graph, const method::ClInitHasNoSideEffectsPredicate& clinit_has_no_side_effects, const std::unordered_set<DexMethodRef*>& pure_methods, std::unordered_set<const DexMethod*>* result) { Timer t("compute_no_side_effects_methods"); std::unordered_map<const DexMethod*, CseUnorderedLocationSet> method_locations; auto iterations = analyze_read_locations( scope, method_override_graph, clinit_has_no_side_effects, pure_methods, /* ignore_methods_with_assumenosideeffects */ true, /* for_conditional_purity */ false, /* compute_locations */ false, &method_locations); for (auto& p : method_locations) { TRACE(CSE, 4, "[CSE] no side effects method %s", SHOW(p.first)); result->insert(p.first); } return iterations; } bool has_implementor(const method_override_graph::Graph* method_override_graph, const DexMethod* method) { // For methods of an annotation interface, a synthetic trivial implementation // is generated by the runtime. if (is_annotation(type_class(method->get_class()))) { return true; } bool found_implementor = false; auto res = process_base_and_overriding_methods_impl( method_override_graph, method, /* methods_to_ignore */ nullptr, /* ignore_methods_with_assumenosideeffects */ false, [&](DexMethod*) { found_implementor = true; return true; }); return !res || found_implementor; } ```

Malvarosa is a 1958 Filipino crime drama film directed by Dr. Gregorio Fernandez and written by Clodualdo del Mundo and Consuelo P. Osorio for LVN Pictures. It is based on a comics serial of the same name written by Clodualdo del Mundo in Espesyal Komiks and tells the story of a poverty-stricken nuclear family living in the nearby railroad tracks who carry their own burdens that needed to resolved. The film stars Charito Solis, Vic Silayan, Carlos Padilla Jr., Vic Diaz, Rey Ruiz, and Eddie Rodriguez as the children of Sinforosa (Rebecca del Rio) and Leroy Salvador as Rosa's fiancé. Plot Rosa, a beautiful young woman, lives in the slums situated at the nearby railroad tracks with her mother and five older brothers. By the time her alcoholic father died in a train accident, her mother Sinforosa felt guilt and depression as she became widowed. A few years later, she is going to marry his fiancé Candido but she has to deal the problems first that their family faced in spite of poverty especially Rosa's brothers who also carry their own burdens in which made Rosa stressed to have a solution as well as their confrontations. It would also tell the lives of Melanio, the eldest and an obnoxious womanizer; followed by Alberto, a man with a mean reputation to his family; Leonides, a violent man who became notorious for his crimes throughout the neighborhood; Vedasto, a scheming man whom he persuaded his sister to work with a wealthy man; and lastly, Avelino, a patient and responsible man whom he trusts his sister to eliminate their family's burden. Rosa would also witness some of the misfortunes happened in their family. Cast Charito Solis as Rosa Vic Silayan as Melanio Carlos Padilla Jr. as Alberto Vic Diaz as Leonides Rey Ruiz as Vedasto Eddie Rodriguez as Avelino Leroy Salvador as Candido Rebecca del Rio as Sinforosa Linda Roxas as Miling Johnny Reyes as Tony Priscilla Ramirez as Aling Ipang Ramon Olmos as Damian Nita Ramos as Linda Caridad Sanchez as Melanio's Woman #1 Perla Bautista as Melanio's Woman #2 Production During the shooting of the film, the director and its staff cooperated with the Philippine Constabulary and the Manila Railroad Company for their participation in the important scenes of the film as well as their permission to their facilities and staff. Analysis Malvarosa, released in 1958, concerns a large nuclear family aspiring to recover from the devastation wrought by World War II, when both the retreating Japanese occupiers and the advancing American re-occupiers dropped so many bombs, set so many fires, and killed so many civilians that, after Hiroshima and Nagasaki, Manila was one of the most devastated cities in the world at that point, traditionally regarded as comparable in its misery to Warsaw. The country was in such dire straits that, when the American government insisted on setting up military bases and implementing parity rights as preconditions for financial aid, the Filipinos had no choice but to acquiesce. Release The film was released on May 19, 1958, at the Dalisay Theatre in Manila, Philippines. Digital restoration The film was restored by ABS-CBN Film Restoration Project, using the equipment of the film archives division. The restoration began with a digital scanning of frames in 4K resolution with the use of the 35mm print from the collection of LVN Pictures' library that were stored at the basement of ABS-CBN's corporate headquarters, ELJ Communications Center, in Diliman, Quezon City. After the scanning, it was restored in 2K resolution and took 80 hours to eliminate the image impairments including scratches and unstable images as well as color adjustments in order to make it very identical to its original brightness and contrast. The digitally scanned and restored 4K version was premiered on October 17, 2019, at the Gateway Mall - Cinema 7 as part of the QCinema International Film Festival 2019. It was attended by Caridad Sanchez and the representatives of the film's cast and crew including screenwriter Clodualdo "Doy" del Mundo Jr. (representing his father), actor Rap Fernandez (representing his grandfather), Jesus Hofileña (representing Vic Silayan), and actress-singer Zsa Zsa Padilla and her daughter Zia Quizon (representing their father and grandfather, respectively). The 4K digital scan of the film was streamed online on December 1, 2020, through ABS-CBN Film Restoration's Facebook page. Notes References External links 1958 films 1958 crime drama films Philippine drama films Tagalog-language films Films directed by Gregorio Fernandez

Wilmans Peaks is a mountain summit, in Snohomish County of Washington state. Description The Wilmans Peaks are located in the North Cascades, six miles southeast of Barlow Pass on the Mountain Loop Highway, and immediately southeast above the historic Monte Cristo area. The mountain is situated within the Henry M. Jackson Wilderness, on land managed by the Mount Baker-Snoqualmie National Forest. Wilmans Peaks has two main peaks and three associated spires. Topographic relief is significant as the summit rises over above Monte Cristo in one mile. Precipitation runoff from the mountain drains into tributaries of the South Fork Sauk River. History This landform was originally named Wilmon Peak in 1918, but the toponym was officially revised in 1973 to its present spelling. It was named for John McDonald Wilmans (1858–1916), a Californian who owned one-third interest in the mining claims of the Monte Cristo area around 1890. He also managed and owned controlling interest in the railroad that was built to serve Monte Cristo. The first ascent of the summit was made September 12, 1970, by Dallas Kloke via the northwest ridge and the lower peak was climbed in 1934 by Art Winder and Ben Spellar. Climate Wilmans Peaks is located in the marine west coast climate zone of western North America. Most weather fronts originate in the Pacific Ocean, and travel northeast toward the Cascade Mountains. As fronts approach the North Cascades, they are forced upward by the peaks of the Cascade Range (Orographic lift), causing them to drop their moisture in the form of rain or snowfall onto the Cascades. As a result, the west side of the North Cascades experiences high precipitation, especially during the winter months in the form of snowfall, and because of maritime influence, snow tends to be wet and heavy, resulting in high avalanche danger. During winter months, weather is usually cloudy, but, due to high pressure systems over the Pacific Ocean that intensify during summer months, there is often little or no cloud cover during the summer. Due to its temperate climate and proximity to the Pacific Ocean, areas west of the Cascade Crest very rarely experience temperatures below or above . The months July through September offer favorable weather for viewing or climbing the peaks. Geology The North Cascades features some of the most rugged topography in the Cascade Range with craggy peaks, ridges, and deep glacial valleys. Geological events occurring many years ago created the diverse topography and drastic elevation changes over the Cascade Range leading to the various climate differences. These climate differences lead to vegetation variety defining the ecoregions in this area. The history of the formation of the Cascade Mountains dates back millions of years ago to the late Eocene Epoch. With the North American Plate overriding the Pacific Plate, episodes of volcanic igneous activity persisted. Glacier Peak, a stratovolcano which is northeast of Wilmans Peaks, began forming in the mid-Pleistocene. In addition, small fragments of the oceanic and continental lithosphere called terranes created the North Cascades about 50 million years ago. During the Pleistocene period dating back over two million years ago, glaciation advancing and retreating repeatedly scoured the landscape leaving deposits of rock debris. The "U"-shaped cross sections of the river valleys are a result of recent glaciation. Uplift and faulting in combination with glaciation have been the dominant processes which have created the tall peaks and deep valleys of the North Cascades area. See also Geography of the North Cascades Geology of the Pacific Northwest References External links Weather: Wilmans Peaks John McDonald Wilmans biography: Google.com/books Wilmans Peaks (photo): Pbase Wilmans Peaks (photo): Flickr Mountains of Washington (state) Mountains of Snohomish County, Washington Cascade Range Mount Baker-Snoqualmie National Forest North Cascades North American 2000 m summits

Tentamun (“she of Amun”) was an ancient Egyptian queen, most likely the wife of Ramesses XI, last ruler of the 20th Dynasty. She is mentioned on the funerary papyrus of her daughter Duathathor-Henuttawy, who was the wife of Pinedjem I and probably the daughter of Ramesses XI. Tentamun's name is written in a cartouche. Family A man named Nebseni is mentioned as her father on the funerary papyrus of her daughter. He was probably buried in the Theban tomb TT320. Her children are: Duathathor-Henuttawy, who was the wife of Pinedjem I Another possible daughter is Tentamun, the wife of Smendes. References 12th-century BC Egyptian women 11th-century BC Egyptian women Queens consort of the Twentieth Dynasty of Egypt Ramesses XI

WKXH (105.5 FM) is a radio station broadcasting a New Country format. Licensed to St. Johnsbury, Vermont, United States, the station is owned by Vermont Broadcast Associates, Inc. History The station was assigned the call letters WNKV on April 10, 1985; it signed on August 1. On June 6, 1998, the station changed its call sign to the current WKXH. References External links Kix 105.5 WKXH on Facebook KXH Radio stations established in 1985 1985 establishments in Vermont Country radio stations in the United States

The 1972 Virginia Slims of Oklahoma City was a women's tennis tournament played on indoor carpet courts at the Frederickson Field House Arena in Oklahoma City, Oklahoma in the United States that was part of the 1972 WT Pro Tour. It was the second and last edition of the tournament and was held from February 16 through February 19, 1972. Third-seeded Rosie Casals won the singles title and earned $4,000 first-prize money. Finals Singles Rosie Casals defeated Valerie Ziegenfuss 6–4, 6–1 Doubles Rosie Casals / Billie Jean King defeated Judy Dalton / Françoise Dürr 6–7(4–5), 7–6(5–2), 6–2 Prize money References Virginia Slims of Oklahoma City Virginia Slims of Oklahoma City 1972 in sports in Oklahoma

```objective-c #ifndef _DYNAMIC_NEEDLEMANWUNSCH_ #define _DYNAMIC_NEEDLEMANWUNSCH_ #include "Eigen/Core" #include <vector> #include <iostream> #include "basics.h" #ifdef _MSC_VER #include <float.h> // for _isnan() on VC++ #define isnan(x) _isnan(x) // VC++ uses _isnan() instead of isnan() //#else //#include <math.h> // for isnan() everywhere else #endif namespace DynamicProg{ /*! Global alignment cmp: must define an eval function */ template <typename Scalar, class DataType, template <typename, class> class Cmp > class NeedlemanWunsch{ private: Cmp<Scalar, DataType> _cmp; Scalar _gapPenalty; Scalar _confidence; public: typedef typename Eigen::Matrix<DynamicStep<Scalar>, Eigen::Dynamic, Eigen::Dynamic> StepMatrix; public: inline NeedlemanWunsch(): _gapPenalty(-1), _confidence(0) {} inline DynamicStep<Scalar> eval (const DataType& v1, const DataType& v2, unsigned int x, unsigned int y, const StepMatrix& matrix, double multiplier) const; inline Scalar eval_couples (const DataType& v1, const DataType& v2, unsigned int x, unsigned int y, const StepMatrix& matrix, double multiplier) const; inline void setConfidence(double conf); inline void setGapPenalty(Scalar gapPenalty) {_gapPenalty = gapPenalty;} inline Scalar confidence() const { return _confidence;} }; //class NeedlemanWunsch template <typename Scalar, class DataType, template <typename, class> class Cmp > DynamicStep<Scalar> NeedlemanWunsch<Scalar, DataType, Cmp >::eval( const DataType& v1, const DataType& v2, unsigned int x, unsigned int y, const StepMatrix& matrix, double multiplier) const{ //std::cout << "here" << std::endl; DynamicStep<Scalar>nei[3]; // will contain top, left and topleft nei[2] = DynamicStep<Scalar> (matrix(x-1, y-1).value + _cmp.eval(v1, v2), DynamicRelation::TopLeft); return nei[2]; } template <typename Scalar, class DataType, template <typename, class> class Cmp > Scalar NeedlemanWunsch<Scalar, DataType, Cmp >::eval_couples( const DataType& v1, const DataType& v2, unsigned int x, unsigned int y, const StepMatrix& /*matrix*/, double multiplier) const{ return _cmp.eval(v1, v2); } template <typename Scalar, class DataType, template <typename, class> class Cmp > void NeedlemanWunsch<Scalar, DataType, Cmp >::setConfidence(double conf) { _confidence = conf; } } // namespace DynamicProg #endif // _DYNAMIC_PATH ```

Organic chocolate is chocolate which has been certified organic. As of 2016, it was a growing sector in the global chocolate industry. Organic chocolate is a socially-desirable product for some consumers. Major brands, such as The Hershey Company, have begun to produce organic chocolate. Sources Many, if not most, producers of organic chocolate source their ingredients from certified fair trade cocoa farms and cooperatives. Organic chocolate comes in many varieties, including milk chocolate, white chocolate, and dark chocolate. Major brands of organic chocolate include Britain-based Green & Black's, Hershey-owned Dagoba Chocolate, and Equal Exchange. Less-known retailers include Taza Chocolate, Pacari Chocolate, and Sacred Chocolate, a brand noted for producing raw chocolate. Production Process The Seattle-based chocolate maker Theo Chocolate was one of the first companies that were "fair-trade certified" and produced Organic Chocolate. In 2006 Theo Chocolate began their production of organic chocolate, there were no solid guidelines for the manufacturing and they had to get the process and ingredients in the correct measurements. The main ingredient in chocolate, cocoa is going to be found close to the equator and the majority of it is grown in Western Africa. The organic cocoa, the main ingredient in organic chocolate, is sent to the chocolate factor where they arrive in burlap sacks. The cocoa beans are then thoroughly cleaned and foreign objects are removed until just the beans remain. The manufacturer makes sure to use all organic ingredients to ensure that the final product is truly organic. See also Raw chocolate Environmental impact of cocoa production Fair trade cocoa Tropical rainforest conservation Types of chocolate References Environmental certification Environmental conservation Forest conservation Sustainable agriculture

Indian Creek is a partly natural and partly man-made waterway in the city of Miami Beach, Florida, United States. It starts as a man-made canal where Biscayne Bay meets Lincoln Road, and runs along Dade Boulevard, forming the boundary between South Beach and the rest of the city. At 24th street the canal opens into the natural waterway and continues north through the city past Allison Island where it opens into Biscayne Bay, till 71st Street where it merges with Normandy and Tatum Waterways and is no longer called Indian Creek. The barrier island touts only 40 waterfront property parcels arranged around an ultra private 18-hole golf course which is why it is referred to as the Billionaire Bunker. Southbound is named Indian Creek Drive wherever the road runs along the creek. References Miami Beach, Florida Waterways in the United States Canals in Florida Intracoastal Waterway

Admiral Cyril Everard Tower, DSO (3 December 1861 – 20 January 1929) was a Royal Navy officer. References 1861 births 1929 deaths Royal Navy admirals Royal Navy admirals of World War I Companions of the Order of the Bath Place of birth missing Place of death missing Royal Navy personnel of the Anglo-Egyptian War